[{"acknowledgement":"This work is a part of project VAMOS that has received funding from the European\r\nResearch Council (ERC), grant agreement No 101020093. We thank anonymous reviewers for pointing us to the Hurwicz criterion and to the work of Gallego-Hernández and Mansutti [13]. We thank Marie van den Bogaard for her valuable feedback on the first author’s PhD dissertation, which helped improve the quality of this work. ","has_accepted_license":"1","file":[{"creator":"dernst","content_type":"application/pdf","file_id":"20306","date_updated":"2025-09-08T07:11:12Z","success":1,"checksum":"9bc6b8e537662d371d2a27444cbc0b75","file_size":1149694,"file_name":"2025_MFCS_Brice.pdf","date_created":"2025-09-08T07:11:12Z","relation":"main_file","access_level":"open_access"}],"OA_place":"publisher","author":[{"first_name":"Léonard","last_name":"Brice","full_name":"Brice, Léonard"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Thejaswini","first_name":"K. S.","full_name":"Thejaswini, K. S.","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753"}],"arxiv":1,"external_id":{"arxiv":["2502.0531"]},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","project":[{"grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"date_published":"2025-08-20T00:00:00Z","intvolume":"       345","publication_identifier":{"isbn":["9783959773881"],"issn":["1868-8969"]},"_id":"20290","department":[{"_id":"ToHe"}],"date_created":"2025-09-07T22:01:32Z","citation":{"ama":"Brice L, Henzinger TA, Thejaswini KS. Finding equilibria: Simpler for pessimists, simplest for optimists. In: <i>50th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.30\">10.4230/LIPIcs.MFCS.2025.30</a>","ieee":"L. Brice, T. A. Henzinger, and K. S. Thejaswini, “Finding equilibria: Simpler for pessimists, simplest for optimists,” in <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, Warsaw, Poland, 2025, vol. 345.","apa":"Brice, L., Henzinger, T. A., &#38; Thejaswini, K. S. (2025). Finding equilibria: Simpler for pessimists, simplest for optimists. In <i>50th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.30\">https://doi.org/10.4230/LIPIcs.MFCS.2025.30</a>","short":"L. Brice, T.A. Henzinger, K.S. Thejaswini, in:, 50th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","mla":"Brice, Léonard, et al. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 345, 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.30\">10.4230/LIPIcs.MFCS.2025.30</a>.","ista":"Brice L, Henzinger TA, Thejaswini KS. 2025. Finding equilibria: Simpler for pessimists, simplest for optimists. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 30.","chicago":"Brice, Léonard, Thomas A Henzinger, and K. S. Thejaswini. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” In <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.30\">https://doi.org/10.4230/LIPIcs.MFCS.2025.30</a>."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","month":"08","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"day":"20","OA_type":"gold","conference":{"start_date":"2025-08-25","location":"Warsaw, Poland","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2025-08-29"},"oa":1,"title":"Finding equilibria: Simpler for pessimists, simplest for optimists","volume":345,"year":"2025","alternative_title":["LIPIcs"],"article_number":"30","language":[{"iso":"eng"}],"corr_author":"1","abstract":[{"text":"We consider equilibria in multiplayer stochastic graph games with terminal-node rewards. In such games, Nash equilibria are defined assuming that each player seeks to maximise their expected payoff, ignoring their aversion or tolerance to risk. We therefore study risk-sensitive equilibria (RSEs), where the expected payoff is replaced by a risk measure. A classical risk measure in the literature is the entropic risk measure, where each player has a real valued parameter capturing their risk-averseness. We introduce the extreme risk measure, which corresponds to extreme cases of entropic risk measure, where players are either extreme optimists or extreme pessimists. Under extreme risk measure, every player is an extremist: an extreme optimist perceives their reward as the maximum payoff that can be achieved with positive probability, while an extreme pessimist expects the minimum payoff achievable with positive probability. We argue that the extreme risk measure, especially in multi-player graph based settings, is particularly relevant as they can model several real life instances such as interactions between secure systems and potential security threats, or distributed controls for safety critical systems. We prove that RSEs defined with the extreme risk measure are guaranteed to exist when all rewards are non-negative. Furthermore, we prove that the problem of deciding whether a given game contains an RSE that generates risk measures within specified intervals is decidable and NP-complete for our extreme risk measure, and even PTIME-complete when all players are extreme optimists, while that same problem is undecidable using the entropic risk measure or even the classical expected payoff. This establishes, to our knowledge, the first decidable fragment for equilibria in simple stochastic games without restrictions on strategy types or number of players.","lang":"eng"}],"file_date_updated":"2025-09-08T07:11:12Z","ec_funded":1,"doi":"10.4230/LIPIcs.MFCS.2025.30","publication_status":"published","date_updated":"2025-09-08T07:15:40Z","type":"conference","publication":"50th International Symposium on Mathematical Foundations of Computer Science","ddc":["000"],"scopus_import":"1","article_processing_charge":"Yes"},{"date_created":"2025-09-07T22:01:32Z","department":[{"_id":"ToHe"}],"citation":{"ista":"Henzinger TA, Prakash A, Thejaswini KS. 2025. Resolving nondeterminism with randomness. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 57.","short":"T.A. Henzinger, A. Prakash, K.S. Thejaswini, in:, 50th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","mla":"Henzinger, Thomas A., et al. “Resolving Nondeterminism with Randomness.” <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 345, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.57\">10.4230/LIPIcs.MFCS.2025.57</a>.","chicago":"Henzinger, Thomas A, Aditya Prakash, and K. S. Thejaswini. “Resolving Nondeterminism with Randomness.” In <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.57\">https://doi.org/10.4230/LIPIcs.MFCS.2025.57</a>.","apa":"Henzinger, T. A., Prakash, A., &#38; Thejaswini, K. S. (2025). Resolving nondeterminism with randomness. In <i>50th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.57\">https://doi.org/10.4230/LIPIcs.MFCS.2025.57</a>","ieee":"T. A. Henzinger, A. Prakash, and K. S. Thejaswini, “Resolving nondeterminism with randomness,” in <i>50th International Symposium on Mathematical Foundations of Computer Science</i>, Warsaw, Poland, 2025, vol. 345.","ama":"Henzinger TA, Prakash A, Thejaswini KS. Resolving nondeterminism with randomness. In: <i>50th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2025.57\">10.4230/LIPIcs.MFCS.2025.57</a>"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","month":"08","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"}],"quality_controlled":"1","date_published":"2025-08-20T00:00:00Z","_id":"20291","publication_identifier":{"isbn":["9783959773881"],"issn":["1868-8969"]},"intvolume":"       345","OA_place":"publisher","arxiv":1,"external_id":{"arxiv":["2502.12872"]},"author":[{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"full_name":"Prakash, Aditya","last_name":"Prakash","first_name":"Aditya"},{"id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","full_name":"Thejaswini, K. S.","first_name":"K. S.","last_name":"Thejaswini"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"access_level":"open_access","relation":"main_file","date_created":"2025-09-08T06:56:56Z","file_name":"2025_MFCS_HenzingerT.pdf","file_size":1009644,"success":1,"checksum":"6068b772aba6cb0d01f3e5a90abed973","file_id":"20305","date_updated":"2025-09-08T06:56:56Z","content_type":"application/pdf","creator":"dernst"}],"has_accepted_license":"1","acknowledgement":"This work is a part of project VAMOS that has received funding from the European Research Council (ERC), grant agreement No 101020093.","article_processing_charge":"No","type":"conference","publication":"50th International Symposium on Mathematical Foundations of Computer Science","date_updated":"2025-09-08T07:06:11Z","scopus_import":"1","ddc":["000"],"file_date_updated":"2025-09-08T06:56:56Z","ec_funded":1,"doi":"10.4230/LIPIcs.MFCS.2025.57","publication_status":"published","oa":1,"day":"20","OA_type":"gold","conference":{"end_date":"2025-08-29","name":"MFCS: Mathematical Foundations of Computer Science","location":"Warsaw, Poland","start_date":"2025-08-25"},"alternative_title":["LIPIcs"],"year":"2025","title":"Resolving nondeterminism with randomness","volume":345,"article_number":"57","language":[{"iso":"eng"}],"abstract":[{"text":"We define and study classes of ω-regular automata for which the nondeterminism can be resolved by a policy that uses a combination of memory and randomness on any input word, based solely on the prefix read so far. We examine two settings for providing the input word to an automaton. In the first setting, called adversarial resolvability, the input word is constructed letter-by-letter by an adversary, dependent on the resolver’s previous decisions. In the second setting, called stochastic resolvability, the adversary pre-commits to an infinite word and reveals it letter-by-letter. In each setting, we require the existence of an almost-sure resolver, i.e., a policy that ensures that as long as the adversary provides a word in the language of the underlying nondeterministic automaton, the run constructed by the policy is accepting with probability 1.\r\nThe class of automata that are adversarially resolvable is the well-studied class of history-deterministic automata. The case of stochastically resolvable automata, on the other hand, defines a novel class. Restricting the class of resolvers in both settings to stochastic policies without memory introduces two additional new classes of automata. We show that the new automata classes offer interesting trade-offs between succinctness, expressivity, and computational complexity, providing a fine gradation between deterministic automata and nondeterministic automata.","lang":"eng"}],"corr_author":"1"},{"citation":{"ieee":"A. Gupta, T. A. Henzinger, K. Kueffner, K. Mallik, and D. Pape, “Monitoring robustness and individual fairness,” in <i>Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, Toronto, Canada, 2025, vol. 2, pp. 790–801.","ama":"Gupta A, Henzinger TA, Kueffner K, Mallik K, Pape D. Monitoring robustness and individual fairness. In: <i>Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>. Vol 2. Association for Computing Machinery; 2025:790-801. doi:<a href=\"https://doi.org/10.1145/3711896.3737054\">10.1145/3711896.3737054</a>","apa":"Gupta, A., Henzinger, T. A., Kueffner, K., Mallik, K., &#38; Pape, D. (2025). Monitoring robustness and individual fairness. In <i>Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i> (Vol. 2, pp. 790–801). Toronto, Canada: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3711896.3737054\">https://doi.org/10.1145/3711896.3737054</a>","ista":"Gupta A, Henzinger TA, Kueffner K, Mallik K, Pape D. 2025. Monitoring robustness and individual fairness. Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining. KDD: Conference on Knowledge Discovery and Data Mining vol. 2, 790–801.","short":"A. Gupta, T.A. Henzinger, K. Kueffner, K. Mallik, D. Pape, in:, Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery, 2025, pp. 790–801.","mla":"Gupta, Ashutosh, et al. “Monitoring Robustness and Individual Fairness.” <i>Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, vol. 2, Association for Computing Machinery, 2025, pp. 790–801, doi:<a href=\"https://doi.org/10.1145/3711896.3737054\">10.1145/3711896.3737054</a>.","chicago":"Gupta, Ashutosh, Thomas A Henzinger, Konstantin Kueffner, Kaushik Mallik, and David Pape. “Monitoring Robustness and Individual Fairness.” In <i>Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, 2:790–801. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1145/3711896.3737054\">https://doi.org/10.1145/3711896.3737054</a>."},"publisher":"Association for Computing Machinery","date_created":"2025-09-07T22:01:33Z","department":[{"_id":"ToHe"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"page":"790-801","month":"08","status":"public","date_published":"2025-08-03T00:00:00Z","quality_controlled":"1","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"_id":"20292","intvolume":"         2","publication_identifier":{"isbn":["9798400714542"],"issn":["2154-817X"]},"external_id":{"arxiv":["2506.00496"]},"arxiv":1,"author":[{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta","first_name":"Ashutosh"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"},{"orcid":"0000-0001-8974-2542","full_name":"Kueffner, Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","last_name":"Kueffner","first_name":"Konstantin"},{"last_name":"Mallik","first_name":"Kaushik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"full_name":"Pape, David","last_name":"Pape","first_name":"David"}],"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","related_material":{"link":[{"url":"https://github.com/ariez-xyz/clemont","relation":"software"}]},"file":[{"date_created":"2025-09-08T08:46:31Z","relation":"main_file","access_level":"open_access","success":1,"file_size":7745940,"checksum":"81e18cdf9ca5f6dfa79425b326ea9725","file_name":"2025_KDD_Gupta.pdf","date_updated":"2025-09-08T08:46:31Z","file_id":"20310","creator":"dernst","content_type":"application/pdf"}],"acknowledgement":"This work was supported in part by the ERC project ERC-2020-AdG 101020093 and the SBI Foundation Hub for Data Science &Analytics, IIT Bombay.","has_accepted_license":"1","article_processing_charge":"No","publication":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","type":"conference","date_updated":"2025-09-08T08:54:24Z","scopus_import":"1","ddc":["000"],"ec_funded":1,"file_date_updated":"2025-09-08T08:46:31Z","publication_status":"published","doi":"10.1145/3711896.3737054","year":"2025","volume":2,"title":"Monitoring robustness and individual fairness","oa":1,"conference":{"start_date":"2025-08-03","location":"Toronto, Canada","end_date":"2025-08-07","name":"KDD: Conference on Knowledge Discovery and Data Mining"},"day":"03","corr_author":"1","abstract":[{"lang":"eng","text":"In automated decision-making, it is desirable that outputs of decision-makers be robust to slight perturbations in their inputs, a property that may be called input-output robustness. Input-output robustness appears in various different forms in the literature, such as robustness of AI models to adversarial or semantic perturbations and individual fairness of AI models that make decisions about humans. We propose runtime monitoring of input-output robustness of deployed, black-box AI models, where the goal is to design monitors that would observe one long execution sequence of the model, and would raise an alarm whenever it is detected that two similar inputs from the past led to dissimilar outputs. This way, monitoring will complement existing offline ''robustification'' approaches to increase the trustworthiness of AI decision-makers. We show that the monitoring problem can be cast as the fixed-radius nearest neighbor (FRNN) search problem, which, despite being well-studied, lacks suitable online solutions. We present our tool Clemont, which offers a number of lightweight monitors, some of which use upgraded online variants of existing FRNN algorithms, and one uses a novel algorithm based on binary decision diagrams--a data-structure commonly used in software and hardware verification. We have also developed an efficient parallelization technique that can substantially cut down the computation time of monitors for which the distance between input-output pairs is measured using the L∞norm. Using standard benchmarks from the literature of adversarial and semantic robustness and individual fairness, we perform a comparative study of different monitors in Clemont, and demonstrate their effectiveness in correctly detecting robustness violations at runtime."}],"language":[{"iso":"eng"}]},{"scopus_import":"1","ddc":["500"],"publication":"Entropy","type":"journal_article","PlanS_conform":"1","date_updated":"2025-09-30T14:32:31Z","article_type":"original","article_processing_charge":"Yes","abstract":[{"lang":"eng","text":"Motivated by questions arising at the intersection of information theory and geometry, we compare two dissimilarity measures between finite categorical distributions. One is the well-known Jensen–Shannon divergence, which is easy to compute and whose square root is a proper metric. The other is what we call the minmax divergence, which is harder to compute. Just like the Jensen–Shannon divergence, it arises naturally from the Kullback–Leibler divergence. The main contribution of this paper is a proof showing that the minmax divergence can be tightly approximated by the Jensen–Shannon divergence. The bounds suggest that the square root of the minmax divergence is a metric, and we prove that this is indeed true in the one-dimensional case. The general case remains open. Finally, we consider analogous questions in the context of another Bregman divergence and the corresponding Burbea–Rao (Jensen–Bregman) divergence."}],"corr_author":"1","article_number":"854","language":[{"iso":"eng"}],"year":"2025","volume":27,"title":"Tight bounds between the Jensen–Shannon divergence and the minmax divergence","oa":1,"OA_type":"gold","day":"01","publication_status":"published","doi":"10.3390/e27080854","ec_funded":1,"file_date_updated":"2025-09-08T07:55:48Z","_id":"20293","publication_identifier":{"eissn":["1099-4300"]},"intvolume":"        27","issue":"8","date_published":"2025-08-01T00:00:00Z","quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"I02979-N35","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"month":"08","status":"public","publisher":"MDPI","citation":{"short":"A. Akopyan, H. Edelsbrunner, Z. Virk, H. Wagner, Entropy 27 (2025).","mla":"Akopyan, Arseniy, et al. “Tight Bounds between the Jensen–Shannon Divergence and the Minmax Divergence.” <i>Entropy</i>, vol. 27, no. 8, 854, MDPI, 2025, doi:<a href=\"https://doi.org/10.3390/e27080854\">10.3390/e27080854</a>.","ista":"Akopyan A, Edelsbrunner H, Virk Z, Wagner H. 2025. Tight bounds between the Jensen–Shannon divergence and the minmax divergence. Entropy. 27(8), 854.","chicago":"Akopyan, Arseniy, Herbert Edelsbrunner, Ziga Virk, and Hubert Wagner. “Tight Bounds between the Jensen–Shannon Divergence and the Minmax Divergence.” <i>Entropy</i>. MDPI, 2025. <a href=\"https://doi.org/10.3390/e27080854\">https://doi.org/10.3390/e27080854</a>.","ieee":"A. Akopyan, H. Edelsbrunner, Z. Virk, and H. Wagner, “Tight bounds between the Jensen–Shannon divergence and the minmax divergence,” <i>Entropy</i>, vol. 27, no. 8. MDPI, 2025.","ama":"Akopyan A, Edelsbrunner H, Virk Z, Wagner H. Tight bounds between the Jensen–Shannon divergence and the minmax divergence. <i>Entropy</i>. 2025;27(8). doi:<a href=\"https://doi.org/10.3390/e27080854\">10.3390/e27080854</a>","apa":"Akopyan, A., Edelsbrunner, H., Virk, Z., &#38; Wagner, H. (2025). Tight bounds between the Jensen–Shannon divergence and the minmax divergence. <i>Entropy</i>. MDPI. <a href=\"https://doi.org/10.3390/e27080854\">https://doi.org/10.3390/e27080854</a>"},"department":[{"_id":"HeEd"}],"date_created":"2025-09-07T22:01:33Z","file":[{"content_type":"application/pdf","creator":"dernst","file_id":"20309","date_updated":"2025-09-08T07:55:48Z","file_name":"2025_Entropy_Akopyan.pdf","success":1,"file_size":379340,"checksum":"65c5399c4015d9c8abb8c7a96f3d7836","access_level":"open_access","relation":"main_file","date_created":"2025-09-08T07:55:48Z"}],"has_accepted_license":"1","acknowledgement":"This research received partial funding from the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, the\r\nWittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, the DFG Collaborative\r\nResearch Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35, and the 2022 Google Research Scholar Award for project ‘Algorithms for Topological Analysis of Neural Networks’. The APC was waived.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","DOAJ_listed":"1","external_id":{"pmid":["40870326"],"isi":["001557476000001"]},"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","first_name":"Arseniy","last_name":"Akopyan"},{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"2E36B656-F248-11E8-B48F-1D18A9856A87","full_name":"Virk, Ziga","last_name":"Virk","first_name":"Ziga"},{"id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert","last_name":"Wagner","first_name":"Hubert"}],"pmid":1,"OA_place":"publisher","isi":1},{"date_updated":"2026-02-16T12:12:36Z","PlanS_conform":"1","type":"journal_article","publication":"Astronomy & Astrophysics","ddc":["520"],"scopus_import":"1","article_type":"original","article_processing_charge":"No","volume":700,"title":"No [C II] or dust detection in two Little Red Dots at zspec > 7","year":"2025","OA_type":"diamond","day":"01","oa":1,"abstract":[{"lang":"eng","text":"Little Red Dots (LRDs) are compact, point-like sources characterized by their red color and broad Balmer lines; it is a matter of debate whether they are dominated by active galactic nuclei (AGNs) or dusty star-forming galaxies (DSFGs). Here we report two LRDs (ID9094 and ID2756) at zspec > 7 recently discovered in the JWST FRESCO GOODS-North field. Both satisfy the “v-shaped” color and compactness criteria for LRDs and are identified as Type-I AGN candidates based on their broad Hβ emission lines (full width at half maximum: 2280 ± 490 km s−1 for ID9094 and 1070 ± 240 km s−1 for ID2756) and narrow [O III] lines (≃300 − 400 km s−1). To investigate their nature, we conducted deep NOEMA follow-up observations targeting the [C II] 158 μm emission line and the 1.3 mm dust continuum. We do not detect [C II] or 1.3 mm continuum emission for either source. If the two LRDs were DSFGs, we would expect significant detections: > 16σ for [C II] and > 3σ for the 1.3 mm continuum of ID9094, and > 5σ for the [C II] of ID2756. Using the 3σ upper limits of [C II] and 1.3 mm, we performed two analyses: (1) UV-to-far-infrared spectral energy distribution fitting with and without AGN components, and (2) comparison of their properties with the L[C II]–SFRtot empirical relation. Both analyses are consistent with a scenario in which AGN activity contributes to the observed properties, though a dusty star-forming origin cannot be fully ruled out. Our results highlight the importance of far-infrared observations for studying LRDs, a regime that remains largely unexplored."}],"article_number":"A231","language":[{"iso":"eng"}],"file_date_updated":"2025-09-08T07:40:53Z","publication_status":"published","doi":"10.1051/0004-6361/202554361","date_published":"2025-08-01T00:00:00Z","quality_controlled":"1","intvolume":"       700","publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"_id":"20294","publisher":"EDP Sciences","citation":{"ama":"Xiao M, Oesch PA, Bing L, et al. No [C II] or dust detection in two Little Red Dots at zspec &#62; 7. <i>Astronomy &#38; Astrophysics</i>. 2025;700. doi:<a href=\"https://doi.org/10.1051/0004-6361/202554361\">10.1051/0004-6361/202554361</a>","ieee":"M. Xiao <i>et al.</i>, “No [C II] or dust detection in two Little Red Dots at zspec &#62; 7,” <i>Astronomy &#38; Astrophysics</i>, vol. 700. EDP Sciences, 2025.","apa":"Xiao, M., Oesch, P. A., Bing, L., Elbaz, D., Matthee, J. J., Fudamoto, Y., … Wang, T. (2025). No [C II] or dust detection in two Little Red Dots at zspec &#62; 7. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202554361\">https://doi.org/10.1051/0004-6361/202554361</a>","chicago":"Xiao, Mengyuan, Pascal A. Oesch, Longji Bing, David Elbaz, Jorryt J Matthee, Yoshinobu Fudamoto, Seiji Fujimoto, et al. “No [C II] or Dust Detection in Two Little Red Dots at Zspec &#62; 7.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2025. <a href=\"https://doi.org/10.1051/0004-6361/202554361\">https://doi.org/10.1051/0004-6361/202554361</a>.","short":"M. Xiao, P.A. Oesch, L. Bing, D. Elbaz, J.J. Matthee, Y. Fudamoto, S. Fujimoto, R. Marques-Chaves, C.C. Williams, M. Dessauges-Zavadsky, F. Valentino, G. Brammer, A. Covelo-Paz, E. Daddi, J.P.U. Fynbo, S. Gillman, M. Ginolfi, E. Giovinazzo, J.E. Greene, Q. Gu, G. Illingworth, K. Inayoshi, V. Kokorev, R.A. Meyer, R.P. Naidu, N.A. Reddy, D. Schaerer, A. Shapley, M. Stefanon, C.L. Steinhardt, D.J. Setton, M. Vestergaard, T. Wang, Astronomy &#38; Astrophysics 700 (2025).","mla":"Xiao, Mengyuan, et al. “No [C II] or Dust Detection in Two Little Red Dots at Zspec &#62; 7.” <i>Astronomy &#38; Astrophysics</i>, vol. 700, A231, EDP Sciences, 2025, doi:<a href=\"https://doi.org/10.1051/0004-6361/202554361\">10.1051/0004-6361/202554361</a>.","ista":"Xiao M, Oesch PA, Bing L, Elbaz D, Matthee JJ, Fudamoto Y, Fujimoto S, Marques-Chaves R, Williams CC, Dessauges-Zavadsky M, Valentino F, Brammer G, Covelo-Paz A, Daddi E, Fynbo JPU, Gillman S, Ginolfi M, Giovinazzo E, Greene JE, Gu Q, Illingworth G, Inayoshi K, Kokorev V, Meyer RA, Naidu RP, Reddy NA, Schaerer D, Shapley A, Stefanon M, Steinhardt CL, Setton DJ, Vestergaard M, Wang T. 2025. No [C II] or dust detection in two Little Red Dots at zspec &#62; 7. Astronomy &#38; Astrophysics. 700, A231."},"date_created":"2025-09-07T22:01:33Z","department":[{"_id":"JoMa"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","month":"08","has_accepted_license":"1","acknowledgement":"We are very grateful to the anonymous referee for instructive comments, which helped improve the overall quality and strengthen the analysis of this work. We thank Andrea Weibel for assistance with the HST and JWST photometric measurements used in this paper. This work is based on observations carried out under project number S23CY with the IRAM NOEMA Interferometer. IRAM is supported by INSU/CNRS (France), MPG (Germany) and IGN (Spain). This work is based in part on observations made with the NASA/ESA/CSA James Webb Space Telescope. The data were obtained from the Mikulski Archive for Space Telescopes at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-03127 for JWST. These observations are associated with programs #1895 and #4762. Support for programs #1895 and #4762 was provided by NASA through a grant from the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-03127. This work has received funding from the Swiss State Secretariat for Education, Research and Innovation (SERI) under contract number MB22.00072, as well as from the Swiss National Science Foundation (SNSF) through project grant 200020_207349. The Cosmic Dawn Center (DAWN) is funded by the Danish National Research Foundation under grant DNRF140. This work is partially supported from the National Natural Science Foundation of China (12073003, 11721303, 11991052), and the China Manned Space Project (CMS-CSST-2021-A04 and CMS-CSST-2021-A06). Y.F. is supported by JSPS KAKENHI Grant Numbers JP22K21349 and JP23K13149. M.V. gratefully acknowledges financial support from the Independent Research Fund Denmark via grant numbers DFF 8021-00130 and 3103-00146 and from the Carlsberg Foundation via grant CF23-0417. VK acknowledges support from the University of Texas at Austin Cosmic Frontier Center. S.F. acknowledges support from NASA through the NASA Hubble Fellowship grant HST-HF2-51505.001-A awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Incorporated, under NASA contract NAS5-26555. Support for this work for RPN was provided by NASA through the NASA Hubble Fellowship grant HST-HF2-51515.001-A awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Incorporated, under NASA contract NAS5-26555.","file":[{"date_updated":"2025-09-08T07:40:53Z","file_id":"20308","content_type":"application/pdf","creator":"dernst","relation":"main_file","access_level":"open_access","date_created":"2025-09-08T07:40:53Z","file_size":3648334,"checksum":"fab2168609078b8336be01ef13b3238e","success":1,"file_name":"2025_AstronomyAstrophysics_Xiao.pdf"}],"author":[{"full_name":"Xiao, Mengyuan","last_name":"Xiao","first_name":"Mengyuan"},{"last_name":"Oesch","first_name":"Pascal A.","full_name":"Oesch, Pascal A."},{"last_name":"Bing","first_name":"Longji","full_name":"Bing, Longji"},{"full_name":"Elbaz, David","first_name":"David","last_name":"Elbaz"},{"orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J","last_name":"Matthee","first_name":"Jorryt J"},{"full_name":"Fudamoto, Yoshinobu","first_name":"Yoshinobu","last_name":"Fudamoto"},{"last_name":"Fujimoto","first_name":"Seiji","full_name":"Fujimoto, Seiji"},{"first_name":"Rui","last_name":"Marques-Chaves","full_name":"Marques-Chaves, Rui"},{"full_name":"Williams, Christina C.","first_name":"Christina C.","last_name":"Williams"},{"full_name":"Dessauges-Zavadsky, Miroslava","last_name":"Dessauges-Zavadsky","first_name":"Miroslava"},{"first_name":"Francesco","last_name":"Valentino","full_name":"Valentino, Francesco"},{"full_name":"Brammer, Gabriel","last_name":"Brammer","first_name":"Gabriel"},{"last_name":"Covelo-Paz","first_name":"Alba","full_name":"Covelo-Paz, Alba"},{"last_name":"Daddi","first_name":"Emanuele","full_name":"Daddi, Emanuele"},{"last_name":"Fynbo","first_name":"Johan P.U.","full_name":"Fynbo, Johan P.U."},{"last_name":"Gillman","first_name":"Steven","full_name":"Gillman, Steven"},{"full_name":"Ginolfi, Michele","last_name":"Ginolfi","first_name":"Michele"},{"first_name":"Emma","last_name":"Giovinazzo","full_name":"Giovinazzo, Emma"},{"last_name":"Greene","first_name":"Jenny E.","full_name":"Greene, Jenny E."},{"first_name":"Qiusheng","last_name":"Gu","full_name":"Gu, Qiusheng"},{"full_name":"Illingworth, Garth","first_name":"Garth","last_name":"Illingworth"},{"full_name":"Inayoshi, Kohei","last_name":"Inayoshi","first_name":"Kohei"},{"full_name":"Kokorev, Vasily","first_name":"Vasily","last_name":"Kokorev"},{"full_name":"Meyer, Romain A.","last_name":"Meyer","first_name":"Romain A."},{"full_name":"Naidu, Rohan P.","first_name":"Rohan P.","last_name":"Naidu"},{"full_name":"Reddy, Naveen A.","last_name":"Reddy","first_name":"Naveen A."},{"full_name":"Schaerer, Daniel","first_name":"Daniel","last_name":"Schaerer"},{"last_name":"Shapley","first_name":"Alice","full_name":"Shapley, Alice"},{"last_name":"Stefanon","first_name":"Mauro","full_name":"Stefanon, Mauro"},{"first_name":"Charles L.","last_name":"Steinhardt","full_name":"Steinhardt, Charles L."},{"full_name":"Setton, David J.","last_name":"Setton","first_name":"David J."},{"last_name":"Vestergaard","first_name":"Marianne","full_name":"Vestergaard, Marianne"},{"full_name":"Wang, Tao","first_name":"Tao","last_name":"Wang"}],"arxiv":1,"external_id":{"isi":["001559174700004"],"arxiv":["2503.01945"]},"OA_place":"publisher","isi":1,"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"has_accepted_license":"1","acknowledgement":"This project received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant agreement No. 949120). This research was supported by the Scientific Service Units of The Institute of Science and Technology Austria (ISTA) through resources provided by the Miba Machine Shop, Nanofabrication Facility, Scientific Computing Facility, and Lab Support Facility. The authors wish to thank Dmytro Rak and Juan Carlos Sobarzo for letting us use their equipment. The authors wish to thank Evgeniia Volobueva for advice in preparing PFIB samples. The authors wish to thank the contributions of the whole Waitukaitis group for useful discussions and feedback.","file":[{"file_name":"2025_AdvMaterialsInterfaces_Lenton.pdf","file_size":1830117,"success":1,"checksum":"906fcc7733be8ce8a83600427b82cd5a","access_level":"open_access","relation":"main_file","date_created":"2025-12-30T09:31:11Z","content_type":"application/pdf","creator":"dernst","date_updated":"2025-12-30T09:31:11Z","file_id":"20908"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Isaac C","last_name":"Lenton","id":"a550210f-223c-11ec-8182-e2d45e817efb","orcid":"0000-0002-5010-6984","full_name":"Lenton, Isaac C"},{"last_name":"Pertl","first_name":"Felix","orcid":"0000-0003-0463-5794","full_name":"Pertl, Felix","id":"6313aec0-15b2-11ec-abd3-ed67d16139af"},{"id":"3CD37A82-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7180-6050","full_name":"Shafeek, Lubuna B","first_name":"Lubuna B","last_name":"Shafeek"},{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","first_name":"Scott R","last_name":"Waitukaitis"}],"DOAJ_listed":"1","arxiv":1,"external_id":{"isi":["001560163400001"],"arxiv":["2506.07187"]},"OA_place":"publisher","isi":1,"intvolume":"        12","issue":"19","publication_identifier":{"eissn":["2196-7350"]},"_id":"20295","date_published":"2025-10-01T00:00:00Z","quality_controlled":"1","project":[{"grant_number":"949120","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","name":"Tribocharge: a multi-scale approach to an enduring problem in physics","call_identifier":"H2020"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","month":"10","citation":{"chicago":"Lenton, Isaac C, Felix Pertl, Lubuna B Shafeek, and Scott R Waitukaitis. “A Duality between Surface Charge and Work Function in Scanning Kelvin Probe Microscopy.” <i>Advanced Materials Interfaces</i>. Wiley, 2025. <a href=\"https://doi.org/10.1002/admi.202500521\">https://doi.org/10.1002/admi.202500521</a>.","mla":"Lenton, Isaac C., et al. “A Duality between Surface Charge and Work Function in Scanning Kelvin Probe Microscopy.” <i>Advanced Materials Interfaces</i>, vol. 12, no. 19, e00521, Wiley, 2025, doi:<a href=\"https://doi.org/10.1002/admi.202500521\">10.1002/admi.202500521</a>.","short":"I.C. Lenton, F. Pertl, L.B. Shafeek, S.R. Waitukaitis, Advanced Materials Interfaces 12 (2025).","ista":"Lenton IC, Pertl F, Shafeek LB, Waitukaitis SR. 2025. A duality between surface charge and work function in scanning Kelvin probe microscopy. Advanced Materials Interfaces. 12(19), e00521.","ieee":"I. C. Lenton, F. Pertl, L. B. Shafeek, and S. R. Waitukaitis, “A duality between surface charge and work function in scanning Kelvin probe microscopy,” <i>Advanced Materials Interfaces</i>, vol. 12, no. 19. Wiley, 2025.","apa":"Lenton, I. C., Pertl, F., Shafeek, L. B., &#38; Waitukaitis, S. R. (2025). A duality between surface charge and work function in scanning Kelvin probe microscopy. <i>Advanced Materials Interfaces</i>. Wiley. <a href=\"https://doi.org/10.1002/admi.202500521\">https://doi.org/10.1002/admi.202500521</a>","ama":"Lenton IC, Pertl F, Shafeek LB, Waitukaitis SR. A duality between surface charge and work function in scanning Kelvin probe microscopy. <i>Advanced Materials Interfaces</i>. 2025;12(19). doi:<a href=\"https://doi.org/10.1002/admi.202500521\">10.1002/admi.202500521</a>"},"publisher":"Wiley","date_created":"2025-09-07T22:01:33Z","department":[{"_id":"ScWa"},{"_id":"NanoFab"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"corr_author":"1","abstract":[{"lang":"eng","text":"Scanning Kelvin probe microscopy (SKPM) is a powerful technique for macroscopic imaging of the electrostatic potential above a surface. Though most often used to image work-function variations of conductive surfaces, it can also be used to probe the surface charge on insulating surfaces. In both cases, relating the measured potential to the underlying signal is non-trivial. Here, general relationships are derived between the measured SKPM voltage and the underlying source, revealing either can be cast as a convolution with an appropriately scaled point spread function (PSF). For charge that exists on a thin insulating layer above a conductor, the PSF has the same shape as what would occur from a work-function variation alone, differing by a simple scaling factor. This relationship is confirmed by: (1) backing it out from finite-element simulations of work-function and charge signals, and (2) experimentally comparing the measured PSF from a small work-function target to that from a small charge spot. This scaling factor is further validated by comparing SKPM charge measurements with Faraday cup measurements for highly charged samples from contact-charging experiments. These results highlight a heretofore unappreciated connection between SKPM voltage and charge signals, offering a rigorous recipe to extract either from experimental data."}],"article_number":"e00521","language":[{"iso":"eng"}],"title":"A duality between surface charge and work function in scanning Kelvin probe microscopy","volume":12,"year":"2025","OA_type":"gold","day":"01","oa":1,"publication_status":"published","doi":"10.1002/admi.202500521","ec_funded":1,"file_date_updated":"2025-12-30T09:31:11Z","ddc":["530"],"scopus_import":"1","PlanS_conform":"1","date_updated":"2025-12-30T09:31:25Z","publication":"Advanced Materials Interfaces","type":"journal_article","article_type":"original","article_processing_charge":"Yes"},{"article_processing_charge":"No","ddc":["000"],"scopus_import":"1","date_updated":"2025-09-09T08:12:44Z","publication":"2nd International Conferenceon Neuro-Symbolic Systems","type":"conference","publication_status":"published","ec_funded":1,"file_date_updated":"2025-09-09T08:10:13Z","acknowledged_ssus":[{"_id":"ScienComp"}],"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"}],"corr_author":"1","language":[{"iso":"eng"}],"article_number":"26","volume":288,"title":"Logic gate neural networks are good for verification","year":"2025","alternative_title":["PMLR"],"day":"01","OA_type":"diamond","conference":{"location":"Philadephia, PA, United States","end_date":"2025-05-30","name":"NeuS: International Conferenceon Neuro-Symbolic Systems","start_date":"2025-05-28"},"oa":1,"status":"public","month":"06","citation":{"chicago":"Kresse, Fabian, Emily Yu, Christoph Lampert, and Thomas A Henzinger. “Logic Gate Neural Networks Are Good for Verification.” In <i>2nd International Conferenceon Neuro-Symbolic Systems</i>, Vol. 288. ML Research Press, 2025.","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.","mla":"Kresse, Fabian, et al. “Logic Gate Neural Networks Are Good for Verification.” <i>2nd International Conferenceon Neuro-Symbolic Systems</i>, vol. 288, 26, ML Research Press, 2025.","short":"F. Kresse, E. Yu, C. Lampert, T.A. Henzinger, in:, 2nd International Conferenceon Neuro-Symbolic Systems, ML Research Press, 2025.","ama":"Kresse F, Yu E, Lampert C, Henzinger TA. Logic gate neural networks are good for verification. In: <i>2nd International Conferenceon Neuro-Symbolic Systems</i>. Vol 288. ML Research Press; 2025.","ieee":"F. Kresse, E. Yu, C. Lampert, and T. A. Henzinger, “Logic gate neural networks are good for verification,” in <i>2nd International Conferenceon Neuro-Symbolic Systems</i>, Philadephia, PA, United States, 2025, vol. 288.","apa":"Kresse, F., Yu, E., Lampert, C., &#38; Henzinger, T. A. (2025). Logic gate neural networks are good for verification. In <i>2nd International Conferenceon Neuro-Symbolic Systems</i> (Vol. 288). Philadephia, PA, United States: ML Research Press."},"publisher":"ML Research Press","department":[{"_id":"ChLa"},{"_id":"ToHe"}],"date_created":"2025-09-07T22:01:34Z","intvolume":"       288","publication_identifier":{"eissn":["2640-3498"]},"_id":"20296","date_published":"2025-06-01T00:00:00Z","quality_controlled":"1","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"faff3c84-23f6-11ef-9085-e5187b51c604","full_name":"Kresse, Fabian","first_name":"Fabian","last_name":"Kresse"},{"id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","full_name":"Yu, Zhengqi","first_name":"Zhengqi","last_name":"Yu"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"external_id":{"arxiv":["2505.19932"]},"arxiv":1,"OA_place":"publisher","has_accepted_license":"1","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).","file":[{"content_type":"application/pdf","creator":"dernst","file_id":"20314","date_updated":"2025-09-09T08:10:13Z","file_name":"2025_NeuS_Kresse.pdf","file_size":295466,"success":1,"checksum":"90a32defed34787e771a5c1623b6b0d2","access_level":"open_access","relation":"main_file","date_created":"2025-09-09T08:10:13Z"}]},{"OA_place":"publisher","author":[{"full_name":"Asadi, Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi","first_name":"Ali"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Saona Urmeneta","first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X"},{"last_name":"Shafiee","first_name":"Ali","id":"2783031a-7378-11f0-b2d0-f17f1db2ebad","full_name":"Shafiee, Ali"}],"external_id":{"arxiv":["2412.00941"]},"arxiv":1,"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","has_accepted_license":"1","file":[{"access_level":"open_access","relation":"main_file","date_created":"2025-09-09T08:19:41Z","file_name":"2025_UAI_AsadiAli.pdf","checksum":"1a37ebe7ba73ab6985765bf0d17a0acc","success":1,"file_size":307458,"file_id":"20315","date_updated":"2025-09-09T08:19:41Z","content_type":"application/pdf","creator":"dernst"}],"department":[{"_id":"KrCh"},{"_id":"GradSch"}],"date_created":"2025-09-07T22:01:34Z","publisher":"ML Research Press","citation":{"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.","mla":"Asadi, Ali, et al. “Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.” <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, vol. 286, ML Research Press, 2025, pp. 238–47.","ista":"Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. 2025. Limit-sure reachability for small memory policies in POMDPs is NP-complete. The 41st Conference on Uncertainty in Artificial Intelligence. UAI: Conference on Uncertainty in Artificial Intelligence, PMLR, vol. 286, 238–247.","chicago":"Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Ali Shafiee. “Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.” In <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, 286:238–47. ML Research Press, 2025.","ama":"Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. Limit-sure reachability for small memory policies in POMDPs is NP-complete. In: <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>. Vol 286. ML Research Press; 2025:238-247.","apa":"Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., &#38; Shafiee, A. (2025). Limit-sure reachability for small memory policies in POMDPs is NP-complete. In <i>The 41st Conference on Uncertainty in Artificial Intelligence</i> (Vol. 286, pp. 238–247). Rio de Janeiro, Brazil: ML Research Press.","ieee":"A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and A. Shafiee, “Limit-sure reachability for small memory policies in POMDPs is NP-complete,” in <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 238–247."},"status":"public","month":"07","page":"238-247","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"quality_controlled":"1","date_published":"2025-07-01T00:00:00Z","publication_identifier":{"eissn":["2640-3498"]},"intvolume":"       286","_id":"20297","file_date_updated":"2025-09-09T08:19:41Z","ec_funded":1,"publication_status":"published","day":"01","OA_type":"diamond","conference":{"start_date":"2025-07-21","end_date":"2025-07-25","location":"Rio de Janeiro, Brazil","name":"UAI: Conference on Uncertainty in Artificial Intelligence"},"oa":1,"volume":286,"title":"Limit-sure reachability for small memory policies in POMDPs is NP-complete","year":"2025","alternative_title":["PMLR"],"language":[{"iso":"eng"}],"abstract":[{"text":"A standard model that arises in several applications in sequential decision-making is partially observable Markov decision processes (POMDPs) where a decision-making agent interacts with an uncertain environment. A basic objective in POMDPs is the reachability objective, where given a target set of states, the goal is to eventually arrive at one of them.\r\n\r\nThe limit-sure problem asks whether reachability can be ensured with probability arbitrarily close to 1. In general, the limit-sure reachability problem for POMDPs is undecidable. However, in many practical cases, the most relevant question is the existence of policies with a small amount of memory. In this work, we study the limit-sure reachability problem for POMDPs with a fixed amount of memory. We establish that the computational complexity of the problem is NP-complete.","lang":"eng"}],"corr_author":"1","article_processing_charge":"No","date_updated":"2025-09-09T08:21:45Z","type":"conference","publication":"The 41st Conference on Uncertainty in Artificial Intelligence","ddc":["000"],"scopus_import":"1"},{"status":"public","month":"05","page":"118-126","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"department":[{"_id":"ChLa"}],"date_created":"2025-09-07T22:01:34Z","citation":{"ama":"Kalinin N, Steinberger L. Efficient estimation of a Gaussian mean with local differential privacy. In: <i>Proceedings of the 28th International Conference on Artificial Intelligence and Statistics</i>. Vol 258. ML Research Press; 2025:118-126.","apa":"Kalinin, N., &#38; Steinberger, L. (2025). Efficient estimation of a Gaussian mean with local differential privacy. In <i>Proceedings of the 28th International Conference on Artificial Intelligence and Statistics</i> (Vol. 258, pp. 118–126). Mai Khao, Thailand: ML Research Press.","ieee":"N. Kalinin and L. Steinberger, “Efficient estimation of a Gaussian mean with local differential privacy,” in <i>Proceedings of the 28th International Conference on Artificial Intelligence and Statistics</i>, Mai Khao, Thailand, 2025, vol. 258, pp. 118–126.","chicago":"Kalinin, Nikita, and Lukas Steinberger. “Efficient Estimation of a Gaussian Mean with Local Differential Privacy.” In <i>Proceedings of the 28th International Conference on Artificial Intelligence and Statistics</i>, 258:118–26. ML Research Press, 2025.","mla":"Kalinin, Nikita, and Lukas Steinberger. “Efficient Estimation of a Gaussian Mean with Local Differential Privacy.” <i>Proceedings of the 28th International Conference on Artificial Intelligence and Statistics</i>, vol. 258, ML Research Press, 2025, pp. 118–26.","short":"N. Kalinin, L. Steinberger, in:, Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 118–126.","ista":"Kalinin N, Steinberger L. 2025. Efficient estimation of a Gaussian mean with local differential privacy. Proceedings of the 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 118–126."},"publisher":"ML Research Press","publication_identifier":{"eissn":["2640-3498"]},"intvolume":"       258","_id":"20298","quality_controlled":"1","date_published":"2025-05-01T00:00:00Z","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","author":[{"full_name":"Kalinin, Nikita","id":"4b14526e-14d2-11ed-ba64-c14c9553d137","first_name":"Nikita","last_name":"Kalinin"},{"last_name":"Steinberger","first_name":"Lukas","full_name":"Steinberger, Lukas"}],"arxiv":1,"external_id":{"arxiv":["2402.04840"]},"has_accepted_license":"1","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.","file":[{"creator":"dernst","content_type":"application/pdf","date_updated":"2025-09-09T08:26:44Z","file_id":"20316","checksum":"3dcd59988ca974b98662ba09a516e616","file_size":395864,"success":1,"file_name":"2025_AISTATS_Kalinin.pdf","date_created":"2025-09-09T08:26:44Z","relation":"main_file","access_level":"open_access"}],"article_processing_charge":"No","ddc":["000"],"scopus_import":"1","date_updated":"2025-09-09T08:28:41Z","publication":"Proceedings of the 28th International Conference on Artificial Intelligence and Statistics","type":"conference","publication_status":"published","file_date_updated":"2025-09-09T08:26:44Z","language":[{"iso":"eng"}],"corr_author":"1","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."}],"day":"01","OA_type":"diamond","conference":{"start_date":"2025-05-03","location":"Mai Khao, Thailand","end_date":"2025-05-05","name":"AISTATS: Conference on Artificial Intelligence and Statistics"},"oa":1,"title":"Efficient estimation of a Gaussian mean with local differential privacy","volume":258,"alternative_title":["PMLR"],"year":"2025"},{"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant and Austrian Science Fund (FWF) 10.55776/COE12.\r\n","has_accepted_license":"1","file":[{"file_id":"20313","date_updated":"2025-09-09T06:27:59Z","creator":"dernst","content_type":"application/pdf","date_created":"2025-09-09T06:27:59Z","access_level":"open_access","relation":"main_file","file_name":"2025_UAI_Asadi.pdf","success":1,"file_size":317097,"checksum":"4180c81bb6ed3b4f5c7a8e48d06520c6"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","author":[{"full_name":"Asadi, Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi","first_name":"Ali"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Jakob","last_name":"De Raaij","full_name":"De Raaij, Jakob"}],"external_id":{"arxiv":["2506.12254"]},"arxiv":1,"intvolume":"       286","publication_identifier":{"eissn":["2640-3498"]},"_id":"20299","project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"quality_controlled":"1","date_published":"2025-01-01T00:00:00Z","status":"public","month":"01","page":"223-232","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"date_created":"2025-09-07T22:01:34Z","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"citation":{"ama":"Asadi A, Chatterjee K, De Raaij J. Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In: <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>. Vol 286. ML Research Press; 2025:223-232.","apa":"Asadi, A., Chatterjee, K., &#38; De Raaij, J. (2025). Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In <i>The 41st Conference on Uncertainty in Artificial Intelligence</i> (Vol. 286, pp. 223–232). Rio de Janeiro, Brazil: ML Research Press.","ieee":"A. Asadi, K. Chatterjee, and J. De Raaij, “Lower bound on Howard policy iteration for deterministic Markov Decision Processes,” in <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 223–232.","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.","short":"A. Asadi, K. Chatterjee, J. De Raaij, in:, The 41st Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 223–232.","mla":"Asadi, Ali, et al. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, vol. 286, ML Research Press, 2025, pp. 223–32.","chicago":"Asadi, Ali, Krishnendu Chatterjee, and Jakob De Raaij. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” In <i>The 41st Conference on Uncertainty in Artificial Intelligence</i>, 286:223–32. ML Research Press, 2025."},"publisher":"ML Research Press","language":[{"iso":"eng"}],"corr_author":"1","abstract":[{"lang":"eng","text":"Deterministic Markov Decision Processes (DMDPs) are a mathematical framework for decision-making where the outcomes and future possible actions are deterministically determined by the current action taken. DMDPs can be viewed as a finite directed weighted graph, where in each step, the controller chooses an outgoing edge. An objective is a measurable function on runs (or infinite trajectories) of the DMDP, and the value for an objective is the maximal cumulative reward (or weight) that the controller can guarantee. We consider the classical mean-payoff (aka limit-average) objective, which is a basic and fundamental objective.\r\n\r\nHoward's policy iteration algorithm is a popular method for solving DMDPs with mean-payoff objectives. Although Howard's algorithm performs well in practice, as experimental studies suggested, the best known upper bound is exponential and the current known lower bound is as follows: For the input size I, the algorithm requires (math formular) iterations, where (math formular) hides the poly-logarithmic factors, i.e., the current lower bound on iterations is sub-linear with respect to the input size. Our main result is an improved lower bound for this fundamental algorithm where we show that for the input size I, the algorithm requires (math formular) iterations."}],"conference":{"end_date":"2025-07-25","name":"UAI: Conference on Uncertainty in Artificial Intelligence","location":"Rio de Janeiro, Brazil","start_date":"2025-07-21"},"OA_type":"diamond","day":"01","oa":1,"volume":286,"title":"Lower bound on Howard policy iteration for deterministic Markov Decision Processes","alternative_title":["PMLR"],"year":"2025","publication_status":"published","file_date_updated":"2025-09-09T06:27:59Z","ec_funded":1,"ddc":["000"],"scopus_import":"1","date_updated":"2025-09-09T06:31:20Z","publication":"The 41st Conference on Uncertainty in Artificial Intelligence","type":"conference","article_processing_charge":"No"},{"status":"public","month":"05","page":"4591-4599","department":[{"_id":"MaMo"}],"date_created":"2025-09-07T22:01:35Z","citation":{"chicago":"Wegel, Tobias, Filip Kovačević, Alexandru Ţifrea, and Fanny Yang. “Learning Pareto Manifolds in High Dimensions: How Can Regularization Help?” In <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, 258:4591–99. ML Research Press, 2025.","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?” <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, vol. 258, ML Research Press, 2025, pp. 4591–99.","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.","apa":"Wegel, T., Kovačević, F., Ţifrea, A., &#38; Yang, F. (2025). Learning Pareto manifolds in high dimensions: How can regularization help? In <i>The 28th International Conference on Artificial Intelligence and Statistics</i> (Vol. 258, pp. 4591–4599). Mai Khao, Thailand: ML Research Press.","ieee":"T. Wegel, F. Kovačević, A. Ţifrea, and F. Yang, “Learning Pareto manifolds in high dimensions: How can regularization help?,” in <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, Mai Khao, Thailand, 2025, vol. 258, pp. 4591–4599.","ama":"Wegel T, Kovačević F, Ţifrea A, Yang F. Learning Pareto manifolds in high dimensions: How can regularization help? In: <i>The 28th International Conference on Artificial Intelligence and Statistics</i>. Vol 258. ML Research Press; 2025:4591-4599."},"publisher":"ML Research Press","intvolume":"       258","publication_identifier":{"eissn":["2640-3498"]},"_id":"20300","quality_controlled":"1","date_published":"2025-05-01T00:00:00Z","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","author":[{"first_name":"Tobias","last_name":"Wegel","full_name":"Wegel, Tobias"},{"first_name":"Filip","last_name":"Kovačević","id":"d0258e7b-50b8-11ef-ad56-8b9f537b6b1b","full_name":"Kovačević, Filip"},{"last_name":"Ţifrea","first_name":"Alexandru","full_name":"Ţifrea, Alexandru"},{"first_name":"Fanny","last_name":"Yang","full_name":"Yang, Fanny"}],"arxiv":1,"external_id":{"arxiv":["2503.08849"]},"acknowledgement":"We thank Junhyung Park for valuable feedback on the manuscript. AT was supported by a PhD fellowship from the Swiss Data Science Center. TW was supported by the SNF Grant 204439. This work was done in part while TW and FY were visiting the Simons Institute for the Theory of\r\nComputing.","article_processing_charge":"No","scopus_import":"1","date_updated":"2025-09-09T07:00:34Z","publication":"The 28th International Conference on Artificial Intelligence and Statistics","type":"conference","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2503.08849","open_access":"1"}],"language":[{"iso":"eng"}],"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"}],"conference":{"start_date":"2025-05-03","name":"AISTATS: Conference on Artificial Intelligence and Statistics","location":"Mai Khao, Thailand","end_date":"2025-05-05"},"OA_type":"green","day":"01","oa":1,"title":"Learning Pareto manifolds in high dimensions: How can regularization help?","volume":258,"year":"2025","alternative_title":["PMLR"]},{"day":"01","OA_type":"green","conference":{"end_date":"2025-05-05","location":"Mai Khao, Thailand","name":"AISTATS: Conference on Artificial Intelligence and Statistics","start_date":"2025-05-03"},"oa":1,"volume":258,"title":"Differentially private continual release of histograms and related queries","alternative_title":["PMLR"],"year":"2025","language":[{"iso":"eng"}],"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"}],"ec_funded":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.11341","open_access":"1"}],"publication_status":"published","date_updated":"2025-09-09T07:09:22Z","type":"conference","publication":"The 28th International Conference on Artificial Intelligence and Statistics","scopus_import":"1","article_processing_charge":"No","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.","OA_place":"repository","author":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"},{"first_name":"A. R.","last_name":"Sricharan","full_name":"Sricharan, A. R."},{"full_name":"Steiner, Teresa Anna","last_name":"Steiner","first_name":"Teresa Anna"}],"external_id":{"arxiv":["2302.11341"]},"arxiv":1,"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer"}],"date_published":"2025-05-01T00:00:00Z","publication_identifier":{"eissn":["2640-3498"]},"intvolume":"       258","_id":"20301","department":[{"_id":"MoHe"}],"date_created":"2025-09-07T22:01:35Z","publisher":"ML Research Press","citation":{"chicago":"Henzinger, Monika, A. R. Sricharan, and Teresa Anna Steiner. “Differentially Private Continual Release of Histograms and Related Queries.” In <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, 258:1990–98. ML Research Press, 2025.","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.","mla":"Henzinger, Monika, et al. “Differentially Private Continual Release of Histograms and Related Queries.” <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, vol. 258, ML Research Press, 2025, pp. 1990–98.","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.","ama":"Henzinger M, Sricharan AR, Steiner TA. Differentially private continual release of histograms and related queries. In: <i>The 28th International Conference on Artificial Intelligence and Statistics</i>. Vol 258. ML Research Press; 2025:1990-1998.","ieee":"M. Henzinger, A. R. Sricharan, and T. A. Steiner, “Differentially private continual release of histograms and related queries,” in <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, Mai Khao, Thailand, 2025, vol. 258, pp. 1990–1998.","apa":"Henzinger, M., Sricharan, A. R., &#38; Steiner, T. A. (2025). Differentially private continual release of histograms and related queries. In <i>The 28th International Conference on Artificial Intelligence and Statistics</i> (Vol. 258, pp. 1990–1998). Mai Khao, Thailand: ML Research Press."},"status":"public","month":"05","page":"1990-1998"},{"scopus_import":"1","date_updated":"2025-09-09T07:17:08Z","type":"conference","publication":"The 28th International Conference on Artificial Intelligence and Statistics","article_processing_charge":"No","abstract":[{"lang":"eng","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."}],"language":[{"iso":"eng"}],"volume":258,"title":"Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis","alternative_title":["PMLR"],"year":"2025","conference":{"start_date":"2025-05-03","location":"Mai Khao, Thailand","name":"AISTATS: Conference on Artificial Intelligence and Statistics","end_date":"2025-05-05"},"day":"01","OA_type":"green","oa":1,"publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2501.04443","open_access":"1"}],"ec_funded":1,"publication_identifier":{"eissn":["2640-3498"]},"intvolume":"       258","_id":"20302","date_published":"2025-05-01T00:00:00Z","quality_controlled":"1","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"page":"2539-2547","status":"public","month":"05","publisher":"ML Research Press","citation":{"ieee":"R. Luo, S. U. Stich, S. Horváth, and M. Takáč, “Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis,” in <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, Mai Khao, Thailand, 2025, vol. 258, pp. 2539–2547.","ama":"Luo R, Stich SU, Horváth S, Takáč M. Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. In: <i>The 28th International Conference on Artificial Intelligence and Statistics</i>. Vol 258. ML Research Press; 2025:2539-2547.","apa":"Luo, R., Stich, S. U., Horváth, S., &#38; Takáč, M. (2025). Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. In <i>The 28th International Conference on Artificial Intelligence and Statistics</i> (Vol. 258, pp. 2539–2547). Mai Khao, Thailand: ML Research Press.","chicago":"Luo, Ruichen, Sebastian U. Stich, Samuel Horváth, and Martin Takáč. “Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis.” In <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, 258:2539–47. ML Research Press, 2025.","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.","mla":"Luo, Ruichen, et al. “Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis.” <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, vol. 258, ML Research Press, 2025, pp. 2539–47.","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."},"department":[{"_id":"KrCh"}],"date_created":"2025-09-07T22:01:35Z","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.","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Luo, Ruichen","id":"b391db08-1ffe-11ee-8b67-d18ddcfb5a14","last_name":"Luo","first_name":"Ruichen"},{"first_name":"Sebastian U.","last_name":"Stich","full_name":"Stich, Sebastian U."},{"full_name":"Horváth, Samuel","last_name":"Horváth","first_name":"Samuel"},{"first_name":"Martin","last_name":"Takáč","full_name":"Takáč, Martin"}],"arxiv":1,"external_id":{"arxiv":["2501.04443"]},"OA_place":"repository"},{"date_published":"2025-05-01T00:00:00Z","quality_controlled":"1","_id":"20303","intvolume":"       258","publication_identifier":{"eissn":["2640-3498"]},"citation":{"ieee":"S. Huang, N. Pfister, and J. Bowden, “Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding,” in <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, Mai Khao, Thailand, 2025, vol. 258, pp. 3394–3402.","apa":"Huang, S., Pfister, N., &#38; Bowden, J. (2025). Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding. In <i>The 28th International Conference on Artificial Intelligence and Statistics</i> (Vol. 258, pp. 3394–3402). Mai Khao, Thailand: ML Research Press.","ama":"Huang S, Pfister N, Bowden J. Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding. In: <i>The 28th International Conference on Artificial Intelligence and Statistics</i>. Vol 258. ML Research Press; 2025:3394-3402.","chicago":"Huang, Shimeng, Niklas Pfister, and Jack Bowden. “Sparse Causal Effect Estimation Using Two-Sample Summary Statistics in the Presence of Unmeasured Confounding.” In <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, 258:3394–3402. ML Research Press, 2025.","mla":"Huang, Shimeng, et al. “Sparse Causal Effect Estimation Using Two-Sample Summary Statistics in the Presence of Unmeasured Confounding.” <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, vol. 258, ML Research Press, 2025, pp. 3394–402.","short":"S. Huang, N. Pfister, J. Bowden, in:, The 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 3394–3402.","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."},"publisher":"ML Research Press","department":[{"_id":"FrLo"}],"date_created":"2025-09-07T22:01:35Z","page":"3394-3402","month":"05","status":"public","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.","external_id":{"arxiv":["2410.12300"]},"arxiv":1,"author":[{"full_name":"Huang, Shimeng","orcid":"0000-0001-6919-821X","id":"989c2a06-fb4e-11ef-a992-ab766442255b","last_name":"Huang","first_name":"Shimeng"},{"last_name":"Pfister","first_name":"Niklas","full_name":"Pfister, Niklas"},{"full_name":"Bowden, Jack","last_name":"Bowden","first_name":"Jack"}],"OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"conference","publication":"The 28th International Conference on Artificial Intelligence and Statistics","date_updated":"2025-09-09T07:47:13Z","scopus_import":"1","article_processing_charge":"No","alternative_title":["PMLR"],"year":"2025","title":"Sparse causal effect estimation using two-sample summary statistics in the presence of unmeasured confounding","volume":258,"oa":1,"conference":{"start_date":"2025-05-03","name":"AISTATS: Conference on Artificial Intelligence and Statistics","location":"Mai Khao, Thailand","end_date":"2025-05-05"},"day":"01","OA_type":"green","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."}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2410.12300","open_access":"1"}],"publication_status":"published"},{"ec_funded":1,"file_date_updated":"2025-12-30T10:16:40Z","publication_status":"published","doi":"10.1039/d5sm00148j","title":"A tutorial for mesoscale computer simulations of lipid membranes: Tether pulling, tubulation and fluctuations","volume":21,"year":"2025","day":"28","OA_type":"hybrid","oa":1,"abstract":[{"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.","lang":"eng"}],"corr_author":"1","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"Yes (via OA deal)","date_updated":"2025-12-30T10:16:52Z","publication":"Soft Matter","type":"journal_article","ddc":["540"],"scopus_import":"1","author":[{"first_name":"Maitane","last_name":"Muñoz Basagoiti","full_name":"Muñoz Basagoiti, Maitane","orcid":"0000-0003-1483-1457","id":"1a8a7950-82cd-11ed-bd4f-9624c913a607"},{"first_name":"Felix F","last_name":"Frey","full_name":"Frey, Felix F","id":"a0270b37-8f1a-11ec-95c7-8e710c59a4f3","orcid":"0000-0001-8501-6017"},{"first_name":"Billie","last_name":"Meadowcroft","id":"a4725fd6-932b-11ed-81e2-c098c7f37ae1","full_name":"Meadowcroft, Billie","orcid":"0000-0003-3441-1337"},{"last_name":"Santana de Freitas Amaral","first_name":"Miguel","id":"4f2d02dd-47a9-11ec-ad10-82820ed3f501","full_name":"Santana de Freitas Amaral, Miguel"},{"full_name":"Prada, Adam","id":"a43ed60a-dd22-11ed-9bf7-b34133792ea9","first_name":"Adam","last_name":"Prada"},{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","full_name":"Šarić, Anđela","orcid":"0000-0002-7854-2139","first_name":"Anđela","last_name":"Šarić"}],"external_id":{"arxiv":["2502.09798"],"isi":["001562846800001"]},"arxiv":1,"OA_place":"publisher","isi":1,"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","has_accepted_license":"1","file":[{"file_size":4841140,"success":1,"checksum":"590bedad19b6f6d40a7ee036a056a6d9","file_name":"2025_SoftMatter_MunozBasagoiti.pdf","relation":"main_file","access_level":"open_access","date_created":"2025-12-30T10:16:40Z","content_type":"application/pdf","creator":"dernst","file_id":"20912","date_updated":"2025-12-30T10:16:40Z"}],"publisher":"Royal Society of Chemistry","citation":{"ama":"Muñoz Basagoiti M, Frey FF, Meadowcroft B, Santana de Freitas Amaral M, Prada A, Šarić A. A tutorial for mesoscale computer simulations of lipid membranes: Tether pulling, tubulation and fluctuations. <i>Soft Matter</i>. 2025;21(40):7736-7756. doi:<a href=\"https://doi.org/10.1039/d5sm00148j\">10.1039/d5sm00148j</a>","apa":"Muñoz Basagoiti, M., Frey, F. F., Meadowcroft, B., Santana de Freitas Amaral, M., Prada, A., &#38; Šarić, A. (2025). A tutorial for mesoscale computer simulations of lipid membranes: Tether pulling, tubulation and fluctuations. <i>Soft Matter</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/d5sm00148j\">https://doi.org/10.1039/d5sm00148j</a>","ieee":"M. Muñoz Basagoiti, F. F. Frey, B. Meadowcroft, M. Santana de Freitas Amaral, A. Prada, and A. Šarić, “A tutorial for mesoscale computer simulations of lipid membranes: Tether pulling, tubulation and fluctuations,” <i>Soft Matter</i>, vol. 21, no. 40. Royal Society of Chemistry, pp. 7736–7756, 2025.","chicago":"Muñoz Basagoiti, Maitane, Felix F Frey, Billie Meadowcroft, Miguel Santana de Freitas Amaral, Adam Prada, and Anđela Šarić. “A Tutorial for Mesoscale Computer Simulations of Lipid Membranes: Tether Pulling, Tubulation and Fluctuations.” <i>Soft Matter</i>. Royal Society of Chemistry, 2025. <a href=\"https://doi.org/10.1039/d5sm00148j\">https://doi.org/10.1039/d5sm00148j</a>.","mla":"Muñoz Basagoiti, Maitane, et al. “A Tutorial for Mesoscale Computer Simulations of Lipid Membranes: Tether Pulling, Tubulation and Fluctuations.” <i>Soft Matter</i>, vol. 21, no. 40, Royal Society of Chemistry, 2025, pp. 7736–56, doi:<a href=\"https://doi.org/10.1039/d5sm00148j\">10.1039/d5sm00148j</a>.","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."},"date_created":"2025-09-10T05:34:36Z","department":[{"_id":"AnSa"}],"page":"7736-7756","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"status":"public","month":"07","date_published":"2025-07-28T00:00:00Z","quality_controlled":"1","project":[{"grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"},{"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"},{"grant_number":"96752","name":"The evolution of trafficking: from archaea to eukaryotes","_id":"eba0f67c-77a9-11ec-83b8-cc8501b3e222"}],"publication_identifier":{"eissn":["1744-6848"],"issn":["1744-683X"]},"intvolume":"        21","issue":"40","_id":"20318"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","OA_place":"publisher","DOAJ_listed":"1","author":[{"orcid":"0000-0001-8602-3083","full_name":"GOSWAMI, BIDYUT B","id":"3a4ac09c-6d61-11ec-bf66-884cde66b64b","last_name":"GOSWAMI","first_name":"BIDYUT B"},{"id":"74c777f4-32da-11ee-b498-874db0835561","full_name":"Polesello, Andrea","last_name":"Polesello","first_name":"Andrea"},{"orcid":"0000-0001-5836-5350","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","full_name":"Muller, Caroline J","last_name":"Muller","first_name":"Caroline J"}],"file":[{"date_created":"2025-09-10T08:12:34Z","access_level":"open_access","relation":"main_file","file_name":"2025_JAMES_Goswami.pdf","checksum":"5961d6290432c5ac0e8587ef07f30c9b","success":1,"file_size":2143025,"date_updated":"2025-09-10T08:12:34Z","file_id":"20338","creator":"dernst","content_type":"application/pdf"}],"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.","has_accepted_license":"1","month":"09","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"department":[{"_id":"CaMu"}],"date_created":"2025-09-10T05:36:16Z","publisher":"Wiley","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). <i>Journal of Advances in Modeling Earth Systems</i>. 2025;17(9). doi:<a href=\"https://doi.org/10.1029/2025ms005035\">10.1029/2025ms005035</a>","apa":"GOSWAMI, B. B., Polesello, A., &#38; Muller, C. J. (2025). An assessment of representing land‐ocean heterogeneity via CAPE relaxation timescale in the Community Atmospheric Model 6 (CAM6). <i>Journal of Advances in Modeling Earth Systems</i>. Wiley. <a href=\"https://doi.org/10.1029/2025ms005035\">https://doi.org/10.1029/2025ms005035</a>","ieee":"B. B. GOSWAMI, A. Polesello, and C. J. Muller, “An assessment of representing land‐ocean heterogeneity via CAPE relaxation timescale in the Community Atmospheric Model 6 (CAM6),” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 17, no. 9. Wiley, 2025.","short":"B.B. GOSWAMI, A. Polesello, C.J. Muller, Journal of Advances in Modeling Earth Systems 17 (2025).","mla":"GOSWAMI, BIDYUT B., et al. “An Assessment of Representing Land‐ocean Heterogeneity via CAPE Relaxation Timescale in the Community Atmospheric Model 6 (CAM6).” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 17, no. 9, e2025MS005035, Wiley, 2025, doi:<a href=\"https://doi.org/10.1029/2025ms005035\">10.1029/2025ms005035</a>.","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.","chicago":"GOSWAMI, BIDYUT B, Andrea Polesello, and Caroline J Muller. “An Assessment of Representing Land‐ocean Heterogeneity via CAPE Relaxation Timescale in the Community Atmospheric Model 6 (CAM6).” <i>Journal of Advances in Modeling Earth Systems</i>. Wiley, 2025. <a href=\"https://doi.org/10.1029/2025ms005035\">https://doi.org/10.1029/2025ms005035</a>."},"_id":"20319","intvolume":"        17","issue":"9","publication_identifier":{"eissn":["1942-2466"]},"project":[{"_id":"629205d8-2b32-11ec-9570-e1356ff73576","name":"Organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate","call_identifier":"H2020","grant_number":"805041"}],"quality_controlled":"1","date_published":"2025-09-01T00:00:00Z","doi":"10.1029/2025ms005035","publication_status":"published","file_date_updated":"2025-09-10T08:12:34Z","ec_funded":1,"language":[{"iso":"eng"}],"article_number":"e2025MS005035","abstract":[{"lang":"eng","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."}],"corr_author":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"oa":1,"day":"01","OA_type":"gold","year":"2025","volume":17,"title":"An assessment of representing land‐ocean heterogeneity via CAPE relaxation timescale in the Community Atmospheric Model 6 (CAM6)","article_processing_charge":"Yes","article_type":"original","scopus_import":"1","ddc":["550"],"type":"journal_article","publication":"Journal of Advances in Modeling Earth Systems","date_updated":"2025-09-10T08:14:28Z"},{"file_date_updated":"2025-12-30T10:18:56Z","doi":"10.1016/j.ejc.2025.104214","publication_status":"published","day":"01","OA_type":"hybrid","oa":1,"title":"Beyond the pseudoforest strong Nine Dragon Tree theorem","volume":130,"year":"2025","language":[{"iso":"eng"}],"article_number":"104214","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."}],"corr_author":"1","article_processing_charge":"Yes (via OA deal)","article_type":"original","date_updated":"2025-12-30T10:19:10Z","PlanS_conform":"1","type":"journal_article","publication":"European Journal of Combinatorics","ddc":["500"],"scopus_import":"1","isi":1,"OA_place":"publisher","author":[{"full_name":"Mies, Sebastian","last_name":"Mies","first_name":"Sebastian"},{"id":"6dc1a1be-bf1c-11ed-8d2b-d044840f49d6","full_name":"Moore, Benjamin","last_name":"Moore","first_name":"Benjamin"},{"full_name":"Smith-Roberge, Evelyne","last_name":"Smith-Roberge","first_name":"Evelyne"}],"arxiv":1,"external_id":{"isi":["001529769300002"],"arxiv":["2310.00931"]},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","has_accepted_license":"1","file":[{"date_created":"2025-12-30T10:18:56Z","relation":"main_file","access_level":"open_access","checksum":"b1536e9256c4510a0e21452032e43a26","file_size":737845,"success":1,"file_name":"2025_EuropJournCombinatorics_Mies.pdf","date_updated":"2025-12-30T10:18:56Z","file_id":"20913","creator":"dernst","content_type":"application/pdf"}],"date_created":"2025-09-10T05:36:50Z","department":[{"_id":"MaKw"}],"citation":{"ieee":"S. Mies, B. Moore, and E. Smith-Roberge, “Beyond the pseudoforest strong Nine Dragon Tree theorem,” <i>European Journal of Combinatorics</i>, vol. 130, no. 12. Elsevier, 2025.","apa":"Mies, S., Moore, B., &#38; Smith-Roberge, E. (2025). Beyond the pseudoforest strong Nine Dragon Tree theorem. <i>European Journal of Combinatorics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ejc.2025.104214\">https://doi.org/10.1016/j.ejc.2025.104214</a>","ama":"Mies S, Moore B, Smith-Roberge E. Beyond the pseudoforest strong Nine Dragon Tree theorem. <i>European Journal of Combinatorics</i>. 2025;130(12). doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104214\">10.1016/j.ejc.2025.104214</a>","ista":"Mies S, Moore B, Smith-Roberge E. 2025. Beyond the pseudoforest strong Nine Dragon Tree theorem. European Journal of Combinatorics. 130(12), 104214.","mla":"Mies, Sebastian, et al. “Beyond the Pseudoforest Strong Nine Dragon Tree Theorem.” <i>European Journal of Combinatorics</i>, vol. 130, no. 12, 104214, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104214\">10.1016/j.ejc.2025.104214</a>.","short":"S. Mies, B. Moore, E. Smith-Roberge, European Journal of Combinatorics 130 (2025).","chicago":"Mies, Sebastian, Benjamin Moore, and Evelyne Smith-Roberge. “Beyond the Pseudoforest Strong Nine Dragon Tree Theorem.” <i>European Journal of Combinatorics</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.ejc.2025.104214\">https://doi.org/10.1016/j.ejc.2025.104214</a>."},"publisher":"Elsevier","status":"public","month":"12","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"quality_controlled":"1","date_published":"2025-12-01T00:00:00Z","issue":"12","intvolume":"       130","publication_identifier":{"issn":["0195-6698"]},"_id":"20320"},{"publication_status":"published","doi":"10.1021/jacs.5c09057","file_date_updated":"2025-09-10T07:53:10Z","corr_author":"1","abstract":[{"lang":"eng","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."}],"acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"language":[{"iso":"eng"}],"year":"2025","volume":147,"title":"Bumps on the road: The way to clean relaxation dispersion magic-angle spinning NMR","oa":1,"OA_type":"hybrid","day":"01","article_type":"original","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","ddc":["540"],"type":"journal_article","publication":"Journal of the American Chemical Society","date_updated":"2026-01-28T12:36:30Z","PlanS_conform":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","related_material":{"record":[{"relation":"used_in_publication","id":"19696","status":"public"}]},"external_id":{"isi":["001542746200001"],"pmid":["40748291"]},"author":[{"first_name":"Benjamin","last_name":"Tatman","id":"71cda2f3-e604-11ee-a1df-da10587eda3f","full_name":"Tatman, Benjamin"},{"full_name":"Sridharan, Vidhyalakshmi","last_name":"Sridharan","first_name":"Vidhyalakshmi"},{"full_name":"Uttarkabat, Motilal","first_name":"Motilal","last_name":"Uttarkabat"},{"last_name":"Jaroniec","first_name":"Christopher P.","full_name":"Jaroniec, Christopher P."},{"full_name":"Ernst, Matthias","first_name":"Matthias","last_name":"Ernst"},{"last_name":"Rovo","first_name":"Petra","id":"c316e53f-b965-11eb-b128-bb26acc59c00","orcid":"0000-0001-8729-7326","full_name":"Rovo, Petra"},{"id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606","first_name":"Paul","last_name":"Schanda"}],"pmid":1,"OA_place":"publisher","isi":1,"file":[{"file_size":5235353,"success":1,"checksum":"b350d56ddddefea96cebd62c277c0ff5","file_name":"2025_JACS_Tatman.pdf","date_created":"2025-09-10T07:53:10Z","relation":"main_file","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_id":"20337","date_updated":"2025-09-10T07:53:10Z"}],"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.","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"page":"29315-29326","month":"08","status":"public","publisher":"American Chemical Society","citation":{"ieee":"B. Tatman <i>et al.</i>, “Bumps on the road: The way to clean relaxation dispersion magic-angle spinning NMR,” <i>Journal of the American Chemical Society</i>, vol. 147, no. 32. American Chemical Society, pp. 29315–29326, 2025.","apa":"Tatman, B., Sridharan, V., Uttarkabat, M., Jaroniec, C. P., Ernst, M., Rovo, P., &#38; Schanda, P. (2025). Bumps on the road: The way to clean relaxation dispersion magic-angle spinning NMR. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacs.5c09057\">https://doi.org/10.1021/jacs.5c09057</a>","ama":"Tatman B, Sridharan V, Uttarkabat M, et al. Bumps on the road: The way to clean relaxation dispersion magic-angle spinning NMR. <i>Journal of the American Chemical Society</i>. 2025;147(32):29315-29326. doi:<a href=\"https://doi.org/10.1021/jacs.5c09057\">10.1021/jacs.5c09057</a>","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.","mla":"Tatman, Benjamin, et al. “Bumps on the Road: The Way to Clean Relaxation Dispersion Magic-Angle Spinning NMR.” <i>Journal of the American Chemical Society</i>, vol. 147, no. 32, American Chemical Society, 2025, pp. 29315–26, doi:<a href=\"https://doi.org/10.1021/jacs.5c09057\">10.1021/jacs.5c09057</a>.","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.","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.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2025. <a href=\"https://doi.org/10.1021/jacs.5c09057\">https://doi.org/10.1021/jacs.5c09057</a>."},"date_created":"2025-09-10T05:37:19Z","department":[{"_id":"PaSc"},{"_id":"NMR"}],"_id":"20321","publication_identifier":{"eissn":["1520-5126"],"issn":["0002-7863"]},"intvolume":"       147","issue":"32","date_published":"2025-08-01T00:00:00Z","quality_controlled":"1"},{"status":"public","month":"10","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"date_created":"2025-09-10T05:40:09Z","department":[{"_id":"HeEd"}],"citation":{"mla":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>Journal of Pure and Applied Algebra</i>, vol. 229, no. 10, 108068, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">10.1016/j.jpaa.2025.108068</a>.","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.","chicago":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>Journal of Pure and Applied Algebra</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">https://doi.org/10.1016/j.jpaa.2025.108068</a>.","ieee":"A. Brown and O. Draganov, “Discrete microlocal Morse theory,” <i>Journal of Pure and Applied Algebra</i>, vol. 229, no. 10. Elsevier, 2025.","ama":"Brown A, Draganov O. Discrete microlocal Morse theory. <i>Journal of Pure and Applied Algebra</i>. 2025;229(10). doi:<a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">10.1016/j.jpaa.2025.108068</a>","apa":"Brown, A., &#38; Draganov, O. (2025). Discrete microlocal Morse theory. <i>Journal of Pure and Applied Algebra</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">https://doi.org/10.1016/j.jpaa.2025.108068</a>"},"publisher":"Elsevier","publication_identifier":{"issn":["0022-4049"]},"intvolume":"       229","issue":"10","_id":"20323","quality_controlled":"1","project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"grant_number":"Z00342","call_identifier":"FWF","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"date_published":"2025-10-01T00:00:00Z","related_material":{"record":[{"id":"18981","status":"public","relation":"earlier_version"}]},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","author":[{"full_name":"Brown, Adam","id":"70B7FDF6-608D-11E9-9333-8535E6697425","first_name":"Adam","last_name":"Brown"},{"last_name":"Draganov","first_name":"Ondrej","full_name":"Draganov, Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0464-3823"}],"arxiv":1,"external_id":{"arxiv":["2209.14993"]},"has_accepted_license":"1","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","file":[{"date_updated":"2025-12-30T07:55:08Z","file_id":"20886","content_type":"application/pdf","creator":"dernst","access_level":"open_access","relation":"main_file","date_created":"2025-12-30T07:55:08Z","file_name":"2025_JourPureAppliedAlgebra_Brown.pdf","checksum":"39bcad462278c9322ef810af7db67f56","success":1,"file_size":3090836}],"article_processing_charge":"Yes (via OA deal)","article_type":"original","ddc":["510"],"scopus_import":"1","PlanS_conform":"1","date_updated":"2025-12-30T07:55:21Z","type":"journal_article","publication":"Journal of Pure and Applied Algebra","doi":"10.1016/j.jpaa.2025.108068","publication_status":"published","file_date_updated":"2025-12-30T07:55:08Z","ec_funded":1,"article_number":"108068","language":[{"iso":"eng"}],"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"}],"corr_author":"1","day":"01","OA_type":"hybrid","oa":1,"volume":229,"title":"Discrete microlocal Morse theory","year":"2025"},{"oa_version":"Published Version","related_material":{"record":[{"relation":"earlier_version","id":"18057","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-5263-5559","id":"FDE60288-A89D-11E9-947F-1AF6E5697425","full_name":"Mukhopadhyay, Soham","first_name":"Soham","last_name":"Mukhopadhyay"},{"id":"6c55e976-15b2-11ec-abd3-d790e8937fde","full_name":"Lancheros Naranjo, Diego A","first_name":"Diego A","last_name":"Lancheros Naranjo"},{"id":"5479D234-2D30-11EA-89CC-40953DDC885E","full_name":"Senior, Jorden L","orcid":"0000-0002-0672-9295","first_name":"Jorden L","last_name":"Senior"},{"first_name":"Andrew P","last_name":"Higginbotham","orcid":"0000-0003-2607-2363","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","full_name":"Higginbotham, Andrew P"}],"arxiv":1,"external_id":{"arxiv":["2408.07829 "],"isi":["001537333100001"]},"isi":1,"OA_place":"publisher","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.).","has_accepted_license":"1","file":[{"access_level":"open_access","relation":"main_file","date_created":"2025-09-10T07:29:06Z","file_name":"2025_PhysReviewAppl_Mukhopadhyay.pdf","success":1,"file_size":1370466,"checksum":"6cc3c9beeb7c0a88ee0a072c9a32b78b","date_updated":"2025-09-10T07:29:06Z","file_id":"20335","content_type":"application/pdf","creator":"dernst"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","month":"07","publisher":"American Physical Society","citation":{"ista":"Mukhopadhyay S, Lancheros Naranjo DA, Senior JL, Higginbotham AP. 2025. Dual relaxation oscillations in a Josephson-junction array. Physical Review Applied. 24, 014035.","mla":"Mukhopadhyay, Soham, et al. “Dual Relaxation Oscillations in a Josephson-Junction Array.” <i>Physical Review Applied</i>, vol. 24, 014035, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/qvls-7s3q\">10.1103/qvls-7s3q</a>.","short":"S. Mukhopadhyay, D.A. Lancheros Naranjo, J.L. Senior, A.P. Higginbotham, Physical Review Applied 24 (2025).","chicago":"Mukhopadhyay, Soham, Diego A Lancheros Naranjo, Jorden L Senior, and Andrew P Higginbotham. “Dual Relaxation Oscillations in a Josephson-Junction Array.” <i>Physical Review Applied</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/qvls-7s3q\">https://doi.org/10.1103/qvls-7s3q</a>.","ama":"Mukhopadhyay S, Lancheros Naranjo DA, Senior JL, Higginbotham AP. Dual relaxation oscillations in a Josephson-junction array. <i>Physical Review Applied</i>. 2025;24. doi:<a href=\"https://doi.org/10.1103/qvls-7s3q\">10.1103/qvls-7s3q</a>","apa":"Mukhopadhyay, S., Lancheros Naranjo, D. A., Senior, J. L., &#38; Higginbotham, A. P. (2025). Dual relaxation oscillations in a Josephson-junction array. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/qvls-7s3q\">https://doi.org/10.1103/qvls-7s3q</a>","ieee":"S. Mukhopadhyay, D. A. Lancheros Naranjo, J. L. Senior, and A. P. Higginbotham, “Dual relaxation oscillations in a Josephson-junction array,” <i>Physical Review Applied</i>, vol. 24. American Physical Society, 2025."},"date_created":"2025-09-10T05:41:30Z","department":[{"_id":"GradSch"},{"_id":"AnHi"}],"intvolume":"        24","publication_identifier":{"issn":["2331-7019"]},"_id":"20324","date_published":"2025-07-17T00:00:00Z","quality_controlled":"1","project":[{"grant_number":"P33692","name":"Cavity electromechanics across a quantum phase transition","_id":"0aa3608a-070f-11eb-9043-e9cd8a2bd931"},{"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"}],"publication_status":"published","doi":"10.1103/qvls-7s3q","ec_funded":1,"file_date_updated":"2025-09-10T07:29:06Z","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"corr_author":"1","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"}],"article_number":"014035","language":[{"iso":"eng"}],"title":"Dual relaxation oscillations in a Josephson-junction array","volume":24,"year":"2025","OA_type":"hybrid","day":"17","oa":1,"article_type":"original","article_processing_charge":"Yes (via OA deal)","ddc":["530"],"scopus_import":"1","PlanS_conform":"1","date_updated":"2025-12-11T10:47:34Z","type":"journal_article","publication":"Physical Review Applied"}]