[{"external_id":{"arxiv":["2406.11649"]},"oa_version":"Published Version","author":[{"last_name":"La Tour","full_name":"La Tour, Max Dupré","first_name":"Max Dupré"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","first_name":"David","full_name":"Saulpic, David","last_name":"Saulpic"}],"intvolume":"       235","publication_status":"published","alternative_title":["PMLR"],"arxiv":1,"citation":{"short":"M.D. La Tour, M. Henzinger, D. Saulpic, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 12046–12086.","ista":"La Tour MD, Henzinger M, Saulpic D. 2024. Making old things new: A unified algorithm for differentially private clustering. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 12046–12086.","mla":"La Tour, Max Dupré, et al. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 12046–86.","ama":"La Tour MD, Henzinger M, Saulpic D. Making old things new: A unified algorithm for differentially private clustering. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:12046-12086.","ieee":"M. D. La Tour, M. Henzinger, and D. Saulpic, “Making old things new: A unified algorithm for differentially private clustering,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 12046–12086.","chicago":"La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:12046–86. ML Research Press, 2024.","apa":"La Tour, M. D., Henzinger, M., &#38; Saulpic, D. (2024). Making old things new: A unified algorithm for differentially private clustering. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 12046–12086). Vienna, Austria: ML Research Press."},"title":"Making old things new: A unified algorithm for differentially private clustering","volume":235,"project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"},{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"conference":{"start_date":"2024-07-21","end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning","location":"Vienna, Austria"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2406.11649"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_published":"2024-09-01T00:00:00Z","department":[{"_id":"MoHe"}],"day":"01","date_updated":"2026-06-18T18:01:02Z","publication_identifier":{"eissn":["2640-3498"]},"type":"conference","year":"2024","ddc":["000"],"quality_controlled":"1","status":"public","oa":1,"month":"09","publication":"Proceedings of the 41st International Conference on Machine Learning","corr_author":"1","publisher":"ML Research Press","abstract":[{"text":"As a staple of data analysis and unsupervised learning, the problem of private clustering has been widely studied, under various privacy models. Centralized differential privacy is the first of them, and the problem has also been studied for the local and the shuffle variation. In each case, the goal is to design an algorithm that computes privately a clustering, with the smallest possible error. The study of each variation gave rise to new algorithm: the landscape of private clustering algorithm is therefore quite intricate. In this paper, we show that a 20 year-old algorithm can be slightly modified to work for any of those models. This provides a unified picture: while matching almost all previously known results, it allows us to improve some of them, and extend to a new privacy model, the continual observation setting, where the input is changing over time and the algorithm must output a new solution at each time step.","lang":"eng"}],"acknowledgement":"Monika Henzinger: 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) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.This work was partially done while David Saulpic was at the Institute for Science and Technology, Austria (ISTA). David Sauplic has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 101034413.","ec_funded":1,"scopus_import":"1","date_created":"2024-09-22T22:01:44Z","page":"12046-12086","_id":"18116"},{"publication_status":"published","intvolume":"       235","arxiv":1,"external_id":{"arxiv":["2401.04679"]},"related_material":{"link":[{"relation":"software","url":"https://github.com/IST-DASLab/RoSA"}]},"author":[{"full_name":"Nikdan, Mahdi","last_name":"Nikdan","id":"66374281-f394-11eb-9cf6-869147deecc0","first_name":"Mahdi"},{"first_name":"Soroush","id":"06000900-6068-11ef-8d61-c2472ef2e752","last_name":"Tabesh","orcid":"0009-0003-4119-6281","full_name":"Tabesh, Soroush"},{"id":"41888001-440d-11ef-8299-d0e838b8185e","first_name":"Elvir","full_name":"Crncevic, Elvir","last_name":"Crncevic"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"}],"oa_version":"Preprint","status":"public","oa":1,"publication":"Proceedings of the 41st International Conference on Machine Learning","month":"09","corr_author":"1","quality_controlled":"1","page":"38187-38206","date_created":"2024-09-22T22:01:44Z","scopus_import":"1","_id":"18117","publisher":"ML Research Press","acknowledgement":"The authors would like to thank Eldar Kurtic for experimental support and useful suggestions throughout the project","abstract":[{"lang":"eng","text":"We investigate parameter-efficient fine-tuning (PEFT) methods that can provide good accuracy under limited computational and memory budgets in the context of large language models (LLMs). We present a new PEFT method called Robust Adaptation (RoSA) inspired by robust principal component analysis that jointly trains low-rank\r\n and highly-sparse components on top of a set of fixed pretrained weights to efficiently approximate the performance of a full-fine-tuning (FFT) solution. Across a series of challenging generative tasks such as grade-school math and SQL query generation, which require fine-tuning for good performance, we show that RoSA outperforms LoRA, pure sparse fine-tuning, and alternative hybrid methods at the same parameter budget, and can even recover the performance of FFT on some tasks. We provide system support for RoSA to complement the training algorithm, specifically in the form of sparse GPU kernels which enable memory- and computationally-efficient training, and show that it is also compatible with low-precision base weights, resulting in the first joint representation combining quantization, low-rank and sparse approximations. Our code is available at https://github.com/IST-DASLab/RoSA."}],"conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2024-07-27","location":"Vienna, Austria","start_date":"2024-07-21"},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2401.04679","open_access":"1"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Nikdan, Mahdi, et al. “RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptation.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 38187–206.","ista":"Nikdan M, Tabesh S, Crncevic E, Alistarh D-A. 2024. RoSA: Accurate parameter-efficient fine-tuning via robust adaptation. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 235, 38187–38206.","short":"M. Nikdan, S. Tabesh, E. Crncevic, D.-A. Alistarh, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 38187–38206.","ama":"Nikdan M, Tabesh S, Crncevic E, Alistarh D-A. RoSA: Accurate parameter-efficient fine-tuning via robust adaptation. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:38187-38206.","ieee":"M. Nikdan, S. Tabesh, E. Crncevic, and D.-A. Alistarh, “RoSA: Accurate parameter-efficient fine-tuning via robust adaptation,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 38187–38206.","chicago":"Nikdan, Mahdi, Soroush Tabesh, Elvir Crncevic, and Dan-Adrian Alistarh. “RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptation.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:38187–206. ML Research Press, 2024.","apa":"Nikdan, M., Tabesh, S., Crncevic, E., &#38; Alistarh, D.-A. (2024). RoSA: Accurate parameter-efficient fine-tuning via robust adaptation. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 38187–38206). Vienna, Austria: ML Research Press."},"title":"RoSA: Accurate parameter-efficient fine-tuning via robust adaptation","volume":235,"day":"01","date_updated":"2024-10-01T08:22:01Z","year":"2024","publication_identifier":{"eissn":["2640-3498"]},"type":"conference","date_published":"2024-09-01T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"},{"_id":"GradSch"}]},{"external_id":{"arxiv":["2402.04054"]},"oa_version":"Published Version","author":[{"full_name":"Zakerinia, Hossein","orcid":"0009-0007-3977-6462","last_name":"Zakerinia","id":"653bd8b6-f394-11eb-9cf6-c0bbf6cd78d4","first_name":"Hossein"},{"first_name":"Amin","full_name":"Behjati, Amin","last_name":"Behjati"},{"last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"       235","alternative_title":["PMLR"],"publication_status":"published","arxiv":1,"title":"More flexible PAC-Bayesian meta-learning by learning learning algorithms","citation":{"short":"H. Zakerinia, A. Behjati, C. Lampert, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 58122–58139.","mla":"Zakerinia, Hossein, et al. “More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithms.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 58122–39.","ista":"Zakerinia H, Behjati A, Lampert C. 2024. More flexible PAC-Bayesian meta-learning by learning learning algorithms. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 58122–58139.","ieee":"H. Zakerinia, A. Behjati, and C. Lampert, “More flexible PAC-Bayesian meta-learning by learning learning algorithms,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 58122–58139.","ama":"Zakerinia H, Behjati A, Lampert C. More flexible PAC-Bayesian meta-learning by learning learning algorithms. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:58122-58139.","chicago":"Zakerinia, Hossein, Amin Behjati, and Christoph Lampert. “More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithms.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:58122–39. ML Research Press, 2024.","apa":"Zakerinia, H., Behjati, A., &#38; Lampert, C. (2024). More flexible PAC-Bayesian meta-learning by learning learning algorithms. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 58122–58139). Vienna, Austria: ML Research Press."},"volume":235,"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2402.04054"}],"conference":{"start_date":"2024-07-21","end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning","location":"Vienna, Austria"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2024-09-01T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"day":"01","date_updated":"2026-06-18T18:01:36Z","type":"conference","year":"2024","publication_identifier":{"eissn":["2640-3498"]},"quality_controlled":"1","ddc":["000"],"publication":"Proceedings of the 41st International Conference on Machine Learning","month":"09","status":"public","oa":1,"corr_author":"1","publisher":"ML Research Press","abstract":[{"lang":"eng","text":"We introduce a new framework for studying meta-learning methods using PAC-Bayesian theory. Its main advantage over previous work is that it allows for more flexibility in how the transfer of knowledge between tasks is realized. For previous approaches, this could only happen indirectly, by means of learning prior distributions over models. In contrast, the new generalization bounds that we prove express the process of meta-learning much more directly as learning the learning algorithm that should be used for future tasks. The flexibility of our framework makes it suitable to analyze a wide range of meta-learning mechanisms and even design new mechanisms. Other than our theoretical contributions we also show empirically that our framework improves the prediction quality in practical meta-learning mechanisms."}],"_id":"18118","date_created":"2024-09-22T22:01:45Z","scopus_import":"1","page":"58122-58139"},{"author":[{"id":"e499926b-f6e0-11ea-865d-9c63db0031e8","first_name":"Jonathan A","full_name":"Scott, Jonathan A","last_name":"Scott"},{"first_name":"Áine","last_name":"Cahill","full_name":"Cahill, Áine"}],"oa_version":"Preprint","external_id":{"arxiv":["2406.02416"]},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"21198"}]},"arxiv":1,"alternative_title":["PMLR"],"publication_status":"published","intvolume":"       235","date_updated":"2026-04-07T11:46:11Z","day":"01","year":"2024","publication_identifier":{"eissn":["2640-3498"]},"type":"conference","date_published":"2024-09-01T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2406.02416","open_access":"1"}],"conference":{"start_date":"2024-07-21","end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning","location":"Vienna, Austria"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Improved modelling of federated datasets using mixtures-of-Dirichlet-multinomials","citation":{"short":"J.A. Scott, Á. Cahill, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 44012–44037.","ista":"Scott JA, Cahill Á. 2024. Improved modelling of federated datasets using mixtures-of-Dirichlet-multinomials. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 44012–44037.","mla":"Scott, Jonathan A., and Áine Cahill. “Improved Modelling of Federated Datasets Using Mixtures-of-Dirichlet-Multinomials.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 44012–37.","ieee":"J. A. Scott and Á. Cahill, “Improved modelling of federated datasets using mixtures-of-Dirichlet-multinomials,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 44012–44037.","chicago":"Scott, Jonathan A, and Áine Cahill. “Improved Modelling of Federated Datasets Using Mixtures-of-Dirichlet-Multinomials.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:44012–37. ML Research Press, 2024.","apa":"Scott, J. A., &#38; Cahill, Á. (2024). Improved modelling of federated datasets using mixtures-of-Dirichlet-multinomials. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 44012–44037). Vienna, Austria: ML Research Press.","ama":"Scott JA, Cahill Á. Improved modelling of federated datasets using mixtures-of-Dirichlet-multinomials. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:44012-44037."},"volume":235,"_id":"18120","page":"44012-44037","scopus_import":"1","date_created":"2024-09-22T22:01:45Z","publisher":"ML Research Press","acknowledgement":"We would like to thank: Mona Chitnis and everyone in the Private Federated Learning team at Apple for their help and support throughout the entire project; Audra McMillan, Martin Pelikan, Anosh Raj and Barry Theobold for feedback on the initial versions of the paper; and Christoph Lampert for valuable feedback on the paper structure and suggestions for additional experiments.","abstract":[{"text":"In practice, training using federated learning can be orders of magnitude slower than standard centralized training. This severely limits the amount of experimentation and tuning that can be done, making it challenging to obtain good performance on a given task. Server-side proxy data can be used to run training simulations, for instance for hyperparameter tuning. This can greatly speed up the training pipeline by reducing the number of tuning runs to be performed overall on the true clients. However, it is challenging to ensure that these simulations accurately reflect the dynamics of the real federated training. In particular, the proxy data used for simulations often comes as a single centralized dataset without a partition into distinct clients, and partitioning this data in a naive way can lead to simulations that poorly reflect real federated training. In this paper we address the challenge of how to partition centralized data in a way that reflects the statistical heterogeneity of the true federated clients. We propose a fully federated, theoretically justified, algorithm that efficiently learns the distribution of the true clients and observe improved server-side simulations when using the inferred distribution to create simulated clients from the centralized data.","lang":"eng"}],"month":"09","publication":"Proceedings of the 41st International Conference on Machine Learning","oa":1,"status":"public","corr_author":"1","quality_controlled":"1"},{"alternative_title":["ISTA Thesis"],"publication_status":"published","related_material":{"record":[{"id":"11732","status":"public","relation":"part_of_dissertation"},{"id":"14542","status":"public","relation":"part_of_dissertation"},{"id":"18107","relation":"part_of_dissertation","status":"public"},{"id":"17240","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"14931"}]},"oa_version":"Published Version","doi":"10.15479/at:ista:18135","author":[{"last_name":"Lauritsen","orcid":"0000-0003-4476-2288","full_name":"Lauritsen, Asbjørn Bækgaard","first_name":"Asbjørn Bækgaard","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1"}],"file":[{"file_size":3648831,"content_type":"application/pdf","file_id":"18147","relation":"main_file","access_level":"open_access","checksum":"c7bc3b31e430d57c65393051ca439575","date_created":"2024-09-26T13:11:24Z","success":1,"date_updated":"2024-09-26T13:11:24Z","file_name":"Lauritsen-thesis-final.pdf","creator":"alaurits"},{"creator":"alaurits","file_name":"Lauritsen-thesis-source.zip","date_created":"2024-09-26T13:12:55Z","date_updated":"2024-09-26T13:12:55Z","content_type":"application/x-zip-compressed","file_id":"18148","file_size":1625888,"access_level":"closed","relation":"source_file","checksum":"39f6b1b7f83e25a3bf9f933f1ea0bc06"}],"ddc":["515","539"],"corr_author":"1","month":"09","oa":1,"status":"public","ec_funded":1,"abstract":[{"lang":"eng","text":"This thesis consists of two separate parts. In the first part we consider a dilute Fermi gas interacting through a repulsive interaction in dimensions $d=1,2,3$. Our focus is mostly on the physically most relevant dimension $d=3$ \r\nand the setting of a spin-polarized (equivalently spinless) gas, where the Pauli exclusion principle plays a key role. We show that, at zero temperature, the ground state energy density of the interacting spin-polarized gas differs (to leading order) from that of the free (i.e. non-interacting) gas by a term of order $a_p^d\\rho^{2+2/d}$  with $a_p$ the $p$-wave scattering length of the repulsive interaction and $\\rho$ the density. Further, we extend this to positive temperature and show that the pressure of an interacting spin-polarized gas differs from that of the free gas by a now temperature dependent term, again of order $a_p^d\\rho^{2+2/d}$. Lastly, we consider the setting of a spin-$\\frac{1}{2}$ Fermi gas in $d=3$ dimensions and show that here, as an upper bound, the ground state energy density differs from that of the free system by a term of order $a_s \\rho^2$ with an error smaller than $a_s \\rho^2 (a_s\\rho^{1/3})^{1-\\eps}$ for any $\\eps > 0$, where $a_s$ is the $s$-wave scattering length of the repulsive interaction. \r\n\r\nThese asymptotic formulas complement the similar formulas in the literature for the dilute Bose and spin-$\\frac{1}{2}$ Fermi gas, where the ground state energies or pressures differ from that of the corresponding free systems by a term of order $a_s \\rho^2$ in dimension $d=3$. In the spin-polarized setting, the corrections, of order $a_p^3\\rho^{8/3}$ in dimension $d=3$, are thus much smaller and requires a more delicate analysis.\r\n\r\nIn the second part of the thesis we consider the Bardeen--Cooper--Schrieffer (BCS) theory of superconductivity and in particular its associated critical temperature and energy gap. We prove that the ratio of the zero-temperature energy gap and critical temperature $\\Xi(T=0)/T_c$ approaches a universal constant $\\pi e^{-\\gamma}\\approx 1.76$ in both the limit of high density in dimension $d=3$ and in the limit of weak coupling in dimensions $d=1,2$. This complements the proofs in the literature of this universal behaviour in the limit of weak coupling or low density in dimension $d=3$. Secondly, we prove that the ratio of the energy gap at positive temperature and critical temperature $\\Xi(T)/T_c$ approaches a universal function of the relative temperature $T/T_c$ in the limit of weak coupling in dimensions $d=1,2,3$."}],"publisher":"Institute of Science and Technology Austria","supervisor":[{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"degree_awarded":"PhD","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"18135","OA_place":"publisher","page":"353","date_created":"2024-09-24T10:56:25Z","project":[{"_id":"bda63fe5-d553-11ed-ba76-a16e3d2f256b","grant_number":"I06427","name":"Mathematical Challenges in BCS Theory of Superconductivity"},{"name":"Analysis of quantum many-body systems","grant_number":"694227","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"title":"Energies of dilute Fermi gases and universalities in BCS theory","citation":{"short":"A.B. Lauritsen, Energies of Dilute Fermi Gases and Universalities in BCS Theory, Institute of Science and Technology Austria, 2024.","ista":"Lauritsen AB. 2024. Energies of dilute Fermi gases and universalities in BCS theory. Institute of Science and Technology Austria.","mla":"Lauritsen, Asbjørn Bækgaard. <i>Energies of Dilute Fermi Gases and Universalities in BCS Theory</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18135\">10.15479/at:ista:18135</a>.","apa":"Lauritsen, A. B. (2024). <i>Energies of dilute Fermi gases and universalities in BCS theory</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18135\">https://doi.org/10.15479/at:ista:18135</a>","ieee":"A. B. Lauritsen, “Energies of dilute Fermi gases and universalities in BCS theory,” Institute of Science and Technology Austria, 2024.","chicago":"Lauritsen, Asbjørn Bækgaard. “Energies of Dilute Fermi Gases and Universalities in BCS Theory.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18135\">https://doi.org/10.15479/at:ista:18135</a>.","ama":"Lauritsen AB. Energies of dilute Fermi gases and universalities in BCS theory. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18135\">10.15479/at:ista:18135</a>"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"date_published":"2024-09-23T00:00:00Z","year":"2024","type":"dissertation","publication_identifier":{"isbn":["978-3-99078-042-8"],"issn":["2663-337X"]},"file_date_updated":"2024-09-26T13:12:55Z","day":"23","date_updated":"2026-04-16T08:17:55Z"},{"arxiv":1,"article_number":"40","publication_status":"published","alternative_title":["LIPIcs"],"intvolume":"       317","doi":"10.4230/LIPIcs.APPROX/RANDOM.2024.40","author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"A. R.","last_name":"Sricharan","full_name":"Sricharan, A. R."},{"first_name":"Teresa Anna","full_name":"Steiner, Teresa Anna","last_name":"Steiner"}],"file":[{"checksum":"c08b41c896e4d8c69570044808b40e0b","access_level":"open_access","relation":"main_file","file_size":973917,"content_type":"application/pdf","file_id":"18166","creator":"dernst","file_name":"2024_LIPICs_HenzingerM.pdf","date_created":"2024-10-01T10:07:14Z","success":1,"date_updated":"2024-10-01T10:07:14Z"}],"oa_version":"Published Version","external_id":{"isi":["001545634500040"],"arxiv":["2408.11637"]},"scopus_import":"1","date_created":"2024-09-29T22:01:38Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"18156","abstract":[{"text":"Privately counting distinct elements in a stream is a fundamental data analysis problem with many applications in machine learning. In the turnstile model, Jain et al. [NeurIPS2023] initiated the study of this problem parameterized by the maximum flippancy of any element, i.e., the number of times that the count of an element changes from 0 to above 0 or vice versa. They give an item-level (ε,δ)-differentially private algorithm whose additive error is tight with respect to that parameterization. In this work, we show that a very simple algorithm based on the sparse vector technique achieves a tight additive error for item-level (ε,δ)-differential privacy and item-level ε-differential privacy with regards to a different parameterization, namely the sum of all flippancies. Our second result is a bound which shows that for a large class of algorithms, including all existing differentially private algorithms for this problem, the lower bound from item-level differential privacy extends to event-level differential privacy. This partially answers an open question by Jain et al. [NeurIPS2023].","lang":"eng"}],"acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct,No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nTeresa Anna Steiner: Supported by a research grant (VIL51463) from VILLUM FONDEN.","ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","isi":1,"corr_author":"1","status":"public","oa":1,"publication":"International Conference on Approximation Algorithms for Combinatorial Optimization Problems ","month":"09","ddc":["000"],"quality_controlled":"1","type":"conference","publication_identifier":{"isbn":["9783959773485"],"issn":["1868-8969"]},"year":"2024","day":"16","date_updated":"2025-12-02T13:47:16Z","file_date_updated":"2024-10-01T10:07:14Z","department":[{"_id":"MoHe"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"date_published":"2024-09-16T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2024-08-27","name":"APPROX: Conference on Approximation Algorithms for Combinatorial Optimization Problems","end_date":"2024-08-30","location":"London, United Kingdom"},"article_processing_charge":"No","volume":317,"project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"}],"citation":{"ama":"Henzinger M, Sricharan AR, Steiner TA. Private counting of distinct elements in the turnstile model and extensions. In: <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>. Vol 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>","chicago":"Henzinger, Monika, A. R. Sricharan, and Teresa Anna Steiner. “Private Counting of Distinct Elements in the Turnstile Model and Extensions.” In <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>, Vol. 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>.","apa":"Henzinger, M., Sricharan, A. R., &#38; Steiner, T. A. (2024). Private counting of distinct elements in the turnstile model and extensions. In <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i> (Vol. 317). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>","ieee":"M. Henzinger, A. R. Sricharan, and T. A. Steiner, “Private counting of distinct elements in the turnstile model and extensions,” in <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>, London, United Kingdom, 2024, vol. 317.","short":"M. Henzinger, A.R. Sricharan, T.A. Steiner, in:, International Conference on Approximation Algorithms for Combinatorial Optimization Problems , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","mla":"Henzinger, Monika, et al. “Private Counting of Distinct Elements in the Turnstile Model and Extensions.” <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>, vol. 317, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>.","ista":"Henzinger M, Sricharan AR, Steiner TA. 2024. Private counting of distinct elements in the turnstile model and extensions. International Conference on Approximation Algorithms for Combinatorial Optimization Problems . APPROX: Conference on Approximation Algorithms for Combinatorial Optimization Problems, LIPIcs, vol. 317, 40."},"title":"Private counting of distinct elements in the turnstile model and extensions"},{"month":"01","publication":"Journal de l'Ecole Polytechnique - Mathematiques","status":"public","oa":1,"corr_author":"1","isi":1,"quality_controlled":"1","ddc":["510"],"_id":"18158","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"date_created":"2024-09-29T22:01:38Z","page":"957-1010","scopus_import":"1","publisher":"Ecole Polytechnique","article_type":"original","abstract":[{"text":"We study the geometry of Poisson point processes from the point of view of optimal transport and Ricci lower bounds. We construct a Riemannian structure on the space of point processes and the associated distance W that corresponds to the Benamou–Brenier variational formula. Our main tool is a non-local continuity equation formulated with the difference operator. The closure of the domain of the relative entropy is a complete geodesic space, when endowed with \r\nW. The geometry of this non-local infinite-dimensional space is analogous to that of spaces with positive Ricci curvature. Among others: (a) the Ornstein–Uhlenbeck semi-group is the gradient flow of the relative entropy; (b) the Poisson space has an entropic Ricci curvature bounded from below by 1; (c) W satisfies an HWI inequality.","lang":"eng"},{"lang":"fre","text":"Nous étudions la géométrie des processus ponctuels de Poisson à travers le prisme du transport optimal et de la minoration de la courbure de Ricci. Nous construisons une structure\r\nriemannienne sur l’espace des processus ponctuels et la distance associée W qui concorde avec la formulation variationnelle de Benamou–Brenier. Notre analyse repose sur une équation de continuité non locale définie à l’aide de l’opérateur de différence. La fermeture du domaine de l’entropie relative, équipé de W, est un espace géodésique complet. La géométrie de cet espace non local et de dimension infinie est analogue à celle des espaces à courbure de Ricci strictement positive. Entre autres : (a) le semi-groupe d’Ornstein–Uhlenbeck est le flot du gradient de l’entropie relative ; (b) l’espace de Poisson a une courbure de Ricci entropique minorée par 1 ; (c) W satisfait une inégalité HWI."}],"article_processing_charge":"Yes","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Wasserstein geometry and Ricci curvature bounds for Poisson spaces","citation":{"chicago":"Dello Schiavo, Lorenzo, Ronan Herry, and Kohei Suzuki. “Wasserstein Geometry and Ricci Curvature Bounds for Poisson Spaces.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique, 2024. <a href=\"https://doi.org/10.5802/jep.270\">https://doi.org/10.5802/jep.270</a>.","apa":"Dello Schiavo, L., Herry, R., &#38; Suzuki, K. (2024). Wasserstein geometry and Ricci curvature bounds for Poisson spaces. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique. <a href=\"https://doi.org/10.5802/jep.270\">https://doi.org/10.5802/jep.270</a>","ieee":"L. Dello Schiavo, R. Herry, and K. Suzuki, “Wasserstein geometry and Ricci curvature bounds for Poisson spaces,” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 11. Ecole Polytechnique, pp. 957–1010, 2024.","ama":"Dello Schiavo L, Herry R, Suzuki K. Wasserstein geometry and Ricci curvature bounds for Poisson spaces. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. 2024;11:957-1010. doi:<a href=\"https://doi.org/10.5802/jep.270\">10.5802/jep.270</a>","mla":"Dello Schiavo, Lorenzo, et al. “Wasserstein Geometry and Ricci Curvature Bounds for Poisson Spaces.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 11, Ecole Polytechnique, 2024, pp. 957–1010, doi:<a href=\"https://doi.org/10.5802/jep.270\">10.5802/jep.270</a>.","ista":"Dello Schiavo L, Herry R, Suzuki K. 2024. Wasserstein geometry and Ricci curvature bounds for Poisson spaces. Journal de l’Ecole Polytechnique - Mathematiques. 11, 957–1010.","short":"L. Dello Schiavo, R. Herry, K. Suzuki, Journal de l’Ecole Polytechnique - Mathematiques 11 (2024) 957–1010."},"volume":11,"file_date_updated":"2024-10-01T07:31:56Z","day":"01","date_updated":"2025-09-08T09:50:50Z","publication_identifier":{"eissn":["2270-518X"],"issn":["2429-7100"]},"year":"2024","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2024-01-01T00:00:00Z","department":[{"_id":"JaMa"}],"has_accepted_license":"1","publication_status":"published","intvolume":"        11","arxiv":1,"external_id":{"arxiv":["2303.00398"],"isi":["001367254000003"]},"file":[{"creator":"dernst","file_name":"2024_JourEcolePolytechniqueMath_DelloSchiavo.pdf","date_created":"2024-10-01T07:31:56Z","success":1,"date_updated":"2024-10-01T07:31:56Z","relation":"main_file","access_level":"open_access","file_size":1250553,"content_type":"application/pdf","file_id":"18164","checksum":"5a51da5fb5f7fcaada378d43444cced8"}],"author":[{"id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","first_name":"Lorenzo","full_name":"Dello Schiavo, Lorenzo","orcid":"0000-0002-9881-6870","last_name":"Dello Schiavo"},{"first_name":"Ronan","full_name":"Herry, Ronan","last_name":"Herry"},{"first_name":"Kohei","full_name":"Suzuki, Kohei","last_name":"Suzuki"}],"doi":"10.5802/jep.270","oa_version":"Published Version"},{"external_id":{"arxiv":["2405.04015"]},"oa_version":"Preprint","author":[{"full_name":"Akshay, S","last_name":"Akshay","first_name":"S"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias"},{"last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.24963/ijcai.2024/1","publication_status":"published","arxiv":1,"title":"Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties","citation":{"ieee":"S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties,” in <i>Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence</i>, Jeju, Korea, 2024, pp. 3–12.","apa":"Akshay, S., Chatterjee, K., Meggendorfer, T., &#38; Zikelic, D. (2024). Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. In <i>Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence</i> (pp. 3–12). Jeju, Korea: International Joint Conferences on Artificial Intelligence. <a href=\"https://doi.org/10.24963/ijcai.2024/1\">https://doi.org/10.24963/ijcai.2024/1</a>","ama":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. In: <i>Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence; 2024:3-12. doi:<a href=\"https://doi.org/10.24963/ijcai.2024/1\">10.24963/ijcai.2024/1</a>","chicago":"Akshay, S, Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties.” In <i>Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence</i>, 3–12. International Joint Conferences on Artificial Intelligence, 2024. <a href=\"https://doi.org/10.24963/ijcai.2024/1\">https://doi.org/10.24963/ijcai.2024/1</a>.","short":"S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 3–12.","ista":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. 2024. Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 3–12.","mla":"Akshay, S., et al. “Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties.” <i>Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence, 2024, pp. 3–12, doi:<a href=\"https://doi.org/10.24963/ijcai.2024/1\">10.24963/ijcai.2024/1</a>."},"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2405.04015","open_access":"1"}],"conference":{"start_date":"2024-08-03","name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2024-08-09","location":"Jeju, Korea"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2024-09-01T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"date_updated":"2025-04-14T07:52:46Z","day":"01","publication_identifier":{"issn":["1045-0823"],"isbn":["9781956792041"]},"type":"conference","year":"2024","quality_controlled":"1","publication":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","month":"09","oa":1,"status":"public","corr_author":"1","publisher":"International Joint Conferences on Artificial Intelligence","ec_funded":1,"acknowledgement":"This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt), the Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 1 grant, Google Research Award 2023 and the SBI Foundation Hub for Data and Analytics.","abstract":[{"text":"Markov Decision Processes (MDPs) are a classical model for decision making in the presence of uncertainty. Often they are viewed as state transformers with planning objectives defned with respect to paths over MDP states. An increasingly\r\npopular alternative is to view them as distribution transformers, giving rise to a sequence of probability distributions over MDP states. For instance, reachability and safety properties in modeling robot swarms or chemical reaction networks are naturally defned in terms of probability distributions over states. Verifying such distributional properties is known to be hard and often beyond the reach of classical state-based verifcation techniques. In this work, we consider the problems of certifed policy (i.e. controller) verifcation and synthesis in MDPs under distributional reach-avoidance specifcations. By certifed we mean that, along with a policy, we also aim to synthesize a (checkable) certifcate ensuring that the MDP indeed satisfes the property. Thus, given the target set of distributions and an unsafe set of distributions over MDP states, our goal is to either synthesize a certifcate for a given policy or synthesize a policy along with a certifcate, proving that the target distribution can be reached while avoiding unsafe distributions. To solve this problem, we introduce the novel notion of distributional reach-avoid certifcates and present automated procedures for (1) synthesizing a certifcate for a given policy, and (2) synthesizing a policy together with the certifcate, both providing formal guarantees on certifcate correctness. Our experimental evaluation demonstrates the ability of our method to solve several non-trivial examples, including a multi-agent robot-swarm model, to synthesize certifed policies and to certify existing policies. ","lang":"eng"}],"_id":"18159","scopus_import":"1","page":"3-12","date_created":"2024-09-29T22:01:38Z"},{"external_id":{"arxiv":["2312.13912"]},"oa_version":"Preprint","doi":"10.24963/ijcai.2024/741","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","first_name":"Ehsan","full_name":"Kafshdar Goharshadi, Ehsan","orcid":"0000-0002-8595-0587","last_name":"Kafshdar Goharshadi"},{"last_name":"Karrabi","full_name":"Karrabi, Mehrdad","first_name":"Mehrdad","id":"67638922-f394-11eb-9cf6-f20423e08757"},{"first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný","full_name":"Novotný, Petr"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","last_name":"Zikelic","full_name":"Zikelic, Dorde"}],"publication_status":"published","arxiv":1,"project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"title":"Solving long-run average reward robust MDPs via stochastic games","citation":{"chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, Mehrdad Karrabi, Petr Novotný, and Dorde Zikelic. “Solving Long-Run Average Reward Robust MDPs via Stochastic Games.” In <i>33rd International Joint Conference on Artificial Intelligence</i>, 6707–15. International Joint Conferences on Artificial Intelligence, 2024. <a href=\"https://doi.org/10.24963/ijcai.2024/741\">https://doi.org/10.24963/ijcai.2024/741</a>.","apa":"Chatterjee, K., Goharshady, E., Karrabi, M., Novotný, P., &#38; Zikelic, D. (2024). Solving long-run average reward robust MDPs via stochastic games. In <i>33rd International Joint Conference on Artificial Intelligence</i> (pp. 6707–6715). Jeju, South Korea: International Joint Conferences on Artificial Intelligence. <a href=\"https://doi.org/10.24963/ijcai.2024/741\">https://doi.org/10.24963/ijcai.2024/741</a>","ama":"Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. Solving long-run average reward robust MDPs via stochastic games. In: <i>33rd International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence; 2024:6707-6715. doi:<a href=\"https://doi.org/10.24963/ijcai.2024/741\">10.24963/ijcai.2024/741</a>","ieee":"K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, and D. Zikelic, “Solving long-run average reward robust MDPs via stochastic games,” in <i>33rd International Joint Conference on Artificial Intelligence</i>, Jeju, South Korea, 2024, pp. 6707–6715.","short":"K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, D. Zikelic, in:, 33rd International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–6715.","mla":"Chatterjee, Krishnendu, et al. “Solving Long-Run Average Reward Robust MDPs via Stochastic Games.” <i>33rd International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–15, doi:<a href=\"https://doi.org/10.24963/ijcai.2024/741\">10.24963/ijcai.2024/741</a>.","ista":"Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. 2024. Solving long-run average reward robust MDPs via stochastic games. 33rd International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 6707–6715."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2312.13912"}],"conference":{"location":"Jeju, South Korea","name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2024-08-09","start_date":"2024-08-03"},"department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"date_published":"2024-09-01T00:00:00Z","publication_identifier":{"issn":["1045-0823"],"isbn":["9781956792041"]},"type":"conference","year":"2024","date_updated":"2025-04-14T07:52:46Z","day":"01","quality_controlled":"1","corr_author":"1","publication":"33rd International Joint Conference on Artificial Intelligence","month":"09","oa":1,"status":"public","ec_funded":1,"acknowledgement":"This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt) and the Czech Science Foundation\r\ngrant no. GA23-06963S.","abstract":[{"lang":"eng","text":"Markov decision processes (MDPs) provide a standard framework for sequential decision making under uncertainty. However, MDPs do not take uncertainty in transition probabilities into account. Robust Markov decision processes (RMDPs) address this shortcoming of MDPs by assigning to each transition an uncertainty set rather than a single probability value. In this work, we consider polytopic RMDPs in which all uncertainty sets are polytopes and study the problem of solving long-run average reward polytopic RMDPs. We present a novel perspective on this problem and show that it can be reduced to solving long-run average reward turn-based stochastic games with finite state and action spaces. This reduction allows us to derive several important consequences that were hitherto not known to hold for polytopic RMDPs. First, we derive new computational complexity bounds for solving long-run average reward polytopic RMDPs, showing for the first time that the threshold decision problem for them is in NP∩CONP and that they admit a randomized algorithm with sub-exponential expected runtime. Second, we present Robust Polytopic Policy Iteration (RPPI), a novel policy iteration algorithm for solving long-run average reward polytopic RMDPs. Our experimental evaluation shows that RPPI is much more efficient in solving long-run average reward polytopic RMDPs compared to state-of-the-art methods based on value iteration. "}],"publisher":"International Joint Conferences on Artificial Intelligence","_id":"18160","OA_place":"repository","scopus_import":"1","page":"6707-6715","date_created":"2024-09-29T22:01:39Z"},{"scopus_import":"1","page":"391-422","date_created":"2024-10-01T10:58:27Z","_id":"18167","publisher":"Elsevier","abstract":[{"lang":"eng","text":"Holdase chaperones are essential in the mitochondrial membrane-protein biogenesis as they stabilize preproteins and keep them in an import-competent state as they travel through the aqueous cytosol and intermembrane space. The small TIM chaperones of the mitochondrial intermembrane space function within a fine balance of client promiscuity and high affinity binding, while being also able to release their client proteins without significant energy barrier to the downstream insertases/translocases. The tendency of the preproteins to aggregate and the dynamic nature of the preprotein—chaperone complexes makes the preparation of these complexes challenging. Here we present two optimized methods for complex formation of highly hydrophobic precursor proteins and chaperones: a pull-down approach and an in-vitro translation strategy. In the former, attaching the client protein to an affinity resin keeps the individual client protein copies apart from each other and decreases the client self-aggregation probability, thereby favouring complex formation. In the latter approach, a purified chaperone, added to the cell-free protein synthesis, captures the nascent precursor protein. The choice of method will depend on the desired client-chaperone complex amount, or the need for specific labeling scheme."}],"status":"public","publication":"Methods in Enzymology","month":"09","corr_author":"1","quality_controlled":"1","day":"13","date_updated":"2025-10-22T06:40:54Z","publication_identifier":{"issn":["0076-6879"]},"year":"2024","type":"book_chapter","language":[{"iso":"eng"}],"date_published":"2024-09-13T00:00:00Z","department":[{"_id":"PaSc"}],"article_processing_charge":"No","OA_type":"closed access","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Guillerm U, Sučec I, Schanda P. Generation of TIM chaperone substrate complexes. In: <i>Methods in Enzymology</i>. Vol 707. Elsevier; 2024:391-422. doi:<a href=\"https://doi.org/10.1016/bs.mie.2024.07.051\">10.1016/bs.mie.2024.07.051</a>","ieee":"U. Guillerm, I. Sučec, and P. Schanda, “Generation of TIM chaperone substrate complexes,” in <i>Methods in Enzymology</i>, vol. 707, Elsevier, 2024, pp. 391–422.","apa":"Guillerm, U., Sučec, I., &#38; Schanda, P. (2024). Generation of TIM chaperone substrate complexes. In <i>Methods in Enzymology</i> (Vol. 707, pp. 391–422). Elsevier. <a href=\"https://doi.org/10.1016/bs.mie.2024.07.051\">https://doi.org/10.1016/bs.mie.2024.07.051</a>","chicago":"Guillerm, Undina, Iva Sučec, and Paul Schanda. “Generation of TIM Chaperone Substrate Complexes.” In <i>Methods in Enzymology</i>, 707:391–422. Elsevier, 2024. <a href=\"https://doi.org/10.1016/bs.mie.2024.07.051\">https://doi.org/10.1016/bs.mie.2024.07.051</a>.","ista":"Guillerm U, Sučec I, Schanda P. 2024.Generation of TIM chaperone substrate complexes. In: Methods in Enzymology. vol. 707, 391–422.","mla":"Guillerm, Undina, et al. “Generation of TIM Chaperone Substrate Complexes.” <i>Methods in Enzymology</i>, vol. 707, Elsevier, 2024, pp. 391–422, doi:<a href=\"https://doi.org/10.1016/bs.mie.2024.07.051\">10.1016/bs.mie.2024.07.051</a>.","short":"U. Guillerm, I. Sučec, P. Schanda, in:, Methods in Enzymology, Elsevier, 2024, pp. 391–422."},"title":"Generation of TIM chaperone substrate complexes","volume":707,"publication_status":"published","intvolume":"       707","author":[{"full_name":"Guillerm, Undina","last_name":"Guillerm","id":"bb74f472-ae54-11eb-9835-bc9c22fb1183","first_name":"Undina"},{"first_name":"Iva","full_name":"Sučec, Iva","last_name":"Sučec"},{"first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","last_name":"Schanda","orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul"}],"doi":"10.1016/bs.mie.2024.07.051","oa_version":"None","external_id":{"pmid":["39488384"]},"pmid":1},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"Yes (via OA deal)","volume":25,"title":"Unveiling the dynamic self-assembly of a recombinant dragline-silk-mimicking protein","citation":{"mla":"Wu, Dongqing, et al. “Unveiling the Dynamic Self-Assembly of a Recombinant Dragline-Silk-Mimicking Protein.” <i>Biomacromolecules</i>, vol. 25, no. 3, American Chemical Society, 2024, pp. 1759–74, doi:<a href=\"https://doi.org/10.1021/acs.biomac.3c01239\">10.1021/acs.biomac.3c01239</a>.","ista":"Wu D, Koscic A, Schneider S, Dubini RCA, Rodriguez Camargo DC, Schneider S, Rovo P. 2024. Unveiling the dynamic self-assembly of a recombinant dragline-silk-mimicking protein. Biomacromolecules. 25(3), 1759–1774.","short":"D. Wu, A. Koscic, S. Schneider, R.C.A. Dubini, D.C. Rodriguez Camargo, S. Schneider, P. Rovo, Biomacromolecules 25 (2024) 1759–1774.","chicago":"Wu, Dongqing, Anamaria Koscic, Sonja Schneider, Romeo C. A. Dubini, Diana C. Rodriguez Camargo, Sabine Schneider, and Petra Rovo. “Unveiling the Dynamic Self-Assembly of a Recombinant Dragline-Silk-Mimicking Protein.” <i>Biomacromolecules</i>. American Chemical Society, 2024. <a href=\"https://doi.org/10.1021/acs.biomac.3c01239\">https://doi.org/10.1021/acs.biomac.3c01239</a>.","apa":"Wu, D., Koscic, A., Schneider, S., Dubini, R. C. A., Rodriguez Camargo, D. C., Schneider, S., &#38; Rovo, P. (2024). Unveiling the dynamic self-assembly of a recombinant dragline-silk-mimicking protein. <i>Biomacromolecules</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.biomac.3c01239\">https://doi.org/10.1021/acs.biomac.3c01239</a>","ieee":"D. Wu <i>et al.</i>, “Unveiling the dynamic self-assembly of a recombinant dragline-silk-mimicking protein,” <i>Biomacromolecules</i>, vol. 25, no. 3. American Chemical Society, pp. 1759–1774, 2024.","ama":"Wu D, Koscic A, Schneider S, et al. Unveiling the dynamic self-assembly of a recombinant dragline-silk-mimicking protein. <i>Biomacromolecules</i>. 2024;25(3):1759-1774. doi:<a href=\"https://doi.org/10.1021/acs.biomac.3c01239\">10.1021/acs.biomac.3c01239</a>"},"publication_identifier":{"eissn":["1526-4602"],"issn":["1525-7797"]},"year":"2024","type":"journal_article","file_date_updated":"2024-10-07T08:33:35Z","day":"11","date_updated":"2025-09-08T09:52:18Z","has_accepted_license":"1","department":[{"_id":"NMR"}],"date_published":"2024-03-11T00:00:00Z","language":[{"iso":"eng"}],"corr_author":"1","isi":1,"month":"03","publication":"Biomacromolecules","oa":1,"status":"public","quality_controlled":"1","ddc":["540"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"18168","page":"1759-1774","scopus_import":"1","date_created":"2024-10-02T10:09:53Z","acknowledgement":"We thank Dr. Pavel Kielkowski for performing the MS/MS measurement and providing feedback on the manuscript. We are grateful to Rodrigo Ledesma Amaro for introducing the Golden Gate Assembly technique in our lab. We acknowledge the support from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation)─SFB 1309-325871075, the Center for NanoScience (CeNS), the Fonds der Chemischen Industrie, and Universitätsgesellschaft München.","article_type":"original","abstract":[{"lang":"eng","text":"Despite the considerable interest in the recombinant production of synthetic spider silk fibers that possess mechanical properties similar to those of native spider silks, such as the cost-effectiveness, tunability, and scalability realization, is still lacking. To address this long-standing challenge, we have constructed an artificial spider silk gene using Golden Gate assembly for the recombinant bacterial production of dragline-mimicking silk, incorporating all the essential components: the N-terminal domain, a 33-residue-long major-ampullate-spidroin-inspired segment repeated 16 times, and the C-terminal domain (N16C). This designed silk-like protein was successfully expressed in Escherichia coli, purified, and cast into films from formic acid. We produced uniformly 13C–15N-labeled N16C films and employed solid-state magic-angle spinning nuclear magnetic resonance (NMR) for characterization. Thus, we could demonstrate that our bioengineered silk-like protein self-assembles into a film where, when hydrated, the solvent-exposed layer of the rigid, β-nanocrystalline polyalanine core undergoes a transition to an α-helical structure, gaining mobility to the extent that it fully dissolves in water and transforms into a highly dynamic random coil. This hydration-induced behavior induces chain dynamics in the glycine-rich amorphous soft segments on the microsecond time scale, contributing to the elasticity of the solid material. Our findings not only reveal the presence of structurally and dynamically distinct segments within the film’s superstructure but also highlight the complexity of the self-organization responsible for the exceptional mechanical properties observed in proteins that mimic dragline silk."}],"publisher":"American Chemical Society","external_id":{"pmid":["38343096"],"isi":["001166501000001"]},"pmid":1,"doi":"10.1021/acs.biomac.3c01239","author":[{"first_name":"Dongqing","last_name":"Wu","full_name":"Wu, Dongqing"},{"full_name":"Koscic, Anamaria","last_name":"Koscic","first_name":"Anamaria"},{"last_name":"Schneider","full_name":"Schneider, Sonja","first_name":"Sonja"},{"first_name":"Romeo C. A.","last_name":"Dubini","full_name":"Dubini, Romeo C. A."},{"full_name":"Rodriguez Camargo, Diana C.","last_name":"Rodriguez Camargo","first_name":"Diana C."},{"full_name":"Schneider, Sabine","last_name":"Schneider","first_name":"Sabine"},{"id":"c316e53f-b965-11eb-b128-bb26acc59c00","first_name":"Petra","full_name":"Rovo, Petra","last_name":"Rovo","orcid":"0000-0001-8729-7326"}],"file":[{"checksum":"9552b6d52f1e8a350764849a535fc13e","file_size":6597227,"content_type":"application/pdf","file_id":"18180","relation":"main_file","access_level":"open_access","creator":"dernst","file_name":"2024_BioMacromolecules_Wu.pdf","date_updated":"2024-10-07T08:33:35Z","date_created":"2024-10-07T08:33:35Z","success":1}],"oa_version":"Published Version","issue":"3","publication_status":"published","intvolume":"        25"},{"date_created":"2024-10-06T22:01:11Z","scopus_import":"1","_id":"18171","abstract":[{"lang":"eng","text":"Defense against pathogens and parasites requires substantial investment of energy and resources on part of the host. This makes the host immune function dependent on availability and accessibility of resources. A resource deprived host is therefore expected to be more susceptible to infections, although empirical results do not always align with this prediction. Limiting host access to resources can additionally impact within-host pathogen numbers, either directly by altering the amount of resources available to the pathogens for proliferation or indirectly by altering the efficiency of the host immune system. We tested for the effects of host starvation (complete deprivation of resources) on susceptibility to bacterial pathogens, and within-host pathogen proliferation, in Drosophila melanogaster females. Our results show that starvation increases post-infection mortality of the host, but in a pathogen-specific manner. This increase in mortality is always accompanied by increased within-host pathogen proliferation. We therefore propose that starvation compromises host resistance to bacterial infections in Drosophila melanogaster females thereby increasing susceptibility to infections."}],"article_type":"original","acknowledgement":"The authors thank Tejashwini Hegde for logistical support during execution of the experiments reported here. The authors thank Prof. P. Cornelis (Vrije Universiteit Brussel, Belgium) for providing the Pseudomonas entomophila isolate, Dr. Elio Sucena and Tania Paulo (Instituto Gulbenkian Ciencia, Portugal) for providing the Erwinia c. carotovora, and Prof. Brian Lazzaro (Cornell University, USA) for providing the Enterococcus faecalis and Providencia rettgeri isolates, and Dr. Karan Singh (IISER Mohali, India) for isolating the Staphylococcus succinus isolate used in the experiments. The authors also thank Dr. Manas Geeta Arun for maintenance of the LH fly populations used in this study.\r\nThe study was funded by intra-mural funding from IISER Mohali, India, to NGP. AB was supported by Senior Research Fellowship for PhD students from CSIR, Govt. of India. AS was supported by Senior Research Fellowship for PhD students from UGC, Govt. of India. SS and TM were supported by KVPY fellowships for undergraduate studies from DST, Govt. of India.","publisher":"Elsevier","isi":1,"corr_author":"1","status":"public","publication":"Journal of Invertebrate Pathology","month":"11","quality_controlled":"1","publication_identifier":{"issn":["0022-2011"],"eissn":["1096-0805"]},"year":"2024","type":"journal_article","day":"01","date_updated":"2025-09-08T09:53:50Z","department":[{"_id":"SyCr"}],"date_published":"2024-11-01T00:00:00Z","language":[{"iso":"eng"}],"OA_type":"closed access","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","volume":207,"citation":{"short":"A. Basu, A. Singh, S. Sehgal, T. Madaan, N.G. Prasad, Journal of Invertebrate Pathology 207 (2024).","ista":"Basu A, Singh A, Sehgal S, Madaan T, Prasad NG. 2024. Starvation increases susceptibility to bacterial infection and promotes systemic pathogen proliferation in Drosophila melanogaster females. Journal of Invertebrate Pathology. 207(11), 108209.","mla":"Basu, Aabeer, et al. “Starvation Increases Susceptibility to Bacterial Infection and Promotes Systemic Pathogen Proliferation in Drosophila Melanogaster Females.” <i>Journal of Invertebrate Pathology</i>, vol. 207, no. 11, 108209, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.jip.2024.108209\">10.1016/j.jip.2024.108209</a>.","apa":"Basu, A., Singh, A., Sehgal, S., Madaan, T., &#38; Prasad, N. G. (2024). Starvation increases susceptibility to bacterial infection and promotes systemic pathogen proliferation in Drosophila melanogaster females. <i>Journal of Invertebrate Pathology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jip.2024.108209\">https://doi.org/10.1016/j.jip.2024.108209</a>","ieee":"A. Basu, A. Singh, S. Sehgal, T. Madaan, and N. G. Prasad, “Starvation increases susceptibility to bacterial infection and promotes systemic pathogen proliferation in Drosophila melanogaster females,” <i>Journal of Invertebrate Pathology</i>, vol. 207, no. 11. Elsevier, 2024.","ama":"Basu A, Singh A, Sehgal S, Madaan T, Prasad NG. Starvation increases susceptibility to bacterial infection and promotes systemic pathogen proliferation in Drosophila melanogaster females. <i>Journal of Invertebrate Pathology</i>. 2024;207(11). doi:<a href=\"https://doi.org/10.1016/j.jip.2024.108209\">10.1016/j.jip.2024.108209</a>","chicago":"Basu, Aabeer, Aparajita Singh, Suhaas Sehgal, Tanvi Madaan, and Nagaraj Guru Prasad. “Starvation Increases Susceptibility to Bacterial Infection and Promotes Systemic Pathogen Proliferation in Drosophila Melanogaster Females.” <i>Journal of Invertebrate Pathology</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.jip.2024.108209\">https://doi.org/10.1016/j.jip.2024.108209</a>."},"title":"Starvation increases susceptibility to bacterial infection and promotes systemic pathogen proliferation in Drosophila melanogaster females","publication_status":"published","article_number":"108209","issue":"11","intvolume":"       207","doi":"10.1016/j.jip.2024.108209","author":[{"first_name":"Aabeer","full_name":"Basu, Aabeer","last_name":"Basu"},{"first_name":"Aparajita","full_name":"Singh, Aparajita","last_name":"Singh"},{"first_name":"Suhaas","last_name":"Sehgal","full_name":"Sehgal, Suhaas"},{"full_name":"Madaan, Tanvi","last_name":"Madaan","id":"419917ac-5355-11ee-ae5a-c952babcaad9","first_name":"Tanvi"},{"first_name":"Nagaraj Guru","full_name":"Prasad, Nagaraj Guru","last_name":"Prasad"}],"oa_version":"None","external_id":{"pmid":["39322010"],"isi":["001327816900001"]},"pmid":1},{"intvolume":"       534","PlanS_conform":"1","issue":"2","publication_status":"published","arxiv":1,"DOAJ_listed":"1","external_id":{"arxiv":["2409.01157"],"isi":["001320536900011"]},"oa_version":"Published Version","file":[{"checksum":"b79f3c6a5991516abbcc8d34fa4bfb5f","file_size":2813008,"content_type":"application/pdf","file_id":"18182","access_level":"open_access","relation":"main_file","file_name":"2024_MonthlyNRoyalAstronSoc_Hatt.pdf","creator":"dernst","success":1,"date_created":"2024-10-07T09:14:03Z","date_updated":"2024-10-07T09:14:03Z"}],"author":[{"first_name":"Emily J.","last_name":"Hatt","full_name":"Hatt, Emily J."},{"last_name":"Ong","full_name":"Ong, J. M.Joel","first_name":"J. M.Joel"},{"first_name":"Martin B.","last_name":"Nielsen","full_name":"Nielsen, Martin B."},{"first_name":"William J.","full_name":"Chaplin, William J.","last_name":"Chaplin"},{"full_name":"Davies, Guy R.","last_name":"Davies","first_name":"Guy R."},{"first_name":"Sébastien","full_name":"Deheuvels, Sébastien","last_name":"Deheuvels"},{"first_name":"Jérôme","full_name":"Ballot, Jérôme","last_name":"Ballot"},{"full_name":"Li, Gang","last_name":"Li","first_name":"Gang"},{"id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle","full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000","last_name":"Bugnet"}],"doi":"10.1093/mnras/stae2053","quality_controlled":"1","ddc":["520"],"month":"10","publication":"Monthly Notices of the Royal Astronomical Society","oa":1,"status":"public","isi":1,"publisher":"Oxford University Press","acknowledgement":"EJH, WJC, and GRD acknowledge the support of Science and Technology Facilities Council. MBN acknowledges support from the UK Space Agency. JMJO acknowledges support from NASA through the NASA Hubble Fellowship grant HST-HF2-51517.001, awarded by STScI (Space Telescope Science Institute), which is operated by the Association of Universities for Research in Astronomy, Incorporated, under NASA contract NAS5-26555. The authors acknowledge use of the Blue-BEAR HPC service at the University of Birmingham. This paper includes data collected by the Kepler mission and obtained from the MAST data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler mission was provided by the NASA Science Mission Directorate. This work has made use of data from the European Space Agency (ESA) mission Gaia (https://www.cosmos.esa.int/web/gaia), processed by the Gaia Data Processing and Analysis Consortium (DPAC, https://www.cosmos.esa.int/web/gaia/dpac/consortium). Funding for the DPAC was provided by national institutions, in particular the institutions participating in the Gaia Multilateral Agreement. This paper received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (CartographY GA. 804752). SD and JB acknowledge support from the Centre National d’Etudes Spatiales (CNES).","article_type":"original","abstract":[{"text":"Red Giant stars host solar-like oscillations which have mixed character, being sensitive to conditions both in the outer convection zone and deep within the interior. The properties of these modes are sensitive to both core rotation and magnetic fields. While asteroseismic studies of the former have been done on a large scale, studies of the latter are currently limited to tens of stars. We aim to produce the first large catalogue of both magnetic and rotational perturbations. We jointly constrain these parameters by devising an automated method for fitting the power spectra directly. We successfully apply the method to 302 low-luminosity red giants. We find a clear bimodality in core rotation rate. The primary peak is at δνrot = 0.32 μHz, and the secondary at δνrot = 0.47 μHz. Combining our results with literature values, we find that the percentage of stars rotating much more rapidly than the population average increases with evolutionary state. We measure magnetic splittings of 2σ significance in 23 stars. While the most extreme magnetic splitting values appear in stars with masses > 1.1M⊙, implying they formerly hosted a convective core, a small but statistically significant magnetic splitting is measured at lower masses. Asymmetry between the frequencies of a rotationally split multiplet has previously been used to diagnose the presence of a magnetic perturbation. We find that of the stars with a significant detection of magnetic perturbation, 43\\% do not show strong asymmetry. We find no strong evidence of correlation between the rotation and magnetic parameters.","lang":"eng"}],"OA_place":"publisher","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"18172","scopus_import":"1","date_created":"2024-10-06T22:01:11Z","page":"1060-1076","title":"Asteroseismic signatures of core magnetism and rotation in hundreds of low-luminosity red giants","citation":{"mla":"Hatt, Emily J., et al. “Asteroseismic Signatures of Core Magnetism and Rotation in Hundreds of Low-Luminosity Red Giants.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 534, no. 2, Oxford University Press, 2024, pp. 1060–76, doi:<a href=\"https://doi.org/10.1093/mnras/stae2053\">10.1093/mnras/stae2053</a>.","ista":"Hatt EJ, Ong JMJ, Nielsen MB, Chaplin WJ, Davies GR, Deheuvels S, Ballot J, Li G, Bugnet LA. 2024. Asteroseismic signatures of core magnetism and rotation in hundreds of low-luminosity red giants. Monthly Notices of the Royal Astronomical Society. 534(2), 1060–1076.","short":"E.J. Hatt, J.M.J. Ong, M.B. Nielsen, W.J. Chaplin, G.R. Davies, S. Deheuvels, J. Ballot, G. Li, L.A. Bugnet, Monthly Notices of the Royal Astronomical Society 534 (2024) 1060–1076.","apa":"Hatt, E. J., Ong, J. M. J., Nielsen, M. B., Chaplin, W. J., Davies, G. R., Deheuvels, S., … Bugnet, L. A. (2024). Asteroseismic signatures of core magnetism and rotation in hundreds of low-luminosity red giants. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stae2053\">https://doi.org/10.1093/mnras/stae2053</a>","ama":"Hatt EJ, Ong JMJ, Nielsen MB, et al. Asteroseismic signatures of core magnetism and rotation in hundreds of low-luminosity red giants. <i>Monthly Notices of the Royal Astronomical Society</i>. 2024;534(2):1060-1076. doi:<a href=\"https://doi.org/10.1093/mnras/stae2053\">10.1093/mnras/stae2053</a>","ieee":"E. J. Hatt <i>et al.</i>, “Asteroseismic signatures of core magnetism and rotation in hundreds of low-luminosity red giants,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 534, no. 2. Oxford University Press, pp. 1060–1076, 2024.","chicago":"Hatt, Emily J., J. M.Joel Ong, Martin B. Nielsen, William J. Chaplin, Guy R. Davies, Sébastien Deheuvels, Jérôme Ballot, Gang Li, and Lisa Annabelle Bugnet. “Asteroseismic Signatures of Core Magnetism and Rotation in Hundreds of Low-Luminosity Red Giants.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2024. <a href=\"https://doi.org/10.1093/mnras/stae2053\">https://doi.org/10.1093/mnras/stae2053</a>."},"volume":534,"article_processing_charge":"Yes","OA_type":"gold","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"date_published":"2024-10-01T00:00:00Z","department":[{"_id":"LiBu"}],"has_accepted_license":"1","file_date_updated":"2024-10-07T09:14:03Z","day":"01","date_updated":"2025-09-08T09:53:01Z","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"type":"journal_article","year":"2024"},{"ddc":["530"],"quality_controlled":"1","status":"public","oa":1,"publication":"The Journal of chemical physics","month":"09","isi":1,"corr_author":"1","publisher":"AIP Publishing","acknowledgement":"The computational results presented here were enabled via a generous share of CPU time, offered by the Vienna Scientific Cluster (VSC) under Project No. 71263. The authors thank Ms. Katrin Muck for her guidance related to the use of HPC. A.J.A. gratefully acknowledges support from the EPSRC under Grant No. EP/P015689/1.","article_type":"original","abstract":[{"text":"We investigate the phase ordering (pattern formation) of systems of two-dimensional core–shell particles using Monte Carlo (MC) computer simulations and classical density functional theory (DFT). The particles interact via a pair potential having a hard core and a repulsive square shoulder. Our simulations show that on cooling, the liquid state structure becomes increasingly characterized by long wavelength density modulations and on further cooling forms a variety of other phases, including clustered, striped, and other patterned phases. In DFT, the hard core part of the potential is treated using either fundamental measure theory or a simple local density approximation, whereas the soft shoulder is treated using the random phase approximation. The different DFTs are benchmarked using large-scale grand-canonical-MC and Gibbs-ensemble-MC simulations, demonstrating their predictive capabilities and shortcomings. We find that having the liquid state static structure factor S(k) for wavenumber k is sufficient to identify the Fourier modes governing both the liquid and solid phases. This allows us to identify from easier-to-obtain liquid state data the wavenumbers relevant to the periodic phases and to predict roughly where in the phase diagram these patterned phases arise.","lang":"eng"}],"date_created":"2024-10-06T22:01:12Z","scopus_import":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"18174","citation":{"short":"M. Wassermair, G. Kahl, R. Roth, A.J. Archer, The Journal of Chemical Physics 161 (2024).","mla":"Wassermair, Michael, et al. “Fingerprints of Ordered Self-Assembled Structures in the Liquid Phase of a Hard-Core, Square-Shoulder System.” <i>The Journal of Chemical Physics</i>, vol. 161, no. 12, 124503, AIP Publishing, 2024, doi:<a href=\"https://doi.org/10.1063/5.0226954\">10.1063/5.0226954</a>.","ista":"Wassermair M, Kahl G, Roth R, Archer AJ. 2024. Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system. The Journal of chemical physics. 161(12), 124503.","ieee":"M. Wassermair, G. Kahl, R. Roth, and A. J. Archer, “Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system,” <i>The Journal of chemical physics</i>, vol. 161, no. 12. AIP Publishing, 2024.","ama":"Wassermair M, Kahl G, Roth R, Archer AJ. Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system. <i>The Journal of chemical physics</i>. 2024;161(12). doi:<a href=\"https://doi.org/10.1063/5.0226954\">10.1063/5.0226954</a>","apa":"Wassermair, M., Kahl, G., Roth, R., &#38; Archer, A. J. (2024). Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0226954\">https://doi.org/10.1063/5.0226954</a>","chicago":"Wassermair, Michael, Gerhard Kahl, Roland Roth, and Andrew J. Archer. “Fingerprints of Ordered Self-Assembled Structures in the Liquid Phase of a Hard-Core, Square-Shoulder System.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2024. <a href=\"https://doi.org/10.1063/5.0226954\">https://doi.org/10.1063/5.0226954</a>."},"title":"Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system","volume":161,"article_processing_charge":"Yes (in subscription journal)","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"date_published":"2024-09-28T00:00:00Z","department":[{"_id":"GradSch"}],"has_accepted_license":"1","day":"28","date_updated":"2025-09-08T09:55:52Z","file_date_updated":"2024-10-07T11:25:00Z","type":"journal_article","year":"2024","publication_identifier":{"eissn":["1089-7690"]},"intvolume":"       161","article_number":"124503 ","publication_status":"published","issue":"12","arxiv":1,"pmid":1,"external_id":{"arxiv":["2409.06447"],"pmid":["39344889"],"isi":["001325268300004"]},"oa_version":"Published Version","author":[{"id":"23d132c4-4e98-11ef-b275-9e8d4cd8c917","first_name":"Michael","full_name":"Wassermair, Michael","last_name":"Wassermair"},{"last_name":"Kahl","full_name":"Kahl, Gerhard","first_name":"Gerhard"},{"first_name":"Roland","full_name":"Roth, Roland","last_name":"Roth"},{"first_name":"Andrew J.","last_name":"Archer","full_name":"Archer, Andrew J."}],"file":[{"checksum":"f3874e64ef94e94b2376f00a1fee24c3","file_id":"18185","content_type":"application/pdf","file_size":15009000,"access_level":"open_access","relation":"main_file","success":1,"date_created":"2024-10-07T11:25:00Z","date_updated":"2024-10-07T11:25:00Z","file_name":"2024_JourChemicalPhysics_Wassermair.pdf","creator":"dernst"}],"doi":"10.1063/5.0226954"},{"article_processing_charge":"No","conference":{"location":"Vienna, Austria","end_date":"2024-09-20","name":"ECOOP: European Conference on Object-Oriented Programming","start_date":"2024-09-16"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The fault in our stars: Designing reproducible large-scale code analysis experiments","citation":{"short":"P. Maj, S. Muroya Lei, K. Siek, L. Di Grazia, J. Vitek, in:, 38th European Conference on Object-Oriented Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Maj P, Muroya Lei S, Siek K, Di Grazia L, Vitek J. 2024. The fault in our stars: Designing reproducible large-scale code analysis experiments. 38th European Conference on Object-Oriented Programming. ECOOP: European Conference on Object-Oriented Programming, LIPIcs, vol. 313, 27.","mla":"Maj, Petr, et al. “The Fault in Our Stars: Designing Reproducible Large-Scale Code Analysis Experiments.” <i>38th European Conference on Object-Oriented Programming</i>, vol. 313, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ECOOP.2024.27\">10.4230/LIPIcs.ECOOP.2024.27</a>.","apa":"Maj, P., Muroya Lei, S., Siek, K., Di Grazia, L., &#38; Vitek, J. (2024). The fault in our stars: Designing reproducible large-scale code analysis experiments. In <i>38th European Conference on Object-Oriented Programming</i> (Vol. 313). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ECOOP.2024.27\">https://doi.org/10.4230/LIPIcs.ECOOP.2024.27</a>","ieee":"P. Maj, S. Muroya Lei, K. Siek, L. Di Grazia, and J. Vitek, “The fault in our stars: Designing reproducible large-scale code analysis experiments,” in <i>38th European Conference on Object-Oriented Programming</i>, Vienna, Austria, 2024, vol. 313.","ama":"Maj P, Muroya Lei S, Siek K, Di Grazia L, Vitek J. The fault in our stars: Designing reproducible large-scale code analysis experiments. In: <i>38th European Conference on Object-Oriented Programming</i>. Vol 313. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ECOOP.2024.27\">10.4230/LIPIcs.ECOOP.2024.27</a>","chicago":"Maj, Petr, Stefanie Muroya Lei, Konrad Siek, Luca Di Grazia, and Jan Vitek. “The Fault in Our Stars: Designing Reproducible Large-Scale Code Analysis Experiments.” In <i>38th European Conference on Object-Oriented Programming</i>, Vol. 313. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.ECOOP.2024.27\">https://doi.org/10.4230/LIPIcs.ECOOP.2024.27</a>."},"volume":313,"file_date_updated":"2024-10-07T11:10:55Z","date_updated":"2025-12-02T13:48:19Z","day":"01","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773416"]},"year":"2024","type":"conference","date_published":"2024-09-01T00:00:00Z","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"ToHe"}],"month":"09","publication":"38th European Conference on Object-Oriented Programming","status":"public","oa":1,"isi":1,"ddc":["000"],"quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"18175","date_created":"2024-10-06T22:01:12Z","scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":"This work was supported by the Czech Ministry of Education, Youth and Sports under\r\nprogram ERC-CZ, grant agreement LL2325, BigCode (reg. no. CZ.02.1.01/0.0/0.0/15_003/0000421). NSF grants CCF-1910850, CNS-1925644, and CCF-2139612, as well as the GACR EXPRO grant 23-07580X. We would like to thank Digital Ocean for their involuntary contribution of computational resources during the early data gathering phase of our research. We acknoweldge the reviewers of ICSE’22, and thank the reviewers of ECOOP’23 for their encouragments and for sticking around until 2024.","abstract":[{"lang":"eng","text":"Large-scale software repositories are a source of insights for software engineering. They offer an unmatched window into the software development process at scale. Their sheer number and size holds the promise of broadly applicable results. At the same time, that very size presents practical challenges for scaling tools and algorithms to millions of projects. A reasonable approach is to limit studies to representative samples of the population of interest. Broadly applicable conclusions can then be obtained by generalizing to the entire population. The contribution of this paper is a standardized experimental design methodology for choosing the inputs of studies working with large-scale repositories. We advocate for a methodology that clearly lays out what the population of interest is, how to sample it, and that fosters reproducibility. Along the way, we discourage researchers from using extrinsic attributes of projects such as stars, that measure some unclear notion of popularity."}],"external_id":{"isi":["001533999700027"]},"file":[{"date_created":"2024-10-07T11:10:55Z","success":1,"date_updated":"2024-10-07T11:10:55Z","creator":"dernst","file_name":"2024_LIPICs_Maj.pdf","file_id":"18184","content_type":"application/pdf","file_size":1764222,"relation":"main_file","access_level":"open_access","checksum":"2e75d305a8c817d76a0c7f136ce34f86"}],"author":[{"first_name":"Petr","last_name":"Maj","full_name":"Maj, Petr"},{"last_name":"Muroya Lei","full_name":"Muroya Lei, Stefanie","first_name":"Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff"},{"first_name":"Konrad","full_name":"Siek, Konrad","last_name":"Siek"},{"first_name":"Luca","full_name":"Di Grazia, Luca","last_name":"Di Grazia"},{"first_name":"Jan","last_name":"Vitek","full_name":"Vitek, Jan"}],"doi":"10.4230/LIPIcs.ECOOP.2024.27","oa_version":"Published Version","alternative_title":["LIPIcs"],"publication_status":"published","article_number":"27","intvolume":"       313"},{"has_accepted_license":"1","department":[{"_id":"MaSe"}],"language":[{"iso":"eng"}],"date_published":"2024-09-25T00:00:00Z","year":"2024","type":"journal_article","publication_identifier":{"eissn":["2691-3399"]},"file_date_updated":"2024-10-07T11:04:12Z","day":"25","date_updated":"2025-09-08T09:55:09Z","project":[{"call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}],"volume":5,"title":"Quantum many-body spin ratchets","citation":{"ama":"Zadnik L, Ljubotina M, Krajnik Ž, Ilievski E, Prosen T. Quantum many-body spin ratchets. <i>PRX Quantum</i>. 2024;5(3). doi:<a href=\"https://doi.org/10.1103/PRXQuantum.5.030356\">10.1103/PRXQuantum.5.030356</a>","chicago":"Zadnik, Lenart, Marko Ljubotina, Žiga Krajnik, Enej Ilievski, and Tomaž Prosen. “Quantum Many-Body Spin Ratchets.” <i>PRX Quantum</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PRXQuantum.5.030356\">https://doi.org/10.1103/PRXQuantum.5.030356</a>.","ieee":"L. Zadnik, M. Ljubotina, Ž. Krajnik, E. Ilievski, and T. Prosen, “Quantum many-body spin ratchets,” <i>PRX Quantum</i>, vol. 5, no. 3. American Physical Society, 2024.","apa":"Zadnik, L., Ljubotina, M., Krajnik, Ž., Ilievski, E., &#38; Prosen, T. (2024). Quantum many-body spin ratchets. <i>PRX Quantum</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PRXQuantum.5.030356\">https://doi.org/10.1103/PRXQuantum.5.030356</a>","short":"L. Zadnik, M. Ljubotina, Ž. Krajnik, E. Ilievski, T. Prosen, PRX Quantum 5 (2024).","mla":"Zadnik, Lenart, et al. “Quantum Many-Body Spin Ratchets.” <i>PRX Quantum</i>, vol. 5, no. 3, 030356, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PRXQuantum.5.030356\">10.1103/PRXQuantum.5.030356</a>.","ista":"Zadnik L, Ljubotina M, Krajnik Ž, Ilievski E, Prosen T. 2024. Quantum many-body spin ratchets. PRX Quantum. 5(3), 030356."},"OA_type":"gold","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"Yes","ec_funded":1,"article_type":"original","abstract":[{"text":"Introducing a class of SU(2) invariant quantum unitary circuits generating chiral transport, we examine the role of broken space-reflection and time-reversal symmetries on spin-transport properties. Upon adjusting parameters of local unitary gates, the dynamics can be either chaotic or integrable. The latter corresponds to a generalization of the space-time discretized (Trotterized) higher-spin quantum Heisenberg chain. We demonstrate that breaking of space-reflection symmetry results in a drift in the dynamical spin susceptibility. Remarkably, we find a universal drift velocity given by a simple formula, which, at zero average magnetization, depends only on the values of SU(2) Casimir invariants associated with local spins. In the integrable case, the drift velocity formula is confirmed analytically based on the exact solution of thermodynamic Bethe ansatz equations. Finally, by inspecting the large fluctuations of the time-integrated current between two halves of the system in stationary maximum-entropy states, we demonstrate violation of the Gallavotti-Cohen symmetry, implying that such states cannot be regarded as equilibrium ones. We show that the scaled cumulant generating function of the time-integrated current instead obeys a generalized fluctuation relation.","lang":"eng"}],"acknowledgement":"The authors thank Denis Bernard, Jérôme Dubail, Hosho Katsura, Kareljan Schoutens, and Alberto Zorzato for stimulating discussions. This work has been supported by: Slovenian Research Agency (ARIS) under Grants No. N1-0219 (T.P., L.Z.), No. N1-0334 (T.P., L.Z.), No. N1-0243 (E.I.), and under Research Program P1-0402 (E.I., T.P., L.Z.). European Research Council (ERC) under Consolidator Grant No. 771536—NEMO (L.Z.), Advanced Grant No.\r\n101096208—QUEST (T.P., L.Z.), and Starting Grant No. 850899—NEQuM (M.L.). Simons Foundation under Simons Junior Fellowship Grant No. 1141511 (Ž.K.). M.L. acknowledges the hospitality of the Aspen Center for Physics, which is supported by National Science Foundation Grant No. PHY-2210452. Numerical simulations were performed using the ITensor library [117]. ","publisher":"American Physical Society","OA_place":"publisher","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"18176","scopus_import":"1","date_created":"2024-10-06T22:01:12Z","quality_controlled":"1","ddc":["530"],"isi":1,"month":"09","publication":"PRX Quantum","status":"public","oa":1,"oa_version":"Published Version","doi":"10.1103/PRXQuantum.5.030356","file":[{"creator":"dernst","file_name":"2024_PRXQuantum_Zadnik.pdf","date_updated":"2024-10-07T11:04:12Z","date_created":"2024-10-07T11:04:12Z","success":1,"checksum":"bc230631255d3bcf8bcbbc8fdbfefcf2","file_size":1061648,"content_type":"application/pdf","file_id":"18183","relation":"main_file","access_level":"open_access"}],"author":[{"first_name":"Lenart","last_name":"Zadnik","full_name":"Zadnik, Lenart"},{"orcid":"0000-0003-0038-7068","last_name":"Ljubotina","full_name":"Ljubotina, Marko","first_name":"Marko","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E"},{"first_name":"Žiga","full_name":"Krajnik, Žiga","last_name":"Krajnik"},{"full_name":"Ilievski, Enej","last_name":"Ilievski","first_name":"Enej"},{"full_name":"Prosen, Tomaž","last_name":"Prosen","first_name":"Tomaž"}],"external_id":{"isi":["001327172800001"],"arxiv":["2406.01571"]},"DOAJ_listed":"1","arxiv":1,"intvolume":"         5","issue":"3","article_number":"030356","publication_status":"published"},{"alternative_title":["LNBI"],"publication_status":"published","intvolume":"     14971","external_id":{"isi":["001333144400002"]},"doi":"10.1007/978-3-031-71671-3_2","author":[{"first_name":"Nikola","full_name":"Beneš, Nikola","last_name":"Beneš"},{"full_name":"Brim, Luboš","last_name":"Brim","first_name":"Luboš"},{"first_name":"Ondřej","last_name":"Huvar","full_name":"Huvar, Ondřej"},{"id":"07c5ea74-f61c-11ec-a664-aa7c5d957b2b","first_name":"Samuel","full_name":"Pastva, Samuel","orcid":"0000-0003-1993-0331","last_name":"Pastva"},{"last_name":"Šafránek","full_name":"Šafránek, David","first_name":"David"}],"oa_version":"None","isi":1,"month":"09","publication":"Computational Methods in Systems Biology","status":"public","quality_controlled":"1","_id":"18177","scopus_import":"1","page":"19-26","date_created":"2024-10-06T22:01:12Z","ec_funded":1,"acknowledgement":"The work has been supported by the Czech Science Foundation grant No. GA22-10845S. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 101034413.","abstract":[{"text":"Partially Specified Boolean Networks (PSBNs) represent a family of Boolean models resulting from possible interpretations of unknown update logics. Hybrid extension of CTL (HCTL) has the power to express complex dynamical phenomena, such as oscillations or stability. We present BNClassifier to classify Boolean Networks corresponding to a given PSBN according to criteria specified in HCTL. The implementation of the tool is fully symbolic (based on BDDs). The results are visualised using the machine-learning-based technology of decision trees.","lang":"eng"}],"publisher":"Springer Nature","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"volume":14971,"title":"BNClassifier: Classifying boolean models by dynamic properties","citation":{"apa":"Beneš, N., Brim, L., Huvar, O., Pastva, S., &#38; Šafránek, D. (2024). BNClassifier: Classifying boolean models by dynamic properties. In <i>Computational Methods in Systems Biology</i> (Vol. 14971, pp. 19–26). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-71671-3_2\">https://doi.org/10.1007/978-3-031-71671-3_2</a>","ama":"Beneš N, Brim L, Huvar O, Pastva S, Šafránek D. BNClassifier: Classifying boolean models by dynamic properties. In: <i>Computational Methods in Systems Biology</i>. Vol 14971. Springer Nature; 2024:19-26. doi:<a href=\"https://doi.org/10.1007/978-3-031-71671-3_2\">10.1007/978-3-031-71671-3_2</a>","ieee":"N. Beneš, L. Brim, O. Huvar, S. Pastva, and D. Šafránek, “BNClassifier: Classifying boolean models by dynamic properties,” in <i>Computational Methods in Systems Biology</i>, 2024, vol. 14971, pp. 19–26.","chicago":"Beneš, Nikola, Luboš Brim, Ondřej Huvar, Samuel Pastva, and David Šafránek. “BNClassifier: Classifying Boolean Models by Dynamic Properties.” In <i>Computational Methods in Systems Biology</i>, 14971:19–26. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-71671-3_2\">https://doi.org/10.1007/978-3-031-71671-3_2</a>.","short":"N. Beneš, L. Brim, O. Huvar, S. Pastva, D. Šafránek, in:, Computational Methods in Systems Biology, Springer Nature, 2024, pp. 19–26.","mla":"Beneš, Nikola, et al. “BNClassifier: Classifying Boolean Models by Dynamic Properties.” <i>Computational Methods in Systems Biology</i>, vol. 14971, Springer Nature, 2024, pp. 19–26, doi:<a href=\"https://doi.org/10.1007/978-3-031-71671-3_2\">10.1007/978-3-031-71671-3_2</a>.","ista":"Beneš N, Brim L, Huvar O, Pastva S, Šafránek D. 2024. BNClassifier: Classifying boolean models by dynamic properties. Computational Methods in Systems Biology. , LNBI, vol. 14971, 19–26."},"year":"2024","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031716706"],"eissn":["1611-3349"]},"type":"conference","day":"19","date_updated":"2025-09-08T09:54:27Z","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"date_published":"2024-09-19T00:00:00Z"},{"year":"2024","type":"research_data","contributor":[{"first_name":"Olena","id":"3F8ABDDA-F248-11E8-B48F-1D18A9856A87","last_name":"Kim","contributor_type":"researcher"},{"id":"3337E116-F248-11E8-B48F-1D18A9856A87","first_name":"Yuji","orcid":"0000-0003-0408-6094","last_name":"Okamoto","contributor_type":"researcher"},{"first_name":"Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","orcid":"0000-0001-9735-5315","last_name":"Kaufmann"},{"first_name":"Nils ","contributor_type":"researcher","last_name":"Brose"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","contributor_type":"researcher","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","contributor_type":"supervisor","last_name":"Jonas","orcid":"0000-0001-5001-4804"}],"day":"11","date_updated":"2026-04-16T12:20:33Z","file_date_updated":"2024-10-11T10:04:23Z","has_accepted_license":"1","department":[{"_id":"PeJo"},{"_id":"RySh"},{"_id":"EM-Fac"}],"date_published":"2024-10-11T00:00:00Z","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","article_processing_charge":"No","project":[{"call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","grant_number":"692692"}],"citation":{"short":"O. Kim, (2024).","ista":"Kim O. 2024. Presynaptic cAMP-PKA-mediated potentiation induces reconfiguration of synaptic vesicle pools and channel-vesicle coupling at hippocampal mossy fiber boutons, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:18296\">10.15479/AT:ISTA:18296</a>.","mla":"Kim, Olena. <i>Presynaptic CAMP-PKA-Mediated Potentiation Induces Reconfiguration of Synaptic Vesicle Pools and Channel-Vesicle Coupling at Hippocampal Mossy Fiber Boutons</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:18296\">10.15479/AT:ISTA:18296</a>.","chicago":"Kim, Olena. “Presynaptic CAMP-PKA-Mediated Potentiation Induces Reconfiguration of Synaptic Vesicle Pools and Channel-Vesicle Coupling at Hippocampal Mossy Fiber Boutons.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/AT:ISTA:18296\">https://doi.org/10.15479/AT:ISTA:18296</a>.","ieee":"O. Kim, “Presynaptic cAMP-PKA-mediated potentiation induces reconfiguration of synaptic vesicle pools and channel-vesicle coupling at hippocampal mossy fiber boutons.” Institute of Science and Technology Austria, 2024.","apa":"Kim, O. (2024). Presynaptic cAMP-PKA-mediated potentiation induces reconfiguration of synaptic vesicle pools and channel-vesicle coupling at hippocampal mossy fiber boutons. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:18296\">https://doi.org/10.15479/AT:ISTA:18296</a>","ama":"Kim O. Presynaptic cAMP-PKA-mediated potentiation induces reconfiguration of synaptic vesicle pools and channel-vesicle coupling at hippocampal mossy fiber boutons. 2024. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:18296\">10.15479/AT:ISTA:18296</a>"},"title":"Presynaptic cAMP-PKA-mediated potentiation induces reconfiguration of synaptic vesicle pools and channel-vesicle coupling at hippocampal mossy fiber boutons","keyword":["Hippocampal mossy fiber synapses","short-term potentiation","long-term potentiation","presynaptic plasticity","electron microscopy","freeze-fracture replica labeling","paired recordings","forskolin","cyclic adenosine monophosphate (cAMP)","protein kinase A (PKA)","neuromodulation","synaptic vesicle pools","presynaptic Ca2+ channels","Munc13","docking","priming","active zone"],"date_created":"2024-10-11T10:12:17Z","_id":"18296","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"abstract":[{"lang":"eng","text":"It is widely believed that information storage in neuronal circuits involves nanoscopic structural changes at synapses, resulting in the formation of synaptic engrams. However, direct evidence for this hypothesis is lacking. To test this conjecture, we combined chemical potentiation, functional analysis by paired pre-postsynaptic recordings, and structural analysis by electron microscopy (EM) and freeze-fracture replica labeling (FRL) at the murine hippocampal mossy fiber synapse, a key synapse in the trisynaptic circuit of the hippocampus. Biophysical analysis of synaptic transmission revealed that forskolin-induced chemical potentiation increased the readily releasable vesicle pool size and vesicular release probability by 146% and 49%, respectively. Structural analysis of mossy fiber synapses by EM and FRL demonstrated an increase in the number of vesicles close to the plasma membrane and the number of clusters of the priming protein Munc13-1, indicating an increase in the number of both docked and primed vesicles. Furthermore, FRL analysis revealed a significant reduction of the distance between Munc13-1 and CaV2.1 Ca2+ channels, suggesting reconfiguration of the channel-vesicle coupling nanotopography. Our results indicate that presynaptic plasticity is associated with structural reorganization of active zones. We propose that changes in potential nanoscopic organization at synaptic vesicle release sites may be correlates of learning and memory at a plastic central synapse."}],"ec_funded":1,"publisher":"Institute of Science and Technology Austria","corr_author":"1","oa":1,"status":"public","month":"10","ddc":["570"],"doi":"10.15479/AT:ISTA:18296","author":[{"id":"3F8ABDDA-F248-11E8-B48F-1D18A9856A87","first_name":"Olena","full_name":"Kim, Olena","orcid":"0000-0003-2344-1039","last_name":"Kim"}],"file":[{"file_name":"Kim_et_al_2024_PlosBio_Source_data.zip","creator":"okim","date_updated":"2024-10-11T10:04:19Z","success":1,"date_created":"2024-10-11T10:04:19Z","content_type":"application/zip","file_size":164382,"file_id":"18297","relation":"main_file","access_level":"open_access","checksum":"0a977e7df54c418251b10dfd3f8a015c"},{"file_name":"info.txt","creator":"okim","date_created":"2024-10-11T10:04:23Z","date_updated":"2024-10-11T10:04:23Z","success":1,"checksum":"5b9343d6b2035ac3185e390fad4d3830","file_id":"18298","file_size":654,"content_type":"text/plain","access_level":"open_access","relation":"main_file"}],"oa_version":"Submitted Version","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"18603"}]}},{"alternative_title":["ISTA Master's Thesis"],"publication_status":"published","oa_version":"Published Version","doi":"10.15479/at:ista:18301","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"18469","file_size":8914218,"checksum":"80fb7923e229ad9d39253d7c8a8083d0","date_updated":"2024-10-24T14:34:42Z","date_created":"2024-10-24T14:34:42Z","success":1,"file_name":"thesis-arian-etemadi.pdf","creator":"aetemadi"},{"file_name":"thesis-arian-etemadi-latex-source.zip","creator":"aetemadi","date_updated":"2024-10-24T14:34:54Z","date_created":"2024-10-24T14:34:54Z","checksum":"1c02586ed7d441d5ec441867650568d1","relation":"source_file","access_level":"closed","file_id":"18470","file_size":9802650,"content_type":"application/x-zip-compressed"}],"author":[{"id":"36cea3aa-f38e-11ec-8ae0-c65ae6f6098f","first_name":"Arian","full_name":"Etemadihaghighi, Arian","last_name":"Etemadihaghighi"}],"related_material":{"record":[{"id":"17219","relation":"part_of_dissertation","status":"public"}]},"abstract":[{"text":"Physics simulation in computer graphics can bring triangle meshes into topologically invalid states. The method in this thesis contributed to Heiss-Synak* and Kalinov* et al. [2024] who devised a non-manifold hybrid surface tracker—a surface tracker that repairs explicit non-manifold triangle meshes with the help of the implicit domain. Specifically, this thesis provides an algorithm for filling the holes that are left after removing problematic parts of the mesh.","lang":"eng"}],"publisher":"Institute of Science and Technology Austria","supervisor":[{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J"}],"keyword":["surface tracking","non-manifold","hole-filling","topology change","multi-material","solid-modeling"],"degree_awarded":"MS","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","image":"/images/cc_by_sa.png"},"OA_place":"publisher","_id":"18301","date_created":"2024-10-11T19:52:20Z","page":"39","ddc":["000"],"corr_author":"1","license":"https://creativecommons.org/licenses/by-sa/4.0/","month":"10","oa":1,"status":"public","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"language":[{"iso":"eng"}],"date_published":"2024-10-15T00:00:00Z","publication_identifier":{"issn":["2791-4585"]},"type":"dissertation","year":"2024","file_date_updated":"2024-10-24T14:34:54Z","day":"15","date_updated":"2026-04-07T13:02:36Z","title":"Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking","citation":{"ama":"Etemadi A. Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18301\">10.15479/at:ista:18301</a>","ieee":"A. Etemadi, “Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking,” Institute of Science and Technology Austria, 2024.","chicago":"Etemadi, Arian. “Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18301\">https://doi.org/10.15479/at:ista:18301</a>.","apa":"Etemadi, A. (2024). <i>Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18301\">https://doi.org/10.15479/at:ista:18301</a>","short":"A. Etemadi, Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking, Institute of Science and Technology Austria, 2024.","mla":"Etemadi, Arian. <i>Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18301\">10.15479/at:ista:18301</a>.","ista":"Etemadi A. 2024. Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking. Institute of Science and Technology Austria."},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","article_processing_charge":"No"},{"_id":"18305","OA_place":"publisher","scopus_import":"1","date_created":"2024-10-13T22:01:49Z","publisher":"Society for Neuroscience","article_type":"original","abstract":[{"text":"Motor circuits represent the main output of the central nervous system and produce dynamic behaviors ranging from relatively simple rhythmic activities like swimming in fish and breathing in mammals to highly sophisticated dexterous movements in humans. Despite decades of research, the development and function of motor circuits remain poorly understood. Breakthroughs in the field recently provided new tools and tractable model systems that set the stage to discover the molecular mechanisms and circuit logic underlying motor control. Here, we describe recent advances from both vertebrate (mouse, frog) and invertebrate (nematode, fruit fly) systems on cellular and molecular mechanisms that enable motor circuits to develop and function and highlight conserved and divergent mechanisms necessary for motor circuit development.","lang":"eng"}],"acknowledgement":"Work in the authors’ labs is funded by the Helmholtz Association (N.Z.), National Institute of Neurological Disorders and Stroke (NINDS) R01NS116365 (P.K.), NINDS R01NS123439 and National Science Foundation IOS-2048080 (R.C.), NINDS R01NS114510 (P.P.), Natural Sciences and Engineering Research Council of Canada RGPIN-2021-03154 (K.M.) and Horizon Europe European Research Council Starting Grant Number 101041551 (L.B.S.). P.P. is the Weidenthal Family Designated Professor in Career Development.","month":"10","publication":"The Journal of Neuroscience","oa":1,"status":"public","isi":1,"quality_controlled":"1","ddc":["570"],"day":"02","date_updated":"2026-01-05T14:01:26Z","year":"2024","type":"journal_article","publication_identifier":{"eissn":["1529-2401"]},"date_published":"2024-10-02T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"LoSw"}],"has_accepted_license":"1","main_file_link":[{"url":"https://doi.org/10.1523/JNEUROSCI.1238-24.2024","open_access":"1"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"hybrid","title":"Molecular and cellular mechanisms of motor circuit development","citation":{"ieee":"P. Kratsios, N. Zampieri, R. Carrillo, K. Mizumoto, L. B. Sweeney, and P. Philippidou, “Molecular and cellular mechanisms of motor circuit development,” <i>The Journal of Neuroscience</i>, vol. 44, no. 40. Society for Neuroscience, 2024.","chicago":"Kratsios, Paschalis, Niccolò Zampieri, Robert Carrillo, Kota Mizumoto, Lora B. Sweeney, and Polyxeni Philippidou. “Molecular and Cellular Mechanisms of Motor Circuit Development.” <i>The Journal of Neuroscience</i>. Society for Neuroscience, 2024. <a href=\"https://doi.org/10.1523/JNEUROSCI.1238-24.2024\">https://doi.org/10.1523/JNEUROSCI.1238-24.2024</a>.","ama":"Kratsios P, Zampieri N, Carrillo R, Mizumoto K, Sweeney LB, Philippidou P. Molecular and cellular mechanisms of motor circuit development. <i>The Journal of Neuroscience</i>. 2024;44(40). doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1238-24.2024\">10.1523/JNEUROSCI.1238-24.2024</a>","apa":"Kratsios, P., Zampieri, N., Carrillo, R., Mizumoto, K., Sweeney, L. B., &#38; Philippidou, P. (2024). Molecular and cellular mechanisms of motor circuit development. <i>The Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1238-24.2024\">https://doi.org/10.1523/JNEUROSCI.1238-24.2024</a>","short":"P. Kratsios, N. Zampieri, R. Carrillo, K. Mizumoto, L.B. Sweeney, P. Philippidou, The Journal of Neuroscience 44 (2024).","mla":"Kratsios, Paschalis, et al. “Molecular and Cellular Mechanisms of Motor Circuit Development.” <i>The Journal of Neuroscience</i>, vol. 44, no. 40, e1238242024, Society for Neuroscience, 2024, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1238-24.2024\">10.1523/JNEUROSCI.1238-24.2024</a>.","ista":"Kratsios P, Zampieri N, Carrillo R, Mizumoto K, Sweeney LB, Philippidou P. 2024. Molecular and cellular mechanisms of motor circuit development. The Journal of Neuroscience. 44(40), e1238242024."},"project":[{"_id":"ebb66355-77a9-11ec-83b8-b8ac210a4dae","name":"Development and Evolution of Tetrapod Motor Circuits","grant_number":"101041551"}],"OA_embargo":"6 months","volume":44,"issue":"40","publication_status":"published","article_number":"e1238242024","intvolume":"        44","author":[{"full_name":"Kratsios, Paschalis","last_name":"Kratsios","first_name":"Paschalis"},{"full_name":"Zampieri, Niccolò","last_name":"Zampieri","first_name":"Niccolò"},{"first_name":"Robert","last_name":"Carrillo","full_name":"Carrillo, Robert"},{"first_name":"Kota","last_name":"Mizumoto","full_name":"Mizumoto, Kota"},{"full_name":"Sweeney, Lora Beatrice Jaeger","last_name":"Sweeney","orcid":"0000-0001-9242-5601","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","first_name":"Lora Beatrice Jaeger"},{"full_name":"Philippidou, Polyxeni","last_name":"Philippidou","first_name":"Polyxeni"}],"doi":"10.1523/JNEUROSCI.1238-24.2024","oa_version":"Published Version","external_id":{"isi":["001335212200016"],"pmid":["39358025"]},"pmid":1}]