[{"publication_status":"published","file":[{"date_updated":"2025-09-09T08:10:13Z","relation":"main_file","checksum":"90a32defed34787e771a5c1623b6b0d2","success":1,"creator":"dernst","file_name":"2025_NeuS_Kresse.pdf","access_level":"open_access","content_type":"application/pdf","file_id":"20314","file_size":295466,"date_created":"2025-09-09T08:10:13Z"}],"publication":"2nd International Conferenceon Neuro-Symbolic Systems","quality_controlled":"1","conference":{"end_date":"2025-05-30","name":"NeuS: International Conferenceon Neuro-Symbolic Systems","location":"Philadephia, PA, United States","start_date":"2025-05-28"},"title":"Logic gate neural networks are good for verification","date_published":"2025-06-01T00:00:00Z","article_number":"26","acknowledged_ssus":[{"_id":"ScienComp"}],"author":[{"first_name":"Fabian","id":"faff3c84-23f6-11ef-9085-e5187b51c604","full_name":"Kresse, Fabian","last_name":"Kresse"},{"full_name":"Yu, Zhengqi","last_name":"Yu","first_name":"Zhengqi","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"volume":288,"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"}],"month":"06","date_updated":"2025-09-09T08:12:44Z","has_accepted_license":"1","oa_version":"Published Version","article_processing_charge":"No","citation":{"ama":"Kresse F, Yu E, Lampert C, Henzinger TA. Logic gate neural networks are good for verification. In: 2nd International Conferenceon Neuro-Symbolic Systems. Vol 288. ML Research Press; 2025.","apa":"Kresse, F., Yu, E., Lampert, C., & Henzinger, T. A. (2025). Logic gate neural networks are good for verification. In 2nd International Conferenceon Neuro-Symbolic Systems (Vol. 288). Philadephia, PA, United States: ML Research Press.","short":"F. Kresse, E. Yu, C. Lampert, T.A. Henzinger, in:, 2nd International Conferenceon Neuro-Symbolic Systems, 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.","ieee":"F. Kresse, E. Yu, C. Lampert, and T. A. Henzinger, “Logic gate neural networks are good for verification,” in 2nd International Conferenceon Neuro-Symbolic Systems, Philadephia, PA, United States, 2025, vol. 288.","chicago":"Kresse, Fabian, Emily Yu, Christoph Lampert, and Thomas A Henzinger. “Logic Gate Neural Networks Are Good for Verification.” In 2nd International Conferenceon Neuro-Symbolic Systems, Vol. 288. ML Research Press, 2025.","mla":"Kresse, Fabian, et al. “Logic Gate Neural Networks Are Good for Verification.” 2nd International Conferenceon Neuro-Symbolic Systems, vol. 288, 26, ML Research Press, 2025."},"type":"conference","publication_identifier":{"eissn":["2640-3498"]},"status":"public","_id":"20296","year":"2025","department":[{"_id":"ChLa"},{"_id":"ToHe"}],"intvolume":" 288","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"}],"ec_funded":1,"oa":1,"file_date_updated":"2025-09-09T08:10:13Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-07T22:01:34Z","OA_place":"publisher","corr_author":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["2505.19932"]},"scopus_import":"1","ddc":["000"],"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).","publisher":"ML Research Press","arxiv":1,"alternative_title":["PMLR"],"day":"01","OA_type":"diamond"},{"publisher":"ML Research Press","arxiv":1,"day":"01","alternative_title":["PMLR"],"OA_type":"diamond","scopus_import":"1","ddc":["000"],"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.","oa":1,"file_date_updated":"2025-09-09T08:19:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-07T22:01:34Z","OA_place":"publisher","corr_author":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["2412.00941"]},"year":"2025","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"intvolume":" 286","project":[{"call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"ec_funded":1,"article_processing_charge":"No","citation":{"mla":"Asadi, Ali, et al. “Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.” The 41st Conference on Uncertainty in Artificial Intelligence, vol. 286, ML Research Press, 2025, pp. 238–47.","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 The 41st Conference on Uncertainty in Artificial Intelligence, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 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 The 41st Conference on Uncertainty in Artificial Intelligence, 286:238–47. ML Research Press, 2025.","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.","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.","apa":"Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Shafiee, A. (2025). Limit-sure reachability for small memory policies in POMDPs is NP-complete. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 238–247). Rio de Janeiro, Brazil: ML Research Press.","ama":"Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. Limit-sure reachability for small memory policies in POMDPs is NP-complete. In: The 41st Conference on Uncertainty in Artificial Intelligence. Vol 286. ML Research Press; 2025:238-247."},"type":"conference","publication_identifier":{"eissn":["2640-3498"]},"status":"public","_id":"20297","volume":286,"abstract":[{"lang":"eng","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."}],"month":"07","date_updated":"2025-09-09T08:21:45Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1","oa_version":"Published Version","conference":{"end_date":"2025-07-25","name":"UAI: Conference on Uncertainty in Artificial Intelligence","location":"Rio de Janeiro, Brazil","start_date":"2025-07-21"},"title":"Limit-sure reachability for small memory policies in POMDPs is NP-complete","date_published":"2025-07-01T00:00:00Z","author":[{"first_name":"Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","full_name":"Asadi, Ali","last_name":"Asadi"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"orcid":"0000-0001-5103-038X","last_name":"Saona Urmeneta","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","first_name":"Raimundo J"},{"last_name":"Shafiee","full_name":"Shafiee, Ali","id":"2783031a-7378-11f0-b2d0-f17f1db2ebad","first_name":"Ali"}],"page":"238-247","publication_status":"published","publication":"The 41st Conference on Uncertainty in Artificial Intelligence","file":[{"relation":"main_file","checksum":"1a37ebe7ba73ab6985765bf0d17a0acc","success":1,"creator":"dernst","date_updated":"2025-09-09T08:19:41Z","file_size":307458,"date_created":"2025-09-09T08:19:41Z","file_name":"2025_UAI_AsadiAli.pdf","access_level":"open_access","file_id":"20315","content_type":"application/pdf"}],"quality_controlled":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-07T22:01:34Z","file_date_updated":"2025-09-09T08:26:44Z","oa":1,"external_id":{"arxiv":["2402.04840"]},"language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","year":"2025","department":[{"_id":"ChLa"}],"intvolume":" 258","arxiv":1,"publisher":"ML Research Press","alternative_title":["PMLR"],"day":"01","OA_type":"diamond","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.","ddc":["000"],"scopus_import":"1","title":"Efficient estimation of a Gaussian mean with local differential privacy","conference":{"location":"Mai Khao, Thailand","start_date":"2025-05-03","end_date":"2025-05-05","name":"AISTATS: Conference on Artificial Intelligence and Statistics"},"author":[{"id":"4b14526e-14d2-11ed-ba64-c14c9553d137","first_name":"Nikita","last_name":"Kalinin","full_name":"Kalinin, Nikita"},{"first_name":"Lukas","full_name":"Steinberger, Lukas","last_name":"Steinberger"}],"date_published":"2025-05-01T00:00:00Z","page":"118-126","publication_status":"published","quality_controlled":"1","publication":"Proceedings of the 28th International Conference on Artificial Intelligence and Statistics","file":[{"file_id":"20316","access_level":"open_access","content_type":"application/pdf","file_name":"2025_AISTATS_Kalinin.pdf","date_created":"2025-09-09T08:26:44Z","file_size":395864,"date_updated":"2025-09-09T08:26:44Z","relation":"main_file","creator":"dernst","success":1,"checksum":"3dcd59988ca974b98662ba09a516e616"}],"publication_identifier":{"eissn":["2640-3498"]},"type":"conference","citation":{"ama":"Kalinin N, Steinberger L. Efficient estimation of a Gaussian mean with local differential privacy. In: Proceedings of the 28th International Conference on Artificial Intelligence and Statistics. Vol 258. ML Research Press; 2025:118-126.","apa":"Kalinin, N., & Steinberger, L. (2025). Efficient estimation of a Gaussian mean with local differential privacy. In Proceedings of the 28th International Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 118–126). Mai Khao, Thailand: ML Research Press.","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.","short":"N. Kalinin, L. Steinberger, in:, Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 118–126.","mla":"Kalinin, Nikita, and Lukas Steinberger. “Efficient Estimation of a Gaussian Mean with Local Differential Privacy.” Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, vol. 258, ML Research Press, 2025, pp. 118–26.","ieee":"N. Kalinin and L. Steinberger, “Efficient estimation of a Gaussian mean with local differential privacy,” in Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol. 258, pp. 118–126.","chicago":"Kalinin, Nikita, and Lukas Steinberger. “Efficient Estimation of a Gaussian Mean with Local Differential Privacy.” In Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, 258:118–26. ML Research Press, 2025."},"article_processing_charge":"No","status":"public","_id":"20298","date_updated":"2025-09-09T08:28:41Z","abstract":[{"lang":"eng","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."}],"month":"05","volume":258,"oa_version":"Published Version","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"}},{"ec_funded":1,"year":"2025","intvolume":" 286","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"date_created":"2025-09-07T22:01:34Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"file_date_updated":"2025-09-09T06:27:59Z","language":[{"iso":"eng"}],"external_id":{"arxiv":["2506.12254"]},"OA_place":"publisher","corr_author":"1","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant and Austrian Science Fund (FWF) 10.55776/COE12.\r\n","ddc":["000"],"scopus_import":"1","arxiv":1,"publisher":"ML Research Press","OA_type":"diamond","day":"01","alternative_title":["PMLR"],"page":"223-232","publication_status":"published","quality_controlled":"1","publication":"The 41st Conference on Uncertainty in Artificial Intelligence","file":[{"date_updated":"2025-09-09T06:27:59Z","relation":"main_file","creator":"dernst","checksum":"4180c81bb6ed3b4f5c7a8e48d06520c6","success":1,"content_type":"application/pdf","file_name":"2025_UAI_Asadi.pdf","file_id":"20313","access_level":"open_access","file_size":317097,"date_created":"2025-09-09T06:27:59Z"}],"title":"Lower bound on Howard policy iteration for deterministic Markov Decision Processes","conference":{"name":"UAI: Conference on Uncertainty in Artificial Intelligence","end_date":"2025-07-25","location":"Rio de Janeiro, Brazil","start_date":"2025-07-21"},"date_published":"2025-01-01T00:00:00Z","author":[{"id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","first_name":"Ali","last_name":"Asadi","full_name":"Asadi, Ali"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jakob","last_name":"De Raaij","full_name":"De Raaij, Jakob"}],"month":"01","abstract":[{"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.","lang":"eng"}],"volume":286,"date_updated":"2025-09-09T06:31:20Z","has_accepted_license":"1","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"type":"conference","publication_identifier":{"eissn":["2640-3498"]},"article_processing_charge":"No","citation":{"short":"A. Asadi, K. Chatterjee, J. De Raaij, in:, The 41st Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 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.","ieee":"A. Asadi, K. Chatterjee, and J. De Raaij, “Lower bound on Howard policy iteration for deterministic Markov Decision Processes,” in The 41st Conference on Uncertainty in Artificial Intelligence, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 223–232.","chicago":"Asadi, Ali, Krishnendu Chatterjee, and Jakob De Raaij. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” In The 41st Conference on Uncertainty in Artificial Intelligence, 286:223–32. ML Research Press, 2025.","mla":"Asadi, Ali, et al. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” The 41st Conference on Uncertainty in Artificial Intelligence, vol. 286, ML Research Press, 2025, pp. 223–32.","ama":"Asadi A, Chatterjee K, De Raaij J. Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In: The 41st Conference on Uncertainty in Artificial Intelligence. Vol 286. ML Research Press; 2025:223-232.","apa":"Asadi, A., Chatterjee, K., & De Raaij, J. (2025). Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 223–232). Rio de Janeiro, Brazil: ML Research Press."},"status":"public","_id":"20299"},{"publication":"The 28th International Conference on Artificial Intelligence and Statistics","quality_controlled":"1","publication_status":"published","page":"4591-4599","author":[{"first_name":"Tobias","last_name":"Wegel","full_name":"Wegel, Tobias"},{"first_name":"Filip","id":"d0258e7b-50b8-11ef-ad56-8b9f537b6b1b","full_name":"Kovačević, Filip","last_name":"Kovačević"},{"first_name":"Alexandru","last_name":"Ţifrea","full_name":"Ţifrea, Alexandru"},{"first_name":"Fanny","full_name":"Yang, Fanny","last_name":"Yang"}],"date_published":"2025-05-01T00:00:00Z","conference":{"start_date":"2025-05-03","location":"Mai Khao, Thailand","name":"AISTATS: Conference on Artificial Intelligence and Statistics","end_date":"2025-05-05"},"title":"Learning Pareto manifolds in high dimensions: How can regularization help?","oa_version":"Preprint","date_updated":"2025-09-09T07:00:34Z","volume":258,"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"}],"month":"05","_id":"20300","status":"public","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.","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.","mla":"Wegel, Tobias, et al. “Learning Pareto Manifolds in High Dimensions: How Can Regularization Help?” The 28th International Conference on Artificial Intelligence and Statistics, vol. 258, ML Research Press, 2025, pp. 4591–99.","chicago":"Wegel, Tobias, Filip Kovačević, Alexandru Ţifrea, and Fanny Yang. “Learning Pareto Manifolds in High Dimensions: How Can Regularization Help?” In The 28th International Conference on Artificial Intelligence and Statistics, 258:4591–99. ML Research Press, 2025.","ieee":"T. Wegel, F. Kovačević, A. Ţifrea, and F. Yang, “Learning Pareto manifolds in high dimensions: How can regularization help?,” in The 28th International Conference on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol. 258, pp. 4591–4599.","ama":"Wegel T, Kovačević F, Ţifrea A, Yang F. Learning Pareto manifolds in high dimensions: How can regularization help? In: The 28th International Conference on Artificial Intelligence and Statistics. Vol 258. ML Research Press; 2025:4591-4599.","apa":"Wegel, T., Kovačević, F., Ţifrea, A., & Yang, F. (2025). Learning Pareto manifolds in high dimensions: How can regularization help? In The 28th International Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 4591–4599). Mai Khao, Thailand: ML Research Press."},"article_processing_charge":"No","publication_identifier":{"eissn":["2640-3498"]},"type":"conference","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2503.08849","open_access":"1"}],"department":[{"_id":"MaMo"}],"intvolume":" 258","year":"2025","OA_place":"repository","external_id":{"arxiv":["2503.08849"]},"language":[{"iso":"eng"}],"oa":1,"date_created":"2025-09-07T22:01:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","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.","alternative_title":["PMLR"],"OA_type":"green","day":"01","publisher":"ML Research Press","arxiv":1},{"language":[{"iso":"eng"}],"external_id":{"arxiv":["2302.11341"]},"OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-07T22:01:35Z","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.11341","open_access":"1"}],"ec_funded":1,"department":[{"_id":"MoHe"}],"intvolume":" 258","year":"2025","project":[{"call_identifier":"H2020","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures"},{"name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982"},{"name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775"}],"alternative_title":["PMLR"],"OA_type":"green","day":"01","arxiv":1,"publisher":"ML Research Press","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.","scopus_import":"1","date_published":"2025-05-01T00:00:00Z","author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"A. R.","last_name":"Sricharan","full_name":"Sricharan, A. R."},{"full_name":"Steiner, Teresa Anna","last_name":"Steiner","first_name":"Teresa Anna"}],"title":"Differentially private continual release of histograms and related queries","conference":{"start_date":"2025-05-03","location":"Mai Khao, Thailand","end_date":"2025-05-05","name":"AISTATS: Conference on Artificial Intelligence and Statistics"},"quality_controlled":"1","publication":"The 28th International Conference on Artificial Intelligence and Statistics","publication_status":"published","page":"1990-1998","_id":"20301","status":"public","type":"conference","publication_identifier":{"eissn":["2640-3498"]},"article_processing_charge":"No","citation":{"mla":"Henzinger, Monika, et al. “Differentially Private Continual Release of Histograms and Related Queries.” The 28th International Conference on Artificial Intelligence and Statistics, 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 The 28th International Conference on Artificial Intelligence and Statistics, 258:1990–98. ML Research Press, 2025.","ieee":"M. Henzinger, A. R. Sricharan, and T. A. Steiner, “Differentially private continual release of histograms and related queries,” in The 28th International Conference on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol. 258, pp. 1990–1998.","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.","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.","apa":"Henzinger, M., Sricharan, A. R., & Steiner, T. A. (2025). Differentially private continual release of histograms and related queries. In The 28th International Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 1990–1998). Mai Khao, Thailand: ML Research Press.","ama":"Henzinger M, Sricharan AR, Steiner TA. Differentially private continual release of histograms and related queries. In: The 28th International Conference on Artificial Intelligence and Statistics. Vol 258. ML Research Press; 2025:1990-1998."},"oa_version":"Preprint","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"}],"month":"05","volume":258,"date_updated":"2025-09-09T07:09:22Z"},{"publication":"The 28th International Conference on Artificial Intelligence and Statistics","quality_controlled":"1","page":"2539-2547","publication_status":"published","author":[{"id":"b391db08-1ffe-11ee-8b67-d18ddcfb5a14","first_name":"Ruichen","last_name":"Luo","full_name":"Luo, Ruichen"},{"first_name":"Sebastian U.","full_name":"Stich, Sebastian U.","last_name":"Stich"},{"first_name":"Samuel","full_name":"Horváth, Samuel","last_name":"Horváth"},{"first_name":"Martin","last_name":"Takáč","full_name":"Takáč, Martin"}],"date_published":"2025-05-01T00:00:00Z","conference":{"end_date":"2025-05-05","name":"AISTATS: Conference on Artificial Intelligence and Statistics","start_date":"2025-05-03","location":"Mai Khao, Thailand"},"title":"Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis","oa_version":"Preprint","date_updated":"2025-09-09T07:17:08Z","volume":258,"month":"05","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"}],"_id":"20302","status":"public","citation":{"mla":"Luo, Ruichen, et al. “Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis.” The 28th International Conference on Artificial Intelligence and Statistics, vol. 258, ML Research Press, 2025, pp. 2539–47.","ieee":"R. Luo, S. U. Stich, S. Horváth, and M. Takáč, “Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis,” in The 28th International Conference on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol. 258, pp. 2539–2547.","chicago":"Luo, Ruichen, Sebastian U. Stich, Samuel Horváth, and Martin Takáč. “Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis.” In The 28th International Conference on Artificial Intelligence and Statistics, 258:2539–47. ML Research Press, 2025.","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.","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.","apa":"Luo, R., Stich, S. U., Horváth, S., & Takáč, M. (2025). Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. In The 28th International Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 2539–2547). Mai Khao, Thailand: ML Research Press.","ama":"Luo R, Stich SU, Horváth S, Takáč M. Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. In: The 28th International Conference on Artificial Intelligence and Statistics. Vol 258. ML Research Press; 2025:2539-2547."},"article_processing_charge":"No","publication_identifier":{"eissn":["2640-3498"]},"type":"conference","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2501.04443","open_access":"1"}],"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020"}],"year":"2025","intvolume":" 258","department":[{"_id":"KrCh"}],"ec_funded":1,"OA_place":"repository","external_id":{"arxiv":["2501.04443"]},"language":[{"iso":"eng"}],"oa":1,"date_created":"2025-09-07T22:01:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","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.","alternative_title":["PMLR"],"day":"01","OA_type":"green","publisher":"ML Research Press","arxiv":1},{"date_updated":"2025-09-09T07:47:13Z","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."}],"volume":258,"month":"05","oa_version":"Preprint","publication_identifier":{"eissn":["2640-3498"]},"type":"conference","citation":{"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.","short":"S. Huang, N. Pfister, J. Bowden, in:, The 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 3394–3402.","mla":"Huang, Shimeng, et al. “Sparse Causal Effect Estimation Using Two-Sample Summary Statistics in the Presence of Unmeasured Confounding.” The 28th International Conference on Artificial Intelligence and Statistics, vol. 258, ML Research Press, 2025, pp. 3394–402.","chicago":"Huang, Shimeng, Niklas Pfister, and Jack Bowden. “Sparse Causal Effect Estimation Using Two-Sample Summary Statistics in the Presence of Unmeasured Confounding.” In The 28th International Conference on Artificial Intelligence and Statistics, 258:3394–3402. ML Research Press, 2025.","ieee":"S. Huang, N. Pfister, and J. Bowden, “Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding,” in The 28th International Conference on Artificial Intelligence and Statistics, 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: The 28th International Conference on Artificial Intelligence and Statistics. Vol 258. ML Research Press; 2025:3394-3402.","apa":"Huang, S., Pfister, N., & Bowden, J. (2025). Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding. In The 28th International Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 3394–3402). Mai Khao, Thailand: ML Research Press."},"article_processing_charge":"No","status":"public","_id":"20303","page":"3394-3402","publication_status":"published","quality_controlled":"1","publication":"The 28th International Conference on Artificial Intelligence and Statistics","title":"Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding","conference":{"location":"Mai Khao, Thailand","start_date":"2025-05-03","name":"AISTATS: Conference on Artificial Intelligence and Statistics","end_date":"2025-05-05"},"author":[{"last_name":"Huang","orcid":"0000-0001-6919-821X","full_name":"Huang, Shimeng","id":"989c2a06-fb4e-11ef-a992-ab766442255b","first_name":"Shimeng"},{"first_name":"Niklas","last_name":"Pfister","full_name":"Pfister, Niklas"},{"full_name":"Bowden, Jack","last_name":"Bowden","first_name":"Jack"}],"date_published":"2025-05-01T00:00:00Z","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.","scopus_import":"1","arxiv":1,"publisher":"ML Research Press","alternative_title":["PMLR"],"day":"01","OA_type":"green","intvolume":" 258","year":"2025","department":[{"_id":"FrLo"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2410.12300","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-07T22:01:35Z","oa":1,"external_id":{"arxiv":["2410.12300"]},"language":[{"iso":"eng"}],"OA_place":"repository"},{"article_type":"original","date_updated":"2025-12-30T10:16:52Z","issue":"40","month":"07","volume":21,"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."}],"isi":1,"oa_version":"Published Version","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"publication_identifier":{"eissn":["1744-6848"],"issn":["1744-683X"]},"type":"journal_article","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. Soft Matter. 2025;21(40):7736-7756. doi:10.1039/d5sm00148j","apa":"Muñoz Basagoiti, M., Frey, F. F., 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. Royal Society of Chemistry. https://doi.org/10.1039/d5sm00148j","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.","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.” Soft Matter. Royal Society of Chemistry, 2025. https://doi.org/10.1039/d5sm00148j.","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,” Soft Matter, vol. 21, no. 40. Royal Society of Chemistry, pp. 7736–7756, 2025.","mla":"Muñoz Basagoiti, Maitane, et al. “A Tutorial for Mesoscale Computer Simulations of Lipid Membranes: Tether Pulling, Tubulation and Fluctuations.” Soft Matter, vol. 21, no. 40, Royal Society of Chemistry, 2025, pp. 7736–56, doi:10.1039/d5sm00148j."},"article_processing_charge":"Yes (via OA deal)","_id":"20318","status":"public","page":"7736-7756","publication_status":"published","quality_controlled":"1","file":[{"date_created":"2025-12-30T10:16:40Z","file_size":4841140,"access_level":"open_access","file_id":"20912","file_name":"2025_SoftMatter_MunozBasagoiti.pdf","content_type":"application/pdf","relation":"main_file","creator":"dernst","success":1,"checksum":"590bedad19b6f6d40a7ee036a056a6d9","date_updated":"2025-12-30T10:16:40Z"}],"publication":"Soft Matter","title":"A tutorial for mesoscale computer simulations of lipid membranes: Tether pulling, tubulation and fluctuations","author":[{"id":"1a8a7950-82cd-11ed-bd4f-9624c913a607","first_name":"Maitane","last_name":"Muñoz Basagoiti","orcid":"0000-0003-1483-1457","full_name":"Muñoz Basagoiti, Maitane"},{"full_name":"Frey, Felix F","last_name":"Frey","orcid":"0000-0001-8501-6017","first_name":"Felix F","id":"a0270b37-8f1a-11ec-95c7-8e710c59a4f3"},{"last_name":"Meadowcroft","orcid":"0000-0003-3441-1337","full_name":"Meadowcroft, Billie","id":"a4725fd6-932b-11ed-81e2-c098c7f37ae1","first_name":"Billie"},{"full_name":"Santana de Freitas Amaral, Miguel","last_name":"Santana de Freitas Amaral","first_name":"Miguel","id":"4f2d02dd-47a9-11ec-ad10-82820ed3f501"},{"first_name":"Adam","id":"a43ed60a-dd22-11ed-9bf7-b34133792ea9","full_name":"Prada, Adam","last_name":"Prada"},{"first_name":"Anđela","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","full_name":"Šarić, Anđela","last_name":"Šarić","orcid":"0000-0002-7854-2139"}],"date_published":"2025-07-28T00:00:00Z","ddc":["540"],"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.","scopus_import":"1","doi":"10.1039/d5sm00148j","arxiv":1,"publisher":"Royal Society of Chemistry","OA_type":"hybrid","day":"28","ec_funded":1,"project":[{"grant_number":"101034413","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program"},{"name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","call_identifier":"H2020","grant_number":"802960"},{"_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A","name":"NOMIS Fellowship Program"},{"name":"The evolution of trafficking: from archaea to eukaryotes","_id":"eba0f67c-77a9-11ec-83b8-cc8501b3e222","grant_number":"96752"}],"department":[{"_id":"AnSa"}],"year":"2025","intvolume":" 21","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-10T05:34:36Z","file_date_updated":"2025-12-30T10:16:40Z","oa":1,"external_id":{"isi":["001562846800001"],"arxiv":["2502.09798"]},"language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher"},{"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.","ddc":["550"],"scopus_import":"1","doi":"10.1029/2025ms005035","publisher":"Wiley","day":"01","OA_type":"gold","DOAJ_listed":"1","ec_funded":1,"intvolume":" 17","year":"2025","department":[{"_id":"CaMu"}],"project":[{"call_identifier":"H2020","grant_number":"805041","name":"Organization of CLoUdS, and implications of Tropical cyclones and for the Energetics of the tropics, in current and waRming climate","_id":"629205d8-2b32-11ec-9570-e1356ff73576"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-10T05:36:16Z","oa":1,"file_date_updated":"2025-09-10T08:12:34Z","language":[{"iso":"eng"}],"OA_place":"publisher","corr_author":"1","article_type":"original","volume":17,"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"}],"month":"09","date_updated":"2025-09-10T08:14:28Z","issue":"9","has_accepted_license":"1","oa_version":"Published Version","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"type":"journal_article","publication_identifier":{"eissn":["1942-2466"]},"article_processing_charge":"Yes","citation":{"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). Journal of Advances in Modeling Earth Systems. 2025;17(9). doi:10.1029/2025ms005035","apa":"GOSWAMI, B. B., Polesello, A., & Muller, C. J. (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. Wiley. https://doi.org/10.1029/2025ms005035","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.","short":"B.B. GOSWAMI, A. Polesello, C.J. Muller, Journal of Advances in Modeling Earth Systems 17 (2025).","mla":"GOSWAMI, BIDYUT B., et al. “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, vol. 17, no. 9, e2025MS005035, Wiley, 2025, doi:10.1029/2025ms005035.","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).” Journal of Advances in Modeling Earth Systems. Wiley, 2025. https://doi.org/10.1029/2025ms005035.","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),” Journal of Advances in Modeling Earth Systems, vol. 17, no. 9. Wiley, 2025."},"status":"public","_id":"20319","publication_status":"published","quality_controlled":"1","file":[{"date_created":"2025-09-10T08:12:34Z","file_size":2143025,"file_name":"2025_JAMES_Goswami.pdf","file_id":"20338","content_type":"application/pdf","access_level":"open_access","success":1,"checksum":"5961d6290432c5ac0e8587ef07f30c9b","creator":"dernst","relation":"main_file","date_updated":"2025-09-10T08:12:34Z"}],"publication":"Journal of Advances in Modeling Earth Systems","title":"An assessment of representing land‐ocean heterogeneity via CAPE relaxation timescale in the Community Atmospheric Model 6 (CAM6)","article_number":"e2025MS005035","date_published":"2025-09-01T00:00:00Z","author":[{"first_name":"BIDYUT B","id":"3a4ac09c-6d61-11ec-bf66-884cde66b64b","full_name":"GOSWAMI, BIDYUT B","last_name":"GOSWAMI","orcid":"0000-0001-8602-3083"},{"last_name":"Polesello","full_name":"Polesello, Andrea","id":"74c777f4-32da-11ee-b498-874db0835561","first_name":"Andrea"},{"full_name":"Muller, Caroline J","last_name":"Muller","orcid":"0000-0001-5836-5350","first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"}],"acknowledged_ssus":[{"_id":"ScienComp"}]},{"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.","ddc":["500"],"scopus_import":"1","arxiv":1,"doi":"10.1016/j.ejc.2025.104214","publisher":"Elsevier","OA_type":"hybrid","day":"01","year":"2025","department":[{"_id":"MaKw"}],"intvolume":" 130","date_created":"2025-09-10T05:36:50Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"file_date_updated":"2025-12-30T10:18:56Z","PlanS_conform":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["2310.00931"],"isi":["001529769300002"]},"OA_place":"publisher","corr_author":"1","article_type":"original","volume":130,"month":"12","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."}],"date_updated":"2025-12-30T10:19:10Z","issue":"12","has_accepted_license":"1","oa_version":"Published Version","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"type":"journal_article","publication_identifier":{"issn":["0195-6698"]},"article_processing_charge":"Yes (via OA deal)","citation":{"mla":"Mies, Sebastian, et al. “Beyond the Pseudoforest Strong Nine Dragon Tree Theorem.” European Journal of Combinatorics, vol. 130, no. 12, 104214, Elsevier, 2025, doi:10.1016/j.ejc.2025.104214.","chicago":"Mies, Sebastian, Benjamin Moore, and Evelyne Smith-Roberge. “Beyond the Pseudoforest Strong Nine Dragon Tree Theorem.” European Journal of Combinatorics. Elsevier, 2025. https://doi.org/10.1016/j.ejc.2025.104214.","ieee":"S. Mies, B. Moore, and E. Smith-Roberge, “Beyond the pseudoforest strong Nine Dragon Tree theorem,” European Journal of Combinatorics, vol. 130, no. 12. Elsevier, 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.","short":"S. Mies, B. Moore, E. Smith-Roberge, European Journal of Combinatorics 130 (2025).","apa":"Mies, S., Moore, B., & Smith-Roberge, E. (2025). Beyond the pseudoforest strong Nine Dragon Tree theorem. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104214","ama":"Mies S, Moore B, Smith-Roberge E. Beyond the pseudoforest strong Nine Dragon Tree theorem. European Journal of Combinatorics. 2025;130(12). doi:10.1016/j.ejc.2025.104214"},"status":"public","_id":"20320","publication_status":"published","quality_controlled":"1","publication":"European Journal of Combinatorics","file":[{"creator":"dernst","relation":"main_file","success":1,"checksum":"b1536e9256c4510a0e21452032e43a26","date_updated":"2025-12-30T10:18:56Z","date_created":"2025-12-30T10:18:56Z","file_size":737845,"access_level":"open_access","content_type":"application/pdf","file_id":"20913","file_name":"2025_EuropJournCombinatorics_Mies.pdf"}],"title":"Beyond the pseudoforest strong Nine Dragon Tree theorem","date_published":"2025-12-01T00:00:00Z","article_number":"104214","author":[{"full_name":"Mies, Sebastian","last_name":"Mies","first_name":"Sebastian"},{"last_name":"Moore","full_name":"Moore, Benjamin","id":"6dc1a1be-bf1c-11ed-8d2b-d044840f49d6","first_name":"Benjamin"},{"first_name":"Evelyne","full_name":"Smith-Roberge, Evelyne","last_name":"Smith-Roberge"}]},{"citation":{"chicago":"Tatman, Benjamin, Vidhyalakshmi Sridharan, Motilal Uttarkabat, Christopher P. Jaroniec, Matthias Ernst, Petra Rovo, and Paul Schanda. “Bumps on the Road: The Way to Clean Relaxation Dispersion Magic-Angle Spinning NMR.” Journal of the American Chemical Society. American Chemical Society, 2025. https://doi.org/10.1021/jacs.5c09057.","ieee":"B. Tatman et al., “Bumps on the road: The way to clean relaxation dispersion magic-angle spinning NMR,” Journal of the American Chemical Society, vol. 147, no. 32. American Chemical Society, pp. 29315–29326, 2025.","mla":"Tatman, Benjamin, et al. “Bumps on the Road: The Way to Clean Relaxation Dispersion Magic-Angle Spinning NMR.” Journal of the American Chemical Society, vol. 147, no. 32, American Chemical Society, 2025, pp. 29315–26, doi:10.1021/jacs.5c09057.","short":"B. Tatman, V. Sridharan, M. Uttarkabat, C.P. Jaroniec, M. Ernst, P. Rovo, P. Schanda, Journal of the American Chemical Society 147 (2025) 29315–29326.","ista":"Tatman B, Sridharan V, Uttarkabat M, Jaroniec CP, Ernst M, Rovo P, Schanda P. 2025. Bumps on the road: The way to clean relaxation dispersion magic-angle spinning NMR. Journal of the American Chemical Society. 147(32), 29315–29326.","apa":"Tatman, B., Sridharan, V., Uttarkabat, M., Jaroniec, C. P., Ernst, M., Rovo, P., & Schanda, P. (2025). Bumps on the road: The way to clean relaxation dispersion magic-angle spinning NMR. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/jacs.5c09057","ama":"Tatman B, Sridharan V, Uttarkabat M, et al. Bumps on the road: The way to clean relaxation dispersion magic-angle spinning NMR. Journal of the American Chemical Society. 2025;147(32):29315-29326. doi:10.1021/jacs.5c09057"},"article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["1520-5126"],"issn":["0002-7863"]},"type":"journal_article","status":"public","_id":"20321","date_updated":"2026-06-10T08:33:41Z","issue":"32","abstract":[{"text":"Microsecond-to-millisecond motions are instrumental for many biomolecular functions, including enzymatic activity and ligand binding. Bloch-McConnell Relaxation Dispersion (BMRD) Nuclear Magnetic Resonance (NMR) spectroscopy is a key technique for studying these dynamic processes. While BMRD experiments are routinely used to probe protein motions in solution, the experiment is more demanding in the solid state, where dipolar couplings complicate the spin dynamics. It is believed that high deuteration levels are required and sufficient to obtain accurate and quantitative data. Here we show that even under fast magic-angle spinning and high levels of deuteration artifactual “bumps” in 15N R1ρ BMRD profiles are common. The origin of these artifacts is identified as a second-order three-spin Mixed Rotational and Rotary Resonance (MIRROR) recoupling condition. These artifacts are found to be a significant confounding factor for the accurate quantification of microsecond protein dynamics using BMRD in the solid state. We show that the application of low-power continuous wave (CW) decoupling simultaneously with the 15N spin-lock leads to the suppression of these conditions and enables quantitative measurements of microsecond exchange in the solid state. Remarkably, the application of decoupling allows the measurement of accurate BMRD even in fully protonated proteins at 100 kHz MAS, thus extending the scope of μs dynamics measurements in MAS NMR.","lang":"eng"}],"month":"08","volume":147,"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"19696"}]},"article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","isi":1,"has_accepted_license":"1","title":"Bumps on the road: The way to clean relaxation dispersion magic-angle spinning NMR","acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"author":[{"id":"71cda2f3-e604-11ee-a1df-da10587eda3f","first_name":"Benjamin","last_name":"Tatman","full_name":"Tatman, Benjamin"},{"full_name":"Sridharan, Vidhyalakshmi","last_name":"Sridharan","first_name":"Vidhyalakshmi"},{"full_name":"Uttarkabat, Motilal","last_name":"Uttarkabat","first_name":"Motilal"},{"last_name":"Jaroniec","full_name":"Jaroniec, Christopher P.","first_name":"Christopher P."},{"first_name":"Matthias","full_name":"Ernst, Matthias","last_name":"Ernst"},{"first_name":"Petra","id":"c316e53f-b965-11eb-b128-bb26acc59c00","full_name":"Rovo, Petra","orcid":"0000-0001-8729-7326","last_name":"Rovo"},{"orcid":"0000-0002-9350-7606","last_name":"Schanda","full_name":"Schanda, Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul"}],"date_published":"2025-08-01T00:00:00Z","page":"29315-29326","publication_status":"published","file":[{"date_updated":"2025-09-10T07:53:10Z","checksum":"b350d56ddddefea96cebd62c277c0ff5","creator":"dernst","success":1,"relation":"main_file","access_level":"open_access","file_id":"20337","content_type":"application/pdf","file_name":"2025_JACS_Tatman.pdf","file_size":5235353,"date_created":"2025-09-10T07:53:10Z"}],"publication":"Journal of the American Chemical Society","pmid":1,"quality_controlled":"1","publisher":"American Chemical Society","doi":"10.1021/jacs.5c09057","OA_type":"hybrid","day":"01","scopus_import":"1","ddc":["540"],"acknowledgement":"The authors thank Alexey Krushelnitsky for useful discussions. C.P.J. thanks NSF (MCB-2303862) and NIH (R35GM156238 and S10OD012303) for funding. This research was supported by the Scientific Service Units (SSU) of Institute of Science and Technology Austria (ISTA) through resources provided by the Nuclear Magnetic Resonance and the Lab Support Facilities.","file_date_updated":"2025-09-10T07:53:10Z","PlanS_conform":"1","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2025-09-10T05:37:19Z","corr_author":"1","OA_place":"publisher","external_id":{"isi":["001542746200001"],"pmid":["40748291"]},"language":[{"iso":"eng"}],"year":"2025","intvolume":" 147","department":[{"_id":"PaSc"},{"_id":"NMR"}]},{"scopus_import":"1","acknowledgement":"We thank Giorgio Cipolloni for many productive discussions and the anonymous referees for several useful suggestions and spotting some typos. Open access funding provided by Institute of Science and Technology (IST Austria).","ddc":["510"],"publisher":"Springer Nature","doi":"10.1007/s00220-025-05417-z","arxiv":1,"day":"01","OA_type":"hybrid","department":[{"_id":"LaEr"}],"intvolume":" 406","year":"2025","PlanS_conform":"1","file_date_updated":"2025-09-10T07:48:21Z","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2025-09-10T05:38:17Z","corr_author":"1","OA_place":"publisher","external_id":{"arxiv":["2410.06813"],"isi":["001565019000005"]},"language":[{"iso":"eng"}],"issue":"10","date_updated":"2026-04-07T12:32:19Z","abstract":[{"text":"For correlated real symmetric or complex Hermitian random matrices, we prove that the local eigenvalue statistics at any cusp singularity are universal. Since the density of states typically exhibits only square root edge or cubic root cusp singularities, our result completes the proof of the Wigner–Dyson–Mehta universality conjecture in all spectral regimes for a very general class of random matrices. Previously only the bulk and the edge universality were established in this generality (Alt et al. in Ann Probab 48(2):963–1001, 2020), while cusp universality was proven only for Wigner-type matrices with independent entries (Cipolloni et al. in Pure Appl Anal 1:615–707, 2019; Erdős et al. in Commun. Math. Phys. 378:1203–1278, 2018). As our main technical input, we prove an optimal local law at the cusp using the Zigzag strategy, a recursive tandem of the characteristic flow method and a Green function comparison argument. Moreover, our proof of the optimal local law holds uniformly in the spectrum, thus we also provide a significantly simplified alternative proof of the local eigenvalue universality in the previously studied bulk (Erdős et al. in Forum Math. Sigma 7:E8, 2019) and edge (Alt et al. in Ann Probab 48(2):963–1001, 2020) regimes.","lang":"eng"}],"month":"09","volume":406,"related_material":{"record":[{"id":"19547","status":"public","relation":"earlier_version"},{"id":"20575","status":"public","relation":"dissertation_contains"}]},"article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","isi":1,"has_accepted_license":"1","citation":{"ieee":"L. Erdös, S. J. Henheik, and V. Riabov, “Cusp universality for correlated random matrices,” Communications in Mathematical Physics, vol. 406, no. 10. Springer Nature, 2025.","chicago":"Erdös, László, Sven Joscha Henheik, and Volodymyr Riabov. “Cusp Universality for Correlated Random Matrices.” Communications in Mathematical Physics. Springer Nature, 2025. https://doi.org/10.1007/s00220-025-05417-z.","mla":"Erdös, László, et al. “Cusp Universality for Correlated Random Matrices.” Communications in Mathematical Physics, vol. 406, no. 10, 253, Springer Nature, 2025, doi:10.1007/s00220-025-05417-z.","short":"L. Erdös, S.J. Henheik, V. Riabov, Communications in Mathematical Physics 406 (2025).","ista":"Erdös L, Henheik SJ, Riabov V. 2025. Cusp universality for correlated random matrices. Communications in Mathematical Physics. 406(10), 253.","apa":"Erdös, L., Henheik, S. J., & Riabov, V. (2025). Cusp universality for correlated random matrices. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-025-05417-z","ama":"Erdös L, Henheik SJ, Riabov V. Cusp universality for correlated random matrices. Communications in Mathematical Physics. 2025;406(10). doi:10.1007/s00220-025-05417-z"},"article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"type":"journal_article","status":"public","_id":"20322","publication_status":"published","file":[{"creator":"dernst","relation":"main_file","success":1,"checksum":"abd32af7b8ca6dc5b9080823a433986b","date_updated":"2025-09-10T07:48:21Z","file_size":1465827,"date_created":"2025-09-10T07:48:21Z","access_level":"open_access","content_type":"application/pdf","file_id":"20336","file_name":"2025_CommMathPhysics_Erdoes.pdf"}],"publication":"Communications in Mathematical Physics","quality_controlled":"1","title":"Cusp universality for correlated random matrices","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"first_name":"Sven Joscha","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","full_name":"Henheik, Sven Joscha","orcid":"0000-0003-1106-327X","last_name":"Henheik"},{"first_name":"Volodymyr","id":"1949f904-edfb-11eb-afb5-e2dfddabb93b","full_name":"Riabov, Volodymyr","last_name":"Riabov"}],"article_number":"253","date_published":"2025-09-01T00:00:00Z"},{"date_updated":"2025-12-30T07:55:21Z","issue":"10","volume":229,"month":"10","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"}],"related_material":{"record":[{"id":"18981","status":"public","relation":"earlier_version"}]},"article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","has_accepted_license":"1","citation":{"apa":"Brown, A., & Draganov, O. (2025). Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. Elsevier. https://doi.org/10.1016/j.jpaa.2025.108068","ama":"Brown A, Draganov O. Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. 2025;229(10). doi:10.1016/j.jpaa.2025.108068","ieee":"A. Brown and O. Draganov, “Discrete microlocal Morse theory,” Journal of Pure and Applied Algebra, vol. 229, no. 10. Elsevier, 2025.","chicago":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” Journal of Pure and Applied Algebra. Elsevier, 2025. https://doi.org/10.1016/j.jpaa.2025.108068.","mla":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” Journal of Pure and Applied Algebra, vol. 229, no. 10, 108068, Elsevier, 2025, doi:10.1016/j.jpaa.2025.108068.","short":"A. Brown, O. Draganov, Journal of Pure and Applied Algebra 229 (2025).","ista":"Brown A, Draganov O. 2025. Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. 229(10), 108068."},"article_processing_charge":"Yes (via OA deal)","publication_identifier":{"issn":["0022-4049"]},"type":"journal_article","_id":"20323","status":"public","publication_status":"published","file":[{"success":1,"relation":"main_file","creator":"dernst","checksum":"39bcad462278c9322ef810af7db67f56","date_updated":"2025-12-30T07:55:08Z","file_size":3090836,"date_created":"2025-12-30T07:55:08Z","access_level":"open_access","content_type":"application/pdf","file_name":"2025_JourPureAppliedAlgebra_Brown.pdf","file_id":"20886"}],"publication":"Journal of Pure and Applied Algebra","quality_controlled":"1","title":"Discrete microlocal Morse theory","author":[{"id":"70B7FDF6-608D-11E9-9333-8535E6697425","first_name":"Adam","last_name":"Brown","full_name":"Brown, Adam"},{"id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","first_name":"Ondrej","orcid":"0000-0003-0464-3823","last_name":"Draganov","full_name":"Draganov, Ondrej"}],"article_number":"108068","date_published":"2025-10-01T00:00:00Z","scopus_import":"1","ddc":["510"],"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","publisher":"Elsevier","doi":"10.1016/j.jpaa.2025.108068","arxiv":1,"day":"01","OA_type":"hybrid","project":[{"call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF"}],"year":"2025","department":[{"_id":"HeEd"}],"intvolume":" 229","ec_funded":1,"PlanS_conform":"1","file_date_updated":"2025-12-30T07:55:08Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-10T05:40:09Z","corr_author":"1","OA_place":"publisher","external_id":{"arxiv":["2209.14993"]},"language":[{"iso":"eng"}]},{"quality_controlled":"1","file":[{"access_level":"open_access","content_type":"application/pdf","file_name":"2025_PhysReviewAppl_Mukhopadhyay.pdf","file_id":"20335","file_size":1370466,"date_created":"2025-09-10T07:29:06Z","date_updated":"2025-09-10T07:29:06Z","relation":"main_file","creator":"dernst","checksum":"6cc3c9beeb7c0a88ee0a072c9a32b78b","success":1}],"publication":"Physical Review Applied","publication_status":"published","date_published":"2025-07-17T00:00:00Z","article_number":"014035","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"author":[{"first_name":"Soham","id":"FDE60288-A89D-11E9-947F-1AF6E5697425","full_name":"Mukhopadhyay, Soham","last_name":"Mukhopadhyay","orcid":"0000-0001-5263-5559"},{"full_name":"Lancheros Naranjo, Diego A","last_name":"Lancheros Naranjo","first_name":"Diego A","id":"6c55e976-15b2-11ec-abd3-d790e8937fde"},{"full_name":"Senior, Jorden L","orcid":"0000-0002-0672-9295","last_name":"Senior","first_name":"Jorden L","id":"5479D234-2D30-11EA-89CC-40953DDC885E"},{"id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","first_name":"Andrew P","orcid":"0000-0003-2607-2363","last_name":"Higginbotham","full_name":"Higginbotham, Andrew P"}],"title":"Dual relaxation oscillations in a Josephson-junction array","has_accepted_license":"1","oa_version":"Published Version","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"article_type":"original","related_material":{"record":[{"status":"public","id":"18057","relation":"earlier_version"}]},"abstract":[{"text":"We report relaxation oscillations in a one-dimensional array of Josephson junctions, wherein the array dynamically switches between low-current and high-current states. The oscillations are current-voltage dual to those ordinarily observed in single junctions. The current-voltage dual circuit quantitatively accounts for temporal dynamics of the array, including the dependence on biasing conditions. Injection locking of the oscillations results in well-developed current plateaux. A thermal model explains the self-consistent reduction of the superconducting gap due to overheating of the array in the high-current state. Our work suggests that overheating determines the switching from the high-current state to the low-current state.","lang":"eng"}],"month":"07","volume":24,"date_updated":"2026-06-03T07:16:04Z","_id":"20324","status":"public","type":"journal_article","publication_identifier":{"issn":["2331-7019"]},"article_processing_charge":"Yes (via OA deal)","citation":{"ama":"Mukhopadhyay S, Lancheros Naranjo DA, Senior JL, Higginbotham AP. Dual relaxation oscillations in a Josephson-junction array. Physical Review Applied. 2025;24. doi:10.1103/qvls-7s3q","apa":"Mukhopadhyay, S., Lancheros Naranjo, D. A., Senior, J. L., & Higginbotham, A. P. (2025). Dual relaxation oscillations in a Josephson-junction array. Physical Review Applied. American Physical Society. https://doi.org/10.1103/qvls-7s3q","ista":"Mukhopadhyay S, Lancheros Naranjo DA, Senior JL, Higginbotham AP. 2025. Dual relaxation oscillations in a Josephson-junction array. Physical Review Applied. 24, 014035.","short":"S. Mukhopadhyay, D.A. Lancheros Naranjo, J.L. Senior, A.P. Higginbotham, Physical Review Applied 24 (2025).","mla":"Mukhopadhyay, Soham, et al. “Dual Relaxation Oscillations in a Josephson-Junction Array.” Physical Review Applied, vol. 24, 014035, American Physical Society, 2025, doi:10.1103/qvls-7s3q.","ieee":"S. Mukhopadhyay, D. A. Lancheros Naranjo, J. L. Senior, and A. P. Higginbotham, “Dual relaxation oscillations in a Josephson-junction array,” Physical Review Applied, vol. 24. American Physical Society, 2025.","chicago":"Mukhopadhyay, Soham, Diego A Lancheros Naranjo, Jorden L Senior, and Andrew P Higginbotham. “Dual Relaxation Oscillations in a Josephson-Junction Array.” Physical Review Applied. American Physical Society, 2025. https://doi.org/10.1103/qvls-7s3q."},"ec_funded":1,"department":[{"_id":"GradSch"},{"_id":"AnHi"}],"year":"2025","intvolume":" 24","project":[{"grant_number":"P33692","_id":"0aa3608a-070f-11eb-9043-e9cd8a2bd931","name":"Cavity electromechanics across a quantum phase transition"},{"grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"},{"_id":"eb9b30ac-77a9-11ec-83b8-871f581d53d2","name":"Protected states of quantum matter"}],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2408.07829 "],"isi":["001537333100001"]},"OA_place":"publisher","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-10T05:41:30Z","oa":1,"file_date_updated":"2025-09-10T07:29:06Z","PlanS_conform":"1","acknowledgement":"We gratefully acknowledge support from the Miba Machine Shop and the Nanofabrictation Facility at IST Austria. This work was supported by the Austrian FWF under Grant No. P33692-N (S.M., J.S., and A.P.H.), the European Union’s Horizon 2020 research and innovation program under Marie Skłodowska-Curie Grant Agreement No. 754411 (J.S.), and a NOMIS Foundation research grant (A.P.H.).","ddc":["530"],"scopus_import":"1","OA_type":"hybrid","day":"17","arxiv":1,"doi":"10.1103/qvls-7s3q","publisher":"American Physical Society"},{"title":"Joint estimation of paternity, sibships and pollen dispersal in a snapdragon hybrid zone","date_published":"2025-09-02T00:00:00Z","article_number":"e70051","author":[{"id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Ellis","orcid":"0000-0002-8511-0254","full_name":"Ellis, Thomas"},{"first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","full_name":"Field, David","orcid":"0000-0002-4014-8478","last_name":"Field"},{"orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"}],"publication_status":"published","quality_controlled":"1","pmid":1,"publication":"Molecular Ecology","file":[{"date_updated":"2025-12-30T10:12:17Z","checksum":"5059ad4d74e6327b84b5282a39d36774","success":1,"relation":"main_file","creator":"dernst","file_name":"2025_MolecularEcology_Ellis.pdf","file_id":"20911","access_level":"open_access","content_type":"application/pdf","file_size":1698605,"date_created":"2025-12-30T10:12:17Z"}],"type":"journal_article","publication_identifier":{"eissn":["1365-294X"],"issn":["0962-1083"]},"article_processing_charge":"Yes (via OA deal)","citation":{"apa":"Ellis, T., Field, D., & Barton, N. H. (2025). Joint estimation of paternity, sibships and pollen dispersal in a snapdragon hybrid zone. Molecular Ecology. Wiley. https://doi.org/10.1111/mec.70051","ama":"Ellis T, Field D, Barton NH. Joint estimation of paternity, sibships and pollen dispersal in a snapdragon hybrid zone. Molecular Ecology. 2025;34(15). doi:10.1111/mec.70051","mla":"Ellis, Thomas, et al. “Joint Estimation of Paternity, Sibships and Pollen Dispersal in a Snapdragon Hybrid Zone.” Molecular Ecology, vol. 34, no. 15, e70051, Wiley, 2025, doi:10.1111/mec.70051.","ieee":"T. Ellis, D. Field, and N. H. Barton, “Joint estimation of paternity, sibships and pollen dispersal in a snapdragon hybrid zone,” Molecular Ecology, vol. 34, no. 15. Wiley, 2025.","chicago":"Ellis, Thomas, David Field, and Nicholas H Barton. “Joint Estimation of Paternity, Sibships and Pollen Dispersal in a Snapdragon Hybrid Zone.” Molecular Ecology. Wiley, 2025. https://doi.org/10.1111/mec.70051.","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.","short":"T. Ellis, D. Field, N.H. Barton, Molecular Ecology 34 (2025)."},"_id":"20325","status":"public","article_type":"original","month":"09","volume":34,"abstract":[{"lang":"eng","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."}],"issue":"15","date_updated":"2025-12-30T10:12:34Z","has_accepted_license":"1","oa_version":"Published Version","isi":1,"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-10T05:42:23Z","oa":1,"file_date_updated":"2025-12-30T10:12:17Z","language":[{"iso":"eng"}],"external_id":{"isi":["001542913000001"],"pmid":["40751392"]},"OA_place":"publisher","corr_author":"1","year":"2025","intvolume":" 34","department":[{"_id":"NiBa"}],"doi":"10.1111/mec.70051","publisher":"Wiley","day":"02","OA_type":"hybrid","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. ","ddc":["570"],"scopus_import":"1"},{"has_accepted_license":"1","oa_version":"Published Version","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"article_type":"original","related_material":{"record":[{"relation":"research_data","id":"19791","status":"public"}]},"volume":112,"month":"07","abstract":[{"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.","lang":"eng"}],"issue":"1","date_updated":"2025-09-30T14:34:43Z","_id":"20327","status":"public","type":"journal_article","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"article_processing_charge":"Yes (via OA deal)","citation":{"mla":"Desaules, Jean-Yves Marc, et al. “Mass-Assisted Local Deconfinement in a Confined Z2 Lattice Gauge Theory.” Physical Review B, vol. 112, no. 1, 014301, American Physical Society, 2025, doi:10.1103/mfg2-t6gb.","ieee":"J.-Y. M. Desaules, T. Iadecola, and J. C. Halimeh, “Mass-assisted local deconfinement in a confined Z2 lattice gauge theory,” Physical Review B, vol. 112, no. 1. American Physical Society, 2025.","chicago":"Desaules, Jean-Yves Marc, Thomas Iadecola, and Jad C. Halimeh. “Mass-Assisted Local Deconfinement in a Confined Z2 Lattice Gauge Theory.” Physical Review B. American Physical Society, 2025. https://doi.org/10.1103/mfg2-t6gb.","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.","short":"J.-Y.M. Desaules, T. Iadecola, J.C. Halimeh, Physical Review B 112 (2025).","apa":"Desaules, J.-Y. M., Iadecola, T., & Halimeh, J. C. (2025). Mass-assisted local deconfinement in a confined Z2 lattice gauge theory. Physical Review B. American Physical Society. https://doi.org/10.1103/mfg2-t6gb","ama":"Desaules J-YM, Iadecola T, Halimeh JC. Mass-assisted local deconfinement in a confined Z2 lattice gauge theory. Physical Review B. 2025;112(1). doi:10.1103/mfg2-t6gb"},"quality_controlled":"1","publication":"Physical Review B","file":[{"success":1,"relation":"main_file","checksum":"dd919bb9c4c233eba047af4262e02835","creator":"dernst","date_updated":"2025-09-10T06:47:23Z","date_created":"2025-09-10T06:47:23Z","file_size":3458424,"file_id":"20333","content_type":"application/pdf","file_name":"2025_PhysReviewB_Desaules.pdf","access_level":"open_access"}],"publication_status":"published","date_published":"2025-07-01T00:00:00Z","article_number":"014301","author":[{"first_name":"Jean-Yves Marc","id":"6c292945-a610-11ed-9eec-c3be1ad62a80","full_name":"Desaules, Jean-Yves Marc","orcid":"0000-0002-3749-6375","last_name":"Desaules"},{"full_name":"Iadecola, Thomas","last_name":"Iadecola","first_name":"Thomas"},{"last_name":"Halimeh","full_name":"Halimeh, Jad C.","first_name":"Jad C."}],"title":"Mass-assisted local deconfinement in a confined Z2 lattice gauge theory","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.","ddc":["530"],"scopus_import":"1","day":"01","OA_type":"hybrid","arxiv":1,"doi":"10.1103/mfg2-t6gb","publisher":"American Physical Society","ec_funded":1,"department":[{"_id":"MaSe"}],"intvolume":" 112","year":"2025","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"external_id":{"isi":["001530465500007"],"arxiv":["2404.11645"]},"OA_place":"publisher","corr_author":"1","date_created":"2025-09-10T05:44:47Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"PlanS_conform":"1","file_date_updated":"2025-09-10T06:47:23Z"},{"citation":{"mla":"Ibáñez, Maria, et al. “Prospects of Nanoscience with Nanocrystals: 2025 Edition.” ACS Nano, vol. 19, no. 36, American Chemical Society, 2025, pp. 31969–32051, doi:10.1021/acsnano.5c07838.","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.” ACS Nano. American Chemical Society, 2025. https://doi.org/10.1021/acsnano.5c07838.","ieee":"M. Ibáñez et al., “Prospects of nanoscience with nanocrystals: 2025 edition,” ACS Nano, vol. 19, no. 36. American Chemical Society, pp. 31969–32051, 2025.","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.","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.","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. ACS Nano. American Chemical Society. https://doi.org/10.1021/acsnano.5c07838","ama":"Ibáñez M, Boehme SC, Buonsanti R, et al. Prospects of nanoscience with nanocrystals: 2025 edition. ACS Nano. 2025;19(36):31969–32051. doi:10.1021/acsnano.5c07838"},"article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["1936-086X"],"issn":["1936-0851"]},"type":"journal_article","_id":"20329","status":"public","date_updated":"2025-12-30T09:35:54Z","issue":"36","month":"09","abstract":[{"lang":"eng","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."}],"volume":19,"article_type":"review","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","isi":1,"has_accepted_license":"1","title":"Prospects of nanoscience with nanocrystals: 2025 edition","author":[{"first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843"},{"first_name":"Simon C.","last_name":"Boehme","full_name":"Boehme, Simon C."},{"last_name":"Buonsanti","full_name":"Buonsanti, Raffaella","first_name":"Raffaella"},{"last_name":"De Roo","full_name":"De Roo, Jonathan","first_name":"Jonathan"},{"first_name":"Delia J.","last_name":"Milliron","full_name":"Milliron, Delia J."},{"last_name":"Ithurria","full_name":"Ithurria, Sandrine","first_name":"Sandrine"},{"first_name":"Andrey L.","last_name":"Rogach","full_name":"Rogach, Andrey L."},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"},{"first_name":"Maksym","full_name":"Yarema, Maksym","last_name":"Yarema"},{"last_name":"Cossairt","full_name":"Cossairt, Brandi M.","first_name":"Brandi M."},{"first_name":"Peter","full_name":"Reiss, Peter","last_name":"Reiss"},{"full_name":"Talapin, Dmitri V.","last_name":"Talapin","first_name":"Dmitri V."},{"last_name":"Protesescu","full_name":"Protesescu, Loredana","first_name":"Loredana"},{"full_name":"Hens, Zeger","last_name":"Hens","first_name":"Zeger"},{"first_name":"Ivan","last_name":"Infante","full_name":"Infante, Ivan"},{"last_name":"Bodnarchuk","full_name":"Bodnarchuk, Maryna I.","first_name":"Maryna I."},{"first_name":"Xingchen","last_name":"Ye","full_name":"Ye, Xingchen"},{"last_name":"Wang","full_name":"Wang, Yuanyuan","first_name":"Yuanyuan"},{"first_name":"Hao","last_name":"Zhang","full_name":"Zhang, Hao"},{"first_name":"Emmanuel","full_name":"Lhuillier, Emmanuel","last_name":"Lhuillier"},{"first_name":"Victor I.","last_name":"Klimov","full_name":"Klimov, Victor I."},{"full_name":"Utzat, Hendrik","last_name":"Utzat","first_name":"Hendrik"},{"full_name":"Rainò, Gabriele","last_name":"Rainò","first_name":"Gabriele"},{"full_name":"Kagan, Cherie R.","last_name":"Kagan","first_name":"Cherie R."},{"last_name":"Cargnello","full_name":"Cargnello, Matteo","first_name":"Matteo"},{"full_name":"Son, Jae Sung","last_name":"Son","first_name":"Jae Sung"},{"full_name":"Kovalenko, Maksym V.","last_name":"Kovalenko","first_name":"Maksym V."}],"date_published":"2025-09-03T00:00:00Z","publication_status":"published","page":" 31969–32051","publication":"ACS Nano","file":[{"file_size":10956272,"date_created":"2025-12-30T09:35:44Z","file_id":"20909","content_type":"application/pdf","file_name":"2025_ACSNano_Ibanez.pdf","access_level":"open_access","creator":"dernst","success":1,"checksum":"81144f848478a130721e9ffa87b6831e","relation":"main_file","date_updated":"2025-12-30T09:35:44Z"}],"pmid":1,"quality_controlled":"1","publisher":"American Chemical Society","doi":"10.1021/acsnano.5c07838","day":"03","OA_type":"hybrid","scopus_import":"1","ddc":["540"],"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).","PlanS_conform":"1","file_date_updated":"2025-12-30T09:35:44Z","oa":1,"date_created":"2025-09-10T05:47:13Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","OA_place":"publisher","external_id":{"isi":["001562960800001"],"pmid":["40902118"]},"language":[{"iso":"eng"}],"project":[{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"department":[{"_id":"MaIb"}],"intvolume":" 19","year":"2025"},{"language":[{"iso":"eng"}],"external_id":{"isi":["001598595000001"]},"OA_place":"publisher","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-10T05:48:04Z","oa":1,"file_date_updated":"2026-01-05T13:03:18Z","PlanS_conform":"1","ec_funded":1,"year":"2025","department":[{"_id":"BeVi"},{"_id":"NiBa"}],"intvolume":" 231","project":[{"grant_number":"25817","name":"Sexual conflict: resolution, constraints and biomedical implications","_id":"9B9DFC9E-BA93-11EA-9121-9846C619BF3A"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"},{"name":"Understanding the evolution of continuous genomes","_id":"bd6958e0-d553-11ed-ba76-86eba6a76c00","grant_number":"101055327"}],"day":"01","OA_type":"hybrid","doi":"10.1093/genetics/iyaf175","publisher":"Oxford University Press","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.","ddc":["570"],"scopus_import":"1","article_number":"iyaf175","date_published":"2025-11-01T00:00:00Z","author":[{"last_name":"Puixeu Sala","orcid":"0000-0001-8330-1754","full_name":"Puixeu Sala, Gemma","id":"33AB266C-F248-11E8-B48F-1D18A9856A87","first_name":"Gemma"},{"full_name":"Hayward, Laura","last_name":"Hayward","first_name":"Laura","id":"fc885ee5-24bf-11eb-ad7b-bcc5104c0c1b"}],"title":"The relationship between sexual dimorphism and intersex correlation: Do models support intuition?","quality_controlled":"1","file":[{"file_id":"20946","file_name":"2025_Genetics_Puixeu.pdf","access_level":"open_access","content_type":"application/pdf","date_created":"2026-01-05T13:03:18Z","file_size":1550562,"date_updated":"2026-01-05T13:03:18Z","success":1,"creator":"dernst","relation":"main_file","checksum":"bbb73bbf8617812d4d8db4af92be9538"}],"publication":"Genetics","publication_status":"published","_id":"20330","status":"public","type":"journal_article","publication_identifier":{"issn":["1943-2631"]},"article_processing_charge":"Yes (via OA deal)","citation":{"apa":"Puixeu Sala, G., & Hayward, L. (2025). The relationship between sexual dimorphism and intersex correlation: Do models support intuition? Genetics. Oxford University Press. https://doi.org/10.1093/genetics/iyaf175","ama":"Puixeu Sala G, Hayward L. The relationship between sexual dimorphism and intersex correlation: Do models support intuition? Genetics. 2025;231(3). doi:10.1093/genetics/iyaf175","mla":"Puixeu Sala, Gemma, and Laura Hayward. “The Relationship between Sexual Dimorphism and Intersex Correlation: Do Models Support Intuition?” Genetics, vol. 231, no. 3, iyaf175, Oxford University Press, 2025, doi:10.1093/genetics/iyaf175.","ieee":"G. Puixeu Sala and L. Hayward, “The relationship between sexual dimorphism and intersex correlation: Do models support intuition?,” Genetics, vol. 231, no. 3. Oxford University Press, 2025.","chicago":"Puixeu Sala, Gemma, and Laura Hayward. “The Relationship between Sexual Dimorphism and Intersex Correlation: Do Models Support Intuition?” Genetics. Oxford University Press, 2025. https://doi.org/10.1093/genetics/iyaf175.","ista":"Puixeu Sala G, Hayward L. 2025. The relationship between sexual dimorphism and intersex correlation: Do models support intuition? Genetics. 231(3), iyaf175.","short":"G. Puixeu Sala, L. Hayward, Genetics 231 (2025)."},"has_accepted_license":"1","oa_version":"Published Version","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"article_type":"original","volume":231,"month":"11","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."}],"issue":"3","date_updated":"2026-01-05T13:04:07Z"},{"publication_identifier":{"eissn":["2662-4435"]},"type":"journal_article","citation":{"ama":"Jouberton A, Shaw T, Miles E, et al. Snowfall decrease in recent years undermines glacier health and meltwater resources in the Northwestern Pamirs. Communications Earth and Environment. 2025;6. doi:10.1038/s43247-025-02611-8","apa":"Jouberton, A., Shaw, T., Miles, E., Kneib, M., Fugger, S., Buri, P., … Pellicciotti, F. (2025). Snowfall decrease in recent years undermines glacier health and meltwater resources in the Northwestern Pamirs. Communications Earth and Environment. Springer Nature. https://doi.org/10.1038/s43247-025-02611-8","short":"A. Jouberton, T. Shaw, E. Miles, M. Kneib, S. Fugger, P. Buri, M. McCarthy, A. Kayumov, H. Navruzshoev, A. Halimov, K. Kabutov, F. Homidov, F. Pellicciotti, Communications Earth and Environment 6 (2025).","ista":"Jouberton A, Shaw T, Miles E, Kneib M, Fugger S, Buri P, McCarthy M, Kayumov A, Navruzshoev H, Halimov A, Kabutov K, Homidov F, Pellicciotti F. 2025. Snowfall decrease in recent years undermines glacier health and meltwater resources in the Northwestern Pamirs. Communications Earth and Environment. 6, 691.","chicago":"Jouberton, Achille, Thomas Shaw, Evan Miles, Marin Kneib, Stefan Fugger, Pascal Buri, Michael McCarthy, et al. “Snowfall Decrease in Recent Years Undermines Glacier Health and Meltwater Resources in the Northwestern Pamirs.” Communications Earth and Environment. Springer Nature, 2025. https://doi.org/10.1038/s43247-025-02611-8.","ieee":"A. Jouberton et al., “Snowfall decrease in recent years undermines glacier health and meltwater resources in the Northwestern Pamirs,” Communications Earth and Environment, vol. 6. Springer Nature, 2025.","mla":"Jouberton, Achille, et al. “Snowfall Decrease in Recent Years Undermines Glacier Health and Meltwater Resources in the Northwestern Pamirs.” Communications Earth and Environment, vol. 6, 691, Springer Nature, 2025, doi:10.1038/s43247-025-02611-8."},"article_processing_charge":"Yes","status":"public","_id":"20348","related_material":{"link":[{"url":"https://ista.ac.at/en/news/the-tipping-of-the-last-resilient-glaciers/","relation":"press_release","description":"News on ISTA website"}]},"article_type":"original","date_updated":"2026-04-28T13:25:55Z","abstract":[{"lang":"eng","text":"Central Asia hosts some of the world’s last relatively healthy mountain glaciers and is heavily dependent on snow and ice melt for downstream water supply, though the causes of this stable glacier state are not known. We combine recent in-situ observations, climate reanalysis and remote sensing data to force a land-surface model to reconstruct glacier changes over the last two decades (1999–2023) and disentangle their causes over a benchmark glacierized catchment in Tajikistan. We show that snowfall and snow depth have been substantially lower since 2018, leading to a decline in glacier health and reduced runoff generation. Remote-sensing observations confirm wider snow depletion across the Northwestern Pamirs, suggesting that a lack of snowfall might be a cause of mass losses regionally. Our results provide an explanation for the recent decline in glacier health in the region, and reinforce the need to better understand the variability of precipitation."}],"month":"09","volume":6,"isi":1,"oa_version":"Published Version","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"title":"Snowfall decrease in recent years undermines glacier health and meltwater resources in the Northwestern Pamirs","author":[{"first_name":"Achille","id":"f2426a39-920b-11f0-ac40-cbeda2086b9c","full_name":"Jouberton, Achille","last_name":"Jouberton"},{"id":"3caa3f91-1f03-11ee-96ce-e0e553054d6e","first_name":"Thomas","last_name":"Shaw","orcid":"0000-0001-7640-6152","full_name":"Shaw, Thomas"},{"full_name":"Miles, Evan","last_name":"Miles","first_name":"Evan"},{"first_name":"Marin","full_name":"Kneib, Marin","last_name":"Kneib"},{"full_name":"Fugger, Stefan","last_name":"Fugger","first_name":"Stefan","id":"86698d64-c4c6-11ee-af02-cdf1e6a7d31f"},{"first_name":"Pascal","id":"317987aa-9421-11ee-ac5a-b941b041abba","full_name":"Buri, Pascal","last_name":"Buri"},{"id":"22a2674a-61ce-11ee-94b5-d18813baf16f","first_name":"Michael","last_name":"Mccarthy","full_name":"Mccarthy, Michael"},{"last_name":"Kayumov","full_name":"Kayumov, Abdulhamid","first_name":"Abdulhamid"},{"full_name":"Navruzshoev, Hofiz","last_name":"Navruzshoev","first_name":"Hofiz"},{"first_name":"Ardamehr","last_name":"Halimov","full_name":"Halimov, Ardamehr"},{"last_name":"Kabutov","full_name":"Kabutov, Khusrav","first_name":"Khusrav"},{"first_name":"Farrukh","last_name":"Homidov","full_name":"Homidov, Farrukh"},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","orcid":"0000-0002-5554-8087","first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"}],"date_published":"2025-09-02T00:00:00Z","article_number":"691","publication_status":"published","pmid":1,"quality_controlled":"1","publication":"Communications Earth and Environment","file":[{"date_updated":"2025-09-15T08:16:09Z","success":1,"creator":"dernst","relation":"main_file","checksum":"62f9740c6cf564879006f4d97b58b608","file_id":"20356","file_name":"2025_CommEarthEnvir_Jouberton.pdf","content_type":"application/pdf","access_level":"open_access","file_size":3840094,"date_created":"2025-09-15T08:16:09Z"}],"doi":"10.1038/s43247-025-02611-8","publisher":"Springer Nature","OA_type":"gold","day":"02","DOAJ_listed":"1","ddc":["550"],"acknowledgement":"This work was made possible with funding from the Swiss National Science Foundation (ASCENT Project 189890, Understanding snow, glacier and rivers response to climate in High Mountain Asia). It was also supported by the ERC Consolidator RAVEN project No. 772751, Rapid mass losses of debris-covered glaciers in High Mountain Asia. Fieldwork funding support for the repeated visits to Tajikistan was also received from the Swiss Polar Institute Flagship Programme PAMIR (SPI-FLAG-2021-001) and the Swiss National Science Foundation (HOPE Project 183633, High-elevation precipitation in High Mountain Asia). We would like to thank Firdavs Vosidov, Ubaydullo Ubaydulloev, Tojiddin Rasulzoda and Iskandarov Handullo from the Center for the Research of Glaciers, Tajik National Academy of Sciences (CRG-TAS), for their invaluable support over multiple field campaigns at the study site. We thank Nazrialo Sheralizoda, current director of CRG-TAS, and Tomas Saks from the University of Fribourg for their support in enabling and coordinating the ongoing collaborative monitoring and measurements at the site. Marin Kneib acknowledges the funding from the Swiss National Science Foundation (SNSF) under the Contribution of avalanches to glacier mass balance (CAIRN) Postdoc Mobility program (grant agreement P500PN_210739). We extend our thanks to Hamish Pritchard and Federico Covi at BAS for their help with the processing of lake water pressure data. Finally, we thank the photographer Jason Klimatsas for the photos he took which we use in Fig. 1b and Supplementary Fig. S1. Pleiades stereo imagery was acquired through the CNES ISIS programme.","scopus_import":"1","date_created":"2025-09-14T22:01:31Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","file_date_updated":"2025-09-15T08:16:09Z","PlanS_conform":"1","oa":1,"external_id":{"pmid":["40910036"],"isi":["001563848700001"]},"language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","intvolume":" 6","year":"2025","department":[{"_id":"FrPe"}]}]