[{"arxiv":1,"publisher":"ML Research Press","type":"conference","publication_status":"published","oa_version":"Published Version","OA_type":"diamond","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"}],"month":"06","title":"Logic gate neural networks are good for verification","department":[{"_id":"ChLa"},{"_id":"ToHe"}],"date_updated":"2025-09-09T08:12:44Z","OA_place":"publisher","acknowledged_ssus":[{"_id":"ScienComp"}],"publication_identifier":{"eissn":["2640-3498"]},"_id":"20296","ec_funded":1,"language":[{"iso":"eng"}],"publication":"2nd International Conferenceon Neuro-Symbolic Systems","year":"2025","acknowledgement":"This work is supported in part by the ERC grant under Grant No. ERC-2020-AdG 101020093 and\r\nthe Austrian Science Fund (FWF) [10.55776/COE12]. This research was supported by the Scientific\r\nService Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","status":"public","date_published":"2025-06-01T00:00:00Z","file":[{"checksum":"90a32defed34787e771a5c1623b6b0d2","date_created":"2025-09-09T08:10:13Z","content_type":"application/pdf","access_level":"open_access","success":1,"file_name":"2025_NeuS_Kresse.pdf","file_size":295466,"file_id":"20314","creator":"dernst","relation":"main_file","date_updated":"2025-09-09T08:10:13Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":288,"external_id":{"arxiv":["2505.19932"]},"author":[{"first_name":"Fabian","last_name":"Kresse","id":"faff3c84-23f6-11ef-9085-e5187b51c604","full_name":"Kresse, Fabian"},{"id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","last_name":"Yu","full_name":"Yu, Zhengqi","first_name":"Zhengqi"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"abstract":[{"text":"Learning-based systems are increasingly deployed across various domains, yet the complexity of traditional neural networks poses significant challenges for formal verification. Unlike conventional neural networks, learned Logic Gate Networks (LGNs) replace multiplications with Boolean logic gates, yielding a sparse, netlist-like architecture that is inherently more amenable to symbolic verification, while still delivering promising performance. In this paper, we introduce a SAT encoding for verifying global robustness and fairness in LGNs. We evaluate our method on five benchmark datasets, including a newly constructed 5-class variant, and find that LGNs are both verification-friendly and maintain strong predictive performance.","lang":"eng"}],"ddc":["000"],"oa":1,"file_date_updated":"2025-09-09T08:10:13Z","article_number":"26","conference":{"start_date":"2025-05-28","end_date":"2025-05-30","location":"Philadephia, PA, United States","name":"NeuS: International Conferenceon Neuro-Symbolic Systems"},"article_processing_charge":"No","has_accepted_license":"1","quality_controlled":"1","citation":{"short":"F. Kresse, E. Yu, C. Lampert, T.A. Henzinger, in:, 2nd International Conferenceon Neuro-Symbolic Systems, ML Research Press, 2025.","ieee":"F. Kresse, E. Yu, C. Lampert, and T. A. Henzinger, “Logic gate neural networks are good for verification,” in <i>2nd International Conferenceon Neuro-Symbolic Systems</i>, Philadephia, PA, United States, 2025, vol. 288.","ama":"Kresse F, Yu E, Lampert C, Henzinger TA. Logic gate neural networks are good for verification. In: <i>2nd International Conferenceon Neuro-Symbolic Systems</i>. Vol 288. ML Research Press; 2025.","ista":"Kresse F, Yu E, Lampert C, Henzinger TA. 2025. Logic gate neural networks are good for verification. 2nd International Conferenceon Neuro-Symbolic Systems. NeuS: International Conferenceon Neuro-Symbolic Systems, PMLR, vol. 288, 26.","chicago":"Kresse, Fabian, Emily Yu, Christoph Lampert, and Thomas A Henzinger. “Logic Gate Neural Networks Are Good for Verification.” In <i>2nd International Conferenceon Neuro-Symbolic Systems</i>, Vol. 288. ML Research Press, 2025.","mla":"Kresse, Fabian, et al. “Logic Gate Neural Networks Are Good for Verification.” <i>2nd International Conferenceon Neuro-Symbolic Systems</i>, vol. 288, 26, ML Research Press, 2025.","apa":"Kresse, F., Yu, E., Lampert, C., &#38; Henzinger, T. A. (2025). Logic gate neural networks are good for verification. In <i>2nd International Conferenceon Neuro-Symbolic Systems</i> (Vol. 288). Philadephia, PA, United States: ML Research Press."},"date_created":"2025-09-07T22:01:34Z","scopus_import":"1","day":"01","corr_author":"1","alternative_title":["PMLR"],"intvolume":"       288"},{"intvolume":"       286","quality_controlled":"1","date_created":"2025-09-07T22:01:34Z","citation":{"ieee":"A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and A. Shafiee, “Limit-sure reachability for small memory policies in POMDPs is NP-complete,” in <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 238–247.","short":"A. Asadi, K. Chatterjee, R.J. Saona Urmeneta, A. Shafiee, in:, The 41st Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 238–247.","ama":"Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. Limit-sure reachability for small memory policies in POMDPs is NP-complete. In: <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>. Vol 286. ML Research Press; 2025:238-247.","chicago":"Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Ali Shafiee. “Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.” In <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, 286:238–47. ML Research Press, 2025.","apa":"Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., &#38; Shafiee, A. (2025). Limit-sure reachability for small memory policies in POMDPs is NP-complete. In <i>The 41st Conference on Uncertainty in Artificial Intelligence</i> (Vol. 286, pp. 238–247). Rio de Janeiro, Brazil: ML Research Press.","mla":"Asadi, Ali, et al. “Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.” <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, vol. 286, ML Research Press, 2025, pp. 238–47.","ista":"Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. 2025. Limit-sure reachability for small memory policies in POMDPs is NP-complete. The 41st Conference on Uncertainty in Artificial Intelligence. UAI: Conference on Uncertainty in Artificial Intelligence, PMLR, vol. 286, 238–247."},"scopus_import":"1","day":"01","corr_author":"1","alternative_title":["PMLR"],"conference":{"location":"Rio de Janeiro, Brazil","name":"UAI: Conference on Uncertainty in Artificial Intelligence","end_date":"2025-07-25","start_date":"2025-07-21"},"article_processing_charge":"No","has_accepted_license":"1","abstract":[{"text":"A standard model that arises in several applications in sequential decision-making is partially observable Markov decision processes (POMDPs) where a decision-making agent interacts with an uncertain environment. A basic objective in POMDPs is the reachability objective, where given a target set of states, the goal is to eventually arrive at one of them.\r\n\r\nThe limit-sure problem asks whether reachability can be ensured with probability arbitrarily close to 1. In general, the limit-sure reachability problem for POMDPs is undecidable. However, in many practical cases, the most relevant question is the existence of policies with a small amount of memory. In this work, we study the limit-sure reachability problem for POMDPs with a fixed amount of memory. We establish that the computational complexity of the problem is NP-complete.","lang":"eng"}],"ddc":["000"],"oa":1,"file_date_updated":"2025-09-09T08:19:41Z","date_published":"2025-07-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":307458,"file_name":"2025_UAI_AsadiAli.pdf","success":1,"access_level":"open_access","content_type":"application/pdf","date_created":"2025-09-09T08:19:41Z","checksum":"1a37ebe7ba73ab6985765bf0d17a0acc","date_updated":"2025-09-09T08:19:41Z","relation":"main_file","creator":"dernst","file_id":"20315"}],"volume":286,"external_id":{"arxiv":["2412.00941"]},"author":[{"first_name":"Ali","full_name":"Asadi, Ali","last_name":"Asadi","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J","orcid":"0000-0001-5103-038X","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta"},{"last_name":"Shafiee","id":"2783031a-7378-11f0-b2d0-f17f1db2ebad","full_name":"Shafiee, Ali","first_name":"Ali"}],"acknowledgement":"This research was partially supported by Austrian Science Fund (FWF) 10.55776/COE12, the support of the French Agence Nationale de la Recherche (ANR) under reference ANR-21-CE40-0020 (CONVERGENCE project), and the ERC CoG 863818 (ForM-SMArt) grant.","status":"public","year":"2025","page":"238-247","language":[{"iso":"eng"}],"publication":"The 41st Conference on Uncertainty in Artificial Intelligence","_id":"20297","ec_funded":1,"OA_place":"publisher","publication_identifier":{"eissn":["2640-3498"]},"date_updated":"2025-09-09T08:21:45Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"department":[{"_id":"KrCh"},{"_id":"GradSch"}],"title":"Limit-sure reachability for small memory policies in POMDPs is NP-complete","month":"07","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020"}],"OA_type":"diamond","publisher":"ML Research Press","type":"conference","publication_status":"published","oa_version":"Published Version","arxiv":1},{"day":"01","corr_author":"1","alternative_title":["PMLR"],"quality_controlled":"1","citation":{"ieee":"N. Kalinin and L. Steinberger, “Efficient estimation of a Gaussian mean with local differential privacy,” in <i>Proceedings of the 28th International Conference on Artificial Intelligence and Statistics</i>, Mai Khao, Thailand, 2025, vol. 258, pp. 118–126.","short":"N. Kalinin, L. Steinberger, in:, Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 118–126.","ama":"Kalinin N, Steinberger L. Efficient estimation of a Gaussian mean with local differential privacy. In: <i>Proceedings of the 28th International Conference on Artificial Intelligence and Statistics</i>. Vol 258. ML Research Press; 2025:118-126.","ista":"Kalinin N, Steinberger L. 2025. Efficient estimation of a Gaussian mean with local differential privacy. Proceedings of the 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 118–126.","apa":"Kalinin, N., &#38; Steinberger, L. (2025). Efficient estimation of a Gaussian mean with local differential privacy. In <i>Proceedings of the 28th International Conference on Artificial Intelligence and Statistics</i> (Vol. 258, pp. 118–126). Mai Khao, Thailand: ML Research Press.","mla":"Kalinin, Nikita, and Lukas Steinberger. “Efficient Estimation of a Gaussian Mean with Local Differential Privacy.” <i>Proceedings of the 28th International Conference on Artificial Intelligence and Statistics</i>, vol. 258, ML Research Press, 2025, pp. 118–26.","chicago":"Kalinin, Nikita, and Lukas Steinberger. “Efficient Estimation of a Gaussian Mean with Local Differential Privacy.” In <i>Proceedings of the 28th International Conference on Artificial Intelligence and Statistics</i>, 258:118–26. ML Research Press, 2025."},"date_created":"2025-09-07T22:01:34Z","scopus_import":"1","intvolume":"       258","oa":1,"file_date_updated":"2025-09-09T08:26:44Z","ddc":["000"],"abstract":[{"text":"In this paper, we study the problem of estimating the unknown mean θ of a unit variance Gaussian distribution in a locally differentially private (LDP) way. In the high-privacy regime (ϵ≤1\r\n), we identify an optimal privacy mechanism that minimizes the variance of the estimator asymptotically. Our main technical contribution is the maximization of the Fisher-Information of the sanitized data with respect to the local privacy mechanism Q. We find that the exact solution Qθ,ϵ of this maximization is the sign mechanism that applies randomized response to the sign of Xi−θ, where X1,…,Xn are the confidential iid original samples. However, since this optimal local mechanism depends on the unknown mean θ, we employ a two-stage LDP parameter estimation procedure which requires splitting agents into two groups. The first n1 observations are used to consistently but not necessarily efficiently estimate the parameter θ by θn1~\r\n. Then this estimate is updated by applying the sign mechanism with θ~n1 instead of θ\r\n to the remaining n−n1 observations, to obtain an LDP and efficient estimator of the unknown mean.","lang":"eng"}],"has_accepted_license":"1","conference":{"start_date":"2025-05-03","location":"Mai Khao, Thailand","name":"AISTATS: Conference on Artificial Intelligence and Statistics","end_date":"2025-05-05"},"article_processing_charge":"No","status":"public","acknowledgement":"We would like to express our gratitude to Christoph Lampert for his valuable insights and fruitful discussions that significantly contributed to the development of this paper.\r\nWe also thank Salil Vadhan for his constructive feedback on an earlier version of this draft.\r\nThe second author gratefully acknowledges support by the Austrian Science Fund (FWF): I 5484-N, as part of the Research Unit 5381 of the German Research Foundation.","volume":258,"external_id":{"arxiv":["2402.04840"]},"author":[{"id":"4b14526e-14d2-11ed-ba64-c14c9553d137","last_name":"Kalinin","full_name":"Kalinin, Nikita","first_name":"Nikita"},{"full_name":"Steinberger, Lukas","last_name":"Steinberger","first_name":"Lukas"}],"file":[{"content_type":"application/pdf","access_level":"open_access","date_created":"2025-09-09T08:26:44Z","checksum":"3dcd59988ca974b98662ba09a516e616","file_size":395864,"success":1,"file_name":"2025_AISTATS_Kalinin.pdf","relation":"main_file","creator":"dernst","file_id":"20316","date_updated":"2025-09-09T08:26:44Z"}],"date_published":"2025-05-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication":"Proceedings of the 28th International Conference on Artificial Intelligence and Statistics","page":"118-126","year":"2025","publication_identifier":{"eissn":["2640-3498"]},"OA_place":"publisher","_id":"20298","department":[{"_id":"ChLa"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Efficient estimation of a Gaussian mean with local differential privacy","date_updated":"2025-09-09T08:28:41Z","OA_type":"diamond","month":"05","arxiv":1,"oa_version":"Published Version","publisher":"ML Research Press","type":"conference","publication_status":"published"},{"_id":"20299","ec_funded":1,"OA_place":"publisher","publication_identifier":{"eissn":["2640-3498"]},"date_updated":"2025-09-09T06:31:20Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"department":[{"_id":"KrCh"},{"_id":"GradSch"}],"title":"Lower bound on Howard policy iteration for deterministic Markov Decision Processes","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"}],"month":"01","OA_type":"diamond","type":"conference","publication_status":"published","publisher":"ML Research Press","oa_version":"Published Version","arxiv":1,"intvolume":"       286","date_created":"2025-09-07T22:01:34Z","quality_controlled":"1","citation":{"ieee":"A. Asadi, K. Chatterjee, and J. De Raaij, “Lower bound on Howard policy iteration for deterministic Markov Decision Processes,” in <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 223–232.","short":"A. Asadi, K. Chatterjee, J. De Raaij, in:, The 41st Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 223–232.","ama":"Asadi A, Chatterjee K, De Raaij J. Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In: <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>. Vol 286. ML Research Press; 2025:223-232.","ista":"Asadi A, Chatterjee K, De Raaij J. 2025. Lower bound on Howard policy iteration for deterministic Markov Decision Processes. The 41st Conference on Uncertainty in Artificial Intelligence. UAI: Conference on Uncertainty in Artificial Intelligence, PMLR, vol. 286, 223–232.","apa":"Asadi, A., Chatterjee, K., &#38; De Raaij, J. (2025). Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In <i>The 41st Conference on Uncertainty in Artificial Intelligence</i> (Vol. 286, pp. 223–232). Rio de Janeiro, Brazil: ML Research Press.","chicago":"Asadi, Ali, Krishnendu Chatterjee, and Jakob De Raaij. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” In <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, 286:223–32. ML Research Press, 2025.","mla":"Asadi, Ali, et al. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, vol. 286, ML Research Press, 2025, pp. 223–32."},"scopus_import":"1","corr_author":"1","day":"01","alternative_title":["PMLR"],"conference":{"start_date":"2025-07-21","name":"UAI: Conference on Uncertainty in Artificial Intelligence","location":"Rio de Janeiro, Brazil","end_date":"2025-07-25"},"article_processing_charge":"No","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Deterministic Markov Decision Processes (DMDPs) are a mathematical framework for decision-making where the outcomes and future possible actions are deterministically determined by the current action taken. DMDPs can be viewed as a finite directed weighted graph, where in each step, the controller chooses an outgoing edge. An objective is a measurable function on runs (or infinite trajectories) of the DMDP, and the value for an objective is the maximal cumulative reward (or weight) that the controller can guarantee. We consider the classical mean-payoff (aka limit-average) objective, which is a basic and fundamental objective.\r\n\r\nHoward's policy iteration algorithm is a popular method for solving DMDPs with mean-payoff objectives. Although Howard's algorithm performs well in practice, as experimental studies suggested, the best known upper bound is exponential and the current known lower bound is as follows: For the input size I, the algorithm requires (math formular) iterations, where (math formular) hides the poly-logarithmic factors, i.e., the current lower bound on iterations is sub-linear with respect to the input size. Our main result is an improved lower bound for this fundamental algorithm where we show that for the input size I, the algorithm requires (math formular) iterations."}],"ddc":["000"],"oa":1,"file_date_updated":"2025-09-09T06:27:59Z","date_published":"2025-01-01T00:00:00Z","file":[{"content_type":"application/pdf","access_level":"open_access","date_created":"2025-09-09T06:27:59Z","checksum":"4180c81bb6ed3b4f5c7a8e48d06520c6","file_size":317097,"success":1,"file_name":"2025_UAI_Asadi.pdf","relation":"main_file","creator":"dernst","file_id":"20313","date_updated":"2025-09-09T06:27:59Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":286,"external_id":{"arxiv":["2506.12254"]},"author":[{"id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi","full_name":"Asadi, Ali","first_name":"Ali"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Jakob","last_name":"De Raaij","full_name":"De Raaij, Jakob"}],"status":"public","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant and Austrian Science Fund (FWF) 10.55776/COE12.\r\n","year":"2025","language":[{"iso":"eng"}],"publication":"The 41st Conference on Uncertainty in Artificial Intelligence","page":"223-232"},{"year":"2025","page":"4591-4599","language":[{"iso":"eng"}],"publication":"The 28th International Conference on Artificial Intelligence and Statistics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-05-01T00:00:00Z","volume":258,"author":[{"first_name":"Tobias","full_name":"Wegel, Tobias","last_name":"Wegel"},{"full_name":"Kovačević, Filip","id":"d0258e7b-50b8-11ef-ad56-8b9f537b6b1b","last_name":"Kovačević","first_name":"Filip"},{"last_name":"Ţifrea","full_name":"Ţifrea, Alexandru","first_name":"Alexandru"},{"full_name":"Yang, Fanny","last_name":"Yang","first_name":"Fanny"}],"external_id":{"arxiv":["2503.08849"]},"acknowledgement":"We thank Junhyung Park for valuable feedback on the manuscript. AT was supported by a PhD fellowship from the Swiss Data Science Center. TW was supported by the SNF Grant 204439. This work was done in part while TW and FY were visiting the Simons Institute for the Theory of\r\nComputing.","status":"public","conference":{"name":"AISTATS: Conference on Artificial Intelligence and Statistics","location":"Mai Khao, Thailand","end_date":"2025-05-05","start_date":"2025-05-03"},"article_processing_charge":"No","abstract":[{"text":"Simultaneously addressing multiple objectives is becoming increasingly important in modern machine learning. At the same time, data is often high-dimensional and costly to label. For a single objective such as prediction risk, conventional regularization techniques are known to improve generalization when the data exhibits low-dimensional structure like sparsity. However, it is largely unexplored how to leverage this structure in the context of multi-objective learning (MOL) with multiple competing objectives. In this work, we discuss how the application of vanilla regularization approaches can fail, and propose a two-stage MOL framework that can successfully leverage low-dimensional structure. We demonstrate its effectiveness experimentally for multi-distribution learning and fairness-risk trade-offs.","lang":"eng"}],"oa":1,"intvolume":"       258","quality_controlled":"1","citation":{"ista":"Wegel T, Kovačević F, Ţifrea A, Yang F. 2025. Learning Pareto manifolds in high dimensions: How can regularization help? The 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 4591–4599.","chicago":"Wegel, Tobias, Filip Kovačević, Alexandru Ţifrea, and Fanny Yang. “Learning Pareto Manifolds in High Dimensions: How Can Regularization Help?” In <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, 258:4591–99. ML Research Press, 2025.","mla":"Wegel, Tobias, et al. “Learning Pareto Manifolds in High Dimensions: How Can Regularization Help?” <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, vol. 258, ML Research Press, 2025, pp. 4591–99.","apa":"Wegel, T., Kovačević, F., Ţifrea, A., &#38; Yang, F. (2025). Learning Pareto manifolds in high dimensions: How can regularization help? In <i>The 28th International Conference on Artificial Intelligence and Statistics</i> (Vol. 258, pp. 4591–4599). Mai Khao, Thailand: ML Research Press.","ieee":"T. Wegel, F. Kovačević, A. Ţifrea, and F. Yang, “Learning Pareto manifolds in high dimensions: How can regularization help?,” in <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, Mai Khao, Thailand, 2025, vol. 258, pp. 4591–4599.","short":"T. Wegel, F. Kovačević, A. Ţifrea, F. Yang, in:, The 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 4591–4599.","ama":"Wegel T, Kovačević F, Ţifrea A, Yang F. Learning Pareto manifolds in high dimensions: How can regularization help? In: <i>The 28th International Conference on Artificial Intelligence and Statistics</i>. Vol 258. ML Research Press; 2025:4591-4599."},"date_created":"2025-09-07T22:01:35Z","scopus_import":"1","day":"01","alternative_title":["PMLR"],"publication_status":"published","publisher":"ML Research Press","type":"conference","oa_version":"Preprint","arxiv":1,"month":"05","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2503.08849","open_access":"1"}],"OA_type":"green","date_updated":"2025-09-09T07:00:34Z","title":"Learning Pareto manifolds in high dimensions: How can regularization help?","department":[{"_id":"MaMo"}],"_id":"20300","OA_place":"repository","publication_identifier":{"eissn":["2640-3498"]}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-05-01T00:00:00Z","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"full_name":"Sricharan, A. R.","last_name":"Sricharan","first_name":"A. R."},{"first_name":"Teresa Anna","full_name":"Steiner, Teresa Anna","last_name":"Steiner"}],"external_id":{"arxiv":["2302.11341"]},"volume":258,"acknowledgement":"MH: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. TAS: This work was supported by a research grant (VIL51463)\r\nfrom VILLUM FONDEN.","status":"public","year":"2025","page":"1990-1998","language":[{"iso":"eng"}],"publication":"The 28th International Conference on Artificial Intelligence and Statistics","intvolume":"       258","scopus_import":"1","quality_controlled":"1","citation":{"mla":"Henzinger, Monika, et al. “Differentially Private Continual Release of Histograms and Related Queries.” <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, vol. 258, ML Research Press, 2025, pp. 1990–98.","chicago":"Henzinger, Monika, A. R. Sricharan, and Teresa Anna Steiner. “Differentially Private Continual Release of Histograms and Related Queries.” In <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, 258:1990–98. ML Research Press, 2025.","apa":"Henzinger, M., Sricharan, A. R., &#38; Steiner, T. A. (2025). Differentially private continual release of histograms and related queries. In <i>The 28th International Conference on Artificial Intelligence and Statistics</i> (Vol. 258, pp. 1990–1998). Mai Khao, Thailand: ML Research Press.","ista":"Henzinger M, Sricharan AR, Steiner TA. 2025. Differentially private continual release of histograms and related queries. The 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 1990–1998.","ama":"Henzinger M, Sricharan AR, Steiner TA. Differentially private continual release of histograms and related queries. In: <i>The 28th International Conference on Artificial Intelligence and Statistics</i>. Vol 258. ML Research Press; 2025:1990-1998.","short":"M. Henzinger, A.R. Sricharan, T.A. Steiner, in:, The 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 1990–1998.","ieee":"M. Henzinger, A. R. Sricharan, and T. A. Steiner, “Differentially private continual release of histograms and related queries,” in <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, Mai Khao, Thailand, 2025, vol. 258, pp. 1990–1998."},"date_created":"2025-09-07T22:01:35Z","alternative_title":["PMLR"],"day":"01","article_processing_charge":"No","conference":{"start_date":"2025-05-03","name":"AISTATS: Conference on Artificial Intelligence and Statistics","location":"Mai Khao, Thailand","end_date":"2025-05-05"},"abstract":[{"text":"We study privately releasing column sums of a d-dimensional table with entries from a universe χ undergoing T row updates, called histogram under continual release. Our mechanisms give better additive ℓ∞-error than existing mechanisms for a large class of queries and input streams. Our first contribution is an output-sensitive mechanism in the insertions-only model (χ = {0, 1}) for maintaining (i) the histogram or (ii) queries that do not require maintaining the entire histogram, such as the maximum or minimum column sum, the median, or any quantiles. The mechanism has an additive error of O(d log2 (dq∗) + log T) whp, where q∗ is the maximum output value over all time steps on this dataset. The mechanism does not require q∗ as input. This breaks the Ω(d log T) bound of prior work when q∗ ≪ T. Our second contribution is a mechanism for the turnstile model that admits negative entry updates (χ = {−1, 0, 1}). This mechanism has an additive error of O(d log2(dK) + log T) whp, where K is the number of times two consecutive data rows differ, and the mechanism does not require K as input. This is useful when monitoring inputs that only vary under unusual circumstances. For d = 1 this gives the first\r\nprivate mechanism with error O(log2 K + log T) for continual counting in the turnstile model, improving on the O(log2 n + log T) error bound by Dwork et al. (2015), where n is the number of ones in the stream, as well as allowing negative entries, while Dwork et al. (2015) can only handle nonnegative entries (χ = {0, 1}). ","lang":"eng"}],"oa":1,"project":[{"call_identifier":"H2020","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"}],"month":"05","OA_type":"green","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2302.11341"}],"type":"conference","publication_status":"published","publisher":"ML Research Press","oa_version":"Preprint","arxiv":1,"ec_funded":1,"_id":"20301","OA_place":"repository","publication_identifier":{"eissn":["2640-3498"]},"date_updated":"2025-09-09T07:09:22Z","department":[{"_id":"MoHe"}],"title":"Differentially private continual release of histograms and related queries"},{"publication_identifier":{"eissn":["2640-3498"]},"OA_place":"repository","_id":"20302","ec_funded":1,"department":[{"_id":"KrCh"}],"title":"Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis","date_updated":"2025-09-09T07:17:08Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2501.04443"}],"OA_type":"green","month":"05","project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"arxiv":1,"oa_version":"Preprint","publisher":"ML Research Press","type":"conference","publication_status":"published","day":"01","alternative_title":["PMLR"],"date_created":"2025-09-07T22:01:35Z","quality_controlled":"1","citation":{"ista":"Luo R, Stich SU, Horváth S, Takáč M. 2025. Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. The 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 2539–2547.","apa":"Luo, R., Stich, S. U., Horváth, S., &#38; Takáč, M. (2025). Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. In <i>The 28th International Conference on Artificial Intelligence and Statistics</i> (Vol. 258, pp. 2539–2547). Mai Khao, Thailand: ML Research Press.","chicago":"Luo, Ruichen, Sebastian U. Stich, Samuel Horváth, and Martin Takáč. “Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis.” In <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, 258:2539–47. ML Research Press, 2025.","mla":"Luo, Ruichen, et al. “Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis.” <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, vol. 258, ML Research Press, 2025, pp. 2539–47.","ama":"Luo R, Stich SU, Horváth S, Takáč M. Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. In: <i>The 28th International Conference on Artificial Intelligence and Statistics</i>. Vol 258. ML Research Press; 2025:2539-2547.","short":"R. Luo, S.U. Stich, S. Horváth, M. Takáč, in:, The 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 2539–2547.","ieee":"R. Luo, S. U. Stich, S. Horváth, and M. Takáč, “Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis,” in <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, Mai Khao, Thailand, 2025, vol. 258, pp. 2539–2547."},"scopus_import":"1","intvolume":"       258","oa":1,"abstract":[{"text":"LocalSGD and SCAFFOLD are widely used methods in distributed stochastic optimization, with numerous applications in machine learning, large-scale data processing, and federated learning. However, rigorously establishing their theoretical advantages over simpler methods, such as minibatch SGD (MbSGD), has proven challenging, as existing analyses often rely on strong assumptions, unrealistic premises, or overly restrictive scenarios.\r\n\r\nIn this work, we revisit the convergence properties of LocalSGD and SCAFFOLD under a variety of existing or weaker conditions, including gradient similarity, Hessian similarity, weak convexity, and Lipschitz continuity of the Hessian. Our analysis shows that (i) LocalSGD achieves faster convergence compared to MbSGD for weakly convex functions without requiring stronger gradient similarity assumptions; (ii) LocalSGD benefits significantly from higher-order similarity and smoothness; and (iii) SCAFFOLD demonstrates faster convergence than MbSGD for a broader class of non-quadratic functions. These theoretical insights provide a clearer understanding of the conditions under which LocalSGD and SCAFFOLD outperform MbSGD.","lang":"eng"}],"conference":{"location":"Mai Khao, Thailand","name":"AISTATS: Conference on Artificial Intelligence and Statistics","end_date":"2025-05-05","start_date":"2025-05-03"},"article_processing_charge":"No","acknowledgement":"The authors thank for the helpful discussions with Eduard Gorbunov, Kumar Kshitij Patel, Anton\r\nRodomanov, and Ali Zindari during the preparation of this work. This work was partially done during the first author’s stays at CISPA and at MBZUAI. The first author also acknowledges ERC CoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/COE12.","status":"public","volume":258,"author":[{"first_name":"Ruichen","full_name":"Luo, Ruichen","last_name":"Luo","id":"b391db08-1ffe-11ee-8b67-d18ddcfb5a14"},{"full_name":"Stich, Sebastian U.","last_name":"Stich","first_name":"Sebastian U."},{"first_name":"Samuel","last_name":"Horváth","full_name":"Horváth, Samuel"},{"full_name":"Takáč, Martin","last_name":"Takáč","first_name":"Martin"}],"external_id":{"arxiv":["2501.04443"]},"date_published":"2025-05-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"2539-2547","publication":"The 28th International Conference on Artificial Intelligence and Statistics","language":[{"iso":"eng"}],"year":"2025"},{"OA_place":"repository","publication_identifier":{"eissn":["2640-3498"]},"_id":"20303","department":[{"_id":"FrLo"}],"title":"Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding","date_updated":"2025-09-09T07:47:13Z","OA_type":"green","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2410.12300"}],"month":"05","arxiv":1,"type":"conference","publisher":"ML Research Press","publication_status":"published","oa_version":"Preprint","scopus_import":"1","quality_controlled":"1","citation":{"short":"S. Huang, N. Pfister, J. Bowden, in:, The 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 3394–3402.","ieee":"S. Huang, N. Pfister, and J. Bowden, “Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding,” in <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, Mai Khao, Thailand, 2025, vol. 258, pp. 3394–3402.","ama":"Huang S, Pfister N, Bowden J. Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding. In: <i>The 28th International Conference on Artificial Intelligence and Statistics</i>. Vol 258. ML Research Press; 2025:3394-3402.","chicago":"Huang, Shimeng, Niklas Pfister, and Jack Bowden. “Sparse Causal Effect Estimation Using Two-Sample Summary Statistics in the Presence of Unmeasured Confounding.” In <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, 258:3394–3402. ML Research Press, 2025.","mla":"Huang, Shimeng, et al. “Sparse Causal Effect Estimation Using Two-Sample Summary Statistics in the Presence of Unmeasured Confounding.” <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, vol. 258, ML Research Press, 2025, pp. 3394–402.","apa":"Huang, S., Pfister, N., &#38; Bowden, J. (2025). Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding. In <i>The 28th International Conference on Artificial Intelligence and Statistics</i> (Vol. 258, pp. 3394–3402). Mai Khao, Thailand: ML Research Press.","ista":"Huang S, Pfister N, Bowden J. 2025. Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding. The 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 3394–3402."},"date_created":"2025-09-07T22:01:35Z","alternative_title":["PMLR"],"day":"01","intvolume":"       258","abstract":[{"lang":"eng","text":"Observational genome-wide association studies are now widely used for causal inference in genetic epidemiology. To maintain privacy, such data is often only publicly available as summary statistics, and often studies for the endogenous covariates and the outcome are available separately. This has necessitated methods tailored to two-sample summary statistics. Current state-of-the-art methods modify linear instrumental variable (IV) regression---with genetic variants as instruments---to account for unmeasured confounding. However, since the endogenous covariates can be high dimensional, standard IV assumptions are generally insufficient to identify all causal effects simultaneously. We ensure identifiability by assuming the causal effects are sparse and propose a sparse causal effect two-sample IV estimator, spaceTSIV, adapting the spaceIV estimator by Pfister and Peters (2022) for two-sample summary statistics. We provide two methods, based on L0- and L1-penalization, respectively. We prove identifiability of the sparse causal effects in the two-sample setting and consistency of spaceTSIV. The performance of spaceTSIV is compared with existing two-sample IV methods in simulations. Finally, we showcase our methods using real proteomic and gene-expression data for drug-target discovery."}],"oa":1,"article_processing_charge":"No","conference":{"name":"AISTATS: Conference on Artificial Intelligence and Statistics","location":"Mai Khao, Thailand","end_date":"2025-05-05","start_date":"2025-05-03"},"acknowledgement":"The authors would like to thank Stephen Burgess and Ashish Patel for helpful discussions at\r\nthe start of this research project, and Anton Rask Lundborg for helpful discussions on the\r\nuniform asymptotic results. This work was partially completed during SH’s research visit at\r\nNovo Nordisk. The authors would like to thank Jesper Ferkinghoff-Borg, Kang Li and Lewis\r\nMarsh for facilitating this visit and for discussing necessary concepts and tools in statistical\r\ngenetics at an early stage. SH and NP are supported by a research grant (0069071) from Novo\r\nNordisk Fonden. JB is funded at the University of Exeter by research grant MR/X011372/1.","status":"public","date_published":"2025-05-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2410.12300"]},"author":[{"first_name":"Shimeng","orcid":"0000-0001-6919-821X","full_name":"Huang, Shimeng","last_name":"Huang","id":"989c2a06-fb4e-11ef-a992-ab766442255b"},{"first_name":"Niklas","full_name":"Pfister, Niklas","last_name":"Pfister"},{"first_name":"Jack","last_name":"Bowden","full_name":"Bowden, Jack"}],"volume":258,"language":[{"iso":"eng"}],"page":"3394-3402","publication":"The 28th International Conference on Artificial Intelligence and Statistics","year":"2025"},{"status":"public","acknowledgement":"We thank Oded Farago, Angelo Cacciuto, Jeriann Beiter and Pietro Sillano for helpful discussions and a critical reading of the manuscript. MMB and AP acknowledge funding by the European Unions Horizon 2020 research and innovation programme under Marie Skłodowska-Curie Grant Agreement No. 101034413. FF acknowledges financial support by the NOMIS foundation. BM and AŠ acknowledge funding by ERC Starting Grant “NEPA” 802960. MA and AŠ acknowledge funding by the Volkswagen Foundation Grant Az 96727.","date_published":"2025-07-28T00:00:00Z","file":[{"date_updated":"2025-12-30T10:16:40Z","relation":"main_file","file_id":"20912","creator":"dernst","file_size":4841140,"file_name":"2025_SoftMatter_MunozBasagoiti.pdf","success":1,"date_created":"2025-12-30T10:16:40Z","content_type":"application/pdf","access_level":"open_access","checksum":"590bedad19b6f6d40a7ee036a056a6d9"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Muñoz Basagoiti, Maitane","orcid":"0000-0003-1483-1457","last_name":"Muñoz Basagoiti","id":"1a8a7950-82cd-11ed-bd4f-9624c913a607","first_name":"Maitane"},{"first_name":"Felix F","id":"a0270b37-8f1a-11ec-95c7-8e710c59a4f3","last_name":"Frey","full_name":"Frey, Felix F","orcid":"0000-0001-8501-6017"},{"last_name":"Meadowcroft","id":"a4725fd6-932b-11ed-81e2-c098c7f37ae1","full_name":"Meadowcroft, Billie","orcid":"0000-0003-3441-1337","first_name":"Billie"},{"full_name":"Santana de Freitas Amaral, Miguel","last_name":"Santana de Freitas Amaral","id":"4f2d02dd-47a9-11ec-ad10-82820ed3f501","first_name":"Miguel"},{"first_name":"Adam","last_name":"Prada","id":"a43ed60a-dd22-11ed-9bf7-b34133792ea9","full_name":"Prada, Adam"},{"last_name":"Šarić","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","orcid":"0000-0002-7854-2139","full_name":"Šarić, Anđela","first_name":"Anđela"}],"external_id":{"isi":["001562846800001"],"arxiv":["2502.09798"]},"volume":21,"publication":"Soft Matter","language":[{"iso":"eng"}],"page":"7736-7756","issue":"40","year":"2025","scopus_import":"1","citation":{"ama":"Muñoz Basagoiti M, Frey FF, Meadowcroft B, Santana de Freitas Amaral M, Prada A, Šarić A. A tutorial for mesoscale computer simulations of lipid membranes: Tether pulling, tubulation and fluctuations. <i>Soft Matter</i>. 2025;21(40):7736-7756. doi:<a href=\"https://doi.org/10.1039/d5sm00148j\">10.1039/d5sm00148j</a>","short":"M. Muñoz Basagoiti, F.F. Frey, B. Meadowcroft, M. Santana de Freitas Amaral, A. Prada, A. Šarić, Soft Matter 21 (2025) 7736–7756.","ieee":"M. Muñoz Basagoiti, F. F. Frey, B. Meadowcroft, M. Santana de Freitas Amaral, A. Prada, and A. Šarić, “A tutorial for mesoscale computer simulations of lipid membranes: Tether pulling, tubulation and fluctuations,” <i>Soft Matter</i>, vol. 21, no. 40. Royal Society of Chemistry, pp. 7736–7756, 2025.","ista":"Muñoz Basagoiti M, Frey FF, Meadowcroft B, Santana de Freitas Amaral M, Prada A, Šarić A. 2025. A tutorial for mesoscale computer simulations of lipid membranes: Tether pulling, tubulation and fluctuations. Soft Matter. 21(40), 7736–7756.","chicago":"Muñoz Basagoiti, Maitane, Felix F Frey, Billie Meadowcroft, Miguel Santana de Freitas Amaral, Adam Prada, and Anđela Šarić. “A Tutorial for Mesoscale Computer Simulations of Lipid Membranes: Tether Pulling, Tubulation and Fluctuations.” <i>Soft Matter</i>. Royal Society of Chemistry, 2025. <a href=\"https://doi.org/10.1039/d5sm00148j\">https://doi.org/10.1039/d5sm00148j</a>.","apa":"Muñoz Basagoiti, M., Frey, F. F., Meadowcroft, B., Santana de Freitas Amaral, M., Prada, A., &#38; Šarić, A. (2025). A tutorial for mesoscale computer simulations of lipid membranes: Tether pulling, tubulation and fluctuations. <i>Soft Matter</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/d5sm00148j\">https://doi.org/10.1039/d5sm00148j</a>","mla":"Muñoz Basagoiti, Maitane, et al. “A Tutorial for Mesoscale Computer Simulations of Lipid Membranes: Tether Pulling, Tubulation and Fluctuations.” <i>Soft Matter</i>, vol. 21, no. 40, Royal Society of Chemistry, 2025, pp. 7736–56, doi:<a href=\"https://doi.org/10.1039/d5sm00148j\">10.1039/d5sm00148j</a>."},"date_created":"2025-09-10T05:34:36Z","quality_controlled":"1","corr_author":"1","day":"28","intvolume":"        21","doi":"10.1039/d5sm00148j","abstract":[{"lang":"eng","text":"Lipid membranes and membrane deformations are a long-standing area of research in soft matter and biophysics. Computer simulations have complemented analytical and experimental approaches as one of the pillars in the field. However, setting up and using membrane simulations can come with barriers due to the multidisciplinary effort involved and the vast choice of existing simulations models. In this review, we introduce the non-expert reader to coarse-grained membrane simulations at the mesoscale. Firstly, we give a concise overview of the modelling approaches to study fluid membranes, together with guidance to more specialized references. Secondly, we provide a conceptual guide on how to develop mesoscale membrane simulations. Lastly, we construct a hands-on tutorial on how to apply mesoscale membrane simulations, by providing a pedagogical examination of membrane tether pulling, shape and mechanics of membrane tubes, and membrane fluctuations with three different membrane models, and discussing them in terms of their scope and how resource-intensive they are. To ease the reader's venture into the field, we provide a repository with ready-to-run tutorials."}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","ddc":["540"],"file_date_updated":"2025-12-30T10:16:40Z","oa":1,"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","OA_type":"hybrid","month":"07","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"},{"_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","grant_number":"802960","call_identifier":"H2020"},{"_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A","name":"NOMIS Fellowship Program"},{"_id":"eba0f67c-77a9-11ec-83b8-cc8501b3e222","name":"The evolution of trafficking: from archaea to eukaryotes","grant_number":"96752"}],"article_type":"original","arxiv":1,"type":"journal_article","publisher":"Royal Society of Chemistry","publication_status":"published","oa_version":"Published Version","isi":1,"OA_place":"publisher","publication_identifier":{"eissn":["1744-6848"],"issn":["1744-683X"]},"ec_funded":1,"_id":"20318","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"title":"A tutorial for mesoscale computer simulations of lipid membranes: Tether pulling, tubulation and fluctuations","department":[{"_id":"AnSa"}],"date_updated":"2025-12-30T10:16:52Z"},{"date_updated":"2025-09-10T08:14:28Z","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"title":"An assessment of representing land‐ocean heterogeneity via CAPE relaxation timescale in the Community Atmospheric Model 6 (CAM6)","department":[{"_id":"CaMu"}],"ec_funded":1,"_id":"20319","publication_identifier":{"eissn":["1942-2466"]},"acknowledged_ssus":[{"_id":"ScienComp"}],"OA_place":"publisher","oa_version":"Published Version","type":"journal_article","publisher":"Wiley","publication_status":"published","article_type":"original","month":"09","project":[{"_id":"629205d8-2b32-11ec-9570-e1356ff73576","name":"Organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate","call_identifier":"H2020","grant_number":"805041"}],"OA_type":"gold","has_accepted_license":"1","DOAJ_listed":"1","article_processing_charge":"Yes","article_number":"e2025MS005035","file_date_updated":"2025-09-10T08:12:34Z","oa":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":[{"text":"The time needed by deep convection to bring the atmosphere back to equilibrium is called convective adjustment timescale or simply adjustment timescale, typically denoted by . In the Community Atmospheric Model|Community Atmosphere Model (CAM),  is the convective available potential energy (CAPE) relaxation timescale and is 1 hr, worldwide. Observational evidence suggests that  is generally longer than 1 hr. Further, continental and oceanic convection are different in terms of the vigor of updrafts and can have different longevities. So using  hour worldwide in CAM has two potential caveats. A longer  improves the simulation of the mean climate. However, it does not address the land‐ocean heterogeneity of atmospheric deep convection. We investigate the prescription of two different CAPE relaxation timescales for land ( hr) and ocean ( to 4 hr). It is arguably an extremely crude parameterization of boundary layer control on atmospheric convection. We contrast a suite of 5‐year‐long simulations with two different  for land and ocean to having one  globally. The choice of longer  over ocean is guided by previous studies and inspired by observational pieces of evidence. Nonetheless, to complement our variable  experiments, we perform a simulation with  hr and  hrs. Most importantly, our key findings are immune to the exact values of prescribed  and . The CAM model, with two  values , improves convective‐stratiform rainfall partitioning and the Madden–Julian oscillation propagation characteristics.","lang":"eng"}],"ddc":["550"],"doi":"10.1029/2025ms005035","intvolume":"        17","day":"01","corr_author":"1","scopus_import":"1","citation":{"ista":"GOSWAMI BB, Polesello A, Muller CJ. 2025. An assessment of representing land‐ocean heterogeneity via CAPE relaxation timescale in the Community Atmospheric Model 6 (CAM6). Journal of Advances in Modeling Earth Systems. 17(9), e2025MS005035.","apa":"GOSWAMI, B. B., Polesello, A., &#38; Muller, C. J. (2025). An assessment of representing land‐ocean heterogeneity via CAPE relaxation timescale in the Community Atmospheric Model 6 (CAM6). <i>Journal of Advances in Modeling Earth Systems</i>. Wiley. <a href=\"https://doi.org/10.1029/2025ms005035\">https://doi.org/10.1029/2025ms005035</a>","chicago":"GOSWAMI, BIDYUT B, Andrea Polesello, and Caroline J Muller. “An Assessment of Representing Land‐ocean Heterogeneity via CAPE Relaxation Timescale in the Community Atmospheric Model 6 (CAM6).” <i>Journal of Advances in Modeling Earth Systems</i>. Wiley, 2025. <a href=\"https://doi.org/10.1029/2025ms005035\">https://doi.org/10.1029/2025ms005035</a>.","mla":"GOSWAMI, BIDYUT B., et al. “An Assessment of Representing Land‐ocean Heterogeneity via CAPE Relaxation Timescale in the Community Atmospheric Model 6 (CAM6).” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 17, no. 9, e2025MS005035, Wiley, 2025, doi:<a href=\"https://doi.org/10.1029/2025ms005035\">10.1029/2025ms005035</a>.","ama":"GOSWAMI BB, Polesello A, Muller CJ. An assessment of representing land‐ocean heterogeneity via CAPE relaxation timescale in the Community Atmospheric Model 6 (CAM6). <i>Journal of Advances in Modeling Earth Systems</i>. 2025;17(9). doi:<a href=\"https://doi.org/10.1029/2025ms005035\">10.1029/2025ms005035</a>","ieee":"B. B. GOSWAMI, A. Polesello, and C. J. Muller, “An assessment of representing land‐ocean heterogeneity via CAPE relaxation timescale in the Community Atmospheric Model 6 (CAM6),” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 17, no. 9. Wiley, 2025.","short":"B.B. GOSWAMI, A. Polesello, C.J. Muller, Journal of Advances in Modeling Earth Systems 17 (2025)."},"date_created":"2025-09-10T05:36:16Z","quality_controlled":"1","year":"2025","issue":"9","language":[{"iso":"eng"}],"publication":"Journal of Advances in Modeling Earth Systems","author":[{"last_name":"GOSWAMI","id":"3a4ac09c-6d61-11ec-bf66-884cde66b64b","full_name":"GOSWAMI, BIDYUT B","orcid":"0000-0001-8602-3083","first_name":"BIDYUT B"},{"last_name":"Polesello","id":"74c777f4-32da-11ee-b498-874db0835561","full_name":"Polesello, Andrea","first_name":"Andrea"},{"full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","last_name":"Muller","first_name":"Caroline J"}],"volume":17,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"2025_JAMES_Goswami.pdf","success":1,"file_size":2143025,"checksum":"5961d6290432c5ac0e8587ef07f30c9b","access_level":"open_access","content_type":"application/pdf","date_created":"2025-09-10T08:12:34Z","date_updated":"2025-09-10T08:12:34Z","creator":"dernst","file_id":"20338","relation":"main_file"}],"date_published":"2025-09-01T00:00:00Z","acknowledgement":"The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, Grant 805041). This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp). We would like to thank Prof. Courtney Schumacher and Dr. Aaron Funk of Texas A&M University for their help in understanding the TRMM Radar data. The authors are grateful to two anonymous reviewers who helped improve the quality of this paper.","status":"public"},{"department":[{"_id":"MaKw"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Beyond the pseudoforest strong Nine Dragon Tree theorem","date_updated":"2025-12-30T10:19:10Z","isi":1,"OA_place":"publisher","publication_identifier":{"issn":["0195-6698"]},"_id":"20320","arxiv":1,"type":"journal_article","publisher":"Elsevier","publication_status":"published","oa_version":"Published Version","PlanS_conform":"1","OA_type":"hybrid","month":"12","article_type":"original","abstract":[{"lang":"eng","text":"The pseudoforest version of the Strong Nine Dragon Tree Conjecture states that if a graph G has maximum average degree mad(G) = 2 maxH⊆G e(H)/v(H) at most 2(k + d/d+k+1), then it has a decomposition into k + 1 pseudoforests where in one pseudoforest F the components of F have at most d edges. This was proven in 2020 in Grout and Moore (2020). We strengthen this\r\ntheorem by showing that we can find such a decomposition where additionally F is acyclic, the diameter of the components of F is at most 2ℓ + 2, where ℓ =⌊d−1/k+1⌋, and at most 2ℓ + 1 if\r\nd ≡ 1 mod (k + 1). Furthermore, for any component K of F and any z ∈ N, we have diam(K) ≤ 2z if e(K) ≥ d − z(k − 1) + 1. We also show that both diameter bounds are best possible as an\r\nextension for both the Strong Nine Dragon Tree Conjecture for pseudoforests and its original conjecture for forests. In fact, they are still optimal even if we only enforce F to have any constant maximum degree, instead of enforcing every component of F to have at most d edges."}],"ddc":["500"],"file_date_updated":"2025-12-30T10:18:56Z","oa":1,"article_processing_charge":"Yes (via OA deal)","article_number":"104214","has_accepted_license":"1","scopus_import":"1","citation":{"ama":"Mies S, Moore B, Smith-Roberge E. Beyond the pseudoforest strong Nine Dragon Tree theorem. <i>European Journal of Combinatorics</i>. 2025;130(12). doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104214\">10.1016/j.ejc.2025.104214</a>","ieee":"S. Mies, B. Moore, and E. Smith-Roberge, “Beyond the pseudoforest strong Nine Dragon Tree theorem,” <i>European Journal of Combinatorics</i>, vol. 130, no. 12. Elsevier, 2025.","short":"S. Mies, B. Moore, E. Smith-Roberge, European Journal of Combinatorics 130 (2025).","ista":"Mies S, Moore B, Smith-Roberge E. 2025. Beyond the pseudoforest strong Nine Dragon Tree theorem. European Journal of Combinatorics. 130(12), 104214.","apa":"Mies, S., Moore, B., &#38; Smith-Roberge, E. (2025). Beyond the pseudoforest strong Nine Dragon Tree theorem. <i>European Journal of Combinatorics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ejc.2025.104214\">https://doi.org/10.1016/j.ejc.2025.104214</a>","chicago":"Mies, Sebastian, Benjamin Moore, and Evelyne Smith-Roberge. “Beyond the Pseudoforest Strong Nine Dragon Tree Theorem.” <i>European Journal of Combinatorics</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.ejc.2025.104214\">https://doi.org/10.1016/j.ejc.2025.104214</a>.","mla":"Mies, Sebastian, et al. “Beyond the Pseudoforest Strong Nine Dragon Tree Theorem.” <i>European Journal of Combinatorics</i>, vol. 130, no. 12, 104214, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104214\">10.1016/j.ejc.2025.104214</a>."},"date_created":"2025-09-10T05:36:50Z","quality_controlled":"1","day":"01","corr_author":"1","intvolume":"       130","doi":"10.1016/j.ejc.2025.104214","publication":"European Journal of Combinatorics","language":[{"iso":"eng"}],"issue":"12","year":"2025","acknowledgement":"This work was completed while Benjamin Moore was a postdoc at Charles University, supported by project 22-17398S (Flows and cycles in graphs on surfaces) of Czech Science Foundation, Czechia.","status":"public","date_published":"2025-12-01T00:00:00Z","file":[{"file_name":"2025_EuropJournCombinatorics_Mies.pdf","success":1,"file_size":737845,"checksum":"b1536e9256c4510a0e21452032e43a26","date_created":"2025-12-30T10:18:56Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2025-12-30T10:18:56Z","file_id":"20913","creator":"dernst","relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Sebastian","full_name":"Mies, Sebastian","last_name":"Mies"},{"first_name":"Benjamin","full_name":"Moore, Benjamin","last_name":"Moore","id":"6dc1a1be-bf1c-11ed-8d2b-d044840f49d6"},{"full_name":"Smith-Roberge, Evelyne","last_name":"Smith-Roberge","first_name":"Evelyne"}],"external_id":{"isi":["001529769300002"],"arxiv":["2310.00931"]},"volume":130},{"has_accepted_license":"1","article_number":"108068","article_processing_charge":"Yes (via OA deal)","oa":1,"file_date_updated":"2025-12-30T07:55:08Z","abstract":[{"text":"We establish several results combining discrete Morse theory and microlocal sheaf theory in the setting of finite posets and simplicial complexes. Our primary tool is a computationally tractable description of the bounded derived category of sheaves on a poset with the Alexandrov topology. We prove that each bounded complex of sheaves on a finite poset admits a unique (up to isomorphism of complexes) minimal injective resolution, and we provide algorithms for computing minimal injective resolution of an injective complex, as well as several useful functors between derived categories of sheaves. For the constant sheaf on a simplicial complex, we give asymptotically tight bounds on the complexity of computing the minimal injective resolution using those algorithms. Our main result is a novel definition of the discrete microsupport of a bounded complex of sheaves on a finite poset. We detail several foundational properties of the discrete microsupport, as well as a microlocal generalization of the discrete homological Morse theorem and Morse inequalities.","lang":"eng"}],"ddc":["510"],"doi":"10.1016/j.jpaa.2025.108068","related_material":{"record":[{"id":"18981","relation":"earlier_version","status":"public"}]},"intvolume":"       229","corr_author":"1","day":"01","quality_controlled":"1","citation":{"ama":"Brown A, Draganov O. Discrete microlocal Morse theory. <i>Journal of Pure and Applied Algebra</i>. 2025;229(10). doi:<a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">10.1016/j.jpaa.2025.108068</a>","short":"A. Brown, O. Draganov, Journal of Pure and Applied Algebra 229 (2025).","ieee":"A. Brown and O. Draganov, “Discrete microlocal Morse theory,” <i>Journal of Pure and Applied Algebra</i>, vol. 229, no. 10. Elsevier, 2025.","ista":"Brown A, Draganov O. 2025. Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. 229(10), 108068.","apa":"Brown, A., &#38; Draganov, O. (2025). Discrete microlocal Morse theory. <i>Journal of Pure and Applied Algebra</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">https://doi.org/10.1016/j.jpaa.2025.108068</a>","mla":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>Journal of Pure and Applied Algebra</i>, vol. 229, no. 10, 108068, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">10.1016/j.jpaa.2025.108068</a>.","chicago":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>Journal of Pure and Applied Algebra</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">https://doi.org/10.1016/j.jpaa.2025.108068</a>."},"date_created":"2025-09-10T05:40:09Z","scopus_import":"1","year":"2025","issue":"10","publication":"Journal of Pure and Applied Algebra","language":[{"iso":"eng"}],"volume":229,"author":[{"id":"70B7FDF6-608D-11E9-9333-8535E6697425","last_name":"Brown","full_name":"Brown, Adam","first_name":"Adam"},{"last_name":"Draganov","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0464-3823","full_name":"Draganov, Ondrej","first_name":"Ondrej"}],"external_id":{"arxiv":["2209.14993"]},"file":[{"file_size":3090836,"file_name":"2025_JourPureAppliedAlgebra_Brown.pdf","success":1,"date_created":"2025-12-30T07:55:08Z","access_level":"open_access","content_type":"application/pdf","checksum":"39bcad462278c9322ef810af7db67f56","date_updated":"2025-12-30T07:55:08Z","relation":"main_file","file_id":"20886","creator":"dernst"}],"date_published":"2025-10-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35","status":"public","date_updated":"2025-12-30T07:55:21Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"department":[{"_id":"HeEd"}],"title":"Discrete microlocal Morse theory","_id":"20323","ec_funded":1,"publication_identifier":{"issn":["0022-4049"]},"OA_place":"publisher","oa_version":"Published Version","type":"journal_article","publisher":"Elsevier","publication_status":"published","arxiv":1,"article_type":"original","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183"},{"call_identifier":"FWF","grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35"}],"month":"10","OA_type":"hybrid","PlanS_conform":"1"},{"doi":"10.1111/mec.70051","intvolume":"        34","day":"02","corr_author":"1","scopus_import":"1","date_created":"2025-09-10T05:42:23Z","quality_controlled":"1","citation":{"ieee":"T. Ellis, D. Field, and N. H. Barton, “Joint estimation of paternity, sibships and pollen dispersal in a snapdragon hybrid zone,” <i>Molecular Ecology</i>, vol. 34, no. 15. Wiley, 2025.","short":"T. Ellis, D. Field, N.H. Barton, Molecular Ecology 34 (2025).","ama":"Ellis T, Field D, Barton NH. Joint estimation of paternity, sibships and pollen dispersal in a snapdragon hybrid zone. <i>Molecular Ecology</i>. 2025;34(15). doi:<a href=\"https://doi.org/10.1111/mec.70051\">10.1111/mec.70051</a>","ista":"Ellis T, Field D, Barton NH. 2025. Joint estimation of paternity, sibships and pollen dispersal in a snapdragon hybrid zone. Molecular Ecology. 34(15), e70051.","mla":"Ellis, Thomas, et al. “Joint Estimation of Paternity, Sibships and Pollen Dispersal in a Snapdragon Hybrid Zone.” <i>Molecular Ecology</i>, vol. 34, no. 15, e70051, Wiley, 2025, doi:<a href=\"https://doi.org/10.1111/mec.70051\">10.1111/mec.70051</a>.","apa":"Ellis, T., Field, D., &#38; Barton, N. H. (2025). Joint estimation of paternity, sibships and pollen dispersal in a snapdragon hybrid zone. <i>Molecular Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/mec.70051\">https://doi.org/10.1111/mec.70051</a>","chicago":"Ellis, Thomas, David Field, and Nicholas H Barton. “Joint Estimation of Paternity, Sibships and Pollen Dispersal in a Snapdragon Hybrid Zone.” <i>Molecular Ecology</i>. Wiley, 2025. <a href=\"https://doi.org/10.1111/mec.70051\">https://doi.org/10.1111/mec.70051</a>."},"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","article_number":"e70051","file_date_updated":"2025-12-30T10:12:17Z","oa":1,"abstract":[{"text":"Inferring genealogical relationships of wild populations is useful because it gives direct estimates of mating patterns and variance in reproductive success. Inference can be improved by including information about parentage shared between siblings, or by modelling phenotypes or population data related to mating. However, we currently lack a framework to infer parent–offspring relationships, sibships and population parameters in a single analysis. To address this, we here extend a previous method, Fractional Analysis of Paternity and Sibships, to include population data for the case where one parent is known. We illustrate this with the example of pollen dispersal in a natural hybrid zone population of the snapdragon Antirrhinum majus. Pollen dispersal is leptokurtic, with half of mating events occurring within 30 m, but with a long tail of mating events up to 859 m. Using simulations, we find that both sibship and population information substantially improve pedigree reconstruction, and that we can expect to resolve median dispersal distances with high accuracy.","lang":"eng"}],"ddc":["570"],"author":[{"first_name":"Thomas","orcid":"0000-0002-8511-0254","full_name":"Ellis, Thomas","last_name":"Ellis","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Field, David","orcid":"0000-0002-4014-8478","id":"419049E2-F248-11E8-B48F-1D18A9856A87","last_name":"Field","first_name":"David"},{"last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H"}],"external_id":{"isi":["001542913000001"],"pmid":["40751392"]},"volume":34,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-09-02T00:00:00Z","file":[{"relation":"main_file","creator":"dernst","file_id":"20911","date_updated":"2025-12-30T10:12:17Z","access_level":"open_access","content_type":"application/pdf","date_created":"2025-12-30T10:12:17Z","checksum":"5059ad4d74e6327b84b5282a39d36774","file_size":1698605,"file_name":"2025_MolecularEcology_Ellis.pdf","success":1}],"acknowledgement":"We thank a large number of field volunteers for maintaining the population sampling, and Tom White for assistance with seed collection. We thank Sylvia Rebel for plating tissue for DNA extraction, as well as Sean Stankowski and two anonymous reviewers for feedback on the manuscript. ","status":"public","year":"2025","issue":"15","language":[{"iso":"eng"}],"publication":"Molecular Ecology","pmid":1,"_id":"20325","publication_identifier":{"eissn":["1365-294X"],"issn":["0962-1083"]},"isi":1,"OA_place":"publisher","date_updated":"2025-12-30T10:12:34Z","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"department":[{"_id":"NiBa"}],"title":"Joint estimation of paternity, sibships and pollen dispersal in a snapdragon hybrid zone","article_type":"original","month":"09","OA_type":"hybrid","oa_version":"Published Version","publisher":"Wiley","type":"journal_article","publication_status":"published"},{"publisher":"American Physical Society","type":"journal_article","publication_status":"published","oa_version":"Published Version","arxiv":1,"project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"month":"07","article_type":"original","OA_type":"hybrid","PlanS_conform":"1","date_updated":"2025-09-30T14:34:43Z","department":[{"_id":"MaSe"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Mass-assisted local deconfinement in a confined Z2 lattice gauge theory","_id":"20327","ec_funded":1,"OA_place":"publisher","isi":1,"publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"year":"2025","publication":"Physical Review B","language":[{"iso":"eng"}],"issue":"1","file":[{"checksum":"dd919bb9c4c233eba047af4262e02835","date_created":"2025-09-10T06:47:23Z","content_type":"application/pdf","access_level":"open_access","success":1,"file_name":"2025_PhysReviewB_Desaules.pdf","file_size":3458424,"file_id":"20333","creator":"dernst","relation":"main_file","date_updated":"2025-09-10T06:47:23Z"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2025-07-01T00:00:00Z","volume":112,"author":[{"first_name":"Jean-Yves Marc","orcid":"0000-0002-3749-6375","full_name":"Desaules, Jean-Yves Marc","id":"6c292945-a610-11ed-9eec-c3be1ad62a80","last_name":"Desaules"},{"first_name":"Thomas","full_name":"Iadecola, Thomas","last_name":"Iadecola"},{"last_name":"Halimeh","full_name":"Halimeh, Jad C.","first_name":"Jad C."}],"external_id":{"isi":["001530465500007"],"arxiv":["2404.11645"]},"acknowledgement":"The authors are grateful to Fiona Burnell, Gaurav Gyawali, Zlatko Papić, Elliot Rosenberg, Pedram Roushan, Michael Schecter, and Una Šlanka for insightful discussions. J.-Y.D. acknowledges funding from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant No. 101034413. T.I. acknowledges support from the National Science Foundation under Grant No. DMR-2143635. J.C.H. acknowledges funding by the Emmy Noether Programme of the German Research Foundation (DFG) under Grant No. HA 8206/1-1.s, the Max Planck Society, the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy–EXC-2111–390814868, and the European Research Council (ERC) under the European Union's Horizon Europe research and innovation program (Grant Agreement No. 101165667) ERC Starting Grant QuSiGauge. This work is part of the Quantum Computing for High-Energy Physics (QC4HEP) working group.","status":"public","article_number":"014301","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","ddc":["530"],"abstract":[{"lang":"eng","text":"Confinement is a prominent phenomenon in condensed-matter and high-energy physics that has recently become the focus of quantum-simulation experiments of lattice gauge theories (LGTs). As such, a theoretical understanding of the effect of confinement on LGT dynamics is not only of fundamental importance but also can lend itself to upcoming experiments. Here we show how confinement in a Z2 LGT can be  avoided by proximity to a resonance between the fermion mass and the electric field strength. Furthermore, we show that this local deconfinement can become global for certain initial conditions, where information transport occurs over the entire chain. In addition, we show how this can lead to strong quantum many-body scarring starting in different initial states. Our findings provide deeper insights into the nature of confinement in Z2 LGTs and can be tested on current and near-term quantum devices."}],"oa":1,"file_date_updated":"2025-09-10T06:47:23Z","related_material":{"record":[{"status":"public","relation":"research_data","id":"19791"}]},"intvolume":"       112","doi":"10.1103/mfg2-t6gb","date_created":"2025-09-10T05:44:47Z","citation":{"ista":"Desaules J-YM, Iadecola T, Halimeh JC. 2025. Mass-assisted local deconfinement in a confined Z2 lattice gauge theory. Physical Review B. 112(1), 014301.","mla":"Desaules, Jean-Yves Marc, et al. “Mass-Assisted Local Deconfinement in a Confined Z2 Lattice Gauge Theory.” <i>Physical Review B</i>, vol. 112, no. 1, 014301, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/mfg2-t6gb\">10.1103/mfg2-t6gb</a>.","apa":"Desaules, J.-Y. M., Iadecola, T., &#38; Halimeh, J. C. (2025). Mass-assisted local deconfinement in a confined Z2 lattice gauge theory. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/mfg2-t6gb\">https://doi.org/10.1103/mfg2-t6gb</a>","chicago":"Desaules, Jean-Yves Marc, Thomas Iadecola, and Jad C. Halimeh. “Mass-Assisted Local Deconfinement in a Confined Z2 Lattice Gauge Theory.” <i>Physical Review B</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/mfg2-t6gb\">https://doi.org/10.1103/mfg2-t6gb</a>.","ama":"Desaules J-YM, Iadecola T, Halimeh JC. Mass-assisted local deconfinement in a confined Z2 lattice gauge theory. <i>Physical Review B</i>. 2025;112(1). doi:<a href=\"https://doi.org/10.1103/mfg2-t6gb\">10.1103/mfg2-t6gb</a>","ieee":"J.-Y. M. Desaules, T. Iadecola, and J. C. Halimeh, “Mass-assisted local deconfinement in a confined Z2 lattice gauge theory,” <i>Physical Review B</i>, vol. 112, no. 1. American Physical Society, 2025.","short":"J.-Y.M. Desaules, T. Iadecola, J.C. Halimeh, Physical Review B 112 (2025)."},"quality_controlled":"1","scopus_import":"1","day":"01","corr_author":"1"},{"publication_identifier":{"issn":["1936-0851"],"eissn":["1936-086X"]},"isi":1,"OA_place":"publisher","pmid":1,"_id":"20329","department":[{"_id":"MaIb"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Prospects of nanoscience with nanocrystals: 2025 edition","date_updated":"2025-12-30T09:35:54Z","PlanS_conform":"1","OA_type":"hybrid","article_type":"review","project":[{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"month":"09","oa_version":"Published Version","type":"journal_article","publisher":"American Chemical Society","publication_status":"published","day":"03","corr_author":"1","scopus_import":"1","quality_controlled":"1","citation":{"ieee":"M. Ibáñez <i>et al.</i>, “Prospects of nanoscience with nanocrystals: 2025 edition,” <i>ACS Nano</i>, vol. 19, no. 36. American Chemical Society, pp. 31969–32051, 2025.","short":"M. Ibáñez, S.C. Boehme, R. Buonsanti, J. De Roo, D.J. Milliron, S. Ithurria, A.L. Rogach, A. Cabot, M. Yarema, B.M. Cossairt, P. Reiss, D.V. Talapin, L. Protesescu, Z. Hens, I. Infante, M.I. Bodnarchuk, X. Ye, Y. Wang, H. Zhang, E. Lhuillier, V.I. Klimov, H. Utzat, G. Rainò, C.R. Kagan, M. Cargnello, J.S. Son, M.V. Kovalenko, ACS Nano 19 (2025) 31969–32051.","ama":"Ibáñez M, Boehme SC, Buonsanti R, et al. Prospects of nanoscience with nanocrystals: 2025 edition. <i>ACS Nano</i>. 2025;19(36):31969–32051. doi:<a href=\"https://doi.org/10.1021/acsnano.5c07838\">10.1021/acsnano.5c07838</a>","mla":"Ibáñez, Maria, et al. “Prospects of Nanoscience with Nanocrystals: 2025 Edition.” <i>ACS Nano</i>, vol. 19, no. 36, American Chemical Society, 2025, pp. 31969–32051, doi:<a href=\"https://doi.org/10.1021/acsnano.5c07838\">10.1021/acsnano.5c07838</a>.","apa":"Ibáñez, M., Boehme, S. C., Buonsanti, R., De Roo, J., Milliron, D. J., Ithurria, S., … Kovalenko, M. V. (2025). Prospects of nanoscience with nanocrystals: 2025 edition. <i>ACS Nano</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsnano.5c07838\">https://doi.org/10.1021/acsnano.5c07838</a>","chicago":"Ibáñez, Maria, Simon C. Boehme, Raffaella Buonsanti, Jonathan De Roo, Delia J. Milliron, Sandrine Ithurria, Andrey L. Rogach, et al. “Prospects of Nanoscience with Nanocrystals: 2025 Edition.” <i>ACS Nano</i>. American Chemical Society, 2025. <a href=\"https://doi.org/10.1021/acsnano.5c07838\">https://doi.org/10.1021/acsnano.5c07838</a>.","ista":"Ibáñez M, Boehme SC, Buonsanti R, De Roo J, Milliron DJ, Ithurria S, Rogach AL, Cabot A, Yarema M, Cossairt BM, Reiss P, Talapin DV, Protesescu L, Hens Z, Infante I, Bodnarchuk MI, Ye X, Wang Y, Zhang H, Lhuillier E, Klimov VI, Utzat H, Rainò G, Kagan CR, Cargnello M, Son JS, Kovalenko MV. 2025. Prospects of nanoscience with nanocrystals: 2025 edition. ACS Nano. 19(36), 31969–32051."},"date_created":"2025-09-10T05:47:13Z","doi":"10.1021/acsnano.5c07838","intvolume":"        19","file_date_updated":"2025-12-30T09:35:44Z","oa":1,"ddc":["540"],"abstract":[{"text":"Nanocrystals (NCs) of various compositions have made important contributions to science and technology, with their impact recognized by the 2023 Nobel Prize in Chemistry for the discovery and synthesis of semiconductor quantum dots (QDs). Over four decades of research into NCs has led to numerous advancements in diverse fields, such as optoelectronics, catalysis, energy, medicine, and recently, quantum information and computing. The last 10 years since the predecessor perspective “Prospect of Nanoscience with Nanocrystals” was published in ACS Nano have seen NC research continuously evolve, yielding critical advances in fundamental understanding and practical applications. Mechanistic insights into NC formation have translated into precision control over NC size, shape, and composition. Emerging synthesis techniques have broadened the landscape of compounds obtainable in colloidal NC form. Sophistication in surface chemistry, jointly bolstered by theoretical models and experimental findings, has facilitated refined control over NC properties and represents a trusted gateway to enhanced NC stability and processability. The assembly of NCs into superlattices, along with two-dimensional (2D) photolithography and three-dimensional (3D) printing, has expanded their utility in creating materials with tailored properties. Applications of NCs are also flourishing, consolidating progress in fields targeted early on, such as optoelectronics and catalysis, and extending into areas ranging from quantum technology to phase-change memories. In this perspective, we review the extensive progress in research on NCs over the past decade and highlight key areas where future research may bring further breakthroughs.","lang":"eng"}],"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","acknowledgement":"This article was inspired by the discussions and presentations at the NaNaX10 (Nanoscience with Nanocrystals) conference held in the Institute of Science and Technology of Austria (ISTA), July 3–7, 2023. M.I. acknowledges financial support from the Werner Siemens Foundation (WSS) and Abayomi Lawal, Christine Fiedler, Ihor Cherniukh, Francesco Milillo, Navita Jakhar, and Magali Lorion for all their help in editing this manuscript. M.I. would also like to acknowledge Christine Fiedler for the design of the TOC. S.C.B. acknowledges Dr. Dmitry Dirin for proofreading and the Weizmann-ETH Zurich Bridge Program for financial support. A.C. thanks Linlin Yang for drafting Figure 6 and acknowledges support from the project Sydecat with reference PID2022-136883OB-C22 under MCIN/AEI/10.13039/501100011033/FEDER, UE, and to the Departament de Recerca i Universitats of the Generalitat de Catalunya (2021 SGR 01581). M.C. acknowledges support from the Sloan Foundation, BASF Corporation, the Novo Nordisk Foundation CO2 Research Center (CORC), and the US Department of Energy, Chemical Sciences, Geosciences and Biosciences Division of the Office of Basic Energy Sciences, via the SUNCAT Center for Interface Science and Catalysis. D.V.T. acknowledges support from the U.S. National Science Foundation under Grant Number CHE-2404291. V.I.K. acknowledges support by the Solar Photochemistry Program of the Chemical Sciences, Biosciences and Geosciences Division, Office of Basic Energy Sciences, Office of Science, U.S. Department of Energy (overview of studies of spin-exchange interactions in Mn-doped QDs) and the Laboratory Directed Research and Development (LDRD) program at Los Alamos National Laboratory under project 20250443ER (overview of QD optical gain and lasing studies). E.L. acknowledges financial from the ERC grant blackQD (grant no. 756225) and AQDtive (grant no. 101086358), and from French state funds managed by the ANR through the grants Bright (ANR-21-CE24-0012-02), MixDferro (ANR-21-CE09-0029), Quicktera (ANR-22-CE09-0018), E-map (ANR-23-CE50-0025), DIRAC (ANR-24-ASM1-0001), camIR (ANR-24-CE42-2757), and Piquant (ANR-24-CE09-0786). L.P. acknowledges financial support from SOLAR NL, funded by the National Growth Fund in The Netherlands. G.R. acknowledges funding from the Swiss National Science Foundation (Grant No. 200021_192308, “Q-Light─Engineered Quantum Light Sources with Nanocrystal Assemblies”). P.R. acknowledges funding from European Union’s Horizon research and innovation program under grant agreement 101135704 (HortiQD project) and from the French Research Agency ANR (grant ANR-24-CE09-0786-01 PIQUANT). A.L.R. acknowledges financial support from the Innovation and Technology Commission of Hong Kong (ITS/027/22MX), and from the Research Grant Council of Hong Kong SAR through the RGC Senior Research Fellow Scheme (SRFS 2324-1S04). J.S.S. acknowledges financial support from the National Research Foundation of Korea (NRF) grant funded by the Ministry of Science and ICT (2022R1A2C3009129). X.Y. acknowledges support from the U.S. National Science Foundation under awards DMR-2102526 and CBET-2223453. Y.W. acknowledges the support from the Science and Technology Program in Jiangsu Province (BK20232041) and the National Natural Science Foundation of China (22171132 and 52472165). M.Y. acknowledges funding by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant agreement No. 852751. I.I., Z.H. and M.K acknowledge the European Commission for funding (MSCA-DN Track The Twin, grant agreement 101168820). Z.H. acknowledges funding from the FWO-Vlaanderen (research projects G0B2921N and G0C5723N) and Ghent University (BOF-GOA 01G02124). H.Z. acknowledges W. Liu for editing Figure 19 and the financial support from Beijing Natural Science Foundation (JQ24003).","status":"public","external_id":{"isi":["001562960800001"],"pmid":["40902118"]},"author":[{"first_name":"Maria","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Simon C.","last_name":"Boehme","full_name":"Boehme, Simon C."},{"last_name":"Buonsanti","full_name":"Buonsanti, Raffaella","first_name":"Raffaella"},{"first_name":"Jonathan","full_name":"De Roo, Jonathan","last_name":"De Roo"},{"first_name":"Delia J.","full_name":"Milliron, Delia J.","last_name":"Milliron"},{"full_name":"Ithurria, Sandrine","last_name":"Ithurria","first_name":"Sandrine"},{"first_name":"Andrey L.","full_name":"Rogach, Andrey L.","last_name":"Rogach"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"},{"first_name":"Maksym","full_name":"Yarema, Maksym","last_name":"Yarema"},{"full_name":"Cossairt, Brandi M.","last_name":"Cossairt","first_name":"Brandi M."},{"last_name":"Reiss","full_name":"Reiss, Peter","first_name":"Peter"},{"full_name":"Talapin, Dmitri V.","last_name":"Talapin","first_name":"Dmitri V."},{"first_name":"Loredana","full_name":"Protesescu, Loredana","last_name":"Protesescu"},{"first_name":"Zeger","full_name":"Hens, Zeger","last_name":"Hens"},{"last_name":"Infante","full_name":"Infante, Ivan","first_name":"Ivan"},{"full_name":"Bodnarchuk, Maryna I.","last_name":"Bodnarchuk","first_name":"Maryna I."},{"full_name":"Ye, Xingchen","last_name":"Ye","first_name":"Xingchen"},{"first_name":"Yuanyuan","last_name":"Wang","full_name":"Wang, Yuanyuan"},{"full_name":"Zhang, Hao","last_name":"Zhang","first_name":"Hao"},{"full_name":"Lhuillier, Emmanuel","last_name":"Lhuillier","first_name":"Emmanuel"},{"first_name":"Victor I.","full_name":"Klimov, Victor I.","last_name":"Klimov"},{"first_name":"Hendrik","last_name":"Utzat","full_name":"Utzat, Hendrik"},{"full_name":"Rainò, Gabriele","last_name":"Rainò","first_name":"Gabriele"},{"first_name":"Cherie R.","last_name":"Kagan","full_name":"Kagan, Cherie R."},{"first_name":"Matteo","full_name":"Cargnello, Matteo","last_name":"Cargnello"},{"last_name":"Son","full_name":"Son, Jae Sung","first_name":"Jae Sung"},{"first_name":"Maksym V.","last_name":"Kovalenko","full_name":"Kovalenko, Maksym V."}],"volume":19,"date_published":"2025-09-03T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2025-12-30T09:35:44Z","file_id":"20909","creator":"dernst","relation":"main_file","file_name":"2025_ACSNano_Ibanez.pdf","success":1,"file_size":10956272,"checksum":"81144f848478a130721e9ffa87b6831e","date_created":"2025-12-30T09:35:44Z","content_type":"application/pdf","access_level":"open_access"}],"issue":"36","page":" 31969–32051","publication":"ACS Nano","language":[{"iso":"eng"}],"year":"2025"},{"_id":"20330","ec_funded":1,"publication_identifier":{"issn":["1943-2631"]},"OA_place":"publisher","isi":1,"date_updated":"2026-01-05T13:04:07Z","title":"The relationship between sexual dimorphism and intersex correlation: Do models support intuition?","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"department":[{"_id":"BeVi"},{"_id":"NiBa"}],"article_type":"original","month":"11","project":[{"_id":"9B9DFC9E-BA93-11EA-9121-9846C619BF3A","name":"Sexual conflict: resolution, constraints and biomedical implications","grant_number":"25817"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"name":"Understanding the evolution of continuous genomes","grant_number":"101055327","_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00"}],"OA_type":"hybrid","PlanS_conform":"1","oa_version":"Published Version","publisher":"Oxford University Press","publication_status":"published","type":"journal_article","doi":"10.1093/genetics/iyaf175","intvolume":"       231","day":"01","corr_author":"1","quality_controlled":"1","date_created":"2025-09-10T05:48:04Z","citation":{"ista":"Puixeu Sala G, Hayward L. 2025. The relationship between sexual dimorphism and intersex correlation: Do models support intuition? Genetics. 231(3), iyaf175.","apa":"Puixeu Sala, G., &#38; Hayward, L. (2025). The relationship between sexual dimorphism and intersex correlation: Do models support intuition? <i>Genetics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/genetics/iyaf175\">https://doi.org/10.1093/genetics/iyaf175</a>","mla":"Puixeu Sala, Gemma, and Laura Hayward. “The Relationship between Sexual Dimorphism and Intersex Correlation: Do Models Support Intuition?” <i>Genetics</i>, vol. 231, no. 3, iyaf175, Oxford University Press, 2025, doi:<a href=\"https://doi.org/10.1093/genetics/iyaf175\">10.1093/genetics/iyaf175</a>.","chicago":"Puixeu Sala, Gemma, and Laura Hayward. “The Relationship between Sexual Dimorphism and Intersex Correlation: Do Models Support Intuition?” <i>Genetics</i>. Oxford University Press, 2025. <a href=\"https://doi.org/10.1093/genetics/iyaf175\">https://doi.org/10.1093/genetics/iyaf175</a>.","short":"G. Puixeu Sala, L. Hayward, Genetics 231 (2025).","ieee":"G. Puixeu Sala and L. Hayward, “The relationship between sexual dimorphism and intersex correlation: Do models support intuition?,” <i>Genetics</i>, vol. 231, no. 3. Oxford University Press, 2025.","ama":"Puixeu Sala G, Hayward L. The relationship between sexual dimorphism and intersex correlation: Do models support intuition? <i>Genetics</i>. 2025;231(3). doi:<a href=\"https://doi.org/10.1093/genetics/iyaf175\">10.1093/genetics/iyaf175</a>"},"scopus_import":"1","has_accepted_license":"1","article_number":"iyaf175","article_processing_charge":"Yes (via OA deal)","oa":1,"file_date_updated":"2026-01-05T13:03:18Z","abstract":[{"lang":"eng","text":"The evolution of sexual dimorphism (the difference in average trait values between females and males, SD), is often thought to be constrained by shared genetic architecture between the sexes. Indeed, it is commonly expected that SD should negatively correlate with the intersex correlation (the genetic correlation between effects of segregating variants in females and males, r fm), either because (1) traits with ancestrally low r fm are less constrained in their ability to respond to sex-specific selection and thus evolve to be more dimorphic, or because (2) sex-specific selection, driving sexual dimorphism evolution, also acts to reduce r fm. Despite the intuitive appeal and prominence of these ideas, their generality and the conditions in which they hold remain unclear. Here, we develop models incorporating sex-specific stabilizing selection, mutation and genetic drift to examine the relationship between r fm and SD. We show that the two commonly-discussed mechanisms with the potential to generate a negative correlation between SD and r fm could just as easily generate a positive association, since the standard line of reasoning hinges on a hidden assumption that sex-specific adaptation more frequently favors increased dimorphism than reduced dimorphism. Our results provide, to our knowledge, the first mechanistic framework for understanding the conditions under which a correlation between r fm and SD may arise and offer a compelling explanation for inconsistent empirical evidence. We also make the intriguing observation that—even when selection between the two sexes is identical—drift generates nonzero SD. We quantify this effect and discuss its significance."}],"ddc":["570"],"volume":231,"external_id":{"isi":["001598595000001"]},"author":[{"id":"33AB266C-F248-11E8-B48F-1D18A9856A87","last_name":"Puixeu Sala","full_name":"Puixeu Sala, Gemma","orcid":"0000-0001-8330-1754","first_name":"Gemma"},{"first_name":"Laura","last_name":"Hayward","id":"fc885ee5-24bf-11eb-ad7b-bcc5104c0c1b","full_name":"Hayward, Laura"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-11-01T00:00:00Z","file":[{"content_type":"application/pdf","access_level":"open_access","date_created":"2026-01-05T13:03:18Z","checksum":"bbb73bbf8617812d4d8db4af92be9538","file_size":1550562,"success":1,"file_name":"2025_Genetics_Puixeu.pdf","relation":"main_file","creator":"dernst","file_id":"20946","date_updated":"2026-01-05T13:03:18Z"}],"acknowledgement":"We thank Tim Connallon for useful discussions and correspondence, Himani Sachdeva and Nick Barton for comments on the manuscript and the Scientific Computing unit at ISTA for technical support. GP is the recipient of a DOC Fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria (DOC 25817) and received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant (agreement no. 665385). LH received funding from the European Research Council, under the HaplotypeStructure Grant (grant no. 101055327) to Nick Barton.","status":"public","year":"2025","issue":"3","language":[{"iso":"eng"}],"publication":"Genetics"},{"OA_place":"publisher","acknowledged_ssus":[{"_id":"LifeSc"}],"isi":1,"publication_identifier":{"eissn":["1530-6992"],"issn":["1530-6984"]},"_id":"20331","pmid":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Tuning conductance in BODIPY-based single-molecule junctions","department":[{"_id":"LaVe"}],"date_updated":"2025-12-30T09:39:55Z","OA_type":"hybrid","PlanS_conform":"1","month":"08","article_type":"letter_note","publisher":"American Chemical Society","type":"journal_article","publication_status":"published","oa_version":"Published Version","citation":{"ista":"York E, Stone I, Shi W, Roy X, Venkataraman L. 2025. Tuning conductance in BODIPY-based single-molecule junctions. Nano Letters. 25(36), 13697–13702.","apa":"York, E., Stone, I., Shi, W., Roy, X., &#38; Venkataraman, L. (2025). Tuning conductance in BODIPY-based single-molecule junctions. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.5c03764\">https://doi.org/10.1021/acs.nanolett.5c03764</a>","chicago":"York, Emma, Ilana Stone, Wanzhuo Shi, Xavier Roy, and Latha Venkataraman. “Tuning Conductance in BODIPY-Based Single-Molecule Junctions.” <i>Nano Letters</i>. American Chemical Society, 2025. <a href=\"https://doi.org/10.1021/acs.nanolett.5c03764\">https://doi.org/10.1021/acs.nanolett.5c03764</a>.","mla":"York, Emma, et al. “Tuning Conductance in BODIPY-Based Single-Molecule Junctions.” <i>Nano Letters</i>, vol. 25, no. 36, American Chemical Society, 2025, pp. 13697–702, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.5c03764\">10.1021/acs.nanolett.5c03764</a>.","short":"E. York, I. Stone, W. Shi, X. Roy, L. Venkataraman, Nano Letters 25 (2025) 13697–13702.","ieee":"E. York, I. Stone, W. Shi, X. Roy, and L. Venkataraman, “Tuning conductance in BODIPY-based single-molecule junctions,” <i>Nano Letters</i>, vol. 25, no. 36. American Chemical Society, pp. 13697–13702, 2025.","ama":"York E, Stone I, Shi W, Roy X, Venkataraman L. Tuning conductance in BODIPY-based single-molecule junctions. <i>Nano Letters</i>. 2025;25(36):13697-13702. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.5c03764\">10.1021/acs.nanolett.5c03764</a>"},"quality_controlled":"1","date_created":"2025-09-10T05:48:29Z","scopus_import":"1","day":"25","corr_author":"1","intvolume":"        25","doi":"10.1021/acs.nanolett.5c03764","abstract":[{"lang":"eng","text":"Here, we present a foundational investigation of charge transport through three BODIPY-based molecules using the scanning tunneling microscope–break junction (STM-BJ) technique. We demonstrate that molecular conductance through the BODIPY core can be measured by introducing aurophilic linkers at the 2,6-positions. By varying these linkers, we systematically modulate the frontier molecular orbital energies and fine-tune transport behavior. Our experimental results are supported by DFT-based calculations, which feature a new computationally efficient correction to standard PBE-level transmission predictions. Together, these findings establish the viability of BODIPY-based systems for molecular junction applications and lay the groundwork for future studies of their single-molecule optoelectronic properties."}],"ddc":["540"],"oa":1,"file_date_updated":"2025-12-30T09:39:44Z","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","acknowledgement":"We thank the National Science Foundation (No. NSF-DMR 2241180) for supporting this research. Synthetic work at Columbia was funded in part by the Air Force Office of Scientific Research (AFOSR), under Grant No. FA9550-22-1-0389. The cryoprobe on the 500 MHz NMR instrument used in this research at Columbia was purchased through the NIH Award No. S10OD026749. This work was supported in part by the Institute of Science and Technology Austria. HRMS sample preparation, analysis, and data evaluation were performed by Aikaterina Paraskevopoulou, Mass Spec Service, LSF, ISTA.","status":"public","file":[{"date_updated":"2025-12-30T09:39:44Z","relation":"main_file","creator":"dernst","file_id":"20910","file_size":3144989,"file_name":"2025_NanoLetters_York.pdf","success":1,"access_level":"open_access","content_type":"application/pdf","date_created":"2025-12-30T09:39:44Z","checksum":"bac881601e1f33c3cf8f51d50b958e68"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-08-25T00:00:00Z","volume":25,"author":[{"last_name":"York","id":"08dde91e-8e0a-11f0-9d7d-9e8d80864f16","full_name":"York, Emma","first_name":"Emma"},{"full_name":"Stone, Ilana","last_name":"Stone","first_name":"Ilana"},{"first_name":"Wanzhuo","id":"a3010425-87c8-11f0-8106-bec32bea74da","last_name":"Shi","full_name":"Shi, Wanzhuo"},{"last_name":"Roy","full_name":"Roy, Xavier","first_name":"Xavier"},{"first_name":"Latha","last_name":"Venkataraman","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","orcid":"0000-0002-6957-6089","full_name":"Venkataraman, Latha"}],"external_id":{"isi":["001557017200001"],"pmid":["40855728"]},"page":"13697-13702","publication":"Nano Letters","language":[{"iso":"eng"}],"issue":"36","year":"2025"},{"article_type":"review","month":"12","PlanS_conform":"1","OA_type":"hybrid","oa_version":"Published Version","publisher":"Elsevier","publication_status":"published","type":"journal_article","pmid":1,"_id":"20349","publication_identifier":{"issn":["1084-9521"],"eissn":["1096-3634"]},"isi":1,"OA_place":"publisher","date_updated":"2025-12-30T10:21:13Z","department":[{"_id":"CaHe"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Decoding zebrafish oogenesis: From primordial germ cell development to fertilization","external_id":{"isi":["001567260100001"],"pmid":["40913907"]},"author":[{"last_name":"Hofmann","id":"b88d43f2-dc74-11ea-a0a7-e41b7912e031","full_name":"Hofmann, Laura","first_name":"Laura"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J"}],"volume":175,"date_published":"2025-12-01T00:00:00Z","file":[{"checksum":"80ea6cbb004853bb1e87db3422a74aca","content_type":"application/pdf","access_level":"open_access","date_created":"2025-12-30T10:21:00Z","success":1,"file_name":"2025_SemCellDevBiology_Hofmann.pdf","file_size":2778561,"creator":"dernst","file_id":"20914","relation":"main_file","date_updated":"2025-12-30T10:21:00Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We thank Carolina Camelo for making schematics for this review.","status":"public","year":"2025","publication":"Seminars in Cell and Developmental Biology","language":[{"iso":"eng"}],"doi":"10.1016/j.semcdb.2025.103650","intvolume":"       175","corr_author":"1","day":"01","scopus_import":"1","quality_controlled":"1","date_created":"2025-09-14T22:01:32Z","citation":{"apa":"Hofmann, L., &#38; Heisenberg, C.-P. J. (2025). Decoding zebrafish oogenesis: From primordial germ cell development to fertilization. <i>Seminars in Cell and Developmental Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.semcdb.2025.103650\">https://doi.org/10.1016/j.semcdb.2025.103650</a>","mla":"Hofmann, Laura, and Carl-Philipp J. Heisenberg. “Decoding Zebrafish Oogenesis: From Primordial Germ Cell Development to Fertilization.” <i>Seminars in Cell and Developmental Biology</i>, vol. 175, 103650, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.semcdb.2025.103650\">10.1016/j.semcdb.2025.103650</a>.","chicago":"Hofmann, Laura, and Carl-Philipp J Heisenberg. “Decoding Zebrafish Oogenesis: From Primordial Germ Cell Development to Fertilization.” <i>Seminars in Cell and Developmental Biology</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.semcdb.2025.103650\">https://doi.org/10.1016/j.semcdb.2025.103650</a>.","ista":"Hofmann L, Heisenberg C-PJ. 2025. Decoding zebrafish oogenesis: From primordial germ cell development to fertilization. Seminars in Cell and Developmental Biology. 175, 103650.","short":"L. Hofmann, C.-P.J. Heisenberg, Seminars in Cell and Developmental Biology 175 (2025).","ieee":"L. Hofmann and C.-P. J. Heisenberg, “Decoding zebrafish oogenesis: From primordial germ cell development to fertilization,” <i>Seminars in Cell and Developmental Biology</i>, vol. 175. Elsevier, 2025.","ama":"Hofmann L, Heisenberg C-PJ. Decoding zebrafish oogenesis: From primordial germ cell development to fertilization. <i>Seminars in Cell and Developmental Biology</i>. 2025;175. doi:<a href=\"https://doi.org/10.1016/j.semcdb.2025.103650\">10.1016/j.semcdb.2025.103650</a>"},"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","article_number":"103650","file_date_updated":"2025-12-30T10:21:00Z","oa":1,"ddc":["570"],"abstract":[{"text":"Oogenesis – the formation and development of an oocyte – is fundamental to reproduction and embryonic development. Due to its accessibility to genetic manipulations and the ability to culture and experimentally manipulate oocytes ex vivo, zebrafish has emerged as a powerful vertebrate model system for studying oogenesis. In this review, we provide a comprehensive overview of zebrafish oogenesis, from early germ cell formation to oocyte maturation and fertilization. We discuss recent advances in uncovering the molecular and cellular mechanisms driving this complex process and highlight key knowledge gaps that remain to be addressed.","lang":"eng"}]},{"department":[{"_id":"LiBu"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Interior rotation modelling of the β Cep pulsator HD 192575 including multiplet asymmetries","date_updated":"2026-02-16T12:12:53Z","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"isi":1,"OA_place":"publisher","ec_funded":1,"_id":"20350","arxiv":1,"oa_version":"Published Version","publication_status":"published","publisher":"EDP Sciences","type":"journal_article","PlanS_conform":"1","OA_type":"diamond","article_type":"original","project":[{"grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"},{"_id":"914d8549-16d5-11f0-9cad-bbe6324c93a9","name":"Unveiling the mysteries of stellar dynamics: a pioneering journey in magnetoasteroseismology","grant_number":"101165631"}],"month":"09","file_date_updated":"2025-09-15T06:58:09Z","oa":1,"abstract":[{"text":"Context. Rotation plays an important role in stellar evolution. However, the mechanisms behind the transport of angular momentum in stars at various stages of their evolution are not well understood. To improve our understanding of these processes, it is necessary to measure and validate the internal rotation profiles of stars across different stages of evolution and mass regimes.\r\nAims. Our aim is to constrain the internal rotation profile of the 12-M⊙ β Cep pulsator HD 192575 from the observed pulsational multiplets and the asymmetries of their component frequencies.\r\nMethods. We updated the forward asteroseismic modelling of HD 192575 based on new TESS observations. We inverted the rotation profile from the symmetric part of the splittings and computed the multiplet asymmetries due to the Coriolis force and stellar deformation, which we treated perturbatively. We compared the computed asymmetries with the observed asymmetries.\r\nResults. Our new forward asteroseismic modelling is in agreement with previous results but with increased uncertainties, partially due to increased frequency precision, which required us to relax certain constraints. Ambiguity in the mode identification is the main source of the uncertainty, which also affects the inferred rotation profiles. Almost all acceptable rotation profiles occur in the regime below 0.4 d−1 and favour weak radial differential rotation, with a ratio of core to envelope rotation of less than 2. We find that the quality of the match between the observed and theoretically predicted mode asymmetries is strongly dependent on the mode identification and the internal structure of the star.\r\nConclusions. Our results offer the first detailed rotation inversion for a β Cep pulsator. They show that the rotation profile and the mode asymmetries provide a valuable tool for further constraining the evolutionary properties of HD 192575, and in particular the details of angular momentum transport in massive stars.","lang":"eng"}],"ddc":["520"],"has_accepted_license":"1","article_processing_charge":"No","article_number":"A5","day":"01","scopus_import":"1","date_created":"2025-09-14T22:01:32Z","citation":{"ama":"Vanlaer V, Bowman DM, Burssens S, et al. Interior rotation modelling of the β Cep pulsator HD 192575 including multiplet asymmetries. <i>Astronomy &#38; Astrophysics</i>. 2025;701. doi:<a href=\"https://doi.org/10.1051/0004-6361/202452885\">10.1051/0004-6361/202452885</a>","ieee":"V. Vanlaer <i>et al.</i>, “Interior rotation modelling of the β Cep pulsator HD 192575 including multiplet asymmetries,” <i>Astronomy &#38; Astrophysics</i>, vol. 701. EDP Sciences, 2025.","short":"V. Vanlaer, D.M. Bowman, S. Burssens, S.B. Das, L.A. Bugnet, S. Mathis, C. Aerts, Astronomy &#38; Astrophysics 701 (2025).","mla":"Vanlaer, V., et al. “Interior Rotation Modelling of the β Cep Pulsator HD 192575 Including Multiplet Asymmetries.” <i>Astronomy &#38; Astrophysics</i>, vol. 701, A5, EDP Sciences, 2025, doi:<a href=\"https://doi.org/10.1051/0004-6361/202452885\">10.1051/0004-6361/202452885</a>.","chicago":"Vanlaer, V., D. M. Bowman, S. Burssens, Srijan B Das, Lisa Annabelle Bugnet, S. Mathis, and C. Aerts. “Interior Rotation Modelling of the β Cep Pulsator HD 192575 Including Multiplet Asymmetries.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2025. <a href=\"https://doi.org/10.1051/0004-6361/202452885\">https://doi.org/10.1051/0004-6361/202452885</a>.","apa":"Vanlaer, V., Bowman, D. M., Burssens, S., Das, S. B., Bugnet, L. A., Mathis, S., &#38; Aerts, C. (2025). Interior rotation modelling of the β Cep pulsator HD 192575 including multiplet asymmetries. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202452885\">https://doi.org/10.1051/0004-6361/202452885</a>","ista":"Vanlaer V, Bowman DM, Burssens S, Das SB, Bugnet LA, Mathis S, Aerts C. 2025. Interior rotation modelling of the β Cep pulsator HD 192575 including multiplet asymmetries. Astronomy &#38; Astrophysics. 701, A5."},"quality_controlled":"1","doi":"10.1051/0004-6361/202452885","intvolume":"       701","publication":"Astronomy & Astrophysics","language":[{"iso":"eng"}],"year":"2025","acknowledgement":"The authors appreciated the critical comments from the\r\nreferee, which encouraged V.V. to embark upon a new code development\r\nsprint. V.V. gratefully acknowledges support from the Research Foundation\r\nFlanders (FWO) under grant agreement N◦1156923N (PhD Fellowship) and\r\nN\r\n◦K233724N (Travel grant). D.M.B. gratefully acknowledges support from\r\nthe Research Foundation Flanders (FWO; grant number: 1286521N), and UK\r\nResearch and Innovation (UKRI) in the form of a Frontier Research grant under\r\nthe UK government’s ERC Horizon Europe funding guarantee (SYMPHONY;\r\ngrant number: EP/Y031059/1), and a Royal Society University Research Fellowship (URF; grant number: URF\\R1\\231631). S.B.D. acknowledges funding from\r\nthe European Union’s Horizon 2020 research and innovation programme under\r\nthe Marie Skłodowska-Curie grant agreement No 101034413. L.B. gratefully\r\nacknowledges support from the European Research Council (ERC) under the\r\nHorizon Europe programme (Calcifer; Starting Grant agreement N◦101165631).\r\nS.M. acknowledges support from the PLATO CNES grant at CEA/DAp.C.A.\r\nacknowledges financial support from the Research Foundation Flanders (FWO)\r\nunder grant K802922N (Sabbatical leave); she is grateful for the kind hospitality\r\noffered by CEA/Saclay during her sabbatical work visits in the spring of 2023.\r\nThe research leading to these results has received funding from the European\r\nResearch Council (ERC) under the Horizon Europe programme (Synergy Grant\r\nagreement N◦101071505: 4D-STAR). While funded by the European Union,\r\nviews and opinions expressed are however those of the author(s) only and do\r\nnot necessarily reflect those of the European Union or the European Research\r\nCouncil. Neither the European Union nor the granting authority can be held\r\nresponsible for them. The TESS data presented in this paper were obtained from\r\nthe Mikulski Archive for Space Telescopes (MAST) at the Space Telescope Science Institute (STScI), which is operated by the Association of Universities for\r\nResearch in Astronomy, Inc., under NASA contract NAS5-26555. Support to\r\nMAST for these data is provided by the NASA Office of Space Science via grant\r\nNAG5-7584 and by other grants and contracts. Funding for the TESS mission\r\nwas provided by the NASA Explorer Program.","status":"public","external_id":{"arxiv":["2506.19948"],"isi":["001561561200007"]},"author":[{"first_name":"V.","last_name":"Vanlaer","full_name":"Vanlaer, V."},{"last_name":"Bowman","full_name":"Bowman, D. M.","first_name":"D. M."},{"first_name":"S.","full_name":"Burssens, S.","last_name":"Burssens"},{"first_name":"Srijan B","id":"9ce7c423-dacf-11ed-8942-e09c6cb27149","last_name":"Das","orcid":"0000-0003-0896-7972","full_name":"Das, Srijan B"},{"first_name":"Lisa Annabelle","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","last_name":"Bugnet"},{"first_name":"S.","last_name":"Mathis","full_name":"Mathis, S."},{"full_name":"Aerts, C.","last_name":"Aerts","first_name":"C."}],"volume":701,"file":[{"checksum":"9ee9f34cf86305602d6cb3e07a1cc1a6","content_type":"application/pdf","access_level":"open_access","date_created":"2025-09-15T06:58:09Z","success":1,"file_name":"2025_AstronomyAstrophysics_Vanlaer.pdf","file_size":3175077,"creator":"dernst","file_id":"20354","relation":"main_file","date_updated":"2025-09-15T06:58:09Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-09-01T00:00:00Z"},{"issue":"35","page":"eadx2893","publication":"Science Advances","language":[{"iso":"eng"}],"year":"2025","status":"public","acknowledgement":"We thank A.-M. Lawrence-Dörner and B. Berkenfeld for technical assistance and the members of the Kümmel Lab for constructive feedback. We are grateful to C. Ungermann and L. Langemeyer for insightful discussions and to F. Barr for providing plasmids encoding Fuzzy, Inturned, Rab23, and Rsg1. The template clone Flag-ciBAR1 was a gift from K.-I. Takemaru (Addgene, plasmid #200440). We thank the Bloomington Drosophila Stock center (BDSC) and DSHB for providing fly stocks and antibodies. This work was supported by the German Research Foundation (DFG) through the grants SFB1557-P10 (D.K.), SFB1557-P11 (A.M.), and SFB1577-P6, PA517/12-2, PA517/14-1, PA517/15-1, and PA517/16-1 (A.P.). Cryo-EM data were collected at the infrastructure of the University of Osnabrück, funded by the DFG (project number 455249646). J.-H.S. was supported by the Friedrich-Ebert Foundation. M.L. acknowledges funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement number 101045340).","author":[{"first_name":"Stephan","last_name":"Wilmes","full_name":"Wilmes, Stephan"},{"last_name":"Tönjes","full_name":"Tönjes, Jesse","first_name":"Jesse"},{"first_name":"Maik","full_name":"Drechsler, Maik","last_name":"Drechsler"},{"first_name":"Anita","full_name":"Ruf, Anita","last_name":"Ruf"},{"full_name":"Schäfer, Jan Hannes","last_name":"Schäfer","first_name":"Jan Hannes"},{"first_name":"Anna","last_name":"Lürick","full_name":"Lürick, Anna"},{"last_name":"Januliene","full_name":"Januliene, Dovile","first_name":"Dovile"},{"last_name":"Apelt","full_name":"Apelt, Steven","first_name":"Steven"},{"first_name":"Daniele","full_name":"Di Iorio, Daniele","last_name":"Di Iorio"},{"last_name":"Wegner","full_name":"Wegner, Seraphine V.","first_name":"Seraphine V."},{"last_name":"Loose","id":"462D4284-F248-11E8-B48F-1D18A9856A87","full_name":"Loose, Martin","orcid":"0000-0001-7309-9724","first_name":"Martin"},{"first_name":"Arne","full_name":"Moeller, Arne","last_name":"Moeller"},{"first_name":"Achim","last_name":"Paululat","full_name":"Paululat, Achim"},{"last_name":"Kümmel","full_name":"Kümmel, Daniel","first_name":"Daniel"}],"external_id":{"pmid":["40864718"],"isi":["001559806100033"]},"volume":11,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file":[{"file_size":3434827,"success":1,"file_name":"2025_ScienceAdvance_Wilmes.pdf","date_created":"2025-09-15T07:23:12Z","access_level":"open_access","content_type":"application/pdf","checksum":"a3de801f3c6c1deadd7099d965db799a","date_updated":"2025-09-15T07:23:12Z","relation":"main_file","file_id":"20355","creator":"dernst"}],"date_published":"2025-08-29T00:00:00Z","file_date_updated":"2025-09-15T07:23:12Z","oa":1,"abstract":[{"text":"Rab GTPases organize intracellular trafficking and provide identity to organelles. Their spatiotemporal activation by guanine nucleotide exchange factors (GEFs) is tightly controlled to ensure fidelity. Our structural and functional comparison of the tri-longin domain RabGEFs Mon1-Ccz1 and Fuzzy-Inturned reveals the molecular basis for their target specificity. Both complexes rely on a conserved sequence motif of their substrate GTPases for the catalytic mechanism, while secondary interactions allow discrimination between targets. We also find that dimeric Mon1-Ccz1 from fungi and the metazoan homologs with the additional third subunit RMC1/Bulli bind membranes through electrostatic interactions via distinct interfaces. Protein-lipid interaction studies and functional characterization in flies reveal an essential function of RMC1/Bulli as mediator of GEF complex membrane recruitment. In the case of Fuzzy-Inturned, reconstitution experiments demonstrate that the BAR (Bin-Amphiphysin-Rvs) domain protein CiBAR1 can support membrane recruitment of the GEF. Collectively, our study demonstrates the molecular basis for the adaptation of TLD-RabGEFs to different cellular functions.","lang":"eng"}],"ddc":["570"],"has_accepted_license":"1","DOAJ_listed":"1","article_processing_charge":"Yes","day":"29","scopus_import":"1","citation":{"ama":"Wilmes S, Tönjes J, Drechsler M, et al. Mechanistic adaptation of the metazoan RabGEFs Mon1-Ccz1 and Fuzzy-Inturned. <i>Science Advances</i>. 2025;11(35):eadx2893. doi:<a href=\"https://doi.org/10.1126/sciadv.adx2893\">10.1126/sciadv.adx2893</a>","short":"S. Wilmes, J. Tönjes, M. Drechsler, A. Ruf, J.H. Schäfer, A. Lürick, D. Januliene, S. Apelt, D. Di Iorio, S.V. Wegner, M. Loose, A. Moeller, A. Paululat, D. Kümmel, Science Advances 11 (2025) eadx2893.","ieee":"S. Wilmes <i>et al.</i>, “Mechanistic adaptation of the metazoan RabGEFs Mon1-Ccz1 and Fuzzy-Inturned,” <i>Science Advances</i>, vol. 11, no. 35. AAAS, p. eadx2893, 2025.","ista":"Wilmes S, Tönjes J, Drechsler M, Ruf A, Schäfer JH, Lürick A, Januliene D, Apelt S, Di Iorio D, Wegner SV, Loose M, Moeller A, Paululat A, Kümmel D. 2025. Mechanistic adaptation of the metazoan RabGEFs Mon1-Ccz1 and Fuzzy-Inturned. Science Advances. 11(35), eadx2893.","mla":"Wilmes, Stephan, et al. “Mechanistic Adaptation of the Metazoan RabGEFs Mon1-Ccz1 and Fuzzy-Inturned.” <i>Science Advances</i>, vol. 11, no. 35, AAAS, 2025, p. eadx2893, doi:<a href=\"https://doi.org/10.1126/sciadv.adx2893\">10.1126/sciadv.adx2893</a>.","apa":"Wilmes, S., Tönjes, J., Drechsler, M., Ruf, A., Schäfer, J. H., Lürick, A., … Kümmel, D. (2025). Mechanistic adaptation of the metazoan RabGEFs Mon1-Ccz1 and Fuzzy-Inturned. <i>Science Advances</i>. AAAS. <a href=\"https://doi.org/10.1126/sciadv.adx2893\">https://doi.org/10.1126/sciadv.adx2893</a>","chicago":"Wilmes, Stephan, Jesse Tönjes, Maik Drechsler, Anita Ruf, Jan Hannes Schäfer, Anna Lürick, Dovile Januliene, et al. “Mechanistic Adaptation of the Metazoan RabGEFs Mon1-Ccz1 and Fuzzy-Inturned.” <i>Science Advances</i>. AAAS, 2025. <a href=\"https://doi.org/10.1126/sciadv.adx2893\">https://doi.org/10.1126/sciadv.adx2893</a>."},"date_created":"2025-09-14T22:01:32Z","quality_controlled":"1","doi":"10.1126/sciadv.adx2893","intvolume":"        11","oa_version":"Published Version","type":"journal_article","publication_status":"published","publisher":"AAAS","PlanS_conform":"1","OA_type":"gold","article_type":"original","month":"08","project":[{"grant_number":"101045340","name":"Synthetic and structural biology of Rab GTPase networks","_id":"bd6ae2ca-d553-11ed-ba76-a4aa239da5ee"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Mechanistic adaptation of the metazoan RabGEFs Mon1-Ccz1 and Fuzzy-Inturned","department":[{"_id":"MaLo"}],"date_updated":"2025-09-30T14:40:27Z","publication_identifier":{"eissn":["2375-2548"]},"isi":1,"OA_place":"publisher","pmid":1,"_id":"20351"}]
