[{"file_date_updated":"2024-09-17T09:35:03Z","publication_status":"published","year":"2024","month":"09","volume":311,"author":[{"first_name":"Guy","orcid":"0000-0001-5588-8287","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy"},{"first_name":"Ehsan Kafshdar","last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"},{"orcid":"0000-0001-9864-7475","first_name":"Kaushik","last_name":"Mallik","full_name":"Mallik, Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"}],"alternative_title":["LIPIcs"],"arxiv":1,"ddc":["000"],"date_updated":"2025-12-02T13:46:11Z","intvolume":"       311","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"status":"public","has_accepted_license":"1","external_id":{"arxiv":["2407.06288"],"isi":["001556847400008"]},"abstract":[{"text":"Graph games lie at the algorithmic core of many automated design problems in computer science. These are games usually played between two players on a given graph, where the players keep moving a token along the edges according to pre-determined rules (turn-based, concurrent, etc.), and the winner is decided based on the infinite path (aka play) traversed by the token from a given initial position. In bidding games, the players initially get some monetary budgets which they need to use to bid for the privilege of moving the token at each step. Each round of bidding affects the players' available budgets, which is the only form of update that the budgets experience. We introduce bidding games with charging where the players can additionally improve their budgets during the game by collecting vertex-dependent monetary rewards, aka the \"charges.\" Unlike traditional bidding games (where all charges are zero), bidding games with charging allow non-trivial recurrent behaviors. For example, a reachability objective may require multiple detours to vertices with high charges to earn additional budget. We show that, nonetheless, the central property of traditional bidding games generalizes to bidding games with charging: For each vertex there exists a threshold ratio, which is the necessary and sufficient fraction of the total budget for winning the game from that vertex. While the thresholds of traditional bidding games correspond to unique fixed points of linear systems of equations, in games with charging, these fixed points are no longer unique. This significantly complicates the proof of existence and the algorithmic computation of thresholds for infinite-duration objectives. We also provide the lower complexity bounds for computing thresholds for Rabin and Streett objectives, which are the first known lower bounds in any form of bidding games (with or without charging), and we solve the following repair problem for safety and reachability games that have unsatisfiable objectives: Can we distribute a given amount of charge to the players in a way such that the objective can be satisfied?","lang":"eng"}],"type":"conference","corr_author":"1","scopus_import":"1","oa_version":"Published Version","publication":"35th International Conference on Concurrency Theory","date_created":"2024-09-15T22:01:39Z","language":[{"iso":"eng"}],"citation":{"mla":"Avni, Guy, et al. “Bidding Games with Charging.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">10.4230/LIPIcs.CONCUR.2024.8</a>.","short":"G. Avni, E.K. Goharshady, T.A. Henzinger, K. Mallik, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","apa":"Avni, G., Goharshady, E. K., Henzinger, T. A., &#38; Mallik, K. (2024). Bidding games with charging. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.8</a>","ista":"Avni G, Goharshady EK, Henzinger TA, Mallik K. 2024. Bidding games with charging. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 8.","ieee":"G. Avni, E. K. Goharshady, T. A. Henzinger, and K. Mallik, “Bidding games with charging,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311.","ama":"Avni G, Goharshady EK, Henzinger TA, Mallik K. Bidding games with charging. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">10.4230/LIPIcs.CONCUR.2024.8</a>","chicago":"Avni, Guy, Ehsan Kafshdar Goharshady, Thomas A Henzinger, and Kaushik Mallik. “Bidding Games with Charging.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.8</a>."},"ec_funded":1,"title":"Bidding games with charging","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","license":"https://creativecommons.org/licenses/by/4.0/","department":[{"_id":"ToHe"}],"day":"01","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773393"]},"article_processing_charge":"Yes","conference":{"location":"Calgary, Canada","start_date":"2024-09-09","end_date":"2024-09-13","name":"CONCUR: Conference on Concurrency Theory"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"file_size":854430,"file_name":"2024_LIPICS_Avni.pdf","file_id":"18083","date_updated":"2024-09-17T09:35:03Z","success":1,"checksum":"cb6f2254b84922cd7bf224f550b73f4a","access_level":"open_access","creator":"dernst","relation":"main_file","content_type":"application/pdf","date_created":"2024-09-17T09:35:03Z"}],"isi":1,"acknowledgement":"This work was supported in part by the ERC projects ERC-2020-AdG 101020093 and CoG 863818 (ForM-SMArt) and by ISF grant no. 1679/21.","doi":"10.4230/LIPIcs.CONCUR.2024.8","article_number":"8","quality_controlled":"1","_id":"18066","date_published":"2024-09-01T00:00:00Z"},{"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","last_name":"Boker","first_name":"Udi"},{"first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Lehtinen","first_name":"Karoliina","full_name":"Lehtinen, Karoliina"},{"full_name":"Prakash, Aditya","first_name":"Aditya","last_name":"Prakash"}],"alternative_title":["LIPIcs"],"publication_status":"published","file_date_updated":"2024-09-17T07:31:18Z","year":"2024","month":"09","volume":311,"has_accepted_license":"1","external_id":{"isi":["001556847400012"],"arxiv":["2407.08620"]},"status":"public","abstract":[{"text":"An automaton 𝒜 is history-deterministic if its nondeterminism can be resolved on the fly, only using the prefix of the word read so far. This mild form of nondeterminism has attracted particular attention for its applications in synthesis problems. An automaton 𝒜 is guidable with respect to a class C of automata if it can fairly simulate every automaton in C, whose language is contained in that of 𝒜. In other words, guidable automata are those for which inclusion and simulation coincide, making them particularly interesting for model-checking. We study the connection between these two notions, and specifically the question of when they coincide. For classes of automata on which they do, deciding guidability, an otherwise challenging decision problem, reduces to deciding history-determinism, a problem that is starting to be well-understood for many classes. We provide a selection of sufficient criteria for a class of automata to guarantee the coincidence of the notions, and use them to show that the notions coincide for the most common automata classes, among which are ω-regular automata and many infinite-state automata with safety and reachability acceptance conditions, including vector addition systems with states, one-counter nets, pushdown-, Parikh-, and timed-automata. We also demonstrate that history-determinism and guidability do not always coincide, for example, for the classes of timed automata with a fixed number of clocks.","lang":"eng"}],"corr_author":"1","type":"conference","oa_version":"Published Version","date_created":"2024-09-15T22:01:40Z","publication":"35th International Conference on Concurrency Theory","scopus_import":"1","language":[{"iso":"eng"}],"ec_funded":1,"citation":{"chicago":"Boker, Udi, Thomas A Henzinger, Karoliina Lehtinen, and Aditya Prakash. “History-Determinism vs Fair Simulation.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.12</a>.","short":"U. Boker, T.A. Henzinger, K. Lehtinen, A. Prakash, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","mla":"Boker, Udi, et al. “History-Determinism vs Fair Simulation.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">10.4230/LIPIcs.CONCUR.2024.12</a>.","ista":"Boker U, Henzinger TA, Lehtinen K, Prakash A. 2024. History-determinism vs fair simulation. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 12.","ieee":"U. Boker, T. A. Henzinger, K. Lehtinen, and A. Prakash, “History-determinism vs fair simulation,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311.","ama":"Boker U, Henzinger TA, Lehtinen K, Prakash A. History-determinism vs fair simulation. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">10.4230/LIPIcs.CONCUR.2024.12</a>","apa":"Boker, U., Henzinger, T. A., Lehtinen, K., &#38; Prakash, A. (2024). History-determinism vs fair simulation. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.12</a>"},"ddc":["000"],"arxiv":1,"date_updated":"2025-12-02T13:44:54Z","intvolume":"       311","project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"isbn":["9783959773393"],"issn":["1868-8969"]},"article_processing_charge":"No","title":"History-determinism vs fair simulation","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"day":"01","article_number":"12","date_published":"2024-09-01T00:00:00Z","_id":"18067","quality_controlled":"1","conference":{"start_date":"2024-09-09","location":"Calgary, Canada","end_date":"2024-09-13","name":"CONCUR: Conference on Concurrency Theory"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":"Udi Boker: Israel Science Foundation grant 2410/22\r\nThomas A. Henzinger: ERC-2020-AdG 101020093 (VAMOS)\r\nKaroliina Lehtinen: ANR QUASY 23-CE48-0008-01\r\nAditya Prakash: Chancellors’ International Scholarship from the University of Warwick and Centre for Discrete Mathematics and Its Applications (DIMAP)","file":[{"access_level":"open_access","creator":"dernst","relation":"main_file","date_created":"2024-09-17T07:31:18Z","content_type":"application/pdf","file_size":766902,"file_name":"2024_LIPICS_Boker.pdf","file_id":"18080","date_updated":"2024-09-17T07:31:18Z","checksum":"66db11ef8e600a434079c278050c3f09","success":1}],"isi":1,"doi":"10.4230/LIPIcs.CONCUR.2024.12"},{"conference":{"start_date":"2024-09-09","location":"Calgary, Canada","end_date":"2024-09-13","name":"CONCUR: Conference on Concurrency Theory"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","isi":1,"doi":"10.4230/LIPIcs.CONCUR.2024.29","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. N. Mazzocchi was affiliated with ISTA when this work was submitted for publication.","file":[{"date_created":"2024-09-17T07:48:56Z","content_type":"application/pdf","creator":"dernst","relation":"main_file","access_level":"open_access","success":1,"checksum":"555bd343e1fb38adeab8fc465ff4fad8","file_id":"18081","file_name":"2024_LIPICS_Henzinger.pdf","date_updated":"2024-09-17T07:48:56Z","file_size":964124}],"article_number":"29","quality_controlled":"1","_id":"18068","date_published":"2024-09-01T00:00:00Z","oa":1,"title":"Strategic dominance: A new preorder for nondeterministic processes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"day":"01","publication_identifier":{"isbn":["9783959773393"],"issn":["1868-8969"]},"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"Yes","date_updated":"2025-12-02T13:45:38Z","ddc":["000"],"arxiv":1,"intvolume":"       311","OA_place":"publisher","OA_type":"gold","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"abstract":[{"text":"We study the following refinement relation between nondeterministic state-transition models: model ℬ strategically dominates model 𝒜 iff every deterministic refinement of 𝒜 is language contained in some deterministic refinement of ℬ. While language containment is trace inclusion, and the (fair) simulation preorder coincides with tree inclusion, strategic dominance falls strictly between the two and can be characterized as \"strategy inclusion\" between 𝒜 and ℬ: every strategy that resolves the nondeterminism of 𝒜 is dominated by a strategy that resolves the nondeterminism of ℬ. Strategic dominance can be checked in 2-ExpTime by a decidable first-order Presburger logic with quantification over words and strategies, called resolver logic. We give several other applications of resolver logic, including checking the co-safety, co-liveness, and history-determinism of boolean and quantitative automata, and checking the inclusion between hyperproperties that are specified by nondeterministic boolean and quantitative automata.","lang":"eng"}],"external_id":{"isi":["001556847400029"],"arxiv":["2407.10473"]},"status":"public","has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","publication":"35th International Conference on Concurrency Theory","date_created":"2024-09-15T22:01:40Z","corr_author":"1","type":"conference","citation":{"short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","mla":"Henzinger, Thomas A., et al. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">10.4230/LIPIcs.CONCUR.2024.29</a>.","ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2024. Strategic dominance: A new preorder for nondeterministic processes. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 29.","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Strategic dominance: A new preorder for nondeterministic processes,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Strategic dominance: A new preorder for nondeterministic processes. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">10.4230/LIPIcs.CONCUR.2024.29</a>","apa":"Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2024). Strategic dominance: A new preorder for nondeterministic processes. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.29</a>","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.29</a>."},"ec_funded":1,"language":[{"iso":"eng"}],"file_date_updated":"2024-09-17T07:48:56Z","publication_status":"published","year":"2024","month":"09","volume":311,"author":[{"first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien","first_name":"Nicolas Adrien","last_name":"Mazzocchi"},{"first_name":"Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E"}],"alternative_title":["LIPIcs"]},{"language":[{"iso":"eng"}],"article_type":"original","citation":{"ama":"Neufeld C, Van Dokkum P, Asali Y, et al. FRESCO: The Paschen-α star-forming sequence at cosmic noon. <i>Astrophysical Journal</i>. 2024;972(2). doi:<a href=\"https://doi.org/10.3847/1538-4357/ad6158\">10.3847/1538-4357/ad6158</a>","ieee":"C. Neufeld <i>et al.</i>, “FRESCO: The Paschen-α star-forming sequence at cosmic noon,” <i>Astrophysical Journal</i>, vol. 972, no. 2. IOP Publishing, 2024.","ista":"Neufeld C, Van Dokkum P, Asali Y, Covelo-Paz A, Leja J, Lin J, Matthee JJ, Oesch PA, Reddy NA, Shivaei I, Whitaker KE, Wuyts S, Brammer G, Marchesini D, Maseda MV, Naidu RP, Nelson EJ, Velichko A, Weibel A, Xiao M. 2024. FRESCO: The Paschen-α star-forming sequence at cosmic noon. Astrophysical Journal. 972(2), 156.","apa":"Neufeld, C., Van Dokkum, P., Asali, Y., Covelo-Paz, A., Leja, J., Lin, J., … Xiao, M. (2024). FRESCO: The Paschen-α star-forming sequence at cosmic noon. <i>Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4357/ad6158\">https://doi.org/10.3847/1538-4357/ad6158</a>","short":"C. Neufeld, P. Van Dokkum, Y. Asali, A. Covelo-Paz, J. Leja, J. Lin, J.J. Matthee, P.A. Oesch, N.A. Reddy, I. Shivaei, K.E. Whitaker, S. Wuyts, G. Brammer, D. Marchesini, M.V. Maseda, R.P. Naidu, E.J. Nelson, A. Velichko, A. Weibel, M. Xiao, Astrophysical Journal 972 (2024).","mla":"Neufeld, Chloe, et al. “FRESCO: The Paschen-α Star-Forming Sequence at Cosmic Noon.” <i>Astrophysical Journal</i>, vol. 972, no. 2, 156, IOP Publishing, 2024, doi:<a href=\"https://doi.org/10.3847/1538-4357/ad6158\">10.3847/1538-4357/ad6158</a>.","chicago":"Neufeld, Chloe, Pieter Van Dokkum, Yasmeen Asali, Alba Covelo-Paz, Joel Leja, Jamie Lin, Jorryt J Matthee, et al. “FRESCO: The Paschen-α Star-Forming Sequence at Cosmic Noon.” <i>Astrophysical Journal</i>. IOP Publishing, 2024. <a href=\"https://doi.org/10.3847/1538-4357/ad6158\">https://doi.org/10.3847/1538-4357/ad6158</a>."},"DOAJ_listed":"1","external_id":{"isi":["001305987600001"]},"has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"We present results from the JWST First Reionization Epoch Spectroscopically Complete Observations survey on the star-forming sequence (SFS) of galaxies at 1.0 < z < 1.7, around the peak of the cosmic star formation history. Star formation rates (SFRs) are measured from the redshifted, relatively dust-insensitive Paschen-α emission line, and stellar mass measurements include the F444W (4.4 μm; rest-frame H) band. We find SFRs of galaxies with log(M*/M⊙) > 9.5 that are lower than found in many earlier studies by up to 0.6 dex, but in good agreement with recent results obtained with the Prospector fitting framework. The difference (log(SFR(Paα)-SFR(Prospector)) is −0.09 ± 0.04 dex at 1010−11M⊙. We also measure the empirical relation between Paschen-α luminosity and rest-frame H-band magnitude and find that the scatter is only 0.04 dex lower than that of the SFR–M* relation and is much lower than the systematic differences among relations in the literature due to various methods of converting observed measurements to physical properties. We additionally identify examples of sources—that, with standard cutoffs via the UVJ diagram, would be deemed quiescent—with significant (log(sSFR)> −11 yr−1), typically extended, Paschen-α emission. Our results may be indicative of the potential unification of methods used to derive the SFS with careful selection of star-forming galaxies and independent SFR and stellar mass indicators."}],"type":"journal_article","scopus_import":"1","publication":"Astrophysical Journal","date_created":"2024-09-15T22:01:40Z","oa_version":"Published Version","ddc":["520"],"date_updated":"2025-09-08T09:43:41Z","intvolume":"       972","author":[{"first_name":"Chloe","last_name":"Neufeld","full_name":"Neufeld, Chloe"},{"full_name":"Van Dokkum, Pieter","first_name":"Pieter","last_name":"Van Dokkum"},{"last_name":"Asali","first_name":"Yasmeen","full_name":"Asali, Yasmeen"},{"last_name":"Covelo-Paz","first_name":"Alba","full_name":"Covelo-Paz, Alba"},{"full_name":"Leja, Joel","first_name":"Joel","last_name":"Leja"},{"full_name":"Lin, Jamie","last_name":"Lin","first_name":"Jamie"},{"last_name":"Matthee","first_name":"Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J"},{"full_name":"Oesch, Pascal A.","last_name":"Oesch","first_name":"Pascal A."},{"full_name":"Reddy, Naveen A.","first_name":"Naveen A.","last_name":"Reddy"},{"first_name":"Irene","last_name":"Shivaei","full_name":"Shivaei, Irene"},{"full_name":"Whitaker, Katherine E.","first_name":"Katherine E.","last_name":"Whitaker"},{"last_name":"Wuyts","first_name":"Stijn","full_name":"Wuyts, Stijn"},{"last_name":"Brammer","first_name":"Gabriel","full_name":"Brammer, Gabriel"},{"last_name":"Marchesini","first_name":"Danilo","full_name":"Marchesini, Danilo"},{"first_name":"Michael V.","last_name":"Maseda","full_name":"Maseda, Michael V."},{"full_name":"Naidu, Rohan P.","first_name":"Rohan P.","last_name":"Naidu"},{"last_name":"Nelson","first_name":"Erica J.","full_name":"Nelson, Erica J."},{"first_name":"Anna","last_name":"Velichko","full_name":"Velichko, Anna"},{"full_name":"Weibel, Andrea","last_name":"Weibel","first_name":"Andrea"},{"full_name":"Xiao, Mengyuan","first_name":"Mengyuan","last_name":"Xiao"}],"month":"09","volume":972,"issue":"2","file_date_updated":"2024-09-17T08:23:59Z","publication_status":"published","year":"2024","article_number":"156","_id":"18069","date_published":"2024-09-01T00:00:00Z","quality_controlled":"1","publisher":"IOP Publishing","file":[{"creator":"dernst","relation":"main_file","access_level":"open_access","date_created":"2024-09-17T08:23:59Z","content_type":"application/pdf","file_size":9960685,"success":1,"checksum":"754b58c1d79adb9670ca76fa8c20ab16","file_id":"18082","file_name":"2024_AstrophysicalJourn_Neufeld.pdf","date_updated":"2024-09-17T08:23:59Z"}],"acknowledgement":"The authors thank the anonymous referee whose comments and suggestions improved the quality of this work.\r\nThis work is based on observations made with the NASA/ESA/CSA James Webb Space Telescope. The data were obtained from the Mikulski Archive for Space Telescopes at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-03127 for JWST. These observations are associated with program No. 1895.\r\nSupport for this work was provided by NASA through grant JWST-GO-01895 awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555.\r\nThis work has received funding from the Swiss State Secretariat for Education, Research, and Innovation (SERI) under contract No. MB22.00072, as well as from the Swiss National Science Foundation (SNSF) through project grant 200020_207349. The Cosmic Dawn Center (DAWN) is funded by the Danish National Research Foundation under grant No. 140.\r\nR.P.N. acknowledges funding from JWST programs GO-1933 and GO-2279. Support for this work was provided by NASA through the NASA Hubble Fellowship grant HST-HF2-51515.001-A awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555\r\nCloud-based data processing and file storage for this work is provided by the AWS Cloud Credits for Research program.\r\nThis paper made use of several publicly available software packages. We thank the respective authors for sharing their work: IPython (Pérez & Granger 2007), matplotlib (Hunter 2007), seaborn (Waskom et al. 2018), NumPy (Harris et al. 2020), SciPy (Virtanen et al. 2020), jupyter (Kluyver et al. 2016), Astropy (Astropy Collaboration et al. 2013, 2018, 2022), grizli (Brammer 2018; Brammer et al. 2022), Prospector (Leja et al. 2019, 2017; Johnson et al. 2021), FSPS (Conroy et al. 2009a, 2010; Conroy & Gunn 2010a, 2010b; Foreman-Mackey et al. 2014), dynesty (Speagle 2020), EAZY (Brammer et al. 2008), Bagpipes (Carnall et al. 2018), and SExtractor (Bertin & Arnouts 1996).","isi":1,"doi":"10.3847/1538-4357/ad6158","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"article_processing_charge":"Yes","department":[{"_id":"JoMa"}],"day":"01","title":"FRESCO: The Paschen-α star-forming sequence at cosmic noon","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"conference":{"name":"ICDCS: International Conference on Distributed Computing Systems","end_date":"2024-07-26","location":"Jersey City, NJ, United States","start_date":"2024-07-23"},"date_updated":"2025-09-08T09:23:48Z","publisher":"IEEE","isi":1,"doi":"10.1109/ICDCS60910.2024.00084","abstract":[{"lang":"eng","text":"Parallel SGD in a shared-memory setting is oft-represented by the popular Hogwild! algorithm, in which lock-free updates are asynchronously performed by multiple computing processes. Unfortunately, scaling Hogwild! to distributed workers is largely unexplored. Specifically, it is unknown if any adaptation of Hogwild! to the popular decentralized multi-GPU setting offers any competitive speedup, either empirically or theoretically. In this work, we investigate the potential of decentralizing Hogwild! by incorporating simultaneously (a) asynchronous local gradient updates on the shared memory of GPUs, and (b) non-blocking asynchronous decentralized federated averaging. A naive direct implementation shows degradation in performance, arising from scheduling overheads and concurrent write conflicts on GPUs. To mitigate these drawbacks, we investigate and propose a new method, based on careful block selection rules, which update only portions of the parameter vectors. Our experiments show that the resulting decentralized training method exhibits improved throughput and competitive accuracy for standard image classification benchmarks on the CIFAR-10, CIFAR-100, and Imagenet datasets. On the theoretical side, we prove that our method guarantees sublinear ergodic convergence rates for non-convex objectives."}],"status":"public","external_id":{"isi":["001304430200075"]},"scopus_import":"1","publication":"Proceedings of the 44th International Conference on Distributed Computing Systems","date_created":"2024-09-15T22:01:41Z","oa_version":"None","corr_author":"1","type":"conference","citation":{"mla":"Chatterjee, Bapi, et al. “Federated SGD with Local Asynchrony.” <i>Proceedings of the 44th International Conference on Distributed Computing Systems</i>, IEEE, 2024, pp. 857–68, doi:<a href=\"https://doi.org/10.1109/ICDCS60910.2024.00084\">10.1109/ICDCS60910.2024.00084</a>.","short":"B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the 44th International Conference on Distributed Computing Systems, IEEE, 2024, pp. 857–868.","apa":"Chatterjee, B., Kungurtsev, V., &#38; Alistarh, D.-A. (2024). Federated SGD with local asynchrony. In <i>Proceedings of the 44th International Conference on Distributed Computing Systems</i> (pp. 857–868). Jersey City, NJ, United States: IEEE. <a href=\"https://doi.org/10.1109/ICDCS60910.2024.00084\">https://doi.org/10.1109/ICDCS60910.2024.00084</a>","ista":"Chatterjee B, Kungurtsev V, Alistarh D-A. 2024. Federated SGD with local asynchrony. Proceedings of the 44th International Conference on Distributed Computing Systems. ICDCS: International Conference on Distributed Computing Systems, 857–868.","ieee":"B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Federated SGD with local asynchrony,” in <i>Proceedings of the 44th International Conference on Distributed Computing Systems</i>, Jersey City, NJ, United States, 2024, pp. 857–868.","ama":"Chatterjee B, Kungurtsev V, Alistarh D-A. Federated SGD with local asynchrony. In: <i>Proceedings of the 44th International Conference on Distributed Computing Systems</i>. IEEE; 2024:857-868. doi:<a href=\"https://doi.org/10.1109/ICDCS60910.2024.00084\">10.1109/ICDCS60910.2024.00084</a>","chicago":"Chatterjee, Bapi, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Federated SGD with Local Asynchrony.” In <i>Proceedings of the 44th International Conference on Distributed Computing Systems</i>, 857–68. IEEE, 2024. <a href=\"https://doi.org/10.1109/ICDCS60910.2024.00084\">https://doi.org/10.1109/ICDCS60910.2024.00084</a>."},"language":[{"iso":"eng"}],"date_published":"2024-07-26T00:00:00Z","_id":"18070","quality_controlled":"1","publication_status":"published","title":"Federated SGD with local asynchrony","year":"2024","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"07","department":[{"_id":"DaAl"}],"day":"26","author":[{"last_name":"Chatterjee","first_name":"Bapi","orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Bapi"},{"last_name":"Kungurtsev","first_name":"Vyacheslav","full_name":"Kungurtsev, Vyacheslav"},{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"publication_identifier":{"issn":["1063-6927"],"eissn":["2575-8411"],"isbn":["9798350386059"]},"page":"857-868","article_processing_charge":"No"},{"date_updated":"2025-09-08T09:42:36Z","arxiv":1,"scopus_import":"1","publication":"Proceedings - International Conference on Distributed Computing Systems","date_created":"2024-09-15T22:01:41Z","oa_version":"Preprint","type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/2309.12713","open_access":"1"}],"abstract":[{"text":"Recent advancements on DAG-based consensus protocols allow for blockchains with improved metrics and properties, such as throughput and censorship-resistance. Variants of the Bullshark [18] consensus protocol are adopted for practical use by the Sui blockchain, for improved latency. However, the protocol is leader-based, and is strongly affected by crashed leaders that can lead to various performance issues, for example, decreased transaction throughput. In this paper, we propose HammerHead, a DAG-based consensus protocol, that is inspired by Carousel [8] and provides Leader-Utilization. Our proposal differs from Carousel, which is built for a chained consensus protocol; in HammerHead chain quality is inherited by the DAG. HammerHead needs to preserve safety and liveness, despite validators committing leader vertices asynchronously. The key idea is to update leader schedules dynamically, based on the validators' scores during the previous schedule. We implement HammerHead and show a minor improvement in performance for cases without faults. The major improvements in comparison to Bullshark appear in faulty settings. Specifically, we show a drastic, 2x-latency improvement and up to 40% increased throughput when crash faults occur (100 validators, 33 faults).","lang":"eng"}],"status":"public","external_id":{"isi":["001304430200120"],"arxiv":["2309.12713"]},"citation":{"ama":"Tsimos G, Kichidis A, Sonnino A, Kokoris Kogias E. HammerHead: Leader reputation for dynamic scheduling. In: <i>Proceedings - International Conference on Distributed Computing Systems</i>. IEEE; 2024:1377-1387. doi:<a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">10.1109/ICDCS60910.2024.00129</a>","ieee":"G. Tsimos, A. Kichidis, A. Sonnino, and E. Kokoris Kogias, “HammerHead: Leader reputation for dynamic scheduling,” in <i>Proceedings - International Conference on Distributed Computing Systems</i>, Jersey City, NJ, United States, 2024, pp. 1377–1387.","ista":"Tsimos G, Kichidis A, Sonnino A, Kokoris Kogias E. 2024. HammerHead: Leader reputation for dynamic scheduling. Proceedings - International Conference on Distributed Computing Systems. ICDCS: International Conference on Distributed Computing Systems, 1377–1387.","apa":"Tsimos, G., Kichidis, A., Sonnino, A., &#38; Kokoris Kogias, E. (2024). HammerHead: Leader reputation for dynamic scheduling. In <i>Proceedings - International Conference on Distributed Computing Systems</i> (pp. 1377–1387). Jersey City, NJ, United States: IEEE. <a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">https://doi.org/10.1109/ICDCS60910.2024.00129</a>","short":"G. Tsimos, A. Kichidis, A. Sonnino, E. Kokoris Kogias, in:, Proceedings - International Conference on Distributed Computing Systems, IEEE, 2024, pp. 1377–1387.","mla":"Tsimos, Giorgos, et al. “HammerHead: Leader Reputation for Dynamic Scheduling.” <i>Proceedings - International Conference on Distributed Computing Systems</i>, IEEE, 2024, pp. 1377–87, doi:<a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">10.1109/ICDCS60910.2024.00129</a>.","chicago":"Tsimos, Giorgos, Anastasios Kichidis, Alberto Sonnino, and Eleftherios Kokoris Kogias. “HammerHead: Leader Reputation for Dynamic Scheduling.” In <i>Proceedings - International Conference on Distributed Computing Systems</i>, 1377–87. IEEE, 2024. <a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">https://doi.org/10.1109/ICDCS60910.2024.00129</a>."},"language":[{"iso":"eng"}],"year":"2024","publication_status":"published","month":"07","author":[{"full_name":"Tsimos, Giorgos","last_name":"Tsimos","first_name":"Giorgos"},{"full_name":"Kichidis, Anastasios","first_name":"Anastasios","last_name":"Kichidis"},{"full_name":"Sonnino, Alberto","last_name":"Sonnino","first_name":"Alberto"},{"full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias"}],"page":"1377-1387","conference":{"end_date":"2024-07-26","start_date":"2024-07-23","location":"Jersey City, NJ, United States","name":"ICDCS: International Conference on Distributed Computing Systems"},"acknowledgement":"This work is supported by Mysten Labs. We thank the Mysten Labs Engineering teams for valuable feedback broadly, and specifically to Laura Makdah for helping implementing the early reputation score system for validators and Dmitry Perelman for managing the overall implementation effort.","isi":1,"doi":"10.1109/ICDCS60910.2024.00129","publisher":"IEEE","_id":"18071","quality_controlled":"1","date_published":"2024-07-26T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"title":"HammerHead: Leader reputation for dynamic scheduling","day":"26","department":[{"_id":"ElKo"}],"article_processing_charge":"No","publication_identifier":{"issn":["1063-6927"],"isbn":["9798350386059"],"eissn":["2575-8411"]}},{"article_processing_charge":"Yes (in subscription journal)","publication_identifier":{"eissn":["1097-4164"],"issn":["1097-2765"]},"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"title":"A liquid-like coat mediates chromosome clustering during mitotic exit","day":"05","department":[{"_id":"AnSa"}],"_id":"18072","quality_controlled":"1","date_published":"2024-09-05T00:00:00Z","file":[{"relation":"main_file","creator":"dernst","access_level":"open_access","content_type":"application/pdf","date_created":"2024-09-16T07:38:38Z","file_size":11654644,"checksum":"3f360e0287b8ec79fb2b8b02b5070360","success":1,"date_updated":"2024-09-16T07:38:38Z","file_id":"18075","file_name":"2024_MolecularCell_HernandezArmendariz.pdf"}],"isi":1,"acknowledgement":"We thank Daniel W. Gerlich for providing cell lines, the EMBL Advanced Light Microscopy Facility (ALMF) for support, Christian H. Haering and Thomas Quail for input on the manuscript, and Martina Dees for cloning several Ki-67 constructs. This work was supported by the German Research Foundation (DFG project number 402723784) and the Human Frontier Science Program (CDA00045/2019). A.H.-A. and A.B. have received PhD fellowships from the Boehringer Ingelheim Fonds, V.S. and A.Š. were supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant no. 802960), and Y.H. was supported by a fellowship from the EMBL interdisciplinary Postdoc (EIPOD) program (Marie Sklodowska-Curie Actions, COFUND grant agreement 664726).","doi":"10.1016/j.molcel.2024.07.022","publisher":"Cell Press","author":[{"first_name":"Alberto","last_name":"Hernandez-Armendariz","full_name":"Hernandez-Armendariz, Alberto"},{"orcid":"0000-0002-9645-6576","first_name":"Valerio","last_name":"Sorichetti","full_name":"Sorichetti, Valerio","id":"ef8a92cb-c7b6-11ec-8bea-e1fd5847bc5b"},{"last_name":"Hayashi","first_name":"Yuki","full_name":"Hayashi, Yuki"},{"full_name":"Koskova, Zuzana","last_name":"Koskova","first_name":"Zuzana"},{"full_name":"Brunner, Andreas","last_name":"Brunner","first_name":"Andreas"},{"full_name":"Ellenberg, Jan","last_name":"Ellenberg","first_name":"Jan"},{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","full_name":"Šarić, Anđela","first_name":"Anđela","orcid":"0000-0002-7854-2139","last_name":"Šarić"},{"full_name":"Cuylen-Haering, Sara","last_name":"Cuylen-Haering","first_name":"Sara"}],"pmid":1,"page":"P3254-3270.E9","year":"2024","file_date_updated":"2024-09-16T07:38:38Z","publication_status":"published","issue":"17","volume":84,"month":"09","scopus_import":"1","oa_version":"Published Version","publication":"Molecular Cell","date_created":"2024-09-15T22:01:41Z","type":"journal_article","abstract":[{"text":"The individualization of chromosomes during early mitosis and their clustering upon exit from cell division are two key transitions that ensure efficient segregation of eukaryotic chromosomes. Both processes are regulated by the surfactant-like protein Ki-67, but how Ki-67 achieves these diametric functions has remained unknown. Here, we report that Ki-67 radically switches from a chromosome repellent to a chromosome attractant during anaphase in human cells. We show that Ki-67 dephosphorylation during mitotic exit and the simultaneous exposure of a conserved basic patch induce the RNA-dependent formation of a liquid-like condensed phase on the chromosome surface. Experiments and coarse-grained simulations support a model in which the coalescence of chromosome surfaces, driven by co-condensation of Ki-67 and RNA, promotes clustering of chromosomes. Our study reveals how the switch of Ki-67 from a surfactant to a liquid-like condensed phase can generate mechanical forces during genome segregation that are required for re-establishing nuclear-cytoplasmic compartmentalization after mitosis.","lang":"eng"}],"external_id":{"pmid":["39153474"],"isi":["001309051100001"]},"status":"public","has_accepted_license":"1","ec_funded":1,"article_type":"original","citation":{"short":"A. Hernandez-Armendariz, V. Sorichetti, Y. Hayashi, Z. Koskova, A. Brunner, J. Ellenberg, A. Šarić, S. Cuylen-Haering, Molecular Cell 84 (2024) P3254–3270.E9.","mla":"Hernandez-Armendariz, Alberto, et al. “A Liquid-like Coat Mediates Chromosome Clustering during Mitotic Exit.” <i>Molecular Cell</i>, vol. 84, no. 17, Cell Press, 2024, p. P3254–3270.E9, doi:<a href=\"https://doi.org/10.1016/j.molcel.2024.07.022\">10.1016/j.molcel.2024.07.022</a>.","ieee":"A. Hernandez-Armendariz <i>et al.</i>, “A liquid-like coat mediates chromosome clustering during mitotic exit,” <i>Molecular Cell</i>, vol. 84, no. 17. Cell Press, p. P3254–3270.E9, 2024.","ista":"Hernandez-Armendariz A, Sorichetti V, Hayashi Y, Koskova Z, Brunner A, Ellenberg J, Šarić A, Cuylen-Haering S. 2024. A liquid-like coat mediates chromosome clustering during mitotic exit. Molecular Cell. 84(17), P3254–3270.E9.","ama":"Hernandez-Armendariz A, Sorichetti V, Hayashi Y, et al. A liquid-like coat mediates chromosome clustering during mitotic exit. <i>Molecular Cell</i>. 2024;84(17):P3254-3270.E9. doi:<a href=\"https://doi.org/10.1016/j.molcel.2024.07.022\">10.1016/j.molcel.2024.07.022</a>","apa":"Hernandez-Armendariz, A., Sorichetti, V., Hayashi, Y., Koskova, Z., Brunner, A., Ellenberg, J., … Cuylen-Haering, S. (2024). A liquid-like coat mediates chromosome clustering during mitotic exit. <i>Molecular Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.molcel.2024.07.022\">https://doi.org/10.1016/j.molcel.2024.07.022</a>","chicago":"Hernandez-Armendariz, Alberto, Valerio Sorichetti, Yuki Hayashi, Zuzana Koskova, Andreas Brunner, Jan Ellenberg, Anđela Šarić, and Sara Cuylen-Haering. “A Liquid-like Coat Mediates Chromosome Clustering during Mitotic Exit.” <i>Molecular Cell</i>. Cell Press, 2024. <a href=\"https://doi.org/10.1016/j.molcel.2024.07.022\">https://doi.org/10.1016/j.molcel.2024.07.022</a>."},"language":[{"iso":"eng"}],"intvolume":"        84","date_updated":"2025-09-08T09:23:02Z","ddc":["570"],"project":[{"grant_number":"802960","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","call_identifier":"H2020","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines"}]},{"ddc":["570"],"date_updated":"2025-09-08T09:22:11Z","intvolume":"        43","OA_place":"publisher","OA_type":"gold","external_id":{"isi":["001306286100002"],"pmid":["39232130"]},"has_accepted_license":"1","status":"public","abstract":[{"text":"Conserved signaling cascades monitor protein-folding homeostasis to ensure proper cellular function. One of the evolutionary conserved key players is IRE1, which maintains endoplasmic reticulum (ER) homeostasis through the unfolded protein response (UPR). Upon accumulation of misfolded proteins in the ER, IRE1 forms clusters on the ER membrane to initiate UPR signaling. What regulates IRE1 cluster formation is not fully understood. Here, we show that the ER lumenal domain (LD) of human IRE1α forms biomolecular condensates in vitro. IRE1α LD condensates were stabilized both by binding to unfolded polypeptides as well as by tethering to model membranes, suggesting their role in assembling IRE1α into signaling-competent stable clusters. Molecular dynamics simulations indicated that weak multivalent interactions drive IRE1α LD clustering. Mutagenesis experiments identified disordered regions in IRE1α LD to control its clustering in vitro and in cells. Importantly, dysregulated clustering of IRE1α mutants led to defects in IRE1α signaling. Our results revealed that disordered regions in IRE1α LD control its clustering and suggest their role as a common strategy in regulating protein assembly on membranes.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","scopus_import":"1","publication":"EMBO Journal","date_created":"2024-09-15T22:01:42Z","language":[{"iso":"eng"}],"citation":{"ama":"Kettel P, Marosits L, Spinetti E, et al. Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering. <i>EMBO Journal</i>. 2024;43(20):4668-4698. doi:<a href=\"https://doi.org/10.1038/s44318-024-00207-0\">10.1038/s44318-024-00207-0</a>","ista":"Kettel P, Marosits L, Spinetti E, Rechberger M, Giannini C, Radler P, Niedermoser I, Fischer I, Versteeg GA, Loose M, Covino R, Karagöz GE. 2024. Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering. EMBO Journal. 43(20), 4668–4698.","ieee":"P. Kettel <i>et al.</i>, “Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering,” <i>EMBO Journal</i>, vol. 43, no. 20. Embo Press, pp. 4668–4698, 2024.","apa":"Kettel, P., Marosits, L., Spinetti, E., Rechberger, M., Giannini, C., Radler, P., … Karagöz, G. E. (2024). Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering. <i>EMBO Journal</i>. Embo Press. <a href=\"https://doi.org/10.1038/s44318-024-00207-0\">https://doi.org/10.1038/s44318-024-00207-0</a>","short":"P. Kettel, L. Marosits, E. Spinetti, M. Rechberger, C. Giannini, P. Radler, I. Niedermoser, I. Fischer, G.A. Versteeg, M. Loose, R. Covino, G.E. Karagöz, EMBO Journal 43 (2024) 4668–4698.","mla":"Kettel, Paulina, et al. “Disordered Regions in the IRE1α ER Lumenal Domain Mediate Its Stress-Induced Clustering.” <i>EMBO Journal</i>, vol. 43, no. 20, Embo Press, 2024, pp. 4668–98, doi:<a href=\"https://doi.org/10.1038/s44318-024-00207-0\">10.1038/s44318-024-00207-0</a>.","chicago":"Kettel, Paulina, Laura Marosits, Elena Spinetti, Michael Rechberger, Caterina Giannini, Philipp Radler, Isabell Niedermoser, et al. “Disordered Regions in the IRE1α ER Lumenal Domain Mediate Its Stress-Induced Clustering.” <i>EMBO Journal</i>. Embo Press, 2024. <a href=\"https://doi.org/10.1038/s44318-024-00207-0\">https://doi.org/10.1038/s44318-024-00207-0</a>."},"article_type":"original","file_date_updated":"2025-01-13T08:43:20Z","publication_status":"published","year":"2024","month":"10","volume":43,"issue":"20","author":[{"last_name":"Kettel","first_name":"Paulina","full_name":"Kettel, Paulina"},{"full_name":"Marosits, Laura","last_name":"Marosits","first_name":"Laura"},{"last_name":"Spinetti","first_name":"Elena","full_name":"Spinetti, Elena"},{"full_name":"Rechberger, Michael","first_name":"Michael","last_name":"Rechberger"},{"last_name":"Giannini","first_name":"Caterina","full_name":"Giannini, Caterina","id":"e3fdddd5-f6e0-11ea-865d-ca99ee6367f4"},{"last_name":"Radler","orcid":"0000-0001-9198-2182 ","first_name":"Philipp","full_name":"Radler, Philipp","id":"40136C2A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Niedermoser","first_name":"Isabell","full_name":"Niedermoser, Isabell"},{"last_name":"Fischer","first_name":"Irmgard","full_name":"Fischer, Irmgard"},{"first_name":"Gijs A.","last_name":"Versteeg","full_name":"Versteeg, Gijs A."},{"full_name":"Loose, Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","last_name":"Loose","orcid":"0000-0001-7309-9724","first_name":"Martin"},{"first_name":"Roberto","last_name":"Covino","full_name":"Covino, Roberto"},{"full_name":"Karagöz, G. Elif","last_name":"Karagöz","first_name":"G. Elif"}],"page":"4668-4698","pmid":1,"publisher":"Embo Press","isi":1,"doi":"10.1038/s44318-024-00207-0","acknowledgement":"We thank late Thomas Peterbauer at the Max Perutz Labs Biooptics Light Microscopy Facility for his help and support. We are grateful to Kitti Csalyi and Thomas Sauer at Max Perutz Labs Biooptics FACS facility for their help. We thank Grzegorz Scibisz and Sertan Atilla for their support with the expression and purification of mCherry-IRE1α LD-10His. We are grateful to Aleksandra S Anisimova with her help in the generation of stable cell lines and the statistical analyses of the data. We thank Venja Vieweger for her help with the characterization of the WLLI and D123P IRE1 mutants in cells. We are thankful to Monika Kubickova for the help with the AUC experiments. We acknowledge CF BIC of CIISB, Instruct-CZ Centre, supported by MEYS CR (LM2023042)) and European Regional Development Fund-Project, UP CIISB“ (No. CZ.02.1.01/0.0/0.0/18_046/0015974). We thank the members of the Karagöz lab for the critical reading and editing of the manuscript. We are thankful to our colleagues Diego Acosta-Alvear, Vladislav Belyy, Jirka Peschek, Yasin Dagdas, Javier Martinez, Sascha Martens and Alwin Köhler for their invaluable input on the manuscript. We are grateful to Life Science Editors, especially Katrina Woolcock for her useful edits and comments on the manuscript. We acknowledge funding from Austrian Science Fund (FWF-SFB F79 and FWF-W 1261) to GEK. PK acknowledges the support of the Max Perutz PhD fellowship. GAV is funded by Stand-Alone grants (P30231-B, P30415-B, P36572), Special Research Grant (SFB grant F79), and Doctoral School grant (DK grant W1261) from the Austrian Science Fund (FWF). ES and RC acknowledge support and funding by the Frankfurt Institute of Advanced Studies, the LOEWE Center for Multiscale Modelling in Life Sciences of the state of Hesse, the Collaborative Research Center 1507 “Membrane-associated Protein Assemblies, Machineries, and Supercomplexes” (Project ID 450648163), and the International Max Planck Research School on Cellular Biophysics (to RC), the Center for Scientific Computing of the Goethe University and the Jülich Supercomputing Centre for computational resources and support.","file":[{"success":1,"checksum":"04f4df1a561083f2846676442fc4eb3c","date_updated":"2025-01-13T08:43:20Z","file_name":"2024_Embo_Kettel.pdf","file_id":"18827","file_size":10080854,"content_type":"application/pdf","date_created":"2025-01-13T08:43:20Z","relation":"main_file","creator":"dernst","access_level":"open_access"}],"quality_controlled":"1","_id":"18073","date_published":"2024-10-15T00:00:00Z","title":"Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"MaLo"},{"_id":"JiFr"}],"day":"15","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"issn":["0261-4189"],"eissn":["1460-2075"]},"article_processing_charge":"Yes"},{"article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"]},"tmp":{"short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"day":"18","department":[{"_id":"GradSch"},{"_id":"GeKa"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa":1,"title":"Hybrid circuits on planar Germanium","date_published":"2024-09-18T00:00:00Z","_id":"18076","supervisor":[{"orcid":"0000-0001-8342-202X","first_name":"Georgios","last_name":"Katsaros","full_name":"Katsaros, Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"file":[{"access_level":"open_access","relation":"main_file","creator":"osagi","content_type":"application/pdf","date_created":"2024-09-18T14:13:01Z","file_size":86679095,"date_updated":"2024-09-18T14:13:01Z","file_id":"18093","file_name":"OliverSagi_Thesis_pdfa.pdf","success":1,"checksum":"d01d0e2846c2f3ac5bb14d321554a4cd"},{"content_type":"application/x-zip-compressed","date_created":"2024-09-18T14:14:02Z","relation":"source_file","creator":"osagi","access_level":"local","checksum":"0543f473d509ee545f4ed3a56f742f4b","date_updated":"2024-09-19T09:20:33Z","file_id":"18094","file_name":"Thesis_OliverSagi.zip","file_size":172098524}],"doi":"10.15479/at:ista:18076","degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","page":"111","alternative_title":["ISTA Thesis"],"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"author":[{"full_name":"Sagi, Oliver","id":"71616374-A8E9-11E9-A7CA-09ECE5697425","first_name":"Oliver","last_name":"Sagi"}],"related_material":{"record":[{"status":"public","id":"17202","relation":"part_of_dissertation"}]},"month":"09","year":"2024","file_date_updated":"2024-09-19T09:20:33Z","publication_status":"published","ec_funded":1,"citation":{"chicago":"Sagi, Oliver. “Hybrid Circuits on Planar Germanium.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18076\">https://doi.org/10.15479/at:ista:18076</a>.","short":"O. Sagi, Hybrid Circuits on Planar Germanium, Institute of Science and Technology Austria, 2024.","mla":"Sagi, Oliver. <i>Hybrid Circuits on Planar Germanium</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18076\">10.15479/at:ista:18076</a>.","ama":"Sagi O. Hybrid circuits on planar Germanium. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18076\">10.15479/at:ista:18076</a>","ista":"Sagi O. 2024. Hybrid circuits on planar Germanium. Institute of Science and Technology Austria.","ieee":"O. Sagi, “Hybrid circuits on planar Germanium,” Institute of Science and Technology Austria, 2024.","apa":"Sagi, O. (2024). <i>Hybrid circuits on planar Germanium</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18076\">https://doi.org/10.15479/at:ista:18076</a>"},"language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2024-09-16T12:58:36Z","type":"dissertation","corr_author":"1","abstract":[{"lang":"eng","text":"The new era of Ge has opened up new possibilities in quantum computing. The maturity of Ge\r\nspin qubits is unquestioned, while hybrid semiconductor-superconductor Ge circuits are on track\r\nto enter the game. Gate-tunable transmons (gatemons) employing semiconductor Josephson\r\njunctions have recently emerged as building blocks for such hybrid quantum circuits. In this\r\nthesis, we present a gatemon fabricated in planar Germanium. We induce superconductivity\r\nin a two-dimensional hole gas by evaporating aluminum atop a thin spacer, which separates\r\nthe superconductor from the Ge quantum well. The Josephson junction is then integrated\r\ninto an Xmon circuit and capacitively coupled to a transmission line resonator. We showcase\r\nthe qubit tunability in a broad frequency range with resonator and two-tone spectroscopy.\r\nTime-domain characterizations reveal energy relaxation and coherence times up to 75 ns. Our\r\nresults, combined with the recent advances in the spin qubit field, pave the way towards novel\r\nhybrid and protected qubits in a group IV, CMOS-compatible material."}],"has_accepted_license":"1","status":"public","project":[{"_id":"bd8bd29e-d553-11ed-ba76-f0070d4b237a","name":"Merging spin and superconducting qubits in planar Ge","grant_number":"P36507"},{"name":"High impedance circuit quantum electrodynamics with hole spins","_id":"c0977eea-5a5b-11eb-8a69-a862db0cf4d1","grant_number":"I05060"},{"name":"Hybrid Semiconductor - Superconductor Quantum Devices","_id":"262116AA-B435-11E9-9278-68D0E5697425"},{"_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS","grant_number":"862046"}],"OA_place":"publisher","date_updated":"2026-04-16T12:20:39Z","ddc":["539"]},{"conference":{"name":"SCN: Security and Cryptography for Networks","start_date":"2024-09-11","location":"Amalfi, Italy","end_date":"2024-09-13"},"doi":"10.1007/978-3-031-71073-5_14","place":"Cham","isi":1,"publisher":"Springer Nature","quality_controlled":"1","_id":"18086","date_published":"2024-09-10T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"DeCAF: Decentralizable CGKA with fast healing","day":"10","editor":[{"full_name":"Galdi, Clemente","first_name":"Clemente","last_name":"Galdi"},{"first_name":"Duong Hieu","last_name":"Phan","full_name":"Phan, Duong Hieu"}],"department":[{"_id":"GradSch"},{"_id":"KrPi"}],"article_processing_charge":"No","publication_identifier":{"eisbn":["9783031710735"],"issn":["0302-9743"],"isbn":["9783031710728"],"eissn":["1611-3349"]},"intvolume":"     14974","date_updated":"2026-04-07T13:01:26Z","oa_version":"None","publication":"Security and Cryptography for Networks: 14th International Conference","date_created":"2024-09-18T11:35:14Z","corr_author":"1","type":"conference","abstract":[{"lang":"eng","text":"Abstract. Continuous group key agreement (CGKA) allows a group of\r\nusers to maintain a continuously updated shared key in an asynchronous\r\nsetting where parties only come online sporadically and their messages\r\nare relayed by an untrusted server. CGKA captures the basic primitive\r\nunderlying group messaging schemes.\r\nCurrent solutions including TreeKEM (“Messaging Layer Security”\r\n(MLS) IETF RFC 9420) cannot handle concurrent requests while retaining low communication complexity. The exception being CoCoA, which\r\nis concurrent while having extremely low communication complexity (in\r\ngroups of size n and for m concurrent updates the communication per\r\nuser is log(n), i.e., independent of m). The main downside of CoCoA\r\nis that in groups of size n, users might have to do up to log(n) update\r\nrequests to the server to ensure their (potentially corrupted) key material has been refreshed.\r\nIn this work we present a “fast healing” concurrent CGKA protocol,\r\nnamed DeCAF, where users will heal after at most log(t) requests, with\r\nt being the number of corrupted users. While also suitable for the standard central-server setting, our protocol is particularly interesting for\r\nrealizing decentralized group messaging, where protocol messages (add,\r\nremove, update) are being posted on some append-only data structure\r\nrather than sent to a server. In this setting, concurrency is crucial once\r\nthe rate of requests exceeds, say, the rate at which new blocks are added\r\nto a blockchain.\r\nIn the central-server setting, CoCoA (the only alternative with concurrency, sub-linear communication and basic post-compromise security)\r\nenjoys much lower download communication. However, in the decentralized setting – where there is no server which can craft specific messages\r\nfor different users to reduce their download communication – our protocol\r\nsignificantly outperforms CoCoA. DeCAF heals in fewer epochs (log(t)\r\nvs. log(n)) while incurring a similar per epoch per user communication\r\ncost."}],"external_id":{"isi":["001330408000014"]},"status":"public","citation":{"chicago":"Alwen, Joel F, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “DeCAF: Decentralizable CGKA with Fast Healing.” In <i>Security and Cryptography for Networks: 14th International Conference</i>, edited by Clemente Galdi and Duong Hieu Phan, 14974:294–313. Cham: Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">https://doi.org/10.1007/978-3-031-71073-5_14</a>.","mla":"Alwen, Joel F., et al. “DeCAF: Decentralizable CGKA with Fast Healing.” <i>Security and Cryptography for Networks: 14th International Conference</i>, edited by Clemente Galdi and Duong Hieu Phan, vol. 14974, Springer Nature, 2024, pp. 294–313, doi:<a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">10.1007/978-3-031-71073-5_14</a>.","short":"J.F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, in:, C. Galdi, D.H. Phan (Eds.), Security and Cryptography for Networks: 14th International Conference, Springer Nature, Cham, 2024, pp. 294–313.","apa":"Alwen, J. F., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G., &#38; Pietrzak, K. Z. (2024). DeCAF: Decentralizable CGKA with fast healing. In C. Galdi &#38; D. H. Phan (Eds.), <i>Security and Cryptography for Networks: 14th International Conference</i> (Vol. 14974, pp. 294–313). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">https://doi.org/10.1007/978-3-031-71073-5_14</a>","ama":"Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. DeCAF: Decentralizable CGKA with fast healing. In: Galdi C, Phan DH, eds. <i>Security and Cryptography for Networks: 14th International Conference</i>. Vol 14974. Cham: Springer Nature; 2024:294–313. doi:<a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">10.1007/978-3-031-71073-5_14</a>","ieee":"J. F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, and K. Z. Pietrzak, “DeCAF: Decentralizable CGKA with fast healing,” in <i>Security and Cryptography for Networks: 14th International Conference</i>, Amalfi, Italy, 2024, vol. 14974, pp. 294–313.","ista":"Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. 2024. DeCAF: Decentralizable CGKA with fast healing. Security and Cryptography for Networks: 14th International Conference. SCN: Security and Cryptography for Networks, LNCS, vol. 14974, 294–313."},"language":[{"iso":"eng"}],"year":"2024","publication_status":"published","related_material":{"record":[{"id":"18088","status":"public","relation":"dissertation_contains"}]},"volume":14974,"month":"09","alternative_title":["LNCS"],"author":[{"last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","full_name":"Auerbach, Benedikt","first_name":"Benedikt","orcid":"0000-0002-7553-6606","last_name":"Auerbach"},{"full_name":"Cueto Noval, Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","last_name":"Cueto Noval","orcid":"0000-0002-2505-4246","first_name":"Miguel"},{"first_name":"Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"orcid":"0000-0001-8630-415X","first_name":"Guillermo","last_name":"Pascual Perez","full_name":"Pascual Perez, Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"page":"294–313"},{"_id":"18087","date_published":"2024-09-10T00:00:00Z","quality_controlled":"1","article_number":"033277","doi":"10.1103/physrevresearch.6.033277","file":[{"date_created":"2024-09-23T09:46:20Z","content_type":"application/pdf","relation":"main_file","creator":"dernst","access_level":"open_access","checksum":"8f744d94956a1683b473b1cf9b411a37","success":1,"date_updated":"2024-09-23T09:46:20Z","file_name":"2024_PhysicalReviewResearch_Maslov.pdf","file_id":"18125","file_size":1563824}],"acknowledgement":"We are grateful to Emilio Pisanty and Philipp Lunt for valuable discussions. This research was funded wholly or in part by the Austrian Science Fund (FWF) [10.55776/F1004]. G.M.K. gratefully acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). O.H.H. acknowledges support by the Austrian Science Fund (FWF) [10.55776/P36040]. Furthermore, the financial support by the Austrian Federal Ministry for Digital and Economic Affairs, the National Foundation for Research, Technology and Development, and the Christian Doppler Research Association is gratefully acknowledged.","publisher":"American Physical Society","APC_amount":"3028,31 EUR","article_processing_charge":"Yes","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"eissn":["2643-1564"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Theory of angular momentum transfer from light to molecules","oa":1,"day":"10","department":[{"_id":"GradSch"},{"_id":"MiLe"}],"type":"journal_article","corr_author":"1","date_created":"2024-09-18T11:43:16Z","scopus_import":"1","publication":"Physical Review Research","oa_version":"Published Version","status":"public","has_accepted_license":"1","external_id":{"arxiv":["2310.00095"]},"abstract":[{"text":"We present a theory describing the interaction of structured light, such as light carrying orbital angular momentum, with molecules. The light-matter interaction Hamiltonian we derive is expressed through couplings between spherical gradients of the electric field and the (transition) electric multipole moments of a particle of any nontrivial rotation point group. Our model can therefore accommodate an arbitrary complexity of the molecular and electric field structure, and it can be straightforwardly extended to atoms or nanostructures. Applying this framework to rovibrational spectroscopy of molecules, we uncover the general mechanism of angular momentum exchange between the spin and orbital angular momenta of light, molecular rotation, and its center-of-mass motion. We show that the nonzero vorticity of Laguerre-Gaussian beams can strongly enhance certain rovibrational transitions that are considered forbidden in the case of nonhelical light. We discuss the experimental requirements for the observation of these forbidden transitions in state-of-the-art spatially resolved spectroscopy measurements.","lang":"eng"}],"language":[{"iso":"eng"}],"ec_funded":1,"DOAJ_listed":"1","citation":{"chicago":"Maslov, Mikhail, Georgios Koutentakis, Mateja Hrast, Oliver H. Heckl, and Mikhail Lemeshko. “Theory of Angular Momentum Transfer from Light to Molecules.” <i>Physical Review Research</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">https://doi.org/10.1103/physrevresearch.6.033277</a>.","mla":"Maslov, Mikhail, et al. “Theory of Angular Momentum Transfer from Light to Molecules.” <i>Physical Review Research</i>, vol. 6, no. 3, 033277, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">10.1103/physrevresearch.6.033277</a>.","short":"M. Maslov, G. Koutentakis, M. Hrast, O.H. Heckl, M. Lemeshko, Physical Review Research 6 (2024).","apa":"Maslov, M., Koutentakis, G., Hrast, M., Heckl, O. H., &#38; Lemeshko, M. (2024). Theory of angular momentum transfer from light to molecules. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">https://doi.org/10.1103/physrevresearch.6.033277</a>","ista":"Maslov M, Koutentakis G, Hrast M, Heckl OH, Lemeshko M. 2024. Theory of angular momentum transfer from light to molecules. Physical Review Research. 6(3), 033277.","ama":"Maslov M, Koutentakis G, Hrast M, Heckl OH, Lemeshko M. Theory of angular momentum transfer from light to molecules. <i>Physical Review Research</i>. 2024;6(3). doi:<a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">10.1103/physrevresearch.6.033277</a>","ieee":"M. Maslov, G. Koutentakis, M. Hrast, O. H. Heckl, and M. Lemeshko, “Theory of angular momentum transfer from light to molecules,” <i>Physical Review Research</i>, vol. 6, no. 3. American Physical Society, 2024."},"article_type":"original","OA_place":"publisher","intvolume":"         6","ddc":["530"],"arxiv":1,"date_updated":"2026-04-07T11:52:53Z","OA_type":"gold","project":[{"_id":"7c040762-9f16-11ee-852c-dd79eeee4ab3","name":"Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions","grant_number":"F100403"},{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413"},{"grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle"},{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","call_identifier":"FWF","name":"FWF Open Access Fund"}],"author":[{"last_name":"Maslov","orcid":"0000-0003-4074-2570","first_name":"Mikhail","full_name":"Maslov, Mikhail","id":"2E65BB0E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Koutentakis, Georgios","id":"d7b23d3a-9e21-11ec-b482-f76739596b95","first_name":"Georgios","last_name":"Koutentakis"},{"last_name":"Hrast","first_name":"Mateja","full_name":"Hrast, Mateja","id":"48dbb294-2a9c-11ef-905d-f56be71f0e5d"},{"full_name":"Heckl, Oliver H.","first_name":"Oliver H.","last_name":"Heckl"},{"orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"year":"2024","publication_status":"published","file_date_updated":"2024-09-23T09:46:20Z","volume":6,"related_material":{"record":[{"status":"public","id":"19048","relation":"dissertation_contains"}]},"issue":"3","month":"09"},{"corr_author":"1","type":"dissertation","date_created":"2024-09-18T12:59:49Z","oa_version":"Published Version","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"Instant messaging applications like Whatsapp, Signal or Telegram have become ubiquitous in today's society.\r\nMany of them provide not only end-to-end encryption, but also security guarantees even when the key material gets compromised.\r\nThese are achieved through frequent key update performed by users.\r\nIn particular, the compromise of a group key should preserve confidentiality of previously exchanged messages (forward secrecy), and a subsequent key update will ensure security for future ones (post-compromise security).\r\nThough great protocols for one-on-one communication have been known for some time, the design of ones that scale efficiently for larger groups while achieving akin security guarantees is a hard problem.\r\nA great deal of research has been aimed at this topic, much of it under the umbrella of the Messaging Layer Security (MLS) working group at the IETF. \r\nStarted in 2018, this joint effort by academics and industry culminated in 2023 with the publication of the first standard for secure group messaging [IETF, RFC9420].\r\n\r\nAt the core of secure group messaging is a cryptographic primitive termed Continuous Group Key Agreement, or CGKA [Alwen et al. 2021], that essentially allows a changing group of users to agree on a common key with the added functionality security against compromises is achieved by users asynchronously issuing a key update. In this thesis we contribute to the understanding of CGKA across different angles.\r\nFirst, we present a new technique to effect dynamic operations in groups, i.e., add or remove members, that can be more efficient that the one employed by MLS in certain settings.\r\nConsidering the setting of users belonging to multiple overlapping groups, we then show lowerbounds on the communication cost of constructions that leverage said overlap, at the same time showing protocols that are asymptotically optimal and efficient for practical settings, respectively. Along the way, we show that the communication cost of key updates in MLS is average-cost optimal.\r\nAn important feature in CGKA protocols, particularly for big groups, is the possibility of executing several group operations concurrently. While later versions of MLS support this, they do at the cost of worsening the communication efficiency of future group operations.\r\nIn this thesis we introduce two new protocols that permit concurrency without any negative effect on efficiency. Our protocols circumvent previously existing lower bounds by satisfying a new notion of post-compromise security that only asks for security to be re-established after a certain number of key updates have taken place. While this can be slower than MLS in terms of rounds of communication, we show that it leads to more efficient overall communication. \r\nAdditionally, we introduce a new technique that allows group members to decrease the information they need to store and download, which makes one of our protocols enjoy much lower download cost than any other existing CGKA constructions. "}],"language":[{"iso":"eng"}],"ec_funded":1,"citation":{"mla":"Pascual Perez, Guillermo. <i>On the Efficiency and Security of Secure Group Messaging</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18088\">10.15479/at:ista:18088</a>.","short":"G. Pascual Perez, On the Efficiency and Security of Secure Group Messaging, Institute of Science and Technology Austria, 2024.","apa":"Pascual Perez, G. (2024). <i>On the efficiency and security of secure group messaging</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18088\">https://doi.org/10.15479/at:ista:18088</a>","ista":"Pascual Perez G. 2024. On the efficiency and security of secure group messaging. Institute of Science and Technology Austria.","ama":"Pascual Perez G. On the efficiency and security of secure group messaging. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18088\">10.15479/at:ista:18088</a>","ieee":"G. Pascual Perez, “On the efficiency and security of secure group messaging,” Institute of Science and Technology Austria, 2024.","chicago":"Pascual Perez, Guillermo. “On the Efficiency and Security of Secure Group Messaging.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18088\">https://doi.org/10.15479/at:ista:18088</a>."},"OA_place":"publisher","ddc":["000"],"date_updated":"2026-04-07T13:01:26Z","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"alternative_title":["ISTA Thesis"],"author":[{"full_name":"Pascual Perez, Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","last_name":"Pascual Perez","orcid":"0000-0001-8630-415X","first_name":"Guillermo"}],"page":"239","year":"2024","file_date_updated":"2024-09-19T12:36:08Z","publication_status":"published","related_material":{"record":[{"relation":"part_of_dissertation","id":"10408","status":"public"},{"relation":"part_of_dissertation","id":"11476","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"18086"},{"relation":"part_of_dissertation","id":"10049","status":"public"}]},"month":"09","supervisor":[{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"}],"date_published":"2024-09-18T00:00:00Z","_id":"18088","doi":"10.15479/at:ista:18088","file":[{"file_id":"18099","file_name":"thesis_bundle.zip","date_updated":"2024-09-19T12:35:38Z","checksum":"ce0dca715b3df48e52e2e891b6ac1bc5","file_size":11917734,"date_created":"2024-09-19T12:35:38Z","content_type":"application/x-zip-compressed","access_level":"closed","creator":"gpascual","relation":"source_file"},{"date_created":"2024-09-19T12:36:08Z","content_type":"application/pdf","access_level":"open_access","creator":"gpascual","relation":"main_file","file_id":"18100","file_name":"thesis_gpasper.pdf","date_updated":"2024-09-19T12:36:08Z","checksum":"4a2c72e90f1a0ef2a13cff800f8d1265","file_size":2729427}],"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","article_processing_charge":"No","tmp":{"short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"publication_identifier":{"issn":["2663-337X"]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"On the efficiency and security of secure group messaging","oa":1,"day":"18","department":[{"_id":"KrPi"},{"_id":"GradSch"}]},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"date_created":"2024-09-19T10:30:37Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"dernst","date_updated":"2024-09-19T10:30:37Z","file_name":"2024_LIPICs_Attali.pdf","file_id":"18098","success":1,"checksum":"9355c2e60b8ec285e1b22719c5b73f1a","file_size":3507177}],"acknowledgement":"This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I02979-N35. Mathijs Wintraecken: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Côte d’Azur.\r\nWe thank Jean-Daniel Boissonnat, Herbert Edelsbrunner, and Mariette Yvinec for discussion.","doi":"10.4230/LIPIcs.SoCG.2024.87","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2024-06-11","location":"Athens, Greece","end_date":"2024-06-14"},"article_number":"87","_id":"18097","date_published":"2024-06-06T00:00:00Z","quality_controlled":"1","department":[{"_id":"HeEd"}],"day":"06","title":"The ultimate frontier: An optimality construction for homotopy inference (media exposition)","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"isbn":["9783959773164"]},"article_processing_charge":"Yes","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"grant_number":"Z00342","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses","grant_number":"M03073"}],"ddc":["000"],"date_updated":"2025-04-15T07:16:58Z","intvolume":"       293","language":[{"iso":"eng"}],"citation":{"ieee":"D. Attali <i>et al.</i>, “The ultimate frontier: An optimality construction for homotopy inference (media exposition),” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293.","ista":"Attali D, Kourimska H, Fillmore CD, Ghosh I, Lieutier A, Stephenson ER, Wintraecken M. 2024. The ultimate frontier: An optimality construction for homotopy inference (media exposition). 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 87.","ama":"Attali D, Kourimska H, Fillmore CD, et al. The ultimate frontier: An optimality construction for homotopy inference (media exposition). In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">10.4230/LIPIcs.SoCG.2024.87</a>","apa":"Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson, E. R., &#38; Wintraecken, M. (2024). The ultimate frontier: An optimality construction for homotopy inference (media exposition). In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">https://doi.org/10.4230/LIPIcs.SoCG.2024.87</a>","short":"D. Attali, H. Kourimska, C.D. Fillmore, I. Ghosh, A. Lieutier, E.R. Stephenson, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","mla":"Attali, Dominique, et al. “The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition).” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 87, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">10.4230/LIPIcs.SoCG.2024.87</a>.","chicago":"Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh, Andre Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition).” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">https://doi.org/10.4230/LIPIcs.SoCG.2024.87</a>."},"ec_funded":1,"status":"public","has_accepted_license":"1","abstract":[{"lang":"eng","text":"In our companion paper \"Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of Euclidean spaces and of Riemannian manifolds\" we gave optimal bounds (in terms of the two one-sided Hausdorff distances) on a sample P of an input shape 𝒮 (either manifold or general set with positive reach) such that one can infer the homotopy of 𝒮 from the union of balls with some radius centred at P, both in Euclidean space and in a Riemannian manifold of bounded curvature. The construction showing the optimality of the bounds is not straightforward. The purpose of this video is to visualize and thus elucidate said construction in the Euclidean setting."}],"corr_author":"1","type":"conference","date_created":"2024-09-19T10:29:48Z","publication":"40th International Symposium on Computational Geometry","oa_version":"Published Version","month":"06","volume":293,"publication_status":"published","file_date_updated":"2024-09-19T10:30:37Z","year":"2024","author":[{"last_name":"Attali","first_name":"Dominique","full_name":"Attali, Dominique"},{"id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","full_name":"Kourimska, Hana","first_name":"Hana","orcid":"0000-0001-7841-0091","last_name":"Kourimska"},{"full_name":"Fillmore, Christopher D","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","first_name":"Christopher D","last_name":"Fillmore"},{"full_name":"Ghosh, Ishika","id":"ee449b28-344d-11ef-a6d5-9ca430e9e9ff","last_name":"Ghosh","first_name":"Ishika"},{"full_name":"Lieutier, Andre","first_name":"Andre","last_name":"Lieutier"},{"full_name":"Stephenson, Elizabeth R","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","last_name":"Stephenson","orcid":"0000-0002-6862-208X","first_name":"Elizabeth R"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","first_name":"Mathijs"}],"alternative_title":["LIPIcs"]},{"oa_version":"Published Version","scopus_import":"1","publication":"Forum of Mathematics, Sigma","date_created":"2024-09-20T12:25:25Z","corr_author":"1","type":"journal_article","abstract":[{"text":"We consider a dilute fully spin-polarized Fermi gas at positive temperature in dimensions  d∈{1,2,3} . We show that the pressure of the interacting gas is bounded from below by that of the free gas plus, to leading order, an explicit term of order  adρ2+2/d, where a is the p-wave scattering length of the repulsive interaction and  ρ  is the particle density. The results are valid for a wide range of repulsive interactions, including that of a hard core, and uniform in temperatures at most of the order of the Fermi temperature. A central ingredient in the proof is a rigorous implementation of the fermionic cluster expansion of Gaudin, Gillespie and Ripka (Nucl. Phys. A, 176.2 (1971), pp. 237–260).","lang":"eng"}],"has_accepted_license":"1","status":"public","external_id":{"isi":["001307817400001"],"arxiv":["2407.05990"]},"citation":{"chicago":"Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” <i>Forum of Mathematics, Sigma</i>. Cambridge University Press, 2024. <a href=\"https://doi.org/10.1017/fms.2024.56\">https://doi.org/10.1017/fms.2024.56</a>.","ieee":"A. B. Lauritsen and R. Seiringer, “Pressure of a dilute spin-polarized Fermi gas: Lower bound,” <i>Forum of Mathematics, Sigma</i>, vol. 12. Cambridge University Press, 2024.","ista":"Lauritsen AB, Seiringer R. 2024. Pressure of a dilute spin-polarized Fermi gas: Lower bound. Forum of Mathematics, Sigma. 12, e78.","ama":"Lauritsen AB, Seiringer R. Pressure of a dilute spin-polarized Fermi gas: Lower bound. <i>Forum of Mathematics, Sigma</i>. 2024;12. doi:<a href=\"https://doi.org/10.1017/fms.2024.56\">10.1017/fms.2024.56</a>","apa":"Lauritsen, A. B., &#38; Seiringer, R. (2024). Pressure of a dilute spin-polarized Fermi gas: Lower bound. <i>Forum of Mathematics, Sigma</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fms.2024.56\">https://doi.org/10.1017/fms.2024.56</a>","short":"A.B. Lauritsen, R. Seiringer, Forum of Mathematics, Sigma 12 (2024).","mla":"Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” <i>Forum of Mathematics, Sigma</i>, vol. 12, e78, Cambridge University Press, 2024, doi:<a href=\"https://doi.org/10.1017/fms.2024.56\">10.1017/fms.2024.56</a>."},"article_type":"original","language":[{"iso":"eng"}],"intvolume":"        12","date_updated":"2026-04-07T13:01:40Z","arxiv":1,"ddc":["510"],"project":[{"grant_number":"I06427","_id":"bda63fe5-d553-11ed-ba76-a16e3d2f256b","name":"Mathematical Challenges in BCS Theory of Superconductivity"}],"author":[{"id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","full_name":"Lauritsen, Asbjørn Bækgaard","last_name":"Lauritsen","first_name":"Asbjørn Bækgaard","orcid":"0000-0003-4476-2288"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"year":"2024","publication_status":"published","file_date_updated":"2024-09-23T09:56:17Z","related_material":{"record":[{"id":"18135","status":"public","relation":"dissertation_contains"}]},"volume":12,"month":"09","date_published":"2024-09-09T00:00:00Z","_id":"18107","quality_controlled":"1","article_number":"e78","isi":1,"acknowledgement":"Financial support by the Austrian Science Fund (FWF) through grant DOI: 10.55776/I6427 (as part of the SFB/TRR 352) is gratefully acknowledged.","file":[{"file_size":599886,"file_name":"2024_ForumMath_Lauritsen.pdf","file_id":"18126","date_updated":"2024-09-23T09:56:17Z","checksum":"330b881240013213a8e08538fec13d29","success":1,"access_level":"open_access","creator":"dernst","relation":"main_file","date_created":"2024-09-23T09:56:17Z","content_type":"application/pdf"}],"doi":"10.1017/fms.2024.56","publisher":"Cambridge University Press","article_processing_charge":"Yes","publication_identifier":{"issn":["2050-5094"]},"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"title":"Pressure of a dilute spin-polarized Fermi gas: Lower bound","day":"09","department":[{"_id":"GradSch"},{"_id":"RoSe"}]},{"has_accepted_license":"1","external_id":{"pmid":["39259592"]},"status":"public","abstract":[{"text":"Here we announce the construction and properties of a big commutative subalgebra of the Kirillov algebra attached to a finite dimensional irreducible representation of a complex semisimple Lie group. They are commutative finite flat algebras over the cohomology of the classifying space of the group. They are isomorphic with the equivariant intersection cohomology of affine Schubert varieties, endowing the latter with a new ring structure. Study of the finer aspects of the structure of the big algebras will also furnish the stalks of the intersection cohomology with ring structure, thus ringifying Lusztig’s q-weight multiplicity polynomials i.e., certain affine Kazhdan–Lusztig polynomials.","lang":"eng"}],"type":"journal_article","corr_author":"1","publication":"Proceedings of the National Academy of Sciences of the United States of America","oa_version":"Published Version","date_created":"2024-09-22T22:01:41Z","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"chicago":"Hausel, Tamás. “Commutative Avatars of Representations of Semisimple Lie Groups.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2024. <a href=\"https://doi.org/10.1073/pnas.2319341121\">https://doi.org/10.1073/pnas.2319341121</a>.","apa":"Hausel, T. (2024). Commutative avatars of representations of semisimple Lie groups. <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.2319341121\">https://doi.org/10.1073/pnas.2319341121</a>","ieee":"T. Hausel, “Commutative avatars of representations of semisimple Lie groups,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 121, no. 38. National Academy of Sciences, 2024.","ama":"Hausel T. Commutative avatars of representations of semisimple Lie groups. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2024;121(38). doi:<a href=\"https://doi.org/10.1073/pnas.2319341121\">10.1073/pnas.2319341121</a>","ista":"Hausel T. 2024. Commutative avatars of representations of semisimple Lie groups. Proceedings of the National Academy of Sciences of the United States of America. 121(38), e2319341121.","mla":"Hausel, Tamás. “Commutative Avatars of Representations of Semisimple Lie Groups.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 121, no. 38, e2319341121, National Academy of Sciences, 2024, doi:<a href=\"https://doi.org/10.1073/pnas.2319341121\">10.1073/pnas.2319341121</a>.","short":"T. Hausel, Proceedings of the National Academy of Sciences of the United States of America 121 (2024)."},"article_type":"original","ddc":["510"],"date_updated":"2025-05-08T09:57:59Z","intvolume":"       121","OA_place":"publisher","project":[{"name":"Geometry of the tip of the global nilpotent cone","_id":"34b2c9cb-11ca-11ed-8bc3-a50ba74ca4a3","grant_number":"P35847"}],"OA_type":"hybrid","author":[{"last_name":"Hausel","orcid":"0000-0002-9582-2634","first_name":"Tamás","full_name":"Hausel, Tamás","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"}],"pmid":1,"publication_status":"published","file_date_updated":"2024-09-23T11:22:56Z","year":"2024","month":"09","volume":121,"related_material":{"link":[{"url":"https://ista.ac.at/en/news/big-algebras-a-dictionary-of-abstract-math/","relation":"press_release"}]},"issue":"38","article_number":"e2319341121","_id":"18108","quality_controlled":"1","date_published":"2024-09-17T00:00:00Z","publisher":"National Academy of Sciences","file":[{"relation":"main_file","creator":"dernst","access_level":"open_access","date_created":"2024-09-23T11:22:56Z","content_type":"application/pdf","file_size":3764695,"checksum":"df80c873633c6734d2e324841e69db58","success":1,"date_updated":"2024-09-23T11:22:56Z","file_name":"2024_PNAS_Hausel.pdf","file_id":"18127"}],"doi":"10.1073/pnas.2319341121","acknowledgement":"We thank Nigel Hitchin for discussions and the joint projects this paper has grown out from. We thank Vladyslav Zveryk for collaboration on Theorem 2.3 and on the corresponding Magma code which implements big algebras. We thank Hiraku Nakajima for discussions and pointing out Theorem 3.1.2, a result generalizing our original observation in the= = 0 case. Special thanks go to Leonid Rybnikov for patiently explaining his works, in particular crucial to Theorem 2.1. We thank Michel Brion, Michael Finkelberg, Oscar García-Prada, Jakub Löwit, Joel Kamnitzer, Friedrich Knop, Michael McBreen, Anton Mellit, Takuro Mochizuki, Shon Ngô, Kamil Rychlewicz, Shiyu Shen, Leslie Spencer, Balázs Szendr ˝ oi, András Szenes, and Oksana\r\nYakimova for comments and discussions. Kamil Rychlewicz and Daniel Bedats helped with the Mathematica files for the figures, and we used the SM_isospin Tikz package of Izaak Neutelings for drawing the baryon multiplets. We thank the referees for many useful comments. We acknowledge funding from FWF grant “Geometry of the tip of the global nilpotent cone” no. P 35847.","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"eissn":["1091-6490"]},"APC_amount":"2742,92 EUR","article_processing_charge":"Yes (in subscription journal)","title":"Commutative avatars of representations of semisimple Lie groups","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"TaHa"}],"day":"17"},{"date_updated":"2025-09-08T09:50:13Z","ddc":["570"],"intvolume":"        57","abstract":[{"text":"Venous thromboembolism (VTE) is a common, deadly disease with an increasing incidence despite preventive efforts. Clinical observations have associated elevated antibody concentrations or antibody-based therapies with thrombotic events. However, how antibodies contribute to thrombosis is unknown. Here, we show that reduced blood flow enabled immunoglobulin M (IgM) to bind to FcμR and the polymeric immunoglobulin receptor (pIgR), initiating endothelial activation and platelet recruitment. Subsequently, the procoagulant surface of activated platelets accommodated antigen- and FcγR-independent IgG deposition. This leads to classical complement activation, setting in motion a prothrombotic vicious circle. Key elements of this mechanism were present in humans in the setting of venous stasis as well as in the dysregulated immunothrombosis of COVID-19. This antibody-driven thrombosis can be prevented by pharmacologically targeting complement. Hence, our results uncover antibodies as previously unrecognized central regulators of thrombosis. These findings carry relevance for therapeutic application of antibodies and open innovative avenues to target thrombosis without compromising hemostasis.","lang":"eng"}],"has_accepted_license":"1","status":"public","external_id":{"isi":["001317438500001"],"pmid":["39226900"]},"scopus_import":"1","date_created":"2024-09-22T22:01:42Z","oa_version":"Published Version","publication":"Immunity","type":"journal_article","citation":{"chicago":"Stark, Konstantin, Badr Kilani, Sven Stockhausen, Johanna Busse, Irene Schubert, Thuy Duong Tran, Florian R Gärtner, et al. “Antibodies and Complement Are Key Drivers of Thrombosis.” <i>Immunity</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.immuni.2024.08.007\">https://doi.org/10.1016/j.immuni.2024.08.007</a>.","short":"K. Stark, B. Kilani, S. Stockhausen, J. Busse, I. Schubert, T.D. Tran, F.R. Gärtner, A. Leunig, K. Pekayvaz, L. Nicolai, V. Fumagalli, J. Stermann, F. Stephan, C. David, M.B. Müller, B. Heyman, A. Lux, A. Da Palma Guerreiro, L.P. Frenzel, C.Q. Schmidt, A. Dopler, M. Moser, S. Chandraratne, M.L. Von Brühl, M. Lorenz, T. Korff, M. Rudelius, O. Popp, M. Kirchner, P. Mertins, F. Nimmerjahn, M. Iannacone, M. Sperandio, B. Engelmann, A. Verschoor, S. Massberg, Immunity 57 (2024) 2140–2156.","mla":"Stark, Konstantin, et al. “Antibodies and Complement Are Key Drivers of Thrombosis.” <i>Immunity</i>, vol. 57, no. 9, Elsevier, 2024, pp. 2140–56, doi:<a href=\"https://doi.org/10.1016/j.immuni.2024.08.007\">10.1016/j.immuni.2024.08.007</a>.","ama":"Stark K, Kilani B, Stockhausen S, et al. Antibodies and complement are key drivers of thrombosis. <i>Immunity</i>. 2024;57(9):2140-2156. doi:<a href=\"https://doi.org/10.1016/j.immuni.2024.08.007\">10.1016/j.immuni.2024.08.007</a>","ista":"Stark K, Kilani B, Stockhausen S, Busse J, Schubert I, Tran TD, Gärtner FR, Leunig A, Pekayvaz K, Nicolai L, Fumagalli V, Stermann J, Stephan F, David C, Müller MB, Heyman B, Lux A, Da Palma Guerreiro A, Frenzel LP, Schmidt CQ, Dopler A, Moser M, Chandraratne S, Von Brühl ML, Lorenz M, Korff T, Rudelius M, Popp O, Kirchner M, Mertins P, Nimmerjahn F, Iannacone M, Sperandio M, Engelmann B, Verschoor A, Massberg S. 2024. Antibodies and complement are key drivers of thrombosis. Immunity. 57(9), 2140–2156.","ieee":"K. Stark <i>et al.</i>, “Antibodies and complement are key drivers of thrombosis,” <i>Immunity</i>, vol. 57, no. 9. Elsevier, pp. 2140–2156, 2024.","apa":"Stark, K., Kilani, B., Stockhausen, S., Busse, J., Schubert, I., Tran, T. D., … Massberg, S. (2024). Antibodies and complement are key drivers of thrombosis. <i>Immunity</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.immuni.2024.08.007\">https://doi.org/10.1016/j.immuni.2024.08.007</a>"},"article_type":"original","language":[{"iso":"eng"}],"file_date_updated":"2024-09-30T09:16:03Z","publication_status":"published","year":"2024","month":"09","issue":"9","volume":57,"author":[{"last_name":"Stark","first_name":"Konstantin","full_name":"Stark, Konstantin"},{"full_name":"Kilani, Badr","last_name":"Kilani","first_name":"Badr"},{"first_name":"Sven","last_name":"Stockhausen","full_name":"Stockhausen, Sven"},{"last_name":"Busse","first_name":"Johanna","full_name":"Busse, Johanna"},{"full_name":"Schubert, Irene","first_name":"Irene","last_name":"Schubert"},{"last_name":"Tran","first_name":"Thuy Duong","full_name":"Tran, Thuy Duong"},{"last_name":"Gärtner","orcid":"0000-0001-6120-3723","first_name":"Florian R","full_name":"Gärtner, Florian R","id":"397A88EE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Leunig","first_name":"Alexander","full_name":"Leunig, Alexander"},{"first_name":"Kami","last_name":"Pekayvaz","full_name":"Pekayvaz, Kami"},{"full_name":"Nicolai, Leo","last_name":"Nicolai","first_name":"Leo"},{"full_name":"Fumagalli, Valeria","last_name":"Fumagalli","first_name":"Valeria"},{"full_name":"Stermann, Julia","first_name":"Julia","last_name":"Stermann"},{"last_name":"Stephan","first_name":"Felix","full_name":"Stephan, Felix"},{"full_name":"David, Christian","first_name":"Christian","last_name":"David"},{"last_name":"Müller","first_name":"Martin B.","full_name":"Müller, Martin B."},{"last_name":"Heyman","first_name":"Birgitta","full_name":"Heyman, Birgitta"},{"last_name":"Lux","first_name":"Anja","full_name":"Lux, Anja"},{"first_name":"Alexandra","last_name":"Da Palma Guerreiro","full_name":"Da Palma Guerreiro, Alexandra"},{"full_name":"Frenzel, Lukas P.","first_name":"Lukas P.","last_name":"Frenzel"},{"first_name":"Christoph Q.","last_name":"Schmidt","full_name":"Schmidt, Christoph Q."},{"last_name":"Dopler","first_name":"Arthur","full_name":"Dopler, Arthur"},{"full_name":"Moser, Markus","last_name":"Moser","first_name":"Markus"},{"first_name":"Sue","last_name":"Chandraratne","full_name":"Chandraratne, Sue"},{"full_name":"Von Brühl, Marie Luise","first_name":"Marie Luise","last_name":"Von Brühl"},{"last_name":"Lorenz","first_name":"Michael","full_name":"Lorenz, Michael"},{"first_name":"Thomas","last_name":"Korff","full_name":"Korff, Thomas"},{"full_name":"Rudelius, Martina","first_name":"Martina","last_name":"Rudelius"},{"full_name":"Popp, Oliver","first_name":"Oliver","last_name":"Popp"},{"full_name":"Kirchner, Marieluise","last_name":"Kirchner","first_name":"Marieluise"},{"last_name":"Mertins","first_name":"Philipp","full_name":"Mertins, Philipp"},{"full_name":"Nimmerjahn, Falk","first_name":"Falk","last_name":"Nimmerjahn"},{"last_name":"Iannacone","first_name":"Matteo","full_name":"Iannacone, Matteo"},{"full_name":"Sperandio, Markus","last_name":"Sperandio","first_name":"Markus"},{"full_name":"Engelmann, Bernd","first_name":"Bernd","last_name":"Engelmann"},{"first_name":"Admar","last_name":"Verschoor","full_name":"Verschoor, Admar"},{"full_name":"Massberg, Steffen","last_name":"Massberg","first_name":"Steffen"}],"page":"2140-2156","pmid":1,"publisher":"Elsevier","file":[{"content_type":"application/pdf","date_created":"2024-09-30T09:16:03Z","relation":"main_file","creator":"dernst","access_level":"open_access","success":1,"checksum":"4683de43d06a8fd8e3fc91af4ddc1ba2","date_updated":"2024-09-30T09:16:03Z","file_name":"2024_Immunity_Stark.pdf","file_id":"18162","file_size":6892750}],"isi":1,"doi":"10.1016/j.immuni.2024.08.007","acknowledgement":"We thank Michael Carroll (Harvard Medical School, Boston) for providing Ighmtm1Che, C4−/−, and C3−/− mice; Mark Suter (University of Zurich, Zurich) for providing Aicda−/− mice; Marina Botto (Imperial College London, London) for providing C1q−/− and fB−/− mice; Craig Gerard (Harvard Medical School, Boston) for providing C3aR−/− mice; Falk Nimmerjahn (University Erlangen-Nuernberg, Erlangen) for providing Fcgr−/−Fcgr2b−/− mice; Karl Lang (University of Duisburg-Essen, Essen) for providing Fcmr−/− mice; Hans Hengartner and Rolf Zinkernagel (ETH Zurich, Zurich) for providing KL25 mice; Mark Zabel (University Hospital of Zurich, Zurich) for providing CR2−/− mice; Christie Ballantyne (Baylor College of Medicine, Houston) for providing CD11c−/− mice; and Siamon Gordon (University of Oxford, Oxford) for providing CD11b−/− mice. A.V. wishes to thank Michael Grünaug and dedicates this work to Annette, Rita, and Hans.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. \r\n947611) (K.S.). This study was supported by the Deutsche Forschungsgemeinschaft through the collaborative research center 914 project B02 (K.S. and S.M.), project B04 (A.V.), project A01 (M.M.), project B01 (M.S.), the collaborative research center 1123 project B07 (K.S. and S.M.), the collaborative research center 359 (project A03 [K.S.] and B02 [M.S.]), the international research training group 1911 project B09 (A.V.), the clinical research unit 303 project 7 (A.V.), cluster of excellence 2167 (A.V.), collaborative research center 1526 project 05 (A.V.), the ANR-DFG project JAKPOT (K.S.), LMUexcellent (K.S.), and the Deutsche Zentrum für Herz-Kreislauf-Forschung (PostDoc Grant and partner site project [K.S. and S.M.]). M.I. is supported by the European Research Council (ERC) Advanced Grant 101141363, ERC Proof of Concept Grant 101138728, Italian Association for Cancer Research (AIRC) Grants 19891 and \r\n22737, Italian Ministry for University and Research Grants PE00000007 (INF-ACT) and PRIN \r\n2022FMESXL, Funded Research Agreement from Asher Biotherapeutics, VIR Biotechnology, and BlueJay Therapeutics. V.F. is supported by the Italian Ministry for University and Research Grants PE00000007 (INF-ACT) and Fondazione Prossimo Mio.","_id":"18109","date_published":"2024-09-10T00:00:00Z","quality_controlled":"1","oa":1,"title":"Antibodies and complement are key drivers of thrombosis","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"MiSi"}],"day":"10","publication_identifier":{"eissn":["1097-4180"]},"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"Yes (in subscription journal)"},{"department":[{"_id":"MaSe"}],"day":"11","title":"Anomalous transport in the kinetically constrained quantum East-West model","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"article_processing_charge":"No","publisher":"American Physical Society","isi":1,"doi":"10.1103/PhysRevB.110.L100304","acknowledgement":"The authors acknowledge useful discussions with M. Serbyn, Z. Papic, and A. Nunnenkamp. ´\r\nP.B. is supported by the Erwin Schrödinger Center for Quantum Science & Technology (ESQ) of the Österreichische Akademie der Wissenschaften (ÖAW) under the Discovery Grant. M.L. acknowledges support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement\r\nNo. 850899). The numerical simulations were performed using the ITensor library [68] on the Vienna Scientific Cluster (VSC).","article_number":"L100304","_id":"18110","date_published":"2024-09-11T00:00:00Z","quality_controlled":"1","month":"09","volume":110,"issue":"10","publication_status":"published","year":"2024","author":[{"id":"4115AF5C-F248-11E8-B48F-1D18A9856A87","full_name":"Brighi, Pietro","first_name":"Pietro","orcid":"0000-0002-7969-2729","last_name":"Brighi"},{"full_name":"Ljubotina, Marko","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","last_name":"Ljubotina","orcid":"0000-0003-0038-7068","first_name":"Marko"}],"project":[{"_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}],"arxiv":1,"date_updated":"2025-09-08T09:49:29Z","intvolume":"       110","language":[{"iso":"eng"}],"citation":{"chicago":"Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically Constrained Quantum East-West Model.” <i>Physical Review B</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">https://doi.org/10.1103/PhysRevB.110.L100304</a>.","apa":"Brighi, P., &#38; Ljubotina, M. (2024). Anomalous transport in the kinetically constrained quantum East-West model. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">https://doi.org/10.1103/PhysRevB.110.L100304</a>","ista":"Brighi P, Ljubotina M. 2024. Anomalous transport in the kinetically constrained quantum East-West model. Physical Review B. 110(10), L100304.","ieee":"P. Brighi and M. Ljubotina, “Anomalous transport in the kinetically constrained quantum East-West model,” <i>Physical Review B</i>, vol. 110, no. 10. American Physical Society, 2024.","ama":"Brighi P, Ljubotina M. Anomalous transport in the kinetically constrained quantum East-West model. <i>Physical Review B</i>. 2024;110(10). doi:<a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">10.1103/PhysRevB.110.L100304</a>","mla":"Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically Constrained Quantum East-West Model.” <i>Physical Review B</i>, vol. 110, no. 10, L100304, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">10.1103/PhysRevB.110.L100304</a>.","short":"P. Brighi, M. Ljubotina, Physical Review B 110 (2024)."},"ec_funded":1,"article_type":"letter_note","external_id":{"isi":["001361617100003"],"arxiv":["2405.02102"]},"status":"public","abstract":[{"lang":"eng","text":"We study a chaotic particle-conserving kinetically constrained model, with a single parameter which allows us to break reflection symmetry. Through extensive numerical simulations we find that the domain wall state shows a variety of dynamical behaviors from localization all the way to ballistic transport, depending on the value of the reflection breaking parameter. Surprisingly, such anomalous behavior is not mirrored in infinite-temperature dynamics, which appear to scale diffusively, in line with expectations for generic interacting models. However, studying the particle density gradient, we show that the lack of reflection symmetry affects infinite-temperature dynamics, resulting in an asymmetric dynamical structure factor. This is in disagreement with normal diffusion and suggests that the model may also exhibit anomalous dynamics at infinite temperature in the thermodynamic limit. Finally, we observe low-entangled eigenstates in the spectrum of the model, a telltale sign of quantum many-body scars."}],"corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.02102"}],"type":"journal_article","scopus_import":"1","oa_version":"Preprint","date_created":"2024-09-22T22:01:42Z","publication":"Physical Review B"},{"publication_identifier":{"eissn":["2041-8213"],"issn":["2041-8205"]},"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"Yes","oa":1,"title":"Tidal disruption events from stripped stars","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"YlGo"}],"day":"12","article_number":"L9","_id":"18111","date_published":"2024-09-12T00:00:00Z","quality_controlled":"1","publisher":"IOP Publishing","file":[{"access_level":"open_access","relation":"main_file","creator":"dernst","date_created":"2024-09-30T08:54:26Z","content_type":"application/pdf","file_size":844227,"date_updated":"2024-09-30T08:54:26Z","file_name":"2024_AstrophysicalJourn_Mockler.pdf","file_id":"18161","checksum":"050ddf873244839825714cca42b5d857","success":1}],"acknowledgement":"This work was performed in part at Aspen Center for Physics, which is supported by National Science Foundation grant PHY-2210452. We thank the participants and organizers of the summer Aspen 2023 workshop on “Stellar Interactions and the Transients They Cause” for fruitful discussions. B.M. is grateful for support from the Carnegie Theoretical Astrophysics\r\nCenter. M.G.-G. is grateful for the support from Northwestern University’s Presidential Fellowship. E.R.-R. thanks the Heising-Simons Foundation, NSF (AST-2150255 and AST2307710), Swift (80NSSC21K1409, 80NSSC19K1391), and Chandra (22-0142) for support. ","doi":"10.3847/2041-8213/ad6c34","isi":1,"author":[{"full_name":"Mockler, Brenna","first_name":"Brenna","last_name":"Mockler"},{"last_name":"Gallegos-Garcia","first_name":"Monica","full_name":"Gallegos-Garcia, Monica"},{"orcid":"0000-0002-6960-6911","first_name":"Ylva Louise Linsdotter","last_name":"Götberg","full_name":"Götberg, Ylva Louise Linsdotter","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d"},{"last_name":"Miller","first_name":"Jon M.","full_name":"Miller, Jon M."},{"full_name":"Ramirez-Ruiz, Enrico","last_name":"Ramirez-Ruiz","first_name":"Enrico"}],"file_date_updated":"2024-09-30T08:54:26Z","publication_status":"published","year":"2024","month":"09","issue":"1","volume":973,"abstract":[{"lang":"eng","text":"Observations of tidal disruption events (TDEs) show signs of nitrogen enrichment reminiscent of other astrophysical sources such as active galactic nuclei and star-forming galaxies. Given that TDEs probe the gas from a single star, it is possible to test whether the observed enrichment is consistent with expectations from the CNO cycle by looking at the observed nitrogen/carbon (N/C) abundance ratios. Given that ≈20% of solar-mass stars (and an even larger fraction of more massive stars) live in close binaries, it is worthwhile to also consider what TDEs from stars influenced by binary evolution would look like. We show here that TDEs from stars stripped of their hydrogen-rich (and nitrogen-poor) envelopes through previous binary-induced mass loss can produce much higher observable N/C enhancements than even TDEs from massive stars. Additionally, we predict that the time dependence of the N/C abundance ratio in the mass fallback rate of stripped stars will follow the inverse behavior of main-sequence stars, enabling a more accurate characterization of the disrupted star."}],"external_id":{"isi":["001310592900001"]},"status":"public","has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","date_created":"2024-09-22T22:01:42Z","publication":"Astrophysical Journal Letters","type":"journal_article","article_type":"original","citation":{"chicago":"Mockler, Brenna, Monica Gallegos-Garcia, Ylva Louise Linsdotter Götberg, Jon M. Miller, and Enrico Ramirez-Ruiz. “Tidal Disruption Events from Stripped Stars.” <i>Astrophysical Journal Letters</i>. IOP Publishing, 2024. <a href=\"https://doi.org/10.3847/2041-8213/ad6c34\">https://doi.org/10.3847/2041-8213/ad6c34</a>.","short":"B. Mockler, M. Gallegos-Garcia, Y.L.L. Götberg, J.M. Miller, E. Ramirez-Ruiz, Astrophysical Journal Letters 973 (2024).","mla":"Mockler, Brenna, et al. “Tidal Disruption Events from Stripped Stars.” <i>Astrophysical Journal Letters</i>, vol. 973, no. 1, L9, IOP Publishing, 2024, doi:<a href=\"https://doi.org/10.3847/2041-8213/ad6c34\">10.3847/2041-8213/ad6c34</a>.","ieee":"B. Mockler, M. Gallegos-Garcia, Y. L. L. Götberg, J. M. Miller, and E. Ramirez-Ruiz, “Tidal disruption events from stripped stars,” <i>Astrophysical Journal Letters</i>, vol. 973, no. 1. IOP Publishing, 2024.","ista":"Mockler B, Gallegos-Garcia M, Götberg YLL, Miller JM, Ramirez-Ruiz E. 2024. Tidal disruption events from stripped stars. Astrophysical Journal Letters. 973(1), L9.","ama":"Mockler B, Gallegos-Garcia M, Götberg YLL, Miller JM, Ramirez-Ruiz E. Tidal disruption events from stripped stars. <i>Astrophysical Journal Letters</i>. 2024;973(1). doi:<a href=\"https://doi.org/10.3847/2041-8213/ad6c34\">10.3847/2041-8213/ad6c34</a>","apa":"Mockler, B., Gallegos-Garcia, M., Götberg, Y. L. L., Miller, J. M., &#38; Ramirez-Ruiz, E. (2024). Tidal disruption events from stripped stars. <i>Astrophysical Journal Letters</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/2041-8213/ad6c34\">https://doi.org/10.3847/2041-8213/ad6c34</a>"},"DOAJ_listed":"1","language":[{"iso":"eng"}],"date_updated":"2025-09-08T09:48:50Z","ddc":["520"],"intvolume":"       973"},{"title":"Extreme compression of large language models via additive quantization","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"day":"01","publication_identifier":{"eissn":["2640-3498"]},"article_processing_charge":"No","conference":{"start_date":"2024-07-21","location":"Vienna, Austria","end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning"},"publisher":"ML Research Press","acknowledgement":"Authors would like to thank Ruslan Svirschevski for his help in solving technical issues with AQLM and baselines. We also thank Tim Dettmers for helpful discussions on the structure of weights in modern LLMs and size-accuracy trade-offs. The authors would also like to thank Daniil Pavlov for his assistance with CPU benchmarking. Finally, authors would like to thank the communities of ML enthusiasts known as LocalLLaMA5 and Petals community on discord6\r\nfor the crowd wisdom about running LLMs on consumer devices. Egiazarian Vage and Denis Kuznedelev and Andrei Panferov were supported by the grant for research centers in the field of AI provided by the Analytical Center for the Government of the Russian Federation (ACRF) in\r\naccordance with the agreement on the provision of subsidies (identifier of the agreement 000000D730321P5Q0002) and the agreement with HSE University No. 70-2021-00139.","_id":"18113","date_published":"2024-09-01T00:00:00Z","quality_controlled":"1","publication_status":"published","year":"2024","month":"09","volume":235,"author":[{"last_name":"Egiazarian","first_name":"Vage","full_name":"Egiazarian, Vage"},{"first_name":"Andrei","last_name":"Panferov","id":"2c18daae-4dbe-11ef-8491-98ce2d960f09","full_name":"Panferov, Andrei"},{"full_name":"Kuznedelev, Denis","last_name":"Kuznedelev","first_name":"Denis"},{"id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","full_name":"Frantar, Elias","last_name":"Frantar","first_name":"Elias"},{"last_name":"Babenko","first_name":"Artem","full_name":"Babenko, Artem"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["PMLR"],"page":"12284-12303","arxiv":1,"date_updated":"2024-10-01T08:13:05Z","intvolume":"       235","status":"public","external_id":{"arxiv":["2401.06118"]},"abstract":[{"lang":"eng","text":"The emergence of accurate open large language models (LLMs) has led to a race towards performant quantization techniques which can enable their execution on end-user devices. In this paper, we revisit the problem of “extreme” LLM compression—defined as targeting extremely low bit counts, such as 2 to 3 bits per parameter—from the point of view of classic methods in Multi-Codebook Quantization (MCQ). Our algorithm, called AQLM, generalizes the classic Additive Quantization (AQ) approach for information retrieval to advance the state-of-the-art in LLM compression, via two innovations: 1) learned additive quantization of weight matrices in input-adaptive fashion, and 2) joint optimization of codebook parameters across each transformer blocks. Broadly, AQLM is the first scheme that is Pareto optimal in terms of accuracy-vs-model-size when compressing to less than 3 bits per parameter, and significantly improves upon all known schemes in the extreme compression (2bit) regime. In addition, AQLM is practical: we provide fast GPU and CPU implementations of AQLM for token generation, which enable us to match or outperform optimized FP16 implementations for speed, while executing in a much smaller memory footprint."}],"type":"conference","corr_author":"1","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2401.06118"}],"publication":"Proceedings of the 41st International Conference on Machine Learning","date_created":"2024-09-22T22:01:43Z","scopus_import":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"citation":{"chicago":"Egiazarian, Vage, Andrei Panferov, Denis Kuznedelev, Elias Frantar, Artem Babenko, and Dan-Adrian Alistarh. “Extreme Compression of Large Language Models via Additive Quantization.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:12284–303. ML Research Press, 2024.","short":"V. Egiazarian, A. Panferov, D. Kuznedelev, E. Frantar, A. Babenko, D.-A. Alistarh, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 12284–12303.","mla":"Egiazarian, Vage, et al. “Extreme Compression of Large Language Models via Additive Quantization.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 12284–303.","ista":"Egiazarian V, Panferov A, Kuznedelev D, Frantar E, Babenko A, Alistarh D-A. 2024. Extreme compression of large language models via additive quantization. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 12284–12303.","ieee":"V. Egiazarian, A. Panferov, D. Kuznedelev, E. Frantar, A. Babenko, and D.-A. Alistarh, “Extreme compression of large language models via additive quantization,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 12284–12303.","ama":"Egiazarian V, Panferov A, Kuznedelev D, Frantar E, Babenko A, Alistarh D-A. Extreme compression of large language models via additive quantization. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:12284-12303.","apa":"Egiazarian, V., Panferov, A., Kuznedelev, D., Frantar, E., Babenko, A., &#38; Alistarh, D.-A. (2024). Extreme compression of large language models via additive quantization. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 12284–12303). Vienna, Austria: ML Research Press."}},{"OA_type":"diamond","ddc":["000"],"arxiv":1,"date_updated":"2026-06-18T17:59:46Z","OA_place":"publisher","intvolume":"       235","language":[{"iso":"eng"}],"citation":{"chicago":"Pervez, Adeel A, Francesco Locatello, and Efstratios Gavves. “Mechanistic Neural Networks for Scientific Machine Learning.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:40484–501. ML Research Press, 2024.","apa":"Pervez, A. A., Locatello, F., &#38; Gavves, E. (2024). Mechanistic neural networks for scientific machine learning. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 40484–40501). Vienna, Austria: ML Research Press.","ama":"Pervez AA, Locatello F, Gavves E. Mechanistic neural networks for scientific machine learning. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:40484-40501.","ista":"Pervez AA, Locatello F, Gavves E. 2024. Mechanistic neural networks for scientific machine learning. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 40484–40501.","ieee":"A. A. Pervez, F. Locatello, and E. Gavves, “Mechanistic neural networks for scientific machine learning,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 40484–40501.","mla":"Pervez, Adeel A., et al. “Mechanistic Neural Networks for Scientific Machine Learning.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 40484–501.","short":"A.A. Pervez, F. Locatello, E. Gavves, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 40484–40501."},"external_id":{"arxiv":["2402.13077"]},"status":"public","abstract":[{"text":"This paper presents Mechanistic Neural Networks, a neural network design for machine learning applications in the sciences. It incorporates a new Mechanistic Block in standard architectures to explicitly learn governing differential equations as representations, revealing the underlying dynamics of data and enhancing interpretability and efficiency in data modeling. Central to our approach is a novel Relaxed Linear Programming Solver (NeuRLP) inspired by a technique that reduces solving linear ODEs to solving linear programs. This integrates well with neural networks and surpasses the limitations of traditional ODE solvers enabling scalable GPU parallel processing. Overall, Mechanistic Neural Networks demonstrate their versatility for scientific machine learning applications, adeptly managing tasks from equation discovery to dynamic systems modeling. We prove their comprehensive capabilities in analyzing and interpreting complex scientific data across various applications, showing significant performance against specialized state-of-the-art methods. Source code is available at https://github.com/alpz/mech-nn.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2402.13077"}],"type":"conference","oa_version":"Published Version","publication":"Proceedings of the 41st International Conference on Machine Learning","date_created":"2024-09-22T22:01:43Z","scopus_import":"1","month":"09","volume":235,"related_material":{"link":[{"relation":"software","url":"https://github.com/alpz/mech-nn"}]},"publication_status":"published","year":"2024","page":"40484-40501","author":[{"first_name":"Adeel A","last_name":"Pervez","id":"fca6d90c-d47f-11ee-bc87-93ff51604981","full_name":"Pervez, Adeel A"},{"last_name":"Locatello","orcid":"0000-0002-4850-0683","first_name":"Francesco","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"full_name":"Gavves, Efstratios","first_name":"Efstratios","last_name":"Gavves"}],"alternative_title":["PMLR"],"publisher":"ML Research Press","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2024-07-27","start_date":"2024-07-21","location":"Vienna, Austria"},"quality_controlled":"1","_id":"18114","date_published":"2024-09-01T00:00:00Z","department":[{"_id":"FrLo"}],"day":"01","title":"Mechanistic neural networks for scientific machine learning","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2640-3498"]},"article_processing_charge":"No"}]