[{"author":[{"full_name":"Hauschild, Robert","first_name":"Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild"}],"title":"Matlab script for analysis of clone dispersal","doi":"10.15479/AT:ISTA:14926","department":[{"_id":"Bio"}],"date_published":"2024-02-02T00:00:00Z","has_accepted_license":"1","oa":1,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"_id":"14926","date_updated":"2026-08-12T10:00:13Z","license":"https://opensource.org/licenses/MIT","related_material":{"record":[{"id":"15048","relation":"used_in_publication","status":"public"}]},"file":[{"checksum":"df7f358ae19a176cf710c0a802ce31b1","file_size":736,"date_updated":"2024-02-02T14:40:31Z","access_level":"open_access","success":1,"relation":"main_file","file_name":"README.md","content_type":"application/octet-stream","file_id":"14927","creator":"rhauschild","date_created":"2024-02-02T14:40:31Z"},{"content_type":"application/x-zip-compressed","file_id":"14928","creator":"rhauschild","success":1,"relation":"main_file","file_name":"Supplementary_file_1.zip","date_created":"2024-02-02T14:40:31Z","file_size":3543,"checksum":"10194cc11619eccd8f4b24472e465b7f","access_level":"open_access","date_updated":"2024-02-02T14:40:31Z"}],"citation":{"ama":"Hauschild R. Matlab script for analysis of clone dispersal. 2024. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14926\">10.15479/AT:ISTA:14926</a>","chicago":"Hauschild, Robert. “Matlab Script for Analysis of Clone Dispersal.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/AT:ISTA:14926\">https://doi.org/10.15479/AT:ISTA:14926</a>.","mla":"Hauschild, Robert. <i>Matlab Script for Analysis of Clone Dispersal</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14926\">10.15479/AT:ISTA:14926</a>.","short":"R. Hauschild, (2024).","apa":"Hauschild, R. (2024). Matlab script for analysis of clone dispersal. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:14926\">https://doi.org/10.15479/AT:ISTA:14926</a>","ieee":"R. Hauschild, “Matlab script for analysis of clone dispersal.” Institute of Science and Technology Austria, 2024.","ista":"Hauschild R. 2024. Matlab script for analysis of clone dispersal, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:14926\">10.15479/AT:ISTA:14926</a>."},"file_date_updated":"2024-02-02T14:40:31Z","corr_author":"1","year":"2024","month":"02","publisher":"Institute of Science and Technology Austria","fulldoi":"https://doi.org/10.15479/AT:ISTA:14926","date_created":"2024-02-02T14:42:26Z","day":"02","tmp":{"short":"MIT","legal_code_url":"https://opensource.org/licenses/MIT","name":"The MIT License"},"type":"software"},{"citation":{"chicago":"Browning, Timothy D, and Andrew Sutherland. “Data and Code for: Integral Points on Cubic Surfaces: Heuristics and Numerics.” Göttingen Research Online Data, 2024. <a href=\"https://doi.org/10.25625/4FLFH8\">https://doi.org/10.25625/4FLFH8</a>.","mla":"Browning, Timothy D., and Andrew Sutherland. <i>Data and Code for: Integral Points on Cubic Surfaces: Heuristics and Numerics</i>. Göttingen Research Online Data, 2024, doi:<a href=\"https://doi.org/10.25625/4FLFH8\">10.25625/4FLFH8</a>.","ama":"Browning TD, Sutherland A. Data and code for: Integral points on cubic surfaces: heuristics and numerics. 2024. doi:<a href=\"https://doi.org/10.25625/4FLFH8\">10.25625/4FLFH8</a>","ieee":"T. D. Browning and A. Sutherland, “Data and code for: Integral points on cubic surfaces: heuristics and numerics.” Göttingen Research Online Data, 2024.","ista":"Browning TD, Sutherland A. 2024. Data and code for: Integral points on cubic surfaces: heuristics and numerics, Göttingen Research Online Data, <a href=\"https://doi.org/10.25625/4FLFH8\">10.25625/4FLFH8</a>.","short":"T.D. Browning, A. Sutherland, (2024).","apa":"Browning, T. D., &#38; Sutherland, A. (2024). Data and code for: Integral points on cubic surfaces: heuristics and numerics. Göttingen Research Online Data. <a href=\"https://doi.org/10.25625/4FLFH8\">https://doi.org/10.25625/4FLFH8</a>"},"date_updated":"2026-08-12T12:15:33Z","related_material":{"record":[{"id":"20249","relation":"used_in_publication","status":"public"}]},"main_file_link":[{"url":"https://doi.org/10.25625/4FLFH8","open_access":"1"}],"type":"research_data_reference","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"publisher":"Göttingen Research Online Data","year":"2024","month":"07","corr_author":"1","fulldoi":"https://doi.org/10.25625/4FLFH8","day":"22","date_created":"2026-07-02T10:38:53Z","title":"Data and code for: Integral points on cubic surfaces: heuristics and numerics","oa_version":"Published Version","doi":"10.25625/4FLFH8","article_processing_charge":"No","date_published":"2024-07-22T00:00:00Z","department":[{"_id":"TiBr"}],"abstract":[{"text":"Lists of nontrivial integral points on some (families of) cubic surfaces. (2024-07-18)","lang":"eng"}],"author":[{"full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","orcid":"0000-0002-8314-0177","last_name":"Browning"},{"full_name":"Sutherland, Andrew","last_name":"Sutherland","first_name":"Andrew"}],"contributor":[{"orcid":"0000-0001-7302-8256","id":"560601DA-8D36-11E9-A136-7AC1E5697425","first_name":"Florian Alexander","last_name":"Wilsch"}],"_id":"22234","OA_place":"repository","OA_type":"green","ddc":["500"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","status":"public","oa":1},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"arXiv","publication_status":"submitted","OA_type":"green","OA_place":"repository","acknowledged_ssus":[{"_id":"ScienComp"}],"date_published":"2024-03-01T00:00:00Z","title":"Can LLMs separate instructions from data? And what do we even mean by that?","oa_version":"Preprint","article_number":"2403.06833","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"type":"preprint","arxiv":1,"day":"01","date_created":"2025-02-20T10:13:42Z","corr_author":"1","citation":{"chicago":"Zverev, Egor, Sahar Abdelnabi, Soroush Tabesh, Mario Fritz, and Christoph Lampert. “Can LLMs Separate Instructions from Data? And What Do We Even Mean by That?” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2403.06833\">https://doi.org/10.48550/arXiv.2403.06833</a>.","mla":"Zverev, Egor, et al. “Can LLMs Separate Instructions from Data? And What Do We Even Mean by That?” <i>ArXiv</i>, 2403.06833, doi:<a href=\"https://doi.org/10.48550/arXiv.2403.06833\">10.48550/arXiv.2403.06833</a>.","ama":"Zverev E, Abdelnabi S, Tabesh S, Fritz M, Lampert C. Can LLMs separate instructions from data? And what do we even mean by that? <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2403.06833\">10.48550/arXiv.2403.06833</a>","ieee":"E. Zverev, S. Abdelnabi, S. Tabesh, M. Fritz, and C. Lampert, “Can LLMs separate instructions from data? And what do we even mean by that?,” <i>arXiv</i>. .","ista":"Zverev E, Abdelnabi S, Tabesh S, Fritz M, Lampert C. Can LLMs separate instructions from data? And what do we even mean by that? arXiv, 2403.06833.","short":"E. Zverev, S. Abdelnabi, S. Tabesh, M. Fritz, C. Lampert, ArXiv (n.d.).","apa":"Zverev, E., Abdelnabi, S., Tabesh, S., Fritz, M., &#38; Lampert, C. (n.d.). Can LLMs separate instructions from data? And what do we even mean by that? <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2403.06833\">https://doi.org/10.48550/arXiv.2403.06833</a>"},"related_material":{"link":[{"url":" https://github.com/egozverev/Shold-It-Be-Executed-Or-Processed","relation":"software"}]},"acknowledgement":"The authors would like to sincerely thank Juan Rocamonde for valuable feedback to our manuscript. We acknowledge the support from the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp). We thank Dan Alistarh for providing us with computational resources. This work was partially funded by the German Federal Ministry of Education and Research (BMBF) under the grant AIgenCY (16KIS2012) and ELSA – European Lighthouse on Secure and Safe AI funded by the European Union under grant agreement No. 101070617. Views and opinions expressed are however those of the authors only and do not necessarily reflect those of the European Union or European Commission. Neither the European Union nor the European Commission can be held responsible for them.","_id":"19063","has_accepted_license":"1","oa":1,"ddc":["000"],"external_id":{"arxiv":["2403.06833"]},"language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"abstract":[{"lang":"eng","text":"Instruction-tuned Large Language Models (LLMs) show impressive results in numerous practical applications, but they lack essential safety features that are common in other areas of computer science, particularly an explicit separation of instructions and data. This makes them vulnerable to manipulations such as indirect prompt injections and generally unsuitable for safety-critical tasks. Surprisingly, there is currently no established definition or benchmark to quantify this phenomenon. In this work, we close this gap by introducing a formal measure for instruction-data separation and an empirical variant that is calculable from a model's outputs. We also present a new dataset, SEP, that allows estimating the measure for real-world models. Our results on various LLMs show that the problem of instruction-data separation is real: all models fail to achieve high separation, and canonical mitigation techniques, such as prompt engineering and fine-tuning, either fail to substantially improve separation or reduce model utility. The source code and SEP dataset are openly accessible at https://github.com/egozverev/Shold-It-Be-Executed-Or-Processed.\r\n"}],"article_processing_charge":"No","doi":"10.48550/arXiv.2403.06833","author":[{"full_name":"Zverev, Egor","last_name":"Zverev","first_name":"Egor","id":"05162b19-1340-11ed-8f02-fa94e0e8c3bc"},{"full_name":"Abdelnabi, Sahar","first_name":"Sahar","last_name":"Abdelnabi"},{"full_name":"Tabesh, Soroush","first_name":"Soroush","orcid":"0009-0003-4119-6281","id":"06000900-6068-11ef-8d61-c2472ef2e752","last_name":"Tabesh"},{"last_name":"Fritz","first_name":"Mario","full_name":"Fritz, Mario"},{"full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"fulldoi":"https://doi.org/10.48550/arXiv.2403.06833","year":"2024","month":"03","file_date_updated":"2025-02-20T10:11:45Z","file":[{"file_size":530972,"checksum":"35eb43968684b87be59144603ef10af0","access_level":"open_access","date_updated":"2025-02-20T10:11:45Z","success":1,"relation":"main_file","file_name":"2403.06833v3.pdf","content_type":"application/pdf","creator":"ezverev","file_id":"19064","date_created":"2025-02-20T10:11:45Z"}],"date_updated":"2026-08-13T07:26:54Z"},{"date_created":"2024-03-08T15:28:10Z","day":"08","corr_author":"1","type":"dissertation","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"related_material":{"record":[{"id":"15091","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"15090"},{"status":"public","relation":"part_of_dissertation","id":"15093"},{"status":"public","id":"13182","relation":"part_of_dissertation"},{"id":"11658","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"11660","relation":"part_of_dissertation"}]},"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","citation":{"ista":"Cultrera di Montesano S. 2024. Persistence and Morse theory for discrete geometric structures. Institute of Science and Technology Austria.","ieee":"S. Cultrera di Montesano, “Persistence and Morse theory for discrete geometric structures,” Institute of Science and Technology Austria, 2024.","apa":"Cultrera di Montesano, S. (2024). <i>Persistence and Morse theory for discrete geometric structures</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:15094\">https://doi.org/10.15479/at:ista:15094</a>","short":"S. Cultrera di Montesano, Persistence and Morse Theory for Discrete Geometric Structures, Institute of Science and Technology Austria, 2024.","mla":"Cultrera di Montesano, Sebastiano. <i>Persistence and Morse Theory for Discrete Geometric Structures</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:15094\">10.15479/at:ista:15094</a>.","chicago":"Cultrera di Montesano, Sebastiano. “Persistence and Morse Theory for Discrete Geometric Structures.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:15094\">https://doi.org/10.15479/at:ista:15094</a>.","ama":"Cultrera di Montesano S. Persistence and Morse theory for discrete geometric structures. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:15094\">10.15479/at:ista:15094</a>"},"project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"name":"Mathematics, Computer Science","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Persistent Homology, Algorithms and Stochastic Geometry","grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","OA_place":"publisher","publication_identifier":{"issn":["2663-337X"]},"date_published":"2024-03-08T00:00:00Z","ec_funded":1,"degree_awarded":"PhD","title":"Persistence and Morse theory for discrete geometric structures","oa_version":"Published Version","fulldoi":"https://doi.org/10.15479/at:ista:15094","alternative_title":["ISTA Thesis"],"year":"2024","publisher":"Institute of Science and Technology Austria","month":"03","date_updated":"2026-08-13T09:41:57Z","file_date_updated":"2024-03-14T14:14:35Z","file":[{"date_created":"2024-03-14T08:55:07Z","content_type":"application/pdf","file_id":"15112","creator":"scultrer","success":1,"file_name":"Thesis Sebastiano.pdf","relation":"main_file","date_updated":"2024-03-14T08:55:07Z","access_level":"open_access","file_size":4106872,"checksum":"1e468bfa42a7dcf04d89f4dadc621c87"},{"file_name":"Thesis (1).zip","relation":"source_file","content_type":"application/zip","creator":"scultrer","file_id":"15113","date_created":"2024-03-14T08:56:24Z","file_size":4746234,"checksum":"bcbd213490f5a7e68855a092bbce93f1","access_level":"closed","date_updated":"2024-03-14T14:14:35Z"}],"ddc":["514","500","516"],"oa":1,"has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"15094","supervisor":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"}],"author":[{"full_name":"Cultrera di Montesano, Sebastiano","last_name":"Cultrera di Montesano","first_name":"Sebastiano","orcid":"0000-0001-6249-0832","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87"}],"page":"108","article_processing_charge":"No","abstract":[{"text":"Point sets, geometric networks, and arrangements of hyperplanes are fundamental objects in\r\ndiscrete geometry that have captivated mathematicians for centuries, if not millennia. This\r\nthesis seeks to cast new light on these structures by illustrating specific instances where a\r\ntopological perspective, specifically through discrete Morse theory and persistent homology,\r\nprovides valuable insights.\r\n\r\nAt first glance, the topology of these geometric objects might seem uneventful: point sets\r\nessentially lack of topology, arrangements of hyperplanes are a decomposition of Rd, which\r\nis a contractible space, and the topology of a network primarily involves the enumeration\r\nof connected components and cycles within the network. However, beneath this apparent\r\nsimplicity, there lies an array of intriguing structures, a small subset of which will be uncovered\r\nin this thesis.\r\n\r\nFocused on three case studies, each addressing one of the mentioned objects, this work\r\nwill showcase connections that intertwine topology with diverse fields such as combinatorial\r\ngeometry, algorithms and data structures, and emerging applications like spatial biology.\r\n\r\n","lang":"eng"}],"department":[{"_id":"GradSch"},{"_id":"HeEd"}],"doi":"10.15479/at:ista:15094"},{"_id":"13182","external_id":{"pmid":["39678706"]},"language":[{"iso":"eng"}],"intvolume":"         8","oa":1,"has_accepted_license":"1","ddc":["000"],"doi":"10.1007/s41468-023-00126-9","abstract":[{"text":"We characterize critical points of 1-dimensional maps paired in persistent homology\r\ngeometrically and this way get elementary proofs of theorems about the symmetry\r\nof persistence diagrams and the variation of such maps. In particular, we identify\r\nbranching points and endpoints of networks as the sole source of asymmetry and\r\nrelate the cycle basis in persistent homology with a version of the stable marriage\r\nproblem. Our analysis provides the foundations of fast algorithms for maintaining a\r\ncollection of sorted lists together with its persistence diagram.","lang":"eng"}],"department":[{"_id":"HeEd"}],"article_processing_charge":"Yes (via OA deal)","page":"1101-1119","author":[{"last_name":"Biswas","first_name":"Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","full_name":"Biswas, Ranita"},{"orcid":"0000-0001-6249-0832","first_name":"Sebastiano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","last_name":"Cultrera Di Montesano","full_name":"Cultrera Di Montesano, Sebastiano"},{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Saghafian, Morteza","last_name":"Saghafian","first_name":"Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"volume":8,"month":"10","year":"2024","publisher":"Springer Nature","pmid":1,"fulldoi":"https://doi.org/10.1007/s41468-023-00126-9","file":[{"date_updated":"2025-01-09T07:39:41Z","access_level":"open_access","checksum":"d493df5088c222b88d9ca46b623ad0ee","file_size":476896,"date_created":"2025-01-09T07:39:41Z","relation":"main_file","file_name":"2024_JourApplCompTopo_Biswas.pdf","success":1,"creator":"dernst","file_id":"18783","content_type":"application/pdf"}],"file_date_updated":"2025-01-09T07:39:41Z","date_updated":"2026-08-13T09:41:57Z","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"OA_type":"hybrid","OA_place":"publisher","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Journal of Applied and Computational Topology","publication_status":"published","title":"Geometric characterization of the persistence of 1D maps","oa_version":"Published Version","ec_funded":1,"date_published":"2024-10-01T00:00:00Z","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"type":"journal_article","corr_author":"1","article_type":"original","day":"01","date_created":"2023-07-02T22:00:44Z","scopus_import":"1","project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","name":"Persistent Homology, Algorithms and Stochastic Geometry"},{"call_identifier":"FWF","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342"}],"citation":{"ama":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Geometric characterization of the persistence of 1D maps. <i>Journal of Applied and Computational Topology</i>. 2024;8:1101-1119. doi:<a href=\"https://doi.org/10.1007/s41468-023-00126-9\">10.1007/s41468-023-00126-9</a>","mla":"Biswas, Ranita, et al. “Geometric Characterization of the Persistence of 1D Maps.” <i>Journal of Applied and Computational Topology</i>, vol. 8, Springer Nature, 2024, pp. 1101–19, doi:<a href=\"https://doi.org/10.1007/s41468-023-00126-9\">10.1007/s41468-023-00126-9</a>.","chicago":"Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian. “Geometric Characterization of the Persistence of 1D Maps.” <i>Journal of Applied and Computational Topology</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s41468-023-00126-9\">https://doi.org/10.1007/s41468-023-00126-9</a>.","apa":"Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., &#38; Saghafian, M. (2024). Geometric characterization of the persistence of 1D maps. <i>Journal of Applied and Computational Topology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s41468-023-00126-9\">https://doi.org/10.1007/s41468-023-00126-9</a>","short":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Journal of Applied and Computational Topology 8 (2024) 1101–1119.","ista":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2024. Geometric characterization of the persistence of 1D maps. Journal of Applied and Computational Topology. 8, 1101–1119.","ieee":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Geometric characterization of the persistence of 1D maps,” <i>Journal of Applied and Computational Topology</i>, vol. 8. Springer Nature, pp. 1101–1119, 2024."},"acknowledgement":"Open access funding provided by Austrian Science Fund (FWF). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35. The authors of this paper thank anonymous reviewers for their constructive criticism and Monika Henzinger for detailed comments on an earlier version of this paper.","related_material":{"record":[{"id":"15094","relation":"dissertation_contains","status":"public"},{"relation":"earlier_version","id":"11660","status":"public"}]}},{"date_updated":"2026-08-14T09:33:45Z","file_date_updated":"2024-01-22T13:41:41Z","file":[{"checksum":"06fd236a9ee0b46ccb05f44695bfc34b","file_size":13194060,"access_level":"open_access","date_updated":"2024-01-22T13:41:41Z","creator":"dernst","file_id":"14874","content_type":"application/pdf","relation":"main_file","file_name":"2024_Cell_Kuhn.pdf","success":1,"date_created":"2024-01-22T13:41:41Z"}],"keyword":["General Biochemistry","Genetics and Molecular Biology"],"pmid":1,"fulldoi":"https://doi.org/10.1016/j.cell.2023.11.021","volume":187,"year":"2024","publisher":"Elsevier","month":"01","page":"130-148.e17","author":[{"full_name":"Kuhn, Andre","first_name":"Andre","last_name":"Kuhn"},{"last_name":"Roosjen","first_name":"Mark","full_name":"Roosjen, Mark"},{"full_name":"Mutte, Sumanth","last_name":"Mutte","first_name":"Sumanth"},{"full_name":"Dubey, Shiv Mani","first_name":"Shiv Mani","last_name":"Dubey"},{"full_name":"Carrillo Carrasco, Vanessa Polet","first_name":"Vanessa Polet","last_name":"Carrillo Carrasco"},{"last_name":"Boeren","first_name":"Sjef","full_name":"Boeren, Sjef"},{"full_name":"Monzer, Aline","first_name":"Aline","id":"2DB5D88C-D7B3-11E9-B8FD-7907E6697425","last_name":"Monzer"},{"first_name":"Jasper","last_name":"Koehorst","full_name":"Koehorst, Jasper"},{"full_name":"Kohchi, Takayuki","first_name":"Takayuki","last_name":"Kohchi"},{"last_name":"Nishihama","first_name":"Ryuichi","full_name":"Nishihama, Ryuichi"},{"full_name":"Fendrych, Matyas","id":"43905548-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9767-8699","first_name":"Matyas","last_name":"Fendrych"},{"full_name":"Sprakel, Joris","first_name":"Joris","last_name":"Sprakel"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jiří"},{"full_name":"Weijers, Dolf","first_name":"Dolf","last_name":"Weijers"}],"department":[{"_id":"JiFr"}],"abstract":[{"text":"The plant-signaling molecule auxin triggers fast and slow cellular responses across land plants and algae. The nuclear auxin pathway mediates gene expression and controls growth and development in land plants, but this pathway is absent from algal sister groups. Several components of rapid responses have been identified in Arabidopsis, but it is unknown if these are part of a conserved mechanism. We recently identified a fast, proteome-wide phosphorylation response to auxin. Here, we show that this response occurs across 5 land plant and algal species and converges on a core group of shared targets. We found conserved rapid physiological responses to auxin in the same species and identified rapidly accelerated fibrosarcoma (RAF)-like protein kinases as central mediators of auxin-triggered phosphorylation across species. Genetic analysis connects this kinase to both auxin-triggered protein phosphorylation and rapid cellular response, thus identifying an ancient mechanism for fast auxin responses in the green lineage.","lang":"eng"}],"article_processing_charge":"Yes (in subscription journal)","doi":"10.1016/j.cell.2023.11.021","has_accepted_license":"1","intvolume":"       187","oa":1,"ddc":["580"],"external_id":{"isi":["001152705700001"],"pmid":["38128538"]},"language":[{"iso":"eng"}],"_id":"14826","issue":"1","related_material":{"record":[{"status":"public","id":"19395","relation":"dissertation_contains"}]},"acknowledgement":"We are grateful to Asuka Shitaku and Eri Koide for generating and sharing the Marchantia PRAF-mCitrine line and Peng-Cheng Wang for sharing the Arabidopsis raf mutant. We are grateful to our team members for discussions and helpful advice. This work was supported by funding from the Netherlands Organization for Scientific Research (NWO): VICI grant 865.14.001 and ENW-KLEIN OCENW.KLEIN.027 grants to D.W.; VENI grant VI.VENI.212.003 to A.K.; the European Research Council AdG DIRNDL (contract number 833867) to D.W.; CoG CATCH to J.S.; StG CELLONGATE (contract 803048) to M.F.; and AdG ETAP (contract 742985) to J.F.; MEXT KAKENHI grant number JP19H05675 to T.K.; JSPS KAKENHI grant number JP20H03275 to R.N.; Takeda Science Foundation to R.N.; and the Austrian Science Fund (FWF, P29988) to J.F.","license":"https://creativecommons.org/licenses/by-nc/4.0/","citation":{"ama":"Kuhn A, Roosjen M, Mutte S, et al. RAF-like protein kinases mediate a deeply conserved, rapid auxin response. <i>Cell</i>. 2024;187(1):130-148.e17. doi:<a href=\"https://doi.org/10.1016/j.cell.2023.11.021\">10.1016/j.cell.2023.11.021</a>","mla":"Kuhn, Andre, et al. “RAF-like Protein Kinases Mediate a Deeply Conserved, Rapid Auxin Response.” <i>Cell</i>, vol. 187, no. 1, Elsevier, 2024, p. 130–148.e17, doi:<a href=\"https://doi.org/10.1016/j.cell.2023.11.021\">10.1016/j.cell.2023.11.021</a>.","chicago":"Kuhn, Andre, Mark Roosjen, Sumanth Mutte, Shiv Mani Dubey, Vanessa Polet Carrillo Carrasco, Sjef Boeren, Aline Monzer, et al. “RAF-like Protein Kinases Mediate a Deeply Conserved, Rapid Auxin Response.” <i>Cell</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.cell.2023.11.021\">https://doi.org/10.1016/j.cell.2023.11.021</a>.","apa":"Kuhn, A., Roosjen, M., Mutte, S., Dubey, S. M., Carrillo Carrasco, V. P., Boeren, S., … Weijers, D. (2024). RAF-like protein kinases mediate a deeply conserved, rapid auxin response. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2023.11.021\">https://doi.org/10.1016/j.cell.2023.11.021</a>","short":"A. Kuhn, M. Roosjen, S. Mutte, S.M. Dubey, V.P. Carrillo Carrasco, S. Boeren, A. Monzer, J. Koehorst, T. Kohchi, R. Nishihama, M. Fendrych, J. Sprakel, J. Friml, D. Weijers, Cell 187 (2024) 130–148.e17.","ista":"Kuhn A, Roosjen M, Mutte S, Dubey SM, Carrillo Carrasco VP, Boeren S, Monzer A, Koehorst J, Kohchi T, Nishihama R, Fendrych M, Sprakel J, Friml J, Weijers D. 2024. RAF-like protein kinases mediate a deeply conserved, rapid auxin response. Cell. 187(1), 130–148.e17.","ieee":"A. Kuhn <i>et al.</i>, “RAF-like protein kinases mediate a deeply conserved, rapid auxin response,” <i>Cell</i>, vol. 187, no. 1. Elsevier, p. 130–148.e17, 2024."},"project":[{"call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants"},{"call_identifier":"FWF","name":"RNA-directed DNA methylation in plant development","_id":"262EF96E-B435-11E9-9278-68D0E5697425","grant_number":"P29988"}],"article_type":"original","day":"04","date_created":"2024-01-17T12:45:40Z","scopus_import":"1","isi":1,"tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"type":"journal_article","quality_controlled":"1","date_published":"2024-01-04T00:00:00Z","title":"RAF-like protein kinases mediate a deeply conserved, rapid auxin response","oa_version":"Published Version","ec_funded":1,"status":"public","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Cell","publication_identifier":{"issn":["0092-8674"],"eissn":["1097-4172"]}},{"scopus_import":"1","day":"28","date_created":"2024-08-04T22:01:21Z","article_type":"original","isi":1,"corr_author":"1","type":"journal_article","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"related_material":{"record":[{"status":"public","id":"22684","relation":"dissertation_contains"}]},"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 949120). This research was supported by the Scientific Service Units of the Institute of Science and Technology Austria (ISTA) through resources provided by the Miba Machine Shop, Nanofabrication Facility, Scientific Computing Facility, and Lab Support Facility. The authors wish to thank Dmytro Rak and Juan Carlos Sobarzo for letting us use their equipment. The authors wish to thank the contributions of the whole Waitukaitis Group for useful discussions and feedback.","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","citation":{"mla":"Lenton, Isaac C., et al. “Beyond the Blur: Using Experimentally Determined Point Spread Functions to Improve Scanning Kelvin Probe Imaging.” <i>Journal of Applied Physics</i>, vol. 136, no. 4, 045305, AIP Publishing, 2024, doi:<a href=\"https://doi.org/10.1063/5.0215151\">10.1063/5.0215151</a>.","chicago":"Lenton, Isaac C, Felix Pertl, Lubuna B Shafeek, and Scott R Waitukaitis. “Beyond the Blur: Using Experimentally Determined Point Spread Functions to Improve Scanning Kelvin Probe Imaging.” <i>Journal of Applied Physics</i>. AIP Publishing, 2024. <a href=\"https://doi.org/10.1063/5.0215151\">https://doi.org/10.1063/5.0215151</a>.","ama":"Lenton IC, Pertl F, Shafeek LB, Waitukaitis SR. Beyond the blur: Using experimentally determined point spread functions to improve scanning Kelvin probe imaging. <i>Journal of Applied Physics</i>. 2024;136(4). doi:<a href=\"https://doi.org/10.1063/5.0215151\">10.1063/5.0215151</a>","ista":"Lenton IC, Pertl F, Shafeek LB, Waitukaitis SR. 2024. Beyond the blur: Using experimentally determined point spread functions to improve scanning Kelvin probe imaging. Journal of Applied Physics. 136(4), 045305.","ieee":"I. C. Lenton, F. Pertl, L. B. Shafeek, and S. R. Waitukaitis, “Beyond the blur: Using experimentally determined point spread functions to improve scanning Kelvin probe imaging,” <i>Journal of Applied Physics</i>, vol. 136, no. 4. AIP Publishing, 2024.","apa":"Lenton, I. C., Pertl, F., Shafeek, L. B., &#38; Waitukaitis, S. R. (2024). Beyond the blur: Using experimentally determined point spread functions to improve scanning Kelvin probe imaging. <i>Journal of Applied Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0215151\">https://doi.org/10.1063/5.0215151</a>","short":"I.C. Lenton, F. Pertl, L.B. Shafeek, S.R. Waitukaitis, Journal of Applied Physics 136 (2024)."},"project":[{"call_identifier":"H2020","name":"Tribocharge: a multi-scale approach to an enduring problem in physics","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","grant_number":"949120"}],"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Journal of Applied Physics","status":"public","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"LifeSc"},{"_id":"ScienComp"}],"publication_identifier":{"eissn":["1089-7550"],"issn":["0021-8979"]},"quality_controlled":"1","date_published":"2024-07-28T00:00:00Z","ec_funded":1,"title":"Beyond the blur: Using experimentally determined point spread functions to improve scanning Kelvin probe imaging","oa_version":"Published Version","article_number":"045305","fulldoi":"https://doi.org/10.1063/5.0215151","month":"07","year":"2024","publisher":"AIP Publishing","volume":136,"date_updated":"2026-08-27T11:42:44Z","file_date_updated":"2024-08-05T08:19:58Z","file":[{"creator":"dernst","file_id":"17386","content_type":"application/pdf","file_name":"2024_JourApplPhysics_Lenton.pdf","relation":"main_file","success":1,"date_created":"2024-08-05T08:19:58Z","checksum":"6141d05cd68d540a7446dce9490975db","file_size":2537502,"access_level":"open_access","date_updated":"2024-08-05T08:19:58Z"}],"ddc":["530"],"oa":1,"intvolume":"       136","has_accepted_license":"1","language":[{"iso":"eng"}],"external_id":{"isi":["001281681100003"]},"_id":"17373","issue":"4","author":[{"full_name":"Lenton, Isaac C","id":"a550210f-223c-11ec-8182-e2d45e817efb","orcid":"0000-0002-5010-6984","first_name":"Isaac C","last_name":"Lenton"},{"full_name":"Pertl, Felix","last_name":"Pertl","orcid":"0000-0003-0463-5794","id":"6313aec0-15b2-11ec-abd3-ed67d16139af","first_name":"Felix"},{"id":"3CD37A82-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7180-6050","first_name":"Lubuna B","last_name":"Shafeek","full_name":"Shafeek, Lubuna B"},{"last_name":"Waitukaitis","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R","full_name":"Waitukaitis, Scott R"}],"article_processing_charge":"No","department":[{"_id":"ScWa"},{"_id":"NanoFab"}],"abstract":[{"text":"Scanning Kelvin probe microscopy (SKPM) is a powerful technique for investigating the electrostatic properties of material surfaces, enabling the imaging of variations in work function, topology, surface charge density, or combinations thereof. Regardless of the underlying signal source, SKPM results in a voltage image, which is spatially distorted due to the finite size of the probe, long-range electrostatic interactions, mechanical and electrical noise, and the finite response time of the electronics. In order to recover the underlying signal, it is necessary to deconvolve the measurement with an appropriate point spread function (PSF) that accounts the aforementioned distortions, but determining this PSF is difficult. Here, we describe how such PSFs can be determined experimentally and show how they can be used to recover the underlying information of interest. We first consider the physical principles that enable SKPM and discuss how these affect the system PSF. We then show how one can experimentally measure PSFs by looking at well-defined features, and that these compare well to simulated PSFs, provided scans are performed extremely slowly and carefully. Next, we work at realistic scan speeds and show that the idealized PSFs fail to capture temporal distortions in the scan direction. While simulating PSFs for these situations would be quite challenging, we show that measuring PSFs with similar scan conditions works well. Our approach clarifies the basic principles and inherent challenges to SKPM measurements and gives practical methods to improve results.","lang":"eng"}],"doi":"10.1063/5.0215151"},{"doi":"10.1038/s41467-024-47746-y","department":[{"_id":"JiFr"}],"abstract":[{"lang":"eng","text":"Phytoalexin sakuranetin functions in resistance against rice blast. However, the mechanisms underlying the effects of sakuranetin remains elusive. Here, we report that rice lines expressing resistance (R) genes were found to contain high levels of sakuranetin, which correlates with attenuated endocytic trafficking of plasma membrane (PM) proteins. Exogenous and endogenous sakuranetin attenuates the endocytosis of various PM proteins and the fungal effector PWL2. Moreover, accumulation of the avirulence protein AvrCO39, resulting from uptake into rice cells by Magnaporthe oryzae, was reduced following treatment with sakuranetin. Pharmacological manipulation of clathrin-mediated endocytic (CME) suggests that this pathway is targeted by sakuranetin. Indeed, attenuation of CME by sakuranetin is sufficient to convey resistance against rice blast. Our data reveals a mechanism of rice against M. oryzae by increasing sakuranetin levels and repressing the CME of pathogen effectors, which is distinct from the action of many R genes that mainly function by modulating transcription."}],"article_processing_charge":"Yes","author":[{"last_name":"Jiang","first_name":"Lihui","full_name":"Jiang, Lihui"},{"last_name":"Zhang","first_name":"Xiaoyan","full_name":"Zhang, Xiaoyan"},{"full_name":"Zhao, Yiting","first_name":"Yiting","last_name":"Zhao"},{"full_name":"Zhu, Haiyan","last_name":"Zhu","first_name":"Haiyan"},{"full_name":"Fu, Qijing","last_name":"Fu","first_name":"Qijing"},{"full_name":"Lu, Xinqi","last_name":"Lu","first_name":"Xinqi"},{"last_name":"Huang","first_name":"Wuying","full_name":"Huang, Wuying"},{"full_name":"Yang, Xinyue","last_name":"Yang","first_name":"Xinyue"},{"first_name":"Xuan","last_name":"Zhou","full_name":"Zhou, Xuan"},{"full_name":"Wu, Lixia","first_name":"Lixia","last_name":"Wu"},{"full_name":"Yang, Ao","last_name":"Yang","first_name":"Ao"},{"first_name":"Xie","last_name":"He","full_name":"He, Xie"},{"last_name":"Dong","first_name":"Man","full_name":"Dong, Man"},{"full_name":"Peng, Ziai","first_name":"Ziai","last_name":"Peng"},{"full_name":"Yang, Jing","last_name":"Yang","first_name":"Jing"},{"first_name":"Liwei","last_name":"Guo","full_name":"Guo, Liwei"},{"last_name":"Wen","first_name":"Jiancheng","full_name":"Wen, Jiancheng"},{"first_name":"Huichuan","last_name":"Huang","full_name":"Huang, Huichuan"},{"last_name":"Xie","first_name":"Yong","full_name":"Xie, Yong"},{"first_name":"Shusheng","last_name":"Zhu","full_name":"Zhu, Shusheng"},{"full_name":"Li, Chengyun","first_name":"Chengyun","last_name":"Li"},{"full_name":"He, Xiahong","last_name":"He","first_name":"Xiahong"},{"last_name":"Zhu","first_name":"Youyong","full_name":"Zhu, Youyong"},{"full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jiří","last_name":"Friml"},{"full_name":"Du, Yunlong","first_name":"Yunlong","last_name":"Du"}],"_id":"17103","external_id":{"pmid":["38653755"],"isi":["001207290500013"]},"language":[{"iso":"eng"}],"oa":1,"intvolume":"        15","has_accepted_license":"1","ddc":["580"],"file":[{"access_level":"open_access","date_updated":"2024-06-03T12:05:10Z","checksum":"80cb2f2c538e81064f4836b54bc313ca","file_size":8013695,"date_created":"2024-06-03T12:05:10Z","creator":"dernst","file_id":"17110","content_type":"application/pdf","relation":"main_file","file_name":"2024_NatureComm_Jiang.pdf","success":1}],"file_date_updated":"2024-06-03T12:05:10Z","date_updated":"2026-09-03T09:18:44Z","volume":15,"year":"2024","month":"04","publisher":"Springer Nature","pmid":1,"fulldoi":"https://doi.org/10.1038/s41467-024-47746-y","oa_version":"Published Version","title":"Phytoalexin sakuranetin attenuates endocytosis and enhances resistance to rice blast","article_number":"3437","date_published":"2024-04-23T00:00:00Z","quality_controlled":"1","publication_identifier":{"eissn":["2041-1723"]},"status":"public","publication":"Nature Communications","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","citation":{"ista":"Jiang L, Zhang X, Zhao Y, Zhu H, Fu Q, Lu X, Huang W, Yang X, Zhou X, Wu L, Yang A, He X, Dong M, Peng Z, Yang J, Guo L, Wen J, Huang H, Xie Y, Zhu S, Li C, He X, Zhu Y, Friml J, Du Y. 2024. Phytoalexin sakuranetin attenuates endocytosis and enhances resistance to rice blast. Nature Communications. 15, 3437.","ieee":"L. Jiang <i>et al.</i>, “Phytoalexin sakuranetin attenuates endocytosis and enhances resistance to rice blast,” <i>Nature Communications</i>, vol. 15. Springer Nature, 2024.","apa":"Jiang, L., Zhang, X., Zhao, Y., Zhu, H., Fu, Q., Lu, X., … Du, Y. (2024). Phytoalexin sakuranetin attenuates endocytosis and enhances resistance to rice blast. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-024-47746-y\">https://doi.org/10.1038/s41467-024-47746-y</a>","short":"L. Jiang, X. Zhang, Y. Zhao, H. Zhu, Q. Fu, X. Lu, W. Huang, X. Yang, X. Zhou, L. Wu, A. Yang, X. He, M. Dong, Z. Peng, J. Yang, L. Guo, J. Wen, H. Huang, Y. Xie, S. Zhu, C. Li, X. He, Y. Zhu, J. Friml, Y. Du, Nature Communications 15 (2024).","mla":"Jiang, Lihui, et al. “Phytoalexin Sakuranetin Attenuates Endocytosis and Enhances Resistance to Rice Blast.” <i>Nature Communications</i>, vol. 15, 3437, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1038/s41467-024-47746-y\">10.1038/s41467-024-47746-y</a>.","chicago":"Jiang, Lihui, Xiaoyan Zhang, Yiting Zhao, Haiyan Zhu, Qijing Fu, Xinqi Lu, Wuying Huang, et al. “Phytoalexin Sakuranetin Attenuates Endocytosis and Enhances Resistance to Rice Blast.” <i>Nature Communications</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41467-024-47746-y\">https://doi.org/10.1038/s41467-024-47746-y</a>.","ama":"Jiang L, Zhang X, Zhao Y, et al. Phytoalexin sakuranetin attenuates endocytosis and enhances resistance to rice blast. <i>Nature Communications</i>. 2024;15. doi:<a href=\"https://doi.org/10.1038/s41467-024-47746-y\">10.1038/s41467-024-47746-y</a>"},"related_material":{"record":[{"id":"22776","relation":"used_in_publication","status":"public"}]},"acknowledgement":"We thank Professor Jianqiang Wu (Kunming Institute of Botany, Chinese Academy of Sciences) for his generous support with the sakuranetin measurement. We thank International Rice Research Institute (IRRI) for provision of the rice NILs. We thank Professor Zhongkai Zhang (Yunnan Academy of Agricultural Sciences) for his generous support with subcellular structure observation of rice roots. We thank Professor Barbara Valent (Kansas State University) for her generously provision of the plasmid containing the PWL2 gene. We thank Professor Zuhua He (Chinese Academy of Sciences) for the gift of the transgenic rice line expressing the Pigm gene, OsNPR1-RNAi mutant line and ROD1-overexpression rice line. We thank Professor Yinong Yang (The Pennsylvania State University) for provision of the rice line NahG. We thank Professor Muyuan Zhu (Zhejiang University) for provision of the transgenic plants overexpressing miR393a. We thank Professor Zhengge Zhu (Hebei Normal University) for provision of the rice line overexpressing OsPIN3t-GFP. We thank Professor Yanhua Qi (Zhejiang University) for provision of the arf12 mutant line. Thanks also go to Professor Jean-Benoit Morel (Plant Health Institute of Montpellier) for provision of the fungus M. oryzae strain Guy11 (AvrCo39-mRFP). This work was supported by grants from the National Natural Science Foundation of China (Grant Nos. 32260085, 31460453, 31660501, 31860064, 31760500 and 31901870), the Major Special Program for Scientific Research, Education Department of Yunnan Province (Grant No. ZD2015005). The project was also sponsored by SRF for ROCS, SEM (Grant No. [2013] 1792), the Key Projects of Applied Basic Research Plan of Yunnan Province (Grant No. 2017FA018, 202301AS070082), the Major Science and Technology Project in Yunnan Province (202102AE090042, 202202AE090036 and 202102AE090017), the Young and Middle-Aged Academic and Technical Leaders Reserve Talent Program in Yunnan Province (202205AC160076), the China Postdoctoral Science Foundation (2019M653849XB) and the National Key Research and Development Program of China (2023YFE0107500).","DOAJ_listed":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"type":"journal_article","isi":1,"article_type":"original","scopus_import":"1","day":"23","date_created":"2024-06-03T08:54:50Z"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ddc":["580"],"status":"public","oa":1,"OA_place":"repository","OA_type":"green","_id":"22776","author":[{"full_name":"Du, Yunlong","last_name":"Du","first_name":"Yunlong"}],"date_published":"2024-03-21T00:00:00Z","article_processing_charge":"No","department":[{"_id":"JiFr"}],"doi":"10.6084/m9.figshare.25448191","oa_version":"None","title":"SeRrbJ609","date_created":"2026-09-03T09:17:46Z","fulldoi":"https://doi.org/10.6084/m9.figshare.25448191","day":"21","month":"03","publisher":"Repository","year":"2024","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.25448191"}],"type":"research_data_reference","related_material":{"record":[{"id":"17103","relation":"research_data","status":"public"}]},"date_updated":"2026-09-03T09:18:44Z","citation":{"ama":"Du Y. SeRrbJ609. 2024. doi:<a href=\"https://doi.org/10.6084/m9.figshare.25448191\">10.6084/m9.figshare.25448191</a>","chicago":"Du, Yunlong. “SeRrbJ609.” Repository, 2024. <a href=\"https://doi.org/10.6084/m9.figshare.25448191\">https://doi.org/10.6084/m9.figshare.25448191</a>.","mla":"Du, Yunlong. <i>SeRrbJ609</i>. Repository, 2024, doi:<a href=\"https://doi.org/10.6084/m9.figshare.25448191\">10.6084/m9.figshare.25448191</a>.","short":"Y. Du, (2024).","apa":"Du, Y. (2024). SeRrbJ609. Repository. <a href=\"https://doi.org/10.6084/m9.figshare.25448191\">https://doi.org/10.6084/m9.figshare.25448191</a>","ieee":"Y. Du, “SeRrbJ609.” Repository, 2024.","ista":"Du Y. 2024. SeRrbJ609, Repository, <a href=\"https://doi.org/10.6084/m9.figshare.25448191\">10.6084/m9.figshare.25448191</a>."}},{"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar"},{"full_name":"Goharshady, Ehsan","first_name":"Ehsan","last_name":"Goharshady"},{"full_name":"Karrabi, Mehrdad","last_name":"Karrabi","first_name":"Mehrdad","orcid":"0009-0007-5253-9170","id":"67638922-f394-11eb-9cf6-f20423e08757"},{"last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","first_name":"Dorde","full_name":"Zikelic, Dorde"}],"page":"600-619","article_processing_charge":"Yes (in subscription journal)","department":[{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witnesses for LTL verification over imperative programs. Our witnesses are applicable to both verification (proving) and refutation (finding bugs) settings. We then consider LTL formulas in which atomic propositions can be polynomial constraints and turn our focus to polynomial arithmetic programs, i.e. programs in which every assignment and guard consists only of polynomial expressions. For this setting, we provide an efficient algorithm to automatically synthesize such LTL witnesses. Our synthesis procedure is both sound and semi-complete. Finally, we present experimental results demonstrating the effectiveness of our approach and that it can handle programs which were beyond the reach of previous state-of-the-art tools."}],"doi":"10.1007/978-3-031-71162-6_31","ddc":["000"],"has_accepted_license":"1","intvolume":"     14933","oa":1,"language":[{"iso":"eng"}],"external_id":{"isi":["001336893300031"],"arxiv":["2403.05386"]},"_id":"18155","date_updated":"2026-09-03T11:51:22Z","file_date_updated":"2024-10-01T09:56:54Z","file":[{"access_level":"open_access","date_updated":"2024-10-01T09:56:54Z","checksum":"223845be9e754681ee218866827c95e7","file_size":650495,"date_created":"2024-10-01T09:56:54Z","file_id":"18165","creator":"dernst","content_type":"application/pdf","relation":"main_file","file_name":"2024_LNCS_Chatterjee.pdf","success":1}],"fulldoi":"https://doi.org/10.1007/978-3-031-71162-6_31","alternative_title":["LNCS"],"publisher":"Springer Nature","month":"09","year":"2024","volume":14933,"conference":{"location":"Milan, Italy","end_date":"2024-09-13","start_date":"2024-09-09","name":"FM: Formal Methods"},"quality_controlled":"1","date_published":"2024-09-11T00:00:00Z","ec_funded":1,"oa_version":"Published Version","title":"Sound and complete witnesses for template-based verification of LTL properties on polynomial programs","publication_status":"published","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031711619"],"issn":["0302-9743"]},"acknowledgement":"This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt) and the Hong Kong Research Grants Council ECS Project Number 26208122.","related_material":{"record":[{"id":"22798","relation":"research_data","status":"public"}]},"citation":{"mla":"Chatterjee, Krishnendu, et al. “Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, vol. 14933, Springer Nature, 2024, pp. 600–19, doi:<a href=\"https://doi.org/10.1007/978-3-031-71162-6_31\">10.1007/978-3-031-71162-6_31</a>.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Ehsan Goharshady, Mehrdad Karrabi, and Dorde Zikelic. “Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, 14933:600–619. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-71162-6_31\">https://doi.org/10.1007/978-3-031-71162-6_31</a>.","ama":"Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Zikelic D. Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. In: <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 14933. Springer Nature; 2024:600-619. doi:<a href=\"https://doi.org/10.1007/978-3-031-71162-6_31\">10.1007/978-3-031-71162-6_31</a>","ista":"Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Zikelic D. 2024. Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). FM: Formal Methods, LNCS, vol. 14933, 600–619.","ieee":"K. Chatterjee, A. K. Goharshady, E. Goharshady, M. Karrabi, and D. Zikelic, “Sound and complete witnesses for template-based verification of LTL properties on polynomial programs,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Milan, Italy, 2024, vol. 14933, pp. 600–619.","apa":"Chatterjee, K., Goharshady, A. K., Goharshady, E., Karrabi, M., &#38; Zikelic, D. (2024). Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. In <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 14933, pp. 600–619). Milan, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-71162-6_31\">https://doi.org/10.1007/978-3-031-71162-6_31</a>","short":"K. Chatterjee, A.K. Goharshady, E. Goharshady, M. Karrabi, D. Zikelic, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2024, pp. 600–619."},"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"date_created":"2024-09-29T22:01:37Z","scopus_import":"1","day":"11","arxiv":1,"isi":1,"corr_author":"1","type":"conference","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"}},{"date_created":"2026-09-03T11:50:15Z","fulldoi":"https://doi.org/10.5281/zenodo.12518216","day":"24","month":"06","year":"2024","publisher":"Repository","type":"research_data_reference","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.12518216"}],"related_material":{"record":[{"status":"public","id":"18155","relation":"used_in_publication"}]},"date_updated":"2026-09-03T11:51:23Z","citation":{"ista":"Chatterjee K,   Kafshdar Goharshady A, Kafshdar Goharshady E, Karrabi M, Žikelić Ð. 2024. Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs, Repository, <a href=\"https://doi.org/10.5281/zenodo.12518216\">10.5281/zenodo.12518216</a>.","ieee":"K. Chatterjee, A.   Kafshdar Goharshady, E. Kafshdar Goharshady, M. Karrabi, and Ð. Žikelić, “Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs.” Repository, 2024.","apa":"Chatterjee, K.,   Kafshdar Goharshady, A., Kafshdar Goharshady, E., Karrabi, M., &#38; Žikelić, Ð. (2024). Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs. Repository. <a href=\"https://doi.org/10.5281/zenodo.12518216\">https://doi.org/10.5281/zenodo.12518216</a>","short":"K. Chatterjee, A.   Kafshdar Goharshady, E. Kafshdar Goharshady, M. Karrabi, Ð. Žikelić, (2024).","mla":"Chatterjee, Krishnendu, et al. <i>Data for Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs</i>. Repository, 2024, doi:<a href=\"https://doi.org/10.5281/zenodo.12518216\">10.5281/zenodo.12518216</a>.","chicago":"Chatterjee, Krishnendu, Amir   Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, and Ðorđe Žikelić. “Data for Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.” Repository, 2024. <a href=\"https://doi.org/10.5281/zenodo.12518216\">https://doi.org/10.5281/zenodo.12518216</a>.","ama":"Chatterjee K,   Kafshdar Goharshady A, Kafshdar Goharshady E, Karrabi M, Žikelić Ð. Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs. 2024. doi:<a href=\"https://doi.org/10.5281/zenodo.12518216\">10.5281/zenodo.12518216</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ddc":["000"],"status":"public","oa":1,"OA_place":"repository","OA_type":"green","_id":"22798","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"  Kafshdar Goharshady, Amir","last_name":"  Kafshdar Goharshady","first_name":"Amir"},{"first_name":"Ehsan","last_name":"Kafshdar Goharshady","full_name":"Kafshdar Goharshady, Ehsan"},{"full_name":"Karrabi, Mehrdad","first_name":"Mehrdad","last_name":"Karrabi"},{"first_name":"Ðorđe","last_name":"Žikelić","full_name":"Žikelić, Ðorđe"}],"date_published":"2024-06-24T00:00:00Z","article_processing_charge":"No","department":[{"_id":"KrCh"}],"abstract":[{"text":"This repository contains the artifact of the paper titled \"Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs\" accepted at FM 2024.\r\n\r\nThe task of verifying an LTL formula on a program can be reduced to verifying a Büchi specification on the product transition system. This tool takes a non-deterministic transition system together with a Büchi specification as input and based on user preferences tries to either (i) prove the existence of a run in the program that satisfies the Büchi condition or (ii) demonstrate that every run of the program satisfies the Büchi condition.\r\n \r\nThe tool is written in Java and works well with openjdk 11 on Ubuntu 22.04. Running all the experiments can take weeks to finish. We have provided a script for running the strongest configuration of our tool which solves most of the benchmarks and takes less than 48 hours. Detailed guidance is given in the readme file.","lang":"eng"}],"doi":"10.5281/zenodo.12518216","title":"Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs","oa_version":"None"},{"publication":"Astronomy & Astrophysics","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","OA_type":"hybrid","OA_place":"publisher","publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"quality_controlled":"1","date_published":"2024-10-01T00:00:00Z","ec_funded":1,"oa_version":"Published Version","article_number":"A217","title":"Unveiling complex magnetic field configurations in red giant stars","date_created":"2024-11-10T23:02:00Z","scopus_import":"1","day":"01","arxiv":1,"article_type":"original","isi":1,"corr_author":"1","type":"journal_article","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"related_material":{"record":[{"status":"public","id":"22802","relation":"research_data"}]},"acknowledgement":"The authors thank S. Mathis, L. Barrault, S. Torres, A. Cristea, and K. M. Smith for very useful discussions. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curíe grant agreement No 101034413. The authors thank the anonymous referee for valuable comments and suggestions to improve the manuscript.","citation":{"chicago":"Das, Srijan B, Lukas Einramhof, and Lisa Annabelle Bugnet. “Unveiling Complex Magnetic Field Configurations in Red Giant Stars.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2024. <a href=\"https://doi.org/10.1051/0004-6361/202450918\">https://doi.org/10.1051/0004-6361/202450918</a>.","mla":"Das, Srijan B., et al. “Unveiling Complex Magnetic Field Configurations in Red Giant Stars.” <i>Astronomy &#38; Astrophysics</i>, vol. 690, A217, EDP Sciences, 2024, doi:<a href=\"https://doi.org/10.1051/0004-6361/202450918\">10.1051/0004-6361/202450918</a>.","ama":"Das SB, Einramhof L, Bugnet LA. Unveiling complex magnetic field configurations in red giant stars. <i>Astronomy &#38; Astrophysics</i>. 2024;690. doi:<a href=\"https://doi.org/10.1051/0004-6361/202450918\">10.1051/0004-6361/202450918</a>","ieee":"S. B. Das, L. Einramhof, and L. A. Bugnet, “Unveiling complex magnetic field configurations in red giant stars,” <i>Astronomy &#38; Astrophysics</i>, vol. 690. EDP Sciences, 2024.","ista":"Das SB, Einramhof L, Bugnet LA. 2024. Unveiling complex magnetic field configurations in red giant stars. Astronomy &#38; Astrophysics. 690, A217.","short":"S.B. Das, L. Einramhof, L.A. Bugnet, Astronomy &#38; Astrophysics 690 (2024).","apa":"Das, S. B., Einramhof, L., &#38; Bugnet, L. A. (2024). Unveiling complex magnetic field configurations in red giant stars. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202450918\">https://doi.org/10.1051/0004-6361/202450918</a>"},"project":[{"name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"ddc":["520"],"oa":1,"intvolume":"       690","has_accepted_license":"1","das_tickbox":"1","language":[{"iso":"eng"}],"external_id":{"isi":["001336485200015"],"arxiv":["2405.20133"]},"_id":"18528","author":[{"id":"9ce7c423-dacf-11ed-8942-e09c6cb27149","first_name":"Srijan B","orcid":"0000-0003-0896-7972","last_name":"Das","full_name":"Das, Srijan B"},{"first_name":"Lukas","id":"f1497a1a-72ef-11ef-b75a-fd877bbf6e8c","last_name":"Einramhof","full_name":"Einramhof, Lukas"},{"full_name":"Bugnet, Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle","orcid":"0000-0003-0142-4000"}],"article_processing_charge":"No","department":[{"_id":"LiBu"}],"abstract":[{"text":"The recent measurement of magnetic field strength inside the radiative interior of red giant stars has opened the way toward full 3D characterization of the geometry of stable large-scale magnetic fields. However, current measurements, which are limited to dipolar (ℓ = 1) mixed modes, do not properly constrain the topology of magnetic fields due to degeneracies on the observed magnetic field signature on such ℓ = 1 mode frequencies. Efforts focused toward unambiguous detections of magnetic field configurations are now key to better understand angular momentum transport in stars. We investigated the detectability of complex magnetic field topologies (such as the ones observed at the surface of stars with a radiative envelope with spectropolarimetry) inside the radiative interior of red giants. We focused on a field composed of a combination of a dipole and a quadrupole (quadrudipole) and on an offset field. We explored the potential of probing such magnetic field topologies from a combined measurement of magnetic signatures on ℓ = 1 and quadrupolar (ℓ = 2) mixed mode oscillation frequencies. We first derived the asymptotic theoretical formalism for computing the asymmetric signature in the frequency pattern for ℓ = 2 modes due to a quadrudipole magnetic field. To access asymmetry parameters for more complex magnetic field topologies, we numerically performed a grid search over the parameter space to map the degeneracy of the signatures of given topologies. We demonstrate the crucial role played by ℓ = 2 mixed modes in accessing internal magnetic fields with a quadrupolar component. The degeneracy of the quadrudipole compared to pure dipolar fields is lifted when considering magnetic asymmetries in both ℓ = 1 and ℓ = 2 mode frequencies. In addition to the analytical derivation for the quadrudipole, we present the prospect for complex magnetic field inversions using magnetic sensitivity kernels from standard perturbation analysis for forward modeling. Using this method, we explored the detectability of offset magnetic fields from ℓ = 1 and ℓ = 2 frequencies and demonstrate that offset fields may be mistaken for weak and centered magnetic fields, resulting in underestimating the magnetic field strength in stellar cores. We emphasize the need to characterize ℓ = 2 mixed-mode frequencies, (along with the currently characterized ℓ = 1 mixed modes), to unveil the higher-order components of the geometry of buried magnetic fields and to better constrain angular momentum transport inside stars.","lang":"eng"}],"doi":"10.1051/0004-6361/202450918","fulldoi":"https://doi.org/10.1051/0004-6361/202450918","year":"2024","month":"10","publisher":"EDP Sciences","volume":690,"date_updated":"2026-09-04T09:43:52Z","file_date_updated":"2024-11-11T09:01:11Z","file":[{"date_updated":"2024-11-11T09:01:11Z","access_level":"open_access","checksum":"d43bbe6ed8ce4512e65e2d0d87070cf6","file_size":5306256,"date_created":"2024-11-11T09:01:11Z","creator":"dernst","file_id":"18534","content_type":"application/pdf","relation":"main_file","file_name":"2024_AstronomyAstrophysics_Das.pdf","success":1}]},{"date_updated":"2026-09-04T09:43:52Z","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"18528"}]},"citation":{"ama":"Das SB, Einramhof L, Bugnet L. MESA inlist file. 2024. doi:<a href=\"https://doi.org/10.5281/zenodo.12804810\">10.5281/zenodo.12804810</a>","chicago":"Das, Srijan B, Lukas Einramhof, and Lisa Bugnet. “MESA Inlist File.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.5281/zenodo.12804810\">https://doi.org/10.5281/zenodo.12804810</a>.","mla":"Das, Srijan B., et al. <i>MESA Inlist File</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.5281/zenodo.12804810\">10.5281/zenodo.12804810</a>.","short":"S.B. Das, L. Einramhof, L. Bugnet, (2024).","apa":"Das, S. B., Einramhof, L., &#38; Bugnet, L. (2024). MESA inlist file. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.5281/zenodo.12804810\">https://doi.org/10.5281/zenodo.12804810</a>","ieee":"S. B. Das, L. Einramhof, and L. Bugnet, “MESA inlist file.” Institute of Science and Technology Austria, 2024.","ista":"Das SB, Einramhof L, Bugnet L. 2024. MESA inlist file, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.5281/zenodo.12804810\">10.5281/zenodo.12804810</a>."},"publisher":"Institute of Science and Technology Austria","month":"07","year":"2024","day":"24","fulldoi":"https://doi.org/10.5281/zenodo.12804810","date_created":"2026-09-04T09:42:23Z","type":"research_data_reference","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.12804810","open_access":"1"}],"author":[{"first_name":"Srijan B","last_name":"Das","full_name":"Das, Srijan B"},{"first_name":"Lukas","last_name":"Einramhof","full_name":"Einramhof, Lukas"},{"last_name":"Bugnet","first_name":"Lisa","full_name":"Bugnet, Lisa"}],"doi":"10.5281/zenodo.12804810","oa_version":"None","title":"MESA inlist file","article_processing_charge":"No","date_published":"2024-07-24T00:00:00Z","abstract":[{"lang":"eng","text":"MESA inlist file for the paper \"Unveiling complex magnetic field configurations in red giant stars\" (10.1051/0004-6361/202450918)"}],"department":[{"_id":"LiBu"}],"OA_place":"repository","OA_type":"green","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ddc":["520"],"status":"public","oa":1,"_id":"22802"},{"_id":"22803","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ddc":["570"],"status":"public","oa":1,"OA_type":"green","OA_place":"repository","date_published":"2024-10-10T00:00:00Z","article_processing_charge":"No","department":[{"_id":"E-Lib"}],"abstract":[{"text":"In this study, we analyzed the efficiency of different adeno-associated viral (AAV) injections in transfecting neurons in the salamander Pleurodeles waltl. To query sources of variation in AAV injection outcomes, we analyzed metadata and outcomes for an additional 68 intraparenchymal injections performed 39 in post-metamorphic Pleurodeles salamanders. This dataset included both quantitative variables (age, weight, viral genomes (v.g.) injected, and a cell transduction score ranging from 0 to 4, see STAR Methods) and categorical variables (here referred to as qualitative variables: serotype, promoter, reporter, single vs. dual injection, manufacturer, and injection site). To assess the associations between these variables, we performed a Factor Analysis for Mixed Data (FAMD), a principal component method that is designed to determine significant sources of variability within datasets that contain both quantitative and qualitative data types. This dataset contains the injection outcomes and metadata for AAV injections administered in the salamander Pleurodeles waltl. The RactoMineR package (https://CRAN.R-project.org/package=FactoMineR) was used to determine significant contributions of a number of variables contributing to injection outcomes. Analysis of these data revealed that, among other factors, age co-varies with injection score. Therefore, we conclude that increased animal age decreases the efficacy of this tool.","lang":"eng"}],"title":"Multivariate analysis of Pleurodeles waltl injection outcomes using FAMD FactoMineR (RStudio 4.3.2) used to probe sources of variability during an Adeno-associated viral (AAV) screen","oa_version":"None","doi":"10.5061/dryad.mpg4f4r89","author":[{"full_name":"Jaeger, Eliza","last_name":"Jaeger","first_name":"Eliza"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.mpg4f4r89"}],"type":"research_data_reference","date_created":"2026-09-04T10:10:52Z","fulldoi":"https://doi.org/10.5061/dryad.mpg4f4r89","day":"10","publisher":"Repository","month":"10","year":"2024","citation":{"chicago":"Jaeger, Eliza. “Multivariate Analysis of Pleurodeles Waltl Injection Outcomes Using FAMD FactoMineR (RStudio 4.3.2) Used to Probe Sources of Variability during an Adeno-Associated Viral (AAV) Screen.” Repository, 2024. <a href=\"https://doi.org/10.5061/dryad.mpg4f4r89\">https://doi.org/10.5061/dryad.mpg4f4r89</a>.","mla":"Jaeger, Eliza. <i>Multivariate Analysis of Pleurodeles Waltl Injection Outcomes Using FAMD FactoMineR (RStudio 4.3.2) Used to Probe Sources of Variability during an Adeno-Associated Viral (AAV) Screen</i>. Repository, 2024, doi:<a href=\"https://doi.org/10.5061/dryad.mpg4f4r89\">10.5061/dryad.mpg4f4r89</a>.","ama":"Jaeger E. Multivariate analysis of Pleurodeles waltl injection outcomes using FAMD FactoMineR (RStudio 4.3.2) used to probe sources of variability during an Adeno-associated viral (AAV) screen. 2024. doi:<a href=\"https://doi.org/10.5061/dryad.mpg4f4r89\">10.5061/dryad.mpg4f4r89</a>","ieee":"E. Jaeger, “Multivariate analysis of Pleurodeles waltl injection outcomes using FAMD FactoMineR (RStudio 4.3.2) used to probe sources of variability during an Adeno-associated viral (AAV) screen.” Repository, 2024.","ista":"Jaeger E. 2024. Multivariate analysis of Pleurodeles waltl injection outcomes using FAMD FactoMineR (RStudio 4.3.2) used to probe sources of variability during an Adeno-associated viral (AAV) screen, Repository, <a href=\"https://doi.org/10.5061/dryad.mpg4f4r89\">10.5061/dryad.mpg4f4r89</a>.","short":"E. Jaeger, (2024).","apa":"Jaeger, E. (2024). Multivariate analysis of Pleurodeles waltl injection outcomes using FAMD FactoMineR (RStudio 4.3.2) used to probe sources of variability during an Adeno-associated viral (AAV) screen. Repository. <a href=\"https://doi.org/10.5061/dryad.mpg4f4r89\">https://doi.org/10.5061/dryad.mpg4f4r89</a>"},"related_material":{"record":[{"id":"15016","relation":"used_in_publication","status":"public"}]},"date_updated":"2026-09-04T10:11:04Z"},{"file":[{"content_type":"application/x-zip-compressed","creator":"gpascual","file_id":"18099","file_name":"thesis_bundle.zip","relation":"source_file","date_created":"2024-09-19T12:35:38Z","checksum":"ce0dca715b3df48e52e2e891b6ac1bc5","file_size":11917734,"access_level":"closed","date_updated":"2024-09-19T12:35:38Z"},{"date_created":"2024-09-19T12:36:08Z","relation":"main_file","file_name":"thesis_gpasper.pdf","file_id":"18100","creator":"gpascual","content_type":"application/pdf","access_level":"open_access","date_updated":"2024-09-19T12:36:08Z","file_size":2729427,"checksum":"4a2c72e90f1a0ef2a13cff800f8d1265"}],"file_date_updated":"2024-09-19T12:36:08Z","date_updated":"2026-09-07T14:12:38Z","year":"2024","publisher":"Institute of Science and Technology Austria","month":"09","alternative_title":["ISTA Thesis"],"fulldoi":"https://doi.org/10.15479/at:ista:18088","doi":"10.15479/at:ista:18088","department":[{"_id":"KrPi"},{"_id":"GradSch"}],"abstract":[{"text":"Instant messaging applications like Whatsapp, Signal or Telegram have become ubiquitous in today's society.\r\nMany of them provide not only end-to-end encryption, but also security guarantees even when the key material gets compromised.\r\nThese are achieved through frequent key update performed by users.\r\nIn particular, the compromise of a group key should preserve confidentiality of previously exchanged messages (forward secrecy), and a subsequent key update will ensure security for future ones (post-compromise security).\r\nThough great protocols for one-on-one communication have been known for some time, the design of ones that scale efficiently for larger groups while achieving akin security guarantees is a hard problem.\r\nA great deal of research has been aimed at this topic, much of it under the umbrella of the Messaging Layer Security (MLS) working group at the IETF. \r\nStarted in 2018, this joint effort by academics and industry culminated in 2023 with the publication of the first standard for secure group messaging [IETF, RFC9420].\r\n\r\nAt the core of secure group messaging is a cryptographic primitive termed Continuous Group Key Agreement, or CGKA [Alwen et al. 2021], that essentially allows a changing group of users to agree on a common key with the added functionality security against compromises is achieved by users asynchronously issuing a key update. In this thesis we contribute to the understanding of CGKA across different angles.\r\nFirst, we present a new technique to effect dynamic operations in groups, i.e., add or remove members, that can be more efficient that the one employed by MLS in certain settings.\r\nConsidering the setting of users belonging to multiple overlapping groups, we then show lowerbounds on the communication cost of constructions that leverage said overlap, at the same time showing protocols that are asymptotically optimal and efficient for practical settings, respectively. Along the way, we show that the communication cost of key updates in MLS is average-cost optimal.\r\nAn important feature in CGKA protocols, particularly for big groups, is the possibility of executing several group operations concurrently. While later versions of MLS support this, they do at the cost of worsening the communication efficiency of future group operations.\r\nIn this thesis we introduce two new protocols that permit concurrency without any negative effect on efficiency. Our protocols circumvent previously existing lower bounds by satisfying a new notion of post-compromise security that only asks for security to be re-established after a certain number of key updates have taken place. While this can be slower than MLS in terms of rounds of communication, we show that it leads to more efficient overall communication. \r\nAdditionally, we introduce a new technique that allows group members to decrease the information they need to store and download, which makes one of our protocols enjoy much lower download cost than any other existing CGKA constructions. ","lang":"eng"}],"article_processing_charge":"No","page":"239","author":[{"full_name":"Pascual Perez, Guillermo","last_name":"Pascual Perez","orcid":"0000-0001-8630-415X","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","first_name":"Guillermo"}],"supervisor":[{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"}],"_id":"18088","language":[{"iso":"eng"}],"has_accepted_license":"1","oa":1,"ddc":["000"],"project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"}],"citation":{"ama":"Pascual Perez G. On the efficiency and security of secure group messaging. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18088\">10.15479/at:ista:18088</a>","mla":"Pascual Perez, Guillermo. <i>On the Efficiency and Security of Secure Group Messaging</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18088\">10.15479/at:ista:18088</a>.","chicago":"Pascual Perez, Guillermo. “On the Efficiency and Security of Secure Group Messaging.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18088\">https://doi.org/10.15479/at:ista:18088</a>.","apa":"Pascual Perez, G. (2024). <i>On the efficiency and security of secure group messaging</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18088\">https://doi.org/10.15479/at:ista:18088</a>","short":"G. Pascual Perez, On the Efficiency and Security of Secure Group Messaging, Institute of Science and Technology Austria, 2024.","ista":"Pascual Perez G. 2024. On the efficiency and security of secure group messaging. Institute of Science and Technology Austria.","ieee":"G. Pascual Perez, “On the efficiency and security of secure group messaging,” Institute of Science and Technology Austria, 2024."},"related_material":{"record":[{"relation":"part_of_dissertation","id":"10408","status":"public"},{"status":"public","id":"11476","relation":"part_of_dissertation"},{"status":"public","id":"18086","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"10049","status":"public"}]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"type":"dissertation","corr_author":"1","date_created":"2024-09-18T12:59:49Z","day":"18","title":"On the efficiency and security of secure group messaging","oa_version":"Published Version","degree_awarded":"PhD","ec_funded":1,"date_published":"2024-09-18T00:00:00Z","publication_identifier":{"issn":["2663-337X"]},"OA_place":"publisher","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published"},{"type":"conference","isi":1,"corr_author":"1","date_created":"2024-09-18T11:35:14Z","day":"10","citation":{"mla":"Alwen, Joel F., et al. “DeCAF: Decentralizable CGKA with Fast Healing.” <i>Security and Cryptography for Networks: 14th International Conference</i>, edited by Clemente Galdi and Duong Hieu Phan, vol. 14974, Springer Nature, 2024, pp. 294–313, doi:<a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">10.1007/978-3-031-71073-5_14</a>.","chicago":"Alwen, Joel F, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “DeCAF: Decentralizable CGKA with Fast Healing.” In <i>Security and Cryptography for Networks: 14th International Conference</i>, edited by Clemente Galdi and Duong Hieu Phan, 14974:294–313. Cham: Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">https://doi.org/10.1007/978-3-031-71073-5_14</a>.","ama":"Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. DeCAF: Decentralizable CGKA with fast healing. In: Galdi C, Phan DH, eds. <i>Security and Cryptography for Networks: 14th International Conference</i>. Vol 14974. Cham: Springer Nature; 2024:294–313. doi:<a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">10.1007/978-3-031-71073-5_14</a>","ista":"Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. 2024. DeCAF: Decentralizable CGKA with fast healing. Security and Cryptography for Networks: 14th International Conference. SCN: Security and Cryptography for Networks, LNCS, vol. 14974, 294–313.","ieee":"J. F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, and K. Z. Pietrzak, “DeCAF: Decentralizable CGKA with fast healing,” in <i>Security and Cryptography for Networks: 14th International Conference</i>, Amalfi, Italy, 2024, vol. 14974, pp. 294–313.","apa":"Alwen, J. F., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G., &#38; Pietrzak, K. Z. (2024). DeCAF: Decentralizable CGKA with fast healing. In C. Galdi &#38; D. H. Phan (Eds.), <i>Security and Cryptography for Networks: 14th International Conference</i> (Vol. 14974, pp. 294–313). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">https://doi.org/10.1007/978-3-031-71073-5_14</a>","short":"J.F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, in:, C. Galdi, D.H. Phan (Eds.), Security and Cryptography for Networks: 14th International Conference, Springer Nature, Cham, 2024, pp. 294–313."},"place":"Cham","related_material":{"record":[{"status":"public","id":"18088","relation":"dissertation_contains"}]},"publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783031710735"],"issn":["0302-9743"],"isbn":["9783031710728"]},"editor":[{"full_name":"Galdi, Clemente","first_name":"Clemente","last_name":"Galdi"},{"full_name":"Phan, Duong Hieu","first_name":"Duong Hieu","last_name":"Phan"}],"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Security and Cryptography for Networks: 14th International Conference","status":"public","title":"DeCAF: Decentralizable CGKA with fast healing","oa_version":"None","date_published":"2024-09-10T00:00:00Z","conference":{"location":"Amalfi, Italy","end_date":"2024-09-13","name":"SCN: Security and Cryptography for Networks","start_date":"2024-09-11"},"quality_controlled":"1","month":"09","publisher":"Springer Nature","year":"2024","volume":14974,"fulldoi":"https://doi.org/10.1007/978-3-031-71073-5_14","alternative_title":["LNCS"],"date_updated":"2026-09-07T14:12:37Z","_id":"18086","language":[{"iso":"eng"}],"external_id":{"isi":["001330408000014"]},"intvolume":"     14974","doi":"10.1007/978-3-031-71073-5_14","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Abstract. Continuous group key agreement (CGKA) allows a group of\r\nusers to maintain a continuously updated shared key in an asynchronous\r\nsetting where parties only come online sporadically and their messages\r\nare relayed by an untrusted server. CGKA captures the basic primitive\r\nunderlying group messaging schemes.\r\nCurrent solutions including TreeKEM (“Messaging Layer Security”\r\n(MLS) IETF RFC 9420) cannot handle concurrent requests while retaining low communication complexity. The exception being CoCoA, which\r\nis concurrent while having extremely low communication complexity (in\r\ngroups of size n and for m concurrent updates the communication per\r\nuser is log(n), i.e., independent of m). The main downside of CoCoA\r\nis that in groups of size n, users might have to do up to log(n) update\r\nrequests to the server to ensure their (potentially corrupted) key material has been refreshed.\r\nIn this work we present a “fast healing” concurrent CGKA protocol,\r\nnamed DeCAF, where users will heal after at most log(t) requests, with\r\nt being the number of corrupted users. While also suitable for the standard central-server setting, our protocol is particularly interesting for\r\nrealizing decentralized group messaging, where protocol messages (add,\r\nremove, update) are being posted on some append-only data structure\r\nrather than sent to a server. In this setting, concurrency is crucial once\r\nthe rate of requests exceeds, say, the rate at which new blocks are added\r\nto a blockchain.\r\nIn the central-server setting, CoCoA (the only alternative with concurrency, sub-linear communication and basic post-compromise security)\r\nenjoys much lower download communication. However, in the decentralized setting – where there is no server which can craft specific messages\r\nfor different users to reduce their download communication – our protocol\r\nsignificantly outperforms CoCoA. DeCAF heals in fewer epochs (log(t)\r\nvs. log(n)) while incurring a similar per epoch per user communication\r\ncost."}],"department":[{"_id":"GradSch"},{"_id":"KrPi"}],"author":[{"full_name":"Alwen, Joel F","last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Auerbach, Benedikt","last_name":"Auerbach","first_name":"Benedikt","orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425"},{"full_name":"Cueto Noval, Miguel","last_name":"Cueto Noval","first_name":"Miguel","orcid":"0000-0002-2505-4246","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc"},{"last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","full_name":"Klein, Karen"},{"last_name":"Pascual Perez","first_name":"Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8630-415X","full_name":"Pascual Perez, Guillermo"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"}],"page":"294–313"},{"type":"conference","date_created":"2024-12-22T23:01:47Z","day":"02","scopus_import":"1","isi":1,"corr_author":"1","citation":{"short":"M. Anastos, B. Auerbach, M.A. Baig, M. Cueto Noval, M.A. Kwan, G. Pascual Perez, K.Z. Pietrzak, in:, 22nd International Conference on Theory of Cryptography, Springer Nature, 2024, pp. 413–443.","apa":"Anastos, M., Auerbach, B., Baig, M. A., Cueto Noval, M., Kwan, M. A., Pascual Perez, G., &#38; Pietrzak, K. Z. (2024). The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging. In <i>22nd International Conference on Theory of Cryptography</i> (Vol. 15364, pp. 413–443). Milan, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-78011-0_14\">https://doi.org/10.1007/978-3-031-78011-0_14</a>","ieee":"M. Anastos <i>et al.</i>, “The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging,” in <i>22nd International Conference on Theory of Cryptography</i>, Milan, Italy, 2024, vol. 15364, pp. 413–443.","ista":"Anastos M, Auerbach B, Baig MA, Cueto Noval M, Kwan MA, Pascual Perez G, Pietrzak KZ. 2024. The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging. 22nd International Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 15364, 413–443.","ama":"Anastos M, Auerbach B, Baig MA, et al. The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging. In: <i>22nd International Conference on Theory of Cryptography</i>. Vol 15364. Springer Nature; 2024:413-443. doi:<a href=\"https://doi.org/10.1007/978-3-031-78011-0_14\">10.1007/978-3-031-78011-0_14</a>","chicago":"Anastos, Michael, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Alan Kwan, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” In <i>22nd International Conference on Theory of Cryptography</i>, 15364:413–43. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-78011-0_14\">https://doi.org/10.1007/978-3-031-78011-0_14</a>.","mla":"Anastos, Michael, et al. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” <i>22nd International Conference on Theory of Cryptography</i>, vol. 15364, Springer Nature, 2024, pp. 413–43, doi:<a href=\"https://doi.org/10.1007/978-3-031-78011-0_14\">10.1007/978-3-031-78011-0_14</a>."},"related_material":{"record":[{"status":"public","id":"22664","relation":"dissertation_contains"}]},"publication_identifier":{"isbn":["9783031780103"],"issn":["0302-9743"],"eissn":["1611-3349"]},"publication_status":"published","publication":"22nd International Conference on Theory of Cryptography","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","OA_type":"green","OA_place":"repository","date_published":"2024-12-02T00:00:00Z","title":"The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging","oa_version":"Preprint","conference":{"name":"TCC: Theory of Cryptography","start_date":"2024-12-02","location":"Milan, Italy","end_date":"2024-12-06"},"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2024/1097"}],"fulldoi":"https://doi.org/10.1007/978-3-031-78011-0_14","alternative_title":["LNCS"],"year":"2024","publisher":"Springer Nature","month":"12","volume":15364,"date_updated":"2026-09-07T11:37:57Z","_id":"18702","oa":1,"intvolume":"     15364","language":[{"iso":"eng"}],"external_id":{"isi":["001545628900014"]},"article_processing_charge":"No","abstract":[{"text":"In this work we prove lower bounds on the (communication) cost of maintaining a shared key among a dynamic group of users. Being “dynamic” means one can add and remove users from the group. This captures important protocols like multicast encryption (ME) and continuous group-key agreement (CGKA), which is the primitive underlying many group messaging applications. We prove our bounds in a combinatorial setting where the state of the protocol progresses in rounds. The state of the protocol in each round is captured by a set system, with each of its elements specifying a set of users who share a secret key. We show this combinatorial model implies bounds in symbolic models for ME and CGKA that capture, as building blocks, PRGs, PRFs, dual PRFs, secret sharing, and symmetric encryption in the setting of ME, and PRGs, PRFs, dual PRFs, secret sharing, public-key encryption, and key-updatable public-key encryption in the setting of CGKA. The models are related to the ones used by Micciancio and Panjwani (Eurocrypt’04) and Bienstock et al. (TCC’20) to analyze ME and CGKA, respectively. We prove – using the Bollobás’ Set Pairs Inequality – that the cost (number of uploaded ciphertexts) for replacing a set of d users in a group of size n is Ω(dln(n/d)). Our lower bound is asymptotically tight and both improves on a bound of Ω(d) by Bienstock et al. (TCC’20), and generalizes a result by Micciancio and Panjwani (Eurocrypt’04), who proved a lower bound of Ω(log(n)) for d=1. ","lang":"eng"}],"department":[{"_id":"MaKw"},{"_id":"KrPi"}],"doi":"10.1007/978-3-031-78011-0_14","author":[{"last_name":"Anastos","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","first_name":"Michael","full_name":"Anastos, Michael"},{"first_name":"Benedikt","orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","last_name":"Auerbach","full_name":"Auerbach, Benedikt"},{"full_name":"Baig, Mirza Ahad","last_name":"Baig","first_name":"Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425"},{"first_name":"Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","orcid":"0000-0002-2505-4246","last_name":"Cueto Noval","full_name":"Cueto Noval, Miguel"},{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","first_name":"Matthew Alan","last_name":"Kwan","full_name":"Kwan, Matthew Alan"},{"full_name":"Pascual Perez, Guillermo","last_name":"Pascual Perez","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","first_name":"Guillermo","orcid":"0000-0001-8630-415X"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"}],"page":"413-443"},{"date_updated":"2026-09-09T08:44:31Z","file_date_updated":"2024-11-04T10:37:56Z","file":[{"file_size":7358742,"checksum":"b936b1c047f41cd427f00e3dc79327d3","date_updated":"2024-11-04T10:37:56Z","access_level":"open_access","success":1,"file_name":"2024_NatureComm_dosSantos.pdf","relation":"main_file","content_type":"application/pdf","file_id":"18502","creator":"dernst","date_created":"2024-11-04T10:37:56Z"}],"pmid":1,"fulldoi":"https://doi.org/10.1038/s41467-024-53127-2","volume":15,"year":"2024","publisher":"Springer Nature","month":"10","author":[{"full_name":"Dos Santos, Cristiane","first_name":"Cristiane","last_name":"Dos Santos"},{"full_name":"Cambraia, Amanda","first_name":"Amanda","last_name":"Cambraia"},{"last_name":"Shrestha","first_name":"Shristi","full_name":"Shrestha, Shristi"},{"full_name":"Cutler, Melanie","last_name":"Cutler","first_name":"Melanie"},{"last_name":"Cottam","first_name":"Matthew","full_name":"Cottam, Matthew"},{"last_name":"Perkins","first_name":"Guy","full_name":"Perkins, Guy"},{"last_name":"Lev-Ram","first_name":"Varda","full_name":"Lev-Ram, Varda"},{"full_name":"Roy, Birbickram","first_name":"Birbickram","last_name":"Roy"},{"full_name":"Acree, Christopher","last_name":"Acree","first_name":"Christopher"},{"first_name":"Keun Young","last_name":"Kim","full_name":"Kim, Keun Young"},{"first_name":"Thomas","last_name":"Deerinck","full_name":"Deerinck, Thomas"},{"full_name":"Dean, Danielle","last_name":"Dean","first_name":"Danielle"},{"full_name":"Cartailler, Jean Philippe","first_name":"Jean Philippe","last_name":"Cartailler"},{"full_name":"Macdonald, Patrick E.","first_name":"Patrick E.","last_name":"Macdonald"},{"first_name":"Martin W","orcid":"0000-0002-2111-992X","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","last_name":"Hetzer","full_name":"Hetzer, Martin W"},{"full_name":"Ellisman, Mark","last_name":"Ellisman","first_name":"Mark"},{"full_name":"Arrojo E Drigo, Rafael","last_name":"Arrojo E Drigo","first_name":"Rafael"}],"department":[{"_id":"MaHe"}],"abstract":[{"text":"Caloric restriction (CR) can extend the organism life- and health-span by improving glucose homeostasis. How CR affects the structure-function of pancreatic beta cells remains unknown. We used single nucleus transcriptomics to show that CR increases the expression of genes for beta cell identity, protein processing, and organelle homeostasis. Gene regulatory network analysis reveal that CR activates transcription factors important for beta cell identity and homeostasis, while imaging metabolomics demonstrates that beta cells upon CR are more energetically competent. In fact, high-resolution microscopy show that CR reduces beta cell mitophagy to increase mitochondria mass and the potential for ATP generation. However, CR beta cells have impaired adaptive proliferation in response to high fat diet feeding. Finally, we show that long-term CR delays the onset of beta cell aging hallmarks and promotes cell longevity by reducing beta cell turnover. Therefore, CR could be a feasible approach to preserve compromised beta cell structure-function during aging and diabetes.","lang":"eng"}],"article_processing_charge":"Yes","doi":"10.1038/s41467-024-53127-2","intvolume":"        15","has_accepted_license":"1","oa":1,"ddc":["570"],"external_id":{"isi":["001426270600023"],"pmid":["39433757"]},"language":[{"iso":"eng"}],"_id":"18480","related_material":{"record":[{"status":"public","relation":"research_data","id":"22865"}]},"DOAJ_listed":"1","acknowledgement":"We are thankful to Michelle Reyzer from the Vanderbilt Mass Spectrometry Research Center for assistance with MALDI-MS imaging and analysis, to the outstanding team at the Vanderbilt Mouse Metabolic Phenotyping Center for all the assistance with in vivo glucose homeostasis tests (DK135073, 1S10RR028101-01). We also thank the University of Michigan Animal Phenotyping Core for conducting the bomb calorimetry experiments (1U2CDK110768, DK020575, and DK089503). This research was supported by recruitment funds from the Vanderbilt’s Department of Molecular Physiology and Biophysics and NIH grants 1R03DK127484, 5U24DK097771, and 1R01DK138141 to RAeD, by a grant from the Canadian Institutes of Health Research (CIHR; 487188) to PEM, by and NIH DK132669 to D.D. PEM holds the Canada Research Chair in Islet Biology.","citation":{"chicago":"Dos Santos, Cristiane, Amanda Cambraia, Shristi Shrestha, Melanie Cutler, Matthew Cottam, Guy Perkins, Varda Lev-Ram, et al. “Calorie Restriction Increases Insulin Sensitivity to Promote Beta Cell Homeostasis and Longevity in Mice.” <i>Nature Communications</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41467-024-53127-2\">https://doi.org/10.1038/s41467-024-53127-2</a>.","mla":"Dos Santos, Cristiane, et al. “Calorie Restriction Increases Insulin Sensitivity to Promote Beta Cell Homeostasis and Longevity in Mice.” <i>Nature Communications</i>, vol. 15, 9063, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1038/s41467-024-53127-2\">10.1038/s41467-024-53127-2</a>.","ama":"Dos Santos C, Cambraia A, Shrestha S, et al. Calorie restriction increases insulin sensitivity to promote beta cell homeostasis and longevity in mice. <i>Nature Communications</i>. 2024;15. doi:<a href=\"https://doi.org/10.1038/s41467-024-53127-2\">10.1038/s41467-024-53127-2</a>","ieee":"C. Dos Santos <i>et al.</i>, “Calorie restriction increases insulin sensitivity to promote beta cell homeostasis and longevity in mice,” <i>Nature Communications</i>, vol. 15. Springer Nature, 2024.","ista":"Dos Santos C, Cambraia A, Shrestha S, Cutler M, Cottam M, Perkins G, Lev-Ram V, Roy B, Acree C, Kim KY, Deerinck T, Dean D, Cartailler JP, Macdonald PE, Hetzer M, Ellisman M, Arrojo E Drigo R. 2024. Calorie restriction increases insulin sensitivity to promote beta cell homeostasis and longevity in mice. Nature Communications. 15, 9063.","short":"C. Dos Santos, A. Cambraia, S. Shrestha, M. Cutler, M. Cottam, G. Perkins, V. Lev-Ram, B. Roy, C. Acree, K.Y. Kim, T. Deerinck, D. Dean, J.P. Cartailler, P.E. Macdonald, M. Hetzer, M. Ellisman, R. Arrojo E Drigo, Nature Communications 15 (2024).","apa":"Dos Santos, C., Cambraia, A., Shrestha, S., Cutler, M., Cottam, M., Perkins, G., … Arrojo E Drigo, R. (2024). Calorie restriction increases insulin sensitivity to promote beta cell homeostasis and longevity in mice. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-024-53127-2\">https://doi.org/10.1038/s41467-024-53127-2</a>"},"article_type":"original","day":"21","date_created":"2024-10-27T23:01:44Z","scopus_import":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"type":"journal_article","quality_controlled":"1","date_published":"2024-10-21T00:00:00Z","title":"Calorie restriction increases insulin sensitivity to promote beta cell homeostasis and longevity in mice","article_number":"9063","oa_version":"Published Version","status":"public","publication":"Nature Communications","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","OA_place":"publisher","OA_type":"gold","publication_identifier":{"eissn":["2041-1723"]}},{"year":"2024","publisher":"Repository","month":"10","fulldoi":"https://doi.org/10.5281/zenodo.6491943","day":"21","date_created":"2026-09-09T08:43:34Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.6491943"}],"type":"research_data_reference","date_updated":"2026-09-09T08:44:32Z","related_material":{"record":[{"relation":"used_in_publication","id":"18480","status":"public"}]},"citation":{"ieee":"R. Arrojo e Drigo, “Calorie restriction increases insulin sensitivity to promote beta cell homeostasis and longevity.” Repository, 2024.","ista":"Arrojo e Drigo R. 2024. Calorie restriction increases insulin sensitivity to promote beta cell homeostasis and longevity, Repository, <a href=\"https://doi.org/10.5281/zenodo.6491943\">10.5281/zenodo.6491943</a>.","short":"R. Arrojo e Drigo, (2024).","apa":"Arrojo e Drigo, R. (2024). Calorie restriction increases insulin sensitivity to promote beta cell homeostasis and longevity. Repository. <a href=\"https://doi.org/10.5281/zenodo.6491943\">https://doi.org/10.5281/zenodo.6491943</a>","chicago":"Arrojo e Drigo, Rafael. “Calorie Restriction Increases Insulin Sensitivity to Promote Beta Cell Homeostasis and Longevity.” Repository, 2024. <a href=\"https://doi.org/10.5281/zenodo.6491943\">https://doi.org/10.5281/zenodo.6491943</a>.","mla":"Arrojo e Drigo, Rafael. <i>Calorie Restriction Increases Insulin Sensitivity to Promote Beta Cell Homeostasis and Longevity</i>. Repository, 2024, doi:<a href=\"https://doi.org/10.5281/zenodo.6491943\">10.5281/zenodo.6491943</a>.","ama":"Arrojo e Drigo R. Calorie restriction increases insulin sensitivity to promote beta cell homeostasis and longevity. 2024. doi:<a href=\"https://doi.org/10.5281/zenodo.6491943\">10.5281/zenodo.6491943</a>"},"OA_place":"repository","OA_type":"green","status":"public","oa":1,"ddc":["570"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"22865","author":[{"full_name":"Arrojo e Drigo, Rafael","first_name":"Rafael","last_name":"Arrojo e Drigo"}],"oa_version":"None","doi":"10.5281/zenodo.6491943","title":"Calorie restriction increases insulin sensitivity to promote beta cell homeostasis and longevity","department":[{"_id":"MaHe"}],"abstract":[{"text":"Dataset for Dos Santos et al, 2024","lang":"eng"}],"article_processing_charge":"No","date_published":"2024-10-21T00:00:00Z"},{"related_material":{"record":[{"relation":"used_in_publication","id":"18710","status":"public"}]},"date_updated":"2026-09-09T09:20:40Z","citation":{"ama":"Hrast M. Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl. 2024. doi:<a href=\"https://doi.org/10.5281/zenodo.13833474\">10.5281/zenodo.13833474</a>","mla":"Hrast, Mateja. <i>Data for: Ab Initio Auger Spectrum of the Ultrafast Dissociating 2p3/2−1σ* Resonance in HCl</i>. Repository, 2024, doi:<a href=\"https://doi.org/10.5281/zenodo.13833474\">10.5281/zenodo.13833474</a>.","chicago":"Hrast, Mateja. “Data for: Ab Initio Auger Spectrum of the Ultrafast Dissociating 2p3/2−1σ* Resonance in HCl.” Repository, 2024. <a href=\"https://doi.org/10.5281/zenodo.13833474\">https://doi.org/10.5281/zenodo.13833474</a>.","apa":"Hrast, M. (2024). Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl. Repository. <a href=\"https://doi.org/10.5281/zenodo.13833474\">https://doi.org/10.5281/zenodo.13833474</a>","short":"M. Hrast, (2024).","ista":"Hrast M. 2024. Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl, Repository, <a href=\"https://doi.org/10.5281/zenodo.13833474\">10.5281/zenodo.13833474</a>.","ieee":"M. Hrast, “Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl.” Repository, 2024."},"day":"24","fulldoi":"https://doi.org/10.5281/zenodo.13833474","date_created":"2026-09-09T09:20:36Z","year":"2024","publisher":"Repository","month":"09","type":"research_data_reference","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.13833475"}],"author":[{"full_name":"Hrast, Mateja","last_name":"Hrast","first_name":"Mateja"}],"department":[{"_id":"MiLe"},{"_id":"MaSe"}],"article_processing_charge":"No","date_published":"2024-09-24T00:00:00Z","oa_version":"None","doi":"10.5281/zenodo.13833474","title":"Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl","status":"public","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ddc":["530"],"OA_type":"green","OA_place":"repository","_id":"22866"}]
