[{"ec_funded":1,"title":"Stochastic representation of the quantum quartic oscillator","file_date_updated":"2023-07-31T09:02:27Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","date_created":"2023-07-24T10:47:46Z","article_type":"original","corr_author":"1","quality_controlled":"1","oa":1,"citation":{"ama":"Tucci G, De Nicola S, Wald S, Gambassi A. Stochastic representation of the quantum quartic oscillator. <i>SciPost Physics Core</i>. 2023;6(2). doi:<a href=\"https://doi.org/10.21468/scipostphyscore.6.2.029\">10.21468/scipostphyscore.6.2.029</a>","ista":"Tucci G, De Nicola S, Wald S, Gambassi A. 2023. Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. 6(2), 029.","apa":"Tucci, G., De Nicola, S., Wald, S., &#38; Gambassi, A. (2023). Stochastic representation of the quantum quartic oscillator. <i>SciPost Physics Core</i>. SciPost Foundation. <a href=\"https://doi.org/10.21468/scipostphyscore.6.2.029\">https://doi.org/10.21468/scipostphyscore.6.2.029</a>","chicago":"Tucci, Gennaro, Stefano De Nicola, Sascha Wald, and Andrea Gambassi. “Stochastic Representation of the Quantum Quartic Oscillator.” <i>SciPost Physics Core</i>. SciPost Foundation, 2023. <a href=\"https://doi.org/10.21468/scipostphyscore.6.2.029\">https://doi.org/10.21468/scipostphyscore.6.2.029</a>.","short":"G. Tucci, S. De Nicola, S. Wald, A. Gambassi, SciPost Physics Core 6 (2023).","mla":"Tucci, Gennaro, et al. “Stochastic Representation of the Quantum Quartic Oscillator.” <i>SciPost Physics Core</i>, vol. 6, no. 2, 029, SciPost Foundation, 2023, doi:<a href=\"https://doi.org/10.21468/scipostphyscore.6.2.029\">10.21468/scipostphyscore.6.2.029</a>.","ieee":"G. Tucci, S. De Nicola, S. Wald, and A. Gambassi, “Stochastic representation of the quantum quartic oscillator,” <i>SciPost Physics Core</i>, vol. 6, no. 2. SciPost Foundation, 2023."},"publisher":"SciPost Foundation","publication":"SciPost Physics Core","issue":"2","article_processing_charge":"No","type":"journal_article","keyword":["Statistical and Nonlinear Physics","Atomic and Molecular Physics","and Optics","Nuclear and High Energy Physics","Condensed Matter Physics"],"day":"14","volume":6,"arxiv":1,"file":[{"access_level":"open_access","file_id":"13329","file_size":523236,"checksum":"b472bc82108747eda5d52adf9e2ac7f3","date_updated":"2023-07-31T09:02:27Z","creator":"dernst","success":1,"file_name":"2023_SciPostPhysCore_Tucci.pdf","date_created":"2023-07-31T09:02:27Z","content_type":"application/pdf","relation":"main_file"}],"publication_status":"published","status":"public","_id":"13277","intvolume":"         6","abstract":[{"text":"Recent experimental advances have inspired the development of theoretical tools to describe the non-equilibrium dynamics of quantum systems. Among them an exact representation of quantum spin systems in terms of classical stochastic processes has been proposed. Here we provide first steps towards the extension of this stochastic approach to bosonic systems by considering the one-dimensional quantum quartic oscillator. We show how to exactly parameterize the time evolution of this prototypical model via the dynamics of a set of classical variables. We interpret these variables as stochastic processes, which allows us to propose a novel way to numerically simulate the time evolution of the system. We benchmark our findings by considering analytically solvable limits and providing alternative derivations of known results.","lang":"eng"}],"article_number":"029","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"MaSe"}],"doi":"10.21468/scipostphyscore.6.2.029","publication_identifier":{"issn":["2666-9366"]},"license":"https://creativecommons.org/licenses/by/4.0/","acknowledgement":"S. De Nicola acknowledges funding from the Institute of Science and Technology Austria (ISTA), and from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411. S. De Nicola also acknowledges funding from the EPSRC Center for Doctoral Training in Cross-Disciplinary Approaches to NonEquilibrium Systems (CANES) under Grant EP/L015854/1. ","language":[{"iso":"eng"}],"external_id":{"arxiv":["2211.01923"]},"month":"04","has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","ddc":["530"],"date_published":"2023-04-14T00:00:00Z","author":[{"last_name":"Tucci","full_name":"Tucci, Gennaro","first_name":"Gennaro"},{"first_name":"Stefano","orcid":"0000-0002-4842-6671","full_name":"De Nicola, Stefano","last_name":"De Nicola","id":"42832B76-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wald","full_name":"Wald, Sascha","first_name":"Sascha"},{"first_name":"Andrea","full_name":"Gambassi, Andrea","last_name":"Gambassi"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"date_updated":"2025-04-14T07:43:56Z"},{"file":[{"success":1,"creator":"dernst","date_updated":"2023-07-31T08:44:38Z","content_type":"application/pdf","relation":"main_file","file_name":"2023_SciPostPhysics_Rammelmueller.pdf","date_created":"2023-07-31T08:44:38Z","file_id":"13328","access_level":"open_access","file_size":1163444,"checksum":"ffdb70b9ae7aa45ea4ea6096ecbd6431"}],"publication_status":"published","arxiv":1,"status":"public","_id":"13278","abstract":[{"lang":"eng","text":"We present a numerical analysis of spin-1/2 fermions in a one-dimensional harmonic potential in the presence of a magnetic point-like impurity at the center of the trap. The model represents a few-body analogue of a magnetic impurity in the vicinity of an s-wave superconductor. Already for a few particles we find a ground-state level crossing between sectors with different fermion parities. We interpret this crossing as a few-body precursor of a quantum phase transition, which occurs when the impurity \"breaks\" a Cooper pair. This picture is further corroborated by analyzing density-density correlations in momentum space. Finally, we discuss how the system may be realized with existing cold-atoms platforms."}],"intvolume":"        14","article_processing_charge":"No","publisher":"SciPost Foundation","publication":"SciPost Physics","issue":"1","day":"24","keyword":["General Physics and Astronomy"],"volume":14,"type":"journal_article","article_type":"original","quality_controlled":"1","year":"2023","date_created":"2023-07-24T10:48:23Z","citation":{"apa":"Rammelmüller, L., Huber, D., Čufar, M., Brand, J., Hammer, H.-W., &#38; Volosniev, A. (2023). Magnetic impurity in a one-dimensional few-fermion system. <i>SciPost Physics</i>. SciPost Foundation. <a href=\"https://doi.org/10.21468/scipostphys.14.1.006\">https://doi.org/10.21468/scipostphys.14.1.006</a>","chicago":"Rammelmüller, Lukas, David Huber, Matija Čufar, Joachim Brand, Hans-Werner Hammer, and Artem Volosniev. “Magnetic Impurity in a One-Dimensional Few-Fermion System.” <i>SciPost Physics</i>. SciPost Foundation, 2023. <a href=\"https://doi.org/10.21468/scipostphys.14.1.006\">https://doi.org/10.21468/scipostphys.14.1.006</a>.","ama":"Rammelmüller L, Huber D, Čufar M, Brand J, Hammer H-W, Volosniev A. Magnetic impurity in a one-dimensional few-fermion system. <i>SciPost Physics</i>. 2023;14(1). doi:<a href=\"https://doi.org/10.21468/scipostphys.14.1.006\">10.21468/scipostphys.14.1.006</a>","ista":"Rammelmüller L, Huber D, Čufar M, Brand J, Hammer H-W, Volosniev A. 2023. Magnetic impurity in a one-dimensional few-fermion system. SciPost Physics. 14(1), 006.","mla":"Rammelmüller, Lukas, et al. “Magnetic Impurity in a One-Dimensional Few-Fermion System.” <i>SciPost Physics</i>, vol. 14, no. 1, 006, SciPost Foundation, 2023, doi:<a href=\"https://doi.org/10.21468/scipostphys.14.1.006\">10.21468/scipostphys.14.1.006</a>.","ieee":"L. Rammelmüller, D. Huber, M. Čufar, J. Brand, H.-W. Hammer, and A. Volosniev, “Magnetic impurity in a one-dimensional few-fermion system,” <i>SciPost Physics</i>, vol. 14, no. 1. SciPost Foundation, 2023.","short":"L. Rammelmüller, D. Huber, M. Čufar, J. Brand, H.-W. Hammer, A. Volosniev, SciPost Physics 14 (2023)."},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Magnetic impurity in a one-dimensional few-fermion system","file_date_updated":"2023-07-31T08:44:38Z","author":[{"first_name":"Lukas","full_name":"Rammelmüller, Lukas","last_name":"Rammelmüller"},{"first_name":"David","last_name":"Huber","full_name":"Huber, David"},{"last_name":"Čufar","full_name":"Čufar, Matija","first_name":"Matija"},{"last_name":"Brand","full_name":"Brand, Joachim","first_name":"Joachim"},{"full_name":"Hammer, Hans-Werner","last_name":"Hammer","first_name":"Hans-Werner"},{"orcid":"0000-0003-0393-5525","first_name":"Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","full_name":"Volosniev, Artem","last_name":"Volosniev"}],"ddc":["530"],"date_published":"2023-01-24T00:00:00Z","date_updated":"2023-12-13T11:39:32Z","external_id":{"isi":["001000325800008"],"arxiv":["2204.01606"]},"language":[{"iso":"eng"}],"has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","month":"01","doi":"10.21468/scipostphys.14.1.006","publication_identifier":{"issn":["2542-4653"]},"article_number":"006","department":[{"_id":"MiLe"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1},{"month":"07","scopus_import":"1","oa_version":"Published Version","has_accepted_license":"1","language":[{"iso":"eng"}],"conference":{"location":"Paderborn, Germany","name":"ICALP: Automata, Languages and Programming","end_date":"2023-07-14","start_date":"2023-07-10"},"external_id":{"arxiv":["2305.03447"]},"date_updated":"2025-07-10T11:50:41Z","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"date_published":"2023-07-05T00:00:00Z","alternative_title":["LIPIcs"],"ddc":["000"],"author":[{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Kebis","full_name":"Kebis, Pavol","first_name":"Pavol"},{"first_name":"Nicolas Adrien","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"full_name":"Sarac, Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_identifier":{"isbn":["9783959772785"],"eissn":["1868-8969"]},"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe thank Pierre Ganty for early discussions and the anonymous reviewers for their helpful comments.\r\n","doi":"10.4230/LIPIcs.ICALP.2023.129","type":"conference","volume":261,"day":"05","page":"129:1--129:20","publication":"50th International Colloquium on Automata, Languages, and Programming","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"Yes","_id":"13292","abstract":[{"text":"The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time.","lang":"eng"}],"intvolume":"       261","status":"public","arxiv":1,"publication_status":"published","file":[{"date_updated":"2023-07-24T15:11:05Z","success":1,"creator":"esarac","file_name":"icalp23.pdf","date_created":"2023-07-24T15:11:05Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"13293","file_size":859379,"checksum":"5d4c8932ef3450615a53b9bb15d92eb2"}],"file_date_updated":"2023-07-24T15:11:05Z","ec_funded":1,"title":"Regular methods for operator precedence languages","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"citation":{"mla":"Henzinger, Thomas A., et al. “Regular Methods for Operator Precedence Languages.” <i>50th International Colloquium on Automata, Languages, and Programming</i>, vol. 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">10.4230/LIPIcs.ICALP.2023.129</a>.","short":"T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20.","ieee":"T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Regular methods for operator precedence languages,” in <i>50th International Colloquium on Automata, Languages, and Programming</i>, Paderborn, Germany, 2023, vol. 261, p. 129:1--129:20.","ista":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2023. Regular methods for operator precedence languages. 50th International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 261, 129:1--129:20.","ama":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Regular methods for operator precedence languages. In: <i>50th International Colloquium on Automata, Languages, and Programming</i>. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:129:1--129:20. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">10.4230/LIPIcs.ICALP.2023.129</a>","chicago":"Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Regular Methods for Operator Precedence Languages.” In <i>50th International Colloquium on Automata, Languages, and Programming</i>, 261:129:1--129:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">https://doi.org/10.4230/LIPIcs.ICALP.2023.129</a>.","apa":"Henzinger, T. A., Kebis, P., Mazzocchi, N. A., &#38; Sarac, N. E. (2023). Regular methods for operator precedence languages. In <i>50th International Colloquium on Automata, Languages, and Programming</i> (Vol. 261, p. 129:1--129:20). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2023.129\">https://doi.org/10.4230/LIPIcs.ICALP.2023.129</a>"},"date_created":"2023-07-24T15:11:41Z","year":"2023","corr_author":"1","quality_controlled":"1"},{"publication_status":"published","file":[{"creator":"dernst","success":1,"date_updated":"2023-07-31T08:11:20Z","relation":"main_file","content_type":"application/pdf","date_created":"2023-07-31T08:11:20Z","file_name":"2023_LNCS_CAV_HenzingerT.pdf","file_id":"13327","access_level":"open_access","file_size":647760,"checksum":"ccaf94bf7d658ba012c016e11869b54c"}],"arxiv":1,"intvolume":"     13965","_id":"13310","abstract":[{"lang":"eng","text":"Machine-learned systems are in widespread use for making decisions about humans, and it is important that they are fair, i.e., not biased against individuals based on sensitive attributes. We present runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure. We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden. We build monitors that observe a long sequence of events as generated by a given system, and output, after each observation, a quantitative estimate of how fair or biased the system was on that run until that point in time. The estimate is proven to be correct modulo a variable error bound and a given confidence level, where the error bound gets tighter as the observed sequence gets longer. Our monitors are of two types, and use, respectively, frequentist and Bayesian statistical inference techniques. While the frequentist monitors compute estimates that are objectively correct with respect to the ground truth, the Bayesian monitors compute estimates that are correct subject to a given prior belief about the system’s model. Using a prototype implementation, we show how we can monitor if a bank is fair in giving loans to applicants from different social backgrounds, and if a college is fair in admitting students while maintaining a reasonable financial burden on the society. Although they exhibit different theoretical complexities in certain cases, in our experiments, both frequentist and Bayesian monitors took less than a millisecond to update their verdicts after each observation."}],"status":"public","article_processing_charge":"Yes (in subscription journal)","publication":"Computer Aided Verification","publisher":"Springer Nature","volume":13965,"day":"18","page":"358–382","type":"conference","corr_author":"1","quality_controlled":"1","date_created":"2023-07-25T18:32:40Z","year":"2023","citation":{"ama":"Henzinger TA, Karimi M, Kueffner K, Mallik K. Monitoring algorithmic fairness. In: <i>Computer Aided Verification</i>. Vol 13965. Springer Nature; 2023:358–382. doi:<a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">10.1007/978-3-031-37703-7_17</a>","ista":"Henzinger TA, Karimi M, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13965, 358–382.","apa":"Henzinger, T. A., Karimi, M., Kueffner, K., &#38; Mallik, K. (2023). Monitoring algorithmic fairness. In <i>Computer Aided Verification</i> (Vol. 13965, pp. 358–382). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">https://doi.org/10.1007/978-3-031-37703-7_17</a>","chicago":"Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness.” In <i>Computer Aided Verification</i>, 13965:358–382. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">https://doi.org/10.1007/978-3-031-37703-7_17</a>.","short":"T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, Computer Aided Verification, Springer Nature, 2023, pp. 358–382.","ieee":"T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness,” in <i>Computer Aided Verification</i>, Paris, France, 2023, vol. 13965, pp. 358–382.","mla":"Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness.” <i>Computer Aided Verification</i>, vol. 13965, Springer Nature, 2023, pp. 358–382, doi:<a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">10.1007/978-3-031-37703-7_17</a>."},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2023-07-31T08:11:20Z","title":"Monitoring algorithmic fairness","ec_funded":1,"author":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A"},{"first_name":"Mahyar","orcid":"0009-0005-0820-1696","full_name":"Karimi, Mahyar","id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b","last_name":"Karimi"},{"first_name":"Konstantin","orcid":"0000-0001-8974-2542","full_name":"Kueffner, Konstantin","last_name":"Kueffner","id":"8121a2d0-dc85-11ea-9058-af578f3b4515"},{"first_name":"Kaushik","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"}],"date_published":"2023-07-18T00:00:00Z","ddc":["000"],"alternative_title":["LNCS"],"date_updated":"2026-01-21T07:24:31Z","project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"external_id":{"arxiv":["2305.15979"],"isi":["001310804800017"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2023-07-22","start_date":"2023-07-17","location":"Paris, France","name":"CAV: Computer Aided Verification"},"scopus_import":"1","oa_version":"Published Version","has_accepted_license":"1","month":"07","doi":"10.1007/978-3-031-37703-7_17","acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG101020093.","publication_identifier":{"eisbn":["9783031377037"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031377020"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"department":[{"_id":"GradSch"},{"_id":"ToHe"}]},{"date_created":"2023-07-30T22:01:02Z","year":"2023","quality_controlled":"1","article_type":"original","oa":1,"citation":{"chicago":"Barbier, Jean, Francesco Camilli, Marco Mondelli, and Manuel Sáenz. “Fundamental Limits in Structured Principal Component Analysis and How to Reach Them.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2023. <a href=\"https://doi.org/10.1073/pnas.2302028120\">https://doi.org/10.1073/pnas.2302028120</a>.","apa":"Barbier, J., Camilli, F., Mondelli, M., &#38; Sáenz, M. (2023). Fundamental limits in structured principal component analysis and how to reach them. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2302028120\">https://doi.org/10.1073/pnas.2302028120</a>","ista":"Barbier J, Camilli F, Mondelli M, Sáenz M. 2023. Fundamental limits in structured principal component analysis and how to reach them. Proceedings of the National Academy of Sciences of the United States of America. 120(30), e2302028120.","ama":"Barbier J, Camilli F, Mondelli M, Sáenz M. Fundamental limits in structured principal component analysis and how to reach them. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2023;120(30). doi:<a href=\"https://doi.org/10.1073/pnas.2302028120\">10.1073/pnas.2302028120</a>","mla":"Barbier, Jean, et al. “Fundamental Limits in Structured Principal Component Analysis and How to Reach Them.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 120, no. 30, e2302028120, National Academy of Sciences, 2023, doi:<a href=\"https://doi.org/10.1073/pnas.2302028120\">10.1073/pnas.2302028120</a>.","ieee":"J. Barbier, F. Camilli, M. Mondelli, and M. Sáenz, “Fundamental limits in structured principal component analysis and how to reach them,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 120, no. 30. National Academy of Sciences, 2023.","short":"J. Barbier, F. Camilli, M. Mondelli, M. Sáenz, Proceedings of the National Academy of Sciences of the United States of America 120 (2023)."},"file_date_updated":"2023-07-31T07:30:48Z","title":"Fundamental limits in structured principal component analysis and how to reach them","related_material":{"link":[{"relation":"software","url":"https://github.com/fcamilli95/Structured-PCA-"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","file":[{"access_level":"open_access","file_id":"13323","file_size":995933,"checksum":"1fc06228afdb3aa80cf8e7766bcf9dc5","date_updated":"2023-07-31T07:30:48Z","success":1,"creator":"dernst","date_created":"2023-07-31T07:30:48Z","file_name":"2023_PNAS_Barbier.pdf","content_type":"application/pdf","relation":"main_file"}],"intvolume":"       120","_id":"13315","abstract":[{"text":"How do statistical dependencies in measurement noise influence high-dimensional inference? To answer this, we study the paradigmatic spiked matrix model of principal components analysis (PCA), where a rank-one matrix is corrupted by additive noise. We go beyond the usual independence assumption on the noise entries, by drawing the noise from a low-order polynomial orthogonal matrix ensemble. The resulting noise correlations make the setting relevant for applications but analytically challenging. We provide characterization of the Bayes optimal limits of inference in this model. If the spike is rotation invariant, we show that standard spectral PCA is optimal. However, for more general priors, both PCA and the existing approximate message-passing algorithm (AMP) fall short of achieving the information-theoretic limits, which we compute using the replica method from statistical physics. We thus propose an AMP, inspired by the theory of adaptive Thouless–Anderson–Palmer equations, which is empirically observed to saturate the conjectured theoretical limit. This AMP comes with a rigorous state evolution analysis tracking its performance. Although we focus on specific noise distributions, our methodology can be generalized to a wide class of trace matrix ensembles at the cost of more involved expressions. Finally, despite the seemingly strong assumption of rotation-invariant noise, our theory empirically predicts algorithmic performance on real data, pointing at strong universality properties.","lang":"eng"}],"pmid":1,"status":"public","publication":"Proceedings of the National Academy of Sciences of the United States of America","issue":"30","publisher":"National Academy of Sciences","article_processing_charge":"Yes (in subscription journal)","type":"journal_article","volume":120,"day":"25","doi":"10.1073/pnas.2302028120","publication_identifier":{"eissn":["1091-6490"]},"acknowledgement":"J.B. was funded by the European Union (ERC, CHORAL, project number 101039794). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them. M.M. was supported by the 2019 Lopez-Loreta Prize. We would like to thank the reviewers for the insightful comments and, in particular, for suggesting the BAMP-inspired denoisers leading to AMP-AP.","article_number":"e2302028120","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"MaMo"}],"date_published":"2023-07-25T00:00:00Z","ddc":["000"],"author":[{"first_name":"Jean","last_name":"Barbier","full_name":"Barbier, Jean"},{"last_name":"Camilli","full_name":"Camilli, Francesco","first_name":"Francesco"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020"},{"first_name":"Manuel","full_name":"Sáenz, Manuel","last_name":"Sáenz"}],"date_updated":"2025-09-09T12:41:50Z","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"language":[{"iso":"eng"}],"external_id":{"isi":["001121663500001"],"pmid":["37463204"]},"month":"07","oa_version":"Published Version","scopus_import":"1","has_accepted_license":"1"},{"abstract":[{"text":"Although budding yeast has been extensively used as a model organism for studying organelle functions and intracellular vesicle trafficking, whether it possesses an independent endocytic early/sorting compartment that sorts endocytic cargos to the endo-lysosomal pathway or the recycling pathway has long been unclear. The structure and properties of the endocytic early/sorting compartment differ significantly between organisms; in plant cells, the trans-Golgi network (TGN) serves this role, whereas in mammalian cells a separate intracellular structure performs this function. The yeast syntaxin homolog Tlg2p, widely localizing to the TGN and endosomal compartments, is presumed to act as a Q-SNARE for endocytic vesicles, but which compartment is the direct target for endocytic vesicles remained unanswered. Here we demonstrate by high-speed and high-resolution 4D imaging of fluorescently labeled endocytic cargos that the Tlg2p-residing compartment within the TGN functions as the early/sorting compartment. After arriving here, endocytic cargos are recycled to the plasma membrane or transported to the yeast Rab5-residing endosomal compartment through the pathway requiring the clathrin adaptors GGAs. Interestingly, Gga2p predominantly localizes at the Tlg2p-residing compartment, and the deletion of GGAs has little effect on another TGN region where Sec7p is present but suppresses dynamics of the Tlg2-residing early/sorting compartment, indicating that the Tlg2p- and Sec7p-residing regions are discrete entities in the mutant. Thus, the Tlg2p-residing region seems to serve as an early/sorting compartment and function independently of the Sec7p-residing region within the TGN.","lang":"eng"}],"_id":"13316","intvolume":"        12","pmid":1,"status":"public","publication_status":"published","file":[{"file_id":"13324","access_level":"open_access","checksum":"2af111a00cf5e3a956f7f0fd13199b15","file_size":11980913,"success":1,"creator":"dernst","date_updated":"2023-07-31T07:43:00Z","content_type":"application/pdf","relation":"main_file","file_name":"2023_eLife_Toshima.pdf","date_created":"2023-07-31T07:43:00Z"}],"volume":12,"day":"21","type":"journal_article","article_processing_charge":"Yes","publication":"eLife","publisher":"eLife Sciences Publications","citation":{"ieee":"J. Y. Toshima <i>et al.</i>, “The yeast endocytic early/sorting compartment exists as an independent sub-compartment within the trans-Golgi network,” <i>eLife</i>, vol. 12. eLife Sciences Publications, 2023.","short":"J.Y. Toshima, A. Tsukahara, M. Nagano, T. Tojima, D.E. Siekhaus, A. Nakano, J. Toshima, ELife 12 (2023).","mla":"Toshima, Junko Y., et al. “The Yeast Endocytic Early/Sorting Compartment Exists as an Independent Sub-Compartment within the Trans-Golgi Network.” <i>ELife</i>, vol. 12, e84850, eLife Sciences Publications, 2023, doi:<a href=\"https://doi.org/10.7554/eLife.84850\">10.7554/eLife.84850</a>.","chicago":"Toshima, Junko Y., Ayana Tsukahara, Makoto Nagano, Takuro Tojima, Daria E Siekhaus, Akihiko Nakano, and Jiro Toshima. “The Yeast Endocytic Early/Sorting Compartment Exists as an Independent Sub-Compartment within the Trans-Golgi Network.” <i>ELife</i>. eLife Sciences Publications, 2023. <a href=\"https://doi.org/10.7554/eLife.84850\">https://doi.org/10.7554/eLife.84850</a>.","apa":"Toshima, J. Y., Tsukahara, A., Nagano, M., Tojima, T., Siekhaus, D. E., Nakano, A., &#38; Toshima, J. (2023). The yeast endocytic early/sorting compartment exists as an independent sub-compartment within the trans-Golgi network. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.84850\">https://doi.org/10.7554/eLife.84850</a>","ista":"Toshima JY, Tsukahara A, Nagano M, Tojima T, Siekhaus DE, Nakano A, Toshima J. 2023. The yeast endocytic early/sorting compartment exists as an independent sub-compartment within the trans-Golgi network. eLife. 12, e84850.","ama":"Toshima JY, Tsukahara A, Nagano M, et al. The yeast endocytic early/sorting compartment exists as an independent sub-compartment within the trans-Golgi network. <i>eLife</i>. 2023;12. doi:<a href=\"https://doi.org/10.7554/eLife.84850\">10.7554/eLife.84850</a>"},"oa":1,"quality_controlled":"1","article_type":"original","date_created":"2023-07-30T22:01:02Z","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2023-07-31T07:43:00Z","title":"The yeast endocytic early/sorting compartment exists as an independent sub-compartment within the trans-Golgi network","date_updated":"2023-12-13T11:37:36Z","author":[{"full_name":"Toshima, Junko Y.","last_name":"Toshima","first_name":"Junko Y."},{"full_name":"Tsukahara, Ayana","last_name":"Tsukahara","first_name":"Ayana"},{"first_name":"Makoto","full_name":"Nagano, Makoto","last_name":"Nagano"},{"first_name":"Takuro","full_name":"Tojima, Takuro","last_name":"Tojima"},{"full_name":"Siekhaus, Daria E","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353","first_name":"Daria E"},{"last_name":"Nakano","full_name":"Nakano, Akihiko","first_name":"Akihiko"},{"first_name":"Jiro","full_name":"Toshima, Jiro","last_name":"Toshima"}],"date_published":"2023-07-21T00:00:00Z","ddc":["570"],"oa_version":"Published Version","scopus_import":"1","has_accepted_license":"1","month":"07","external_id":{"pmid":["37477116"],"isi":["001035372800001"]},"language":[{"iso":"eng"}],"acknowledgement":"This work was supported by JSPS KAKENHI grant #18K062291, and the Takeda Science Foundation to JYT., as well as JSPS KAKENHI grant #19K065710, the Takeda Science Foundation, and Life Science Foundation of Japan to JT.","publication_identifier":{"eissn":["2050-084X"]},"doi":"10.7554/eLife.84850","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"department":[{"_id":"DaSi"}],"article_number":"e84850"},{"project":[{"grant_number":"ESP156_N","_id":"34c6ea2d-11ca-11ed-8bc3-c04f3c502833","name":"Gradient flow techniques for quantum Markov semigroups"}],"date_updated":"2025-04-23T13:10:45Z","author":[{"first_name":"Matthijs","full_name":"Vernooij, Matthijs","last_name":"Vernooij"},{"full_name":"Wirth, Melchior","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","last_name":"Wirth","first_name":"Melchior","orcid":"0000-0002-0519-4241"}],"ddc":["510"],"date_published":"2023-10-01T00:00:00Z","has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","month":"10","external_id":{"pmid":["37766789"],"isi":["001033655400002"],"arxiv":["2303.15949"]},"language":[{"iso":"eng"}],"acknowledgement":"The authors are grateful to Martijn Caspers for helpful comments on a preliminary version of this manuscript. M. V. was supported by the NWO Vidi grant VI.Vidi.192.018 ‘Non-commutative harmonic analysis and rigidity of operator algebras’. M. W. was funded by the Austrian Science Fund (FWF) under the Esprit Programme [ESP 156]. For the purpose of Open Access, the authors have applied a CC BY public copyright licence to any Author Accepted Manuscript (AAM) version arising from this submission. Open access funding provided by Austrian Science Fund (FWF).","publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"doi":"10.1007/s00220-023-04795-6","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"JaMa"}],"status":"public","intvolume":"       403","_id":"13319","abstract":[{"text":"We prove that the generator of the L2 implementation of a KMS-symmetric quantum Markov semigroup can be expressed as the square of a derivation with values in a Hilbert bimodule, extending earlier results by Cipriani and Sauvageot for tracially symmetric semigroups and the second-named author for GNS-symmetric semigroups. This result hinges on the introduction of a new completely positive map on the algebra of bounded operators on the GNS Hilbert space. This transformation maps symmetric Markov operators to symmetric Markov operators and is essential to obtain the required inner product on the Hilbert bimodule.","lang":"eng"}],"pmid":1,"file":[{"checksum":"cca204e81891270216a0c84eb8bcd398","file_size":481209,"access_level":"open_access","file_id":"14905","file_name":"2023_CommMathPhysics_Vernooij.pdf","date_created":"2024-01-30T12:15:11Z","relation":"main_file","content_type":"application/pdf","date_updated":"2024-01-30T12:15:11Z","success":1,"creator":"dernst"}],"publication_status":"published","arxiv":1,"day":"01","page":"381-416","volume":403,"type":"journal_article","article_processing_charge":"Yes (via OA deal)","publisher":"Springer Nature","publication":"Communications in Mathematical Physics","citation":{"mla":"Vernooij, Matthijs, and Melchior Wirth. “Derivations and KMS-Symmetric Quantum Markov Semigroups.” <i>Communications in Mathematical Physics</i>, vol. 403, Springer Nature, 2023, pp. 381–416, doi:<a href=\"https://doi.org/10.1007/s00220-023-04795-6\">10.1007/s00220-023-04795-6</a>.","short":"M. Vernooij, M. Wirth, Communications in Mathematical Physics 403 (2023) 381–416.","ieee":"M. Vernooij and M. Wirth, “Derivations and KMS-symmetric quantum Markov semigroups,” <i>Communications in Mathematical Physics</i>, vol. 403. Springer Nature, pp. 381–416, 2023.","apa":"Vernooij, M., &#38; Wirth, M. (2023). Derivations and KMS-symmetric quantum Markov semigroups. <i>Communications in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00220-023-04795-6\">https://doi.org/10.1007/s00220-023-04795-6</a>","chicago":"Vernooij, Matthijs, and Melchior Wirth. “Derivations and KMS-Symmetric Quantum Markov Semigroups.” <i>Communications in Mathematical Physics</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00220-023-04795-6\">https://doi.org/10.1007/s00220-023-04795-6</a>.","ama":"Vernooij M, Wirth M. Derivations and KMS-symmetric quantum Markov semigroups. <i>Communications in Mathematical Physics</i>. 2023;403:381-416. doi:<a href=\"https://doi.org/10.1007/s00220-023-04795-6\">10.1007/s00220-023-04795-6</a>","ista":"Vernooij M, Wirth M. 2023. Derivations and KMS-symmetric quantum Markov semigroups. Communications in Mathematical Physics. 403, 381–416."},"oa":1,"article_type":"original","corr_author":"1","quality_controlled":"1","year":"2023","date_created":"2023-07-30T22:01:03Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Derivations and KMS-symmetric quantum Markov semigroups","file_date_updated":"2024-01-30T12:15:11Z"},{"publication":"2023 IEEE Information Theory Workshop","publisher":"Institute of Electrical and Electronics Engineers","article_processing_charge":"No","type":"conference","day":"01","page":"294-298","arxiv":1,"publication_status":"published","_id":"13321","abstract":[{"lang":"eng","text":"We consider the problem of reconstructing the signal and the hidden variables from observations coming from a multi-layer network with rotationally invariant weight matrices. The multi-layer structure models inference from deep generative priors, and the rotational invariance imposed on the weights generalizes the i.i.d. Gaussian assumption by allowing for a complex correlation structure, which is typical in applications. In this work, we present a new class of approximate message passing (AMP) algorithms and give a state evolution recursion which precisely characterizes their performance in the large system limit. In contrast with the existing multi-layer VAMP (ML-VAMP) approach, our proposed AMP – dubbed multilayer rotationally invariant generalized AMP (ML-RI-GAMP) – provides a natural generalization beyond Gaussian designs, in the sense that it recovers the existing Gaussian AMP as a special case. Furthermore, ML-RI-GAMP exhibits a significantly lower complexity than ML-VAMP, as the computationally intensive singular value decomposition is replaced by an estimation of the moments of the design matrices. Finally, our numerical results show that this complexity gain comes at little to no cost in the performance of the algorithm."}],"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2212.01572"}],"title":"Approximate message passing for multi-layer estimation in rotationally invariant models","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-07-30T22:01:04Z","year":"2023","quality_controlled":"1","corr_author":"1","oa":1,"citation":{"chicago":"Xu, Yizhou, Tian Qi Hou, Shan Suo Liang, and Marco Mondelli. “Approximate Message Passing for Multi-Layer Estimation in Rotationally Invariant Models.” In <i>2023 IEEE Information Theory Workshop</i>, 294–98. Institute of Electrical and Electronics Engineers, 2023. <a href=\"https://doi.org/10.1109/ITW55543.2023.10160238\">https://doi.org/10.1109/ITW55543.2023.10160238</a>.","apa":"Xu, Y., Hou, T. Q., Liang, S. S., &#38; Mondelli, M. (2023). Approximate message passing for multi-layer estimation in rotationally invariant models. In <i>2023 IEEE Information Theory Workshop</i> (pp. 294–298). Saint-Malo, France: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ITW55543.2023.10160238\">https://doi.org/10.1109/ITW55543.2023.10160238</a>","ista":"Xu Y, Hou TQ, Liang SS, Mondelli M. 2023. Approximate message passing for multi-layer estimation in rotationally invariant models. 2023 IEEE Information Theory Workshop. ITW: Information Theory Workshop, 294–298.","ama":"Xu Y, Hou TQ, Liang SS, Mondelli M. Approximate message passing for multi-layer estimation in rotationally invariant models. In: <i>2023 IEEE Information Theory Workshop</i>. Institute of Electrical and Electronics Engineers; 2023:294-298. doi:<a href=\"https://doi.org/10.1109/ITW55543.2023.10160238\">10.1109/ITW55543.2023.10160238</a>","ieee":"Y. Xu, T. Q. Hou, S. S. Liang, and M. Mondelli, “Approximate message passing for multi-layer estimation in rotationally invariant models,” in <i>2023 IEEE Information Theory Workshop</i>, Saint-Malo, France, 2023, pp. 294–298.","short":"Y. Xu, T.Q. Hou, S.S. Liang, M. Mondelli, in:, 2023 IEEE Information Theory Workshop, Institute of Electrical and Electronics Engineers, 2023, pp. 294–298.","mla":"Xu, Yizhou, et al. “Approximate Message Passing for Multi-Layer Estimation in Rotationally Invariant Models.” <i>2023 IEEE Information Theory Workshop</i>, Institute of Electrical and Electronics Engineers, 2023, pp. 294–98, doi:<a href=\"https://doi.org/10.1109/ITW55543.2023.10160238\">10.1109/ITW55543.2023.10160238</a>."},"language":[{"iso":"eng"}],"conference":{"location":"Saint-Malo, France","name":"ITW: Information Theory Workshop","end_date":"2023-04-28","start_date":"2023-04-23"},"external_id":{"arxiv":["2212.01572"],"isi":["001031733100053"]},"month":"05","scopus_import":"1","oa_version":"Preprint","date_published":"2023-05-01T00:00:00Z","author":[{"full_name":"Xu, Yizhou","last_name":"Xu","first_name":"Yizhou"},{"first_name":"Tian Qi","full_name":"Hou, Tian Qi","last_name":"Hou"},{"first_name":"Shan Suo","full_name":"Liang, Shan Suo","last_name":"Liang"},{"first_name":"Marco","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425"}],"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"date_updated":"2025-04-15T07:50:16Z","department":[{"_id":"MaMo"}],"isi":1,"doi":"10.1109/ITW55543.2023.10160238","publication_identifier":{"isbn":["9798350301496"],"eissn":["2475-4218"]},"acknowledgement":"Marco Mondelli was partially supported by the 2019 Lopez-Loreta prize."},{"date_created":"2023-07-31T11:30:46Z","doi":"10.5281/ZENODO.8059564","year":"2023","corr_author":"1","oa":1,"citation":{"short":"M. Kleshnina, (2023).","ieee":"M. Kleshnina, “kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games.” Zenodo, 2023.","mla":"Kleshnina, Maria. <i>Kleshnina/Stochgames_info: The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.8059564\">10.5281/ZENODO.8059564</a>.","ista":"Kleshnina M. 2023. kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.8059564\">10.5281/ZENODO.8059564</a>.","ama":"Kleshnina M. kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.8059564\">10.5281/ZENODO.8059564</a>","chicago":"Kleshnina, Maria. “Kleshnina/Stochgames_info: The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.8059564\">https://doi.org/10.5281/ZENODO.8059564</a>.","apa":"Kleshnina, M. (2023). kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.8059564\">https://doi.org/10.5281/ZENODO.8059564</a>"},"title":"kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"13258"}]},"department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-06-20T00:00:00Z","ddc":["000"],"author":[{"full_name":"Kleshnina, Maria","last_name":"Kleshnina","id":"4E21749C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"}],"_id":"13336","date_updated":"2025-04-15T06:54:58Z","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.8059564"}],"publisher":"Zenodo","article_processing_charge":"No","month":"06","type":"research_data_reference","oa_version":"Published Version","day":"20"},{"doi":"10.1126/science.adh9059","acknowledgement":"We acknowledge funding from the European Union’s Horizon 2020 Research and Innovation Program [European Research Council grants 820008 (Ra.K.) and 101045223 (A.P.) and Marie Skłodowska-Curie grants 812868 (J.G.) and 101022777 (T.-P.R.)], the Academy of Finland [Center of Excellence Programme LIBER grant 346107 (A.P.), Flagship Programme PREIN grant 320165 (A.P.), and Postdoctoral Researcher grant 340103 (T.-P.R.)], Zuckerman STEM Leadership Program Fellowship (J.R.C.), President’s PhD Scholarship (M.O.), and the EPSRC [Established Career Fellowship grant EP/R00188X/1 (M.J.F.)].","publication_identifier":{"eissn":["1095-9203"]},"isi":1,"department":[{"_id":"RaKl"}],"author":[{"first_name":"Julius","full_name":"Gemen, Julius","last_name":"Gemen"},{"first_name":"Jonathan R.","full_name":"Church, Jonathan R.","last_name":"Church"},{"first_name":"Tero-Petri","full_name":"Ruoko, Tero-Petri","last_name":"Ruoko"},{"first_name":"Nikita","last_name":"Durandin","full_name":"Durandin, Nikita"},{"last_name":"Białek","full_name":"Białek, Michał J.","first_name":"Michał J."},{"first_name":"Maren","last_name":"Weissenfels","full_name":"Weissenfels, Maren"},{"first_name":"Moran","last_name":"Feller","full_name":"Feller, Moran"},{"first_name":"Miri","full_name":"Kazes, Miri","last_name":"Kazes"},{"first_name":"Veniamin A.","full_name":"Borin, Veniamin A.","last_name":"Borin"},{"first_name":"Magdalena","last_name":"Odaybat","full_name":"Odaybat, Magdalena"},{"first_name":"Rishir","last_name":"Kalepu","full_name":"Kalepu, Rishir"},{"first_name":"Yael","last_name":"Diskin-Posner","full_name":"Diskin-Posner, Yael"},{"first_name":"Dan","full_name":"Oron, Dan","last_name":"Oron"},{"full_name":"Fuchter, Matthew J.","last_name":"Fuchter","first_name":"Matthew J."},{"first_name":"Arri","last_name":"Priimagi","full_name":"Priimagi, Arri"},{"first_name":"Igor","last_name":"Schapiro","full_name":"Schapiro, Igor"},{"last_name":"Klajn","full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal"}],"date_published":"2023-09-22T00:00:00Z","project":[{"call_identifier":"H2020","_id":"7bef070e-9f16-11ee-852c-db9675e131d9","name":"Dissipative self-assembly in synthetic systems: Towards life-like materials","grant_number":"820008"}],"date_updated":"2025-09-09T12:44:37Z","external_id":{"isi":["001100654900035"],"pmid":["37733864"]},"language":[{"iso":"eng"}],"oa_version":"Preprint","scopus_import":"1","month":"09","quality_controlled":"1","corr_author":"1","article_type":"original","date_created":"2023-08-01T08:26:15Z","year":"2023","citation":{"ama":"Gemen J, Church JR, Ruoko T-P, et al. Disequilibrating azoarenes by visible-light sensitization under confinement. <i>Science</i>. 2023;381(6664):1357-1363. doi:<a href=\"https://doi.org/10.1126/science.adh9059\">10.1126/science.adh9059</a>","ista":"Gemen J, Church JR, Ruoko T-P, Durandin N, Białek MJ, Weissenfels M, Feller M, Kazes M, Borin VA, Odaybat M, Kalepu R, Diskin-Posner Y, Oron D, Fuchter MJ, Priimagi A, Schapiro I, Klajn R. 2023. Disequilibrating azoarenes by visible-light sensitization under confinement. Science. 381(6664), 1357–1363.","apa":"Gemen, J., Church, J. R., Ruoko, T.-P., Durandin, N., Białek, M. J., Weissenfels, M., … Klajn, R. (2023). Disequilibrating azoarenes by visible-light sensitization under confinement. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.adh9059\">https://doi.org/10.1126/science.adh9059</a>","chicago":"Gemen, Julius, Jonathan R. Church, Tero-Petri Ruoko, Nikita Durandin, Michał J. Białek, Maren Weissenfels, Moran Feller, et al. “Disequilibrating Azoarenes by Visible-Light Sensitization under Confinement.” <i>Science</i>. American Association for the Advancement of Science, 2023. <a href=\"https://doi.org/10.1126/science.adh9059\">https://doi.org/10.1126/science.adh9059</a>.","ieee":"J. Gemen <i>et al.</i>, “Disequilibrating azoarenes by visible-light sensitization under confinement,” <i>Science</i>, vol. 381, no. 6664. American Association for the Advancement of Science, pp. 1357–1363, 2023.","mla":"Gemen, Julius, et al. “Disequilibrating Azoarenes by Visible-Light Sensitization under Confinement.” <i>Science</i>, vol. 381, no. 6664, American Association for the Advancement of Science, 2023, pp. 1357–63, doi:<a href=\"https://doi.org/10.1126/science.adh9059\">10.1126/science.adh9059</a>.","short":"J. Gemen, J.R. Church, T.-P. Ruoko, N. Durandin, M.J. Białek, M. Weissenfels, M. Feller, M. Kazes, V.A. Borin, M. Odaybat, R. Kalepu, Y. Diskin-Posner, D. Oron, M.J. Fuchter, A. Priimagi, I. Schapiro, R. Klajn, Science 381 (2023) 1357–1363."},"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ec_funded":1,"title":"Disequilibrating azoarenes by visible-light sensitization under confinement","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.26434/chemrxiv-2023-gq2h0"}],"_id":"13340","intvolume":"       381","pmid":1,"abstract":[{"text":"Photoisomerization of azobenzenes from their stable E isomer to the metastable Z state is the basis of numerous applications of these molecules. However, this reaction typically requires ultraviolet light, which limits applicability. In this study, we introduce disequilibration by sensitization under confinement (DESC), a supramolecular approach to induce the E-to-Z isomerization by using light of a desired color, including red. DESC relies on a combination of a macrocyclic host and a photosensitizer, which act together to selectively bind and sensitize E-azobenzenes for isomerization. The Z isomer lacks strong affinity for and is expelled from the host, which can then convert additional E-azobenzenes to the Z state. In this way, the host–photosensitizer complex converts photon energy into chemical energy in the form of out-of-equilibrium photostationary states, including ones that cannot be accessed through direct photoexcitation.","lang":"eng"}],"status":"public","article_processing_charge":"No","issue":"6664","publication":"Science","publisher":"American Association for the Advancement of Science","volume":381,"day":"22","page":"1357-1363","type":"journal_article"},{"file":[{"file_name":"2023_EmboJournal_Kroll.pdf","date_created":"2023-11-27T08:45:56Z","content_type":"application/pdf","relation":"main_file","date_updated":"2023-11-27T08:45:56Z","success":1,"creator":"dernst","file_size":4862497,"checksum":"6261d0041c7e8d284c39712c40079730","access_level":"open_access","file_id":"14611"}],"publication_status":"published","status":"public","pmid":1,"_id":"13342","abstract":[{"text":"Motile cells moving in multicellular organisms encounter microenvironments of locally heterogeneous mechanochemical composition. Individual compositional parameters like chemotactic signals, adhesiveness, and pore sizes are well known to be sensed by motile cells, providing individual guidance cues for cellular pathfinding. However, motile cells encounter diverse mechanochemical signals at the same time, raising the question of how cells respond to locally diverse and potentially competing signals on their migration routes. Here, we reveal that motile amoeboid cells require nuclear repositioning, termed nucleokinesis, for adaptive pathfinding in heterogeneous mechanochemical microenvironments. Using mammalian immune cells and the amoeba<jats:italic>Dictyostelium discoideum</jats:italic>, we discover that frequent, rapid and long-distance nucleokinesis is a basic component of amoeboid pathfinding, enabling cells to reorientate quickly between locally competing cues. Amoeboid nucleokinesis comprises a two-step cell polarity switch and is driven by myosin II-forces, sliding the nucleus from a ‘losing’ to the ‘winning’ leading edge to re-adjust the nuclear to the cellular path. Impaired nucleokinesis distorts fast path adaptions and causes cellular arrest in the microenvironment. Our findings establish that nucleokinesis is required for amoeboid cell navigation. Given that motile single-cell amoebae, many immune cells, and some cancer cells utilize an amoeboid migration strategy, these results suggest that amoeboid nucleokinesis underlies cellular navigation during unicellular biology, immunity, and disease.","lang":"eng"}],"article_processing_charge":"Yes (via OA deal)","publisher":"Embo Press","publication":"EMBO Journal","day":"21","type":"journal_article","article_type":"original","quality_controlled":"1","year":"2023","date_created":"2023-08-01T08:59:06Z","citation":{"chicago":"Kroll, Janina, Robert Hauschild, Arthur Kuznetcov, Kasia Stefanowski, Monika D. Hermann, Jack Merrin, Lubuna B Shafeek, Annette Müller-Taubenberger, and Jörg Renkawitz. “Adaptive Pathfinding by Nucleokinesis during Amoeboid Migration.” <i>EMBO Journal</i>. Embo Press, 2023. <a href=\"https://doi.org/10.15252/embj.2023114557\">https://doi.org/10.15252/embj.2023114557</a>.","apa":"Kroll, J., Hauschild, R., Kuznetcov, A., Stefanowski, K., Hermann, M. D., Merrin, J., … Renkawitz, J. (2023). Adaptive pathfinding by nucleokinesis during amoeboid migration. <i>EMBO Journal</i>. Embo Press. <a href=\"https://doi.org/10.15252/embj.2023114557\">https://doi.org/10.15252/embj.2023114557</a>","ista":"Kroll J, Hauschild R, Kuznetcov A, Stefanowski K, Hermann MD, Merrin J, Shafeek LB, Müller-Taubenberger A, Renkawitz J. 2023. Adaptive pathfinding by nucleokinesis during amoeboid migration. EMBO Journal., e114557.","ama":"Kroll J, Hauschild R, Kuznetcov A, et al. Adaptive pathfinding by nucleokinesis during amoeboid migration. <i>EMBO Journal</i>. 2023. doi:<a href=\"https://doi.org/10.15252/embj.2023114557\">10.15252/embj.2023114557</a>","ieee":"J. Kroll <i>et al.</i>, “Adaptive pathfinding by nucleokinesis during amoeboid migration,” <i>EMBO Journal</i>. Embo Press, 2023.","short":"J. Kroll, R. Hauschild, A. Kuznetcov, K. Stefanowski, M.D. Hermann, J. Merrin, L.B. Shafeek, A. Müller-Taubenberger, J. Renkawitz, EMBO Journal (2023).","mla":"Kroll, Janina, et al. “Adaptive Pathfinding by Nucleokinesis during Amoeboid Migration.” <i>EMBO Journal</i>, e114557, Embo Press, 2023, doi:<a href=\"https://doi.org/10.15252/embj.2023114557\">10.15252/embj.2023114557</a>."},"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Adaptive pathfinding by nucleokinesis during amoeboid migration","file_date_updated":"2023-11-27T08:45:56Z","author":[{"first_name":"Janina","full_name":"Kroll, Janina","last_name":"Kroll"},{"id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","first_name":"Robert"},{"last_name":"Kuznetcov","full_name":"Kuznetcov, Arthur","first_name":"Arthur"},{"first_name":"Kasia","last_name":"Stefanowski","full_name":"Stefanowski, Kasia"},{"last_name":"Hermann","full_name":"Hermann, Monika D.","first_name":"Monika D."},{"first_name":"Jack","orcid":"0000-0001-5145-4609","full_name":"Merrin, Jack","id":"4515C308-F248-11E8-B48F-1D18A9856A87","last_name":"Merrin"},{"orcid":"0000-0001-7180-6050","first_name":"Lubuna B","full_name":"Shafeek, Lubuna B","id":"3CD37A82-F248-11E8-B48F-1D18A9856A87","last_name":"Shafeek"},{"last_name":"Müller-Taubenberger","full_name":"Müller-Taubenberger, Annette","first_name":"Annette"},{"first_name":"Jörg","orcid":"0000-0003-2856-3369","last_name":"Renkawitz","id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","full_name":"Renkawitz, Jörg"}],"ddc":["570"],"date_published":"2023-11-21T00:00:00Z","date_updated":"2025-09-09T12:44:04Z","external_id":{"isi":["001120971800001"],"pmid":["37987147"]},"language":[{"iso":"eng"}],"has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","month":"11","doi":"10.15252/embj.2023114557","acknowledgement":"We thank Christoph Mayr and Bingzhi Wang for initial experiments on amoeboid nucleokinesis, Ana-Maria Lennon-Duménil and Aline Yatim for bone marrow from MyoIIA-Flox*CD11c-Cre mice, Michael Sixt and Aglaja Kopf for EMTB-mCherry, EB3-mCherry, Lifeact-GFP, Lfc knockout, and Myh9-GFP expressing HoxB8 cells, Malte Benjamin Braun, Mauricio Ruiz, and Madeleine T. Schmitt for critical reading of the manuscript, and the Core Facility Bioimaging, the Core Facility Flow Cytometry, and the Animal Core Facility of the Biomedical Center (BMC) for excellent support. This study was supported by the Peter Hans Hofschneider Professorship of the foundation “Stiftung Experimentelle Biomedizin” (to JR), the LMU Institutional Strategy LMU-Excellent within the framework of the German Excellence Initiative (to JR), and the Deutsche Forschungsgemeinschaft (DFG; German Research Foundation; SFB914 project A12, to JR), and the CZI grant DAF2020-225401 (https://doi.org/10.37921/120055ratwvi) from the Chan Zuckerberg Initiative DAF (to RH; an advised fund of Silicon Valley Community Foundation (funder https://doi.org/10.13039/100014989)). Open Access funding enabled and organized by Projekt DEAL.","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","publication_identifier":{"eissn":["1460-2075"],"issn":["0261-4189"]},"article_number":"e114557","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"department":[{"_id":"NanoFab"},{"_id":"Bio"}]},{"year":"2023","date_created":"2025-07-10T13:11:47Z","quality_controlled":"1","oa":1,"citation":{"ama":"Balliu A, Korhonen J, Kuhn F, et al. Sinkless Orientation Made Simple. In: <i>Symposium on Simplicity in Algorithms</i>. 2023 Society for Industrial and Applied Mathematics; 2023:175-191. doi:<a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">10.1137/1.9781611977585.ch17</a>","ista":"Balliu A, Korhonen J, Kuhn F, Lievonen H, Olivetti D, Pai S, Paz A, Rybicki J, Schmid S, Studený J, Suomela J, Uitto J. 2023.Sinkless Orientation Made Simple. In: Symposium on Simplicity in Algorithms. , 175–191.","apa":"Balliu, A., Korhonen, J., Kuhn, F., Lievonen, H., Olivetti, D., Pai, S., … Uitto, J. (2023). Sinkless Orientation Made Simple. In <i>Symposium on Simplicity in Algorithms</i> (pp. 175–191). Florence, Italy: 2023 Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">https://doi.org/10.1137/1.9781611977585.ch17</a>","chicago":"Balliu, Alkida, Janne Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, et al. “Sinkless Orientation Made Simple.” In <i>Symposium on Simplicity in Algorithms</i>, 175–91. 2023 Society for Industrial and Applied Mathematics, 2023. <a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">https://doi.org/10.1137/1.9781611977585.ch17</a>.","ieee":"A. Balliu <i>et al.</i>, “Sinkless Orientation Made Simple,” in <i>Symposium on Simplicity in Algorithms</i>, 2023 Society for Industrial and Applied Mathematics, 2023, pp. 175–191.","short":"A. Balliu, J. Korhonen, F. Kuhn, H. Lievonen, D. Olivetti, S. Pai, A. Paz, J. Rybicki, S. Schmid, J. Studený, J. Suomela, J. Uitto, in:, Symposium on Simplicity in Algorithms, 2023 Society for Industrial and Applied Mathematics, 2023, pp. 175–191.","mla":"Balliu, Alkida, et al. “Sinkless Orientation Made Simple.” <i>Symposium on Simplicity in Algorithms</i>, 2023 Society for Industrial and Applied Mathematics, 2023, pp. 175–91, doi:<a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">10.1137/1.9781611977585.ch17</a>."},"ec_funded":1,"title":"Sinkless Orientation Made Simple","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication_status":"published","status":"public","abstract":[{"lang":"eng","text":"The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distributed graph algorithms, LOCAL and SLOCAL: the locality of sinkless orientation is Ω(log n) in the deterministic LOCAL model and O(log log n) in the deterministic SLOCAL model. Both of these results are known by prior work, but here we give new simple, self-contained proofs for them."}],"_id":"19983","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2108.02655"}],"publisher":"2023 Society for Industrial and Applied Mathematics","publication":"Symposium on Simplicity in Algorithms","article_processing_charge":"No","OA_type":"green","type":"book_chapter","page":"175-191","day":"12","doi":"10.1137/1.9781611977585.ch17","publication_identifier":{"eisbn":["9781611977585"]},"acknowledgement":"We thank the anonymous reviewers for their helpful feedback on previous versions of this work. Parts ofthis work appeared in DISC 2021 as a brief announcement [ 21]. This work was supported in part by theEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovationprogramme (grant agreement No 805223 ScaleML), the Academy of Finland (grant agreement No 333837),the Austrian Science Fund (FWF) and netIDEE (grant agreement No P 33775-N), and the AustrianScience Fund (FWF) project DELTA (grant agreement No I 5025-N).","department":[{"_id":"DaAl"}],"date_published":"2023-01-12T00:00:00Z","author":[{"first_name":"Alkida","full_name":"Balliu, Alkida","last_name":"Balliu"},{"last_name":"Korhonen","full_name":"Korhonen, Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne"},{"first_name":"Fabian","last_name":"Kuhn","full_name":"Kuhn, Fabian"},{"full_name":"Lievonen, Henrik","last_name":"Lievonen","first_name":"Henrik"},{"last_name":"Olivetti","full_name":"Olivetti, Dennis","first_name":"Dennis"},{"last_name":"Pai","full_name":"Pai, Shreyas","first_name":"Shreyas"},{"first_name":"Ami","last_name":"Paz","full_name":"Paz, Ami"},{"first_name":"Joel","orcid":"0000-0002-6432-6646","last_name":"Rybicki","full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"first_name":"Jan","full_name":"Studený, Jan","last_name":"Studený"},{"first_name":"Jukka","full_name":"Suomela, Jukka","last_name":"Suomela"},{"full_name":"Uitto, Jara","last_name":"Uitto","first_name":"Jara"}],"date_updated":"2025-09-24T09:24:20Z","project":[{"grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"},{"grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer"}],"OA_place":"repository","conference":{"end_date":"2023-01-25","start_date":"2023-01-23","location":"Florence, Italy","name":"SOSA: Symposium on Simplicity in Algorithms"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["2108.02655"]},"month":"01","oa_version":"Preprint"},{"department":[{"_id":"KrCh"},{"_id":"KrPi"}],"isi":1,"publication_identifier":{"isbn":["9783031327322"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783031327339"]},"acknowledgement":"We thank Mahsa Bastankhah and Mohammad Ali Maddah-Ali for fruitful discussions about different variants of the problem. This work is supported by the European Research Council (ERC) Consolidator Project 864228 (AdjustNet), 2020-2025, the ERC CoG 863818 (ForM-SMArt), and the German Research Foundation (DFG) grant 470029389 (FlexNets), 2021–2024.","doi":"10.1007/978-3-031-32733-9_26","month":"05","oa_version":"None","scopus_import":"1","conference":{"location":"Alcalá de Henares, Spain","name":"SIROCCO: International Colloquium on Structural Information and Communication Complexity","end_date":"2023-06-09","start_date":"2023-06-06"},"language":[{"iso":"eng"}],"external_id":{"isi":["001292782600026"]},"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"}],"date_updated":"2025-12-02T14:02:38Z","alternative_title":["LNCS"],"date_published":"2023-05-25T00:00:00Z","author":[{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"first_name":"Jakub","orcid":"0000-0002-1419-3267","last_name":"Svoboda","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"first_name":"Michelle X","orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","full_name":"Yeo, Michelle X"}],"title":"Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"14820","relation":"later_version"}]},"citation":{"ista":"Schmid S, Svoboda J, Yeo MX. 2023. Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. 30th International Colloquium on Structural Information and Communication Complexity. SIROCCO: International Colloquium on Structural Information and Communication Complexity, LNCS, vol. 13892, 576–594.","ama":"Schmid S, Svoboda J, Yeo MX. Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In: <i>30th International Colloquium on Structural Information and Communication Complexity</i>. Vol 13892. Springer Nature; 2023:576-594. doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">10.1007/978-3-031-32733-9_26</a>","chicago":"Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Acket Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” In <i>30th International Colloquium on Structural Information and Communication Complexity</i>, 13892:576–94. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">https://doi.org/10.1007/978-3-031-32733-9_26</a>.","apa":"Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2023). Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In <i>30th International Colloquium on Structural Information and Communication Complexity</i> (Vol. 13892, pp. 576–594). Alcalá de Henares, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">https://doi.org/10.1007/978-3-031-32733-9_26</a>","short":"S. Schmid, J. Svoboda, M.X. Yeo, in:, 30th International Colloquium on Structural Information and Communication Complexity, Springer Nature, 2023, pp. 576–594.","mla":"Schmid, Stefan, et al. “Weighted Acket Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.” <i>30th International Colloquium on Structural Information and Communication Complexity</i>, vol. 13892, Springer Nature, 2023, pp. 576–94, doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_26\">10.1007/978-3-031-32733-9_26</a>.","ieee":"S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” in <i>30th International Colloquium on Structural Information and Communication Complexity</i>, Alcalá de Henares, Spain, 2023, vol. 13892, pp. 576–594."},"year":"2023","date_created":"2025-07-10T13:15:43Z","quality_controlled":"1","corr_author":"1","type":"conference","page":"576-594","day":"25","volume":13892,"publisher":"Springer Nature","publication":"30th International Colloquium on Structural Information and Communication Complexity","article_processing_charge":"No","OA_type":"closed access","status":"public","intvolume":"     13892","_id":"19985","abstract":[{"text":"We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u, v) is determined by how much nodes u and v allocate for this link. Specifically, the input is a finite ordered sequence of packets that arrive in both directions along a link. Given (u, v) and a packet of weight x going from u to v, node u can either accept or reject the packet. If u accepts the packet, the capacity on link (u, v) decreases by x. Correspondingly, v’s capacity on (u, v) increases by x. If a node rejects the packet, this will entail a cost affinely linear in the weight of the packet. A link is “rechargeable” in the sense that the total capacity of the link has to remain constant, but the allocation of capacity at the ends of the link can depend arbitrarily on the nodes’ decisions. The goal is to minimise the sum of the capacity injected into the link and the cost of rejecting packets. We show that the problem is NP-hard, but can be approximated efficiently with a ratio of (1 + E) . (1 + square3) for some arbitrary E>0.","lang":"eng"}],"publication_status":"published"},{"oa":1,"citation":{"ieee":"L. Dello Schiavo and F. Quattrocchi, “Multivariate Dirichlet moments and a polychromatic Ewens sampling formula,” <i>arXiv</i>. .","mla":"Dello Schiavo, Lorenzo, and Filippo Quattrocchi. “Multivariate Dirichlet Moments and a Polychromatic Ewens Sampling Formula.” <i>ArXiv</i>, 2309.11292, doi:<a href=\"https://doi.org/10.48550/arXiv.2309.11292\">10.48550/arXiv.2309.11292</a>.","short":"L. Dello Schiavo, F. Quattrocchi, ArXiv (n.d.).","chicago":"Dello Schiavo, Lorenzo, and Filippo Quattrocchi. “Multivariate Dirichlet Moments and a Polychromatic Ewens Sampling Formula.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2309.11292\">https://doi.org/10.48550/arXiv.2309.11292</a>.","apa":"Dello Schiavo, L., &#38; Quattrocchi, F. (n.d.). Multivariate Dirichlet moments and a polychromatic Ewens sampling formula. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2309.11292\">https://doi.org/10.48550/arXiv.2309.11292</a>","ista":"Dello Schiavo L, Quattrocchi F. Multivariate Dirichlet moments and a polychromatic Ewens sampling formula. arXiv, 2309.11292.","ama":"Dello Schiavo L, Quattrocchi F. Multivariate Dirichlet moments and a polychromatic Ewens sampling formula. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2309.11292\">10.48550/arXiv.2309.11292</a>"},"date_created":"2025-10-28T13:13:08Z","year":"2023","corr_author":"1","title":"Multivariate Dirichlet moments and a polychromatic Ewens sampling formula","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"20572","abstract":[{"lang":"eng","text":"We present an elementary non-recursive formula for the multivariate moments\r\nof the Dirichlet distribution on the standard simplex, in terms of the pattern\r\ninventory of the moments' exponents. We obtain analog formulas for the\r\nmultivariate moments of the Dirichlet-Ferguson and Gamma measures. We further\r\nintroduce a polychromatic analogue of Ewens sampling formula on colored integer\r\npartitions, discuss its relation with suitable extensions of Hoppe's urn model\r\nand of the Chinese restaurant process, and prove that it satisfies an adapted\r\nnotion of consistency in the sense of Kingman."}],"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2309.11292"}],"arxiv":1,"publication_status":"draft","type":"preprint","keyword":["Dirichlet distribution","Ewens sampling formula","Hoppe urn model","colored partitions"],"day":"20","publication":"arXiv","OA_type":"green","article_processing_charge":"No","acknowledgement":"This research was funded by the Austrian Science Fund (FWF) ESPRIT 208. For the purpose of open access, the authors have applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. F.Q. gratefully acknowledges support by the Austrian Science Fund (FWF), Project SFB F65. The authors are grateful to Professor Nathanaël Berestycki for several helpful suggestions, and to Nicola Battisti and Dr. Elizabeth Hollwey for enlightening discussions on DNA-methylation.","doi":"10.48550/arXiv.2309.11292","department":[{"_id":"GradSch"},{"_id":"JaMa"}],"article_number":"2309.11292","OA_place":"repository","date_updated":"2025-11-24T13:53:48Z","project":[{"name":"Configuration Spaces over Non-Smooth Spaces","_id":"34dbf174-11ca-11ed-8bc3-afe9d43d4b9c","grant_number":"E208"},{"grant_number":"F06504","name":"Taming Complexity in Partial Differential Systems","_id":"260482E2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"date_published":"2023-09-20T00:00:00Z","author":[{"id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","full_name":"Dello Schiavo, Lorenzo","last_name":"Dello Schiavo","orcid":"0000-0002-9881-6870","first_name":"Lorenzo"},{"id":"3ebd6ba8-edfb-11eb-afb5-91a9745ba308","full_name":"Quattrocchi, Filippo","last_name":"Quattrocchi","first_name":"Filippo","orcid":"0009-0000-9773-1931"}],"month":"09","oa_version":"Preprint","language":[{"iso":"eng"}],"external_id":{"arxiv":["2309.11292"]}},{"OA_place":"publisher","date_updated":"2025-01-29T09:07:53Z","author":[{"first_name":"Prashanth","full_name":"Tamizhselvan, Prashanth","last_name":"Tamizhselvan"},{"full_name":"Madhavan, Sharmila","last_name":"Madhavan","first_name":"Sharmila"},{"full_name":"Constan-Aguilar, Christian","last_name":"Constan-Aguilar","first_name":"Christian"},{"last_name":"Elrefaay","full_name":"Elrefaay, Eman Ryad","first_name":"Eman Ryad"},{"first_name":"Jie","full_name":"Liu, Jie","last_name":"Liu"},{"last_name":"Pěnčík","full_name":"Pěnčík, Aleš","first_name":"Aleš"},{"first_name":"Ondřej","full_name":"Novák, Ondřej","last_name":"Novák"},{"last_name":"Cairó","full_name":"Cairó, Albert","first_name":"Albert"},{"full_name":"Hrtyan, Mónika","last_name":"Hrtyan","id":"45A71A74-F248-11E8-B48F-1D18A9856A87","first_name":"Mónika"},{"last_name":"Geisler","full_name":"Geisler, Markus","first_name":"Markus"},{"first_name":"Vanesa Beatriz","last_name":"Tognetti","full_name":"Tognetti, Vanesa Beatriz"}],"date_published":"2023-12-19T00:00:00Z","ddc":["580"],"oa_version":"Published Version","scopus_import":"1","has_accepted_license":"1","month":"12","external_id":{"pmid":["38202315"]},"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2223-7747"]},"doi":"10.3390/plants13010007","department":[{"_id":"EvBe"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"article_number":"7","pmid":1,"_id":"18942","intvolume":"        13","abstract":[{"lang":"eng","text":"Photosynthesis is among the first processes negatively affected by environmental cues and its performance directly determines plant cell fitness and ultimately crop yield. Primarily sites of photosynthesis, chloroplasts are unique sites also for the biosynthesis of precursors of the growth regulator auxin and for sensing environmental stress, but their role in intracellular auxin homeostasis, vital for plant growth and survival in changing environments, remains poorly understood. Here, we identified two ATP-binding cassette (ABC) subfamily B transporters, ABCB28 and ABCB29, which export auxin across the chloroplast envelope to the cytosol in a concerted action in vivo. Moreover, we provide evidence for an auxin biosynthesis pathway in Arabidopsis thaliana chloroplasts. The overexpression of ABCB28 and ABCB29 influenced stomatal regulation and resulted in significantly improved water use efficiency and survival rates during salt and drought stresses. Our results suggest that chloroplast auxin production and transport contribute to stomata regulation for conserving water upon salt stress. ABCB28 and ABCB29 integrate photosynthesis and auxin signals and as such hold great potential to improve the adaptation potential of crops to environmental cues."}],"status":"public","publication_status":"published","file":[{"file_id":"18943","access_level":"open_access","checksum":"97efcefa8151d69343b0b641630c86ee","file_size":6231778,"success":1,"creator":"dernst","date_updated":"2025-01-29T09:06:51Z","relation":"main_file","content_type":"application/pdf","file_name":"2023_Plants_Tamizhselvan.pdf","date_created":"2025-01-29T09:06:51Z"}],"volume":13,"day":"19","type":"journal_article","DOAJ_listed":"1","OA_type":"gold","article_processing_charge":"Yes","publication":"Plants","issue":"1","publisher":"MDPI","citation":{"apa":"Tamizhselvan, P., Madhavan, S., Constan-Aguilar, C., Elrefaay, E. R., Liu, J., Pěnčík, A., … Tognetti, V. B. (2023). Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis. <i>Plants</i>. MDPI. <a href=\"https://doi.org/10.3390/plants13010007\">https://doi.org/10.3390/plants13010007</a>","chicago":"Tamizhselvan, Prashanth, Sharmila Madhavan, Christian Constan-Aguilar, Eman Ryad Elrefaay, Jie Liu, Aleš Pěnčík, Ondřej Novák, et al. “Chloroplast Auxin Efflux Mediated by ABCB28 and ABCB29 Fine-Tunes Salt and Drought Stress Responses in Arabidopsis.” <i>Plants</i>. MDPI, 2023. <a href=\"https://doi.org/10.3390/plants13010007\">https://doi.org/10.3390/plants13010007</a>.","ama":"Tamizhselvan P, Madhavan S, Constan-Aguilar C, et al. Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis. <i>Plants</i>. 2023;13(1). doi:<a href=\"https://doi.org/10.3390/plants13010007\">10.3390/plants13010007</a>","ista":"Tamizhselvan P, Madhavan S, Constan-Aguilar C, Elrefaay ER, Liu J, Pěnčík A, Novák O, Cairó A, Hrtyan M, Geisler M, Tognetti VB. 2023. Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis. Plants. 13(1), 7.","mla":"Tamizhselvan, Prashanth, et al. “Chloroplast Auxin Efflux Mediated by ABCB28 and ABCB29 Fine-Tunes Salt and Drought Stress Responses in Arabidopsis.” <i>Plants</i>, vol. 13, no. 1, 7, MDPI, 2023, doi:<a href=\"https://doi.org/10.3390/plants13010007\">10.3390/plants13010007</a>.","ieee":"P. Tamizhselvan <i>et al.</i>, “Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis,” <i>Plants</i>, vol. 13, no. 1. MDPI, 2023.","short":"P. Tamizhselvan, S. Madhavan, C. Constan-Aguilar, E.R. Elrefaay, J. Liu, A. Pěnčík, O. Novák, A. Cairó, M. Hrtyan, M. Geisler, V.B. Tognetti, Plants 13 (2023)."},"oa":1,"quality_controlled":"1","article_type":"original","date_created":"2025-01-29T09:03:56Z","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2025-01-29T09:06:51Z","title":"Chloroplast auxin efflux mediated by ABCB28 and ABCB29 fine-tunes salt and drought stress responses in Arabidopsis"},{"department":[{"_id":"VaKa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Dynamische Systeme","citation":{"apa":"Arnaud, M.-C., Hutchings, M., &#38; Kaloshin, V. (2023). Dynamische Systeme. <i>Oberwolfach Reports</i>. EMS Press. <a href=\"https://doi.org/10.4171/owr/2023/30\">https://doi.org/10.4171/owr/2023/30</a>","chicago":"Arnaud, Marie-Claude, Michael Hutchings, and Vadim Kaloshin. “Dynamische Systeme.” <i>Oberwolfach Reports</i>. EMS Press, 2023. <a href=\"https://doi.org/10.4171/owr/2023/30\">https://doi.org/10.4171/owr/2023/30</a>.","ama":"Arnaud M-C, Hutchings M, Kaloshin V. Dynamische Systeme. <i>Oberwolfach Reports</i>. 2023;20(3):1671-1730. doi:<a href=\"https://doi.org/10.4171/owr/2023/30\">10.4171/owr/2023/30</a>","ista":"Arnaud M-C, Hutchings M, Kaloshin V. 2023. Dynamische Systeme. Oberwolfach Reports. 20(3), 1671–1730.","mla":"Arnaud, Marie-Claude, et al. “Dynamische Systeme.” <i>Oberwolfach Reports</i>, vol. 20, no. 3, EMS Press, 2023, pp. 1671–730, doi:<a href=\"https://doi.org/10.4171/owr/2023/30\">10.4171/owr/2023/30</a>.","ieee":"M.-C. Arnaud, M. Hutchings, and V. Kaloshin, “Dynamische Systeme,” <i>Oberwolfach Reports</i>, vol. 20, no. 3. EMS Press, pp. 1671–1730, 2023.","short":"M.-C. Arnaud, M. Hutchings, V. Kaloshin, Oberwolfach Reports 20 (2023) 1671–1730."},"acknowledgement":"The MFO and the workshop organizers would like to thank the National Science Foundation for supporting the participation of junior researchers in the workshop by the grant DMS-2230648, “US Junior Oberwolfach Fellows”.","publication_identifier":{"issn":["1660-8933"],"eissn":["1660-8941"]},"quality_controlled":"1","article_type":"original","doi":"10.4171/owr/2023/30","date_created":"2025-01-29T13:19:15Z","year":"2023","volume":20,"oa_version":"None","day":"09","page":"1671-1730","month":"07","type":"journal_article","article_processing_charge":"No","publication":"Oberwolfach Reports","language":[{"iso":"eng"}],"issue":"3","publisher":"EMS Press","_id":"18959","intvolume":"        20","abstract":[{"text":"This workshop continues a series of workshops whose current format originated in 1981 under then-organizers Moser and Zehnder, and whose latest iteration took place in July 2023. The general goal of this series of workshops is to discuss the latest developments in the field of dynamical systems, broadly construed, and its connections with neighboring areas of mathematics such as differential geometry, partial differential equations, and more recently contact and symplectic geometry. We continued this tradition, bringing in new participants working in areas of dynamical systems and its connections with other areas of mathematics that are currently highly active and/or showing great promise for future development. Key focus areas for the 2023 workshop include spectral rigidity for planar domains, chaotic and oscillatory motions in celestial mechanics, conformal symplectic dynamics, and relations between dynamics.he workshop by the grant DMS-2230648, “US Junior Oberwolfach Fellows”.","lang":"eng"}],"status":"public","date_updated":"2025-01-29T13:23:15Z","publication_status":"published","author":[{"last_name":"Arnaud","full_name":"Arnaud, Marie-Claude","first_name":"Marie-Claude"},{"last_name":"Hutchings","full_name":"Hutchings, Michael","first_name":"Michael"},{"orcid":"0000-0002-6051-2628","first_name":"Vadim","full_name":"Kaloshin, Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","last_name":"Kaloshin"}],"date_published":"2023-07-09T00:00:00Z"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"related_material":{"record":[{"relation":"used_in_publication","id":"13968","status":"public"}]},"department":[{"_id":"MaIb"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing","citation":{"mla":"Hasler, Roger, et al. <i>Optical and Electronic Signal Stabilization of Plasmonic Fiber Optic Gate Electrodes: Towards Improved Real-Time Dual-Mode Biosensing</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7716920\">10.5281/ZENODO.7716920</a>.","ieee":"R. Hasler <i>et al.</i>, “Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing.” Zenodo, 2023.","short":"R. Hasler, M.-H. Polt, C. Reiner-Rozman, S. Fossati, S. Lee, P. Aspermair, C. Kleber, M. Ibáñez, J. Dostalek, W. Knoll, (2023).","chicago":"Hasler, Roger, Marie-Helene Polt, Ciril Reiner-Rozman, Stefan Fossati, Seungho Lee, Patrik Aspermair, Christoph Kleber, Maria Ibáñez, Jakub Dostalek, and Wolfgang Knoll. “Optical and Electronic Signal Stabilization of Plasmonic Fiber Optic Gate Electrodes: Towards Improved Real-Time Dual-Mode Biosensing.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7716920\">https://doi.org/10.5281/ZENODO.7716920</a>.","apa":"Hasler, R., Polt, M.-H., Reiner-Rozman, C., Fossati, S., Lee, S., Aspermair, P., … Knoll, W. (2023). Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7716920\">https://doi.org/10.5281/ZENODO.7716920</a>","ista":"Hasler R, Polt M-H, Reiner-Rozman C, Fossati S, Lee S, Aspermair P, Kleber C, Ibáñez M, Dostalek J, Knoll W. 2023. Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7716920\">10.5281/ZENODO.7716920</a>.","ama":"Hasler R, Polt M-H, Reiner-Rozman C, et al. Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7716920\">10.5281/ZENODO.7716920</a>"},"oa":1,"doi":"10.5281/ZENODO.7716920","date_created":"2025-03-07T08:40:58Z","year":"2023","oa_version":"None","has_accepted_license":"1","day":"14","month":"07","type":"research_data_reference","OA_type":"green","article_processing_charge":"No","publisher":"Zenodo","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/ZENODO.7716920"}],"_id":"19308","OA_place":"repository","abstract":[{"text":"This Dataset contains the raw data from the following publication: \"Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: towards improved real-time dual-mode biosensing\" (DOI 10.3389/fphy.2023.1202132)","lang":"eng"}],"status":"public","date_updated":"2025-03-11T08:00:42Z","author":[{"full_name":"Hasler, Roger","last_name":"Hasler","first_name":"Roger"},{"first_name":"Marie-Helene","last_name":"Polt","full_name":"Polt, Marie-Helene"},{"last_name":"Reiner-Rozman","full_name":"Reiner-Rozman, Ciril","first_name":"Ciril"},{"last_name":"Fossati","full_name":"Fossati, Stefan","first_name":"Stefan"},{"first_name":"Seungho","full_name":"Lee, Seungho","last_name":"Lee"},{"first_name":"Patrik","last_name":"Aspermair","full_name":"Aspermair, Patrik"},{"first_name":"Christoph","last_name":"Kleber","full_name":"Kleber, Christoph"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","first_name":"Maria"},{"first_name":"Jakub","last_name":"Dostalek","full_name":"Dostalek, Jakub"},{"first_name":"Wolfgang","full_name":"Knoll, Wolfgang","last_name":"Knoll"}],"date_published":"2023-07-14T00:00:00Z","ddc":["540"]},{"citation":{"ieee":"Z. Avarikioti, A. Desjardins, E. Kokoris Kogias, and R. Wattenhofer, “Divide &#38; Scale: Formalization and roadmap to robust sharding,” in <i>30th International Colloquium on Structural Information and Communication Complexity</i>, Alcalá de Henares, Spain, 2023, vol. 13892, pp. 199–245.","mla":"Avarikioti, Zeta, et al. “Divide &#38; Scale: Formalization and Roadmap to Robust Sharding.” <i>30th International Colloquium on Structural Information and Communication Complexity</i>, vol. 13892, Springer Nature, 2023, pp. 199–245, doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_10\">10.1007/978-3-031-32733-9_10</a>.","short":"Z. Avarikioti, A. Desjardins, E. Kokoris Kogias, R. Wattenhofer, in:, 30th International Colloquium on Structural Information and Communication Complexity, Springer Nature, 2023, pp. 199–245.","ama":"Avarikioti Z, Desjardins A, Kokoris Kogias E, Wattenhofer R. Divide &#38; Scale: Formalization and roadmap to robust sharding. In: <i>30th International Colloquium on Structural Information and Communication Complexity</i>. Vol 13892. Springer Nature; 2023:199-245. doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_10\">10.1007/978-3-031-32733-9_10</a>","ista":"Avarikioti Z, Desjardins A, Kokoris Kogias E, Wattenhofer R. 2023. Divide &#38; Scale: Formalization and roadmap to robust sharding. 30th International Colloquium on Structural Information and Communication Complexity. SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 13892, 199–245.","apa":"Avarikioti, Z., Desjardins, A., Kokoris Kogias, E., &#38; Wattenhofer, R. (2023). Divide &#38; Scale: Formalization and roadmap to robust sharding. In <i>30th International Colloquium on Structural Information and Communication Complexity</i> (Vol. 13892, pp. 199–245). Alcalá de Henares, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_10\">https://doi.org/10.1007/978-3-031-32733-9_10</a>","chicago":"Avarikioti, Zeta, Antoine Desjardins, Eleftherios Kokoris Kogias, and Roger Wattenhofer. “Divide &#38; Scale: Formalization and Roadmap to Robust Sharding.” In <i>30th International Colloquium on Structural Information and Communication Complexity</i>, 13892:199–245. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_10\">https://doi.org/10.1007/978-3-031-32733-9_10</a>."},"date_created":"2024-01-08T12:56:46Z","year":"2023","quality_controlled":"1","title":"Divide & Scale: Formalization and roadmap to robust sharding","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"14744","abstract":[{"lang":"eng","text":"Sharding distributed ledgers is a promising on-chain solution for scaling blockchains but lacks formal grounds, nurturing skepticism on whether such complex systems can scale blockchains securely. We fill this gap by introducing the first formal framework as well as a roadmap to robust sharding. In particular, we first define the properties sharded distributed ledgers should fulfill. We build upon and extend the Bitcoin backbone protocol by defining consistency and scalability. Consistency encompasses the need for atomic execution of cross-shard transactions to preserve safety, whereas scalability encapsulates the speedup a sharded system can gain in comparison to a non-sharded system.\r\nUsing our model, we explore the limitations of sharding. We show that a sharded ledger with n participants cannot scale under a fully adaptive adversary, but it can scale up to m shards where n=c'm log m, under an epoch-adaptive adversary; the constant c' encompasses the trade-off between security and scalability. This is possible only if the sharded ledgers create succinct proofs of the valid state updates at every epoch. We leverage our results to identify the sufficient components for robust sharding, which we incorporate in a protocol abstraction termed Divide & Scale. To demonstrate the power of our framework, we analyze the most prominent sharded blockchains (Elastico, Monoxide, OmniLedger, RapidChain) and pinpoint where they fail to meet the desired properties."}],"intvolume":"     13892","status":"public","publication_status":"published","type":"conference","volume":13892,"page":"199-245","day":"01","publication":"30th International Colloquium on Structural Information and Communication Complexity","publisher":"Springer Nature","article_processing_charge":"No","publication_identifier":{"isbn":["9783031327322"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783031327339"]},"acknowledgement":"The work was partially supported by the Austrian Science Fund (FWF) through the project CoRaF (grant agreement 2020388).","doi":"10.1007/978-3-031-32733-9_10","department":[{"_id":"ElKo"}],"isi":1,"date_updated":"2025-09-09T14:10:46Z","date_published":"2023-06-01T00:00:00Z","alternative_title":["LNCS"],"author":[{"first_name":"Zeta","full_name":"Avarikioti, Zeta","last_name":"Avarikioti"},{"first_name":"Antoine","last_name":"Desjardins","id":"06d0c166-aec1-11ee-a7c0-b96e840a602b","full_name":"Desjardins, Antoine"},{"first_name":"Eleftherios","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"first_name":"Roger","full_name":"Wattenhofer, Roger","last_name":"Wattenhofer"}],"month":"06","scopus_import":"1","oa_version":"None","language":[{"iso":"eng"}],"conference":{"start_date":"2023-06-06","end_date":"2023-06-09","name":"SIROCCO: Structural Information and Communication Complexity","location":"Alcalá de Henares, Spain"},"external_id":{"isi":["001292782600010"]}},{"_id":"14748","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083"}],"date_updated":"2025-04-14T12:58:27Z","status":"public","date_published":"2023-08-01T00:00:00Z","publication_status":"published","author":[{"id":"0b467602-dbcd-11ea-9d1d-ed480aa46b70","last_name":"Chen","full_name":"Chen, Yi-Lu","first_name":"Yi-Lu"},{"full_name":"Ly, Mickaël","id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","last_name":"Ly","first_name":"Mickaël"},{"orcid":"0000-0001-6646-5546","first_name":"Christopher J","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan"}],"month":"08","type":"conference_abstract","oa_version":"None","day":"01","language":[{"iso":"eng"}],"publication":"Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation","acknowledged_ssus":[{"_id":"ScienComp"}],"publisher":"Association for Computing Machinery","conference":{"location":"Los Angeles, CA, United States","name":"SCA: Symposium on Computer Animation","end_date":"2023-08-06","start_date":"2023-08-04"},"article_processing_charge":"No","publication_identifier":{"isbn":["9798400702686"]},"citation":{"apa":"Chen, Y.-L., Ly, M., &#38; Wojtan, C. (2023). Unified treatment of contact, friction and shock-propagation in rigid body animation. In <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3606037.3606836\">https://doi.org/10.1145/3606037.3606836</a>","chicago":"Chen, Yi-Lu, Mickaël Ly, and Chris Wojtan. “Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation.” In <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3606037.3606836\">https://doi.org/10.1145/3606037.3606836</a>.","ama":"Chen Y-L, Ly M, Wojtan C. Unified treatment of contact, friction and shock-propagation in rigid body animation. In: <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>. Association for Computing Machinery; 2023. doi:<a href=\"https://doi.org/10.1145/3606037.3606836\">10.1145/3606037.3606836</a>","ista":"Chen Y-L, Ly M, Wojtan C. 2023. Unified treatment of contact, friction and shock-propagation in rigid body animation. Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation. SCA: Symposium on Computer Animation, 5.","mla":"Chen, Yi-Lu, et al. “Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation.” <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>, 5, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3606037.3606836\">10.1145/3606037.3606836</a>.","ieee":"Y.-L. Chen, M. Ly, and C. Wojtan, “Unified treatment of contact, friction and shock-propagation in rigid body animation,” in <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>, Los Angeles, CA, United States, 2023.","short":"Y.-L. Chen, M. Ly, C. Wojtan, in:, Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation, Association for Computing Machinery, 2023."},"acknowledgement":"We thank the anonymous reviewers and the members of the Visual Computing Group at ISTA for their helpful comments. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing, and was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA).","doi":"10.1145/3606037.3606836","date_created":"2024-01-08T13:00:24Z","year":"2023","corr_author":"1","quality_controlled":"1","title":"Unified treatment of contact, friction and shock-propagation in rigid body animation","department":[{"_id":"ChWo"}],"related_material":{"record":[{"id":"15292","relation":"other","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"5"},{"author":[{"first_name":"Umang","last_name":"Mishra","id":"4328fa4c-f128-11eb-9611-c107b0fe4d51","full_name":"Mishra, Umang"},{"first_name":"Vyacheslav","full_name":"Li, Vyacheslav","id":"3A4FAA92-F248-11E8-B48F-1D18A9856A87","last_name":"Li"},{"last_name":"Wald","full_name":"Wald, Sebastian","id":"133F200A-B015-11E9-AD41-0EDAE5697425","first_name":"Sebastian","orcid":"0000-0002-5869-1604"},{"first_name":"Sofya","orcid":"0000-0003-0582-2946","last_name":"Agafonova","full_name":"Agafonova, Sofya","id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80"},{"last_name":"Diorico","id":"2E054C4C-F248-11E8-B48F-1D18A9856A87","full_name":"Diorico, Fritz R","first_name":"Fritz R","orcid":"0000-0002-4947-8924"},{"last_name":"Hosten","full_name":"Hosten, Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","first_name":"Onur"}],"date_published":"2023-07-21T00:00:00Z","date_updated":"2025-12-16T12:52:55Z","external_id":{"isi":["001051044600008"],"arxiv":["2212.01266"]},"language":[{"iso":"eng"}],"oa_version":"Preprint","scopus_import":"1","month":"07","doi":"10.1364/ol.495553","publication_identifier":{"eissn":["1539-4794"],"issn":["0146-9592"]},"department":[{"_id":"OnHo"}],"isi":1,"publication_status":"published","arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2212.01266","open_access":"1"}],"abstract":[{"text":"We unveil a powerful method for the stabilization of laser injection locking based on sensing variations in the output beam ellipticity of an optically seeded laser. The effect arises due to an interference between the seeding beam and the injected laser output. We demonstrate the method for a commercial semiconductor laser without the need for any internal changes to the readily operational injection locked laser system that was used. The method can also be used to increase the mode-hop free tuning range of lasers, and has the potential to fill a void in the low-noise laser industry.","lang":"eng"}],"_id":"14749","intvolume":"        48","status":"public","article_processing_charge":"No","issue":"15","publication":"Optics Letters","publisher":"Optica Publishing Group","volume":48,"keyword":["Atomic and Molecular Physics","and Optics"],"page":"3973-3976","day":"21","type":"journal_article","quality_controlled":"1","corr_author":"1","article_type":"original","date_created":"2024-01-08T13:01:46Z","year":"2023","citation":{"apa":"Mishra, U., Li, V., Wald, S., Agafonova, S., Diorico, F. R., &#38; Hosten, O. (2023). Monitoring and active stabilization of laser injection locking using beam ellipticity. <i>Optics Letters</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/ol.495553\">https://doi.org/10.1364/ol.495553</a>","chicago":"Mishra, Umang, Vyacheslav Li, Sebastian Wald, Sofya Agafonova, Fritz R Diorico, and Onur Hosten. “Monitoring and Active Stabilization of Laser Injection Locking Using Beam Ellipticity.” <i>Optics Letters</i>. Optica Publishing Group, 2023. <a href=\"https://doi.org/10.1364/ol.495553\">https://doi.org/10.1364/ol.495553</a>.","ama":"Mishra U, Li V, Wald S, Agafonova S, Diorico FR, Hosten O. Monitoring and active stabilization of laser injection locking using beam ellipticity. <i>Optics Letters</i>. 2023;48(15):3973-3976. doi:<a href=\"https://doi.org/10.1364/ol.495553\">10.1364/ol.495553</a>","ista":"Mishra U, Li V, Wald S, Agafonova S, Diorico FR, Hosten O. 2023. Monitoring and active stabilization of laser injection locking using beam ellipticity. Optics Letters. 48(15), 3973–3976.","ieee":"U. Mishra, V. Li, S. Wald, S. Agafonova, F. R. Diorico, and O. Hosten, “Monitoring and active stabilization of laser injection locking using beam ellipticity,” <i>Optics Letters</i>, vol. 48, no. 15. Optica Publishing Group, pp. 3973–3976, 2023.","short":"U. Mishra, V. Li, S. Wald, S. Agafonova, F.R. Diorico, O. Hosten, Optics Letters 48 (2023) 3973–3976.","mla":"Mishra, Umang, et al. “Monitoring and Active Stabilization of Laser Injection Locking Using Beam Ellipticity.” <i>Optics Letters</i>, vol. 48, no. 15, Optica Publishing Group, 2023, pp. 3973–76, doi:<a href=\"https://doi.org/10.1364/ol.495553\">10.1364/ol.495553</a>."},"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Monitoring and active stabilization of laser injection locking using beam ellipticity"}]