[{"date_created":"2024-01-22T12:02:28Z","year":"2023","publication":"European Journal of Public Health","publication_status":"published","file_date_updated":"2024-01-24T11:12:33Z","article_number":"ckad160.597","intvolume":" 33","date_published":"2023-10-01T00:00:00Z","ddc":["570"],"month":"10","publisher":"Oxford University Press","citation":{"short":"S. Rella, Y. Kulikova, A. Minnegalieva, F. Kondrashov, in:, European Journal of Public Health, Oxford University Press, 2023.","mla":"Rella, Simon, et al. “Complex Vaccination Strategies Prevent the Emergence of Vaccine Resistance.” European Journal of Public Health, vol. 33, no. Supplement_2, ckad160.597, Oxford University Press, 2023, doi:10.1093/eurpub/ckad160.597.","chicago":"Rella, Simon, Y Kulikova, Aygul Minnegalieva, and Fyodor Kondrashov. “Complex Vaccination Strategies Prevent the Emergence of Vaccine Resistance.” In European Journal of Public Health, Vol. 33. Oxford University Press, 2023. https://doi.org/10.1093/eurpub/ckad160.597.","apa":"Rella, S., Kulikova, Y., Minnegalieva, A., & Kondrashov, F. (2023). Complex vaccination strategies prevent the emergence of vaccine resistance. In European Journal of Public Health (Vol. 33). Oxford University Press. https://doi.org/10.1093/eurpub/ckad160.597","ieee":"S. Rella, Y. Kulikova, A. Minnegalieva, and F. Kondrashov, “Complex vaccination strategies prevent the emergence of vaccine resistance,” in European Journal of Public Health, 2023, vol. 33, no. Supplement_2.","ista":"Rella S, Kulikova Y, Minnegalieva A, Kondrashov F. 2023. Complex vaccination strategies prevent the emergence of vaccine resistance. European Journal of Public Health. vol. 33, ckad160.597.","ama":"Rella S, Kulikova Y, Minnegalieva A, Kondrashov F. Complex vaccination strategies prevent the emergence of vaccine resistance. In: European Journal of Public Health. Vol 33. Oxford University Press; 2023. doi:10.1093/eurpub/ckad160.597"},"oa_version":"Published Version","quality_controlled":"1","status":"public","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"18307"}]},"language":[{"iso":"eng"}],"type":"conference_abstract","author":[{"last_name":"Rella","first_name":"Simon","full_name":"Rella, Simon","id":"B4765ACA-AA38-11E9-AC9A-0930E6697425"},{"first_name":"Y","last_name":"Kulikova","full_name":"Kulikova, Y"},{"full_name":"Minnegalieva, Aygul","id":"87DF77F0-1D9A-11EA-B6AE-CE443DDC885E","last_name":"Minnegalieva","first_name":"Aygul"},{"orcid":"0000-0001-8243-4694","first_name":"Fyodor","last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor"}],"date_updated":"2026-10-02T10:12:19Z","keyword":["Public Health","Environmental and Occupational Health"],"doi":"10.1093/eurpub/ckad160.597","oa":1,"file":[{"file_size":71057,"file_name":"2023_EurJourPublicHealth_Rella.pdf","creator":"dernst","checksum":"98706755bb4cc5d553818ade7660a7d2","content_type":"application/pdf","file_id":"14882","date_created":"2024-01-24T11:12:33Z","success":1,"relation":"main_file","date_updated":"2024-01-24T11:12:33Z","access_level":"open_access"}],"tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"corr_author":"1","issue":"Supplement_2","article_processing_charge":"No","volume":33,"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Complex vaccination strategies prevent the emergence of vaccine resistance","_id":"14862","day":"01","publication_identifier":{"issn":["1101-1262"],"eissn":["1464-360X"]},"fulldoi":"https://doi.org/10.1093/eurpub/ckad160.597","department":[{"_id":"GaTk"}]},{"title":"Radio frequency driven superconducting diode and parity conserving Cooper pair transport in a two-dimensional germanium hole gas","_id":"13312","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"fulldoi":"https://doi.org/10.48550/arXiv.2306.07109","department":[{"_id":"GeKa"},{"_id":"M-Shop"}],"arxiv":1,"day":"13","corr_author":"1","project":[{"_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","grant_number":"862046","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS","call_identifier":"H2020"},{"call_identifier":"FWF","name":"Towards scalable hut wire quantum devices","grant_number":"P32235","_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E"},{"_id":"bd8bd29e-d553-11ed-ba76-f0070d4b237a","name":"Merging spin and superconducting qubits in planar Ge","grant_number":"P36507"},{"_id":"34a66131-11ca-11ed-8bc3-a31681c6b03e","name":"Center for Correlated Quantum Materials and Solid State Quantum Systems: Conventional and unconventional topological superconductors","grant_number":"F8606"},{"_id":"eb9b30ac-77a9-11ec-83b8-871f581d53d2","name":"Protected states of quantum matter"}],"oa":1,"doi":"10.48550/arXiv.2306.07109","keyword":["Mesoscale and Nanoscale Physics"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2306.07109","open_access":"1"}],"article_processing_charge":"No","external_id":{"arxiv":["2306.07109"]},"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"13286","relation":"dissertation_contains","status":"public"},{"status":"public","id":"14793","relation":"later_version"}]},"abstract":[{"lang":"eng","text":"Superconductor/semiconductor hybrid devices have attracted increasing\r\ninterest in the past years. Superconducting electronics aims to complement\r\nsemiconductor technology, while hybrid architectures are at the forefront of\r\nnew ideas such as topological superconductivity and protected qubits. In this\r\nwork, we engineer the induced superconductivity in two-dimensional germanium\r\nhole gas by varying the distance between the quantum well and the aluminum. We\r\ndemonstrate a hard superconducting gap and realize an electrically and flux\r\ntunable superconducting diode using a superconducting quantum interference\r\ndevice (SQUID). This allows to tune the current phase relation (CPR), to a\r\nregime where single Cooper pair tunneling is suppressed, creating a $ \\sin\r\n\\left( 2 \\varphi \\right)$ CPR. Shapiro experiments complement this\r\ninterpretation and the microwave drive allows to create a diode with $ \\approx\r\n100 \\%$ efficiency. The reported results open up the path towards monolithic\r\nintegration of spin qubit devices, microwave resonators and (protected)\r\nsuperconducting qubits on a silicon technology compatible platform."}],"OA_place":"repository","type":"preprint","status":"public","date_updated":"2026-10-02T10:23:31Z","author":[{"full_name":"Valentini, Marco","id":"C0BB2FAC-D767-11E9-B658-BC13E6697425","last_name":"Valentini","first_name":"Marco"},{"id":"71616374-A8E9-11E9-A7CA-09ECE5697425","full_name":"Sagi, Oliver","first_name":"Oliver","last_name":"Sagi"},{"full_name":"Baghumyan, Levon","first_name":"Levon","last_name":"Baghumyan"},{"first_name":"Thijs de","last_name":"Gijsel","full_name":"Gijsel, Thijs de"},{"first_name":"Jason","last_name":"Jung","id":"4C9ACE7A-F248-11E8-B48F-1D18A9856A87","full_name":"Jung, Jason"},{"last_name":"Calcaterra","first_name":"Stefano","full_name":"Calcaterra, Stefano"},{"full_name":"Ballabio, Andrea","last_name":"Ballabio","first_name":"Andrea"},{"last_name":"Servin","first_name":"Juan Aguilera","full_name":"Servin, Juan Aguilera"},{"full_name":"Aggarwal, Kushagra","id":"b22ab905-3539-11eb-84c3-fc159dcd79cb","last_name":"Aggarwal","first_name":"Kushagra","orcid":"0000-0001-9985-9293"},{"id":"396A1950-F248-11E8-B48F-1D18A9856A87","full_name":"Janik, Marian","first_name":"Marian","last_name":"Janik","orcid":"0009-0003-9037-8831"},{"first_name":"Thomas","last_name":"Adletzberger","id":"38756BB2-F248-11E8-B48F-1D18A9856A87","full_name":"Adletzberger, Thomas"},{"first_name":"Rubén Seoane","last_name":"Souto","full_name":"Souto, Rubén Seoane"},{"full_name":"Leijnse, Martin","last_name":"Leijnse","first_name":"Martin"},{"first_name":"Jeroen","last_name":"Danon","full_name":"Danon, Jeroen"},{"full_name":"Schrade, Constantin","first_name":"Constantin","last_name":"Schrade"},{"full_name":"Bakkers, Erik","first_name":"Erik","last_name":"Bakkers"},{"last_name":"Chrastina","first_name":"Daniel","full_name":"Chrastina, Daniel"},{"last_name":"Isella","first_name":"Giovanni","full_name":"Isella, Giovanni"},{"orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios","first_name":"Georgios","last_name":"Katsaros"}],"article_number":"2306.07109","acknowledgement":"The authors acknowledge Alexander Brinkmann, Alessandro Crippa, Andrew Higginbotham, Andrea Iorio, Giordano\r\nScappucci and Christian Schonenberger for helpful discussions. We thank Marcel Verheijen for the support in the\r\nTEM analysis. This research and related results were made\r\npossible with the support of the NOMIS Foundation. It was\r\nsupported by the Scientific Service Units of ISTA through resources provided by the MIBA Machine Shop and the\r\nnanofabrication facility, the European Union’s Horizon 2020\r\nresearch and innovation programme under Grant Agreement\r\nNo 862046, the HORIZON-RIA 101069515 project and the\r\nFWF Projects #P-32235, #P-36507 and #F-8606. R.S.S.\r\nacknowledges Spanish CM “Talento Program” Project No.\r\n2022-T1/IND-24070.","publication_status":"draft","publication":"arXiv","year":"2023","date_created":"2023-07-26T11:17:20Z","citation":{"apa":"Valentini, M., Sagi, O., Baghumyan, L., Gijsel, T. de, Jung, J., Calcaterra, S., … Katsaros, G. (n.d.). Radio frequency driven superconducting diode and parity conserving Cooper pair transport in a two-dimensional germanium hole gas. arXiv. https://doi.org/10.48550/arXiv.2306.07109","mla":"Valentini, Marco, et al. “Radio Frequency Driven Superconducting Diode and Parity Conserving Cooper Pair Transport in a Two-Dimensional Germanium Hole Gas.” ArXiv, 2306.07109, doi:10.48550/arXiv.2306.07109.","chicago":"Valentini, Marco, Oliver Sagi, Levon Baghumyan, Thijs de Gijsel, Jason Jung, Stefano Calcaterra, Andrea Ballabio, et al. “Radio Frequency Driven Superconducting Diode and Parity Conserving Cooper Pair Transport in a Two-Dimensional Germanium Hole Gas.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2306.07109.","short":"M. Valentini, O. Sagi, L. Baghumyan, T. de Gijsel, J. Jung, S. Calcaterra, A. Ballabio, J.A. Servin, K. Aggarwal, M. Janik, T. Adletzberger, R.S. Souto, M. Leijnse, J. Danon, C. Schrade, E. Bakkers, D. Chrastina, G. Isella, G. Katsaros, ArXiv (n.d.).","ama":"Valentini M, Sagi O, Baghumyan L, et al. Radio frequency driven superconducting diode and parity conserving Cooper pair transport in a two-dimensional germanium hole gas. arXiv. doi:10.48550/arXiv.2306.07109","ista":"Valentini M, Sagi O, Baghumyan L, Gijsel T de, Jung J, Calcaterra S, Ballabio A, Servin JA, Aggarwal K, Janik M, Adletzberger T, Souto RS, Leijnse M, Danon J, Schrade C, Bakkers E, Chrastina D, Isella G, Katsaros G. Radio frequency driven superconducting diode and parity conserving Cooper pair transport in a two-dimensional germanium hole gas. arXiv, 2306.07109.","ieee":"M. Valentini et al., “Radio frequency driven superconducting diode and parity conserving Cooper pair transport in a two-dimensional germanium hole gas,” arXiv. ."},"oa_version":"Preprint","date_published":"2023-06-13T00:00:00Z","ddc":["530"],"month":"06"},{"doi":"10.5281/zenodo.10119345","oa":1,"date_created":"2026-10-02T10:23:47Z","year":"2023","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.10119345"}],"citation":{"ista":"Valentini M. 2023. Data repository for ‘Parity-conserving Cooper-pair transport and ideal superconducting diode in planar Germanium’, Zenodo, 10.5281/zenodo.10119345.","ieee":"M. Valentini, “Data repository for ‘Parity-conserving Cooper-pair transport and ideal superconducting diode in planar Germanium.’” Zenodo, 2023.","ama":"Valentini M. Data repository for “Parity-conserving Cooper-pair transport and ideal superconducting diode in planar Germanium.” 2023. doi:10.5281/zenodo.10119345","chicago":"Valentini, Marco. “Data Repository for ‘Parity-Conserving Cooper-Pair Transport and Ideal Superconducting Diode in Planar Germanium.’” Zenodo, 2023. https://doi.org/10.5281/zenodo.10119345.","mla":"Valentini, Marco. Data Repository for “Parity-Conserving Cooper-Pair Transport and Ideal Superconducting Diode in Planar Germanium.” Zenodo, 2023, doi:10.5281/zenodo.10119345.","apa":"Valentini, M. (2023). Data repository for “Parity-conserving Cooper-pair transport and ideal superconducting diode in planar Germanium.” Zenodo. https://doi.org/10.5281/zenodo.10119345","short":"M. Valentini, (2023)."},"oa_version":"None","publisher":"Zenodo","month":"11","ddc":["530"],"date_published":"2023-11-13T00:00:00Z","article_processing_charge":"No","OA_place":"repository","_id":"23036","type":"research_data_reference","title":"Data repository for 'Parity-conserving Cooper-pair transport and ideal superconducting diode in planar Germanium'","related_material":{"record":[{"id":"14793","relation":"used_in_publication","status":"public"}]},"status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"GeKa"}],"fulldoi":"https://doi.org/10.5281/zenodo.10119345","OA_type":"green","date_updated":"2026-10-02T10:23:54Z","day":"13","author":[{"first_name":"Marco","last_name":"Valentini","full_name":"Valentini, Marco"}]},{"scopus_import":"1","date_updated":"2026-10-02T11:19:46Z","author":[{"first_name":"Elias","last_name":"Frantar","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","full_name":"Frantar, Elias"},{"full_name":"Ashkboos, Saleh","last_name":"Ashkboos","first_name":"Saleh"},{"full_name":"Hoefler, Torsten","first_name":"Torsten","last_name":"Hoefler"},{"orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","language":[{"iso":"eng"}],"abstract":[{"text":"Generative Pre-trained Transformer models, known as GPT or OPT, set themselves apart through breakthrough performance across complex language modelling tasks, but also by their extremely high computational and storage costs. Specifically, due to their massive size, even inference for large, highly-accurate GPT models may require multiple performant GPUs, which limits the usability of such models. While there is emerging work on relieving this pressure via model compression, the applicability and performance of existing compression techniques is limited by the scale and complexity of GPT models. In this paper, we address this challenge, and propose OPTQ, a new one-shot weight quantization method based on approximate second-order information, that is both highly-accurate and highly-efficient. Specifically, OPTQ can quantize GPT models with 175 billion parameters in approximately four GPU hours, reducing the bitwidth down to 3 or 4 bits per weight, with negligible accuracy degradation relative to the uncompressed baseline. Our method more than doubles the compression gains relative to previously-proposed one-shot quantization methods, preserving accuracy, allowing us for the first time to execute an 175 billion-parameter model inside a single GPU for generative inference. Moreover, we also show that our method can still provide reasonable accuracy in the extreme quantization regime, in which weights are quantized to 2-bit or even ternary quantization levels. We show experimentally that these improvements can be leveraged for end-to-end inference speedups over FP16, of around 3.25x when using high-end GPUs (NVIDIA A100) and 4.5x when using more cost-effective ones (NVIDIA A6000). The implementation is available at https://github.com/IST-DASLab/gptq.","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"17485","relation":"dissertation_contains"}],"link":[{"url":"https://github.com/IST-DASLab/gptq","relation":"software"}]},"quality_controlled":"1","status":"public","citation":{"short":"E. Frantar, S. Ashkboos, T. Hoefler, D.-A. Alistarh, in:, 11th International Conference on Learning Representations , International Conference on Learning Representations, 2023.","mla":"Frantar, Elias, et al. “OPTQ: Accurate Post-Training Quantization for Generative Pre-Trained Transformers.” 11th International Conference on Learning Representations , International Conference on Learning Representations, 2023.","chicago":"Frantar, Elias, Saleh Ashkboos, Torsten Hoefler, and Dan-Adrian Alistarh. “OPTQ: Accurate Post-Training Quantization for Generative Pre-Trained Transformers.” In 11th International Conference on Learning Representations . International Conference on Learning Representations, 2023.","apa":"Frantar, E., Ashkboos, S., Hoefler, T., & Alistarh, D.-A. (2023). OPTQ: Accurate post-training quantization for generative pre-trained transformers. In 11th International Conference on Learning Representations . Kigali, Rwanda: International Conference on Learning Representations.","ista":"Frantar E, Ashkboos S, Hoefler T, Alistarh D-A. 2023. OPTQ: Accurate post-training quantization for generative pre-trained transformers. 11th International Conference on Learning Representations . ICLR: International Conference on Learning Representations.","ieee":"E. Frantar, S. Ashkboos, T. Hoefler, and D.-A. Alistarh, “OPTQ: Accurate post-training quantization for generative pre-trained transformers,” in 11th International Conference on Learning Representations , Kigali, Rwanda, 2023.","ama":"Frantar E, Ashkboos S, Hoefler T, Alistarh D-A. OPTQ: Accurate post-training quantization for generative pre-trained transformers. In: 11th International Conference on Learning Representations . International Conference on Learning Representations; 2023."},"oa_version":"Published Version","publisher":"International Conference on Learning Representations","ddc":["000"],"month":"05","date_published":"2023-05-01T00:00:00Z","acknowledgement":"Elias Frantar and Dan Alistarh gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 programme (grant agreement No. 805223 ScaleML), as well as experimental support from Eldar Kurtic, and from the IST Austria IT department, in particular Stefano Elefante, Andrei Hornoiu, and Alois Schloegl. The work of Saleh Ashkboos and Torsten Hoefler was supported by the PASC DaCeMI project, received EuroHPC-JU funding under grant MAELSTROM, No. 955513. We thank the Swiss National Supercomputing Center (CSCS) for supporting us with compute infrastructure.","file_date_updated":"2024-08-05T07:52:44Z","publication_status":"published","date_created":"2024-08-04T22:01:22Z","year":"2023","publication":"11th International Conference on Learning Representations ","department":[{"_id":"DaAl"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"day":"01","_id":"17378","title":"OPTQ: Accurate post-training quantization for generative pre-trained transformers","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"has_accepted_license":"1","article_processing_charge":"No","conference":{"location":"Kigali, Rwanda","start_date":"2023-05-01","name":"ICLR: International Conference on Learning Representations","end_date":"2023-05-05"},"corr_author":"1","file":[{"content_type":"application/pdf","date_created":"2024-08-05T07:52:44Z","file_id":"17385","file_name":"2023_ICLR_Frantar.pdf","file_size":437492,"checksum":"aacbf11dbd8b02a3e0bfd942a33e0593","creator":"dernst","access_level":"open_access","success":1,"relation":"main_file","date_updated":"2024-08-05T07:52:44Z"}],"oa":1,"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"}]},{"scopus_import":"1","date_updated":"2026-10-02T11:19:46Z","author":[{"full_name":"Frantar, Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","last_name":"Frantar","first_name":"Elias"},{"last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"17485"}]},"abstract":[{"text":"We show for the first time that large-scale generative pretrained transformer (GPT) family models can be pruned to at least 50% sparsity in one-shot, without any retraining, at minimal loss of accuracy. This is achieved via a new pruning method called SparseGPT, specifically designed to work efficiently and accurately on massive GPT-family models. We can execute SparseGPT on the largest available open-source models, OPT-175B and BLOOM-176B, in under 4.5 hours, and can reach 60% unstructured sparsity with negligible increase in perplexity: remarkably, more than 100 billion weights from these models can be ignored at inference time. SparseGPT generalizes to semi-structured (2:4 and 4:8) patterns, and is compatible with weight quantization approaches. The code is available at: https://github.com/IST-DASLab/sparsegpt.","lang":"eng"}],"type":"conference","status":"public","quality_controlled":"1","citation":{"ama":"Frantar E, Alistarh D-A. SparseGPT: Massive language models can be accurately pruned in one-shot. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:10323-10337.","ieee":"E. Frantar and D.-A. Alistarh, “SparseGPT: Massive language models can be accurately pruned in one-shot,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10323–10337.","ista":"Frantar E, Alistarh D-A. 2023. SparseGPT: Massive language models can be accurately pruned in one-shot. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 10323–10337.","apa":"Frantar, E., & Alistarh, D.-A. (2023). SparseGPT: Massive language models can be accurately pruned in one-shot. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 10323–10337). Honolulu, Hawaii, HI, United States: ML Research Press.","mla":"Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10323–37.","chicago":"Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot.” In Proceedings of the 40th International Conference on Machine Learning, 202:10323–37. ML Research Press, 2023.","short":"E. Frantar, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10323–10337."},"oa_version":"Preprint","date_published":"2023-07-30T00:00:00Z","publisher":"ML Research Press","month":"07","intvolume":" 202","acknowledgement":"The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 programme (grant agreement No. 805223 ScaleML), as well as experimental support from Eldar Kurtic, and from the IST Austria IT department, in particular Stefano Elefante, Andrei Hornoiu, and Alois Schloegl.","publication_status":"published","publication":"Proceedings of the 40th International Conference on Machine Learning","date_created":"2023-10-29T23:01:16Z","year":"2023","acknowledged_ssus":[{"_id":"ScienComp"}],"department":[{"_id":"DaAl"}],"publication_identifier":{"eissn":["2640-3498"]},"day":"30","arxiv":1,"page":"10323-10337","title":"SparseGPT: Massive language models can be accurately pruned in one-shot","_id":"14458","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"volume":202,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2301.00774","open_access":"1"}],"alternative_title":["PMLR"],"article_processing_charge":"No","external_id":{"arxiv":["2301.00774"]},"corr_author":"1","conference":{"location":"Honolulu, Hawaii, HI, United States","start_date":"2023-07-23","name":"ICML: International Conference on Machine Learning","end_date":"2023-07-29"},"oa":1,"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}]},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.02390","open_access":"1"}],"volume":202,"alternative_title":["PMLR"],"article_processing_charge":"No","external_id":{"arxiv":["2302.02390"]},"corr_author":"1","conference":{"end_date":"2023-07-29","location":"Honolulu, Hawaii, HI, United States","start_date":"2023-07-23","name":"ICML: International Conference on Machine Learning"},"project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"oa":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"department":[{"_id":"DaAl"}],"publication_identifier":{"eissn":["2640-3498"]},"page":"24020-24044","arxiv":1,"day":"30","title":"Quantized distributed training of large models with convergence guarantees","_id":"14461","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"citation":{"ama":"Markov I, Vladu A, Guo Q, Alistarh D-A. Quantized distributed training of large models with convergence guarantees. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:24020-24044.","ista":"Markov I, Vladu A, Guo Q, Alistarh D-A. 2023. Quantized distributed training of large models with convergence guarantees. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 24020–24044.","ieee":"I. Markov, A. Vladu, Q. Guo, and D.-A. Alistarh, “Quantized distributed training of large models with convergence guarantees,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 24020–24044.","short":"I. Markov, A. Vladu, Q. Guo, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 24020–24044.","apa":"Markov, I., Vladu, A., Guo, Q., & Alistarh, D.-A. (2023). Quantized distributed training of large models with convergence guarantees. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 24020–24044). Honolulu, Hawaii, HI, United States: ML Research Press.","chicago":"Markov, Ilia, Adrian Vladu, Qi Guo, and Dan-Adrian Alistarh. “Quantized Distributed Training of Large Models with Convergence Guarantees.” In Proceedings of the 40th International Conference on Machine Learning, 202:24020–44. ML Research Press, 2023.","mla":"Markov, Ilia, et al. “Quantized Distributed Training of Large Models with Convergence Guarantees.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 24020–44."},"oa_version":"Preprint","date_published":"2023-07-30T00:00:00Z","month":"07","publisher":"ML Research Press","acknowledgement":"The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), as well as experimental support from the IST Austria IT department, in particular Stefano Elefante, Andrei Hornoiu, and Alois Schloegl. AV acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT), the support of Fondation Hadamard with a PRMO grant, and the support of CNRS with a CoopIntEER IEA grant (project ALFRED).","intvolume":" 202","date_created":"2023-10-29T23:01:17Z","publication":"Proceedings of the 40th International Conference on Machine Learning","year":"2023","publication_status":"published","date_updated":"2026-10-02T11:20:05Z","scopus_import":"1","author":[{"first_name":"Ilia","last_name":"Markov","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","full_name":"Markov, Ilia"},{"first_name":"Adrian","last_name":"Vladu","full_name":"Vladu, Adrian"},{"last_name":"Guo","first_name":"Qi","full_name":"Guo, Qi"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"17490","status":"public"}]},"abstract":[{"text":"Communication-reduction techniques are a popular way to improve scalability in data-parallel training of deep neural networks (DNNs). The recent emergence of large language models such as GPT has created the need for new approaches to exploit data-parallelism. Among these, fully-sharded data parallel (FSDP) training is highly popular, yet it still encounters scalability bottlenecks. One reason is that applying compression techniques to FSDP is challenging: as the vast majority of the communication involves the model’s weights, direct compression alters convergence and leads to accuracy loss. We present QSDP, a variant of FSDP which supports both gradient and weight quantization with theoretical guarantees, is simple to implement and has essentially no overheads. To derive QSDP we prove that a natural modification of SGD achieves convergence even when we only maintain quantized weights, and thus the domain over which we train consists of quantized points and is, therefore, highly non-convex. We validate this approach by training GPT-family models with up to 1.3 billion parameters on a multi-node cluster. Experiments show that QSDP preserves model accuracy, while completely removing the communication bottlenecks of FSDP, providing end-to-end speedups of up to 2.2x.","lang":"eng"}],"language":[{"iso":"eng"}],"type":"conference","status":"public","quality_controlled":"1"},{"status":"public","quality_controlled":"1","type":"journal_article","abstract":[{"text":"Regulation of the Arp2/3 complex is required for productive nucleation of branched actin networks. An emerging aspect of regulation is the incorporation of subunit isoforms into the Arp2/3 complex. Specifically, both ArpC5 subunit isoforms, ArpC5 and ArpC5L, have been reported to fine-tune nucleation activity and branch junction stability. We have combined reverse genetics and cellular structural biology to describe how ArpC5 and ArpC5L differentially affect cell migration. Both define the structural stability of ArpC1 in branch junctions and, in turn, by determining protrusion characteristics, affect protein dynamics and actin network ultrastructure. ArpC5 isoforms also affect the positioning of members of the Ena/Vasodilator-stimulated phosphoprotein (VASP) family of actin filament elongators, which mediate ArpC5 isoform–specific effects on the actin assembly level. Our results suggest that ArpC5 and Ena/VASP proteins are part of a signaling pathway enhancing cell migration.","lang":"eng"}],"related_material":{"record":[{"id":"14562","relation":"research_data","status":"public"},{"id":"22744","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"dissertation_contains","id":"18766"}]},"language":[{"iso":"eng"}],"author":[{"orcid":"0000-0001-7149-769X","id":"404F5528-F248-11E8-B48F-1D18A9856A87","full_name":"Fäßler, Florian","first_name":"Florian","last_name":"Fäßler"},{"orcid":"0000-0003-2311-2112","id":"305ab18b-dc7d-11ea-9b2f-b58195228ea2","full_name":"Javoor, Manjunath","first_name":"Manjunath","last_name":"Javoor"},{"last_name":"Datler","first_name":"Julia","full_name":"Datler, Julia","id":"3B12E2E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3616-8580"},{"full_name":"Döring, Hermann","first_name":"Hermann","last_name":"Döring"},{"full_name":"Hofer, Florian","id":"b9d234ba-9e33-11ed-95b6-cd561df280e6","last_name":"Hofer","first_name":"Florian"},{"id":"38C393BE-F248-11E8-B48F-1D18A9856A87","full_name":"Dimchev, Georgi A","first_name":"Georgi A","last_name":"Dimchev","orcid":"0000-0001-8370-6161"},{"orcid":"0000-0003-3904-947X","first_name":"Victor-Valentin","last_name":"Hodirnau","id":"3661B498-F248-11E8-B48F-1D18A9856A87","full_name":"Hodirnau, Victor-Valentin"},{"first_name":"Jan","last_name":"Faix","full_name":"Faix, Jan"},{"full_name":"Rottner, Klemens","first_name":"Klemens","last_name":"Rottner"},{"full_name":"Schur, Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","first_name":"Florian KM","orcid":"0000-0003-4790-8078"}],"date_updated":"2026-10-02T11:21:19Z","scopus_import":"1","year":"2023","date_created":"2023-01-23T07:26:42Z","publication":"Science Advances","publication_status":"published","isi":1,"article_number":"add6495","acknowledgement":"We would like to thank K. von Peinen and B. Denker (Helmholtz Centre for Infection Research, Braunschweig, Germany) for experimental and technical assistance, respectively.\r\nThis research was supported by the Scientific Service Units (SSUs) of ISTA through resources provided by Scientific Computing (SciComp), the Life Science Facility (LSF), the Imaging and Optics facility (IOF), and the Electron Microscopy Facility (EMF). We acknowledge support from ISTA and from the Austrian Science Fund (FWF) (P33367) to F.K.M.S., from the Research Training Group GRK2223 and the Helmholtz Society to K.R,. and from the Deutsche Forschungsgemeinschaft (DFG) to J.F. and K.R.","intvolume":" 9","file_date_updated":"2023-01-23T07:45:54Z","month":"01","ddc":["570"],"publisher":"American Association for the Advancement of Science","pmid":1,"date_published":"2023-01-20T00:00:00Z","citation":{"ama":"Fäßler F, Javoor M, Datler J, et al. ArpC5 isoforms regulate Arp2/3 complex–dependent protrusion through differential Ena/VASP positioning. Science Advances. 2023;9(3). doi:10.1126/sciadv.add6495","ieee":"F. Fäßler et al., “ArpC5 isoforms regulate Arp2/3 complex–dependent protrusion through differential Ena/VASP positioning,” Science Advances, vol. 9, no. 3. American Association for the Advancement of Science, 2023.","ista":"Fäßler F, Javoor M, Datler J, Döring H, Hofer F, Dimchev GA, Hodirnau V-V, Faix J, Rottner K, Schur FK. 2023. ArpC5 isoforms regulate Arp2/3 complex–dependent protrusion through differential Ena/VASP positioning. Science Advances. 9(3), add6495.","short":"F. Fäßler, M. Javoor, J. Datler, H. Döring, F. Hofer, G.A. Dimchev, V.-V. Hodirnau, J. Faix, K. Rottner, F.K. Schur, Science Advances 9 (2023).","apa":"Fäßler, F., Javoor, M., Datler, J., Döring, H., Hofer, F., Dimchev, G. A., … Schur, F. K. (2023). ArpC5 isoforms regulate Arp2/3 complex–dependent protrusion through differential Ena/VASP positioning. Science Advances. American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.add6495","chicago":"Fäßler, Florian, Manjunath Javoor, Julia Datler, Hermann Döring, Florian Hofer, Georgi A Dimchev, Victor-Valentin Hodirnau, Jan Faix, Klemens Rottner, and Florian KM Schur. “ArpC5 Isoforms Regulate Arp2/3 Complex–Dependent Protrusion through Differential Ena/VASP Positioning.” Science Advances. American Association for the Advancement of Science, 2023. https://doi.org/10.1126/sciadv.add6495.","mla":"Fäßler, Florian, et al. “ArpC5 Isoforms Regulate Arp2/3 Complex–Dependent Protrusion through Differential Ena/VASP Positioning.” Science Advances, vol. 9, no. 3, add6495, American Association for the Advancement of Science, 2023, doi:10.1126/sciadv.add6495."},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12334","title":"ArpC5 isoforms regulate Arp2/3 complex–dependent protrusion through differential Ena/VASP positioning","publication_identifier":{"issn":["2375-2548"]},"day":"20","department":[{"_id":"FlSc"},{"_id":"EM-Fac"}],"fulldoi":"https://doi.org/10.1126/sciadv.add6495","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"EM-Fac"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"date_created":"2023-01-23T07:45:54Z","file_id":"12335","content_type":"application/pdf","checksum":"ce81a6d0b84170e5e8c62f6acfa15d9e","creator":"dernst","file_size":1756234,"file_name":"2023_ScienceAdvances_Faessler.pdf","access_level":"open_access","date_updated":"2023-01-23T07:45:54Z","relation":"main_file","success":1}],"keyword":["Multidisciplinary"],"oa":1,"doi":"10.1126/sciadv.add6495","project":[{"_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","grant_number":"P33367","name":"Structure and isoform diversity of the Arp2/3 complex"}],"issue":"3","corr_author":"1","external_id":{"isi":["000964550100015"],"pmid":["36662867"]},"article_type":"original","article_processing_charge":"No","volume":9,"has_accepted_license":"1"},{"publication_status":"draft","doi":"10.48550/arXiv.2308.00516","oa":1,"publication":"arXiv","date_created":"2024-07-31T08:02:16Z","year":"2023","article_number":"2308.00516","corr_author":"1","month":"08","external_id":{"arxiv":["2308.00516"]},"article_processing_charge":"No","date_published":"2023-08-02T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2308.00516","open_access":"1"}],"citation":{"ieee":"F. Pedrotti, “Contractive coupling rates and curvature lower bounds for Markov chains,” arXiv. .","ista":"Pedrotti F. Contractive coupling rates and curvature lower bounds for Markov chains. arXiv, 2308.00516.","ama":"Pedrotti F. Contractive coupling rates and curvature lower bounds for Markov chains. arXiv. doi:10.48550/arXiv.2308.00516","short":"F. Pedrotti, ArXiv (n.d.).","chicago":"Pedrotti, Francesco. “Contractive Coupling Rates and Curvature Lower Bounds for Markov Chains.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2308.00516.","mla":"Pedrotti, Francesco. “Contractive Coupling Rates and Curvature Lower Bounds for Markov Chains.” ArXiv, 2308.00516, doi:10.48550/arXiv.2308.00516.","apa":"Pedrotti, F. (n.d.). Contractive coupling rates and curvature lower bounds for Markov chains. arXiv. https://doi.org/10.48550/arXiv.2308.00516"},"oa_version":"Preprint","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","_id":"17351","type":"preprint","language":[{"iso":"eng"}],"title":"Contractive coupling rates and curvature lower bounds for Markov chains","related_material":{"record":[{"id":"20040","relation":"later_version","status":"public"},{"status":"public","id":"17336","relation":"dissertation_contains"}]},"abstract":[{"text":"Contractive coupling rates have been recently introduced by Conforti as a\r\ntool to establish convex Sobolev inequalities (including modified log-Sobolev\r\nand Poincar\\'{e} inequality) for some classes of Markov chains. In this work,\r\nwe show how contractive coupling rates can also be used to prove stronger\r\ninequalities, in the form of curvature lower bounds for Markov chains and\r\ngeodesic convexity of entropic functionals. We illustrate this in several\r\nexamples discussed by Conforti, where in particular, after appropriately\r\nchoosing a parameter function, we establish positive curvature in the entropic\r\nand (discrete) Bakry--\\'{E}mery sense. In addition, we recall and give\r\nstraightforward generalizations of some notions of coarse Ricci curvature, and\r\nwe discuss some of their properties and relations with the concepts of\r\ncouplings and coupling rates: as an application, we show exponential\r\ncontraction of the $p$-Wasserstein distance for the heat flow in the\r\naforementioned examples.","lang":"eng"}],"day":"02","author":[{"last_name":"Pedrotti","first_name":"Francesco","full_name":"Pedrotti, Francesco","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c"}],"arxiv":1,"department":[{"_id":"JaMa"}],"fulldoi":"https://doi.org/10.48550/arXiv.2308.00516","date_updated":"2026-10-02T11:25:17Z"},{"file_date_updated":"2025-02-26T08:01:57Z","intvolume":" 20","isi":1,"acknowledgement":"We thank J. Vorlaufer, N. Agudelo and A. Wartak for microscope maintenance and troubleshooting, C. Kreuzinger and A. Freeman for technical assistance, M. Šuplata for hardware control support and M. Cunha dos Santos for initial exploration of software. We\r\nthank P. Henderson for advice on deep-learning training and M. Sixt, S. Boyd and T. Weiss for discussions and critical reading of the manuscript. L. Lavis (Janelia Research Campus) generously provided the JF585-HaloTag ligand. We acknowledge expert support by IST\r\nAustria’s scientific computing, imaging and optics, preclinical, library and laboratory support facilities and by the Miba machine shop. We gratefully acknowledge funding by the following sources: Austrian Science Fund (F.W.F.) grant no. I3600-B27 (J.G.D.), grant no. DK W1232\r\n(J.G.D. and J.M.M.) and grant no. Z 312-B27, Wittgenstein award (P.J.); the Gesellschaft für Forschungsförderung NÖ grant no. LSC18-022 (J.G.D.); an ISTA Interdisciplinary project grant (J.G.D. and B.B.); the European Union’s Horizon 2020 research and innovation programme,\r\nMarie-Skłodowska Curie grant 665385 (J.M.M. and J.L.); the European Union’s Horizon 2020 research and innovation programme, European Research Council grant no. 715767, MATERIALIZABLE (B.B.); grant no. 715508, REVERSEAUTISM (G.N.); grant no. 695568, SYNNOVATE (S.G.N.G.); and grant no. 692692, GIANTSYN (P.J.); the Simons\r\nFoundation Autism Research Initiative grant no. 529085 (S.G.N.G.); the Wellcome Trust Technology Development grant no. 202932 (S.G.N.G.); the Marie Skłodowska-Curie Actions Individual Fellowship no. 101026635 under the EU Horizon 2020 program (J.F.W.);\r\nthe Human Frontier Science Program postdoctoral fellowship LT000557/2018 (W.J.); and the National Science Foundation grant no. IIS-1835231 (H.P.) and NCS-FO-2124179 (H.P.).","publication_status":"published","publication":"Nature Methods","date_created":"2023-07-23T22:01:13Z","year":"2023","oa_version":"Published Version","citation":{"ieee":"P. Velicky et al., “Dense 4D nanoscale reconstruction of living brain tissue,” Nature Methods, vol. 20. Springer Nature, pp. 1256–1265, 2023.","ista":"Velicky P, Miguel Villalba E, Michalska JM, Lyudchik J, Wei D, Lin Z, Watson J, Troidl J, Beyer J, Ben Simon Y, Sommer CM, Jahr W, Cenameri A, Broichhagen J, Grant SGN, Jonas PM, Novarino G, Pfister H, Bickel B, Danzl JG. 2023. Dense 4D nanoscale reconstruction of living brain tissue. Nature Methods. 20, 1256–1265.","ama":"Velicky P, Miguel Villalba E, Michalska JM, et al. Dense 4D nanoscale reconstruction of living brain tissue. Nature Methods. 2023;20:1256-1265. doi:10.1038/s41592-023-01936-6","chicago":"Velicky, Philipp, Eder Miguel Villalba, Julia M Michalska, Julia Lyudchik, Donglai Wei, Zudi Lin, Jake Watson, et al. “Dense 4D Nanoscale Reconstruction of Living Brain Tissue.” Nature Methods. Springer Nature, 2023. https://doi.org/10.1038/s41592-023-01936-6.","mla":"Velicky, Philipp, et al. “Dense 4D Nanoscale Reconstruction of Living Brain Tissue.” Nature Methods, vol. 20, Springer Nature, 2023, pp. 1256–65, doi:10.1038/s41592-023-01936-6.","apa":"Velicky, P., Miguel Villalba, E., Michalska, J. M., Lyudchik, J., Wei, D., Lin, Z., … Danzl, J. G. (2023). Dense 4D nanoscale reconstruction of living brain tissue. Nature Methods. Springer Nature. https://doi.org/10.1038/s41592-023-01936-6","short":"P. Velicky, E. Miguel Villalba, J.M. Michalska, J. Lyudchik, D. Wei, Z. Lin, J. Watson, J. Troidl, J. Beyer, Y. Ben Simon, C.M. Sommer, W. Jahr, A. Cenameri, J. Broichhagen, S.G.N. Grant, P.M. Jonas, G. Novarino, H. Pfister, B. Bickel, J.G. Danzl, Nature Methods 20 (2023) 1256–1265."},"date_published":"2023-08-01T00:00:00Z","pmid":1,"publisher":"Springer Nature","ddc":["570"],"month":"08","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Three-dimensional (3D) reconstruction of living brain tissue down to an individual synapse level would create opportunities for decoding the dynamics and structure–function relationships of the brain’s complex and dense information processing network; however, this has been hindered by insufficient 3D resolution, inadequate signal-to-noise ratio and prohibitive light burden in optical imaging, whereas electron microscopy is inherently static. Here we solved these challenges by developing an integrated optical/machine-learning technology, LIONESS (live information-optimized nanoscopy enabling saturated segmentation). This leverages optical modifications to stimulated emission depletion microscopy in comprehensively, extracellularly labeled tissue and previous information on sample structure via machine learning to simultaneously achieve isotropic super-resolution, high signal-to-noise ratio and compatibility with living tissue. This allows dense deep-learning-based instance segmentation and 3D reconstruction at a synapse level, incorporating molecular, activity and morphodynamic information. LIONESS opens up avenues for studying the dynamic functional (nano-)architecture of living brain tissue."}],"related_material":{"link":[{"url":"https://github.com/danzllab/LIONESS","relation":"software"}],"record":[{"status":"public","relation":"research_data","id":"12817"},{"status":"public","relation":"shorter_version","id":"14770"},{"id":"11943","relation":"earlier_version","status":"public"},{"id":"18674","relation":"dissertation_contains","status":"public"}]},"OA_place":"publisher","type":"journal_article","status":"public","quality_controlled":"1","scopus_import":"1","OA_type":"hybrid","date_updated":"2026-10-02T11:27:12Z","author":[{"id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","full_name":"Velicky, Philipp","first_name":"Philipp","last_name":"Velicky","orcid":"0000-0002-2340-7431"},{"full_name":"Miguel Villalba, Eder","id":"3FB91342-F248-11E8-B48F-1D18A9856A87","last_name":"Miguel Villalba","first_name":"Eder","orcid":"0000-0001-5665-0430"},{"full_name":"Michalska, Julia M","id":"443DB6DE-F248-11E8-B48F-1D18A9856A87","last_name":"Michalska","first_name":"Julia M","orcid":"0000-0003-3862-1235"},{"full_name":"Lyudchik, Julia","id":"46E28B80-F248-11E8-B48F-1D18A9856A87","last_name":"Lyudchik","first_name":"Julia"},{"first_name":"Donglai","last_name":"Wei","full_name":"Wei, Donglai"},{"full_name":"Lin, Zudi","first_name":"Zudi","last_name":"Lin"},{"first_name":"Jake","last_name":"Watson","id":"63836096-4690-11EA-BD4E-32803DDC885E","full_name":"Watson, Jake","orcid":"0000-0002-8698-3823"},{"last_name":"Troidl","first_name":"Jakob","full_name":"Troidl, Jakob"},{"full_name":"Beyer, Johanna","last_name":"Beyer","first_name":"Johanna"},{"last_name":"Ben Simon","first_name":"Yoav","full_name":"Ben Simon, Yoav","id":"43DF3136-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sommer","first_name":"Christoph M","full_name":"Sommer, Christoph M","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1216-9105"},{"first_name":"Wiebke","last_name":"Jahr","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87","full_name":"Jahr, Wiebke","orcid":"0000-0003-0201-2315"},{"first_name":"Alban","last_name":"Cenameri","id":"9ac8f577-2357-11eb-997a-e566c5550886","full_name":"Cenameri, Alban"},{"full_name":"Broichhagen, Johannes","first_name":"Johannes","last_name":"Broichhagen"},{"first_name":"Seth G.N.","last_name":"Grant","full_name":"Grant, Seth G.N."},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804"},{"orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","first_name":"Gaia"},{"full_name":"Pfister, Hanspeter","first_name":"Hanspeter","last_name":"Pfister"},{"orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"},{"full_name":"Danzl, Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","last_name":"Danzl","first_name":"Johann G","orcid":"0000-0001-8559-3973"}],"corr_author":"1","project":[{"_id":"265CB4D0-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I03600","name":"Optical control of synaptic function via adhesion molecules"},{"call_identifier":"FWF","grant_number":"W1232","name":"Molecular Drug Targets","_id":"2548AE96-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z00312","name":"Synaptic communication in neuronal microcircuits","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425"},{"_id":"23889792-32DE-11EA-91FC-C7463DDC885E","name":"High content imaging to decode human immune cell interactions in health and allergic disease","grant_number":"LS18-022"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"},{"_id":"25444568-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo and in vitro Models","grant_number":"715508"},{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"692692","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse"},{"_id":"fc2be41b-9c52-11eb-aca3-faa90aa144e9","call_identifier":"H2020","grant_number":"101026635","name":"Synaptic computations of the hippocampal CA3 circuitry"},{"_id":"2668BFA0-B435-11E9-9278-68D0E5697425","name":"High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration","grant_number":"LT00057"}],"oa":1,"doi":"10.1038/s41592-023-01936-6","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"checksum":"a68e845780a82ea36d0d4d3212a87c10","creator":"dernst","file_size":14103039,"file_name":"2023_NatureMethods_Velicky.pdf","date_created":"2025-02-26T08:01:57Z","file_id":"19088","content_type":"application/pdf","date_updated":"2025-02-26T08:01:57Z","relation":"main_file","success":1,"access_level":"open_access"}],"volume":20,"has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","article_type":"original","external_id":{"pmid":["37429995"],"isi":["001025621500001"]},"title":"Dense 4D nanoscale reconstruction of living brain tissue","_id":"13267","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1038/s41592-023-01936-6","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"Bio"},{"_id":"PreCl"},{"_id":"E-Lib"},{"_id":"LifeSc"},{"_id":"M-Shop"}],"department":[{"_id":"PeJo"},{"_id":"GaNo"},{"_id":"BeBi"},{"_id":"JoDa"},{"_id":"Bio"}],"page":"1256-1265","day":"01","publication_identifier":{"eissn":["1548-7105"],"issn":["1548-7091"]}},{"file":[{"file_size":2899592,"file_name":"2023_NatureComm_Hassani.pdf","checksum":"a85773b5fe23516f60f7d5d31b55c200","creator":"dernst","content_type":"application/pdf","date_created":"2023-07-18T08:43:07Z","file_id":"13248","success":1,"relation":"main_file","date_updated":"2023-07-18T08:43:07Z","access_level":"open_access"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"project":[{"_id":"2622978C-B435-11E9-9278-68D0E5697425","name":"Hybrid Semiconductor - Superconductor Quantum Devices"},{"_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","grant_number":"F07105"}],"doi":"10.1038/s41467-023-39656-2","oa":1,"corr_author":"1","external_id":{"isi":["001024729900009"],"pmid":["37407570"]},"article_type":"original","article_processing_charge":"No","volume":14,"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13227","title":"Inductively shunted transmons exhibit noise insensitive plasmon states and a fluxon decay exceeding 3 hours","publication_identifier":{"eissn":["2041-1723"]},"day":"05","department":[{"_id":"JoFi"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"fulldoi":"https://doi.org/10.1038/s41467-023-39656-2","year":"2023","publication":"Nature Communications","date_created":"2023-07-16T22:01:08Z","publication_status":"published","acknowledgement":"The authors thank J. Koch for discussions and support with the scQubits python package, I. Rozhansky and A. Poddubny for important insights into photon-assisted tunneling, S. Barzanjeh and G. Arnold for theory, E. Redchenko, S. Pepic, the MIBA workshop and the IST nanofabrication facility for technical contributions, as well as L. Drmic, P. Zielinski and R. Sett for software development. We acknowledge the prompt support of Quantum Machines to implement active state preparation with their OPX+. This work was supported by a NOMIS foundation research grant (J.F.), the Austrian Science Fund (FWF) through BeyondC F7105 (J.F.) and IST Austria.","isi":1,"article_number":"3968","intvolume":" 14","file_date_updated":"2023-07-18T08:43:07Z","ddc":["530"],"month":"07","publisher":"Springer Nature","pmid":1,"date_published":"2023-07-05T00:00:00Z","oa_version":"Published Version","citation":{"apa":"Hassani, F., Peruzzo, M., Kapoor, L., Trioni, A., Zemlicka, M., & Fink, J. M. (2023). Inductively shunted transmons exhibit noise insensitive plasmon states and a fluxon decay exceeding 3 hours. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-023-39656-2","mla":"Hassani, Farid, et al. “Inductively Shunted Transmons Exhibit Noise Insensitive Plasmon States and a Fluxon Decay Exceeding 3 Hours.” Nature Communications, vol. 14, 3968, Springer Nature, 2023, doi:10.1038/s41467-023-39656-2.","chicago":"Hassani, Farid, Matilda Peruzzo, Lucky Kapoor, Andrea Trioni, Martin Zemlicka, and Johannes M Fink. “Inductively Shunted Transmons Exhibit Noise Insensitive Plasmon States and a Fluxon Decay Exceeding 3 Hours.” Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-39656-2.","short":"F. Hassani, M. Peruzzo, L. Kapoor, A. Trioni, M. Zemlicka, J.M. Fink, Nature Communications 14 (2023).","ama":"Hassani F, Peruzzo M, Kapoor L, Trioni A, Zemlicka M, Fink JM. Inductively shunted transmons exhibit noise insensitive plasmon states and a fluxon decay exceeding 3 hours. Nature Communications. 2023;14. doi:10.1038/s41467-023-39656-2","ieee":"F. Hassani, M. Peruzzo, L. Kapoor, A. Trioni, M. Zemlicka, and J. M. Fink, “Inductively shunted transmons exhibit noise insensitive plasmon states and a fluxon decay exceeding 3 hours,” Nature Communications, vol. 14. Springer Nature, 2023.","ista":"Hassani F, Peruzzo M, Kapoor L, Trioni A, Zemlicka M, Fink JM. 2023. Inductively shunted transmons exhibit noise insensitive plasmon states and a fluxon decay exceeding 3 hours. Nature Communications. 14, 3968."},"quality_controlled":"1","status":"public","type":"journal_article","abstract":[{"text":"Currently available quantum processors are dominated by noise, which severely limits their applicability and motivates the search for new physical qubit encodings. In this work, we introduce the inductively shunted transmon, a weakly flux-tunable superconducting qubit that offers charge offset protection for all levels and a 20-fold reduction in flux dispersion compared to the state-of-the-art resulting in a constant coherence over a full flux quantum. The parabolic confinement provided by the inductive shunt as well as the linearity of the geometric superinductor facilitates a high-power readout that resolves quantum jumps with a fidelity and QND-ness of >90% and without the need for a Josephson parametric amplifier. Moreover, the device reveals quantum tunneling physics between the two prepared fluxon ground states with a measured average decay time of up to 3.5 h. In the future, fast time-domain control of the transition matrix elements could offer a new path forward to also achieve full qubit control in the decay-protected fluxon basis.","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"17133","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"author":[{"orcid":"0000-0001-6937-5773","full_name":"Hassani, Farid","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","last_name":"Hassani","first_name":"Farid"},{"orcid":"0000-0002-3415-4628","first_name":"Matilda","last_name":"Peruzzo","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","full_name":"Peruzzo, Matilda"},{"orcid":"0000-0001-8319-2148","first_name":"Lucky","last_name":"Kapoor","id":"84b9700b-15b2-11ec-abd3-831089e67615","full_name":"Kapoor, Lucky"},{"id":"42F71B44-F248-11E8-B48F-1D18A9856A87","full_name":"Trioni, Andrea","first_name":"Andrea","last_name":"Trioni"},{"orcid":"0009-0005-0878-3032","full_name":"Zemlicka, Martin","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","last_name":"Zemlicka","first_name":"Martin"},{"orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","first_name":"Johannes M"}],"date_updated":"2026-10-02T11:28:16Z","scopus_import":"1"},{"author":[{"id":"d6423cba-dc74-11ea-a0a7-ee61689ff5fb","full_name":"Glas, Jakob","first_name":"Jakob","last_name":"Glas"}],"date_updated":"2026-10-02T11:44:29Z","status":"public","OA_place":"repository","type":"preprint","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Using a two-dimensional version of the delta method, we establish an asymptotic formula for the number of rational points of bounded height on non-singular complete intersections of cubic and quadric hypersurfaces of dimension at least 23 over Fq(t), provided cha(Fq)>3. Under the same hypotheses, we also verify weak approximation."}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"18132"}]},"month":"06","date_published":"2023-06-05T00:00:00Z","citation":{"apa":"Glas, J. (n.d.). Complete intersections of cubic and quadric hypersurfaces over Fq(t). arXiv. https://doi.org/10.48550/arXiv.2306.02718","mla":"Glas, Jakob. “Complete Intersections of Cubic and Quadric Hypersurfaces over Fq(T).” ArXiv, 2306.02718, doi:10.48550/arXiv.2306.02718.","chicago":"Glas, Jakob. “Complete Intersections of Cubic and Quadric Hypersurfaces over Fq(T).” ArXiv, n.d. https://doi.org/10.48550/arXiv.2306.02718.","short":"J. Glas, ArXiv (n.d.).","ama":"Glas J. Complete intersections of cubic and quadric hypersurfaces over Fq(t). arXiv. doi:10.48550/arXiv.2306.02718","ista":"Glas J. Complete intersections of cubic and quadric hypersurfaces over Fq(t). arXiv, 2306.02718.","ieee":"J. Glas, “Complete intersections of cubic and quadric hypersurfaces over Fq(t),” arXiv. ."},"oa_version":"Preprint","publication_status":"draft","date_created":"2024-10-10T13:08:05Z","publication":"arXiv","year":"2023","article_number":"2306.02718","arxiv":1,"day":"05","department":[{"_id":"TiBr"}],"fulldoi":"https://doi.org/10.48550/arXiv.2306.02718","supplementarymaterial":"no","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"18294","title":"Complete intersections of cubic and quadric hypersurfaces over Fq(t)","das_tickbox":"0","external_id":{"arxiv":["2306.02718"]},"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2306.02718"}],"researchdata_availability":"no","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"oa":1,"doi":"10.48550/arXiv.2306.02718","corr_author":"1"},{"publication_identifier":{"issn":["0261-4189"],"eissn":["1460-2075"]},"day":"18","fulldoi":"https://doi.org/10.15252/embj.2022111926","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Auxin‐dependent regulation of cell division rates governs root thermomorphogenesis","_id":"23131","article_processing_charge":"Yes","article_type":"original","external_id":{"pmid":["37071525"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.15252/embj.2022111926"}],"volume":42,"has_accepted_license":"1","doi":"10.15252/embj.2022111926","oa":1,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"issue":"11","author":[{"full_name":"Ai, Haiyue","last_name":"Ai","first_name":"Haiyue"},{"first_name":"Julia","last_name":"Bellstaedt","full_name":"Bellstaedt, Julia"},{"full_name":"Bartusch, Kai","id":"0c51b9f5-90c8-11f1-b4ef-9ad5d3d9a34a","last_name":"Bartusch","first_name":"Kai","orcid":"0000-0003-2708-5545"},{"full_name":"Eschen‐Lippold, Lennart","last_name":"Eschen‐Lippold","first_name":"Lennart"},{"full_name":"Babben, Steve","first_name":"Steve","last_name":"Babben"},{"full_name":"Balcke, Gerd Ulrich","last_name":"Balcke","first_name":"Gerd Ulrich"},{"full_name":"Tissier, Alain","first_name":"Alain","last_name":"Tissier"},{"full_name":"Hause, Bettina","first_name":"Bettina","last_name":"Hause"},{"first_name":"Tonni Grube","last_name":"Andersen","full_name":"Andersen, Tonni Grube"},{"full_name":"Delker, Carolin","first_name":"Carolin","last_name":"Delker"},{"full_name":"Quint, Marcel","first_name":"Marcel","last_name":"Quint"}],"date_updated":"2026-10-14T10:36:57Z","OA_type":"gold","scopus_import":"1","status":"public","quality_controlled":"1","abstract":[{"lang":"eng","text":"Roots are highly plastic organs enabling plants to adapt to a changing below‐ground environment. In addition to abiotic factors like nutrients or mechanical resistance, plant roots also respond to temperature variation. Below the heat stress threshold, Arabidopsis thaliana seedlings react to elevated temperature by promoting primary root growth, possibly to reach deeper soil regions with potentially better water saturation. While above‐ground thermomorphogenesis is enabled by thermo‐sensitive cell elongation, it was unknown how temperature modulates root growth. We here show that roots are able to sense and respond to elevated temperature independently of shoot‐derived signals. This response is mediated by a yet unknown root thermosensor that employs auxin as a messenger to relay temperature signals to the cell cycle. Growth promotion is achieved primarily by increasing cell division rates in the root apical meristem, depending on de novo local auxin biosynthesis and temperature‐sensitive organization of the polar auxin transport system. Hence, the primary cellular target of elevated ambient temperature differs fundamentally between root and shoot tissues, while the messenger auxin remains the same."}],"language":[{"iso":"eng"}],"type":"journal_article","OA_place":"publisher","pmid":1,"date_published":"2023-04-18T00:00:00Z","month":"04","ddc":["580"],"extern":"1","publisher":"Springer","citation":{"ieee":"H. Ai et al., “Auxin‐dependent regulation of cell division rates governs root thermomorphogenesis,” The EMBO Journal, vol. 42, no. 11. Springer, 2023.","ista":"Ai H, Bellstaedt J, Bartusch K, Eschen‐Lippold L, Babben S, Balcke GU, Tissier A, Hause B, Andersen TG, Delker C, Quint M. 2023. Auxin‐dependent regulation of cell division rates governs root thermomorphogenesis. The EMBO Journal. 42(11), EMBJ2022111926.","ama":"Ai H, Bellstaedt J, Bartusch K, et al. Auxin‐dependent regulation of cell division rates governs root thermomorphogenesis. The EMBO Journal. 2023;42(11). doi:10.15252/embj.2022111926","mla":"Ai, Haiyue, et al. “Auxin‐dependent Regulation of Cell Division Rates Governs Root Thermomorphogenesis.” The EMBO Journal, vol. 42, no. 11, EMBJ2022111926, Springer, 2023, doi:10.15252/embj.2022111926.","chicago":"Ai, Haiyue, Julia Bellstaedt, Kai Bartusch, Lennart Eschen‐Lippold, Steve Babben, Gerd Ulrich Balcke, Alain Tissier, et al. “Auxin‐dependent Regulation of Cell Division Rates Governs Root Thermomorphogenesis.” The EMBO Journal. Springer, 2023. https://doi.org/10.15252/embj.2022111926.","apa":"Ai, H., Bellstaedt, J., Bartusch, K., Eschen‐Lippold, L., Babben, S., Balcke, G. U., … Quint, M. (2023). Auxin‐dependent regulation of cell division rates governs root thermomorphogenesis. The EMBO Journal. Springer. https://doi.org/10.15252/embj.2022111926","short":"H. Ai, J. Bellstaedt, K. Bartusch, L. Eschen‐Lippold, S. Babben, G.U. Balcke, A. Tissier, B. Hause, T.G. Andersen, C. Delker, M. Quint, The EMBO Journal 42 (2023)."},"oa_version":"Published Version","date_created":"2026-10-13T11:15:14Z","publication":"The EMBO Journal","year":"2023","publication_status":"published","article_number":"EMBJ2022111926","intvolume":" 42"},{"year":"2023","date_created":"2026-10-13T11:15:03Z","publication":"Xylem","publication_status":"published","intvolume":" 2722","pmid":1,"date_published":"2023-10-29T00:00:00Z","extern":"1","month":"10","publisher":"Springer","citation":{"chicago":"Bartusch, Kai, Noel Blanco-Touriñán, Antia Rodriguez-Villalón, and Elisabeth Truernit. “Monitoring Xylem Transport in Arabidopsis Thaliana Seedlings Using Fluorescent Dyes.” In Xylem, 2nd ed., 2722:3–15. MIMB. New York, NY: Springer, 2023. https://doi.org/10.1007/978-1-0716-3477-6_1.","mla":"Bartusch, Kai, et al. “Monitoring Xylem Transport in Arabidopsis Thaliana Seedlings Using Fluorescent Dyes.” Xylem, 2nd ed., vol. 2722, Springer, 2023, pp. 3–15, doi:10.1007/978-1-0716-3477-6_1.","apa":"Bartusch, K., Blanco-Touriñán, N., Rodriguez-Villalón, A., & Truernit, E. (2023). Monitoring Xylem Transport in Arabidopsis thaliana Seedlings Using Fluorescent Dyes. In Xylem (2nd ed., Vol. 2722, pp. 3–15). New York, NY: Springer. https://doi.org/10.1007/978-1-0716-3477-6_1","short":"K. Bartusch, N. Blanco-Touriñán, A. Rodriguez-Villalón, E. Truernit, in:, Xylem, 2nd ed., Springer, New York, NY, 2023, pp. 3–15.","ista":"Bartusch K, Blanco-Touriñán N, Rodriguez-Villalón A, Truernit E. 2023.Monitoring Xylem Transport in Arabidopsis thaliana Seedlings Using Fluorescent Dyes. In: Xylem. Methods in Molecular Biology, vol. 2722, 3–15.","ieee":"K. Bartusch, N. Blanco-Touriñán, A. Rodriguez-Villalón, and E. Truernit, “Monitoring Xylem Transport in Arabidopsis thaliana Seedlings Using Fluorescent Dyes,” in Xylem, 2nd ed., vol. 2722, New York, NY: Springer, 2023, pp. 3–15.","ama":"Bartusch K, Blanco-Touriñán N, Rodriguez-Villalón A, Truernit E. Monitoring Xylem Transport in Arabidopsis thaliana Seedlings Using Fluorescent Dyes. In: Xylem. Vol 2722. 2nd ed. MIMB. New York, NY: Springer; 2023:3-15. doi:10.1007/978-1-0716-3477-6_1"},"oa_version":"None","quality_controlled":"1","status":"public","abstract":[{"lang":"eng","text":"Fluorescent dyes are often used to observe transport mechanisms in plant vascular tissues. However, it has been technically challenging to apply fluorescent dyes on roots to monitor xylem transport in vivo. Here, we present a fast, noninvasive, and high-throughput protocol to monitor xylem transport in seedlings. Using the fluorescent dyes 5(6)-carboxyfluorescein diacetate (CFDA) and Rhodamine WT, we were able to observe xylem transport on a cellular level in Arabidopsis thaliana roots. We describe how to apply these dyes on primary roots of young seedlings, how to monitor root-to-shoot xylem transport, and how to measure xylem transport velocity in roots. Moreover, we show that our protocol can also be applied to lateral roots and grafted seedlings to assess xylem (re)connection. Altogether, these techniques are useful for investigating xylem functionality in diverse experimental setups."}],"language":[{"iso":"eng"}],"type":"book_chapter","author":[{"orcid":"0000-0003-2708-5545","id":"0c51b9f5-90c8-11f1-b4ef-9ad5d3d9a34a","full_name":"Bartusch, Kai","first_name":"Kai","last_name":"Bartusch"},{"full_name":"Blanco-Touriñán, Noel","last_name":"Blanco-Touriñán","first_name":"Noel"},{"last_name":"Rodriguez-Villalón","first_name":"Antia","full_name":"Rodriguez-Villalón, Antia"},{"full_name":"Truernit, Elisabeth","first_name":"Elisabeth","last_name":"Truernit"}],"date_updated":"2026-10-14T10:33:41Z","scopus_import":"1","OA_type":"closed access","edition":"2","doi":"10.1007/978-1-0716-3477-6_1","alternative_title":["Methods in Molecular Biology"],"article_processing_charge":"No","external_id":{"pmid":["37897596"]},"volume":2722,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Monitoring Xylem Transport in Arabidopsis thaliana Seedlings Using Fluorescent Dyes","place":"New York, NY","_id":"23130","publication_identifier":{"isbn":["9781071634769"],"eisbn":["9781071634776"],"issn":["1064-3745"],"eissn":["1940-6029"]},"page":"3-15","day":"29","series_title":"MIMB","fulldoi":"https://doi.org/10.1007/978-1-0716-3477-6_1"},{"OA_type":"green","fulldoi":"https://doi.org/10.5281/zenodo.8219190","date_updated":"2026-10-16T07:53:26Z","department":[{"_id":"KrCh"}],"author":[{"first_name":"Kush","last_name":"Grover","full_name":"Grover, Kush"},{"full_name":"Weiniger, Maximilian","first_name":"Maximilian","last_name":"Weiniger"},{"last_name":"Kretinsky","first_name":"Jan","full_name":"Kretinsky, Jan"}],"day":"06","title":"QComp LRA results","related_material":{"record":[{"id":"18600","relation":"used_in_publication","status":"public"}]},"abstract":[{"lang":"eng","text":"It contains the benchmarks and the results of comparison between STORM, PET and MultiGain for the QComp category of Long-Run Average rewards."}],"_id":"23142","OA_place":"repository","type":"research_data_reference","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","oa_version":"None","citation":{"ama":"Grover K, Weiniger M, Kretinsky J. QComp LRA results. 2023. doi:10.5281/zenodo.8219190","ista":"Grover K, Weiniger M, Kretinsky J. 2023. QComp LRA results, Zenodo, 10.5281/zenodo.8219190.","ieee":"K. Grover, M. Weiniger, and J. Kretinsky, “QComp LRA results.” Zenodo, 2023.","short":"K. Grover, M. Weiniger, J. Kretinsky, (2023).","apa":"Grover, K., Weiniger, M., & Kretinsky, J. (2023). QComp LRA results. Zenodo. https://doi.org/10.5281/zenodo.8219190","mla":"Grover, Kush, et al. QComp LRA Results. Zenodo, 2023, doi:10.5281/zenodo.8219190.","chicago":"Grover, Kush, Maximilian Weiniger, and Jan Kretinsky. “QComp LRA Results.” Zenodo, 2023. https://doi.org/10.5281/zenodo.8219190."},"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.8219190","open_access":"1"}],"article_processing_charge":"No","date_published":"2023-08-06T00:00:00Z","publisher":"Zenodo","month":"08","oa":1,"doi":"10.5281/zenodo.8219190","date_created":"2026-10-16T07:53:22Z","year":"2023"},{"type":"conference","abstract":[{"lang":"eng","text":"Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective. This gives rise to an objective function that demands the control of systems in a risk-averse manner. We show that the resulting games are determined and, in particular, admit optimal memoryless deterministic strategies. This contrasts risk measures that previously have been considered in the special case of Markov decision processes and that require randomization and/or memory. We provide several results on the decidability and the computational complexity of the threshold problem, i.e. whether the optimal value of ERisk exceeds a given threshold. In the most general case, the problem is decidable subject to Shanuel’s conjecture. If all inputs are rational, the resulting threshold problem can be solved using algebraic numbers, leading to decidability via a polynomial-time reduction to the existential theory of the reals. Further restrictions on the encoding of the input allow the solution of the threshold problem in NP∩coNP. Finally, an approximation algorithm for the optimal value of ERisk is provided."}],"related_material":{"record":[{"relation":"later_version","id":"17474","status":"public"}]},"language":[{"iso":"eng"}],"quality_controlled":"1","status":"public","date_updated":"2026-10-16T08:04:31Z","scopus_import":"1","author":[{"full_name":"Baier, Christel","first_name":"Christel","last_name":"Baier"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias","first_name":"Tobias","last_name":"Meggendorfer"},{"full_name":"Piribauer, Jakob","first_name":"Jakob","last_name":"Piribauer"}],"article_number":"15","acknowledgement":"This work was partly funded by the ERC CoG 863818 (ForM-SMArt), the DFG Grant\r\n389792660 as part of TRR 248 (Foundations of Perspicuous Software Systems), the Cluster of\r\nExcellence EXC 2050/1 (CeTI, project ID 390696704, as part of Germany’s Excellence Strategy), and the DFG projects BA-1679/11-1 and BA-1679/12-1.","intvolume":" 272","file_date_updated":"2023-10-09T09:19:11Z","year":"2023","date_created":"2023-10-09T09:21:05Z","publication":"48th International Symposium on Mathematical Foundations of Computer Science","publication_status":"published","oa_version":"Published Version","citation":{"apa":"Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2023.15","chicago":"Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” In 48th International Symposium on Mathematical Foundations of Computer Science, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.MFCS.2023.15.","mla":"Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.” 48th International Symposium on Mathematical Foundations of Computer Science, vol. 272, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.MFCS.2023.15.","short":"C. Baier, K. Chatterjee, T. Meggendorfer, J. Piribauer, in:, 48th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ama":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Entropic risk for turn-based stochastic games. In: 48th International Symposium on Mathematical Foundations of Computer Science. Vol 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.MFCS.2023.15","ieee":"C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in 48th International Symposium on Mathematical Foundations of Computer Science, Bordeaux, France, 2023, vol. 272.","ista":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. 2023. Entropic risk for turn-based stochastic games. 48th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 272, 15."},"ddc":["000"],"month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2023-08-21T00:00:00Z","_id":"14417","title":"Entropic risk for turn-based stochastic games","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"department":[{"_id":"KrCh"}],"fulldoi":"https://doi.org/10.4230/LIPIcs.MFCS.2023.15","publication_identifier":{"isbn":["9783959772921"],"eissn":["1868-8969"]},"arxiv":1,"day":"21","conference":{"location":"Bordeaux, France","start_date":"2023-08-28","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2023-09-01"},"corr_author":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"access_level":"open_access","success":1,"date_updated":"2023-10-09T09:19:11Z","relation":"main_file","content_type":"application/pdf","date_created":"2023-10-09T09:19:11Z","file_id":"14418","file_name":"2023_LIPIcsMFCS_Baier.pdf","file_size":826843,"creator":"dernst","checksum":"402281b17ed669bbf149d0fdf68ac201"}],"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020"}],"oa":1,"doi":"10.4230/LIPIcs.MFCS.2023.15","has_accepted_license":"1","volume":272,"external_id":{"arxiv":["2307.06611"]},"alternative_title":["LIPIcs"],"article_processing_charge":"Yes"},{"status":"public","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u, v) is determined by how much nodes u and v allocate for this link. Specifically, the input is a finite ordered sequence of packets that arrive in both directions along a link. Given (u, v) and a packet of weight x going from u to v, node u can either accept or reject the packet. If u accepts the packet, the capacity on link (u, v) decreases by x. Correspondingly, v’s capacity on (u, v) increases by x. If a node rejects the packet, this will entail a cost affinely linear in the weight of the packet. A link is “rechargeable” in the sense that the total capacity of the link has to remain constant, but the allocation of capacity at the ends of the link can depend arbitrarily on the nodes’ decisions. The goal is to minimise the sum of the capacity injected into the link and the cost of rejecting packets. We show that the problem is NP-hard, but can be approximated efficiently with a ratio of (1 + E) . (1 + square3) for some arbitrary E>0."}],"related_material":{"record":[{"status":"public","id":"14820","relation":"later_version"}]},"author":[{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"last_name":"Svoboda","first_name":"Jakub","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267"},{"orcid":"0009-0001-3676-4809","last_name":"Yeo","first_name":"Michelle X","full_name":"Yeo, Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87"}],"OA_type":"closed access","scopus_import":"1","date_updated":"2026-10-16T08:09:27Z","publication_status":"published","year":"2023","publication":"30th International Colloquium on Structural Information and Communication Complexity","date_created":"2025-07-10T13:15:43Z","intvolume":" 13892","acknowledgement":"We thank Mahsa Bastankhah and Mohammad Ali Maddah-Ali for fruitful discussions about different variants of the problem. This work is supported by the European Research Council (ERC) Consolidator Project 864228 (AdjustNet), 2020-2025, the ERC CoG 863818 (ForM-SMArt), and the German Research Foundation (DFG) grant 470029389 (FlexNets), 2021–2024.","isi":1,"publisher":"Springer Nature","month":"05","date_published":"2023-05-25T00:00:00Z","oa_version":"None","citation":{"short":"S. Schmid, J. Svoboda, M.X. Yeo, in:, 30th International Colloquium on Structural Information and Communication Complexity, Springer Nature, 2023, pp. 576–594.","apa":"Schmid, S., Svoboda, J., & Yeo, M. X. (2023). Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In 30th International Colloquium on Structural Information and Communication Complexity (Vol. 13892, pp. 576–594). Alcalá de Henares, Spain: Springer Nature. https://doi.org/10.1007/978-3-031-32733-9_26","chicago":"Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Acket Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” In 30th International Colloquium on Structural Information and Communication Complexity, 13892:576–94. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-32733-9_26.","mla":"Schmid, Stefan, et al. “Weighted Acket Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” 30th International Colloquium on Structural Information and Communication Complexity, vol. 13892, Springer Nature, 2023, pp. 576–94, doi:10.1007/978-3-031-32733-9_26.","ama":"Schmid S, Svoboda J, Yeo MX. Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In: 30th International Colloquium on Structural Information and Communication Complexity. Vol 13892. Springer Nature; 2023:576-594. doi:10.1007/978-3-031-32733-9_26","ieee":"S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” in 30th International Colloquium on Structural Information and Communication Complexity, Alcalá de Henares, Spain, 2023, vol. 13892, pp. 576–594.","ista":"Schmid S, Svoboda J, Yeo MX. 2023. Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. 30th International Colloquium on Structural Information and Communication Complexity. SIROCCO: International Colloquium on Structural Information and Communication Complexity, LNCS, vol. 13892, 576–594."},"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"19985","title":"Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation","page":"576-594","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031327322"],"eisbn":["9783031327339"]},"day":"25","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"fulldoi":"https://doi.org/10.1007/978-3-031-32733-9_26","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"doi":"10.1007/978-3-031-32733-9_26","conference":{"end_date":"2023-06-09","start_date":"2023-06-06","location":"Alcalá de Henares, Spain","name":"SIROCCO: International Colloquium on Structural Information and Communication Complexity"},"corr_author":"1","external_id":{"isi":["001292782600026"]},"article_processing_charge":"No","alternative_title":["LNCS"],"volume":13892},{"day":"21","arxiv":1,"author":[{"id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9","full_name":"Reker, Jana","first_name":"Jana","last_name":"Reker"}],"fulldoi":"https://doi.org/10.48550/arXiv.2307.11028","date_updated":"2026-10-16T08:38:42Z","department":[{"_id":"LaEr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Multi-point functional central limit theorem for Wigner Matrices","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Consider the random variable $\\mathrm{Tr}( f_1(W)A_1\\dots f_k(W)A_k)$ where $W$ is an $N\\times N$ Hermitian Wigner matrix, $k\\in\\mathbb{N}$, and choose (possibly $N$-dependent) regular functions $f_1,\\dots, f_k$ as well as bounded deterministic matrices $A_1,\\dots,A_k$. We give a functional central limit theorem showing that the fluctuations around the expectation are Gaussian. Moreover, we determine the limiting covariance structure and give explicit error bounds in terms of the scaling of $f_1,\\dots,f_k$ and the number of traceless matrices among $A_1,\\dots,A_k$, thus extending the results of [Cipolloni, Erdős, Schröder 2023] to products of arbitrary length $k\\geq2$. As an application, we consider the fluctuation of $\\mathrm{Tr}(\\mathrm{e}^{\\mathrm{i} tW}A_1\\mathrm{e}^{-\\mathrm{i} tW}A_2)$ around its thermal value $\\mathrm{Tr}(A_1)\\mathrm{Tr}(A_2)$ when $t$ is large and give an explicit formula for the variance."}],"related_material":{"record":[{"relation":"dissertation_contains","id":"17164","status":"public"},{"status":"public","relation":"later_version","id":"18762"}]},"_id":"17173","OA_place":"repository","type":"preprint","date_published":"2023-07-21T00:00:00Z","article_processing_charge":"No","month":"07","external_id":{"arxiv":["2307.11028"]},"citation":{"short":"J. Reker, ArXiv (n.d.).","mla":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” ArXiv, 2307.11028, doi:10.48550/arXiv.2307.11028.","chicago":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2307.11028.","apa":"Reker, J. (n.d.). Multi-point functional central limit theorem for Wigner Matrices. arXiv. https://doi.org/10.48550/arXiv.2307.11028","ieee":"J. Reker, “Multi-point functional central limit theorem for Wigner Matrices,” arXiv. .","ista":"Reker J. Multi-point functional central limit theorem for Wigner Matrices. arXiv, 2307.11028.","ama":"Reker J. Multi-point functional central limit theorem for Wigner Matrices. arXiv. doi:10.48550/arXiv.2307.11028"},"oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2307.11028","open_access":"1"}],"publication_status":"draft","oa":1,"doi":"10.48550/arXiv.2307.11028","date_created":"2024-06-26T08:54:56Z","publication":"arXiv","year":"2023","article_number":"2307.11028"},{"fulldoi":"https://doi.org/10.48550/arXiv.2310.06677","department":[{"_id":"LaEr"}],"day":"23","arxiv":1,"title":"Prethermalization for deformed Wigner Matrices","_id":"17174","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.06677"}],"article_processing_charge":"No","external_id":{"arxiv":["2310.06677"]},"corr_author":"1","oa":1,"project":[{"grant_number":"101020331","name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"doi":"10.48550/arXiv.2310.06677","date_updated":"2026-10-16T08:41:47Z","author":[{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603"},{"orcid":"0000-0003-1106-327X","full_name":"Henheik, Sven Joscha","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","last_name":"Henheik","first_name":"Sven Joscha"},{"id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9","full_name":"Reker, Jana","first_name":"Jana","last_name":"Reker"},{"first_name":"Volodymyr","last_name":"Riabov","id":"1949f904-edfb-11eb-afb5-e2dfddabb93b","full_name":"Riabov, Volodymyr"}],"abstract":[{"text":"We prove that a class of weakly perturbed Hamiltonians of the form $H_λ= H_0 + λW$, with $W$ being a Wigner matrix, exhibits prethermalization. That is, the time evolution generated by $H_λ$ relaxes to its ultimate thermal state via an intermediate prethermal state with a lifetime of order $λ^{-2}$. Moreover, we obtain a general relaxation formula, expressing the perturbed dynamics via the unperturbed dynamics and the ultimate thermal state. The proof relies on a two-resolvent law for the deformed Wigner matrix $H_λ$.","lang":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"20575","status":"public"},{"relation":"dissertation_contains","id":"17164","status":"public"},{"id":"18764","relation":"later_version","status":"public"}]},"language":[{"iso":"eng"}],"type":"preprint","OA_place":"repository","status":"public","citation":{"ista":"Erdös L, Henheik SJ, Reker J, Riabov V. Prethermalization for deformed Wigner Matrices. arXiv, 2310.06677.","ieee":"L. Erdös, S. J. Henheik, J. Reker, and V. Riabov, “Prethermalization for deformed Wigner Matrices,” arXiv. .","ama":"Erdös L, Henheik SJ, Reker J, Riabov V. Prethermalization for deformed Wigner Matrices. arXiv. doi:10.48550/arXiv.2310.06677","short":"L. Erdös, S.J. Henheik, J. Reker, V. Riabov, ArXiv (n.d.).","mla":"Erdös, László, et al. “Prethermalization for Deformed Wigner Matrices.” ArXiv, 2310.06677, doi:10.48550/arXiv.2310.06677.","chicago":"Erdös, László, Sven Joscha Henheik, Jana Reker, and Volodymyr Riabov. “Prethermalization for Deformed Wigner Matrices.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2310.06677.","apa":"Erdös, L., Henheik, S. J., Reker, J., & Riabov, V. (n.d.). Prethermalization for deformed Wigner Matrices. arXiv. https://doi.org/10.48550/arXiv.2310.06677"},"oa_version":"Preprint","date_published":"2023-12-23T00:00:00Z","month":"12","article_number":"2310.06677","date_created":"2024-06-26T08:56:52Z","publication":"arXiv","year":"2023","publication_status":"draft"},{"citation":{"ama":"Esposito AR, Mondelli M. Concentration without independence via information measures. In: Proceedings of 2023 IEEE International Symposium on Information Theory. IEEE; 2023:400-405. doi:10.1109/isit54713.2023.10206899","ista":"Esposito AR, Mondelli M. 2023. Concentration without independence via information measures. Proceedings of 2023 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 400–405.","ieee":"A. R. Esposito and M. Mondelli, “Concentration without independence via information measures,” in Proceedings of 2023 IEEE International Symposium on Information Theory, Taipei, Taiwan, 2023, pp. 400–405.","apa":"Esposito, A. R., & Mondelli, M. (2023). Concentration without independence via information measures. In Proceedings of 2023 IEEE International Symposium on Information Theory (pp. 400–405). Taipei, Taiwan: IEEE. https://doi.org/10.1109/isit54713.2023.10206899","mla":"Esposito, Amedeo Roberto, and Marco Mondelli. “Concentration without Independence via Information Measures.” Proceedings of 2023 IEEE International Symposium on Information Theory, IEEE, 2023, pp. 400–05, doi:10.1109/isit54713.2023.10206899.","chicago":"Esposito, Amedeo Roberto, and Marco Mondelli. “Concentration without Independence via Information Measures.” In Proceedings of 2023 IEEE International Symposium on Information Theory, 400–405. IEEE, 2023. https://doi.org/10.1109/isit54713.2023.10206899.","short":"A.R. Esposito, M. Mondelli, in:, Proceedings of 2023 IEEE International Symposium on Information Theory, IEEE, 2023, pp. 400–405."},"oa_version":"Preprint","date_published":"2023-06-30T00:00:00Z","month":"06","publisher":"IEEE","acknowledgement":"The authors are partially supported by the 2019 Lopez-Loreta Prize. They would also like to thank Professor Jan Maas for providing valuable suggestions and comments on an early version of the work.","date_created":"2024-02-02T11:18:40Z","year":"2023","publication":"Proceedings of 2023 IEEE International Symposium on Information Theory","publication_status":"published","date_updated":"2026-10-16T10:39:43Z","scopus_import":"1","author":[{"full_name":"Esposito, Amedeo Roberto","id":"9583e921-e1ad-11ec-9862-cef099626dc9","last_name":"Esposito","first_name":"Amedeo Roberto"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020"}],"abstract":[{"lang":"eng","text":"We propose a novel approach to concentration for non-independent random variables. The main idea is to ``pretend'' that the random variables are independent and pay a multiplicative price measuring how far they are from actually being independent. This price is encapsulated in the Hellinger integral between the joint and the product of the marginals, which is then upper bounded leveraging tensorisation properties. Our bounds represent a natural generalisation of concentration inequalities in the presence of dependence: we recover exactly the classical bounds (McDiarmid's inequality) when the random variables are independent. Furthermore, in a ``large deviations'' regime, we obtain the same decay in the probability as for the independent case, even when the random variables display non-trivial dependencies. To show this, we consider a number of applications of interest. First, we provide a bound for Markov chains with finite state space. Then, we consider the Simple Symmetric Random Walk, which is a non-contracting Markov chain, and a non-Markovian setting in which the stochastic process depends on its entire past. To conclude, we propose an application to Markov Chain Monte Carlo methods, where our approach leads to an improved lower bound on the minimum burn-in period required to reach a certain accuracy. In all of these settings, we provide a regime of parameters in which our bound fares better than what the state of the art can provide."}],"related_material":{"record":[{"relation":"later_version","id":"15172","status":"public"}]},"language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","status":"public","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2303.07245","open_access":"1"}],"article_processing_charge":"No","external_id":{"arxiv":["2303.07245"]},"corr_author":"1","conference":{"start_date":"2023-06-25","location":"Taipei, Taiwan","name":"ISIT: International Symposium on Information Theory","end_date":"2023-06-30"},"doi":"10.1109/isit54713.2023.10206899","oa":1,"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"fulldoi":"https://doi.org/10.1109/isit54713.2023.10206899","department":[{"_id":"MaMo"}],"arxiv":1,"day":"30","page":"400-405","publication_identifier":{"eissn":["2157-8117"],"eisbn":["9781665475549"]},"title":"Concentration without independence via information measures","_id":"14922","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"quality_controlled":"1","status":"public","type":"conference","related_material":{"record":[{"relation":"later_version","id":"17330","status":"public"}]},"abstract":[{"text":"In this work we consider the list-decodability and list-recoverability of arbitrary q-ary codes, for all integer values of q ≥ 2. A code is called (p,L)_q-list-decodable if every radius pn Hamming ball contains less than L codewords; (p,𝓁,L)_q-list-recoverability is a generalization where we place radius pn Hamming balls on every point of a combinatorial rectangle with side length 𝓁 and again stipulate that there be less than L codewords.\r\nOur main contribution is to precisely calculate the maximum value of p for which there exist infinite families of positive rate (p,𝓁,L)_q-list-recoverable codes, the quantity we call the zero-rate threshold. Denoting this value by p_*, we in fact show that codes correcting a p_*+ε fraction of errors must have size O_ε(1), i.e., independent of n. Such a result is typically referred to as a \"Plotkin bound.\" To complement this, a standard random code with expurgation construction shows that there exist positive rate codes correcting a p_*-ε fraction of errors. We also follow a classical proof template (typically attributed to Elias and Bassalygo) to derive from the zero-rate threshold other tradeoffs between rate and decoding radius for list-decoding and list-recovery.\r\nTechnically, proving the Plotkin bound boils down to demonstrating the Schur convexity of a certain function defined on the q-simplex as well as the convexity of a univariate function derived from it. We remark that an earlier argument claimed similar results for q-ary list-decoding; however, we point out that this earlier proof is flawed.","lang":"eng"}],"language":[{"iso":"eng"}],"author":[{"full_name":"Resch, Nicolas","last_name":"Resch","first_name":"Nicolas"},{"last_name":"Yuan","first_name":"Chen","full_name":"Yuan, Chen"},{"full_name":"Zhang, Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","last_name":"Zhang","first_name":"Yihan","orcid":"0000-0002-6465-6258"}],"date_updated":"2026-10-16T10:41:58Z","scopus_import":"1","publication":"50th International Colloquium on Automata, Languages, and Programming","year":"2023","date_created":"2023-08-20T22:01:13Z","publication_status":"published","article_number":"99","acknowledgement":"Nicolas Resch: Research supported in part by ERC H2020 grant No.74079 (ALGSTRONGCRYPTO). Chen Yuan: Research supported in part by the National Key Research and Development Projects under Grant 2022YFA1004900 and Grant 2021YFE0109900, the National Natural Science Foundation of China under Grant 12101403 and Grant 12031011.\r\nAcknowledgements YZ is grateful to Shashank Vatedka, Diyuan Wu and Fengxing Zhu for inspiring discussions.","intvolume":" 261","file_date_updated":"2023-08-21T07:23:18Z","month":"07","ddc":["000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2023-07-01T00:00:00Z","oa_version":"Published Version","citation":{"ama":"Resch N, Yuan C, Zhang Y. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.99","ista":"Resch N, Yuan C, Zhang Y. 2023. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. 50th International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 261, 99.","ieee":"N. Resch, C. Yuan, and Y. Zhang, “Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.","apa":"Resch, N., Yuan, C., & Zhang, Y. (2023). Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.99","chicago":"Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.99.","mla":"Resch, Nicolas, et al. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.99.","short":"N. Resch, C. Yuan, Y. Zhang, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14083","title":"Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery","day":"01","arxiv":1,"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772785"]},"department":[{"_id":"MaMo"}],"fulldoi":"https://doi.org/10.4230/LIPIcs.ICALP.2023.99","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"date_created":"2023-08-21T07:23:18Z","file_id":"14091","content_type":"application/pdf","checksum":"a449143fec3fbebb092cb8ef3b53c226","creator":"dernst","file_size":1141497,"file_name":"2023_LIPIcsICALP_Resch.pdf","access_level":"open_access","date_updated":"2023-08-21T07:23:18Z","relation":"main_file","success":1}],"oa":1,"doi":"10.4230/LIPIcs.ICALP.2023.99","conference":{"end_date":"2023-07-14","start_date":"2023-07-10","location":"Paderborn, Germany","name":"ICALP: Automata, Languages and Programming"},"corr_author":"1","external_id":{"arxiv":["2210.07754"]},"article_processing_charge":"Yes","alternative_title":["LIPIcs"],"has_accepted_license":"1","volume":261}]