[{"project":[{"grant_number":"805041","name":"Organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate","call_identifier":"H2020","_id":"629205d8-2b32-11ec-9570-e1356ff73576"}],"citation":{"mla":"Charinti, Giousef Alexandros, et al. “Impact of Upper-Level Warming on Tropical Cyclone Intensity.” <i>Geophysical Research Letters</i>, vol. 53, no. 17, e2025GL121307, Wiley, 2026, doi:<a href=\"https://doi.org/10.1029/2025GL121307\">10.1029/2025GL121307</a>.","ama":"Charinti GA, Davin A, Polesello A, Muller CJ, Pasquero C. Impact of upper-level warming on tropical cyclone intensity. <i>Geophysical Research Letters</i>. 2026;53(17). doi:<a href=\"https://doi.org/10.1029/2025GL121307\">10.1029/2025GL121307</a>","ista":"Charinti GA, Davin A, Polesello A, Muller CJ, Pasquero C. 2026. Impact of upper-level warming on tropical cyclone intensity. Geophysical Research Letters. 53(17), e2025GL121307.","short":"G.A. Charinti, A. Davin, A. Polesello, C.J. Muller, C. Pasquero, Geophysical Research Letters 53 (2026).","ieee":"G. A. Charinti, A. Davin, A. Polesello, C. J. Muller, and C. Pasquero, “Impact of upper-level warming on tropical cyclone intensity,” <i>Geophysical Research Letters</i>, vol. 53, no. 17. Wiley, 2026.","chicago":"Charinti, Giousef Alexandros, Andrea Davin, Andrea Polesello, Caroline J Muller, and Claudia Pasquero. “Impact of Upper-Level Warming on Tropical Cyclone Intensity.” <i>Geophysical Research Letters</i>. Wiley, 2026. <a href=\"https://doi.org/10.1029/2025GL121307\">https://doi.org/10.1029/2025GL121307</a>.","apa":"Charinti, G. A., Davin, A., Polesello, A., Muller, C. J., &#38; Pasquero, C. (2026). Impact of upper-level warming on tropical cyclone intensity. <i>Geophysical Research Letters</i>. Wiley. <a href=\"https://doi.org/10.1029/2025GL121307\">https://doi.org/10.1029/2025GL121307</a>"},"DOAJ_listed":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-09-15T12:38:32Z","supplementarymaterial":"yes","PlanS_conform":"1","_id":"22912","title":"Impact of upper-level warming on tropical cyclone intensity","date_created":"2026-09-13T22:01:51Z","author":[{"id":"7f7cc04c-074c-11ed-af92-eb16afd85c75","last_name":"Charinti","first_name":"Giousef Alexandros","full_name":"Charinti, Giousef Alexandros"},{"full_name":"Davin, Andrea","last_name":"Davin","first_name":"Andrea"},{"last_name":"Polesello","first_name":"Andrea","id":"74c777f4-32da-11ee-b498-874db0835561","full_name":"Polesello, Andrea"},{"orcid":"0000-0001-5836-5350","full_name":"Muller, Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","last_name":"Muller","first_name":"Caroline J"},{"first_name":"Claudia","last_name":"Pasquero","full_name":"Pasquero, Claudia"}],"status":"public","article_type":"original","type":"journal_article","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Deep convection from tropical cyclones (TCs) can reach the height of the tropopause and as such an interaction between the upper troposphere and lower stratosphere is likely to occur. Such interactions have been reported in both numerical and observational studies, mainly showing that subsidence from the stratosphere into the eye of an intensifying storm leads to a high-level warm core. However, the effect of this upper-level warming on the intensity of the TCs is not yet well understood. In this study, we show that subsiding air from the stratosphere beyond subsidence in the eye is the reason for the upper-level warming in idealized simulations. We further show that it is possible to quantify the effects of the upper-level warming on the potential intensity of the TC. Finally, we conclude that overshooting convection into the stratosphere causes the observed subsidence, as both become more pronounced with increasing sea-surface temperatures (SST)."}],"OA_place":"publisher","OA_type":"gold","language":[{"iso":"eng"}],"publication":"Geophysical Research Letters","issue":"17","scopus_import":"1","ec_funded":1,"publication_identifier":{"eissn":["1944-8007"],"issn":["0094-8276"]},"acknowledgement":"GAC and CM acknowledge funding from the European Research Council (ERC)under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, Grant Agreement No.805041). AD and CP acknowledge support by the National Recovery and Resilience Plan project TeRABIT (Terabit network for Research and Academic Big data in Italy—IR0000022—PNRR Missione 4,Componente 2, Investimento 3.1 CUPI53C21000370006) in the frame of the European Union ‐ NextGenerationEUfunding. Open Access funding provided by Institute of Science and TechnologyAustria/KEMÖ","file_date_updated":"2026-09-15T12:34:00Z","date_published":"2026-09-16T00:00:00Z","has_accepted_license":"1","article_processing_charge":"Yes","fulldoi":"https://doi.org/10.1029/2025GL121307","das_tickbox":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["550"],"year":"2026","quality_controlled":"1","publication_status":"published","intvolume":"        53","article_number":"e2025GL121307","volume":53,"file":[{"relation":"main_file","creator":"dernst","access_level":"open_access","date_created":"2026-09-15T12:34:00Z","checksum":"8d1c470e4c2cb43bf3220f34a0d3e10c","success":1,"file_size":1277378,"file_name":"2026_GeophysicalResearchLetters_Charinti.pdf","date_updated":"2026-09-15T12:34:00Z","content_type":"application/pdf","file_id":"22931"}],"researchdata_availability":"yes","doi":"10.1029/2025GL121307","day":"16","dataavailabilitystatement":"The post‐processed simulation data and the analysis scripts are available on Figshare https://doi.org/10.6084/m9.figshare.30933764 (Charinti et al., 2025).","oa":1,"corr_author":"1","month":"09","department":[{"_id":"CaMu"},{"_id":"GradSch"}],"publisher":"Wiley"},{"doi":"10.1609/aaai.v40i43.40931","volume":40,"oa":1,"day":"14","publisher":"Association for the Advancement of Artificial Intelligence","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"month":"03","external_id":{"arxiv":["2505.04539"]},"article_processing_charge":"No","conference":{"name":"AAAI: Conference on Artificial Intelligence","end_date":"2026-01-27","start_date":"2026-01-20","location":"Singapore, Singapore"},"date_published":"2026-03-14T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2505.04539","open_access":"1"}],"arxiv":1,"fulldoi":"https://doi.org/10.1609/aaai.v40i43.40931","intvolume":"        40","publication_status":"published","quality_controlled":"1","year":"2026","OA_type":"green","OA_place":"repository","language":[{"iso":"eng"}],"scopus_import":"1","issue":"43","publication":"Proceedings of the 40th AAAI Conference on Artificial Intelligence","ec_funded":1,"acknowledgement":"This work was supported by ERC CoG 863818 (ForMSMArt) and Austrian Science Fund (FWF) 10.55776/COE12. We also thank Hossein Zakerinia for his helpful feedback.","publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"]},"page":"36137-36145","citation":{"ama":"Asadi A, Chatterjee K, Goharshady E, Karrabi M, Shafiee A. Qualitative analysis of ω-regular objectives on robust MDPs. In: <i>Proceedings of the 40th AAAI Conference on Artificial Intelligence</i>. Vol 40. Association for the Advancement of Artificial Intelligence; 2026:36137-36145. doi:<a href=\"https://doi.org/10.1609/aaai.v40i43.40931\">10.1609/aaai.v40i43.40931</a>","mla":"Asadi, Ali, et al. “Qualitative Analysis of ω-Regular Objectives on Robust MDPs.” <i>Proceedings of the 40th AAAI Conference on Artificial Intelligence</i>, vol. 40, no. 43, Association for the Advancement of Artificial Intelligence, 2026, pp. 36137–45, doi:<a href=\"https://doi.org/10.1609/aaai.v40i43.40931\">10.1609/aaai.v40i43.40931</a>.","short":"A. Asadi, K. Chatterjee, E. Goharshady, M. Karrabi, A. Shafiee, in:, Proceedings of the 40th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2026, pp. 36137–36145.","ista":"Asadi A, Chatterjee K, Goharshady E, Karrabi M, Shafiee A. 2026. Qualitative analysis of ω-regular objectives on robust MDPs. Proceedings of the 40th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 40, 36137–36145.","ieee":"A. Asadi, K. Chatterjee, E. Goharshady, M. Karrabi, and A. Shafiee, “Qualitative analysis of ω-regular objectives on robust MDPs,” in <i>Proceedings of the 40th AAAI Conference on Artificial Intelligence</i>, Singapore, Singapore, 2026, vol. 40, no. 43, pp. 36137–36145.","chicago":"Asadi, Ali, Krishnendu Chatterjee, Ehsan Goharshady, Mehrdad Karrabi, and Ali Shafiee. “Qualitative Analysis of ω-Regular Objectives on Robust MDPs.” In <i>Proceedings of the 40th AAAI Conference on Artificial Intelligence</i>, 40:36137–45. Association for the Advancement of Artificial Intelligence, 2026. <a href=\"https://doi.org/10.1609/aaai.v40i43.40931\">https://doi.org/10.1609/aaai.v40i43.40931</a>.","apa":"Asadi, A., Chatterjee, K., Goharshady, E., Karrabi, M., &#38; Shafiee, A. (2026). Qualitative analysis of ω-regular objectives on robust MDPs. In <i>Proceedings of the 40th AAAI Conference on Artificial Intelligence</i> (Vol. 40, pp. 36137–36145). Singapore, Singapore: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v40i43.40931\">https://doi.org/10.1609/aaai.v40i43.40931</a>"},"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"COE12","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","name":"Bilateral Artificial Intelligence (Chatterjee)"}],"date_updated":"2026-09-16T07:27:43Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_created":"2026-04-12T22:01:50Z","author":[{"full_name":"Asadi, Ali","last_name":"Asadi","first_name":"Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","last_name":"Kafshdar Goharshadi","first_name":"Ehsan","orcid":"0000-0002-8595-0587","full_name":"Kafshdar Goharshadi, Ehsan"},{"first_name":"Mehrdad","last_name":"Karrabi","id":"67638922-f394-11eb-9cf6-f20423e08757","orcid":"0009-0007-5253-9170","full_name":"Karrabi, Mehrdad"},{"full_name":"Shafiee, Ali","first_name":"Ali","last_name":"Shafiee","id":"2783031a-7378-11f0-b2d0-f17f1db2ebad"}],"title":"Qualitative analysis of ω-regular objectives on robust MDPs","_id":"21717","abstract":[{"text":"Robust Markov Decision Processes (RMDPs) generalize classical MDPs that consider uncertainties in transition probabilities by defining a set of possible transition functions. An objective is a set of runs (or infinite trajectories) of the RMDP, and the value for an objective is the maximal probability that the agent can guarantee against the adversarial environment. We consider (a) reachability objectives, where given a target set of states, the goal is to eventually arrive at one of them; and (b) parity objectives, which are a canonical representation for ω-regular objectives. The qualitative analysis problem asks whether the objective can be ensured with probability 1. In this work, we study the qualitative problem for reachability and parity objectives on RMDPs without making any assumption over the structures of the RMDPs, e.g., unichain or aperiodic. Our contributions are twofold. We first present efficient algorithms with oracle access to uncertainty sets that solve qualitative problems of reachability and parity objectives. We then report experimental results demonstrating the effectiveness of our oracle-based approach on classical RMDP examples from the literature scaling up to thousands of states.","lang":"eng"}],"type":"conference","oa_version":"Preprint"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2511.13134"}],"arxiv":1,"fulldoi":"https://doi.org/10.1609/aaai.v40i43.40932","article_processing_charge":"No","conference":{"location":"Singapore, Singapore","name":"AAAI: Conference on Artificial Intelligence","start_date":"2026-01-20","end_date":"2026-01-27"},"date_published":"2026-03-14T00:00:00Z","intvolume":"        40","publication_status":"published","year":"2026","quality_controlled":"1","doi":"10.1609/aaai.v40i43.40932","volume":40,"publisher":"Association for the Advancement of Artificial Intelligence","month":"03","department":[{"_id":"KrCh"}],"external_id":{"arxiv":["2511.13134"]},"corr_author":"1","oa":1,"day":"14","date_updated":"2026-09-16T07:28:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Asadi, A., Chatterjee, K., Lurie, D., &#38; Saona Urmeneta, R. J. (2026). Revealing POMDPs: Qualitative and quantitative analysis for parity objectives. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 40, pp. 36146–36154). Singapore, Singapore: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v40i43.40932\">https://doi.org/10.1609/aaai.v40i43.40932</a>","chicago":"Asadi, Ali, Krishnendu Chatterjee, David Lurie, and Raimundo J Saona Urmeneta. “Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 40:36146–54. Association for the Advancement of Artificial Intelligence, 2026. <a href=\"https://doi.org/10.1609/aaai.v40i43.40932\">https://doi.org/10.1609/aaai.v40i43.40932</a>.","ista":"Asadi A, Chatterjee K, Lurie D, Saona Urmeneta RJ. 2026. Revealing POMDPs: Qualitative and quantitative analysis for parity objectives. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 40, 36146–36154.","short":"A. Asadi, K. Chatterjee, D. Lurie, R.J. Saona Urmeneta, in:, Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2026, pp. 36146–36154.","ieee":"A. Asadi, K. Chatterjee, D. Lurie, and R. J. Saona Urmeneta, “Revealing POMDPs: Qualitative and quantitative analysis for parity objectives,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Singapore, Singapore, 2026, vol. 40, no. 43, pp. 36146–36154.","mla":"Asadi, Ali, et al. “Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 40, no. 43, Association for the Advancement of Artificial Intelligence, 2026, pp. 36146–54, doi:<a href=\"https://doi.org/10.1609/aaai.v40i43.40932\">10.1609/aaai.v40i43.40932</a>.","ama":"Asadi A, Chatterjee K, Lurie D, Saona Urmeneta RJ. Revealing POMDPs: Qualitative and quantitative analysis for parity objectives. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 40. Association for the Advancement of Artificial Intelligence; 2026:36146-36154. doi:<a href=\"https://doi.org/10.1609/aaai.v40i43.40932\">10.1609/aaai.v40i43.40932</a>"},"page":"36146-36154","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"COE12","name":"Bilateral Artificial Intelligence (Chatterjee)","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee"}],"abstract":[{"lang":"eng","text":"Partially observable Markov decision processes (POMDPs) are a central model for uncertainty in sequential decision making. The most basic objective is the reachability objective, where a target set must be eventually visited, and the more general parity objectives can model all omega-regular specifications. For such objectives, the computational analysis problems are the following: (a) qualitative analysis that asks whether the objective can be satisfied with probability 1 (almost-sure winning) or probability arbitrarily close to 1 (limit-sure winning); and (b) quantitative analysis that asks for the approximation of the optimal probability of satisfying the objective. For general POMDPs, almost-sure analysis for reachability objectives is EXPTIME-complete, but limit-sure and quantitative analyses for reachability objectives are undecidable; almost-sure, limit-sure, and quantitative analyses for parity objectives are all undecidable. A special class of POMDPs, called revealing POMDPs, has been studied recently in several works, and for this subclass the almost-sure analysis for parity objectives was shown to be EXPTIME-complete. In this work, we show that for revealing POMDPs the limit-sure analysis for parity objectives is EXPTIME-complete, and even the quantitative analysis for parity objectives can be achieved in EXPTIME."}],"oa_version":"Preprint","type":"conference","status":"public","date_created":"2026-04-12T22:01:52Z","author":[{"id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi","first_name":"Ali","full_name":"Asadi, Ali"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"579a6c20-34cf-11f1-acbd-8c2f19cdb4da","first_name":"David","last_name":"Lurie","full_name":"Lurie, David"},{"first_name":"Raimundo J","last_name":"Saona Urmeneta","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","full_name":"Saona Urmeneta, Raimundo J","orcid":"0000-0001-5103-038X"}],"title":"Revealing POMDPs: Qualitative and quantitative analysis for parity objectives","_id":"21722","language":[{"iso":"eng"}],"OA_place":"repository","OA_type":"green","acknowledgement":"This work was partially supported by the ANRT under the French CIFRE Ph.D program in collaboration between NyxAir and Paris-Dauphine University (Contract: CIFRE N° 2022/0513), by the French Agence Nationale de la Recherche (ANR) under reference ANR-21-CE40-\r\n0020 (CONVERGENCE project), by Austrian Science Fund (FWF) 10.55776/COE12, and by the ERC CoG 863818 (ForM-SMArt) grant.","ec_funded":1,"publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"]},"scopus_import":"1","issue":"43","publication":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"acknowledgement":"We thank Rasmus Pagh, Christoph Lampert and Jalaj Upadhyay for valuable\r\ncomments on an early draft. We thank Ryan Mckenna for a fruitful discussion on the experiment\r\ndesign. We thank Antti Honkela for sharing insights on learning rate scheduling and DP.\r\nNikita P. Kalinin: Funded in part by the Austrian Science Fund (FWF) [10.55776/COE12].\r\nJoel Daniel Andersson: Funded by the European Union. Views and opinions expressed are however\r\nthose of the author(s) only and do not necessarily reflect those of the European Union or the European\r\nResearch Council Executive Agency. Neither the European Union nor the granting authority can be\r\nheld responsible for them. This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct,\r\nNo. 101019564). Additional funding by Providentia, a Data Science Distinguished Investigator grant\r\nfrom Novo Nordisk Fonden, with additional support from VILLUM Investigator grant 54451.\r\n","publication_identifier":{"isbn":["9783959774192"],"eissn":["1868-8969"]},"ec_funded":1,"scopus_import":"1","publication":"7th Symposium on Foundations of Responsible Computing","language":[{"iso":"eng"}],"OA_type":"gold","OA_place":"publisher","abstract":[{"lang":"eng","text":"We study differentially private model training with stochastic gradient descent under learning rate scheduling and correlated noise. Although correlated noise, in particular via matrix factorizations, has been shown to improve accuracy, prior theoretical work focused primarily on the prefix-sum workload. That workload assumes a constant learning rate, whereas in practice learning rate schedules are widely used to accelerate training and improve convergence. We close this gap by deriving general upper and lower bounds for a broad class of learning rate schedules in both single- and multi-epoch settings. Building on these results, we propose a learning-rate-aware factorization that achieves improvements over prefix-sum factorizations under both MaxSE and MeanSE error metrics. Our theoretical analysis yields memory-efficient constructions suitable for practical deployment, and experiments on CIFAR-10 and IMDB datasets confirm that schedule-aware factorizations improve accuracy in private training."}],"oa_version":"Published Version","type":"conference","status":"public","author":[{"full_name":"Kalinin, Nikita","id":"4b14526e-14d2-11ed-ba64-c14c9553d137","last_name":"Kalinin","first_name":"Nikita"},{"full_name":"Andersson, Joel D","id":"4a893819-d954-11f0-89b1-e360bad9ccc5","first_name":"Joel D","last_name":"Andersson"}],"date_created":"2026-06-28T22:01:34Z","title":"Learning rate scheduling with matrix factorization for private training","_id":"22146","date_updated":"2026-09-16T07:37:21Z","supplementarymaterial":"no","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Kalinin N, Andersson JD. 2026. Learning rate scheduling with matrix factorization for private training. 7th Symposium on Foundations of Responsible Computing. FORC: Symposium on Foundations of Responsible Computing, LIPIcs, vol. 368, 2:1-2:21.","ieee":"N. Kalinin and J. D. Andersson, “Learning rate scheduling with matrix factorization for private training,” in <i>7th Symposium on Foundations of Responsible Computing</i>, Cambridge, MA; United States, 2026, vol. 368.","short":"N. Kalinin, J.D. Andersson, in:, 7th Symposium on Foundations of Responsible Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","mla":"Kalinin, Nikita, and Joel D. Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” <i>7th Symposium on Foundations of Responsible Computing</i>, vol. 368, 2:1-2:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">10.4230/LIPIcs.FORC.2026.2</a>.","ama":"Kalinin N, Andersson JD. Learning rate scheduling with matrix factorization for private training. In: <i>7th Symposium on Foundations of Responsible Computing</i>. Vol 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">10.4230/LIPIcs.FORC.2026.2</a>","apa":"Kalinin, N., &#38; Andersson, J. D. (2026). Learning rate scheduling with matrix factorization for private training. In <i>7th Symposium on Foundations of Responsible Computing</i> (Vol. 368). Cambridge, MA; United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">https://doi.org/10.4230/LIPIcs.FORC.2026.2</a>","chicago":"Kalinin, Nikita, and Joel D Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” In <i>7th Symposium on Foundations of Responsible Computing</i>, Vol. 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">https://doi.org/10.4230/LIPIcs.FORC.2026.2</a>."},"project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"grant_number":"COE12","name":"Bilateral Artificial Intelligence (Lampert)","_id":"d8f03aaa-b035-11f1-8588-d5147fa879e0"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","month":"06","department":[{"_id":"ChLa"},{"_id":"GradSch"},{"_id":"MoHe"}],"external_id":{"arxiv":["2511.17994"]},"corr_author":"1","oa":1,"day":"01","doi":"10.4230/LIPIcs.FORC.2026.2","researchdata_availability":"no","file":[{"file_size":1231914,"file_name":"2026_LIPIcsFORC_Kalinin.pdf","content_type":"application/pdf","date_updated":"2026-06-29T06:55:23Z","file_id":"22149","creator":"dernst","relation":"main_file","access_level":"open_access","date_created":"2026-06-29T06:55:23Z","checksum":"c661f016d3861a1c1b590b87a744d087","success":1}],"volume":368,"article_number":"2:1-2:21","intvolume":"       368","publication_status":"published","year":"2026","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"],"arxiv":1,"das_tickbox":"0","fulldoi":"https://doi.org/10.4230/LIPIcs.FORC.2026.2","article_processing_charge":"No","keyword":["differential privacy","machine learning","matrix factorization"],"conference":{"name":"FORC: Symposium on Foundations of Responsible Computing","end_date":"2026-06-05","start_date":"2026-06-03","location":"Cambridge, MA; United States"},"has_accepted_license":"1","date_published":"2026-06-01T00:00:00Z","file_date_updated":"2026-06-29T06:55:23Z","alternative_title":["LIPIcs"]},{"month":"06","department":[{"_id":"KrCh"}],"publisher":"ACM","external_id":{"arxiv":["2603.26215"]},"oa":1,"corr_author":"1","dataavailabilitystatement":"The artifact supporting the findings of this study, which includes the underlying datasets, software\r\ncode, and experiments, is publicly available in Zenodo https://zenodo.org/records/19399862.","day":"08","file":[{"file_name":"2026_ProcACMProgrammingLanguages_Chatterjee.pdf","date_updated":"2026-06-24T06:19:56Z","content_type":"application/pdf","file_size":858595,"file_id":"22135","access_level":"open_access","relation":"main_file","creator":"dernst","success":1,"date_created":"2026-06-24T06:19:56Z","checksum":"994bf21d6269dabccf1e1091e02962c5"}],"doi":"10.1145/3808296","researchdata_availability":"yes","volume":10,"article_number":"218","intvolume":"        10","year":"2026","quality_controlled":"1","publication_status":"published","ddc":["000"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"arxiv":1,"fulldoi":"https://doi.org/10.1145/3808296","das_tickbox":"1","keyword":["Static Program Analysis","Differential Privacy","Probabilistic Programming","Martingales"],"article_processing_charge":"Yes","file_date_updated":"2026-06-24T06:19:56Z","date_published":"2026-06-08T00:00:00Z","has_accepted_license":"1","publication_identifier":{"eissn":["2475-1421"]},"acknowledgement":"The authors would like to thank Petr Novotný for valuable discussions that helped shape this work.\r\nThis research was supported by the Singapore Ministry of Education (MOE) Academic Research\r\nFund (AcRF) Tier 1 grant (Proposal ID: 25-SIS-SMU-009), Vienna Science and Technology Fund\r\n(WWTF), State of Lower Austria [Grant ID 10.47379/ICT25017], ERC CoG 863818 (ForM-SMArt),\r\nand Austrian Science Fund (FWF) 10.55776/COE12.","ec_funded":1,"issue":"PLDI","scopus_import":"1","publication":"Proceedings of the ACM on Programming Languages","language":[{"iso":"eng"}],"OA_type":"gold","OA_place":"publisher","abstract":[{"lang":"eng","text":"Differential privacy (DP) has established itself as one of the standards for ensuring privacy of individual data. However, reasoning about DP is a challenging and error-prone task, hence methods for formal verification and refutation of DP properties have received significant interest in recent years. In this work, we present a novel method for automated formal refutation of є-DP. Our method refutes є-DP by searching for a pair of inputs together with a non-negative function over outputs whose expected value on these two inputs differs by a significant amount. The two inputs and the non-negative function over outputs are computed simultaneously, by utilizing upper expectation supermartingales and lower expectation submartingales from probabilistic program analysis, which we leverage to introduce a sound and complete proof rule for є-DP refutation. To the best of our knowledge, our method is the first method for є-DP refutation to offer the following four desirable features: (1) it is fully automated, (2) it is applicable to stochastic mechanisms with sampling instructions from both discrete and continuous distributions, (3) it provides soundness guarantees, and (4) it provides semi-completeness guarantees. Our experiments show that our prototype tool SuperDP achieves superior performance compared to the state of the art and manages to refute є-DP for a number of challenging examples collected from the literature, including ones that were out of the reach of prior methods."}],"article_type":"original","type":"journal_article","oa_version":"Published Version","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Kafshdar Goharshadi","first_name":"Ehsan","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","orcid":"0000-0002-8595-0587","full_name":"Kafshdar Goharshadi, Ehsan"},{"last_name":"Zikelic","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde"}],"status":"public","date_created":"2026-06-21T22:02:59Z","_id":"22102","title":"SuperDP: Differential privacy refutation via supermartingales","PlanS_conform":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-09-16T07:36:14Z","supplementarymaterial":"no","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"Bilateral Artificial Intelligence (Chatterjee)","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","grant_number":"COE12"}],"citation":{"apa":"Chatterjee, K., Goharshady, E., &#38; Zikelic, D. (2026). SuperDP: Differential privacy refutation via supermartingales. <i>Proceedings of the ACM on Programming Languages</i>. ACM. <a href=\"https://doi.org/10.1145/3808296\">https://doi.org/10.1145/3808296</a>","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, and Dorde Zikelic. “SuperDP: Differential Privacy Refutation via Supermartingales.” <i>Proceedings of the ACM on Programming Languages</i>. ACM, 2026. <a href=\"https://doi.org/10.1145/3808296\">https://doi.org/10.1145/3808296</a>.","ieee":"K. Chatterjee, E. Goharshady, and D. Zikelic, “SuperDP: Differential privacy refutation via supermartingales,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 10, no. PLDI. ACM, 2026.","short":"K. Chatterjee, E. Goharshady, D. Zikelic, Proceedings of the ACM on Programming Languages 10 (2026).","ista":"Chatterjee K, Goharshady E, Zikelic D. 2026. SuperDP: Differential privacy refutation via supermartingales. Proceedings of the ACM on Programming Languages. 10(PLDI), 218.","ama":"Chatterjee K, Goharshady E, Zikelic D. SuperDP: Differential privacy refutation via supermartingales. <i>Proceedings of the ACM on Programming Languages</i>. 2026;10(PLDI). doi:<a href=\"https://doi.org/10.1145/3808296\">10.1145/3808296</a>","mla":"Chatterjee, Krishnendu, et al. “SuperDP: Differential Privacy Refutation via Supermartingales.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 10, no. PLDI, 218, ACM, 2026, doi:<a href=\"https://doi.org/10.1145/3808296\">10.1145/3808296</a>."},"related_material":{"record":[{"status":"public","id":"22134","relation":"research_data"}]}},{"dataavailabilitystatement":"Correspondence and requests for materials should be addressed to Krishnendu Chatterjee.","day":"01","corr_author":"1","oa":1,"external_id":{"pmid":["41997932"]},"month":"12","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","article_number":"5325","volume":17,"file":[{"file_id":"22136","file_name":"2026_NatureComm_Svoboda.pdf","content_type":"application/pdf","date_updated":"2026-06-24T06:50:24Z","file_size":1068919,"success":1,"date_created":"2026-06-24T06:50:24Z","checksum":"b660048bb271f24d6763803e247d5c32","access_level":"open_access","creator":"dernst","relation":"main_file"}],"doi":"10.1038/s41467-026-71777-2","researchdata_availability":"no","ddc":["000"],"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"quality_controlled":"1","pmid":1,"year":"2026","publication_status":"published","intvolume":"        17","file_date_updated":"2026-06-24T06:50:24Z","date_published":"2026-12-01T00:00:00Z","has_accepted_license":"1","article_processing_charge":"Yes","fulldoi":"https://doi.org/10.1038/s41467-026-71777-2","das_tickbox":"1","publication":"Nature Communications","scopus_import":"1","ec_funded":1,"publication_identifier":{"eissn":["2041-1723"]},"acknowledgement":"J.S. and K.C. were supported by the European Research Council (ERC)\r\nCoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/\r\nCOE12. J.T. was supported by GAČR grant 25-17377S and by Charles\r\nUniv. projects UNCE 24/SCI/008 and PRIMUS 24/SCI/012.","OA_place":"publisher","OA_type":"gold","language":[{"iso":"eng"}],"_id":"22101","title":"The effect of the fitness gradient on fixation probability","author":[{"full_name":"Svoboda, Jakub","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","last_name":"Svoboda"},{"full_name":"Nemati, Hossein","first_name":"Hossein","last_name":"Nemati"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec"},{"full_name":"Kaveh, Kamran","first_name":"Kamran","last_name":"Kaveh"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}],"status":"public","date_created":"2026-06-21T22:02:59Z","article_type":"original","oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Evolutionary biology examines how the genetic and phenotypic composition\r\nof populations changes over time. An important goal is to determine the\r\nfixation probability of a single advantageous mutant that arises in a homogeneous\r\npopulation of N residents. Many real populations experience environmental\r\ngradients that cause mutations to be beneficial in some spatial\r\nregions but harmful in others. Here, we study the fixation probability of a\r\nmutant placed on a simple one-dimensional spatial structure that experiences\r\nsuch a gradient. The mutant’s fitness varies linearly from1 − s to 1 + s, whereas\r\nthe resident fitness is constant and equal to 1. The existing literature suggests\r\nthat such heterogeneity in the mutant’s fitness should lead to a decrease in its\r\nfixation probability. However, in this work, we find that small, non-negligible\r\ngradients (s < 1=√N) substantially increase the fixation probability,while larger\r\ngradients (s > (log N)/√N) substantially decrease it.Moreover, we quantify the\r\nstrength of this phenomenon analytically and we precisely delimit the range of\r\nthe gradients for which it occurs. Our computer simulations closely match\r\nthose findings. Altogether, our results indicate that subjecting a simple\r\npopulation structure to natural environmental conditions can produce strong\r\ncounterintuitive effects."}],"project":[{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"COE12","name":"Bilateral Artificial Intelligence (Chatterjee)","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee"}],"DOAJ_listed":"1","citation":{"mla":"Svoboda, Jakub, et al. “The Effect of the Fitness Gradient on Fixation Probability.” <i>Nature Communications</i>, vol. 17, 5325, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-71777-2\">10.1038/s41467-026-71777-2</a>.","ama":"Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. The effect of the fitness gradient on fixation probability. <i>Nature Communications</i>. 2026;17. doi:<a href=\"https://doi.org/10.1038/s41467-026-71777-2\">10.1038/s41467-026-71777-2</a>","short":"J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, K. Chatterjee, Nature Communications 17 (2026).","ista":"Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. 2026. The effect of the fitness gradient on fixation probability. Nature Communications. 17, 5325.","ieee":"J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, and K. Chatterjee, “The effect of the fitness gradient on fixation probability,” <i>Nature Communications</i>, vol. 17. Springer Nature, 2026.","chicago":"Svoboda, Jakub, Hossein Nemati, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “The Effect of the Fitness Gradient on Fixation Probability.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-71777-2\">https://doi.org/10.1038/s41467-026-71777-2</a>.","apa":"Svoboda, J., Nemati, H., Tkadlec, J., Kaveh, K., &#38; Chatterjee, K. (2026). The effect of the fitness gradient on fixation probability. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-71777-2\">https://doi.org/10.1038/s41467-026-71777-2</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","supplementarymaterial":"yes","date_updated":"2026-09-16T07:36:49Z"},{"doi":"10.1016/j.gde.2026.102487","volume":99,"article_number":"102487","department":[{"_id":"SiHi"}],"month":"05","publisher":"Elsevier","external_id":{"pmid":["42214837"]},"corr_author":"1","oa":1,"day":"29","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.gde.2026.102487"}],"fulldoi":"https://doi.org/10.1016/j.gde.2026.102487","article_processing_charge":"Yes (via OA deal)","date_published":"2026-05-29T00:00:00Z","has_accepted_license":"1","intvolume":"        99","pmid":1,"quality_controlled":"1","year":"2026","publication_status":"epub_ahead","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["570"],"language":[{"iso":"eng"}],"OA_place":"publisher","OA_type":"hybrid","publication_identifier":{"eissn":["1879-0380"],"issn":["0959-437X"]},"acknowledgement":"We wish to thank all members of the Hippenmeyer laboratory at ISTA for exciting discussions on the subject of this review. We apologize to colleagues whose work we could not cite and/or discuss in the frame of the available space. Work in the Hippenmeyer laboratory on the discussed topic is supported by ISTA institutional funds, an EMBO LTF (ALTF 994–2023) to F.P., FWF SFB F78 (10.55776/F78) to S.H., and FWF Cluster of Excellence COE16 (10.55776/COE16) to S.H.","scopus_import":"1","publication":"Current Opinion in Genetics & Development","PlanS_conform":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-09-16T07:34:44Z","project":[{"name":"Role of cell lineage in generating cell-type diversity in developing neocortex’","_id":"7c084566-9f16-11ee-852c-c88a1dbbf1cf","grant_number":"ALTF 994-2023"},{"_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E","name":"Stem Cell Modulation in Neural Development and Regeneration/ P05-Molecular Mechanisms of Neural Stem Cell Lineage Progression","grant_number":"F7805"},{"grant_number":"COE16","_id":"9e227eae-b037-11f1-b1e2-fb7da760c1dd","name":"Neuronal circuits in health and disease (Hippenmeyer)"}],"citation":{"apa":"Varela Martínez, I., Pipicelli, F., &#38; Hippenmeyer, S. (2026). Tracing cell lineages in the developing brain: Insights from mosaic analysis and clone-resolved transcriptomics. <i>Current Opinion in Genetics &#38; Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.gde.2026.102487\">https://doi.org/10.1016/j.gde.2026.102487</a>","chicago":"Varela Martínez, Irene, Fabrizia Pipicelli, and Simon Hippenmeyer. “Tracing Cell Lineages in the Developing Brain: Insights from Mosaic Analysis and Clone-Resolved Transcriptomics.” <i>Current Opinion in Genetics &#38; Development</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.gde.2026.102487\">https://doi.org/10.1016/j.gde.2026.102487</a>.","ista":"Varela Martínez I, Pipicelli F, Hippenmeyer S. 2026. Tracing cell lineages in the developing brain: Insights from mosaic analysis and clone-resolved transcriptomics. Current Opinion in Genetics &#38; Development. 99, 102487.","ieee":"I. Varela Martínez, F. Pipicelli, and S. Hippenmeyer, “Tracing cell lineages in the developing brain: Insights from mosaic analysis and clone-resolved transcriptomics,” <i>Current Opinion in Genetics &#38; Development</i>, vol. 99. Elsevier, 2026.","short":"I. Varela Martínez, F. Pipicelli, S. Hippenmeyer, Current Opinion in Genetics &#38; Development 99 (2026).","mla":"Varela Martínez, Irene, et al. “Tracing Cell Lineages in the Developing Brain: Insights from Mosaic Analysis and Clone-Resolved Transcriptomics.” <i>Current Opinion in Genetics &#38; Development</i>, vol. 99, 102487, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.gde.2026.102487\">10.1016/j.gde.2026.102487</a>.","ama":"Varela Martínez I, Pipicelli F, Hippenmeyer S. Tracing cell lineages in the developing brain: Insights from mosaic analysis and clone-resolved transcriptomics. <i>Current Opinion in Genetics &#38; Development</i>. 2026;99. doi:<a href=\"https://doi.org/10.1016/j.gde.2026.102487\">10.1016/j.gde.2026.102487</a>"},"abstract":[{"lang":"eng","text":"The cerebral cortex comprises diverse neuron and glial cell types generated by radial glial progenitors (RGPs) during development. Although RGPs broadly differentiate according to temporally and spatially regulated molecular logics, the lineage hierarchies linking individual progenitors to defined cell (sub)types are not well understood. Clone-resolved transcriptomics, combining molecular barcoding and single-cell RNA sequencing, allow high-resolution lineage tracing at the single-clone/cell level across different species and models. In this mini-review, we synthesize recent advances in this field, uncovering unexpected lineage relationships in the developing brain, with a particular focus on the cerebral cortex. We further highlight new insights into species-specific differences in the developmental programs generating cell-type diversity, linking changes in clonal architecture to lineage diversification during cortical evolution."}],"article_type":"original","oa_version":"Published Version","type":"journal_article","date_created":"2026-06-07T22:01:35Z","status":"public","author":[{"full_name":"Varela Martínez, Irene","last_name":"Varela Martínez","first_name":"Irene","id":"a69b5985-8829-11f0-8fc2-d0af58f64471"},{"id":"649134fd-d012-11ed-8f82-db1e5050f9ba","first_name":"Fabrizia","last_name":"Pipicelli","full_name":"Pipicelli, Fabrizia"},{"orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","first_name":"Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87"}],"_id":"21948","title":"Tracing cell lineages in the developing brain: Insights from mosaic analysis and clone-resolved transcriptomics"},{"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"],"status":"public","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0002-8595-0587","full_name":"Kafshdar Goharshadi, Ehsan","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","last_name":"Kafshdar Goharshadi","first_name":"Ehsan"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2026-06-24T06:25:29Z","title":"SuperDP: Differential Privacy Refutation via Supermartingales","_id":"22134","abstract":[{"lang":"eng","text":"This artifact provides the source code, benchmarks, and scripts necessary to build and reproduce the experimental results for `SuperDP` (Accepted at PLDI 2026). It also includes instructions for running the tool on user-provided inputs."}],"oa_version":"Published Version","type":"research_data_reference","year":"2026","article_processing_charge":"No","citation":{"ama":"Chatterjee K, Goharshady E, Zikelic D. SuperDP: Differential Privacy Refutation via Supermartingales. 2026. doi:<a href=\"https://doi.org/10.5281/ZENODO.18930113\">10.5281/ZENODO.18930113</a>","mla":"Chatterjee, Krishnendu, et al. <i>SuperDP: Differential Privacy Refutation via Supermartingales</i>. Zenodo, 2026, doi:<a href=\"https://doi.org/10.5281/ZENODO.18930113\">10.5281/ZENODO.18930113</a>.","ieee":"K. Chatterjee, E. Goharshady, and D. Zikelic, “SuperDP: Differential Privacy Refutation via Supermartingales.” Zenodo, 2026.","ista":"Chatterjee K, Goharshady E, Zikelic D. 2026. SuperDP: Differential Privacy Refutation via Supermartingales, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.18930113\">10.5281/ZENODO.18930113</a>.","short":"K. Chatterjee, E. Goharshady, D. Zikelic, (2026).","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, and Dorde Zikelic. “SuperDP: Differential Privacy Refutation via Supermartingales.” Zenodo, 2026. <a href=\"https://doi.org/10.5281/ZENODO.18930113\">https://doi.org/10.5281/ZENODO.18930113</a>.","apa":"Chatterjee, K., Goharshady, E., &#38; Zikelic, D. (2026). SuperDP: Differential Privacy Refutation via Supermartingales. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.18930113\">https://doi.org/10.5281/ZENODO.18930113</a>"},"has_accepted_license":"1","related_material":{"record":[{"id":"22102","relation":"used_in_publication","status":"public"}]},"date_published":"2026-03-09T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.5281/ZENODO.18930113","open_access":"1"}],"date_updated":"2026-09-16T07:36:13Z","fulldoi":"https://doi.org/10.5281/ZENODO.18930113","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","oa":1,"day":"09","publisher":"Zenodo","month":"03","department":[{"_id":"KrCh"}],"OA_type":"green","OA_place":"repository","doi":"10.5281/ZENODO.18930113"},{"oa":1,"corr_author":"1","day":"13","dataavailabilitystatement":"The data that support the findings of this article are openly available  https://zenodo.org/records/19099731.","month":"07","department":[{"_id":"JoFi"},{"_id":"GradSch"}],"publisher":"American Physical Society","article_number":"031005","file":[{"date_created":"2026-08-04T05:40:41Z","checksum":"2bab109f975545d096c21dd72c738b6e","success":1,"creator":"dernst","relation":"main_file","access_level":"open_access","file_id":"22640","file_size":5301241,"date_updated":"2026-08-04T05:40:41Z","content_type":"application/pdf","file_name":"2026_PhysicalReviewX_AndresJuanes.pdf"}],"researchdata_availability":"yes","doi":"10.1103/r4jt-j39w","volume":16,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["530"],"intvolume":"        16","year":"2026","quality_controlled":"1","publication_status":"published","article_processing_charge":"Yes","date_published":"2026-07-13T00:00:00Z","file_date_updated":"2026-08-04T05:40:41Z","has_accepted_license":"1","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"fulldoi":"https://doi.org/10.1103/r4jt-j39w","das_tickbox":"1","issue":"3","scopus_import":"1","publication":"Physical Review X","acknowledgement":"We thank A. Trioni and C. N. Borja for assistance in device fabrication, C. Siegele for fruitful discussions, IBM for donating the JPC used in this work, and the MIBA machine shop and the ISTA nanofabrication facility for technical support. This work was funded in part by the Austrian Science Fund (FWF) through the excellence cluster quantA 10.55776/COE1 and the SFB BeyondC 10.55776/F71, as well as the European Union—NextGenerationEU, and ISTA. J. F. and L. K. acknowledge support from the Horizon Europe Program HORIZON-CL4-2022-QUANTUM-01-SGA via Project No. 101113946 OpenSuperQPlus100, and J. F. from the European Research Council No. 101089099 (ERC CoG cQEO). J. A. acknowledges support from the QUANTERA project MOLAR with reference No. PCI2024-153449, funded by MICIU/AEI/10.13039/501100011033 and the European Union. This research is part of the Munich Quantum Valley, which is supported by the Bavarian state government with funds from the Hightech Agenda Bayern Plus.","publication_identifier":{"eissn":["2160-3308"]},"OA_type":"gold","OA_place":"publisher","language":[{"iso":"eng"}],"date_created":"2026-08-03T13:19:31Z","status":"public","author":[{"full_name":"Andres Juanes, Alejandro","first_name":"Alejandro","last_name":"Andres Juanes","id":"7601fd3a-5355-11ee-ae5a-a20ca6f3cfb9"},{"full_name":"Agustí, J.","first_name":"J.","last_name":"Agustí"},{"full_name":"Sett, Riya","orcid":"0000-0001-7641-8348","first_name":"Riya","last_name":"Sett","id":"2E6D040E-F248-11E8-B48F-1D18A9856A87"},{"id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","first_name":"Elena","last_name":"Redchenko","full_name":"Redchenko, Elena"},{"full_name":"Kapoor, Lucky","orcid":"0000-0001-8319-2148","last_name":"Kapoor","first_name":"Lucky","id":"84b9700b-15b2-11ec-abd3-831089e67615"},{"last_name":"Hawaldar","first_name":"Samarth","id":"221708e1-1ff6-11ee-9fa6-85146607433e","orcid":"0000-0002-1965-4309","full_name":"Hawaldar, Samarth"},{"full_name":"Rabl, P.","first_name":"P.","last_name":"Rabl"},{"first_name":"Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M"}],"_id":"22637","title":"Distributing stationary qubit entanglement through a nonlocal squeezed reservoir","abstract":[{"lang":"eng","text":"The distribution of entanglement across distant qubits is a central challenge for the operation of scalable quantum computers and large-scale quantum networks. Existing approaches rely on deterministic state transfer, or probabilistic protocols that require active control or measurements and postselection. Here, we demonstrate a fundamentally different, fully autonomous process, where two remote qubits are entangled through their coupling to a quantum-correlated photonic reservoir. In our experiment, a Josephson parametric converter produces a Gaussian, continuous-variable entangled state of propagating microwave fields that drives two spatially separated superconducting transmon qubits into a stationary, discrete-variable entangled state. We also show how qubit tomography unlocks a direct and sensitive verification of two-mode squeezing in the microwave domain. These results establish networks of qubits interfaced with distributed continuous-variable entangled states as a powerful platform for foundational studies and quantum-technology applications."}],"article_type":"original","type":"journal_article","oa_version":"Published Version","project":[{"name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","grant_number":"F07105"},{"name":"Cavity Quantum Electro Optics: Microwave photonics with nonclassical states","_id":"bdadfa0d-d553-11ed-ba76-fb85edbd456a","grant_number":"101089099"},{"grant_number":"COE01","name":"Quantum Science Austria (Fink)","_id":"92af0f81-16d5-11f0-9cad-924b22d6a876"}],"citation":{"mla":"Andres Juanes, Alejandro, et al. “Distributing Stationary Qubit Entanglement through a Nonlocal Squeezed Reservoir.” <i>Physical Review X</i>, vol. 16, no. 3, 031005, American Physical Society, 2026, doi:<a href=\"https://doi.org/10.1103/r4jt-j39w\">10.1103/r4jt-j39w</a>.","ama":"Andres Juanes A, Agustí J, Sett R, et al. Distributing stationary qubit entanglement through a nonlocal squeezed reservoir. <i>Physical Review X</i>. 2026;16(3). doi:<a href=\"https://doi.org/10.1103/r4jt-j39w\">10.1103/r4jt-j39w</a>","ieee":"A. Andres Juanes <i>et al.</i>, “Distributing stationary qubit entanglement through a nonlocal squeezed reservoir,” <i>Physical Review X</i>, vol. 16, no. 3. American Physical Society, 2026.","short":"A. Andres Juanes, J. Agustí, R. Sett, E. Redchenko, L. Kapoor, S. Hawaldar, P. Rabl, J.M. Fink, Physical Review X 16 (2026).","ista":"Andres Juanes A, Agustí J, Sett R, Redchenko E, Kapoor L, Hawaldar S, Rabl P, Fink JM. 2026. Distributing stationary qubit entanglement through a nonlocal squeezed reservoir. Physical Review X. 16(3), 031005.","chicago":"Andres Juanes, Alejandro, J. Agustí, Riya Sett, Elena Redchenko, Lucky Kapoor, Samarth Hawaldar, P. Rabl, and Johannes M Fink. “Distributing Stationary Qubit Entanglement through a Nonlocal Squeezed Reservoir.” <i>Physical Review X</i>. American Physical Society, 2026. <a href=\"https://doi.org/10.1103/r4jt-j39w\">https://doi.org/10.1103/r4jt-j39w</a>.","apa":"Andres Juanes, A., Agustí, J., Sett, R., Redchenko, E., Kapoor, L., Hawaldar, S., … Fink, J. M. (2026). Distributing stationary qubit entanglement through a nonlocal squeezed reservoir. <i>Physical Review X</i>. American Physical Society. <a href=\"https://doi.org/10.1103/r4jt-j39w\">https://doi.org/10.1103/r4jt-j39w</a>"},"DOAJ_listed":"1","related_material":{"link":[{"description":"News on ISTA website","relation":"press_release","url":"https://ista.ac.at/en/news/quantum-bath-syncs-distant-qubits/"}]},"PlanS_conform":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-09-16T07:38:20Z","supplementarymaterial":"yes"},{"department":[{"_id":"LaVe"}],"month":"08","publisher":"Springer Nature","external_id":{"pmid":["42277037"]},"corr_author":"1","oa":1,"day":"06","dataavailabilitystatement":"The data generated in this study have been deposited in the Code Ocean capsule. The capsule contains the FHI-aims and AITRANSS output matrices used for post-processing, precomputed cache files, and optimized atomic coordinate files. These data are sufficient to reproduce the results reported in the paper. The code used to reproduce the local-current and magnetic-field analyses is available in the Code Ocean capsule. The capsule includes Python scripts for post-processing DFT output matrices and Mathematica notebooks for tight-binding calculations and reproducing visualizations.","file":[{"checksum":"3f578b67037425a7c5d21922807b23df","date_created":"2026-08-20T06:33:50Z","success":1,"relation":"main_file","creator":"dernst","access_level":"open_access","file_id":"22741","file_size":1790013,"file_name":"2026_NatureComm_Shi.pdf","content_type":"application/pdf","date_updated":"2026-08-20T06:33:50Z"}],"researchdata_availability":"yes","doi":"10.1038/s41467-026-74365-6","volume":17,"article_number":"7916","intvolume":"        17","pmid":1,"quality_controlled":"1","year":"2026","publication_status":"published","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"ddc":["530"],"fulldoi":"https://doi.org/10.1038/s41467-026-74365-6","das_tickbox":"1","article_processing_charge":"Yes","file_date_updated":"2026-08-20T06:33:50Z","date_published":"2026-08-06T00:00:00Z","has_accepted_license":"1","publication_identifier":{"eissn":["2041-1723"]},"acknowledgement":"The authors thank Jascha Repp from the University of Regensburg for helpful discussions. This paper is dedicated to the memory of Prof. Mark Ratner in appreciation of the encouragement offered many years ago, and whose influence had endured ever since. This work was supported by the National Science Foundation under grant NSF-DMR 2241180 and the Institute of Science and Technology Austria. The collaboration between L.V., R.K., and F.E. was supported by the Humboldt Foundation. This research was funded in part by the Austrian Science Fund (FWF) [10.55776/COE5] (Cluster of Excellence MECS).","scopus_import":"1","publication":"Nature Communications","language":[{"iso":"eng"}],"OA_place":"publisher","OA_type":"gold","abstract":[{"text":"When charge flows through a molecular circuit, it induces a magnetic field that allows the circuit to behave as a nanoscale electromagnet. However, in single-molecule circuits this magnetic field is usually weak. Here we show that radially π-conjugated carbon structures can support amplified circulating currents that generate local magnetic fields. Within tight-binding and density functional theory (DFT) frameworks, we first study cycloparaphenylene (CPP) junctions where both electrodes are attached to the same phenylene unit on the nanohoop. We observe an energy-dependent ring current component that traverses the whole macrocycle by mapping the local current density. Importantly, we find that destructive interference near degenerate resonances can reverse the ring current direction and amplify it strongly relative to the source–drain current. We show that this interference-driven design principle is general, and also carries over to C60 junctions. In fullerene, lower-lying degenerate resonances are more easily accessible through electrostatic gating, reaching a magnetic field of 14.2 mT under a 100 mV source–drain bias. This work thus provides new insights into ring currents in radially π-conjugated carbon structures and highlights their potential as design platforms for single-molecule electromagnets.","lang":"eng"}],"article_type":"original","oa_version":"Published Version","type":"journal_article","date_created":"2026-08-16T22:01:42Z","status":"public","author":[{"last_name":"Shi","first_name":"Wanzhuo","id":"a3010425-87c8-11f0-8106-bec32bea74da","full_name":"Shi, Wanzhuo"},{"first_name":"Richard","last_name":"Korytár","full_name":"Korytár, Richard"},{"full_name":"Evers, Ferdinand","last_name":"Evers","first_name":"Ferdinand"},{"full_name":"Tovar, John D.","first_name":"John D.","last_name":"Tovar"},{"full_name":"Venkataraman, Latha","orcid":"0000-0002-6957-6089","first_name":"Latha","last_name":"Venkataraman","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf"}],"_id":"22711","title":"Designing effective single-molecule electromagnets with radially π-conjugated carbon structures","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-09-16T07:38:44Z","supplementarymaterial":"yes","project":[{"_id":"a07c44b9-b033-11f1-8138-d55edbd80687","name":"Materials for Energy Conversion and Storage (Venkataraman)","grant_number":"COE05"}],"DOAJ_listed":"1","citation":{"mla":"Shi, Wanzhuo, et al. “Designing Effective Single-Molecule Electromagnets with Radially π-Conjugated Carbon Structures.” <i>Nature Communications</i>, vol. 17, 7916, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-74365-6\">10.1038/s41467-026-74365-6</a>.","ama":"Shi W, Korytár R, Evers F, Tovar JD, Venkataraman L. Designing effective single-molecule electromagnets with radially π-conjugated carbon structures. <i>Nature Communications</i>. 2026;17. doi:<a href=\"https://doi.org/10.1038/s41467-026-74365-6\">10.1038/s41467-026-74365-6</a>","ista":"Shi W, Korytár R, Evers F, Tovar JD, Venkataraman L. 2026. Designing effective single-molecule electromagnets with radially π-conjugated carbon structures. Nature Communications. 17, 7916.","short":"W. Shi, R. Korytár, F. Evers, J.D. Tovar, L. Venkataraman, Nature Communications 17 (2026).","ieee":"W. Shi, R. Korytár, F. Evers, J. D. Tovar, and L. Venkataraman, “Designing effective single-molecule electromagnets with radially π-conjugated carbon structures,” <i>Nature Communications</i>, vol. 17. Springer Nature, 2026.","chicago":"Shi, Wanzhuo, Richard Korytár, Ferdinand Evers, John D. Tovar, and Latha Venkataraman. “Designing Effective Single-Molecule Electromagnets with Radially π-Conjugated Carbon Structures.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-74365-6\">https://doi.org/10.1038/s41467-026-74365-6</a>.","apa":"Shi, W., Korytár, R., Evers, F., Tovar, J. D., &#38; Venkataraman, L. (2026). Designing effective single-molecule electromagnets with radially π-conjugated carbon structures. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-74365-6\">https://doi.org/10.1038/s41467-026-74365-6</a>"}},{"department":[{"_id":"GradSch"},{"_id":"PeJo"}],"month":"08","publisher":"Institute of Science and Technology Austria","doi_confirm":"1","corr_author":"1","day":"25","file":[{"date_created":"2026-08-26T10:09:48Z","checksum":"13cc7ead72aad90a134f310b531c73cd","creator":"plin","relation":"main_file","access_level":"closed","embargo_to":"open_access","file_id":"22765","file_size":6376229,"date_updated":"2026-08-26T10:09:48Z","embargo":"2027-09-01","content_type":"application/pdf","file_name":"2026_Lin_Peipeng_Thesis.pdf"},{"file_size":17681883,"date_updated":"2026-08-26T10:09:53Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"2026_Lin_Peipeng_Thesis.docx","file_id":"22766","creator":"plin","relation":"source_file","access_level":"closed","checksum":"8c9c1445a7df284377be1a8c9dadd7c5","date_created":"2026-08-26T10:09:53Z"}],"doi":"10.15479/AT-ISTA-22735","researchdata_availability":"upon request","year":"2026","publication_status":"published","ddc":["571","573"],"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"},{"_id":"Bio"}],"fulldoi":"https://doi.org/10.15479/AT-ISTA-22735","das_tickbox":"0","degree_awarded":"PhD","article_processing_charge":"No","file_date_updated":"2026-08-26T10:09:53Z","date_published":"2026-08-25T00:00:00Z","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","publication_identifier":{"isbn":["978-3-99078-088-6"],"issn":["2663-337X"]},"ec_funded":1,"acknowledgement":"This project was supported by the following funding agencies: ERC under the European\r\nUnion's Horizon 2020 research and innovation program (ERC Advanced Grants No 692692\r\n“GIANTSYN” and 101199096 “CA3-SYNGRAM” to P.J.), the Fonds zur Förderung der\r\nwissenschaftlichen Forschung (P 36232-B, stand-alone grant, PAT 4178023, principal\r\ninvestigator project, and 10.55776/CoE 16 “GABA neurons” to P.J.), and the European Union’s\r\nHorizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant\r\nagreement (No 101034413, to K.L.).","language":[{"iso":"eng"}],"OA_place":"publisher","supervisor":[{"last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"}],"type":"dissertation","oa_version":"Published Version","status":"public","author":[{"full_name":"Lin, Peipeng","last_name":"Lin","first_name":"Peipeng","id":"7E3060D0-A92C-11E9-A326-26C8E5697425"}],"date_created":"2026-08-18T15:23:41Z","_id":"22735","title":"Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-09-16T07:39:42Z","supplementarymaterial":"yes","project":[{"grant_number":"692692","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","call_identifier":"H2020"},{"grant_number":"101199096","_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b","name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits"},{"grant_number":"P36232","_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5","name":"Mechanisms of GABA release in hippocampal circuits"},{"grant_number":"PAT 4178023","name":"Synaptic networks of human brain","_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e"},{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"},{"grant_number":"COE16","_id":"0a6c8641-b036-11f1-bacf-e4eec62b5bb4","name":"Neuronal circuits in health and disease (Jonas)"}],"page":"88","citation":{"chicago":"Lin, Peipeng. “Calibrating the Teacher Synapse: Mechanisms and Functional Significance of Presynaptic Inhibition at Hippocampal Mossy Fiber Synapses.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22735\">https://doi.org/10.15479/AT-ISTA-22735</a>.","apa":"Lin, P. (2026). <i>Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22735\">https://doi.org/10.15479/AT-ISTA-22735</a>","mla":"Lin, Peipeng. <i>Calibrating the Teacher Synapse: Mechanisms and Functional Significance of Presynaptic Inhibition at Hippocampal Mossy Fiber Synapses</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22735\">10.15479/AT-ISTA-22735</a>.","ama":"Lin P. Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22735\">10.15479/AT-ISTA-22735</a>","ista":"Lin P. 2026. Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses. Institute of Science and Technology Austria.","short":"P. Lin, Calibrating the Teacher Synapse: Mechanisms and Functional Significance of Presynaptic Inhibition at Hippocampal Mossy Fiber Synapses, Institute of Science and Technology Austria, 2026.","ieee":"P. Lin, “Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses,” Institute of Science and Technology Austria, 2026."}},{"citation":{"chicago":"De Berg, Sarita, Nynne Maria Foldager Bække, Frida Astrup Eriksen, Ivor Van Der Hoog, Eva Rotenberg, and Daniel P Rutschmann. “Instance Optimal and Universally Optimal Bounds for Imprecise Pareto Fronts.” In <i>34th Annual European Symposium on Algorithms</i>, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.106\">https://doi.org/10.4230/LIPIcs.ESA.2026.106</a>.","apa":"De Berg, S., Bække, N. M. F., Eriksen, F. A., Van Der Hoog, I., Rotenberg, E., &#38; Rutschmann, D. P. (2026). Instance optimal and universally optimal bounds for imprecise pareto fronts. In <i>34th Annual European Symposium on Algorithms</i> (Vol. 388). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.106\">https://doi.org/10.4230/LIPIcs.ESA.2026.106</a>","mla":"De Berg, Sarita, et al. “Instance Optimal and Universally Optimal Bounds for Imprecise Pareto Fronts.” <i>34th Annual European Symposium on Algorithms</i>, vol. 388, 106, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.106\">10.4230/LIPIcs.ESA.2026.106</a>.","ama":"De Berg S, Bække NMF, Eriksen FA, Van Der Hoog I, Rotenberg E, Rutschmann DP. Instance optimal and universally optimal bounds for imprecise pareto fronts. In: <i>34th Annual European Symposium on Algorithms</i>. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.106\">10.4230/LIPIcs.ESA.2026.106</a>","ieee":"S. De Berg, N. M. F. Bække, F. A. Eriksen, I. Van Der Hoog, E. Rotenberg, and D. P. Rutschmann, “Instance optimal and universally optimal bounds for imprecise pareto fronts,” in <i>34th Annual European Symposium on Algorithms</i>, L’Aquila, Italy, 2026, vol. 388.","short":"S. De Berg, N.M.F. Bække, F.A. Eriksen, I. Van Der Hoog, E. Rotenberg, D.P. Rutschmann, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","ista":"De Berg S, Bække NMF, Eriksen FA, Van Der Hoog I, Rotenberg E, Rutschmann DP. 2026. Instance optimal and universally optimal bounds for imprecise pareto fronts. 34th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 388, 106."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","supplementarymaterial":"no","date_updated":"2026-09-16T08:59:49Z","_id":"22916","title":"Instance optimal and universally optimal bounds for imprecise pareto fronts","author":[{"first_name":"Sarita","last_name":"De Berg","full_name":"De Berg, Sarita"},{"full_name":"Bække, Nynne Maria Foldager","last_name":"Bække","first_name":"Nynne Maria Foldager"},{"last_name":"Eriksen","first_name":"Frida Astrup","full_name":"Eriksen, Frida Astrup"},{"full_name":"Van Der Hoog, Ivor","last_name":"Van Der Hoog","first_name":"Ivor"},{"last_name":"Rotenberg","first_name":"Eva","full_name":"Rotenberg, Eva"},{"last_name":"Rutschmann","first_name":"Daniel P","id":"7397d908-b582-11f0-bf73-88b902e86527","full_name":"Rutschmann, Daniel P"}],"date_created":"2026-09-13T22:01:52Z","status":"public","type":"conference","oa_version":"Published Version","abstract":[{"text":"In the imprecise geometry model, the input is a family of regions F = (R₁, R₂, …,R_n), each containing a point p_i ∈ R_i. The task is then to compute some function of the points p₁,p₂,… p_n, in our case an implicit representation of their Pareto front. To this end, one may query a region R_i to retrieve its contained point p_i ∈ R_i. In this model, efficiency is interpreted in two ways: minimizing (i) the number of retrievals, and (ii) the computation time both for preprocessing, and the execution of the query stage, i.e. for computing which points to query and constructing the output. \r\nWe present an algorithm to construct (an implicit representation of) the Pareto front for possibly overlapping rectangles, that is instance-optimal with respect to the number of retrievals. This means that for every fixed input (F, P), there is no algorithm that retrieves asymptotically fewer regions to compute the output. This is a strong algorithmic quality, as it means that our algorithm is competitive even to clairvoyant algorithms which only have to verify the correctness of a correct guess. In terms of algorithmic running time, instance-optimality is provably unobtainable. We instead present an algorithm which is within a log n-factor of instance optimality. This generalizes earlier results which assumed the regions to not overlap, at only a minor cost in running time. \r\nFor unit squares, we present an algorithm that is not only instance optimal in the number of retrievals, but also universally optimal in terms of running time. This means that for any fixed set of regions F, no algorithm has a better worst-case running time for all possible point sets P. Thus, this work presents the first universally optimal algorithm for overlapping planar input. Compared to previous work, our result improves the degree to which the input regions may overlap, the preprocessing time, the number of retrievals, and the running time.","lang":"eng"}],"OA_place":"publisher","OA_type":"gold","language":[{"iso":"eng"}],"publication":"34th Annual European Symposium on Algorithms","scopus_import":"1","publication_identifier":{"isbn":["9783959774451"],"issn":["1868-8969"]},"acknowledgement":"This work was supported by the the VILLUM Foundation grant (VIL37507) \"Efficient Recomputations for Changeful Problems\".","date_published":"2026-08-25T00:00:00Z","alternative_title":["LIPIcs"],"file_date_updated":"2026-09-16T08:58:04Z","conference":{"location":"L’Aquila, Italy","name":"ESA: European Symposium on Algorithms","start_date":"2026-08-31","end_date":"2026-09-04"},"has_accepted_license":"1","keyword":["Pareto front","imprecise geometry","instance optimality","universal optimality","preprocessing model","partial information"],"article_processing_charge":"Yes","fulldoi":"https://doi.org/10.4230/LIPIcs.ESA.2026.106","das_tickbox":"0","arxiv":1,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"],"year":"2026","quality_controlled":"1","publication_status":"published","intvolume":"       388","article_number":"106","volume":388,"file":[{"file_id":"22935","file_size":1102214,"content_type":"application/pdf","date_updated":"2026-09-16T08:58:04Z","file_name":"2026_LIPIcsESA_deBerg.pdf","date_created":"2026-09-16T08:58:04Z","checksum":"75cfae9e9773be4b06f9aab66041f0f3","success":1,"relation":"main_file","creator":"dernst","access_level":"open_access"}],"researchdata_availability":"no","doi":"10.4230/LIPIcs.ESA.2026.106","day":"25","corr_author":"1","oa":1,"external_id":{"arxiv":["2605.07523"]},"month":"08","department":[{"_id":"MoHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"department":[{"_id":"YlGo"}],"month":"04","publisher":"EDP Sciences","external_id":{"arxiv":["2601.14403"]},"oa":1,"dataavailabilitystatement":"The newly calculated PoWR model spectra for the Be star and\r\nthe companion will be provided as supplementary material on\r\nZenodo. The HST UV spectra used in this work are publicly\r\naccessible and can be obtained from MAST. Optical TRES and\r\nHIRES spectra are available at the CDS via https://cdsarc.\r\ncds.unistra.fr/viz-bin/cat/J/A+A/708/A187","day":"01","file":[{"creator":"dernst","relation":"main_file","access_level":"open_access","checksum":"58213b981fe02219f3c9b77ad76abd8e","date_created":"2026-09-09T13:08:37Z","success":1,"file_size":5726333,"file_name":"2026_AstronomyAstrophysics_MuellerHorn.pdf","date_updated":"2026-09-09T13:08:37Z","content_type":"application/pdf","file_id":"22891"}],"researchdata_availability":"no","doi":"10.1051/0004-6361/202557960","volume":708,"article_number":"A187","intvolume":"       708","year":"2026","quality_controlled":"1","publication_status":"published","ddc":["520"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"arxiv":1,"fulldoi":"https://doi.org/10.1051/0004-6361/202557960","das_tickbox":"1","article_processing_charge":"No","date_published":"2026-04-01T00:00:00Z","file_date_updated":"2026-09-09T13:08:37Z","has_accepted_license":"1","acknowledgement":"Open access funding provided by Max Planck Society. The authors sincerely thank the anonymous referee for\r\ntheir thorough review and thoughtful and constructive comments. The authors\r\nthank Howard Isaacson and Andrew W. Howard for their help in obtaining five HIRES optical spectra, which were used in the orbital analysis, and\r\nKevin Burdge and Charlie Conroy for their help in obtaining the HST spectra. J. Müller-Horn thanks Hans-Walter Rix, Sahar Shahaf, Pablo Marchant,\r\nAnnachiara Picco, Anna F. Pala, and Dominic Bowman for helpful discussions and suggestions. J. Müller-Horn acknowledges support from the European\r\nResearch Council for the ERC Advanced Grant [101054731]. V. Ramachandran and A.A.C. Sander are supported by the German Deutsche Forschungsgemeinschaft, DFG in the form of an Emmy Noether Research Group –\r\nProject-ID 445674056 (SA4064/1-1, PI Sander) and acknowledge financial\r\nsupport by the Federal Ministry for Economic Affairs and Energy (BMWE)\r\nvia the Deutsches Zentrum für Luft- und Raumfahrt (DLR) grant 50 OR\r\n2509 (PI Sander). V. Ramachandran, A.A.C. Sander, and E.C. Schösser further acknowledge financial support by the BMWE via the DLR grant 50 OR\r\n2306 (PI Ramachandran/Sander). This project was co-funded by the European Union (Project 101183150 – OCEANS). This work has made use of\r\ndata from the European Space Agency (ESA) mission Gaia (https://www.\r\ncosmos.esa.int/gaia), processed by the Gaia Data Processing and Analysis Consortium (DPAC, https://www.cosmos.esa.int/web/gaia/dpac/\r\nconsortium). Funding for the DPAC has been provided by national institutions,\r\nin particular the institutions participating in the Gaia Multilateral Agreement.\r\nTS acknowledges support from the Israel Science Foundation (ISF) under grant\r\nnumber 0603225041 and from the European Research Council (ERC) under the\r\nEuropean Union’s Horizon 2020 research and innovation program (grant agreement 101164755/METAL).","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"scopus_import":"1","publication":"Astronomy & Astrophysics","language":[{"iso":"eng"}],"OA_place":"publisher","OA_type":"diamond","abstract":[{"lang":"eng","text":"The Galactic Be star binary MWC 656 was long considered the only known Be star+black hole (BH) system, making it a critical\r\nbenchmark for models of massive binary evolution and for the expected X-ray emission of Be+BH binaries. However, recent dynamical measurements cast doubt on the presence of a BH companion. We present new multi-epoch ultraviolet spectroscopy from the\r\nHubble Space Telescope, combined with high-resolution optical spectra, to reassess the nature of the companion. The far-ultraviolet\r\nspectra reveal high-ionisation features – including prominent N v and He ii lines – which are absent in the spectra of normal Be stars\r\nand are indicative of a hot, luminous companion. Spectral modelling shows that these features cannot originate from the Be star or\r\nfrom an accretion disc around a compact object. Instead, we find that the data are best explained by a hot (Teff ≈ 85 kK), compact,\r\nhydrogen-deficient star with strong wind signatures, consistent with an intermediate-mass stripped star. Our revised orbital solution\r\nand composite spectroscopic modelling yield a companion mass of M2 = 1.48+0.55\r\n−0.46 M\f, definitively ruling out a BH and disfavouring a\r\nwhite dwarf. MWC 656 thus joins the growing class of Be + stripped star binaries. The system’s unusual properties – including a high\r\ncompanion temperature and wind strength – extend the known parameter space of such binaries. The continued absence of confirmed\r\nOBe+BH binaries in the Galaxy highlights a growing tension with population synthesis models."}],"article_type":"original","oa_version":"Published Version","type":"journal_article","author":[{"first_name":"Johanna","last_name":"Müller-Horn","full_name":"Müller-Horn, Johanna"},{"full_name":"Ramachandran, Varsha","first_name":"Varsha","last_name":"Ramachandran"},{"last_name":"El-Badry","first_name":"Kareem","full_name":"El-Badry, Kareem"},{"first_name":"Andreas A.C.","last_name":"Sander","full_name":"Sander, Andreas A.C."},{"id":"48162413-c59a-11ee-a1af-dbba36c8a756","first_name":"Julia K","last_name":"Bodensteiner","full_name":"Bodensteiner, Julia K"},{"last_name":"Gies","first_name":"Douglas R.","full_name":"Gies, Douglas R."},{"full_name":"Götberg, Ylva Louise Linsdotter","orcid":"0000-0002-6960-6911","last_name":"Götberg","first_name":"Ylva Louise Linsdotter","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d"},{"full_name":"Rivinius, Thomas","first_name":"Thomas","last_name":"Rivinius"},{"first_name":"Tomer","last_name":"Shenar","full_name":"Shenar, Tomer"},{"full_name":"Schösser, Elisa C.","first_name":"Elisa C.","last_name":"Schösser"},{"last_name":"Wang","first_name":"Luqian","full_name":"Wang, Luqian"},{"full_name":"Bieryla, Allyson","last_name":"Bieryla","first_name":"Allyson"},{"first_name":"Lars A.","last_name":"Buchhave","full_name":"Buchhave, Lars A."},{"last_name":"Latham","first_name":"David W.","full_name":"Latham, David W."}],"status":"public","date_created":"2026-09-06T22:01:57Z","_id":"22816","title":"Ultraviolet spectroscopy reveals a hot and luminous companion to the Be star+black hole candidate MWC 656","PlanS_conform":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-09-16T08:56:14Z","supplementarymaterial":"yes","citation":{"ama":"Müller-Horn J, Ramachandran V, El-Badry K, et al. Ultraviolet spectroscopy reveals a hot and luminous companion to the Be star+black hole candidate MWC 656. <i>Astronomy &#38; Astrophysics</i>. 2026;708. doi:<a href=\"https://doi.org/10.1051/0004-6361/202557960\">10.1051/0004-6361/202557960</a>","mla":"Müller-Horn, Johanna, et al. “Ultraviolet Spectroscopy Reveals a Hot and Luminous Companion to the Be Star+black Hole Candidate MWC 656.” <i>Astronomy &#38; Astrophysics</i>, vol. 708, A187, EDP Sciences, 2026, doi:<a href=\"https://doi.org/10.1051/0004-6361/202557960\">10.1051/0004-6361/202557960</a>.","short":"J. Müller-Horn, V. Ramachandran, K. El-Badry, A.A.C. Sander, J.K. Bodensteiner, D.R. Gies, Y.L.L. Götberg, T. Rivinius, T. Shenar, E.C. Schösser, L. Wang, A. Bieryla, L.A. Buchhave, D.W. Latham, Astronomy &#38; Astrophysics 708 (2026).","ista":"Müller-Horn J, Ramachandran V, El-Badry K, Sander AAC, Bodensteiner JK, Gies DR, Götberg YLL, Rivinius T, Shenar T, Schösser EC, Wang L, Bieryla A, Buchhave LA, Latham DW. 2026. Ultraviolet spectroscopy reveals a hot and luminous companion to the Be star+black hole candidate MWC 656. Astronomy &#38; Astrophysics. 708, A187.","ieee":"J. Müller-Horn <i>et al.</i>, “Ultraviolet spectroscopy reveals a hot and luminous companion to the Be star+black hole candidate MWC 656,” <i>Astronomy &#38; Astrophysics</i>, vol. 708. EDP Sciences, 2026.","chicago":"Müller-Horn, Johanna, Varsha Ramachandran, Kareem El-Badry, Andreas A.C. Sander, Julia K Bodensteiner, Douglas R. Gies, Ylva Louise Linsdotter Götberg, et al. “Ultraviolet Spectroscopy Reveals a Hot and Luminous Companion to the Be Star+black Hole Candidate MWC 656.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2026. <a href=\"https://doi.org/10.1051/0004-6361/202557960\">https://doi.org/10.1051/0004-6361/202557960</a>.","apa":"Müller-Horn, J., Ramachandran, V., El-Badry, K., Sander, A. A. C., Bodensteiner, J. K., Gies, D. R., … Latham, D. W. (2026). Ultraviolet spectroscopy reveals a hot and luminous companion to the Be star+black hole candidate MWC 656. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202557960\">https://doi.org/10.1051/0004-6361/202557960</a>"},"DOAJ_listed":"1","related_material":{"record":[{"status":"public","relation":"research_data","id":"22933"}]}},{"oa":1,"day":"01","publisher":"EDP Sciences","department":[{"_id":"YlGo"}],"month":"03","external_id":{"arxiv":["2510.12594"]},"article_number":"A116","researchdata_availability":"no","doi":"10.1051/0004-6361/202557675","file":[{"file_id":"21455","file_name":"2026_AstronomyAstrophysics_Schootemeijer.pdf","date_updated":"2026-03-16T09:05:06Z","content_type":"application/pdf","file_size":2102107,"success":1,"date_created":"2026-03-16T09:05:06Z","checksum":"02a0cd932340207c96fdd3059490ad29","access_level":"open_access","creator":"dernst","relation":"main_file"}],"volume":707,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["520"],"intvolume":"       707","publication_status":"published","year":"2026","quality_controlled":"1","article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2026-03-16T09:05:06Z","date_published":"2026-03-01T00:00:00Z","arxiv":1,"das_tickbox":"0","fulldoi":"https://doi.org/10.1051/0004-6361/202557675","scopus_import":"1","publication":"Astronomy & Astrophysics","acknowledgement":"We thank our anonymous referee for carefully reading the manuscript and providing a constructive report with helpful feedback. This work is based in part 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 #1233. The specific observations analyzed can be accessed via DOI: 10.17909/3c1d-6182. Moreover, this research is based in part on observations made with the NASA/ESA Hubble Space Telescope obtained from the\r\nSpace Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5–26555. These observations are associated with programs #13664, GO-10915, and DD-11307. This research was supported in part by grant NSF PHY-2309135 to the Kavli Institute for Theoretical Physics (KITP). LRP acknowledges support by grants PID2019-105552RB-C41 and PID2022-137779OB-C41 funded\r\nby MCIN/AEI/10.13039/501100011033 by “ERDF A way of making Europe”. LRP acknowledges support from grant PID2022-140483NB-C22 funded by MCIN/AEI/10.13039/501100011033.","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"OA_place":"publisher","OA_type":"diamond","language":[{"iso":"eng"}],"date_created":"2026-03-15T23:01:35Z","author":[{"first_name":"Abel","last_name":"Schootemeijer","full_name":"Schootemeijer, Abel"},{"orcid":"0000-0002-6960-6911","full_name":"Götberg, Ylva Louise Linsdotter","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","last_name":"Götberg","first_name":"Ylva Louise Linsdotter"},{"full_name":"Langer, Norbert","last_name":"Langer","first_name":"Norbert"},{"full_name":"Bortolini, Giacomo","first_name":"Giacomo","last_name":"Bortolini"},{"full_name":"Hirschauer, Alec S.","first_name":"Alec S.","last_name":"Hirschauer"},{"full_name":"Patrick, Lee","last_name":"Patrick","first_name":"Lee"}],"status":"public","title":"A constant upper luminosity limit of cool supergiant stars down to the extremely low metallicity of I Zw 18","_id":"21450","abstract":[{"text":"Stellar wind mass loss of massive stars is often assumed to depend on their metallicity Z. Therefore, evolutionary models predict that massive stars in lower-Z environments are able to retain more of their hydrogen-rich layers and evolve into brighter cool supergiants (cool SGs; Teff < 7 kK). Surprisingly, in galaxies in the metallicity range 0.2 ≲ Z/Z⊙ ≲ 1.5, previous studies have not found a metallicity dependence on the upper luminosity limit Lmax of cool SGs. Here, we add four galaxies to the sample studied for this purpose with data from the Hubble Space Telescope and the James Webb Space Telescope (JWST). Observations of the extremely metal-poor dwarf galaxy I Zw 18 from JWST allow us to extend the studied metallicity range down to Z/Z⊙ ≈ 1/40. For cool SGs in all studied galaxies, including I Zw 18, we find a constant value of Lmax ≈ 105.6 L⊙, similar to literature results for 0.2 ≲ Z/Z⊙ ≲ 1.5. In I Zw 18 and the other studied galaxies, the presence of Wolf-Rayet stars has been previously inferred. Although we cannot rule out that some of them become intermediate-temperature objects, this paints a picture in which evolved stars with L > 105.6 L⊙ burn helium as hot, helium-rich stars down to extremely low metallicity. We argue that metallicity-independent late-phase mass loss would be the most likely mechanism responsible for this. Regardless of the exact stripping mechanism (winds or, for example, binary interaction), for the Early Universe our results imply a limitation on black hole masses and a contribution of stars born with M ≳ 30 M⊙ to its surprisingly strong nitrogen enrichment. We propose a scenario in which single stars at low metallicity emit sufficiently hard ionizing radiation to produce He II and C IV lines. In this scenario, late-phase metallicity-independent mass loss produces hot, helium-rich stars. Due to the well-understood metallicity dependence on the radiation-driven winds of hot stars, a window of opportunity would open below 0.2 Z⊙, where self-stripped helium-rich stars can exist without dense Wolf-Rayet winds that absorb hard ionizing radiation.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","article_type":"original","citation":{"chicago":"Schootemeijer, Abel, Ylva Louise Linsdotter Götberg, Norbert Langer, Giacomo Bortolini, Alec S. Hirschauer, and Lee Patrick. “A Constant Upper Luminosity Limit of Cool Supergiant Stars down to the Extremely Low Metallicity of I Zw 18.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2026. <a href=\"https://doi.org/10.1051/0004-6361/202557675\">https://doi.org/10.1051/0004-6361/202557675</a>.","apa":"Schootemeijer, A., Götberg, Y. L. L., Langer, N., Bortolini, G., Hirschauer, A. S., &#38; Patrick, L. (2026). A constant upper luminosity limit of cool supergiant stars down to the extremely low metallicity of I Zw 18. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202557675\">https://doi.org/10.1051/0004-6361/202557675</a>","ama":"Schootemeijer A, Götberg YLL, Langer N, Bortolini G, Hirschauer AS, Patrick L. A constant upper luminosity limit of cool supergiant stars down to the extremely low metallicity of I Zw 18. <i>Astronomy &#38; Astrophysics</i>. 2026;707. doi:<a href=\"https://doi.org/10.1051/0004-6361/202557675\">10.1051/0004-6361/202557675</a>","mla":"Schootemeijer, Abel, et al. “A Constant Upper Luminosity Limit of Cool Supergiant Stars down to the Extremely Low Metallicity of I Zw 18.” <i>Astronomy &#38; Astrophysics</i>, vol. 707, A116, EDP Sciences, 2026, doi:<a href=\"https://doi.org/10.1051/0004-6361/202557675\">10.1051/0004-6361/202557675</a>.","short":"A. Schootemeijer, Y.L.L. Götberg, N. Langer, G. Bortolini, A.S. Hirschauer, L. Patrick, Astronomy &#38; Astrophysics 707 (2026).","ista":"Schootemeijer A, Götberg YLL, Langer N, Bortolini G, Hirschauer AS, Patrick L. 2026. A constant upper luminosity limit of cool supergiant stars down to the extremely low metallicity of I Zw 18. Astronomy &#38; Astrophysics. 707, A116.","ieee":"A. Schootemeijer, Y. L. L. Götberg, N. Langer, G. Bortolini, A. S. Hirschauer, and L. Patrick, “A constant upper luminosity limit of cool supergiant stars down to the extremely low metallicity of I Zw 18,” <i>Astronomy &#38; Astrophysics</i>, vol. 707. EDP Sciences, 2026."},"DOAJ_listed":"1","PlanS_conform":"1","date_updated":"2026-09-16T08:35:19Z","supplementarymaterial":"no","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"intvolume":"      1004","year":"2026","quality_controlled":"1","publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["520"],"arxiv":1,"fulldoi":"https://doi.org/10.3847/1538-4357/ae66fd","das_tickbox":"0","article_processing_charge":"Yes","file_date_updated":"2026-06-19T09:56:29Z","date_published":"2026-06-10T00:00:00Z","has_accepted_license":"1","month":"06","department":[{"_id":"YlGo"}],"publisher":"IOP Publishing","external_id":{"arxiv":["2604.10440"]},"oa":1,"day":"10","file":[{"file_id":"22099","file_size":3386217,"file_name":"2026_AstrophysicalJour_Li.pdf","content_type":"application/pdf","date_updated":"2026-06-19T09:56:29Z","date_created":"2026-06-19T09:56:29Z","checksum":"bb76fbb51f8d2834cb79f19e7932e3bd","success":1,"creator":"dernst","relation":"main_file","access_level":"open_access"}],"researchdata_availability":"no","doi":"10.3847/1538-4357/ae66fd","volume":1004,"article_number":"31","abstract":[{"lang":"eng","text":"The massive binary common envelope (CE) phase plays a pivotal role in the formation of close black hole (BH)/neutron star binaries, yet significant uncertainties remain in our understanding of this process. In this study, we aim to constrain the massive binary CE phase by systematically reconstructing three observed BH X-ray binaries (BHXBs): GRO J1655-40, SAX J1819.3-2525, and 4U 1543-47. Through comprehensive binary evolution simulations and parametric supernova modeling, we establish lower limits for the CE efficiency parameters under different energy considerations within the standard energy formalism. Specifically, we derive minimum values for three cases: α0.5U and αU, representing CE efficiencies with half and all of the internal energy contributing to the envelope ejection, respectively, and αH, accounting for the envelope’s enthalpy. Our analysis reveals that the self-consistent formation of these three BHXBs requires CE efficiency parameters satisfying α0.5U ≳ 6.7, αU ≳ 4.2, and αH ≳ 1.7. Notably, we find no viable solutions with CE efficiency values below unity, even when considering the most extreme scenarios, in which the envelope binding energy is significantly reduced through enthalpy inclusion. Our results strongly imply that either additional energy sources are required or the formalism itself must be revised. Furthermore, we quantitatively assess the impact of BH natal kicks on our results. A key finding is that 4U 1543-47’s formation requires substantial natal kicks (≳50 km s−1), as lower kick velocities are incompatible with isolated binary evolution."}],"article_type":"original","type":"journal_article","oa_version":"Published Version","author":[{"last_name":"Li","first_name":"Zhenwei","full_name":"Li, Zhenwei"},{"full_name":"Wei, Dandan","id":"5dd129bd-0601-11ef-b325-833284687b76","first_name":"Dandan","last_name":"Wei"},{"full_name":"Jia, Shi","first_name":"Shi","last_name":"Jia"},{"first_name":"Hailiang","last_name":"Chen","full_name":"Chen, Hailiang"},{"last_name":"Ge","first_name":"Hongwei","full_name":"Ge, Hongwei"},{"full_name":"Chen, Zhuo","first_name":"Zhuo","last_name":"Chen"},{"first_name":"Yangyang","last_name":"Zhang","full_name":"Zhang, Yangyang"},{"full_name":"Chen, Xuefei","last_name":"Chen","first_name":"Xuefei"},{"last_name":"Han","first_name":"Zhanwen","full_name":"Han, Zhanwen"}],"date_created":"2026-06-14T22:01:42Z","status":"public","_id":"21997","title":"A path to constraints on common envelope ejection in massive binaries: Full evolutionary reconstruction of three Black Hole X-ray binaries","PlanS_conform":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-09-16T08:31:10Z","supplementarymaterial":"no","DOAJ_listed":"1","citation":{"short":"Z. Li, D. Wei, S. Jia, H. Chen, H. Ge, Z. Chen, Y. Zhang, X. Chen, Z. Han, The Astrophysical Journal 1004 (2026).","ieee":"Z. Li <i>et al.</i>, “A path to constraints on common envelope ejection in massive binaries: Full evolutionary reconstruction of three Black Hole X-ray binaries,” <i>The Astrophysical Journal</i>, vol. 1004, no. 1. IOP Publishing, 2026.","ista":"Li Z, Wei D, Jia S, Chen H, Ge H, Chen Z, Zhang Y, Chen X, Han Z. 2026. A path to constraints on common envelope ejection in massive binaries: Full evolutionary reconstruction of three Black Hole X-ray binaries. The Astrophysical Journal. 1004(1), 31.","ama":"Li Z, Wei D, Jia S, et al. A path to constraints on common envelope ejection in massive binaries: Full evolutionary reconstruction of three Black Hole X-ray binaries. <i>The Astrophysical Journal</i>. 2026;1004(1). doi:<a href=\"https://doi.org/10.3847/1538-4357/ae66fd\">10.3847/1538-4357/ae66fd</a>","mla":"Li, Zhenwei, et al. “A Path to Constraints on Common Envelope Ejection in Massive Binaries: Full Evolutionary Reconstruction of Three Black Hole X-Ray Binaries.” <i>The Astrophysical Journal</i>, vol. 1004, no. 1, 31, IOP Publishing, 2026, doi:<a href=\"https://doi.org/10.3847/1538-4357/ae66fd\">10.3847/1538-4357/ae66fd</a>.","apa":"Li, Z., Wei, D., Jia, S., Chen, H., Ge, H., Chen, Z., … Han, Z. (2026). A path to constraints on common envelope ejection in massive binaries: Full evolutionary reconstruction of three Black Hole X-ray binaries. <i>The Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4357/ae66fd\">https://doi.org/10.3847/1538-4357/ae66fd</a>","chicago":"Li, Zhenwei, Dandan Wei, Shi Jia, Hailiang Chen, Hongwei Ge, Zhuo Chen, Yangyang Zhang, Xuefei Chen, and Zhanwen Han. “A Path to Constraints on Common Envelope Ejection in Massive Binaries: Full Evolutionary Reconstruction of Three Black Hole X-Ray Binaries.” <i>The Astrophysical Journal</i>. IOP Publishing, 2026. <a href=\"https://doi.org/10.3847/1538-4357/ae66fd\">https://doi.org/10.3847/1538-4357/ae66fd</a>."},"publication_identifier":{"issn":["0004-637X"],"eissn":["1538-4357"]},"acknowledgement":"We deeply thank the referee for a very careful reading and constructive comments that have led to the improvement of the manuscript. The authors are grateful to Poshak Gandhi for his valuable suggestions and feedback on this work. This work is supported by the Natural Science Foundation of China (grant Nos. 12125303, 12525304, 12288102, 12473034, 12103028, 12333008, 12422305, 12090040/3, 12273105, 11703081, 11422324, 12073070, and 12173081), the CAS Project for Young Scientists in Basic Research (YSBR-148), the Strategic Priority Research Program of the Chinese Academy of Sciences (grant Nos. XDB1160303, XDB1160201, and XDB1160000), the National Key R&D Program of China (grant Nos. 2021YFA1600403 and 2021YFA1600400), the Key Research Program of Frontier Sciences of CAS (No. ZDBS-LY-7005), the “CAS Light of West China”, the Yunnan Revitalization Talent Support Program-Science & Technology Champion Project (No. 202305AB350003) and Young Talent Project, the International Centre of Supernovae (ICESUN), Yunnan Key Laboratory of Supernova Research (Nos. 202302AN360001 and 202201BC070003), Yunnan Fundamental Research Projects (No. 202401AT070139), and the Natural Science Foundation of Henan Province (No. 242300420944). X.C. acknowledges the New Cornerstone Science Foundation through the XPLORER PRIZE. The authors gratefully acknowledge the “PHOENIX Supercomputing Platform” jointly operated by the Binary Population Synthesis Group and the Stellar Astrophysics Group at Yunnan Observatories, Chinese Academy of Sciences.","issue":"1","scopus_import":"1","publication":"The Astrophysical Journal","language":[{"iso":"eng"}],"OA_place":"publisher","OA_type":"gold"},{"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"ddc":["570"],"year":"2026","pmid":1,"quality_controlled":"1","publication_status":"published","intvolume":"        17","file_date_updated":"2026-09-16T08:43:27Z","date_published":"2026-09-08T00:00:00Z","has_accepted_license":"1","article_processing_charge":"Yes","fulldoi":"https://doi.org/10.1038/s41467-026-75539-y","das_tickbox":"1","day":"08","dataavailabilitystatement":"The original RNA-seq DATA have been deposited at NCBI and are publicly available as of the date of publication under the accession numbers NCBI Bioproject Number: PRJNA1329293. All data are included in the Supplementary Information or available from the authors, as are unique reagents used in this Article. The raw numbers for charts and graphs are available in the Source Data file whenever possible Source data are provided in this paper.","oa":1,"external_id":{"pmid":["42463491"]},"month":"09","department":[{"_id":"DaSi"}],"publisher":"Springer Nature","article_number":"9582","volume":17,"file":[{"relation":"main_file","creator":"dernst","access_level":"open_access","checksum":"7a1036697767e6b948d009ff57b1e1b6","date_created":"2026-09-16T08:43:27Z","success":1,"file_size":5784038,"file_name":"2026_NatureComm_Shikara.pdf","date_updated":"2026-09-16T08:43:27Z","content_type":"application/pdf","file_id":"22934"}],"researchdata_availability":"yes","doi":"10.1038/s41467-026-75539-y","_id":"22910","title":"The minor spliceosome component U4atac regulates JAK/STAT signaling to modulate hematopoiesis and immune responses in Drosophila melanogaster","author":[{"full_name":"Shikara, Dania","first_name":"Dania","last_name":"Shikara"},{"first_name":"Eden","last_name":"Bishop","full_name":"Bishop, Eden"},{"full_name":"Barton, Nathan","first_name":"Nathan","last_name":"Barton"},{"first_name":"Stephanie","last_name":"Makdissi","full_name":"Makdissi, Stephanie"},{"full_name":"Kailasam, Senthilkumar","last_name":"Kailasam","first_name":"Senthilkumar"},{"orcid":"0000-0002-1819-198X","full_name":"György, Attila","id":"3BCEDBE0-F248-11E8-B48F-1D18A9856A87","last_name":"György","first_name":"Attila"},{"full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","first_name":"Daria E","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Maria Carla","last_name":"Borroto","full_name":"Borroto, Maria Carla"},{"first_name":"Philippe M.","last_name":"Campeau","full_name":"Campeau, Philippe M."},{"first_name":"Linda","last_name":"Vong","full_name":"Vong, Linda"},{"full_name":"Roifman, Chaim M.","last_name":"Roifman","first_name":"Chaim M."},{"full_name":"Parsons, Brendon D.","first_name":"Brendon D.","last_name":"Parsons"},{"full_name":"Di Cara, Francesca","first_name":"Francesca","last_name":"Di Cara"}],"date_created":"2026-09-13T22:01:51Z","status":"public","article_type":"original","type":"journal_article","oa_version":"Published Version","abstract":[{"text":"The small nuclear RNA U4atac is a core component of the minor spliceosome. In humans, homozygous or compound heterozygous point mutations in U4atac cause rare developmental disorders, such as Roifman syndrome, characterized by growth restriction, brain anomalies, and immune deficiency. To better define the pathophysiological role of U4atac mutations, we here establish a model of minor spliceosome dysfunction by generating a Drosophila melanogaster CRISPR/Cas9-induced U4atac mutant in the highly conserved stem II region. U4atac homozygous mutants exhibit growth and neurodevelopmental defects, immunodeficiency, and gastrointestinal symptoms. Using bulk RNA-sequencing and functional assays, we reveal that mutations in U4atac affect the splicing of a large set of transcripts involved in innate immunity, hematopoiesis, and intestinal cell functions, including the Drosophila Janus kinase (JAK) homolog hopscotch (hop). Importantly, U4atac deficiency reduces Hop expression and causes Hop-related hematopoietic defects at the embryonic and larval stages. Notably, we also observe reduced expression of Jak1 and attenuated activation of downstream signaling in patients with Roifman syndrome. Thus, our work identifies alterations of Jak signaling as part of the pathogenesis of RNU4atac-opathy.","lang":"eng"}],"citation":{"short":"D. Shikara, E. Bishop, N. Barton, S. Makdissi, S. Kailasam, A. György, D.E. Siekhaus, M.C. Borroto, P.M. Campeau, L. Vong, C.M. Roifman, B.D. Parsons, F. Di Cara, Nature Communications 17 (2026).","ista":"Shikara D, Bishop E, Barton N, Makdissi S, Kailasam S, György A, Siekhaus DE, Borroto MC, Campeau PM, Vong L, Roifman CM, Parsons BD, Di Cara F. 2026. The minor spliceosome component U4atac regulates JAK/STAT signaling to modulate hematopoiesis and immune responses in Drosophila melanogaster. Nature Communications. 17, 9582.","ieee":"D. Shikara <i>et al.</i>, “The minor spliceosome component U4atac regulates JAK/STAT signaling to modulate hematopoiesis and immune responses in Drosophila melanogaster,” <i>Nature Communications</i>, vol. 17. Springer Nature, 2026.","mla":"Shikara, Dania, et al. “The Minor Spliceosome Component U4atac Regulates JAK/STAT Signaling to Modulate Hematopoiesis and Immune Responses in Drosophila Melanogaster.” <i>Nature Communications</i>, vol. 17, 9582, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-75539-y\">10.1038/s41467-026-75539-y</a>.","ama":"Shikara D, Bishop E, Barton N, et al. The minor spliceosome component U4atac regulates JAK/STAT signaling to modulate hematopoiesis and immune responses in Drosophila melanogaster. <i>Nature Communications</i>. 2026;17. doi:<a href=\"https://doi.org/10.1038/s41467-026-75539-y\">10.1038/s41467-026-75539-y</a>","apa":"Shikara, D., Bishop, E., Barton, N., Makdissi, S., Kailasam, S., György, A., … Di Cara, F. (2026). The minor spliceosome component U4atac regulates JAK/STAT signaling to modulate hematopoiesis and immune responses in Drosophila melanogaster. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-75539-y\">https://doi.org/10.1038/s41467-026-75539-y</a>","chicago":"Shikara, Dania, Eden Bishop, Nathan Barton, Stephanie Makdissi, Senthilkumar Kailasam, Attila György, Daria E Siekhaus, et al. “The Minor Spliceosome Component U4atac Regulates JAK/STAT Signaling to Modulate Hematopoiesis and Immune Responses in Drosophila Melanogaster.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-75539-y\">https://doi.org/10.1038/s41467-026-75539-y</a>."},"DOAJ_listed":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","supplementarymaterial":"yes","date_updated":"2026-09-16T08:48:22Z","publication":"Nature Communications","scopus_import":"1","publication_identifier":{"eissn":["2041-1723"]},"acknowledgement":"Microscopy was performed at the Dalhousie University, Faculty of Medicine, Cellular and Molecular Digital Imaging. We thank Gerard Gaspard for their help with microscopy. The sequencing of the RNA libraries was performed at Génome Québec, Montreal, QC. Bioinformatics support was provided by the Canadian Center for Computational Genomics (C3G) at the McGill Genome Center of the Victor Phillip Dahdaleh Institute of Genomic Medicine, Montreal, Quebec, Canada. We thank Dr. Rahul Kanadia at the University of Connecticut for insightful discussions on the topic. This work was funded by a Project Grant from the 2019-20 Establishment Grant (Research Nova Scotia), the CIHR Project grant PJT-169179, a CIHR Catalyst grant Rare Diseases: Models & Mechanisms Network and NSERC Discovery Grant RGPIN-2019-04083 to Francesca Di Cara. Dania Shikara and Eden Bishop were funded by NSERC URSA Summer 2021, and Nathan Barton was funded by an Imhotep’s Legacy Academy Summer Scholarship and CIHR-SSRP Summer 2023.","OA_type":"gold","OA_place":"publisher","language":[{"iso":"eng"}]},{"oa_version":"Published Version","type":"dissertation","supervisor":[{"full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2026-09-03T08:06:58Z","status":"public","author":[{"id":"F0EA6804-AA27-11E9-8613-C0F7E5697425","first_name":"Silvia","last_name":"Jamrichova","orcid":"0009-0003-9929-8221","full_name":"Jamrichova, Silvia"}],"title":"Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans","_id":"22775","supplementarymaterial":"no","date_updated":"2026-09-16T08:13:41Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ama":"Jamrichova S. Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22775\">10.15479/AT-ISTA-22775</a>","mla":"Jamrichova, Silvia. <i>Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22775\">10.15479/AT-ISTA-22775</a>.","short":"S. Jamrichova, Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans, Institute of Science and Technology Austria, 2026.","ista":"Jamrichova S. 2026. Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans. Institute of Science and Technology Austria.","ieee":"S. Jamrichova, “Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans,” Institute of Science and Technology Austria, 2026.","chicago":"Jamrichova, Silvia. “Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22775\">https://doi.org/10.15479/AT-ISTA-22775</a>.","apa":"Jamrichova, S. (2026). <i>Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22775\">https://doi.org/10.15479/AT-ISTA-22775</a>"},"page":"153","project":[{"name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692"},{"name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits","_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b","grant_number":"101199096"},{"name":"Mechanisms of GABA release in hippocampal circuits","_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5","grant_number":"P36232"},{"grant_number":"PAT 4178023","_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e","name":"Synaptic networks of human brain"},{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Synaptic communication in neuronal microcircuits","grant_number":"Z00312"},{"grant_number":"COE16","_id":"0a6c8641-b036-11f1-bacf-e4eec62b5bb4","name":"Neuronal circuits in health and disease (Jonas)"}],"ec_funded":1,"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-085-5"]},"language":[{"iso":"eng"}],"OA_place":"publisher","publication_status":"published","year":"2026","ddc":["570"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"M-Shop"},{"_id":"LifeSc"}],"degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/AT-ISTA-22775","article_processing_charge":"No","has_accepted_license":"1","alternative_title":["ISTA Thesis"],"date_published":"2026-09-03T00:00:00Z","file_date_updated":"2026-09-08T09:02:52Z","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"PeJo"}],"month":"09","doi_confirm":"1","corr_author":"1","day":"03","OA_embargo":"18","doi":"10.15479/AT-ISTA-22775","researchdata_availability":"upon request","file":[{"creator":"cchlebak","relation":"main_file","access_level":"closed","date_created":"2026-09-08T09:01:22Z","checksum":"d9a6fd39a0b6343c4473901f9323f127","file_size":8968078,"file_name":"2026_Jamrichova_Silvia_Thesis.pdf","date_updated":"2026-09-08T09:01:22Z","embargo":"2028-03-08","content_type":"application/pdf","file_id":"22850","embargo_to":"open_access"},{"date_created":"2026-09-08T09:02:52Z","checksum":"02b728c9157f88e392b69e94877889f0","creator":"cchlebak","relation":"source_file","access_level":"closed","file_id":"22851","file_size":17338630,"file_name":"2026_Jamrichova_Silvia_Thesis.docx","date_updated":"2026-09-08T09:02:52Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document"}]},{"language":[{"iso":"eng"}],"OA_type":"gold","OA_place":"publisher","ec_funded":1,"acknowledgement":"Ivor van der Hoog, Eva Rotenberg, and Daniel Rutschmann thank the VILLUM Foundation\r\ngrant (VIL37507) “Efficient Recomputations for Changeful Problems” for supporting this work.\r\nDaniel Rutschmann is supported by the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (No. 101019564) ","publication_identifier":{"isbn":["9783959774451"],"issn":["1868-8969"]},"scopus_import":"1","publication":"34th Annual European Symposium on Algorithms","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","supplementarymaterial":"yes","date_updated":"2026-09-16T09:21:35Z","project":[{"grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures"}],"citation":{"mla":"Van Der Hoog, Ivor, et al. “Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection.” <i>34th Annual European Symposium on Algorithms</i>, vol. 388, 101, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.101\">10.4230/LIPIcs.ESA.2026.101</a>.","ama":"Van Der Hoog I, Rotenberg E, Rutschmann DP. Tight Better-Than-Worst-Case bounds for element distinctness and set intersection. In: <i>34th Annual European Symposium on Algorithms</i>. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.101\">10.4230/LIPIcs.ESA.2026.101</a>","ieee":"I. Van Der Hoog, E. Rotenberg, and D. P. Rutschmann, “Tight Better-Than-Worst-Case bounds for element distinctness and set intersection,” in <i>34th Annual European Symposium on Algorithms</i>, L’Aquila, Italy, 2026, vol. 388.","ista":"Van Der Hoog I, Rotenberg E, Rutschmann DP. 2026. Tight Better-Than-Worst-Case bounds for element distinctness and set intersection. 34th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 388, 101.","short":"I. Van Der Hoog, E. Rotenberg, D.P. Rutschmann, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","chicago":"Van Der Hoog, Ivor, Eva Rotenberg, and Daniel P Rutschmann. “Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection.” In <i>34th Annual European Symposium on Algorithms</i>, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.101\">https://doi.org/10.4230/LIPIcs.ESA.2026.101</a>.","apa":"Van Der Hoog, I., Rotenberg, E., &#38; Rutschmann, D. P. (2026). Tight Better-Than-Worst-Case bounds for element distinctness and set intersection. In <i>34th Annual European Symposium on Algorithms</i> (Vol. 388). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.101\">https://doi.org/10.4230/LIPIcs.ESA.2026.101</a>"},"abstract":[{"lang":"eng","text":"The element distinctness problem takes as input a list I of n values from a totally ordered universe, where pairwise comparisons between values are allowed, and the goal is to decide whether I contains any duplicates. It is a well-studied problem with a classical worst-case Ω(n log n) comparison-based lower bound by Fredman [TCS'76]. At first glance, this lower bound appears to rule out any algorithm more efficient than the naive approach of sorting I and comparing adjacent elements. However, upon closer inspection, the Ω(n log n) bound is overly pessimistic. For instance, if I contains n/2 identical elements, a median-finding algorithm will, regardless of the input order, find a duplicate in linear time. This raises a natural question: Are there comparison-based lower bounds for element distinctness that are sensitive to the amount of duplicates in the input instance?\r\nTo address this question, we derive instance-specific lower bounds. For any input instance I, we represent the combinatorial structure of the duplicates in I by an undirected graph G(I) that connects identical elements. Each such graph G is a union of cliques, and we study algorithms by their worst-case running time over all inputs I' with G(I') ≅ G. We establish an adversarial lower bound showing that, for any deterministic algorithm 𝒜, there exists a graph G and an algorithm 𝒜' that, for all inputs I with G(I) ≅ G, is a factor O(log log n) faster than 𝒜. Consequently, no deterministic algorithm can be o(log log n)-competitive for all graphs G. We complement this with an O(log log n)-competitive deterministic algorithm, thereby obtaining tight bounds for element distinctness that go beyond classical worst-case analysis. Subsequently, we study the related problem of set intersection. We show that no deterministic set intersection algorithm can be o(log n)-competitive, and provide an O(log n)-competitive deterministic algorithm. We find it interesting and surprising to discover tight O(log log n)-competitive bounds for element distinctness. Moreover, we find the separation between element distinctness and the set intersection problem unexpected."}],"type":"conference","oa_version":"Published Version","author":[{"full_name":"Van Der Hoog, Ivor","first_name":"Ivor","last_name":"Van Der Hoog"},{"first_name":"Eva","last_name":"Rotenberg","full_name":"Rotenberg, Eva"},{"full_name":"Rutschmann, Daniel P","id":"7397d908-b582-11f0-bf73-88b902e86527","first_name":"Daniel P","last_name":"Rutschmann"}],"date_created":"2026-09-13T22:01:52Z","status":"public","_id":"22915","title":"Tight Better-Than-Worst-Case bounds for element distinctness and set intersection","file":[{"date_created":"2026-09-16T09:20:49Z","checksum":"c552853bfa37e4b9a0f060107e464ed0","success":1,"creator":"dernst","relation":"main_file","access_level":"open_access","file_id":"22937","file_size":892322,"file_name":"2026_LIPIcsESA_vanderHoog.pdf","date_updated":"2026-09-16T09:20:49Z","content_type":"application/pdf"}],"researchdata_availability":"no","doi":"10.4230/LIPIcs.ESA.2026.101","volume":388,"article_number":"101","department":[{"_id":"MoHe"}],"month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","external_id":{"arxiv":["2511.02954"]},"corr_author":"1","oa":1,"day":"25","arxiv":1,"fulldoi":"https://doi.org/10.4230/LIPIcs.ESA.2026.101","das_tickbox":"0","keyword":["Comparison-based analysis","set intersection","universal optimality"],"article_processing_charge":"Yes","file_date_updated":"2026-09-16T09:20:49Z","alternative_title":["LIPIcs"],"date_published":"2026-08-25T00:00:00Z","has_accepted_license":"1","conference":{"name":"ESA: European Symposium on Algorithms","end_date":"2026-09-04","start_date":"2026-08-31","location":"L’Aquila, Italy"},"intvolume":"       388","year":"2026","quality_controlled":"1","publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"]},{"date_updated":"2026-09-16T09:55:16Z","supplementarymaterial":"yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"22704","relation":"research_data","status":"public"}]},"citation":{"chicago":"Önal, Cihan, Peter Koppensteiner, Mary W Muhia, Elodie Le Monnier, and Ryuichi Shigemoto. “Asymmetrical Modulation of Fear Expression via GABAB Receptors in the Mouse Medial Habenula.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2026. <a href=\"https://doi.org/10.1073/pnas.2536560123\">https://doi.org/10.1073/pnas.2536560123</a>.","apa":"Önal, C., Koppensteiner, P., Muhia, M. W., Le Monnier, E., &#38; Shigemoto, R. (2026). Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. <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.2536560123\">https://doi.org/10.1073/pnas.2536560123</a>","ama":"Önal C, Koppensteiner P, Muhia MW, Le Monnier E, Shigemoto R. Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2026;123(36). doi:<a href=\"https://doi.org/10.1073/pnas.2536560123\">10.1073/pnas.2536560123</a>","mla":"Önal, Cihan, et al. “Asymmetrical Modulation of Fear Expression via GABAB Receptors in the Mouse Medial Habenula.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 123, no. 36, e2536560123, National Academy of Sciences, 2026, doi:<a href=\"https://doi.org/10.1073/pnas.2536560123\">10.1073/pnas.2536560123</a>.","ieee":"C. Önal, P. Koppensteiner, M. W. Muhia, E. Le Monnier, and R. Shigemoto, “Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 123, no. 36. National Academy of Sciences, 2026.","ista":"Önal C, Koppensteiner P, Muhia MW, Le Monnier E, Shigemoto R. 2026. Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. Proceedings of the National Academy of Sciences of the United States of America. 123(36), e2536560123.","short":"C. Önal, P. Koppensteiner, M.W. Muhia, E. Le Monnier, R. Shigemoto, Proceedings of the National Academy of Sciences of the United States of America 123 (2026)."},"project":[{"grant_number":"PAT 5720324","name":"New regime of presynaptic release regulation","_id":"92503f6e-16d5-11f0-9cad-8c571927f3b7"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"type":"journal_article","oa_version":"Published Version","article_type":"original","abstract":[{"lang":"eng","text":"The medial habenula (MHb) is implicated in regulating emotional responses to aversive events. Studies in zebrafish have identified a remarkable morphological left–right asymmetry in the dorsal habenula (zebrafish equivalent of mammalian MHb)-interpeduncular nucleus (IPN) pathway and its asymmetrical roles in behavior. However, there is little evidence for structural or functional lateralization in the mammalian MHb-IPN pathway. Here, we investigated the synaptic properties of left- and right-MHb afferents to the IPN and their roles in the expression of conditioned fear in mice. We found that each IPN neuron receives inputs from both left and right MHb, but the left MHb-originating synapses exhibit lower release probability and higher γ-aminobutyric acid type B receptor (GABABR)-mediated potentiation compared to the right MHb-originating synapses. Interestingly, these asymmetrical properties persist in the inversus visceral mutant mice with normal internal organ laterality (situs solitus), but nearly disappear in those with reversed internal organ laterality (situs inversus). Behaviorally, chemogenetic inhibition of cholinergic neurons and conditional deletion of GABABR in the left, but not the right, MHb significantly attenuated cue-dependent fear recall. Our results demonstrate functional asymmetry of the MHb under partial influence of the nodal flow in mice, revealing a predominant role of GABABR-mediated signaling in the left MHb-IPN pathway in modulating fear memories. These findings suggest that lateralized MHb pathways could represent a fundamental principle in the neural regulation of emotion across species but that they develop differently in zebrafish and mice."}],"title":"Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula","_id":"22913","status":"public","author":[{"last_name":"Önal","first_name":"Hüseyin C","id":"4659D740-F248-11E8-B48F-1D18A9856A87","full_name":"Önal, Hüseyin C","orcid":"0000-0002-2771-2011"},{"orcid":"0000-0002-3509-1948","full_name":"Koppensteiner, Peter","id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87","last_name":"Koppensteiner","first_name":"Peter"},{"id":"ab7ed20f-09f7-11eb-909c-d5d0b443ee9d","last_name":"Muhia","first_name":"Mary W","full_name":"Muhia, Mary W"},{"full_name":"Le Monnier, Elodie","id":"3B59276A-F248-11E8-B48F-1D18A9856A87","first_name":"Elodie","last_name":"Le Monnier"},{"orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2026-09-13T22:01:52Z","language":[{"iso":"eng"}],"OA_place":"publisher","OA_type":"hybrid","ec_funded":1,"publication_identifier":{"eissn":["1091-6490"]},"acknowledgement":"We thank Bernhard Bettler for GABAB1 floxed mice. This project has received funding from the Austrian Science Fund (10.55776/PAT5720324) to R.S., and the Marie Skłodowska-Curie Grant Agreement No. 665385 to C.Ö. We thank Todor Asenov from the ISTA machine shop for preparing the custom part and the ISTA preclinical facility for animal care. SI Appendix, Fig. S7 was created in BioRender under the following license [Onal, C.(2026) https://BioRender.com/wuyvshe]. For open access purposes, the author has applied a CC BY-NC-ND public copyright license to any author-accepted manuscript version arising from this submission.","publication":"Proceedings of the National Academy of Sciences of the United States of America","scopus_import":"1","issue":"36","das_tickbox":"1","fulldoi":"https://doi.org/10.1073/pnas.2536560123","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"}],"has_accepted_license":"1","file_date_updated":"2026-09-16T09:09:58Z","date_published":"2026-09-08T00:00:00Z","article_processing_charge":"Yes (in subscription journal)","keyword":["medial habenula","GABAB receptor","asymmetry","fear conditioning","mouse"],"publication_status":"published","pmid":1,"quality_controlled":"1","year":"2026","intvolume":"       123","ddc":["570"],"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"volume":123,"doi":"10.1073/pnas.2536560123","researchdata_availability":"yes","file":[{"file_id":"22936","file_name":"2026_PNAS_Oenal.pdf","date_updated":"2026-09-16T09:09:58Z","content_type":"application/pdf","file_size":7496942,"success":1,"checksum":"8efe98c02ba79b9a3d76b7d6c1edbfbc","date_created":"2026-09-16T09:09:58Z","access_level":"open_access","relation":"main_file","creator":"dernst"}],"article_number":"e2536560123","external_id":{"pmid":["42673459"]},"publisher":"National Academy of Sciences","month":"09","department":[{"_id":"RySh"},{"_id":"PreCl"}],"dataavailabilitystatement":"All numerical data regarding electrophysiological recordings, calcium imaging, image analysis and behavioral tracking included in the article and/or SI Appendix have been deposited and are publicly available at ISTA REx (https://doi.org/10.15479/AT-ISTA-22704).","day":"08","oa":1,"corr_author":"1"},{"year":"2026","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"}],"fulldoi":"https://doi.org/10.15479/AT-ISTA-22704","article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2026-08-13T13:06:29Z","date_published":"2026-08-13T00:00:00Z","publisher":"Institute of Science and Technology Austria","month":"08","department":[{"_id":"RySh"}],"doi_confirm":"1","corr_author":"1","oa":1,"day":"13","doi":"10.15479/AT-ISTA-22704","file":[{"relation":"main_file","creator":"elemonni","access_level":"open_access","date_created":"2026-08-13T12:07:53Z","checksum":"7742bb211a43bb87c2b5ce7bda3068ae","success":1,"file_size":162086,"file_name":"Behavior.zip","content_type":"application/x-zip-compressed","date_updated":"2026-08-13T12:07:53Z","file_id":"22705"},{"file_size":6643,"file_name":"image_analysis.zip","date_updated":"2026-08-13T12:07:57Z","content_type":"application/x-zip-compressed","file_id":"22706","creator":"elemonni","relation":"main_file","access_level":"open_access","date_created":"2026-08-13T12:07:57Z","checksum":"a162eb6103a770d94536374e02934fcf","success":1},{"file_name":"Recordings.zip","date_updated":"2026-08-13T12:07:59Z","content_type":"application/x-zip-compressed","file_size":1193016,"file_id":"22707","access_level":"open_access","creator":"elemonni","relation":"main_file","success":1,"checksum":"608aaf395bba5fd9cf62d8c8940d63aa","date_created":"2026-08-13T12:07:59Z"},{"date_updated":"2026-08-13T13:06:29Z","content_type":"text/plain","file_name":"README.txt","file_size":246,"file_id":"22708","access_level":"open_access","relation":"main_file","creator":"elemonni","success":1,"date_created":"2026-08-13T13:06:29Z","checksum":"2389ebd71238bd7de03d20504a8cf962"}],"abstract":[{"text":"The medial habenula (MHb) is implicated in regulating emotional responses to aversive events. Studies in zebrafish have identified a remarkable morphological left–right asymmetry in the dorsal habenula (zebrafish equivalent of mammalian MHb)-interpeduncular nucleus (IPN) pathway and its asymmetrical roles in behavior. However, there is little evidence for structural or functional lateralization in the mammalian MHb-IPN pathway. Here, we investigated the synaptic properties of left- and right-MHb afferents to the IPN and their roles in the expression of conditioned fear in mice. We found that each IPN neuron receives inputs from both left and right MHb, but the left MHb-originating synapses exhibit lower release probability and higher γ-aminobutyric acid type B receptor (GABABR)-mediated potentiation compared to the right MHb-originating synapses. Interestingly, these asymmetrical properties persist in the inversus visceral mutant mice with normal internal organ laterality (situs solitus), but nearly disappear in those with reversed internal organ laterality (situs inversus). Behaviorally, chemogenetic inhibition of cholinergic neurons and conditional deletion of GABABR in the left, but not the right, MHb significantly attenuated cue-dependent fear recall. Our results demonstrate functional asymmetry of the MHb under partial influence of the nodal flow in mice, revealing a predominant role of GABABR-mediated signaling in the left MHb-IPN pathway in modulating fear memories. These findings suggest that lateralized MHb pathways could represent a fundamental principle in the neural regulation of emotion across species but that they develop differently in zebrafish and mice.\r\n","lang":"eng"}],"oa_version":"None","type":"research_data","status":"public","date_created":"2026-08-13T12:20:08Z","author":[{"last_name":"Le Monnier","first_name":"Elodie","id":"3B59276A-F248-11E8-B48F-1D18A9856A87","full_name":"Le Monnier, Elodie"},{"full_name":"Önal, Cihan","first_name":"Cihan","last_name":"Önal"}],"title":"Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula","_id":"22704","date_updated":"2026-09-16T09:55:15Z","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","citation":{"short":"E. Le Monnier, C. Önal, (2026).","ista":"Le Monnier E, Önal C. 2026. Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-22704\">10.15479/AT-ISTA-22704</a>.","ieee":"E. Le Monnier and C. Önal, “Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula.” Institute of Science and Technology Austria, 2026.","ama":"Le Monnier E, Önal C. Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22704\">10.15479/AT-ISTA-22704</a>","mla":"Le Monnier, Elodie, and Cihan Önal. <i>Asymmetrical Modulation of Fear Expression via GABAB Receptors in the Mouse Medial Habenula</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22704\">10.15479/AT-ISTA-22704</a>.","apa":"Le Monnier, E., &#38; Önal, C. (2026). Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22704\">https://doi.org/10.15479/AT-ISTA-22704</a>","chicago":"Le Monnier, Elodie, and Cihan Önal. “Asymmetrical Modulation of Fear Expression via GABAB Receptors in the Mouse Medial Habenula.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22704\">https://doi.org/10.15479/AT-ISTA-22704</a>."},"project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"name":"New regime of presynaptic release regulation","_id":"92503f6e-16d5-11f0-9cad-8c571927f3b7","grant_number":"PAT 5720324"}],"related_material":{"record":[{"id":"22913","relation":"used_in_publication","status":"public"}]},"ec_funded":1,"OA_place":"repository"}]