[{"type":"journal_article","day":"01","acknowledgement":"We thank the anonymous referee for comments that helped us improve the clarity of this manuscript. We acknowledge support from the United States National Science Foundation (NSF) grant AST-2006176 and the National Aeronautics and Space Administration (NASA) grants 80NSSC24K0440 and 80NSSC22K0822 (ZH). We also acknowledge support from NSF grant AST-2009309, NASA Astrophysics Theory Program grant 80NSSC22K0629, and Space Telescope Science Institute grant JWST-AR-05238 (EV). The simulations in this work were run on Texas Advanced Computing Center’s Stampede2 and Stampede3 systems. We used Stampede2 and Purdue University’s computing system Anvil for data analysis.","DOAJ_listed":"1","doi":"10.1093/mnras/staf1269","date_created":"2025-08-31T22:01:31Z","arxiv":1,"has_accepted_license":"1","status":"public","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"scopus_import":"1","ddc":["520"],"issue":"2","title":"Can supermassive stars form in protogalaxies due to internal Lyman-Werner feedback?","OA_type":"gold","month":"09","license":"https://creativecommons.org/licenses/by/4.0/","OA_place":"publisher","publisher":"Oxford University Press","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"Yes","publication":"Monthly Notices of the Royal Astronomical Society","citation":{"short":"J. Sullivan, Z. Haiman, M. Kulkarni, E. Visbal, Monthly Notices of the Royal Astronomical Society 542 (2025) 822–838.","apa":"Sullivan, J., Haiman, Z., Kulkarni, M., & Visbal, E. (2025). Can supermassive stars form in protogalaxies due to internal Lyman-Werner feedback? Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/staf1269","ista":"Sullivan J, Haiman Z, Kulkarni M, Visbal E. 2025. Can supermassive stars form in protogalaxies due to internal Lyman-Werner feedback? Monthly Notices of the Royal Astronomical Society. 542(2), 822–838.","mla":"Sullivan, James, et al. “Can Supermassive Stars Form in Protogalaxies Due to Internal Lyman-Werner Feedback?” Monthly Notices of the Royal Astronomical Society, vol. 542, no. 2, Oxford University Press, 2025, pp. 822–38, doi:10.1093/mnras/staf1269.","ieee":"J. Sullivan, Z. Haiman, M. Kulkarni, and E. Visbal, “Can supermassive stars form in protogalaxies due to internal Lyman-Werner feedback?,” Monthly Notices of the Royal Astronomical Society, vol. 542, no. 2. Oxford University Press, pp. 822–838, 2025.","chicago":"Sullivan, James, Zoltán Haiman, Mihir Kulkarni, and Eli Visbal. “Can Supermassive Stars Form in Protogalaxies Due to Internal Lyman-Werner Feedback?” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2025. https://doi.org/10.1093/mnras/staf1269.","ama":"Sullivan J, Haiman Z, Kulkarni M, Visbal E. Can supermassive stars form in protogalaxies due to internal Lyman-Werner feedback? Monthly Notices of the Royal Astronomical Society. 2025;542(2):822-838. doi:10.1093/mnras/staf1269"},"date_published":"2025-09-01T00:00:00Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":" 542","publication_status":"published","volume":542,"year":"2025","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file":[{"file_name":"2025_MonthlyNoticesRAS_Sullivan.pdf","date_updated":"2025-09-03T05:44:47Z","file_size":2780496,"content_type":"application/pdf","file_id":"20279","relation":"main_file","access_level":"open_access","creator":"dernst","success":1,"date_created":"2025-09-03T05:44:47Z","checksum":"2a06796b27da0b33d479dba170ba4b3f"}],"file_date_updated":"2025-09-03T05:44:47Z","date_updated":"2025-09-30T14:28:05Z","department":[{"_id":"ZoHa"}],"PlanS_conform":"1","abstract":[{"lang":"eng","text":"Population III stars are possible precursors to early supermassive black holes (BHs). The presence of soft UV Lyman–Werner (LW) background radiation can suppress Population III star formation in minihaloes and allow them to form in pristine atomic-cooling haloes. In the absence of molecular hydrogen (H2) cooling, atomic-cooling haloes enable rapid collapse with suppressed fragmentation. High background LW fluxes from preceding star-formation have been proposed to dissociate H2. This flux can be supplemented by LW radiation from one or more Population III star(s) in the same halo, reducing the necessary background level. Here, we consider atomic-cooling haloes in which multiple protostellar cores form close to one another nearly simultaneously. We assess whether the first star’s LW radiation can dissociate nearby \r\n, enabling rapid accretion on to a nearby protostellar core, and the prompt formation of a second, supermassive star (SMS) from warm, atomically-cooled gas. We use a set of hydrodynamical simulations with the code enzo, with identical LW backgrounds centred on a halo with two adjacent collapsing gas clumps. When an additional large local LW flux is introduced, we observe immediate reductions in both the accretion rates and the stellar masses that form within these clumps. While the LW flux reduces the H2 fraction and increases the gas temperature, the halo core’s potential well is too shallow to promptly heat the gas to >1000 K and increase the second protostar’s accretion rate. We conclude that this internal LW feedback scenario is unlikely to facilitate SMS or massive BH seed formation."}],"external_id":{"isi":["001553472000001"],"arxiv":["2501.12986"]},"author":[{"full_name":"Sullivan, James","first_name":"James","last_name":"Sullivan"},{"last_name":"Haiman","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","orcid":"0000-0003-3633-5403","full_name":"Haiman, Zoltán"},{"full_name":"Kulkarni, Mihir","last_name":"Kulkarni","first_name":"Mihir"},{"last_name":"Visbal","first_name":"Eli","full_name":"Visbal, Eli"}],"oa":1,"page":"822-838","article_type":"original","oa_version":"Published Version","_id":"20250"},{"date_published":"2025-09-01T00:00:00Z","citation":{"ista":"Carlen E, Lewin M, Lieb EH, Seiringer R. 2025. Stability estimate for the Lane–Emden inequality. Calculus of Variations and Partial Differential Equations. 64(7), 226.","apa":"Carlen, E., Lewin, M., Lieb, E. H., & Seiringer, R. (2025). Stability estimate for the Lane–Emden inequality. Calculus of Variations and Partial Differential Equations. Springer Nature. https://doi.org/10.1007/s00526-025-03062-x","short":"E. Carlen, M. Lewin, E.H. Lieb, R. Seiringer, Calculus of Variations and Partial Differential Equations 64 (2025).","chicago":"Carlen, Eric, Mathieu Lewin, Elliott H. Lieb, and Robert Seiringer. “Stability Estimate for the Lane–Emden Inequality.” Calculus of Variations and Partial Differential Equations. Springer Nature, 2025. https://doi.org/10.1007/s00526-025-03062-x.","ieee":"E. Carlen, M. Lewin, E. H. Lieb, and R. Seiringer, “Stability estimate for the Lane–Emden inequality,” Calculus of Variations and Partial Differential Equations, vol. 64, no. 7. Springer Nature, 2025.","ama":"Carlen E, Lewin M, Lieb EH, Seiringer R. Stability estimate for the Lane–Emden inequality. Calculus of Variations and Partial Differential Equations. 2025;64(7). doi:10.1007/s00526-025-03062-x","mla":"Carlen, Eric, et al. “Stability Estimate for the Lane–Emden Inequality.” Calculus of Variations and Partial Differential Equations, vol. 64, no. 7, 226, Springer Nature, 2025, doi:10.1007/s00526-025-03062-x."},"article_number":"226","intvolume":" 64","month":"09","language":[{"iso":"eng"}],"OA_place":"repository","publisher":"Springer Nature","article_processing_charge":"No","quality_controlled":"1","publication":"Calculus of Variations and Partial Differential Equations","scopus_import":"1","publication_identifier":{"issn":["0944-2669"],"eissn":["1432-0835"]},"OA_type":"green","title":"Stability estimate for the Lane–Emden inequality","issue":"7","type":"journal_article","day":"01","acknowledgement":"We are grateful to Rupert Frank and Enno Lenzmann for helpful discussions.","date_created":"2025-08-31T22:01:31Z","arxiv":1,"doi":"10.1007/s00526-025-03062-x","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2410.20113","open_access":"1"}],"status":"public","oa":1,"article_type":"original","oa_version":"Preprint","_id":"20251","department":[{"_id":"RoSe"}],"abstract":[{"text":"The Lane–Emden inequality controls (math. formular) in terms of the L^1 and L^p norms of p. We provide a remainder estimate for this inequality in terms of a suitable distance of p to the manifold of optimizers.","lang":"eng"}],"author":[{"full_name":"Carlen, Eric","last_name":"Carlen","first_name":"Eric"},{"full_name":"Lewin, Mathieu","last_name":"Lewin","first_name":"Mathieu"},{"first_name":"Elliott H.","last_name":"Lieb","full_name":"Lieb, Elliott H."},{"last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"external_id":{"isi":["001558641300006"],"arxiv":["2410.20113"]},"date_updated":"2025-09-30T14:27:35Z","publication_status":"published","year":"2025","volume":64,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1},{"external_id":{"isi":["001550173000001"]},"author":[{"full_name":"Reichholf, Nico","first_name":"Nico","last_name":"Reichholf"},{"last_name":"Horta","first_name":"Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","full_name":"Horta, Sharona"},{"first_name":"David","last_name":"Van Der Heggen","full_name":"Van Der Heggen, David"},{"full_name":"Seno, Carlotta","first_name":"Carlotta","last_name":"Seno"},{"full_name":"Pulparayil Mathew, Jikson","first_name":"Jikson","last_name":"Pulparayil Mathew"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez","first_name":"Maria"},{"full_name":"Smet, Philippe F.","first_name":"Philippe F.","last_name":"Smet"},{"full_name":"De Roo, Jonathan","last_name":"De Roo","first_name":"Jonathan"}],"acknowledged_ssus":[{"_id":"EM-Fac"}],"abstract":[{"text":"Zirconia nanocrystals (ZrO2 NCs) are a stable host material for lanthanides, but their performance lags behind that of the leading NaYF4 nanomaterials. Here, we leverage surface chemistry and core/shell architectures to uncover the contribution of dopants at the nanocrystal surface and of dopants in the nanocrystal bulk. We first assess the doping efficiency by ICP and find that, while Eu is almost quantitatively incorporated, the other lanthanides (La, Ce, Tb, Tm, Er, Yb) have about 50% incorporation efficiency over the studied doping range of 1–10%. We then determine the nanocrystal surface chemistry using NMR spectroscopy, despite the additional spectral line broadening caused by the paramagnetic lanthanide dopants. By varying the surface ligands and measuring the photoluminescence, we resolve the spectroscopic signals that are sensitive to a change in surface chemistry. Time-resolved emission spectra further reinforce the notion of a bulk component with a long luminescent lifetime and a surface component with a fast lifetime. Upon shelling Eu- or Tb-doped zirconia NCs with pure zirconia, the surface component disappears, and the photoluminescence quantum yield increases. We further functionalized the surface of the core/shell particles with oleylphosphonic acid ligands to obtain excellent dispersibility. These results show that lanthanide-doped zirconia NCs can be engineered to eliminate deactivation pathways.","lang":"eng"}],"department":[{"_id":"MaIb"}],"project":[{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"_id":"20252","oa_version":"Preprint","article_type":"original","page":"30371-30382","oa":1,"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2025","volume":19,"publication_status":"published","date_updated":"2025-09-30T14:27:03Z","publication":"ACS Nano","quality_controlled":"1","article_processing_charge":"No","publisher":"American Chemical Society","OA_place":"repository","language":[{"iso":"eng"}],"month":"08","intvolume":" 19","citation":{"ista":"Reichholf N, Horta S, Van Der Heggen D, Seno C, Pulparayil Mathew J, Ibáñez M, Smet PF, De Roo J. 2025. Identification and elimination of surface emission in lanthanide (Co)doped zirconia nanocrystals. ACS Nano. 19(33), 30371–30382.","apa":"Reichholf, N., Horta, S., Van Der Heggen, D., Seno, C., Pulparayil Mathew, J., Ibáñez, M., … De Roo, J. (2025). Identification and elimination of surface emission in lanthanide (Co)doped zirconia nanocrystals. ACS Nano. American Chemical Society. https://doi.org/10.1021/acsnano.5c09137","short":"N. Reichholf, S. Horta, D. Van Der Heggen, C. Seno, J. Pulparayil Mathew, M. Ibáñez, P.F. Smet, J. De Roo, ACS Nano 19 (2025) 30371–30382.","ama":"Reichholf N, Horta S, Van Der Heggen D, et al. Identification and elimination of surface emission in lanthanide (Co)doped zirconia nanocrystals. ACS Nano. 2025;19(33):30371-30382. doi:10.1021/acsnano.5c09137","chicago":"Reichholf, Nico, Sharona Horta, David Van Der Heggen, Carlotta Seno, Jikson Pulparayil Mathew, Maria Ibáñez, Philippe F. Smet, and Jonathan De Roo. “Identification and Elimination of Surface Emission in Lanthanide (Co)Doped Zirconia Nanocrystals.” ACS Nano. American Chemical Society, 2025. https://doi.org/10.1021/acsnano.5c09137.","ieee":"N. Reichholf et al., “Identification and elimination of surface emission in lanthanide (Co)doped zirconia nanocrystals,” ACS Nano, vol. 19, no. 33. American Chemical Society, pp. 30371–30382, 2025.","mla":"Reichholf, Nico, et al. “Identification and Elimination of Surface Emission in Lanthanide (Co)Doped Zirconia Nanocrystals.” ACS Nano, vol. 19, no. 33, American Chemical Society, 2025, pp. 30371–82, doi:10.1021/acsnano.5c09137."},"date_published":"2025-08-26T00:00:00Z","status":"public","doi":"10.1021/acsnano.5c09137","date_created":"2025-08-31T22:01:31Z","main_file_link":[{"url":"https://doi.org/10.26434/chemrxiv-2025-r1gw4","open_access":"1"}],"acknowledgement":"N.R. and C.S. thank the SNSF Eccellenza funding scheme (Project 194172) for funding. D.V.d.H. is supported by the Research Foundation Flanders (FWO) through a Senior Postdoctoral Research Fellowship (N° 1237825N). P.F.S. acknowledges the Special Research Fund at UGent (bof/baf/4y/2024/01/037). M.I. acknowledges financial support from ISTA and the Werner Siemens Foundation. This research was supported by the Scientific Service Units (SSU) of ISTA Austria through resources provided by the electron microscopy facility (EMF). We thank Tommaso Costanzo for providing assistance during STEM measurements. We acknowledge DESY (Hamburg, Germany), a member of the Helmholtz Association HGF, for the provision of experimental facilities. Parts of this research were carried out using beamline P21.1 at PETRA III, and the authors thank Ann-Christin Dippel, Jiatu Liu, and Fernando Igoa for assistance in using the beamline for PDF acquisition (Proposal I-20231114 EC). The authors thank Daniel Häussinger for help with the analysis of NMR spectra.","type":"journal_article","day":"26","issue":"33","title":"Identification and elimination of surface emission in lanthanide (Co)doped zirconia nanocrystals","OA_type":"green","publication_identifier":{"eissn":["1936-086X"]},"scopus_import":"1"},{"oa":1,"oa_version":"Published Version","_id":"20253","ec_funded":1,"project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"department":[{"_id":"ToHe"}],"abstract":[{"text":"A quantitative word automaton (QWA) defines a function from infinite words to values. For example, every infinite run of a limit-average QWA 𝒜 obtains a mean payoff, and every word w ∈ Σ^ω is assigned the maximal mean payoff obtained by nondeterministic runs of 𝒜 over w. We introduce quantitative language automata (QLAs) that define functions from language generators (i.e., implementations) to values, where a language generator can be nonprobabilistic, defining a set of infinite words, or probabilistic, defining a probability measure over infinite words. A QLA consists of a QWA and an aggregator function. For example, given a QWA 𝒜, the infimum aggregator maps each language L ⊆ Σ^ω to the greatest lower bound assigned by 𝒜 to any word in L. For boolean value sets, QWAs define boolean properties of traces, and QLAs define boolean properties of sets of traces, i.e., hyperproperties. For more general value sets, QLAs serve as a specification language for a generalization of hyperproperties, called quantitative hyperproperties. A nonprobabilistic (resp. probabilistic) quantitative hyperproperty assigns a value to each set (resp. distribution) G of traces, e.g., the minimal (resp. expected) average response time exhibited by the traces in G. We give several examples of quantitative hyperproperties and investigate three paradigmatic problems for QLAs: evaluation, nonemptiness, and universality. In the evaluation problem, given a QLA 𝔸 and an implementation G, we ask for the value that 𝔸 assigns to G. In the nonemptiness (resp. universality) problem, given a QLA 𝔸 and a value k, we ask whether 𝔸 assigns at least k to some (resp. every) language. We provide a comprehensive picture of decidability for these problems for QLAs with common aggregators as well as their restrictions to ω-regular languages and trace distributions generated by finite-state Markov chains.","lang":"eng"}],"author":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"full_name":"Kebis, Pavol","id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","first_name":"Pavol","last_name":"Kebis"},{"first_name":"Nicolas Adrien","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E","last_name":"Sarac","first_name":"Naci E"}],"external_id":{"arxiv":["2506.0515"],"isi":["001570540800021"]},"file_date_updated":"2025-09-03T10:01:53Z","alternative_title":["LIPIcs"],"date_updated":"2025-12-01T12:36:52Z","publication_status":"published","year":"2025","volume":348,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"file":[{"access_level":"open_access","success":1,"creator":"dernst","checksum":"9d4054058757a73477e6015b10ed6996","date_created":"2025-09-03T10:01:53Z","file_name":"2025_CONCUR_HenzingerT.pdf","date_updated":"2025-09-03T10:01:53Z","file_size":1257397,"relation":"main_file","content_type":"application/pdf","file_id":"20282"}],"date_published":"2025-08-18T00:00:00Z","citation":{"ista":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2025. Quantitative language automata. 36th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 348, 21.","apa":"Henzinger, T. A., Kebis, P., Mazzocchi, N. A., & Sarac, N. E. (2025). Quantitative language automata. In 36th International Conference on Concurrency Theory (Vol. 348). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2025.21","short":"T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 36th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ama":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Quantitative language automata. In: 36th International Conference on Concurrency Theory. Vol 348. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.CONCUR.2025.21","chicago":"Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Language Automata.” In 36th International Conference on Concurrency Theory, Vol. 348. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.CONCUR.2025.21.","ieee":"T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Quantitative language automata,” in 36th International Conference on Concurrency Theory, Aarhus, Denmark, 2025, vol. 348.","mla":"Henzinger, Thomas A., et al. “Quantitative Language Automata.” 36th International Conference on Concurrency Theory, vol. 348, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.CONCUR.2025.21."},"conference":{"name":"CONCUR: Conference on Concurrency Theory","end_date":"2025-08-29","location":"Aarhus, Denmark","start_date":"2025-08-26"},"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"21","intvolume":" 348","month":"08","language":[{"iso":"eng"}],"OA_place":"publisher","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"No","quality_controlled":"1","publication":"36th International Conference on Concurrency Theory","ddc":["000"],"corr_author":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773898"]},"scopus_import":"1","OA_type":"gold","title":"Quantitative language automata","type":"conference","day":"18","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.","date_created":"2025-08-31T22:01:32Z","doi":"10.4230/LIPIcs.CONCUR.2025.21","arxiv":1,"has_accepted_license":"1","status":"public"},{"day":"01","type":"journal_article","acknowledgement":"J.S. and K.C. were supported by the European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12. J.T. was supported by GAČR grant 25-17377S and by Charles Univ. projects UNCE 24/SCI/008 and PRIMUS 24/SCI/012.","DOAJ_listed":"1","date_created":"2025-08-31T22:01:32Z","arxiv":1,"doi":"10.1093/pnasnexus/pgaf252","status":"public","has_accepted_license":"1","scopus_import":"1","publication_identifier":{"eissn":["2752-6542"]},"ddc":["000"],"title":"Maintaining diversity in structured populations","issue":"8","OA_type":"gold","month":"08","OA_place":"publisher","publisher":"Oxford University Press","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"Yes","publication":"PNAS Nexus","citation":{"ama":"Brewster DA, Svoboda J, Roscow D, Chatterjee K, Tkadlec J, Nowak MA. Maintaining diversity in structured populations. PNAS Nexus. 2025;4(8). doi:10.1093/pnasnexus/pgaf252","chicago":"Brewster, David A., Jakub Svoboda, Dylan Roscow, Krishnendu Chatterjee, Josef Tkadlec, and Martin A. Nowak. “Maintaining Diversity in Structured Populations.” PNAS Nexus. Oxford University Press, 2025. https://doi.org/10.1093/pnasnexus/pgaf252.","ieee":"D. A. Brewster, J. Svoboda, D. Roscow, K. Chatterjee, J. Tkadlec, and M. A. Nowak, “Maintaining diversity in structured populations,” PNAS Nexus, vol. 4, no. 8. Oxford University Press, 2025.","mla":"Brewster, David A., et al. “Maintaining Diversity in Structured Populations.” PNAS Nexus, vol. 4, no. 8, pgaf252, Oxford University Press, 2025, doi:10.1093/pnasnexus/pgaf252.","apa":"Brewster, D. A., Svoboda, J., Roscow, D., Chatterjee, K., Tkadlec, J., & Nowak, M. A. (2025). Maintaining diversity in structured populations. PNAS Nexus. Oxford University Press. https://doi.org/10.1093/pnasnexus/pgaf252","ista":"Brewster DA, Svoboda J, Roscow D, Chatterjee K, Tkadlec J, Nowak MA. 2025. Maintaining diversity in structured populations. PNAS Nexus. 4(8), pgaf252.","short":"D.A. Brewster, J. Svoboda, D. Roscow, K. Chatterjee, J. Tkadlec, M.A. Nowak, PNAS Nexus 4 (2025)."},"date_published":"2025-08-01T00:00:00Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"pgaf252","intvolume":" 4","publication_status":"published","volume":4,"year":"2025","APC_amount":"4493,27 EUR","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2025-09-03T06:20:08Z","file_size":1086419,"relation":"main_file","file_id":"20280","content_type":"application/pdf","file_name":"2025_PNASNexus_Brewster.pdf","success":1,"creator":"dernst","checksum":"8a5e82c6f842e3220ec96028c9374b69","date_created":"2025-09-03T06:20:08Z","access_level":"open_access"}],"file_date_updated":"2025-09-03T06:20:08Z","date_updated":"2026-06-11T09:11:17Z","department":[{"_id":"KrCh"}],"PlanS_conform":"1","abstract":[{"lang":"eng","text":"We examine population structures for their ability to maintain diversity in neutral evolution. We use the general framework of evolutionary graph theory and consider birth–death (bd) and death–birth (db) updating. The population is of size N. Initially all individuals represent different types. The basic question is: what is the time TN until one type takes over the population? This time is known as consensus time in computer science and as total coalescent time in evolutionary biology. For the complete graph, it is known that TN is quadratic in N for db and bd. For the cycle, we prove that TN is cubic in N for db and bd. For the star, we prove that TN is cubic for bd and quasilinear (N log N) for db. For the double star, we show that TN is quartic for bd. We derive upper and lower bounds for all undirected graphs for bd and db. We also show the Pareto front of graphs (of size N = 8) that maintain diversity the longest for bd and db. Further, we show that some graphs that quickly homogenize can maintain high levels of diversity longer than graphs that slowly homogenize. For directed graphs, we give simple contracting star-like structures that have superexponential time scales for maintaining diversity."}],"external_id":{"arxiv":["2503.09841"]},"author":[{"first_name":"David A.","last_name":"Brewster","full_name":"Brewster, David A."},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","last_name":"Svoboda","first_name":"Jakub"},{"full_name":"Roscow, Dylan","first_name":"Dylan","last_name":"Roscow"},{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nowak, Martin A.","first_name":"Martin A.","last_name":"Nowak"}],"oa":1,"article_type":"original","oa_version":"Published Version","ec_funded":1,"_id":"20254","project":[{"call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}]},{"date_updated":"2025-09-30T14:28:42Z","year":"2025","volume":9,"publication_status":"published","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"original","page":"1134-1147","oa":1,"_id":"20255","oa_version":"Preprint","department":[{"_id":"JoMa"}],"external_id":{"isi":["001547681400001"],"arxiv":["2405.21054"]},"author":[{"full_name":"Adamo, Angela","last_name":"Adamo","first_name":"Angela"},{"full_name":"Atek, Hakim","last_name":"Atek","first_name":"Hakim"},{"last_name":"Bagley","first_name":"Micaela B.","full_name":"Bagley, Micaela B."},{"full_name":"Bañados, Eduardo","first_name":"Eduardo","last_name":"Bañados"},{"full_name":"Barrow, Kirk S.S.","first_name":"Kirk S.S.","last_name":"Barrow"},{"first_name":"Danielle A.","last_name":"Berg","full_name":"Berg, Danielle A."},{"full_name":"Bezanson, Rachel","last_name":"Bezanson","first_name":"Rachel"},{"full_name":"Bradač, Maruša","first_name":"Maruša","last_name":"Bradač"},{"first_name":"Gabriel","last_name":"Brammer","full_name":"Brammer, Gabriel"},{"full_name":"Carnall, Adam C.","first_name":"Adam C.","last_name":"Carnall"},{"first_name":"John","last_name":"Chisholm","full_name":"Chisholm, John"},{"full_name":"Coe, Dan","last_name":"Coe","first_name":"Dan"},{"full_name":"Dayal, Pratika","first_name":"Pratika","last_name":"Dayal"},{"full_name":"Eisenstein, Daniel J.","last_name":"Eisenstein","first_name":"Daniel J."},{"full_name":"Eldridge, Jan J.","last_name":"Eldridge","first_name":"Jan J."},{"full_name":"Ferrara, Andrea","first_name":"Andrea","last_name":"Ferrara"},{"first_name":"Seiji","last_name":"Fujimoto","full_name":"Fujimoto, Seiji"},{"first_name":"Anna De","last_name":"Graaff","full_name":"Graaff, Anna De"},{"full_name":"Habouzit, Melanie","last_name":"Habouzit","first_name":"Melanie"},{"last_name":"Hutchison","first_name":"Taylor A.","full_name":"Hutchison, Taylor A."},{"last_name":"Kartaltepe","first_name":"Jeyhan S.","full_name":"Kartaltepe, Jeyhan S."},{"full_name":"Kassin, Susan A.","first_name":"Susan A.","last_name":"Kassin"},{"full_name":"Kriek, Mariska","first_name":"Mariska","last_name":"Kriek"},{"full_name":"Labbé, Ivo","last_name":"Labbé","first_name":"Ivo"},{"full_name":"Maiolino, Roberto","last_name":"Maiolino","first_name":"Roberto"},{"full_name":"Marques-Chaves, Rui","first_name":"Rui","last_name":"Marques-Chaves"},{"full_name":"Maseda, Michael V.","last_name":"Maseda","first_name":"Michael V."},{"full_name":"Mason, Charlotte","first_name":"Charlotte","last_name":"Mason"},{"full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J","last_name":"Matthee"},{"full_name":"Mcquinn, Kristen B.W.","last_name":"Mcquinn","first_name":"Kristen B.W."},{"full_name":"Meynet, Georges","last_name":"Meynet","first_name":"Georges"},{"first_name":"Rohan P.","last_name":"Naidu","full_name":"Naidu, Rohan P."},{"first_name":"Pascal A.","last_name":"Oesch","full_name":"Oesch, Pascal A."},{"first_name":"Laura","last_name":"Pentericci","full_name":"Pentericci, Laura"},{"first_name":"Pablo G.","last_name":"Pérez-González","full_name":"Pérez-González, Pablo G."},{"first_name":"Jane R.","last_name":"Rigby","full_name":"Rigby, Jane R."},{"full_name":"Roberts-Borsani, Guido","last_name":"Roberts-Borsani","first_name":"Guido"},{"first_name":"Daniel","last_name":"Schaerer","full_name":"Schaerer, Daniel"},{"last_name":"Shapley","first_name":"Alice E.","full_name":"Shapley, Alice E."},{"last_name":"Stark","first_name":"Daniel P.","full_name":"Stark, Daniel P."},{"full_name":"Stiavelli, Massimo","last_name":"Stiavelli","first_name":"Massimo"},{"first_name":"Allison L.","last_name":"Strom","full_name":"Strom, Allison L."},{"last_name":"Vanzella","first_name":"Eros","full_name":"Vanzella, Eros"},{"full_name":"Wang, Feige","first_name":"Feige","last_name":"Wang"},{"last_name":"Wilkins","first_name":"Stephen M.","full_name":"Wilkins, Stephen M."},{"last_name":"Williams","first_name":"Christina C.","full_name":"Williams, Christina C."},{"first_name":"Chris J.","last_name":"Willott","full_name":"Willott, Chris J."},{"full_name":"Wylezalek, Dominika","first_name":"Dominika","last_name":"Wylezalek"},{"full_name":"Nota, Antonella","first_name":"Antonella","last_name":"Nota"}],"abstract":[{"lang":"eng","text":"With stunning clarity, the JWST has revealed the Universe’s first billion years. The scientific community is analysing a wealth of JWST imaging and spectroscopic data from that era, and is in the process of rewriting the astronomy textbooks. Here, as a result of the 2024 ISSI Breakthrough Workshop, we provide a snapshot of the great progress made towards understanding the initial chapters of our cosmic history 1.5 years into the JWST science mission. We present the current census of early galaxies, their luminosities, appearance, chemical composition, masses and formation histories as revealed by JWST. We relate the discovery of massive black holes in early galaxies and discuss their demographics and implications for their formations and growth. We conclude by describing the potential sources of reionization and our current understanding of how the Universe became fully ionized. Throughout the Perspective, we highlight discoveries and breakthroughs, topics and issues that are not yet understood, and questions that will be addressed in the coming years, as JWST continues its revolutionary observations of the early Universe."}],"publication_identifier":{"eissn":["2397-3366"]},"scopus_import":"1","title":"The first billion years according to JWST","issue":"8","OA_type":"green","acknowledgement":"While this Perspective is written by a small number of authors, invited to ISSI Bern in March 2024 as part of the 2024 ISSI Breakthrough Workshop, we acknowledge the work of a large community that is advancing our collective understanding of the evolution of the early Universe. We thank ISSI for sponsoring the 2024 Breakthrough Workshop, and the ISSI staff for their wonderful welcome and support. We are grateful to the author collaborators, who made this paper possible. Collectively, we are grateful to the large group of committed scientists and engineers, worldwide, who designed, built and commissioned the JWST and made a decades-long astronomer dream a reality. R.P.N. is a NASA Hubble Fellow. We are grateful to M. Dickinson for a careful read of the final paper and to F. Crameri (ISSI) for his expert help designing the very best figures. We dedicate this paper to the 20,000 people who spent decades to make JWST an incredible discovery machine.","type":"journal_article","day":"01","status":"public","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2405.21054","open_access":"1"}],"date_created":"2025-08-31T22:01:32Z","doi":"10.1038/s41550-025-02624-5","arxiv":1,"citation":{"apa":"Adamo, A., Atek, H., Bagley, M. B., Bañados, E., Barrow, K. S. S., Berg, D. A., … Nota, A. (2025). The first billion years according to JWST. Nature Astronomy. Springer Nature. https://doi.org/10.1038/s41550-025-02624-5","ista":"Adamo A, Atek H, Bagley MB, Bañados E, Barrow KSS, Berg DA, Bezanson R, Bradač M, Brammer G, Carnall AC, Chisholm J, Coe D, Dayal P, Eisenstein DJ, Eldridge JJ, Ferrara A, Fujimoto S, Graaff AD, Habouzit M, Hutchison TA, Kartaltepe JS, Kassin SA, Kriek M, Labbé I, Maiolino R, Marques-Chaves R, Maseda MV, Mason C, Matthee JJ, Mcquinn KBW, Meynet G, Naidu RP, Oesch PA, Pentericci L, Pérez-González PG, Rigby JR, Roberts-Borsani G, Schaerer D, Shapley AE, Stark DP, Stiavelli M, Strom AL, Vanzella E, Wang F, Wilkins SM, Williams CC, Willott CJ, Wylezalek D, Nota A. 2025. The first billion years according to JWST. Nature Astronomy. 9(8), 1134–1147.","short":"A. Adamo, H. Atek, M.B. Bagley, E. Bañados, K.S.S. Barrow, D.A. Berg, R. Bezanson, M. Bradač, G. Brammer, A.C. Carnall, J. Chisholm, D. Coe, P. Dayal, D.J. Eisenstein, J.J. Eldridge, A. Ferrara, S. Fujimoto, A.D. Graaff, M. Habouzit, T.A. Hutchison, J.S. Kartaltepe, S.A. Kassin, M. Kriek, I. Labbé, R. Maiolino, R. Marques-Chaves, M.V. Maseda, C. Mason, J.J. Matthee, K.B.W. Mcquinn, G. Meynet, R.P. Naidu, P.A. Oesch, L. Pentericci, P.G. Pérez-González, J.R. Rigby, G. Roberts-Borsani, D. Schaerer, A.E. Shapley, D.P. Stark, M. Stiavelli, A.L. Strom, E. Vanzella, F. Wang, S.M. Wilkins, C.C. Williams, C.J. Willott, D. Wylezalek, A. Nota, Nature Astronomy 9 (2025) 1134–1147.","ama":"Adamo A, Atek H, Bagley MB, et al. The first billion years according to JWST. Nature Astronomy. 2025;9(8):1134-1147. doi:10.1038/s41550-025-02624-5","ieee":"A. Adamo et al., “The first billion years according to JWST,” Nature Astronomy, vol. 9, no. 8. Springer Nature, pp. 1134–1147, 2025.","chicago":"Adamo, Angela, Hakim Atek, Micaela B. Bagley, Eduardo Bañados, Kirk S.S. Barrow, Danielle A. Berg, Rachel Bezanson, et al. “The First Billion Years According to JWST.” Nature Astronomy. Springer Nature, 2025. https://doi.org/10.1038/s41550-025-02624-5.","mla":"Adamo, Angela, et al. “The First Billion Years According to JWST.” Nature Astronomy, vol. 9, no. 8, Springer Nature, 2025, pp. 1134–47, doi:10.1038/s41550-025-02624-5."},"date_published":"2025-08-01T00:00:00Z","intvolume":" 9","publisher":"Springer Nature","OA_place":"repository","language":[{"iso":"eng"}],"month":"08","publication":"Nature Astronomy","quality_controlled":"1","article_processing_charge":"No"},{"status":"public","has_accepted_license":"1","arxiv":1,"date_created":"2025-08-31T22:01:32Z","acknowledgement":"This work was supported in part by the ERC project ERC-2020-AdG 101020093.\r\n","day":"01","type":"conference","OA_type":"gold","title":"Predictive monitoring of black-box dynamical systems","ddc":["000"],"corr_author":"1","scopus_import":"1","publication_identifier":{"eissn":["2640-3498"]},"publication":"7th Annual Learning for Dynamics & Control Conference","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"ML Research Press","OA_place":"publisher","month":"06","intvolume":" 283","conference":{"start_date":"2025-06-04","location":"Ann Arbor, MI, United States","end_date":"2025-06-06","name":"L4DC: Learning for Dynamics & Control"},"date_published":"2025-06-01T00:00:00Z","citation":{"short":"T.A. Henzinger, F. Kresse, K. Mallik, E. Yu, D. Zikelic, in:, 7th Annual Learning for Dynamics & Control Conference, ML Research Press, 2025, pp. 804–816.","ista":"Henzinger TA, Kresse F, Mallik K, Yu E, Zikelic D. 2025. Predictive monitoring of black-box dynamical systems. 7th Annual Learning for Dynamics & Control Conference. L4DC: Learning for Dynamics & Control, PMLR, vol. 283, 804–816.","apa":"Henzinger, T. A., Kresse, F., Mallik, K., Yu, E., & Zikelic, D. (2025). Predictive monitoring of black-box dynamical systems. In 7th Annual Learning for Dynamics & Control Conference (Vol. 283, pp. 804–816). Ann Arbor, MI, United States: ML Research Press.","mla":"Henzinger, Thomas A., et al. “Predictive Monitoring of Black-Box Dynamical Systems.” 7th Annual Learning for Dynamics & Control Conference, vol. 283, ML Research Press, 2025, pp. 804–16.","ama":"Henzinger TA, Kresse F, Mallik K, Yu E, Zikelic D. Predictive monitoring of black-box dynamical systems. In: 7th Annual Learning for Dynamics & Control Conference. Vol 283. ML Research Press; 2025:804-816.","ieee":"T. A. Henzinger, F. Kresse, K. Mallik, E. Yu, and D. Zikelic, “Predictive monitoring of black-box dynamical systems,” in 7th Annual Learning for Dynamics & Control Conference, Ann Arbor, MI, United States, 2025, vol. 283, pp. 804–816.","chicago":"Henzinger, Thomas A, Fabian Kresse, Kaushik Mallik, Emily Yu, and Dorde Zikelic. “Predictive Monitoring of Black-Box Dynamical Systems.” In 7th Annual Learning for Dynamics & Control Conference, 283:804–16. ML Research Press, 2025."},"file":[{"access_level":"open_access","success":1,"creator":"dernst","checksum":"d5236e561560635f5ae1d17de4903033","date_created":"2025-09-03T10:32:12Z","file_name":"2025_L4DC_HenzingerT.pdf","file_size":489639,"date_updated":"2025-09-03T10:32:12Z","relation":"main_file","content_type":"application/pdf","file_id":"20283"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":283,"year":"2025","publication_status":"published","date_updated":"2025-09-03T10:37:59Z","alternative_title":["PMLR"],"file_date_updated":"2025-09-03T10:32:12Z","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Kresse, Fabian","id":"faff3c84-23f6-11ef-9085-e5187b51c604","first_name":"Fabian","last_name":"Kresse"},{"first_name":"Kaushik","last_name":"Mallik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","full_name":"Yu, Zhengqi","last_name":"Yu","first_name":"Zhengqi"},{"first_name":"Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["2412.16564"]},"abstract":[{"text":"We study the problem of predictive runtime monitoring of black-box dynamical systems with quantitative safety properties. The black-box setting stipulates that the exact semantics of the dynamical system and the controller are unknown, and that we are only able to observe the state of the controlled (aka, closed-loop) system at finitely many time points. We present a novel framework for predicting future states of the system based on the states observed in the past. The numbers of past states and of predicted future states are parameters provided by the user. Our method is based on a combination of Taylor’s expansion and the backward difference operator for numerical differentiation. We also derive an upper bound on the prediction error under the assumption that the system dynamics and the controller are smooth. The predicted states are then used to predict safety violations ahead in time. Our experiments demonstrate practical applicability of our method for complex black-box systems, showing that it is computationally lightweight and yet significantly more accurate than the state-of-the-art predictive safety monitoring techniques.","lang":"eng"}],"department":[{"_id":"ToHe"},{"_id":"ChLa"}],"_id":"20256","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"ec_funded":1,"oa_version":"Published Version","page":"804-816","oa":1},{"publication":"Journal of Molecular Biology","quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","publisher":"Elsevier","OA_place":"publisher","language":[{"iso":"eng"}],"month":"12","intvolume":" 437","article_number":"169379","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"apa":"Rohden, D., Napoli, F., Kapitonova, A., Tatman, B., Lichtenecker, R. J., & Schanda, P. (2025). Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme. Journal of Molecular Biology. Elsevier. https://doi.org/10.1016/j.jmb.2025.169379","ista":"Rohden D, Napoli F, Kapitonova A, Tatman B, Lichtenecker RJ, Schanda P. 2025. Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme. Journal of Molecular Biology. 437(23), 169379.","short":"D. Rohden, F. Napoli, A. Kapitonova, B. Tatman, R.J. Lichtenecker, P. Schanda, Journal of Molecular Biology 437 (2025).","ama":"Rohden D, Napoli F, Kapitonova A, Tatman B, Lichtenecker RJ, Schanda P. Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme. Journal of Molecular Biology. 2025;437(23). doi:10.1016/j.jmb.2025.169379","chicago":"Rohden, Darja, Federico Napoli, Anna Kapitonova, Benjamin Tatman, Roman J. Lichtenecker, and Paul Schanda. “Arginine Dynamics Probed by Magic-Angle Spinning NMR with a Specific Isotope-Labeling Scheme.” Journal of Molecular Biology. Elsevier, 2025. https://doi.org/10.1016/j.jmb.2025.169379.","ieee":"D. Rohden, F. Napoli, A. Kapitonova, B. Tatman, R. J. Lichtenecker, and P. Schanda, “Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme,” Journal of Molecular Biology, vol. 437, no. 23. Elsevier, 2025.","mla":"Rohden, Darja, et al. “Arginine Dynamics Probed by Magic-Angle Spinning NMR with a Specific Isotope-Labeling Scheme.” Journal of Molecular Biology, vol. 437, no. 23, 169379, Elsevier, 2025, doi:10.1016/j.jmb.2025.169379."},"date_published":"2025-12-01T00:00:00Z","has_accepted_license":"1","status":"public","date_created":"2025-08-31T22:01:33Z","doi":"10.1016/j.jmb.2025.169379","acknowledgement":"This work was supported financially by the Austrian Science Fund (FWF, Grant No. I5812-B, “AlloSpace”). 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 Facility and the Lab Support Facility (LSF). We thank Petra Rovò and Margarita Valhondo Falcón for excellent support of the NMR facility.","day":"01","type":"journal_article","issue":"23","title":"Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme","OA_type":"hybrid","publication_identifier":{"eissn":["1089-8638"],"issn":["0022-2836"]},"scopus_import":"1","ddc":["540"],"corr_author":"1","external_id":{"isi":["001618289100020"]},"author":[{"id":"81dc668a-19fa-11f0-bf31-d56534059ef3","full_name":"Rohden, Darja","last_name":"Rohden","first_name":"Darja"},{"last_name":"Napoli","first_name":"Federico","id":"d42e08e7-f4fc-11eb-af0a-d71e26138f1b","orcid":"0000-0002-9043-136X","full_name":"Napoli, Federico"},{"first_name":"Anna","last_name":"Kapitonova","full_name":"Kapitonova, Anna","id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471"},{"last_name":"Tatman","first_name":"Benjamin","id":"71cda2f3-e604-11ee-a1df-da10587eda3f","full_name":"Tatman, Benjamin"},{"first_name":"Roman J.","last_name":"Lichtenecker","full_name":"Lichtenecker, Roman J."},{"last_name":"Schanda","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606"}],"acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"abstract":[{"text":"The specific introduction of ^1H-^13C or ^1H-^15N moieties into otherwise deuterated proteins holds great potential for high-resolution solution and magic-angle spinning (MAS) NMR studies of protein structure and dynamics. Arginine residues play key roles for example at active sites of enzymes. Taking advantage of a chemically synthesized Arg with a ^13C-^1H2 group in an otherwise deuterated backbone, we demonstrate here the usefulness of proton-detected MAS NMR approaches to probe arginine dynamics. In experiments with crystalline ubiquitin and the 134 kDa tetrameric enzyme malate dehydrogenase we detected a wide range of motions, from sites that are rigid on time scales of at least tens of milliseconds to residues undergoing predominantly nanosecond motions. Spin-relaxation and dipolar-coupling measurements enabled quantitative determination of these dynamics. We observed microsecond dynamics of residue Arg54 in crystalline ubiquitin, whose backbone is known to sample different β-turn conformations on this time scale. The labeling scheme and experiments presented here expand the toolkit for high-resolution proton-detected MAS NMR.","lang":"eng"}],"PlanS_conform":"1","department":[{"_id":"PaSc"}],"project":[{"name":"AlloSpace. The emergence and mechanisms of allostery","_id":"eb9c82eb-77a9-11ec-83b8-aadd536561cf","grant_number":"I05812"}],"_id":"20258","oa_version":"Published Version","article_type":"original","oa":1,"related_material":{"record":[{"id":"19956","status":"public","relation":"research_data"}]},"file":[{"date_updated":"2025-12-29T14:51:40Z","file_size":2270555,"relation":"main_file","content_type":"application/pdf","file_id":"20876","file_name":"2025_JourMolecularBiology_Rohden.pdf","success":1,"creator":"dernst","checksum":"90d50594d8ea9860ac5da41297992847","date_created":"2025-12-29T14:51:40Z","access_level":"open_access"}],"isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2025","volume":437,"publication_status":"published","date_updated":"2026-06-10T08:20:37Z","file_date_updated":"2025-12-29T14:51:40Z"},{"OA_type":"closed access","title":"The actin cortex acts as a mechanical memory of morphology in confined migrating cells","corr_author":"1","publication_identifier":{"eissn":["1745-2481"],"issn":["1745-2473"]},"scopus_import":"1","status":"public","doi":"10.1038/s41567-025-02980-z","date_created":"2025-08-31T22:01:33Z","acknowledgement":"We are grateful to members of S.G.’s laboratory for feedback and suggestions. We thank E. Hannezo, J. O. Rädler, M. Piel, O. du Roure and J. Heuvingh for inspiring discussions. Y.K. and S.G. acknowledge J. B. Braquenier from Nikon Instruments Belux and the Nikon BioImaging Lab in Leiden (the Netherlands) for their support with the Nikon Spatial Array Confocal enhanced-resolution confocal microscopy. We thank D. S. Herrador and M. Balland for their help in improving the microprinting method. D.B.B. was supported by the NOMIS Foundation as a NOMIS Fellow and by an EMBO Postdoctoral Fellowship (ALTF 343-2022). Y.K., M.L. and S.G. acknowledge funding from the University of Mons (FEDER Prostem Research Project no. 1510614, Wallonia DG06), the F.R.S.-FNRS (Epiforce Project no. T.0092.21, Cellsqueezer Project no. J.0061.23 and Optopattern Project no. U.NO26.22) and the Interreg projects ANTIRESI and MICROPLAITE, which are financially supported by Interreg France-Wallonie-Vlaanderen (Fonds Européen de Développement Régional). Y.K. and M.L. are financially supported by F.R.S.-FNRS as FRIA Grantee FNRS and Postdoctoral Fellow (Chargé de Recherches), respectively. Y.K. and S.G. acknowledge le Fonds pour la Recherche Médicale dans le Hainaut (FRMH). G.C. was supported by a grant from the Biotechnology and Biological Sciences Research Council (grant no. BB/V007483/1).","type":"journal_article","day":"01","intvolume":" 21","date_published":"2025-09-01T00:00:00Z","citation":{"apa":"Kalukula, Y., Luciano, M., Simanov, G., Charras, G., Brückner, D., & Gabriele, S. (2025). The actin cortex acts as a mechanical memory of morphology in confined migrating cells. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-025-02980-z","ista":"Kalukula Y, Luciano M, Simanov G, Charras G, Brückner D, Gabriele S. 2025. The actin cortex acts as a mechanical memory of morphology in confined migrating cells. Nature Physics. 21, 1451–1461.","short":"Y. Kalukula, M. Luciano, G. Simanov, G. Charras, D. Brückner, S. Gabriele, Nature Physics 21 (2025) 1451–1461.","ama":"Kalukula Y, Luciano M, Simanov G, Charras G, Brückner D, Gabriele S. The actin cortex acts as a mechanical memory of morphology in confined migrating cells. Nature Physics. 2025;21:1451-1461. doi:10.1038/s41567-025-02980-z","ieee":"Y. Kalukula, M. Luciano, G. Simanov, G. Charras, D. Brückner, and S. Gabriele, “The actin cortex acts as a mechanical memory of morphology in confined migrating cells,” Nature Physics, vol. 21. Springer Nature, pp. 1451–1461, 2025.","chicago":"Kalukula, Yohalie, Marine Luciano, Gleb Simanov, Guillaume Charras, David Brückner, and Sylvain Gabriele. “The Actin Cortex Acts as a Mechanical Memory of Morphology in Confined Migrating Cells.” Nature Physics. Springer Nature, 2025. https://doi.org/10.1038/s41567-025-02980-z.","mla":"Kalukula, Yohalie, et al. “The Actin Cortex Acts as a Mechanical Memory of Morphology in Confined Migrating Cells.” Nature Physics, vol. 21, Springer Nature, 2025, pp. 1451–61, doi:10.1038/s41567-025-02980-z."},"publication":"Nature Physics","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Springer Nature","month":"09","date_updated":"2025-12-30T09:34:11Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"year":"2025","volume":21,"publication_status":"published","project":[{"name":"A mechano-chemical theory for stem cell fate decisions in organoid development","grant_number":"ALTF 343-2022","_id":"34e2a5b5-11ca-11ed-8bc3-b2265616ef0b"}],"_id":"20259","oa_version":"None","article_type":"original","page":"1451-1461","author":[{"full_name":"Kalukula, Yohalie","last_name":"Kalukula","first_name":"Yohalie"},{"full_name":"Luciano, Marine","first_name":"Marine","last_name":"Luciano"},{"full_name":"Simanov, Gleb","last_name":"Simanov","first_name":"Gleb"},{"full_name":"Charras, Guillaume","last_name":"Charras","first_name":"Guillaume"},{"id":"e1e86031-6537-11eb-953a-f7ab92be508d","orcid":"0000-0001-7205-2975","full_name":"Brückner, David","last_name":"Brückner","first_name":"David"},{"full_name":"Gabriele, Sylvain","first_name":"Sylvain","last_name":"Gabriele"}],"external_id":{"isi":["001556019400001"]},"abstract":[{"text":"Cell migration in narrow microenvironments occurs in numerous physiological processes. It involves successive cycles of confinement and release that drive important morphological changes. However, it remains unclear whether migrating cells can retain a memory of their past morphological states that could potentially facilitate their navigation through confined spaces. We demonstrate that local geometry governs a switch between two cell morphologies, thereby facilitating cell passage through long and narrow gaps. We combined cell migration assays on standardized microsystems with biophysical modelling and biochemical perturbations to show that migrating cells have a long-term memory of past confinement events. The morphological cell states correlate across transitions through actin cortex remodelling. These findings indicate that mechanical memory in migrating cells plays an active role in their migratory potential in confined environments.","lang":"eng"}],"department":[{"_id":"EdHa"}]},{"related_material":{"record":[{"id":"21021","status":"public","relation":"dissertation_contains"}]},"file":[{"file_name":"2025_LaMatematica_Chambers.pdf","file_size":2678640,"date_updated":"2025-12-30T07:52:58Z","file_id":"20885","content_type":"application/pdf","relation":"main_file","access_level":"open_access","creator":"dernst","success":1,"date_created":"2025-12-30T07:52:58Z","checksum":"e2043259194bfcdf3d74c4da8a5a853f"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":4,"year":"2025","publication_status":"published","date_updated":"2026-04-07T11:42:48Z","file_date_updated":"2025-12-30T07:52:58Z","author":[{"full_name":"Chambers, Erin Wolf","first_name":"Erin Wolf","last_name":"Chambers"},{"id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","full_name":"Fillmore, Christopher D","last_name":"Fillmore","first_name":"Christopher D"},{"first_name":"Elizabeth R","last_name":"Stephenson","orcid":"0000-0002-6862-208X","full_name":"Stephenson, Elizabeth R","id":"2D04F932-F248-11E8-B48F-1D18A9856A87"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","first_name":"Mathijs"}],"abstract":[{"text":"The medial axis of a set consists of the points in the ambient space without a unique closest point in the original set. Since its introduction, the medial axis has been used extensively in many applications as a method of computing a skeleton topologically equivalent to the original set. Unfortunately, one limiting factor in the use of the medial axis of a smooth manifold is that it is not necessarily topologically stable under small perturbations of the manifold. To counter these instabilities, various prunings of the medial axis have been proposed in the computational geometry community. Here, we examine one type of pruning, called burning. Because of the good experimental results it was hoped that the burning method of simplifying the medial axis would be stable. In this work, we show a simple example that dashes such hopes. Based on Bing’s house with two rooms, we demonstrate an isotopy of a shape where the medial axis goes from collapsible to non-collapsible. More precisely, we consider the standard deformation retract from the closed ball to Bing’s house with two rooms, but stop just short of the point where Bing’s house becomes two dimensional. This way we obtain an isotopy from the 3-ball to a thickened version of Bing’s house. Under this isotopy, the medial axis goes from collapsible to non-collapsible. We stress that this isotopy can be made generic, in the sense of singularity theory, as developed by Arnol’d and Thom.","lang":"eng"}],"PlanS_conform":"1","department":[{"_id":"HeEd"}],"_id":"20260","project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","grant_number":"M03073"}],"ec_funded":1,"oa_version":"Published Version","article_type":"original","page":"811-828","oa":1,"has_accepted_license":"1","status":"public","doi":"10.1007/s44007-025-00170-0","date_created":"2025-08-31T22:01:33Z","acknowledgement":"We thank André Lieutier, David Letscher, Ellen Gasparovic, Kathryn Leonard, and Tao Ju for early discussions on this work. We also thank Lu Liu, Yajie Yan, and Tao Ju for sharing code to generate the examples. We further thank Abigail Thompson for discussion on the conjecture and James Damon for sharing his insight in singularity theory. We thank the reviewers for their detailed reviews, which helped to improve the exposition.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria). Partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’ and the European Research Council (ERC), grant no. 788183, ‘Alpha Shape Theory Extended’. The first author was supported in part by the National Science Foundation through grants DBI-1759807, CCF-1907612, and CCF-2444309. The fourth author was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) M-3073, ANR grant StratMesh, ANR-24-CE48-1899, and the welcome package from IDEX of the Université Côte d’Azur, ANR-15-IDEX-01.","day":"01","type":"journal_article","title":"Burning or collapsing the medial axis is unstable","OA_type":"hybrid","scopus_import":"1","publication_identifier":{"eissn":["2730-9657"]},"corr_author":"1","ddc":["510"],"publication":"La Matematica","quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","OA_place":"publisher","publisher":"Springer Nature","language":[{"iso":"eng"}],"month":"12","intvolume":" 4","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"apa":"Chambers, E. W., Fillmore, C. D., Stephenson, E. R., & Wintraecken, M. (2025). Burning or collapsing the medial axis is unstable. La Matematica. Springer Nature. https://doi.org/10.1007/s44007-025-00170-0","ista":"Chambers EW, Fillmore CD, Stephenson ER, Wintraecken M. 2025. Burning or collapsing the medial axis is unstable. La Matematica. 4, 811–828.","short":"E.W. Chambers, C.D. Fillmore, E.R. Stephenson, M. Wintraecken, La Matematica 4 (2025) 811–828.","ieee":"E. W. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “Burning or collapsing the medial axis is unstable,” La Matematica, vol. 4. Springer Nature, pp. 811–828, 2025.","chicago":"Chambers, Erin Wolf, Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “Burning or Collapsing the Medial Axis Is Unstable.” La Matematica. Springer Nature, 2025. https://doi.org/10.1007/s44007-025-00170-0.","ama":"Chambers EW, Fillmore CD, Stephenson ER, Wintraecken M. Burning or collapsing the medial axis is unstable. La Matematica. 2025;4:811-828. doi:10.1007/s44007-025-00170-0","mla":"Chambers, Erin Wolf, et al. “Burning or Collapsing the Medial Axis Is Unstable.” La Matematica, vol. 4, Springer Nature, 2025, pp. 811–28, doi:10.1007/s44007-025-00170-0."},"date_published":"2025-12-01T00:00:00Z"},{"department":[{"_id":"GradSch"},{"_id":"BeBi"}],"abstract":[{"text":"Complex 3D shapes can be created by morphing flat 2D configurations. Such deformations\r\neither preserve the intrinsic material geometry (e.g., folding paper) or modify it through\r\nlocalized contraction. Once transformed, the 3D shape can be further controlled to achieve a\r\ntarget functionality. A key challenge is to take the material specifications and the actuation\r\nprocess as input to automatically design the target 3D shape and its functionality. This thesis\r\npresents two novel computational pipelines for the design and control of shape-morphing\r\nstructures used to create functional prototypes.\r\nThe first pipeline borrows from the art of origami to fold paper into intricate shapes and\r\napplies this principle to make 3D lighting displays. We introduce, PCBend a computational\r\ndesign approach that covers a surface with individually addressable RGB LEDs, effectively\r\nforming a low-resolution surface by folding rigid printed circuit boards (PCBs). We optimize\r\ncut patterns on PCBs to act as hinges and co-design LED placement, circuit routing, and\r\nfabrication constraints to produce PCB blueprints. The PCBs are fabricated using automated\r\nstandard manufacturing services with LEDs embedded on them. Finally, the fabricated PCBs\r\nare cut along the contour and folded onto a 3D-printed support. The 3D lighting display is\r\nthen controlled to display complex surface light patterns.\r\nCreating 3D shapes through folding is only possible if their planar configuration, called ”unfolding” exists without any distortion or overlap. Existing methods often permit distortion\r\nor require multiple patches, which are unsuitable for fabrication pipelines that rely on folding\r\nnon-stretchable materials. We reinforce such fabrication pipelines by providing a geometric\r\nrelaxation to the problem, where the input shape is modified to admit overlap-free unfolding.\r\nThe second fabrication pipeline extends shape morphing to soft robotics by emulating nature’s\r\nblueprint of distributed actuation. Inspired by vertebrates, we build musculoskeletal robots\r\nusing modular active actuators, employing Liquid Crystal Elastomers (LCEs) as shrinkable\r\nartificial muscles integrated with 3D-printed bones. The chemical composition of LCEs is\r\naltered to enable untethered actuation through infrared radiation, allowing active control of\r\nindividual muscles and their corresponding bones. The combined motion of individual bones\r\ndefines the robot’s overall shape and functionality. Our proposed system significantly expands\r\nboth the design and control spaces of soft robots, which we harness using our computational\r\ndesign tools. We build several physical robots that exhibit complex shape morphing and varied\r\nterrain navigation, showcasing the versatility of our pipeline.\r\nThis thesis explores applications ranging from intricate light patterns displayed on 3D shapes\r\nformed by folding rigid PCBs to untethered robots that use contractile muscles to exhibit\r\nshape morphing and locomotion. Through these examples, the thesis highlights how computational design and distributed actuation, integrated with novel materials, can transform\r\npassive structures into functional prototypes.","lang":"eng"}],"author":[{"last_name":"Bhargava","first_name":"Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","full_name":"Bhargava, Manas","orcid":"0009-0007-6138-6890"}],"oa":1,"page":"96","oa_version":"Published Version","_id":"20276","ec_funded":1,"project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"publication_status":"published","year":"2025","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"relation":"main_file","file_id":"20284","content_type":"application/pdf","file_size":161436245,"date_updated":"2025-09-03T10:40:52Z","file_name":"2025-Bhargava-Manas-Thesis.pdf","checksum":"5baf8ca46c86a94fc8380ff1007aabd4","date_created":"2025-09-03T10:40:52Z","success":1,"creator":"mbhargav","access_level":"open_access"},{"file_name":"manas_phd_thesis_source_files.zip","date_updated":"2025-09-04T09:22:29Z","file_size":198831315,"content_type":"application/x-zip-compressed","file_id":"20285","relation":"source_file","access_level":"closed","creator":"mbhargav","date_created":"2025-09-03T13:18:05Z","checksum":"66878fafbc0074f88ddd18f24a9fc647"}],"related_material":{"record":[{"id":"13049","relation":"part_of_dissertation","status":"public"},{"id":"18565","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"20286"}]},"supervisor":[{"orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel"}],"file_date_updated":"2025-09-04T09:22:29Z","degree_awarded":"PhD","alternative_title":["ISTA Thesis"],"date_updated":"2026-05-04T12:41:53Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","month":"09","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","OA_place":"publisher","article_processing_charge":"No","date_published":"2025-09-02T00:00:00Z","citation":{"short":"M. Bhargava, Design and Control of Deformable Structures : From PCB Lighting Displays to Elastomer Robots, Institute of Science and Technology Austria, 2025.","ista":"Bhargava M. 2025. Design and control of deformable structures : From PCB lighting displays to elastomer robots. Institute of Science and Technology Austria.","apa":"Bhargava, M. (2025). Design and control of deformable structures : From PCB lighting displays to elastomer robots. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20276","mla":"Bhargava, Manas. Design and Control of Deformable Structures : From PCB Lighting Displays to Elastomer Robots. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20276.","ama":"Bhargava M. Design and control of deformable structures : From PCB lighting displays to elastomer robots. 2025. doi:10.15479/AT-ISTA-20276","chicago":"Bhargava, Manas. “Design and Control of Deformable Structures : From PCB Lighting Displays to Elastomer Robots.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20276.","ieee":"M. Bhargava, “Design and control of deformable structures : From PCB lighting displays to elastomer robots,” Institute of Science and Technology Austria, 2025."},"tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"day":"02","type":"dissertation","acknowledgement":"Financial support was provided by the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design\r\nand Modeling that I gratefully acknowledge.\r\n","doi":"10.15479/AT-ISTA-20276","date_created":"2025-09-02T14:48:39Z","has_accepted_license":"1","status":"public","ddc":["000"],"corr_author":"1","publication_identifier":{"isbn":["978-3-99078-065-7"],"issn":["2663-337X"]},"title":"Design and control of deformable structures : From PCB lighting displays to elastomer robots"},{"publication":"arXiv","article_processing_charge":"No","OA_place":"repository","language":[{"iso":"eng"}],"month":"08","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"ista":"Bhargava M, Hiraki T, Strugaru I-M, Zhang Y, Piovarci M, Daraio C, Iwai D, Bickel B. Computational design and fabrication of modular robots with untethered control. arXiv, 10.48550/arXiv.2508.05410.","apa":"Bhargava, M., Hiraki, T., Strugaru, I.-M., Zhang, Y., Piovarci, M., Daraio, C., … Bickel, B. (n.d.). Computational design and fabrication of modular robots with untethered control. arXiv. https://doi.org/10.48550/arXiv.2508.05410","short":"M. Bhargava, T. Hiraki, I.-M. Strugaru, Y. Zhang, M. Piovarci, C. Daraio, D. Iwai, B. Bickel, ArXiv (n.d.).","ieee":"M. Bhargava et al., “Computational design and fabrication of modular robots with untethered control,” arXiv. .","chicago":"Bhargava, Manas, Takefumi Hiraki, Irina-Malina Strugaru, Yuhan Zhang, Michael Piovarci, Chiara Daraio, Daisuke Iwai, and Bernd Bickel. “Computational Design and Fabrication of Modular Robots with Untethered Control.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2508.05410.","ama":"Bhargava M, Hiraki T, Strugaru I-M, et al. Computational design and fabrication of modular robots with untethered control. arXiv. doi:10.48550/arXiv.2508.05410","mla":"Bhargava, Manas, et al. “Computational Design and Fabrication of Modular Robots with Untethered Control.” ArXiv, doi:10.48550/arXiv.2508.05410."},"date_published":"2025-08-31T00:00:00Z","status":"public","doi":"10.48550/arXiv.2508.05410","arxiv":1,"date_created":"2025-09-04T09:14:11Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2508.05410","open_access":"1"}],"acknowledgement":"The authors express gratitude to Magali Lorion for assisting in the initial fabrication of LCEs,\r\nPengbin Tang for providing the code for simulating discrete elastic rods, the Imaging and\r\nOptics Facility at ISTA for assisting with the spectrometry measurements, and the MIBA\r\nmachine shop at ISTA for their support in manufacturing various devices.\r\nFunding: This project was supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation program (Grant Agreement No.\r\n715767 -– MATERIALIZABLE).","day":"31","type":"preprint","title":"Computational design and fabrication of modular robots with untethered control","corr_author":"1","external_id":{"arxiv":["2508.05410"]},"author":[{"id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","full_name":"Bhargava, Manas","orcid":"0009-0007-6138-6890","last_name":"Bhargava","first_name":"Manas"},{"full_name":"Hiraki, Takefumi","last_name":"Hiraki","first_name":"Takefumi"},{"first_name":"Irina-Malina","last_name":"Strugaru","full_name":"Strugaru, Irina-Malina","id":"2afc607f-f128-11eb-9611-8f2a0dfcf074"},{"full_name":"Zhang, Yuhan","last_name":"Zhang","first_name":"Yuhan"},{"id":"62E473F4-5C99-11EA-A40E-AF823DDC885E","orcid":"0000-0002-5062-4474","full_name":"Piovarci, Michael","last_name":"Piovarci","first_name":"Michael"},{"last_name":"Daraio","first_name":"Chiara","full_name":"Daraio, Chiara"},{"full_name":"Iwai, Daisuke","first_name":"Daisuke","last_name":"Iwai"},{"last_name":"Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"}],"abstract":[{"lang":"eng","text":"Natural organisms utilize distributed actuation through their musculoskeletal\r\nsystems to adapt their gait for traversing diverse terrains or to morph their\r\nbodies for varied tasks. A longstanding challenge in robotics is to emulate\r\nthis capability of natural organisms, which has motivated the development of\r\nnumerous soft robotic systems. However, such systems are generally optimized\r\nfor a single functionality, lack the ability to change form or function on\r\ndemand, or remain tethered to bulky control systems. To address these\r\nlimitations, we present a framework for designing and controlling robots that\r\nutilize distributed actuation. We propose a novel building block that\r\nintegrates 3D-printed bones with liquid crystal elastomer (LCE) muscles as\r\nlightweight actuators, enabling the modular assembly of musculoskeletal robots.\r\nWe developed LCE rods that contract in response to infrared radiation, thereby\r\nproviding localized, untethered control over the distributed skeletal network\r\nand producing global deformations of the robot. To fully capitalize on the\r\nextensive design space, we introduce two computational tools: one for\r\noptimizing the robot's skeletal graph to achieve multiple target deformations,\r\nand another for co-optimizing skeletal designs and control gaits to realize\r\ndesired locomotion. We validate our framework by constructing several robots\r\nthat demonstrate complex shape morphing, diverse control schemes, and\r\nenvironmental adaptability. Our system integrates advances in modular material\r\nbuilding, untethered and distributed control, and computational design to\r\nintroduce a new generation of robots that brings us closer to the capabilities\r\nof living organisms."}],"department":[{"_id":"BeBi"}],"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"_id":"20286","ec_funded":1,"oa_version":"Preprint","oa":1,"related_material":{"record":[{"id":"20276","status":"public","relation":"dissertation_contains"}]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","year":"2025","publication_status":"draft","date_updated":"2026-05-04T12:41:52Z"},{"quality_controlled":"1","article_processing_charge":"Yes (in subscription journal)","publication":"Proceedings of the National Academy of Sciences","month":"08","pmid":1,"publisher":"National Academy of Sciences","OA_place":"publisher","language":[{"iso":"eng"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"e2504064122","intvolume":" 122","citation":{"ista":"Ucar MC, Zane A, Alanko JH, Sixt MK, Hannezo EB. 2025. Self-generated chemotaxis of mixed cell populations. Proceedings of the National Academy of Sciences. 122(34), e2504064122.","apa":"Ucar, M. C., Zane, A., Alanko, J. H., Sixt, M. K., & Hannezo, E. B. (2025). Self-generated chemotaxis of mixed cell populations. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.2504064122","short":"M.C. Ucar, A. Zane, J.H. Alanko, M.K. Sixt, E.B. Hannezo, Proceedings of the National Academy of Sciences 122 (2025).","ama":"Ucar MC, Zane A, Alanko JH, Sixt MK, Hannezo EB. Self-generated chemotaxis of mixed cell populations. Proceedings of the National Academy of Sciences. 2025;122(34). doi:10.1073/pnas.2504064122","ieee":"M. C. Ucar, A. Zane, J. H. Alanko, M. K. Sixt, and E. B. Hannezo, “Self-generated chemotaxis of mixed cell populations,” Proceedings of the National Academy of Sciences, vol. 122, no. 34. National Academy of Sciences, 2025.","chicago":"Ucar, Mehmet C, Alsberga Zane, Jonna H Alanko, Michael K Sixt, and Edouard B Hannezo. “Self-Generated Chemotaxis of Mixed Cell Populations.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2025. https://doi.org/10.1073/pnas.2504064122.","mla":"Ucar, Mehmet C., et al. “Self-Generated Chemotaxis of Mixed Cell Populations.” Proceedings of the National Academy of Sciences, vol. 122, no. 34, e2504064122, National Academy of Sciences, 2025, doi:10.1073/pnas.2504064122."},"date_published":"2025-08-26T00:00:00Z","doi":"10.1073/pnas.2504064122","date_created":"2025-09-07T22:01:32Z","has_accepted_license":"1","status":"public","day":"26","type":"journal_article","acknowledgement":"We thank all members of the M.S. and E.H. groups for stimulating discussions.We thank the Imaging and Optics facility, the Pre-clinical and Lab Support facility of the Institute of Science and Technology Austria for their excellent support and provided resources for the experimental research. In particular, we thank Jack Merrin from the Nanofabrication facility who generated the microfabricated channel used in this study. This work received funding fromt he European Research Council under the European Union’s Horizon 2020 research and innovation program (grant agreement No. 851288 to E.H.). M.C.U.is funded by a University of Sheffield Strategic Research Fellowship in the Physics of Life and Quantitative Biology.","issue":"34","title":"Self-generated chemotaxis of mixed cell populations","OA_type":"hybrid","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"scopus_import":"1","corr_author":"1","ddc":["570"],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"LifeSc"},{"_id":"NanoFab"}],"abstract":[{"text":"Cell and tissue movement in development, cancer invasion, and immune response relies on chemical or mechanical guidance cues. In many systems, this behavior is locally directed by self-generated signaling gradients rather than long-range, prepatterned cues. However, how heterogeneous mixtures of cells interact nonreciprocally and navigate through self-generated gradients remains largely unexplored. Here, we introduce a theoretical framework for the self-organized chemotaxis of heterogeneous cell populations. We find that the relative chemotactic sensitivities of different cell populations control their long-time coupling and comigration dynamics, with boundary conditions such as external cell and attractant reservoirs substantially influencing the migration patterns. Our model predicts an optimal parameter regime that enables robust and colocalized migration. We test our theoretical predictions with in vitro experiments demonstrating the comigration of distinct immune cell populations, and quantitatively reproduce observed migration patterns under wild-type and perturbed conditions. Interestingly, immune cell comigration occurs close to the predicted optimal regime. Finally, we incorporate mechanical interactions into our framework, revealing a nontrivial interplay between chemotactic and mechanical nonreciprocity in driving collective migration. Together, our findings suggest that self-generated chemotaxis is a robust strategy for the navigation of mixed cell populations.","lang":"eng"}],"external_id":{"isi":["001562181600001"],"pmid":["40838890"]},"author":[{"last_name":"Ucar","first_name":"Mehmet C","id":"50B2A802-6007-11E9-A42B-EB23E6697425","orcid":"0000-0003-0506-4217","full_name":"Ucar, Mehmet C"},{"last_name":"Zane","first_name":"Alsberga","id":"60f7509a-f652-11ea-9d86-b963d6490d7c","orcid":"0009-0003-0415-7603","full_name":"Zane, Alsberga"},{"id":"2CC12E8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7698-3061","full_name":"Alanko, Jonna H","last_name":"Alanko","first_name":"Jonna H"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K"},{"first_name":"Edouard B","last_name":"Hannezo","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"EdHa"},{"_id":"MiSi"}],"PlanS_conform":"1","oa_version":"Published Version","ec_funded":1,"_id":"20289","project":[{"_id":"05943252-7A3F-11EA-A408-12923DDC885E","grant_number":"851288","call_identifier":"H2020","name":"Design Principles of Branching Morphogenesis"}],"oa":1,"article_type":"original","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"url":"https://github.com/mehmetcanucar/Self-generated-chemotaxis","relation":"software"}]},"file":[{"file_name":"2025_PNAS_Ucar.pdf","file_size":16069140,"date_updated":"2025-09-08T07:23:29Z","file_id":"20307","content_type":"application/pdf","relation":"main_file","access_level":"open_access","creator":"dernst","success":1,"date_created":"2025-09-08T07:23:29Z","checksum":"b36abd92673b6d76376fc9434bad52cc"}],"publication_status":"published","year":"2025","volume":122,"APC_amount":"5766,07 EUR","date_updated":"2026-05-20T08:59:54Z","file_date_updated":"2025-09-08T07:23:29Z"},{"department":[{"_id":"ToHe"}],"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"}],"external_id":{"arxiv":["2502.0531"]},"author":[{"full_name":"Brice, Léonard","first_name":"Léonard","last_name":"Brice"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Thejaswini, K. S.","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","first_name":"K. S.","last_name":"Thejaswini"}],"oa":1,"oa_version":"Published Version","ec_funded":1,"_id":"20290","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"publication_status":"published","year":"2025","volume":345,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","creator":"dernst","success":1,"date_created":"2025-09-08T07:11:12Z","checksum":"9bc6b8e537662d371d2a27444cbc0b75","file_name":"2025_MFCS_Brice.pdf","date_updated":"2025-09-08T07:11:12Z","file_size":1149694,"content_type":"application/pdf","file_id":"20306","relation":"main_file"}],"file_date_updated":"2025-09-08T07:11:12Z","alternative_title":["LIPIcs"],"date_updated":"2025-09-08T07:15:40Z","month":"08","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","OA_place":"publisher","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"Yes","publication":"50th International Symposium on Mathematical Foundations of Computer Science","citation":{"apa":"Brice, L., Henzinger, T. A., & Thejaswini, K. S. (2025). Finding equilibria: Simpler for pessimists, simplest for optimists. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.30","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.","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.","ama":"Brice L, Henzinger TA, Thejaswini KS. Finding equilibria: Simpler for pessimists, simplest for optimists. In: 50th International Symposium on Mathematical Foundations of Computer Science. Vol 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.MFCS.2025.30","ieee":"L. Brice, T. A. Henzinger, and K. S. Thejaswini, “Finding equilibria: Simpler for pessimists, simplest for optimists,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345.","chicago":"Brice, Léonard, Thomas A Henzinger, and K. S. Thejaswini. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.30.","mla":"Brice, Léonard, et al. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.30."},"date_published":"2025-08-20T00:00:00Z","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2025-08-29","location":"Warsaw, Poland","start_date":"2025-08-25"},"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"30","intvolume":" 345","type":"conference","day":"20","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. ","date_created":"2025-09-07T22:01:32Z","doi":"10.4230/LIPIcs.MFCS.2025.30","arxiv":1,"has_accepted_license":"1","status":"public","scopus_import":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773881"]},"corr_author":"1","ddc":["000"],"title":"Finding equilibria: Simpler for pessimists, simplest for optimists","OA_type":"gold"},{"date_updated":"2025-09-08T07:06:11Z","alternative_title":["LIPIcs"],"file_date_updated":"2025-09-08T06:56:56Z","file":[{"success":1,"creator":"dernst","checksum":"6068b772aba6cb0d01f3e5a90abed973","date_created":"2025-09-08T06:56:56Z","access_level":"open_access","file_size":1009644,"date_updated":"2025-09-08T06:56:56Z","relation":"main_file","content_type":"application/pdf","file_id":"20305","file_name":"2025_MFCS_HenzingerT.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2025","volume":345,"publication_status":"published","_id":"20291","project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"ec_funded":1,"oa_version":"Published Version","oa":1,"external_id":{"arxiv":["2502.12872"]},"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Prakash, Aditya","last_name":"Prakash","first_name":"Aditya"},{"id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","full_name":"Thejaswini, K. S.","last_name":"Thejaswini","first_name":"K. S."}],"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"}],"department":[{"_id":"ToHe"}],"title":"Resolving nondeterminism with randomness","OA_type":"gold","publication_identifier":{"isbn":["9783959773881"],"issn":["1868-8969"]},"scopus_import":"1","ddc":["000"],"corr_author":"1","has_accepted_license":"1","status":"public","arxiv":1,"date_created":"2025-09-07T22:01:32Z","doi":"10.4230/LIPIcs.MFCS.2025.57","acknowledgement":"This work is a part of project VAMOS that has received funding from the European Research Council (ERC), grant agreement No 101020093.","day":"20","type":"conference","article_number":"57","intvolume":" 345","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"conference":{"name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2025-08-29","location":"Warsaw, Poland","start_date":"2025-08-25"},"citation":{"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.","apa":"Henzinger, T. A., Prakash, A., & Thejaswini, K. S. (2025). Resolving nondeterminism with randomness. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.57","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.","mla":"Henzinger, Thomas A., et al. “Resolving Nondeterminism with Randomness.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.57.","ama":"Henzinger TA, Prakash A, Thejaswini KS. Resolving nondeterminism with randomness. In: 50th International Symposium on Mathematical Foundations of Computer Science. Vol 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.MFCS.2025.57","chicago":"Henzinger, Thomas A, Aditya Prakash, and K. S. Thejaswini. “Resolving Nondeterminism with Randomness.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.57.","ieee":"T. A. Henzinger, A. Prakash, and K. S. Thejaswini, “Resolving nondeterminism with randomness,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345."},"date_published":"2025-08-20T00:00:00Z","publication":"50th International Symposium on Mathematical Foundations of Computer Science","quality_controlled":"1","article_processing_charge":"No","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","OA_place":"publisher","language":[{"iso":"eng"}],"month":"08"},{"citation":{"apa":"Gupta, A., Henzinger, T. A., Kueffner, K., Mallik, K., & Pape, D. (2025). Monitoring robustness and individual fairness. In Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining (Vol. 2, pp. 790–801). Toronto, Canada: Association for Computing Machinery. https://doi.org/10.1145/3711896.3737054","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.","ama":"Gupta A, Henzinger TA, Kueffner K, Mallik K, Pape D. Monitoring robustness and individual fairness. In: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining. Vol 2. Association for Computing Machinery; 2025:790-801. doi:10.1145/3711896.3737054","ieee":"A. Gupta, T. A. Henzinger, K. Kueffner, K. Mallik, and D. Pape, “Monitoring robustness and individual fairness,” in Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Toronto, Canada, 2025, vol. 2, pp. 790–801.","chicago":"Gupta, Ashutosh, Thomas A Henzinger, Konstantin Kueffner, Kaushik Mallik, and David Pape. “Monitoring Robustness and Individual Fairness.” In Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2:790–801. Association for Computing Machinery, 2025. https://doi.org/10.1145/3711896.3737054.","mla":"Gupta, Ashutosh, et al. “Monitoring Robustness and Individual Fairness.” Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, vol. 2, Association for Computing Machinery, 2025, pp. 790–801, doi:10.1145/3711896.3737054."},"date_published":"2025-08-03T00:00:00Z","conference":{"location":"Toronto, Canada","start_date":"2025-08-03","end_date":"2025-08-07","name":"KDD: Conference on Knowledge Discovery and Data Mining"},"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":" 2","month":"08","OA_place":"publisher","publisher":"Association for Computing Machinery","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","publication":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","publication_identifier":{"issn":["2154-817X"],"isbn":["9798400714542"]},"scopus_import":"1","ddc":["000"],"corr_author":"1","title":"Monitoring robustness and individual fairness","type":"conference","day":"03","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.","arxiv":1,"date_created":"2025-09-07T22:01:33Z","doi":"10.1145/3711896.3737054","status":"public","has_accepted_license":"1","oa":1,"page":"790-801","oa_version":"Published Version","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"_id":"20292","ec_funded":1,"department":[{"_id":"ToHe"}],"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."}],"external_id":{"arxiv":["2506.00496"]},"author":[{"first_name":"Ashutosh","last_name":"Gupta","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"last_name":"Kueffner","first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542"},{"last_name":"Mallik","first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475"},{"full_name":"Pape, David","first_name":"David","last_name":"Pape"}],"file_date_updated":"2025-09-08T08:46:31Z","date_updated":"2025-09-08T08:54:24Z","publication_status":"published","year":"2025","volume":2,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"url":"https://github.com/ariez-xyz/clemont","relation":"software"}]},"file":[{"file_name":"2025_KDD_Gupta.pdf","file_id":"20310","content_type":"application/pdf","relation":"main_file","date_updated":"2025-09-08T08:46:31Z","file_size":7745940,"access_level":"open_access","date_created":"2025-09-08T08:46:31Z","checksum":"81e18cdf9ca5f6dfa79425b326ea9725","creator":"dernst","success":1}]},{"date_updated":"2025-09-30T14:32:31Z","file_date_updated":"2025-09-08T07:55:48Z","file":[{"creator":"dernst","success":1,"date_created":"2025-09-08T07:55:48Z","checksum":"65c5399c4015d9c8abb8c7a96f3d7836","access_level":"open_access","date_updated":"2025-09-08T07:55:48Z","file_size":379340,"file_id":"20309","content_type":"application/pdf","relation":"main_file","file_name":"2025_Entropy_Akopyan.pdf"}],"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":27,"year":"2025","publication_status":"published","_id":"20293","ec_funded":1,"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020","name":"Alpha Shape Theory Extended"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF","name":"Mathematics, Computer Science"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF"}],"oa_version":"Published Version","article_type":"original","oa":1,"external_id":{"pmid":["40870326"],"isi":["001557476000001"]},"author":[{"last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Virk, Ziga","id":"2E36B656-F248-11E8-B48F-1D18A9856A87","first_name":"Ziga","last_name":"Virk"},{"id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert","last_name":"Wagner","first_name":"Hubert"}],"abstract":[{"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.","lang":"eng"}],"PlanS_conform":"1","department":[{"_id":"HeEd"}],"issue":"8","title":"Tight bounds between the Jensen–Shannon divergence and the minmax divergence","OA_type":"gold","scopus_import":"1","publication_identifier":{"eissn":["1099-4300"]},"corr_author":"1","ddc":["500"],"status":"public","has_accepted_license":"1","date_created":"2025-09-07T22:01:33Z","doi":"10.3390/e27080854","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.","DOAJ_listed":"1","day":"01","type":"journal_article","intvolume":" 27","article_number":"854","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"short":"A. Akopyan, H. Edelsbrunner, Z. Virk, H. Wagner, Entropy 27 (2025).","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.","apa":"Akopyan, A., Edelsbrunner, H., Virk, Z., & Wagner, H. (2025). Tight bounds between the Jensen–Shannon divergence and the minmax divergence. Entropy. MDPI. https://doi.org/10.3390/e27080854","mla":"Akopyan, Arseniy, et al. “Tight Bounds between the Jensen–Shannon Divergence and the Minmax Divergence.” Entropy, vol. 27, no. 8, 854, MDPI, 2025, doi:10.3390/e27080854.","ama":"Akopyan A, Edelsbrunner H, Virk Z, Wagner H. Tight bounds between the Jensen–Shannon divergence and the minmax divergence. Entropy. 2025;27(8). doi:10.3390/e27080854","ieee":"A. Akopyan, H. Edelsbrunner, Z. Virk, and H. Wagner, “Tight bounds between the Jensen–Shannon divergence and the minmax divergence,” Entropy, vol. 27, no. 8. MDPI, 2025.","chicago":"Akopyan, Arseniy, Herbert Edelsbrunner, Ziga Virk, and Hubert Wagner. “Tight Bounds between the Jensen–Shannon Divergence and the Minmax Divergence.” Entropy. MDPI, 2025. https://doi.org/10.3390/e27080854."},"date_published":"2025-08-01T00:00:00Z","publication":"Entropy","quality_controlled":"1","article_processing_charge":"Yes","OA_place":"publisher","publisher":"MDPI","language":[{"iso":"eng"}],"month":"08","pmid":1},{"date_published":"2025-08-01T00:00:00Z","citation":{"mla":"Xiao, Mengyuan, et al. “No [C II] or Dust Detection in Two Little Red Dots at Zspec > 7.” Astronomy & Astrophysics, vol. 700, A231, EDP Sciences, 2025, doi:10.1051/0004-6361/202554361.","ama":"Xiao M, Oesch PA, Bing L, et al. No [C II] or dust detection in two Little Red Dots at zspec > 7. Astronomy & Astrophysics. 2025;700. doi:10.1051/0004-6361/202554361","ieee":"M. Xiao et al., “No [C II] or dust detection in two Little Red Dots at zspec > 7,” Astronomy & Astrophysics, vol. 700. EDP Sciences, 2025.","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 > 7.” Astronomy & Astrophysics. EDP Sciences, 2025. https://doi.org/10.1051/0004-6361/202554361.","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 & Astrophysics 700 (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 > 7. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202554361","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 > 7. Astronomy & Astrophysics. 700, A231."},"intvolume":" 700","article_number":"A231","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"language":[{"iso":"eng"}],"OA_place":"publisher","publisher":"EDP Sciences","month":"08","publication":"Astronomy & Astrophysics","article_processing_charge":"No","quality_controlled":"1","ddc":["520"],"scopus_import":"1","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"OA_type":"diamond","title":"No [C II] or dust detection in two Little Red Dots at zspec > 7","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.","day":"01","type":"journal_article","has_accepted_license":"1","status":"public","doi":"10.1051/0004-6361/202554361","date_created":"2025-09-07T22:01:33Z","arxiv":1,"article_type":"original","oa":1,"_id":"20294","oa_version":"Published Version","PlanS_conform":"1","department":[{"_id":"JoMa"}],"author":[{"last_name":"Xiao","first_name":"Mengyuan","full_name":"Xiao, Mengyuan"},{"first_name":"Pascal A.","last_name":"Oesch","full_name":"Oesch, Pascal A."},{"last_name":"Bing","first_name":"Longji","full_name":"Bing, Longji"},{"full_name":"Elbaz, David","last_name":"Elbaz","first_name":"David"},{"full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J","last_name":"Matthee"},{"last_name":"Fudamoto","first_name":"Yoshinobu","full_name":"Fudamoto, Yoshinobu"},{"first_name":"Seiji","last_name":"Fujimoto","full_name":"Fujimoto, Seiji"},{"last_name":"Marques-Chaves","first_name":"Rui","full_name":"Marques-Chaves, Rui"},{"full_name":"Williams, Christina C.","last_name":"Williams","first_name":"Christina C."},{"first_name":"Miroslava","last_name":"Dessauges-Zavadsky","full_name":"Dessauges-Zavadsky, Miroslava"},{"full_name":"Valentino, Francesco","last_name":"Valentino","first_name":"Francesco"},{"first_name":"Gabriel","last_name":"Brammer","full_name":"Brammer, Gabriel"},{"last_name":"Covelo-Paz","first_name":"Alba","full_name":"Covelo-Paz, Alba"},{"full_name":"Daddi, Emanuele","last_name":"Daddi","first_name":"Emanuele"},{"first_name":"Johan P.U.","last_name":"Fynbo","full_name":"Fynbo, Johan P.U."},{"last_name":"Gillman","first_name":"Steven","full_name":"Gillman, Steven"},{"last_name":"Ginolfi","first_name":"Michele","full_name":"Ginolfi, Michele"},{"last_name":"Giovinazzo","first_name":"Emma","full_name":"Giovinazzo, Emma"},{"last_name":"Greene","first_name":"Jenny E.","full_name":"Greene, Jenny E."},{"full_name":"Gu, Qiusheng","first_name":"Qiusheng","last_name":"Gu"},{"last_name":"Illingworth","first_name":"Garth","full_name":"Illingworth, Garth"},{"first_name":"Kohei","last_name":"Inayoshi","full_name":"Inayoshi, Kohei"},{"full_name":"Kokorev, Vasily","first_name":"Vasily","last_name":"Kokorev"},{"last_name":"Meyer","first_name":"Romain A.","full_name":"Meyer, Romain A."},{"first_name":"Rohan P.","last_name":"Naidu","full_name":"Naidu, Rohan P."},{"last_name":"Reddy","first_name":"Naveen A.","full_name":"Reddy, Naveen A."},{"full_name":"Schaerer, Daniel","last_name":"Schaerer","first_name":"Daniel"},{"last_name":"Shapley","first_name":"Alice","full_name":"Shapley, Alice"},{"first_name":"Mauro","last_name":"Stefanon","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."},{"full_name":"Vestergaard, Marianne","last_name":"Vestergaard","first_name":"Marianne"},{"last_name":"Wang","first_name":"Tao","full_name":"Wang, Tao"}],"external_id":{"arxiv":["2503.01945"],"isi":["001559174700004"]},"abstract":[{"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.","lang":"eng"}],"file_date_updated":"2025-09-08T07:40:53Z","date_updated":"2026-02-16T12:12:36Z","volume":700,"year":"2025","publication_status":"published","file":[{"checksum":"fab2168609078b8336be01ef13b3238e","date_created":"2025-09-08T07:40:53Z","success":1,"creator":"dernst","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"20308","file_size":3648334,"date_updated":"2025-09-08T07:40:53Z","file_name":"2025_AstronomyAstrophysics_Xiao.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1},{"arxiv":1,"doi":"10.1002/admi.202500521","date_created":"2025-09-07T22:01:33Z","has_accepted_license":"1","status":"public","day":"01","type":"journal_article","DOAJ_listed":"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.","OA_type":"gold","title":"A duality between surface charge and work function in scanning Kelvin probe microscopy","issue":"19","ddc":["530"],"corr_author":"1","scopus_import":"1","publication_identifier":{"eissn":["2196-7350"]},"article_processing_charge":"Yes","quality_controlled":"1","publication":"Advanced Materials Interfaces","month":"10","language":[{"iso":"eng"}],"publisher":"Wiley","OA_place":"publisher","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":" 12","article_number":"e00521","date_published":"2025-10-01T00:00:00Z","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.” Advanced Materials Interfaces. Wiley, 2025. https://doi.org/10.1002/admi.202500521.","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,” Advanced Materials Interfaces, vol. 12, no. 19. Wiley, 2025.","ama":"Lenton IC, Pertl F, Shafeek LB, Waitukaitis SR. A duality between surface charge and work function in scanning Kelvin probe microscopy. Advanced Materials Interfaces. 2025;12(19). doi:10.1002/admi.202500521","mla":"Lenton, Isaac C., et al. “A Duality between Surface Charge and Work Function in Scanning Kelvin Probe Microscopy.” Advanced Materials Interfaces, vol. 12, no. 19, e00521, Wiley, 2025, doi:10.1002/admi.202500521.","apa":"Lenton, I. C., Pertl, F., Shafeek, L. B., & Waitukaitis, S. R. (2025). A duality between surface charge and work function in scanning Kelvin probe microscopy. Advanced Materials Interfaces. Wiley. https://doi.org/10.1002/admi.202500521","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.","short":"I.C. Lenton, F. Pertl, L.B. Shafeek, S.R. Waitukaitis, Advanced Materials Interfaces 12 (2025)."},"isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","creator":"dernst","success":1,"date_created":"2025-12-30T09:31:11Z","checksum":"906fcc7733be8ce8a83600427b82cd5a","file_name":"2025_AdvMaterialsInterfaces_Lenton.pdf","date_updated":"2025-12-30T09:31:11Z","file_size":1830117,"file_id":"20908","content_type":"application/pdf","relation":"main_file"}],"publication_status":"published","volume":12,"year":"2025","date_updated":"2025-12-30T09:31:25Z","file_date_updated":"2025-12-30T09:31:11Z","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."}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"author":[{"id":"a550210f-223c-11ec-8182-e2d45e817efb","full_name":"Lenton, Isaac C","orcid":"0000-0002-5010-6984","last_name":"Lenton","first_name":"Isaac C"},{"first_name":"Felix","last_name":"Pertl","full_name":"Pertl, Felix","orcid":"0000-0003-0463-5794","id":"6313aec0-15b2-11ec-abd3-ed67d16139af"},{"first_name":"Lubuna B","last_name":"Shafeek","orcid":"0000-0001-7180-6050","full_name":"Shafeek, Lubuna B","id":"3CD37A82-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Waitukaitis","first_name":"Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R"}],"external_id":{"isi":["001560163400001"],"arxiv":["2506.07187"]},"department":[{"_id":"ScWa"},{"_id":"NanoFab"}],"PlanS_conform":"1","oa_version":"Published Version","project":[{"call_identifier":"H2020","grant_number":"949120","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","name":"Tribocharge: a multi-scale approach to an enduring problem in physics"}],"_id":"20295","ec_funded":1,"oa":1,"article_type":"original"},{"file_date_updated":"2025-09-09T08:10:13Z","alternative_title":["PMLR"],"date_updated":"2025-09-09T08:12:44Z","publication_status":"published","volume":288,"year":"2025","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"dernst","success":1,"date_created":"2025-09-09T08:10:13Z","checksum":"90a32defed34787e771a5c1623b6b0d2","access_level":"open_access","date_updated":"2025-09-09T08:10:13Z","file_size":295466,"content_type":"application/pdf","file_id":"20314","relation":"main_file","file_name":"2025_NeuS_Kresse.pdf"}],"oa":1,"oa_version":"Published Version","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"}],"_id":"20296","ec_funded":1,"department":[{"_id":"ChLa"},{"_id":"ToHe"}],"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"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"author":[{"full_name":"Kresse, Fabian","id":"faff3c84-23f6-11ef-9085-e5187b51c604","first_name":"Fabian","last_name":"Kresse"},{"last_name":"Yu","first_name":"Zhengqi","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","full_name":"Yu, Zhengqi"},{"last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"}],"external_id":{"arxiv":["2505.19932"]},"corr_author":"1","ddc":["000"],"publication_identifier":{"eissn":["2640-3498"]},"scopus_import":"1","OA_type":"diamond","title":"Logic gate neural networks are good for verification","day":"01","type":"conference","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).","arxiv":1,"date_created":"2025-09-07T22:01:34Z","status":"public","has_accepted_license":"1","date_published":"2025-06-01T00:00:00Z","citation":{"short":"F. Kresse, E. Yu, C. Lampert, T.A. Henzinger, in:, 2nd International Conferenceon Neuro-Symbolic Systems, ML Research Press, 2025.","apa":"Kresse, F., Yu, E., Lampert, C., & Henzinger, T. A. (2025). Logic gate neural networks are good for verification. In 2nd International Conferenceon Neuro-Symbolic Systems (Vol. 288). Philadephia, PA, United States: ML Research Press.","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.” 2nd International Conferenceon Neuro-Symbolic Systems, vol. 288, 26, ML Research Press, 2025.","chicago":"Kresse, Fabian, Emily Yu, Christoph Lampert, and Thomas A Henzinger. “Logic Gate Neural Networks Are Good for Verification.” In 2nd International Conferenceon Neuro-Symbolic Systems, Vol. 288. ML Research Press, 2025.","ieee":"F. Kresse, E. Yu, C. Lampert, and T. A. Henzinger, “Logic gate neural networks are good for verification,” in 2nd International Conferenceon Neuro-Symbolic Systems, Philadephia, PA, United States, 2025, vol. 288.","ama":"Kresse F, Yu E, Lampert C, Henzinger TA. Logic gate neural networks are good for verification. In: 2nd International Conferenceon Neuro-Symbolic Systems. Vol 288. ML Research Press; 2025."},"conference":{"start_date":"2025-05-28","location":"Philadephia, PA, United States","name":"NeuS: International Conferenceon Neuro-Symbolic Systems","end_date":"2025-05-30"},"intvolume":" 288","article_number":"26","month":"06","language":[{"iso":"eng"}],"OA_place":"publisher","publisher":"ML Research Press","article_processing_charge":"No","quality_controlled":"1","publication":"2nd International Conferenceon Neuro-Symbolic Systems"}]