[{"citation":{"ieee":"M. Valentini, “Data repository for ‘Parity-conserving Cooper-pair transport and ideal superconducting diode in planar Germanium.’” Zenodo, 2023.","apa":"Valentini, M. (2023). Data repository for “Parity-conserving Cooper-pair transport and ideal superconducting diode in planar Germanium.” Zenodo. <a href=\"https://doi.org/10.5281/zenodo.10119345\">https://doi.org/10.5281/zenodo.10119345</a>","chicago":"Valentini, Marco. “Data Repository for ‘Parity-Conserving Cooper-Pair Transport and Ideal Superconducting Diode in Planar Germanium.’” Zenodo, 2023. <a href=\"https://doi.org/10.5281/zenodo.10119345\">https://doi.org/10.5281/zenodo.10119345</a>.","short":"M. Valentini, (2023).","ista":"Valentini M. 2023. Data repository for ‘Parity-conserving Cooper-pair transport and ideal superconducting diode in planar Germanium’, Zenodo, <a href=\"https://doi.org/10.5281/zenodo.10119345\">10.5281/zenodo.10119345</a>.","ama":"Valentini M. Data repository for “Parity-conserving Cooper-pair transport and ideal superconducting diode in planar Germanium.” 2023. doi:<a href=\"https://doi.org/10.5281/zenodo.10119345\">10.5281/zenodo.10119345</a>","mla":"Valentini, Marco. <i>Data Repository for “Parity-Conserving Cooper-Pair Transport and Ideal Superconducting Diode in Planar Germanium.”</i> Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/zenodo.10119345\">10.5281/zenodo.10119345</a>."},"fulldoi":"https://doi.org/10.5281/zenodo.10119345","related_material":{"record":[{"id":"14793","status":"public","relation":"used_in_publication"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"GeKa"}],"publisher":"Zenodo","author":[{"last_name":"Valentini","first_name":"Marco","full_name":"Valentini, Marco"}],"day":"13","_id":"23036","year":"2023","date_created":"2026-10-02T10:23:47Z","doi":"10.5281/zenodo.10119345","month":"11","OA_place":"repository","date_published":"2023-11-13T00:00:00Z","OA_type":"green","oa_version":"None","ddc":["530"],"article_processing_charge":"No","status":"public","oa":1,"date_updated":"2026-10-02T10:23:54Z","type":"research_data_reference","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.10119345","open_access":"1"}],"title":"Data repository for 'Parity-conserving Cooper-pair transport and ideal superconducting diode in planar Germanium'"},{"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.","has_accepted_license":"1","_id":"17378","day":"01","date_published":"2023-05-01T00:00:00Z","acknowledged_ssus":[{"_id":"ScienComp"}],"article_processing_charge":"No","status":"public","oa_version":"Published Version","ddc":["000"],"publication":"11th International Conference on Learning Representations ","title":"OPTQ: Accurate post-training quantization for generative pre-trained transformers","file_date_updated":"2024-08-05T07:52:44Z","type":"conference","corr_author":"1","citation":{"short":"E. Frantar, S. Ashkboos, T. Hoefler, D.-A. Alistarh, in:, 11th International Conference on Learning Representations , International Conference on Learning Representations, 2023.","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.","ama":"Frantar E, Ashkboos S, Hoefler T, Alistarh D-A. OPTQ: Accurate post-training quantization for generative pre-trained transformers. In: <i>11th International Conference on Learning Representations </i>. International Conference on Learning Representations; 2023.","mla":"Frantar, Elias, et al. “OPTQ: Accurate Post-Training Quantization for Generative Pre-Trained Transformers.” <i>11th International Conference on Learning Representations </i>, International Conference on Learning Representations, 2023.","ieee":"E. Frantar, S. Ashkboos, T. Hoefler, and D.-A. Alistarh, “OPTQ: Accurate post-training quantization for generative pre-trained transformers,” in <i>11th International Conference on Learning Representations </i>, Kigali, Rwanda, 2023.","apa":"Frantar, E., Ashkboos, S., Hoefler, T., &#38; Alistarh, D.-A. (2023). OPTQ: Accurate post-training quantization for generative pre-trained transformers. In <i>11th International Conference on Learning Representations </i>. Kigali, Rwanda: International Conference on Learning Representations.","chicago":"Frantar, Elias, Saleh Ashkboos, Torsten Hoefler, and Dan-Adrian Alistarh. “OPTQ: Accurate Post-Training Quantization for Generative Pre-Trained Transformers.” In <i>11th International Conference on Learning Representations </i>. International Conference on Learning Representations, 2023."},"publisher":"International Conference on Learning Representations","year":"2023","date_created":"2024-08-04T22:01:22Z","conference":{"end_date":"2023-05-05","start_date":"2023-05-01","name":"ICLR: International Conference on Learning Representations","location":"Kigali, Rwanda"},"author":[{"full_name":"Frantar, Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","last_name":"Frantar","first_name":"Elias"},{"first_name":"Saleh","last_name":"Ashkboos","full_name":"Ashkboos, Saleh"},{"first_name":"Torsten","last_name":"Hoefler","full_name":"Hoefler, Torsten"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"}],"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"}],"scopus_import":"1","month":"05","date_updated":"2026-10-02T11:19:46Z","oa":1,"publication_status":"published","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020"}],"ec_funded":1,"language":[{"iso":"eng"}],"quality_controlled":"1","department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"relation":"software","url":"https://github.com/IST-DASLab/gptq"}],"record":[{"relation":"dissertation_contains","id":"17485","status":"public"}]},"file":[{"file_size":437492,"date_created":"2024-08-05T07:52:44Z","file_name":"2023_ICLR_Frantar.pdf","file_id":"17385","date_updated":"2024-08-05T07:52:44Z","creator":"dernst","relation":"main_file","success":1,"checksum":"aacbf11dbd8b02a3e0bfd942a33e0593","content_type":"application/pdf","access_level":"open_access"}]},{"type":"conference","publication_identifier":{"eissn":["2640-3498"]},"title":"SparseGPT: Massive language models can be accurately pruned in one-shot","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2301.00774","open_access":"1"}],"publication":"Proceedings of the 40th International Conference on Machine Learning","oa_version":"Preprint","arxiv":1,"article_processing_charge":"No","status":"public","volume":202,"acknowledged_ssus":[{"_id":"ScienComp"}],"date_published":"2023-07-30T00:00:00Z","day":"30","_id":"14458","alternative_title":["PMLR"],"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.","page":"10323-10337","publisher":"ML Research Press","citation":{"mla":"Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot.” <i>Proceedings of the 40th International Conference on Machine Learning</i>, vol. 202, ML Research Press, 2023, pp. 10323–37.","ama":"Frantar E, Alistarh D-A. SparseGPT: Massive language models can be accurately pruned in one-shot. In: <i>Proceedings of the 40th International Conference on Machine Learning</i>. Vol 202. ML Research Press; 2023:10323-10337.","short":"E. Frantar, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, 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., &#38; Alistarh, D.-A. (2023). SparseGPT: Massive language models can be accurately pruned in one-shot. In <i>Proceedings of the 40th International Conference on Machine Learning</i> (Vol. 202, pp. 10323–10337). Honolulu, Hawaii, HI, United States: ML Research Press.","ieee":"E. Frantar and D.-A. Alistarh, “SparseGPT: Massive language models can be accurately pruned in one-shot,” in <i>Proceedings of the 40th International Conference on Machine Learning</i>, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10323–10337.","chicago":"Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot.” In <i>Proceedings of the 40th International Conference on Machine Learning</i>, 202:10323–37. ML Research Press, 2023."},"corr_author":"1","intvolume":"       202","publication_status":"published","oa":1,"date_updated":"2026-10-02T11:19:46Z","month":"07","scopus_import":"1","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"}],"author":[{"full_name":"Frantar, Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","last_name":"Frantar","first_name":"Elias"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"}],"external_id":{"arxiv":["2301.00774"]},"conference":{"start_date":"2023-07-23","end_date":"2023-07-29","name":"ICML: International Conference on Machine Learning","location":"Honolulu, Hawaii, HI, United States"},"date_created":"2023-10-29T23:01:16Z","year":"2023","related_material":{"record":[{"id":"17485","status":"public","relation":"dissertation_contains"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"}],"quality_controlled":"1","ec_funded":1,"language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}]},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.02390","open_access":"1"}],"title":"Quantized distributed training of large models with convergence guarantees","publication_identifier":{"eissn":["2640-3498"]},"type":"conference","publication":"Proceedings of the 40th International Conference on Machine Learning","article_processing_charge":"No","status":"public","oa_version":"Preprint","arxiv":1,"volume":202,"acknowledged_ssus":[{"_id":"ScienComp"}],"date_published":"2023-07-30T00:00:00Z","_id":"14461","day":"30","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).","alternative_title":["PMLR"],"page":"24020-24044","publisher":"ML Research Press","corr_author":"1","citation":{"mla":"Markov, Ilia, et al. “Quantized Distributed Training of Large Models with Convergence Guarantees.” <i>Proceedings of the 40th International Conference on Machine Learning</i>, vol. 202, ML Research Press, 2023, pp. 24020–44.","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.","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.","ama":"Markov I, Vladu A, Guo Q, Alistarh D-A. Quantized distributed training of large models with convergence guarantees. In: <i>Proceedings of the 40th International Conference on Machine Learning</i>. Vol 202. ML Research Press; 2023:24020-24044.","apa":"Markov, I., Vladu, A., Guo, Q., &#38; Alistarh, D.-A. (2023). Quantized distributed training of large models with convergence guarantees. In <i>Proceedings of the 40th International Conference on Machine Learning</i> (Vol. 202, pp. 24020–24044). Honolulu, Hawaii, HI, United States: ML Research Press.","ieee":"I. Markov, A. Vladu, Q. Guo, and D.-A. Alistarh, “Quantized distributed training of large models with convergence guarantees,” in <i>Proceedings of the 40th International Conference on Machine Learning</i>, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 24020–24044.","chicago":"Markov, Ilia, Adrian Vladu, Qi Guo, and Dan-Adrian Alistarh. “Quantized Distributed Training of Large Models with Convergence Guarantees.” In <i>Proceedings of the 40th International Conference on Machine Learning</i>, 202:24020–44. ML Research Press, 2023."},"publication_status":"published","intvolume":"       202","date_updated":"2026-10-02T11:20:05Z","oa":1,"abstract":[{"lang":"eng","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."}],"month":"07","scopus_import":"1","external_id":{"arxiv":["2302.02390"]},"author":[{"full_name":"Markov, Ilia","last_name":"Markov","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","first_name":"Ilia"},{"full_name":"Vladu, Adrian","first_name":"Adrian","last_name":"Vladu"},{"full_name":"Guo, Qi","last_name":"Guo","first_name":"Qi"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"year":"2023","date_created":"2023-10-29T23:01:17Z","conference":{"name":"ICML: International Conference on Machine Learning","location":"Honolulu, Hawaii, HI, United States","end_date":"2023-07-29","start_date":"2023-07-23"},"related_material":{"record":[{"relation":"dissertation_contains","id":"17490","status":"public"}]},"department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"ec_funded":1,"quality_controlled":"1","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"}]},{"publisher":"American Association for the Advancement of Science","corr_author":"1","citation":{"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.” <i>Science Advances</i>. American Association for the Advancement of Science, 2023. <a href=\"https://doi.org/10.1126/sciadv.add6495\">https://doi.org/10.1126/sciadv.add6495</a>.","ieee":"F. Fäßler <i>et al.</i>, “ArpC5 isoforms regulate Arp2/3 complex–dependent protrusion through differential Ena/VASP positioning,” <i>Science Advances</i>, vol. 9, no. 3. American Association for the Advancement of Science, 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. <i>Science Advances</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/sciadv.add6495\">https://doi.org/10.1126/sciadv.add6495</a>","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.","mla":"Fäßler, Florian, et al. “ArpC5 Isoforms Regulate Arp2/3 Complex–Dependent Protrusion through Differential Ena/VASP Positioning.” <i>Science Advances</i>, vol. 9, no. 3, add6495, American Association for the Advancement of Science, 2023, doi:<a href=\"https://doi.org/10.1126/sciadv.add6495\">10.1126/sciadv.add6495</a>.","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).","ama":"Fäßler F, Javoor M, Datler J, et al. ArpC5 isoforms regulate Arp2/3 complex–dependent protrusion through differential Ena/VASP positioning. <i>Science Advances</i>. 2023;9(3). doi:<a href=\"https://doi.org/10.1126/sciadv.add6495\">10.1126/sciadv.add6495</a>"},"isi":1,"title":"ArpC5 isoforms regulate Arp2/3 complex–dependent protrusion through differential Ena/VASP positioning","file_date_updated":"2023-01-23T07:45:54Z","publication_identifier":{"issn":["2375-2548"]},"article_number":"add6495","type":"journal_article","publication":"Science Advances","article_processing_charge":"No","issue":"3","status":"public","oa_version":"Published Version","ddc":["570"],"volume":9,"acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"EM-Fac"}],"keyword":["Multidisciplinary"],"date_published":"2023-01-20T00:00:00Z","_id":"12334","day":"20","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.","doi":"10.1126/sciadv.add6495","has_accepted_license":"1","file":[{"file_size":1756234,"date_created":"2023-01-23T07:45:54Z","file_name":"2023_ScienceAdvances_Faessler.pdf","file_id":"12335","relation":"main_file","date_updated":"2023-01-23T07:45:54Z","creator":"dernst","access_level":"open_access","success":1,"checksum":"ce81a6d0b84170e5e8c62f6acfa15d9e","content_type":"application/pdf"}],"license":"https://creativecommons.org/licenses/by/4.0/","pmid":1,"article_type":"original","related_material":{"record":[{"relation":"research_data","status":"public","id":"14562"},{"relation":"dissertation_contains","id":"22744","status":"public"},{"id":"18766","status":"public","relation":"dissertation_contains"}]},"department":[{"_id":"FlSc"},{"_id":"EM-Fac"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1126/sciadv.add6495","language":[{"iso":"eng"}],"quality_controlled":"1","project":[{"name":"Structure and isoform diversity of the Arp2/3 complex","grant_number":"P33367","_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A"}],"publication_status":"published","intvolume":"         9","tmp":{"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)","image":"/images/cc_by.png"},"oa":1,"date_updated":"2026-10-02T11:21:19Z","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.</jats:p>","lang":"eng"}],"scopus_import":"1","month":"01","external_id":{"pmid":["36662867"],"isi":["000964550100015"]},"author":[{"first_name":"Florian","orcid":"0000-0001-7149-769X","last_name":"Fäßler","id":"404F5528-F248-11E8-B48F-1D18A9856A87","full_name":"Fäßler, Florian"},{"full_name":"Javoor, Manjunath","last_name":"Javoor","id":"305ab18b-dc7d-11ea-9b2f-b58195228ea2","orcid":"0000-0003-2311-2112","first_name":"Manjunath"},{"full_name":"Datler, Julia","orcid":"0000-0002-3616-8580","last_name":"Datler","id":"3B12E2E6-F248-11E8-B48F-1D18A9856A87","first_name":"Julia"},{"first_name":"Hermann","last_name":"Döring","full_name":"Döring, Hermann"},{"last_name":"Hofer","id":"b9d234ba-9e33-11ed-95b6-cd561df280e6","first_name":"Florian","full_name":"Hofer, Florian"},{"orcid":"0000-0001-8370-6161","last_name":"Dimchev","id":"38C393BE-F248-11E8-B48F-1D18A9856A87","first_name":"Georgi A","full_name":"Dimchev, Georgi A"},{"full_name":"Hodirnau, Victor-Valentin","first_name":"Victor-Valentin","last_name":"Hodirnau","id":"3661B498-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3904-947X"},{"last_name":"Faix","first_name":"Jan","full_name":"Faix, Jan"},{"full_name":"Rottner, Klemens","last_name":"Rottner","first_name":"Klemens"},{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","orcid":"0000-0003-4790-8078","first_name":"Florian KM","full_name":"Schur, Florian KM"}],"year":"2023","date_created":"2023-01-23T07:26:42Z"},{"arxiv":1,"oa_version":"Preprint","status":"public","article_processing_charge":"No","oa":1,"date_updated":"2026-10-02T11:25:17Z","article_number":"2308.00516","type":"preprint","publication_status":"draft","title":"Contractive coupling rates and curvature lower bounds for Markov chains","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2308.00516","open_access":"1"}],"publication":"arXiv","day":"02","author":[{"full_name":"Pedrotti, Francesco","first_name":"Francesco","last_name":"Pedrotti","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c"}],"_id":"17351","external_id":{"arxiv":["2308.00516"]},"year":"2023","date_created":"2024-07-31T08:02:16Z","doi":"10.48550/arXiv.2308.00516","month":"08","abstract":[{"lang":"eng","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."}],"date_published":"2023-08-02T00:00:00Z","OA_place":"repository","related_material":{"record":[{"status":"public","id":"20040","relation":"later_version"},{"id":"17336","status":"public","relation":"dissertation_contains"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JaMa"}],"citation":{"ieee":"F. Pedrotti, “Contractive coupling rates and curvature lower bounds for Markov chains,” <i>arXiv</i>. .","apa":"Pedrotti, F. (n.d.). Contractive coupling rates and curvature lower bounds for Markov chains. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2308.00516\">https://doi.org/10.48550/arXiv.2308.00516</a>","chicago":"Pedrotti, Francesco. “Contractive Coupling Rates and Curvature Lower Bounds for Markov Chains.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2308.00516\">https://doi.org/10.48550/arXiv.2308.00516</a>.","ama":"Pedrotti F. Contractive coupling rates and curvature lower bounds for Markov chains. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2308.00516\">10.48550/arXiv.2308.00516</a>","short":"F. Pedrotti, ArXiv (n.d.).","mla":"Pedrotti, Francesco. “Contractive Coupling Rates and Curvature Lower Bounds for Markov Chains.” <i>ArXiv</i>, 2308.00516, doi:<a href=\"https://doi.org/10.48550/arXiv.2308.00516\">10.48550/arXiv.2308.00516</a>.","ista":"Pedrotti F. Contractive coupling rates and curvature lower bounds for Markov chains. arXiv, 2308.00516."},"corr_author":"1","fulldoi":"https://doi.org/10.48550/arXiv.2308.00516","language":[{"iso":"eng"}]},{"OA_place":"publisher","date_published":"2023-08-01T00:00:00Z","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"Bio"},{"_id":"PreCl"},{"_id":"E-Lib"},{"_id":"LifeSc"},{"_id":"M-Shop"}],"doi":"10.1038/s41592-023-01936-6","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.).","has_accepted_license":"1","_id":"13267","day":"01","publication":"Nature Methods","publication_identifier":{"eissn":["1548-7105"],"issn":["1548-7091"]},"isi":1,"file_date_updated":"2025-02-26T08:01:57Z","title":"Dense 4D nanoscale reconstruction of living brain tissue","type":"journal_article","volume":20,"status":"public","article_processing_charge":"Yes (in subscription journal)","oa_version":"Published Version","ddc":["570"],"corr_author":"1","citation":{"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.","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. <i>Nature Methods</i>. 2023;20:1256-1265. doi:<a href=\"https://doi.org/10.1038/s41592-023-01936-6\">10.1038/s41592-023-01936-6</a>","mla":"Velicky, Philipp, et al. “Dense 4D Nanoscale Reconstruction of Living Brain Tissue.” <i>Nature Methods</i>, vol. 20, Springer Nature, 2023, pp. 1256–65, doi:<a href=\"https://doi.org/10.1038/s41592-023-01936-6\">10.1038/s41592-023-01936-6</a>.","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. <i>Nature Methods</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41592-023-01936-6\">https://doi.org/10.1038/s41592-023-01936-6</a>","ieee":"P. Velicky <i>et al.</i>, “Dense 4D nanoscale reconstruction of living brain tissue,” <i>Nature Methods</i>, vol. 20. Springer Nature, pp. 1256–1265, 2023.","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.” <i>Nature Methods</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s41592-023-01936-6\">https://doi.org/10.1038/s41592-023-01936-6</a>."},"publisher":"Springer Nature","page":"1256-1265","abstract":[{"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.","lang":"eng"}],"month":"08","scopus_import":"1","date_created":"2023-07-23T22:01:13Z","year":"2023","external_id":{"isi":["001025621500001"],"pmid":["37429995"]},"author":[{"full_name":"Velicky, Philipp","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","last_name":"Velicky","orcid":"0000-0002-2340-7431","first_name":"Philipp"},{"last_name":"Miguel Villalba","id":"3FB91342-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5665-0430","first_name":"Eder","full_name":"Miguel Villalba, Eder"},{"first_name":"Julia M","orcid":"0000-0003-3862-1235","id":"443DB6DE-F248-11E8-B48F-1D18A9856A87","last_name":"Michalska","full_name":"Michalska, Julia M"},{"full_name":"Lyudchik, Julia","first_name":"Julia","last_name":"Lyudchik","id":"46E28B80-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wei, Donglai","first_name":"Donglai","last_name":"Wei"},{"first_name":"Zudi","last_name":"Lin","full_name":"Lin, Zudi"},{"full_name":"Watson, Jake","id":"63836096-4690-11EA-BD4E-32803DDC885E","last_name":"Watson","orcid":"0000-0002-8698-3823","first_name":"Jake"},{"full_name":"Troidl, Jakob","first_name":"Jakob","last_name":"Troidl"},{"last_name":"Beyer","first_name":"Johanna","full_name":"Beyer, Johanna"},{"full_name":"Ben Simon, Yoav","first_name":"Yoav","last_name":"Ben Simon","id":"43DF3136-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sommer","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1216-9105","first_name":"Christoph M","full_name":"Sommer, Christoph M"},{"orcid":"0000-0003-0201-2315","last_name":"Jahr","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87","first_name":"Wiebke","full_name":"Jahr, Wiebke"},{"last_name":"Cenameri","id":"9ac8f577-2357-11eb-997a-e566c5550886","first_name":"Alban","full_name":"Cenameri, Alban"},{"full_name":"Broichhagen, Johannes","last_name":"Broichhagen","first_name":"Johannes"},{"full_name":"Grant, Seth G.N.","last_name":"Grant","first_name":"Seth G.N."},{"last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","first_name":"Peter M","full_name":"Jonas, Peter M"},{"full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","orcid":"0000-0002-7673-7178","first_name":"Gaia"},{"first_name":"Hanspeter","last_name":"Pfister","full_name":"Pfister, Hanspeter"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"},{"id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","last_name":"Danzl","orcid":"0000-0001-8559-3973","first_name":"Johann G","full_name":"Danzl, Johann G"}],"publication_status":"published","intvolume":"        20","oa":1,"date_updated":"2026-10-02T11:27:12Z","OA_type":"hybrid","tmp":{"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)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"ec_funded":1,"quality_controlled":"1","fulldoi":"https://doi.org/10.1038/s41592-023-01936-6","project":[{"name":"Optical control of synaptic function via adhesion molecules","grant_number":"I03600","call_identifier":"FWF","_id":"265CB4D0-B435-11E9-9278-68D0E5697425"},{"_id":"2548AE96-B435-11E9-9278-68D0E5697425","grant_number":"W1232","name":"Molecular Drug Targets","call_identifier":"FWF"},{"name":"Synaptic communication in neuronal microcircuits","grant_number":"Z00312","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425"},{"name":"High content imaging to decode human immune cell interactions in health and allergic disease","grant_number":"LS18-022","_id":"23889792-32DE-11EA-91FC-C7463DDC885E"},{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"},{"_id":"25444568-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715508","name":"Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo and in vitro Models"},{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","grant_number":"692692"},{"_id":"fc2be41b-9c52-11eb-aca3-faa90aa144e9","grant_number":"101026635","name":"Synaptic computations of the hippocampal CA3 circuitry","call_identifier":"H2020"},{"_id":"2668BFA0-B435-11E9-9278-68D0E5697425","grant_number":"LT00057","name":"High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration"}],"pmid":1,"file":[{"file_name":"2023_NatureMethods_Velicky.pdf","file_id":"19088","file_size":14103039,"date_created":"2025-02-26T08:01:57Z","success":1,"content_type":"application/pdf","checksum":"a68e845780a82ea36d0d4d3212a87c10","access_level":"open_access","date_updated":"2025-02-26T08:01:57Z","creator":"dernst","relation":"main_file"}],"department":[{"_id":"PeJo"},{"_id":"GaNo"},{"_id":"BeBi"},{"_id":"JoDa"},{"_id":"Bio"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","related_material":{"record":[{"relation":"research_data","status":"public","id":"12817"},{"relation":"shorter_version","status":"public","id":"14770"},{"status":"public","id":"11943","relation":"earlier_version"},{"status":"public","id":"18674","relation":"dissertation_contains"}],"link":[{"url":"https://github.com/danzllab/LIONESS","relation":"software"}]}},{"external_id":{"pmid":["37407570"],"isi":["001024729900009"]},"author":[{"first_name":"Farid","last_name":"Hassani","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6937-5773","full_name":"Hassani, Farid"},{"full_name":"Peruzzo, Matilda","first_name":"Matilda","orcid":"0000-0002-3415-4628","last_name":"Peruzzo","id":"3F920B30-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Lucky","id":"84b9700b-15b2-11ec-abd3-831089e67615","last_name":"Kapoor","orcid":"0000-0001-8319-2148","full_name":"Kapoor, Lucky"},{"full_name":"Trioni, Andrea","first_name":"Andrea","last_name":"Trioni","id":"42F71B44-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zemlicka, Martin","orcid":"0009-0005-0878-3032","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","last_name":"Zemlicka","first_name":"Martin"},{"full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink","orcid":"0000-0001-8112-028X","first_name":"Johannes M"}],"date_created":"2023-07-16T22:01:08Z","year":"2023","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"}],"month":"07","scopus_import":"1","tmp":{"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)","image":"/images/cc_by.png"},"date_updated":"2026-10-02T11:28:16Z","oa":1,"publication_status":"published","intvolume":"        14","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"}],"fulldoi":"https://doi.org/10.1038/s41467-023-39656-2","language":[{"iso":"eng"}],"quality_controlled":"1","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"17133"}]},"article_type":"original","department":[{"_id":"JoFi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2023-07-18T08:43:07Z","file_size":2899592,"file_id":"13248","file_name":"2023_NatureComm_Hassani.pdf","creator":"dernst","date_updated":"2023-07-18T08:43:07Z","relation":"main_file","content_type":"application/pdf","checksum":"a85773b5fe23516f60f7d5d31b55c200","success":1,"access_level":"open_access"}],"pmid":1,"_id":"13227","day":"05","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.","doi":"10.1038/s41467-023-39656-2","has_accepted_license":"1","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"date_published":"2023-07-05T00:00:00Z","article_processing_charge":"No","status":"public","oa_version":"Published Version","ddc":["530"],"volume":14,"title":"Inductively shunted transmons exhibit noise insensitive plasmon states and a fluxon decay exceeding 3 hours","publication_identifier":{"eissn":["2041-1723"]},"file_date_updated":"2023-07-18T08:43:07Z","isi":1,"type":"journal_article","article_number":"3968","publication":"Nature Communications","corr_author":"1","citation":{"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. <i>Nature Communications</i>. 2023;14. doi:<a href=\"https://doi.org/10.1038/s41467-023-39656-2\">10.1038/s41467-023-39656-2</a>","short":"F. Hassani, M. Peruzzo, L. Kapoor, A. Trioni, M. Zemlicka, J.M. Fink, Nature Communications 14 (2023).","mla":"Hassani, Farid, et al. “Inductively Shunted Transmons Exhibit Noise Insensitive Plasmon States and a Fluxon Decay Exceeding 3 Hours.” <i>Nature Communications</i>, vol. 14, 3968, Springer Nature, 2023, doi:<a href=\"https://doi.org/10.1038/s41467-023-39656-2\">10.1038/s41467-023-39656-2</a>.","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.","apa":"Hassani, F., Peruzzo, M., Kapoor, L., Trioni, A., Zemlicka, M., &#38; Fink, J. M. (2023). Inductively shunted transmons exhibit noise insensitive plasmon states and a fluxon decay exceeding 3 hours. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-023-39656-2\">https://doi.org/10.1038/s41467-023-39656-2</a>","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,” <i>Nature Communications</i>, vol. 14. Springer Nature, 2023.","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.” <i>Nature Communications</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s41467-023-39656-2\">https://doi.org/10.1038/s41467-023-39656-2</a>."},"publisher":"Springer Nature"},{"corr_author":"1","researchdata_availability":"no","citation":{"chicago":"Glas, Jakob. “Complete Intersections of Cubic and Quadric Hypersurfaces over Fq(T).” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2306.02718\">https://doi.org/10.48550/arXiv.2306.02718</a>.","apa":"Glas, J. (n.d.). Complete intersections of cubic and quadric hypersurfaces over Fq(t). <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2306.02718\">https://doi.org/10.48550/arXiv.2306.02718</a>","ieee":"J. Glas, “Complete intersections of cubic and quadric hypersurfaces over Fq(t),” <i>arXiv</i>. .","ama":"Glas J. Complete intersections of cubic and quadric hypersurfaces over Fq(t). <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2306.02718\">10.48550/arXiv.2306.02718</a>","short":"J. Glas, ArXiv (n.d.).","ista":"Glas J. Complete intersections of cubic and quadric hypersurfaces over Fq(t). arXiv, 2306.02718.","mla":"Glas, Jakob. “Complete Intersections of Cubic and Quadric Hypersurfaces over Fq(T).” <i>ArXiv</i>, 2306.02718, doi:<a href=\"https://doi.org/10.48550/arXiv.2306.02718\">10.48550/arXiv.2306.02718</a>."},"das_tickbox":"0","doi":"10.48550/arXiv.2306.02718","_id":"18294","day":"05","OA_place":"repository","date_published":"2023-06-05T00:00:00Z","status":"public","article_processing_charge":"No","oa_version":"Preprint","arxiv":1,"publication":"arXiv","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2306.02718"}],"title":"Complete intersections of cubic and quadric hypersurfaces over Fq(t)","article_number":"2306.02718","type":"preprint","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.48550/arXiv.2306.02718","department":[{"_id":"TiBr"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"status":"public","id":"18132","relation":"dissertation_contains"}]},"year":"2023","date_created":"2024-10-10T13:08:05Z","external_id":{"arxiv":["2306.02718"]},"supplementarymaterial":"no","author":[{"full_name":"Glas, Jakob","first_name":"Jakob","last_name":"Glas","id":"d6423cba-dc74-11ea-a0a7-ee61689ff5fb"}],"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."}],"month":"06","date_updated":"2026-10-02T11:44:29Z","oa":1,"tmp":{"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)","image":"/images/cc_by.png"},"publication_status":"draft"},{"publisher":"Zenodo","related_material":{"record":[{"id":"18600","status":"public","relation":"used_in_publication"}]},"department":[{"_id":"KrCh"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.5281/zenodo.8219190","citation":{"ieee":"K. Grover, M. Weiniger, and J. Kretinsky, “QComp LRA results.” Zenodo, 2023.","apa":"Grover, K., Weiniger, M., &#38; Kretinsky, J. (2023). QComp LRA results. Zenodo. <a href=\"https://doi.org/10.5281/zenodo.8219190\">https://doi.org/10.5281/zenodo.8219190</a>","chicago":"Grover, Kush, Maximilian Weiniger, and Jan Kretinsky. “QComp LRA Results.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/zenodo.8219190\">https://doi.org/10.5281/zenodo.8219190</a>.","short":"K. Grover, M. Weiniger, J. Kretinsky, (2023).","ama":"Grover K, Weiniger M, Kretinsky J. QComp LRA results. 2023. doi:<a href=\"https://doi.org/10.5281/zenodo.8219190\">10.5281/zenodo.8219190</a>","ista":"Grover K, Weiniger M, Kretinsky J. 2023. QComp LRA results, Zenodo, <a href=\"https://doi.org/10.5281/zenodo.8219190\">10.5281/zenodo.8219190</a>.","mla":"Grover, Kush, et al. <i>QComp LRA Results</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/zenodo.8219190\">10.5281/zenodo.8219190</a>."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.8219190"}],"title":"QComp LRA results","type":"research_data_reference","status":"public","article_processing_charge":"No","oa_version":"None","OA_type":"green","oa":1,"date_updated":"2026-10-16T07:53:26Z","abstract":[{"text":"It contains the benchmarks and the results of comparison between STORM, PET and MultiGain for the QComp category of Long-Run Average rewards.","lang":"eng"}],"month":"08","date_published":"2023-08-06T00:00:00Z","OA_place":"repository","_id":"23142","author":[{"first_name":"Kush","last_name":"Grover","full_name":"Grover, Kush"},{"first_name":"Maximilian","last_name":"Weiniger","full_name":"Weiniger, Maximilian"},{"full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan"}],"day":"06","year":"2023","doi":"10.5281/zenodo.8219190","date_created":"2026-10-16T07:53:22Z"},{"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"fulldoi":"https://doi.org/10.4230/LIPIcs.MFCS.2023.15","quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"related_material":{"record":[{"status":"public","id":"17474","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"file":[{"creator":"dernst","date_updated":"2023-10-09T09:19:11Z","relation":"main_file","content_type":"application/pdf","checksum":"402281b17ed669bbf149d0fdf68ac201","success":1,"access_level":"open_access","date_created":"2023-10-09T09:19:11Z","file_size":826843,"file_id":"14418","file_name":"2023_LIPIcsMFCS_Baier.pdf"}],"author":[{"full_name":"Baier, Christel","first_name":"Christel","last_name":"Baier"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias"},{"last_name":"Piribauer","first_name":"Jakob","full_name":"Piribauer, Jakob"}],"external_id":{"arxiv":["2307.06611"]},"conference":{"location":"Bordeaux, France","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2023-08-28","end_date":"2023-09-01"},"year":"2023","date_created":"2023-10-09T09:21:05Z","scopus_import":"1","month":"08","abstract":[{"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.","lang":"eng"}],"tmp":{"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)","image":"/images/cc_by.png"},"oa":1,"date_updated":"2026-10-16T08:04:31Z","intvolume":"       272","publication_status":"published","citation":{"chicago":"Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” In <i>48th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">https://doi.org/10.4230/LIPIcs.MFCS.2023.15</a>.","apa":"Baier, C., Chatterjee, K., Meggendorfer, T., &#38; Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In <i>48th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">https://doi.org/10.4230/LIPIcs.MFCS.2023.15</a>","ieee":"C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in <i>48th International Symposium on Mathematical Foundations of Computer Science</i>, Bordeaux, France, 2023, vol. 272.","mla":"Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.” <i>48th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 272, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">10.4230/LIPIcs.MFCS.2023.15</a>.","ama":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Entropic risk for turn-based stochastic games. In: <i>48th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">10.4230/LIPIcs.MFCS.2023.15</a>","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.","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."},"corr_author":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"21","_id":"14417","has_accepted_license":"1","alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.MFCS.2023.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.","date_published":"2023-08-21T00:00:00Z","oa_version":"Published Version","ddc":["000"],"arxiv":1,"status":"public","article_processing_charge":"Yes","volume":272,"type":"conference","article_number":"15","publication_identifier":{"isbn":["9783959772921"],"eissn":["1868-8969"]},"file_date_updated":"2023-10-09T09:19:11Z","title":"Entropic risk for turn-based stochastic games","publication":"48th International Symposium on Mathematical Foundations of Computer Science"},{"related_material":{"record":[{"id":"14820","status":"public","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"fulldoi":"https://doi.org/10.1007/978-3-031-32733-9_26","quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"intvolume":"     13892","publication_status":"published","OA_type":"closed access","date_updated":"2026-10-16T08:09:27Z","scopus_import":"1","month":"05","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."}],"author":[{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"full_name":"Svoboda, Jakub","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","last_name":"Svoboda","first_name":"Jakub"},{"full_name":"Yeo, Michelle X","orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","first_name":"Michelle X"}],"external_id":{"isi":["001292782600026"]},"conference":{"location":"Alcalá de Henares, Spain","name":"SIROCCO: International Colloquium on Structural Information and Communication Complexity","start_date":"2023-06-06","end_date":"2023-06-09"},"date_created":"2025-07-10T13:15:43Z","year":"2023","page":"576-594","publisher":"Springer Nature","citation":{"mla":"Schmid, Stefan, et al. “Weighted Acket Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” <i>30th International Colloquium on Structural Information and Communication Complexity</i>, vol. 13892, Springer Nature, 2023, pp. 576–94, doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">10.1007/978-3-031-32733-9_26</a>.","ama":"Schmid S, Svoboda J, Yeo MX. Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In: <i>30th International Colloquium on Structural Information and Communication Complexity</i>. Vol 13892. Springer Nature; 2023:576-594. doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">10.1007/978-3-031-32733-9_26</a>","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.","short":"S. Schmid, J. Svoboda, M.X. Yeo, in:, 30th International Colloquium on Structural Information and Communication Complexity, Springer Nature, 2023, pp. 576–594.","chicago":"Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Acket Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” In <i>30th International Colloquium on Structural Information and Communication Complexity</i>, 13892:576–94. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">https://doi.org/10.1007/978-3-031-32733-9_26</a>.","apa":"Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2023). Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In <i>30th International Colloquium on Structural Information and Communication Complexity</i> (Vol. 13892, pp. 576–594). Alcalá de Henares, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">https://doi.org/10.1007/978-3-031-32733-9_26</a>","ieee":"S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” in <i>30th International Colloquium on Structural Information and Communication Complexity</i>, Alcalá de Henares, Spain, 2023, vol. 13892, pp. 576–594."},"corr_author":"1","type":"conference","publication_identifier":{"isbn":["9783031327322"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783031327339"]},"isi":1,"title":"Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation","publication":"30th International Colloquium on Structural Information and Communication Complexity","oa_version":"None","status":"public","article_processing_charge":"No","volume":13892,"date_published":"2023-05-25T00:00:00Z","day":"25","_id":"19985","alternative_title":["LNCS"],"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.","doi":"10.1007/978-3-031-32733-9_26"},{"publication":"arXiv","publication_status":"draft","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2307.11028"}],"title":"Multi-point functional central limit theorem for Wigner Matrices","type":"preprint","article_number":"2307.11028","oa":1,"date_updated":"2026-10-16T08:38:42Z","status":"public","article_processing_charge":"No","oa_version":"Preprint","arxiv":1,"OA_place":"repository","date_published":"2023-07-21T00:00:00Z","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."}],"month":"07","doi":"10.48550/arXiv.2307.11028","year":"2023","date_created":"2024-06-26T08:54:56Z","_id":"17173","external_id":{"arxiv":["2307.11028"]},"author":[{"full_name":"Reker, Jana","first_name":"Jana","last_name":"Reker","id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9"}],"day":"21","department":[{"_id":"LaEr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"17164","relation":"dissertation_contains"},{"relation":"later_version","id":"18762","status":"public"}]},"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.48550/arXiv.2307.11028","citation":{"mla":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” <i>ArXiv</i>, 2307.11028, doi:<a href=\"https://doi.org/10.48550/arXiv.2307.11028\">10.48550/arXiv.2307.11028</a>.","short":"J. Reker, ArXiv (n.d.).","ama":"Reker J. Multi-point functional central limit theorem for Wigner Matrices. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2307.11028\">10.48550/arXiv.2307.11028</a>","ista":"Reker J. Multi-point functional central limit theorem for Wigner Matrices. arXiv, 2307.11028.","ieee":"J. Reker, “Multi-point functional central limit theorem for Wigner Matrices,” <i>arXiv</i>. .","apa":"Reker, J. (n.d.). Multi-point functional central limit theorem for Wigner Matrices. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2307.11028\">https://doi.org/10.48550/arXiv.2307.11028</a>","chicago":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2307.11028\">https://doi.org/10.48550/arXiv.2307.11028</a>."}},{"department":[{"_id":"LaEr"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20575"},{"relation":"dissertation_contains","id":"17164","status":"public"},{"relation":"later_version","status":"public","id":"18764"}]},"ec_funded":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.48550/arXiv.2310.06677","project":[{"grant_number":"101020331","name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"publication_status":"draft","date_updated":"2026-10-16T08:41:47Z","oa":1,"abstract":[{"lang":"eng","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_λ$."}],"month":"12","date_created":"2024-06-26T08:56:52Z","year":"2023","external_id":{"arxiv":["2310.06677"]},"author":[{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"first_name":"Sven Joscha","orcid":"0000-0003-1106-327X","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","last_name":"Henheik","full_name":"Henheik, Sven Joscha"},{"full_name":"Reker, Jana","last_name":"Reker","id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9","first_name":"Jana"},{"full_name":"Riabov, Volodymyr","first_name":"Volodymyr","id":"1949f904-edfb-11eb-afb5-e2dfddabb93b","last_name":"Riabov"}],"corr_author":"1","citation":{"mla":"Erdös, László, et al. “Prethermalization for Deformed Wigner Matrices.” <i>ArXiv</i>, 2310.06677, doi:<a href=\"https://doi.org/10.48550/arXiv.2310.06677\">10.48550/arXiv.2310.06677</a>.","ama":"Erdös L, Henheik SJ, Reker J, Riabov V. Prethermalization for deformed Wigner Matrices. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2310.06677\">10.48550/arXiv.2310.06677</a>","ista":"Erdös L, Henheik SJ, Reker J, Riabov V. Prethermalization for deformed Wigner Matrices. arXiv, 2310.06677.","short":"L. Erdös, S.J. Henheik, J. Reker, V. Riabov, ArXiv (n.d.).","chicago":"Erdös, László, Sven Joscha Henheik, Jana Reker, and Volodymyr Riabov. “Prethermalization for Deformed Wigner Matrices.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2310.06677\">https://doi.org/10.48550/arXiv.2310.06677</a>.","apa":"Erdös, L., Henheik, S. J., Reker, J., &#38; Riabov, V. (n.d.). Prethermalization for deformed Wigner Matrices. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2310.06677\">https://doi.org/10.48550/arXiv.2310.06677</a>","ieee":"L. Erdös, S. J. Henheik, J. Reker, and V. Riabov, “Prethermalization for deformed Wigner Matrices,” <i>arXiv</i>. ."},"publication":"arXiv","title":"Prethermalization for deformed Wigner Matrices","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.06677"}],"article_number":"2310.06677","type":"preprint","status":"public","article_processing_charge":"No","oa_version":"Preprint","arxiv":1,"date_published":"2023-12-23T00:00:00Z","OA_place":"repository","doi":"10.48550/arXiv.2310.06677","_id":"17174","day":"23"},{"related_material":{"record":[{"id":"15172","status":"public","relation":"later_version"}]},"department":[{"_id":"MaMo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"fulldoi":"https://doi.org/10.1109/isit54713.2023.10206899","language":[{"iso":"eng"}],"quality_controlled":"1","date_updated":"2026-10-16T10:39:43Z","oa":1,"publication_status":"published","external_id":{"arxiv":["2303.07245"]},"author":[{"first_name":"Amedeo Roberto","last_name":"Esposito","id":"9583e921-e1ad-11ec-9862-cef099626dc9","full_name":"Esposito, Amedeo Roberto"},{"first_name":"Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco"}],"date_created":"2024-02-02T11:18:40Z","year":"2023","conference":{"start_date":"2023-06-25","end_date":"2023-06-30","location":"Taipei, Taiwan","name":"ISIT: International Symposium on Information Theory"},"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."}],"month":"06","scopus_import":"1","page":"400-405","publisher":"IEEE","corr_author":"1","citation":{"ieee":"A. R. Esposito and M. Mondelli, “Concentration without independence via information measures,” in <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>, Taipei, Taiwan, 2023, pp. 400–405.","apa":"Esposito, A. R., &#38; Mondelli, M. (2023). Concentration without independence via information measures. In <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i> (pp. 400–405). Taipei, Taiwan: IEEE. <a href=\"https://doi.org/10.1109/isit54713.2023.10206899\">https://doi.org/10.1109/isit54713.2023.10206899</a>","chicago":"Esposito, Amedeo Roberto, and Marco Mondelli. “Concentration without Independence via Information Measures.” In <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>, 400–405. IEEE, 2023. <a href=\"https://doi.org/10.1109/isit54713.2023.10206899\">https://doi.org/10.1109/isit54713.2023.10206899</a>.","mla":"Esposito, Amedeo Roberto, and Marco Mondelli. “Concentration without Independence via Information Measures.” <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>, IEEE, 2023, pp. 400–05, doi:<a href=\"https://doi.org/10.1109/isit54713.2023.10206899\">10.1109/isit54713.2023.10206899</a>.","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.","short":"A.R. Esposito, M. Mondelli, in:, Proceedings of 2023 IEEE International Symposium on Information Theory, IEEE, 2023, pp. 400–405.","ama":"Esposito AR, Mondelli M. Concentration without independence via information measures. In: <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>. IEEE; 2023:400-405. doi:<a href=\"https://doi.org/10.1109/isit54713.2023.10206899\">10.1109/isit54713.2023.10206899</a>"},"article_processing_charge":"No","status":"public","oa_version":"Preprint","arxiv":1,"publication_identifier":{"eisbn":["9781665475549"],"eissn":["2157-8117"]},"title":"Concentration without independence via information measures","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2303.07245"}],"type":"conference","publication":"Proceedings of 2023 IEEE International Symposium on Information Theory","_id":"14922","day":"30","doi":"10.1109/isit54713.2023.10206899","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_published":"2023-06-30T00:00:00Z"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","corr_author":"1","citation":{"ama":"Resch N, Yuan C, Zhang Y. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. In: <i>50th International Colloquium on Automata, Languages, and Programming</i>. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.99\">10.4230/LIPIcs.ICALP.2023.99</a>","mla":"Resch, Nicolas, et al. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” <i>50th International Colloquium on Automata, Languages, and Programming</i>, vol. 261, 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.99\">10.4230/LIPIcs.ICALP.2023.99</a>.","short":"N. Resch, C. Yuan, Y. Zhang, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","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.","chicago":"Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” In <i>50th International Colloquium on Automata, Languages, and Programming</i>, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.99\">https://doi.org/10.4230/LIPIcs.ICALP.2023.99</a>.","ieee":"N. Resch, C. Yuan, and Y. Zhang, “Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery,” in <i>50th International Colloquium on Automata, Languages, and Programming</i>, Paderborn, Germany, 2023, vol. 261.","apa":"Resch, N., Yuan, C., &#38; Zhang, Y. (2023). Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. In <i>50th International Colloquium on Automata, Languages, and Programming</i> (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.99\">https://doi.org/10.4230/LIPIcs.ICALP.2023.99</a>"},"publication":"50th International Colloquium on Automata, Languages, and Programming","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772785"]},"file_date_updated":"2023-08-21T07:23:18Z","title":"Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery","article_number":"99","type":"conference","volume":261,"status":"public","article_processing_charge":"Yes","ddc":["000"],"oa_version":"Published Version","arxiv":1,"date_published":"2023-07-01T00:00:00Z","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.","doi":"10.4230/LIPIcs.ICALP.2023.99","alternative_title":["LIPIcs"],"has_accepted_license":"1","_id":"14083","day":"01","file":[{"file_name":"2023_LIPIcsICALP_Resch.pdf","file_id":"14091","file_size":1141497,"date_created":"2023-08-21T07:23:18Z","access_level":"open_access","success":1,"content_type":"application/pdf","checksum":"a449143fec3fbebb092cb8ef3b53c226","relation":"main_file","date_updated":"2023-08-21T07:23:18Z","creator":"dernst"}],"department":[{"_id":"MaMo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"later_version","status":"public","id":"17330"}]},"language":[{"iso":"eng"}],"quality_controlled":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.ICALP.2023.99","publication_status":"published","intvolume":"       261","oa":1,"date_updated":"2026-10-16T10:41:58Z","tmp":{"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)","image":"/images/cc_by.png"},"abstract":[{"lang":"eng","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."}],"month":"07","scopus_import":"1","date_created":"2023-08-20T22:01:13Z","year":"2023","conference":{"location":"Paderborn, Germany","name":"ICALP: Automata, Languages and Programming","start_date":"2023-07-10","end_date":"2023-07-14"},"external_id":{"arxiv":["2210.07754"]},"author":[{"full_name":"Resch, Nicolas","last_name":"Resch","first_name":"Nicolas"},{"last_name":"Yuan","first_name":"Chen","full_name":"Yuan, Chen"},{"last_name":"Zhang","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","orcid":"0000-0002-6465-6258","first_name":"Yihan","full_name":"Zhang, Yihan"}]},{"publication_status":"published","tmp":{"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)","image":"/images/cc_by.png"},"oa":1,"date_updated":"2026-10-20T09:16:36Z","month":"04","abstract":[{"text":"We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost.","lang":"eng"}],"author":[{"full_name":"Rammelmüller, Lukas","last_name":"Rammelmüller","first_name":"Lukas"},{"last_name":"Huber","first_name":"David","full_name":"Huber, David"},{"first_name":"Artem","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem"}],"external_id":{"arxiv":["2202.04603"]},"date_created":"2023-07-24T10:47:15Z","year":"2023","file":[{"success":1,"checksum":"f583a70fe915d2208c803f5afb426daa","content_type":"application/pdf","access_level":"open_access","date_updated":"2023-07-31T09:09:23Z","creator":"dernst","relation":"main_file","file_name":"2023_SciPostPhysCodebase_Rammelmueller.pdf","file_id":"13330","file_size":551418,"date_created":"2023-07-31T09:09:23Z"}],"related_material":{"record":[{"id":"13275","status":"public","relation":"research_data"}]},"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiLe"}],"fulldoi":"https://doi.org/10.21468/scipostphyscodeb.12","quality_controlled":"1","ec_funded":1,"language":[{"iso":"eng"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"article_number":"12","type":"journal_article","publication_identifier":{"issn":["2949-804X"]},"file_date_updated":"2023-07-31T09:09:23Z","title":"A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D","publication":"SciPost Physics Codebases","oa_version":"Published Version","arxiv":1,"ddc":["530"],"article_processing_charge":"No","status":"public","date_published":"2023-04-19T00:00:00Z","day":"19","_id":"13276","has_accepted_license":"1","doi":"10.21468/scipostphyscodeb.12","acknowledgement":"We acknowledge fruitful discussions with Hans-Werner Hammer and thank Gerhard Zürn and\r\nPietro Massignan for sending us their data. We thank Fabian Brauneis for beta-testing the\r\nprovided code-package, and comments on the manuscript.\r\nL.R. is supported by FP7/ERC Consolidator Grant QSIMCORR, No.\r\n771891, and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under\r\nGermany’s Excellence Strategy –EXC–2111–390814868. A.G.V. acknowledges support\r\nby European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 754411.","publisher":"SciPost Foundation","citation":{"ieee":"L. Rammelmüller, D. Huber, and A. Volosniev, “A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D,” <i>SciPost Physics Codebases</i>. SciPost Foundation, 2023.","apa":"Rammelmüller, L., Huber, D., &#38; Volosniev, A. (2023). A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. <i>SciPost Physics Codebases</i>. SciPost Foundation. <a href=\"https://doi.org/10.21468/scipostphyscodeb.12\">https://doi.org/10.21468/scipostphyscodeb.12</a>","chicago":"Rammelmüller, Lukas, David Huber, and Artem Volosniev. “A Modular Implementation of an Effective Interaction Approach for Harmonically Trapped Fermions in 1D.” <i>SciPost Physics Codebases</i>. SciPost Foundation, 2023. <a href=\"https://doi.org/10.21468/scipostphyscodeb.12\">https://doi.org/10.21468/scipostphyscodeb.12</a>.","ista":"Rammelmüller L, Huber D, Volosniev A. 2023. A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases., 12.","mla":"Rammelmüller, Lukas, et al. “A Modular Implementation of an Effective Interaction Approach for Harmonically Trapped Fermions in 1D.” <i>SciPost Physics Codebases</i>, 12, SciPost Foundation, 2023, doi:<a href=\"https://doi.org/10.21468/scipostphyscodeb.12\">10.21468/scipostphyscodeb.12</a>.","short":"L. Rammelmüller, D. Huber, A. Volosniev, SciPost Physics Codebases (2023).","ama":"Rammelmüller L, Huber D, Volosniev A. A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. <i>SciPost Physics Codebases</i>. 2023. doi:<a href=\"https://doi.org/10.21468/scipostphyscodeb.12\">10.21468/scipostphyscodeb.12</a>"},"corr_author":"1"},{"oa":1,"date_updated":"2026-10-20T09:16:35Z","ddc":["530"],"oa_version":"Published Version","article_processing_charge":"No","status":"public","type":"research_data_reference","title":"Codebase release 1.0 for FermiFCI","main_file_link":[{"open_access":"1","url":"https://doi.org/10.21468/SciPostPhysCodeb.12-r1.0"}],"date_created":"2023-07-24T10:46:23Z","doi":"10.21468/scipostphyscodeb.12-r1.0","year":"2023","author":[{"full_name":"Rammelmüller, Lukas","first_name":"Lukas","last_name":"Rammelmüller"},{"first_name":"David","last_name":"Huber","full_name":"Huber, David"},{"full_name":"Volosniev, Artem","orcid":"0000-0003-0393-5525","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem"}],"day":"19","_id":"13275","date_published":"2023-04-19T00:00:00Z","month":"04","abstract":[{"text":"We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MiLe"}],"related_material":{"record":[{"status":"public","id":"13276","relation":"used_in_publication"}]},"publisher":"SciPost Foundation","citation":{"short":"L. Rammelmüller, D. Huber, A. Volosniev, (2023).","ista":"Rammelmüller L, Huber D, Volosniev A. 2023. Codebase release 1.0 for FermiFCI, SciPost Foundation, <a href=\"https://doi.org/10.21468/scipostphyscodeb.12-r1.0\">10.21468/scipostphyscodeb.12-r1.0</a>.","ama":"Rammelmüller L, Huber D, Volosniev A. Codebase release 1.0 for FermiFCI. 2023. doi:<a href=\"https://doi.org/10.21468/scipostphyscodeb.12-r1.0\">10.21468/scipostphyscodeb.12-r1.0</a>","mla":"Rammelmüller, Lukas, et al. <i>Codebase Release 1.0 for FermiFCI</i>. SciPost Foundation, 2023, doi:<a href=\"https://doi.org/10.21468/scipostphyscodeb.12-r1.0\">10.21468/scipostphyscodeb.12-r1.0</a>.","apa":"Rammelmüller, L., Huber, D., &#38; Volosniev, A. (2023). Codebase release 1.0 for FermiFCI. SciPost Foundation. <a href=\"https://doi.org/10.21468/scipostphyscodeb.12-r1.0\">https://doi.org/10.21468/scipostphyscodeb.12-r1.0</a>","ieee":"L. Rammelmüller, D. Huber, and A. Volosniev, “Codebase release 1.0 for FermiFCI.” SciPost Foundation, 2023.","chicago":"Rammelmüller, Lukas, David Huber, and Artem Volosniev. “Codebase Release 1.0 for FermiFCI.” SciPost Foundation, 2023. <a href=\"https://doi.org/10.21468/scipostphyscodeb.12-r1.0\">https://doi.org/10.21468/scipostphyscodeb.12-r1.0</a>."},"corr_author":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"fulldoi":"https://doi.org/10.21468/scipostphyscodeb.12-r1.0"},{"related_material":{"record":[{"relation":"later_version","id":"15121","status":"public"}]},"department":[{"_id":"MoHe"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"fulldoi":"https://doi.org/10.1007/978-3-031-32726-1_32","ec_funded":1,"language":[{"iso":"eng"}],"quality_controlled":"1","date_updated":"2026-10-21T08:03:01Z","oa":1,"publication_status":"published","intvolume":"     13904","external_id":{"isi":["001281059600032"],"arxiv":["2301.09217"]},"author":[{"first_name":"Da Wei","last_name":"Zheng","full_name":"Zheng, Da Wei"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H"}],"date_created":"2023-07-16T22:01:11Z","year":"2023","conference":{"location":"Madison, WI, United States","name":"IPCO: Integer Programming and Combinatorial Optimization","end_date":"2023-06-23","start_date":"2023-06-21"},"abstract":[{"text":"We present an auction algorithm using multiplicative instead of constant weight updates to compute a (1−ε)-approximate maximum weight matching (MWM) in a bipartite graph with n vertices and m edges in time O(mε−1log(ε−1)), matching the running time of the linear-time approximation algorithm of Duan and Pettie [JACM ’14]. Our algorithm is very simple and it can be extended to give a dynamic data structure that maintains a (1−ε)-approximate maximum weight matching under (1) one-sided vertex deletions (with incident edges) and (2) one-sided vertex insertions (with incident edges sorted by weight) to the other side. The total time time used is O(mε−1log(ε−1)), where m is the sum of the number of initially existing and inserted edges.","lang":"eng"}],"scopus_import":"1","month":"05","page":"453-465","publisher":"Springer Nature","citation":{"apa":"Zheng, D. W., &#38; Henzinger, M. (2023). Multiplicative auction algorithm for approximate maximum weight bipartite matching. In <i>International Conference on Integer Programming and Combinatorial Optimization</i> (Vol. 13904, pp. 453–465). Madison, WI, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-32726-1_32\">https://doi.org/10.1007/978-3-031-32726-1_32</a>","ieee":"D. W. Zheng and M. Henzinger, “Multiplicative auction algorithm for approximate maximum weight bipartite matching,” in <i>International Conference on Integer Programming and Combinatorial Optimization</i>, Madison, WI, United States, 2023, vol. 13904, pp. 453–465.","chicago":"Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” In <i>International Conference on Integer Programming and Combinatorial Optimization</i>, 13904:453–65. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-32726-1_32\">https://doi.org/10.1007/978-3-031-32726-1_32</a>.","ista":"Zheng DW, Henzinger M. 2023. Multiplicative auction algorithm for approximate maximum weight bipartite matching. International Conference on Integer Programming and Combinatorial Optimization. IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 13904, 453–465.","ama":"Zheng DW, Henzinger M. Multiplicative auction algorithm for approximate maximum weight bipartite matching. In: <i>International Conference on Integer Programming and Combinatorial Optimization</i>. Vol 13904. Springer Nature; 2023:453-465. doi:<a href=\"https://doi.org/10.1007/978-3-031-32726-1_32\">10.1007/978-3-031-32726-1_32</a>","mla":"Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” <i>International Conference on Integer Programming and Combinatorial Optimization</i>, vol. 13904, Springer Nature, 2023, pp. 453–65, doi:<a href=\"https://doi.org/10.1007/978-3-031-32726-1_32\">10.1007/978-3-031-32726-1_32</a>.","short":"D.W. Zheng, M. Henzinger, in:, International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2023, pp. 453–465."},"status":"public","article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","volume":13904,"isi":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2301.09217","open_access":"1"}],"publication_identifier":{"isbn":["9783031327254"],"eissn":["1611-3349"],"issn":["0302-9743"]},"title":"Multiplicative auction algorithm for approximate maximum weight bipartite matching","type":"conference","publication":"International Conference on Integer Programming and Combinatorial Optimization","_id":"13236","day":"22","doi":"10.1007/978-3-031-32726-1_32","acknowledgement":"The first author thanks to Chandra Chekuri for useful discussions about this paper. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","alternative_title":["LNCS"],"date_published":"2023-05-22T00:00:00Z"},{"fulldoi":"https://doi.org/10.5061/dryad.tb2rbp064","citation":{"ieee":"L. Reynes, “Genomic datasets of Laminaria digitata: Paired-end reads from dd-RADseq, reference genome assembly and filtered VCF.” Repository, 2023.","apa":"Reynes, L. (2023). Genomic datasets of Laminaria digitata: Paired-end reads from dd-RADseq, reference genome assembly and filtered VCF. Repository. <a href=\"https://doi.org/10.5061/dryad.tb2rbp064\">https://doi.org/10.5061/dryad.tb2rbp064</a>","chicago":"Reynes, Lauric. “Genomic Datasets of Laminaria Digitata: Paired-End Reads from Dd-RADseq, Reference Genome Assembly and Filtered VCF.” Repository, 2023. <a href=\"https://doi.org/10.5061/dryad.tb2rbp064\">https://doi.org/10.5061/dryad.tb2rbp064</a>.","mla":"Reynes, Lauric. <i>Genomic Datasets of Laminaria Digitata: Paired-End Reads from Dd-RADseq, Reference Genome Assembly and Filtered VCF</i>. Repository, 2023, doi:<a href=\"https://doi.org/10.5061/dryad.tb2rbp064\">10.5061/dryad.tb2rbp064</a>.","short":"L. Reynes, (2023).","ama":"Reynes L. Genomic datasets of Laminaria digitata: Paired-end reads from dd-RADseq, reference genome assembly and filtered VCF. 2023. doi:<a href=\"https://doi.org/10.5061/dryad.tb2rbp064\">10.5061/dryad.tb2rbp064</a>","ista":"Reynes L. 2023. Genomic datasets of Laminaria digitata: Paired-end reads from dd-RADseq, reference genome assembly and filtered VCF, Repository, <a href=\"https://doi.org/10.5061/dryad.tb2rbp064\">10.5061/dryad.tb2rbp064</a>."},"publisher":"Repository","related_material":{"record":[{"relation":"used_in_publication","id":"17237","status":"public"}]},"department":[{"_id":"NiBa"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"The impact of ongoing climate change on populations will be contingent upon their contemporary adaptive evolution. In this study, we investigated the contemporary evolution of four populations of the cold-water kelp Laminaria digitata by analysing their spatial and temporal genomic variation using ddRAD-sequencing. These populations were sampled from the center to the southern margin of its north-eastern Atlantic distribution at two-time points, spanning at least two generations. Through genome scans for local adaptation at a single time point, we identified candidate loci that showed clinal variation correlated with changes in sea surface temperature (SST) along latitudinal gradients. This finding suggests that SST may drive the adaptive response of these kelp populations, although factors such as species' demographic history should also be considered. Additionally, we performed a simulation approach to distinguish the effect of selection from genetic drift in allele frequency changes over time. This enabled the detection of loci in the southernmost population that exhibited temporal differentiation beyond what would be expected from genetic drift alone: these are candidate loci which could have evolved under selection over time. In contrast, we did not detect any outlier locus based on temporal differentiation in the population from the North Sea, which also displayed low and decreasing levels of genetic diversity. The diverse evolutionary scenarios observed among populations can be attributed to variations in the prevalence of selection relative to genetic drift across different environments. Therefore, our study highlights the potential of temporal genomics to offer valuable insights into the contemporary evolution of marine foundation species facing climate change."}],"month":"06","OA_place":"repository","date_published":"2023-06-20T00:00:00Z","_id":"22867","author":[{"full_name":"Reynes, Lauric","last_name":"Reynes","first_name":"Lauric"}],"day":"20","year":"2023","doi":"10.5061/dryad.tb2rbp064","date_created":"2026-09-09T09:33:28Z","title":"Genomic datasets of Laminaria digitata: Paired-end reads from dd-RADseq, reference genome assembly and filtered VCF","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.tb2rbp064"}],"type":"research_data_reference","article_processing_charge":"No","status":"public","OA_type":"green","oa_version":"None","oa":1,"date_updated":"2026-10-21T08:10:14Z"}]
