[{"publication_identifier":{"isbn":["9798400721373"]},"doi":"10.1145/3757377.3763962","publication":"Proceedings SIGGRAPH Asia 2025 Conference Papers 2025","date_created":"2026-03-22T23:04:35Z","year":"2025","article_number":"108","has_accepted_license":"1","ddc":["000"],"conference":{"location":"Hong Kong, Hong Kong","end_date":"2025-12-18","name":"SA: SIGGRAPH Asia","start_date":"2025-12-15"},"file":[{"success":1,"creator":"dernst","content_type":"application/pdf","file_name":"2025_SiggraphAsia_Rao.pdf","date_created":"2026-03-23T14:41:07Z","file_size":57903731,"date_updated":"2026-03-23T14:41:07Z","access_level":"open_access","checksum":"a3dc426cdf7bbd84a192e5140bb3bb49","relation":"main_file","file_id":"21479"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Pramod","last_name":"Rao","full_name":"Rao, Pramod"},{"last_name":"Meka","first_name":"Abhimitra","full_name":"Meka, Abhimitra"},{"last_name":"Zhou","first_name":"Xilong","full_name":"Zhou, Xilong"},{"full_name":"Fox, Gereon","last_name":"Fox","first_name":"Gereon"},{"full_name":"Mallikarjun, B. R.","first_name":"B. R.","last_name":"Mallikarjun"},{"last_name":"Zhan","first_name":"Fangneng","full_name":"Zhan, Fangneng"},{"full_name":"Weyrich, Tim","last_name":"Weyrich","first_name":"Tim"},{"last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pfister, Hanspeter","first_name":"Hanspeter","last_name":"Pfister"},{"full_name":"Matusik, Wojciech","first_name":"Wojciech","last_name":"Matusik"},{"last_name":"Beeler","first_name":"Thabo","full_name":"Beeler, Thabo"},{"full_name":"Elgharib, Mohamed","first_name":"Mohamed","last_name":"Elgharib"},{"first_name":"Marc","last_name":"Habermann","full_name":"Habermann, Marc"},{"full_name":"Theobalt, Christian","first_name":"Christian","last_name":"Theobalt"}],"OA_place":"publisher","title":"3DPR: Single image 3D portrait relighting with generative priors","article_processing_charge":"No","license":"https://creativecommons.org/licenses/by-nc/4.0/","external_id":{"arxiv":["2510.15846"]},"publication_status":"published","abstract":[{"lang":"eng","text":"Rendering novel, relit views of a human head, given a monocular portrait image as input, is an inherently underconstrained problem. The traditional graphics solution is to explicitly decompose the input image into geometry, material and lighting via differentiable rendering; but this is constrained by the multiple assumptions and approximations of the underlying models and parameterizations of these scene components. We propose 3DPR, an image-based relighting model that leverages generative priors learnt from multi-view One-Light-at-A-Time (OLAT) images captured in a light stage. We introduce a new diverse and large-scale multi-view 4K OLAT dataset of 139 subjects to learn a high-quality prior over the distribution of high-frequency face reflectance. We leverage the latent space of a pre-trained generative head model that provides a rich prior over face geometry learnt from in-the-wild image datasets. The input portrait is first embedded in the latent manifold of such a model through an encoder-based inversion process. Then a novel triplane-based reflectance network trained on our lightstage data is used to synthesize high-fidelity OLAT images to enable image-based relighting. Our reflectance network operates in the latent space of the generative head model, crucially enabling a relatively small number of lightstage images to train the reflectance model. Combining the generated OLATs according to a given HDRI environment maps yields physically accurate environmental relighting results. Through quantitative and qualitative evaluations, we demonstrate that 3DPR outperforms previous methods, particularly in preserving identity and in capturing lighting effects such as specularities, self-shadows, and subsurface scattering."}],"day":"14","status":"public","tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"OA_type":"gold","citation":{"mla":"Rao, Pramod, et al. “3DPR: Single Image 3D Portrait Relighting with Generative Priors.” <i>Proceedings SIGGRAPH Asia 2025 Conference Papers 2025</i>, 108, Association for Computing Machinery, 2025, doi:<a href=\"https://doi.org/10.1145/3757377.3763962\">10.1145/3757377.3763962</a>.","chicago":"Rao, Pramod, Abhimitra Meka, Xilong Zhou, Gereon Fox, B. R. Mallikarjun, Fangneng Zhan, Tim Weyrich, et al. “3DPR: Single Image 3D Portrait Relighting with Generative Priors.” In <i>Proceedings SIGGRAPH Asia 2025 Conference Papers 2025</i>. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1145/3757377.3763962\">https://doi.org/10.1145/3757377.3763962</a>.","apa":"Rao, P., Meka, A., Zhou, X., Fox, G., Mallikarjun, B. R., Zhan, F., … Theobalt, C. (2025). 3DPR: Single image 3D portrait relighting with generative priors. In <i>Proceedings SIGGRAPH Asia 2025 Conference Papers 2025</i>. Hong Kong, Hong Kong: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3757377.3763962\">https://doi.org/10.1145/3757377.3763962</a>","ista":"Rao P, Meka A, Zhou X, Fox G, Mallikarjun BR, Zhan F, Weyrich T, Bickel B, Pfister H, Matusik W, Beeler T, Elgharib M, Habermann M, Theobalt C. 2025. 3DPR: Single image 3D portrait relighting with generative priors. Proceedings SIGGRAPH Asia 2025 Conference Papers 2025. SA: SIGGRAPH Asia, 108.","ama":"Rao P, Meka A, Zhou X, et al. 3DPR: Single image 3D portrait relighting with generative priors. In: <i>Proceedings SIGGRAPH Asia 2025 Conference Papers 2025</i>. Association for Computing Machinery; 2025. doi:<a href=\"https://doi.org/10.1145/3757377.3763962\">10.1145/3757377.3763962</a>","short":"P. Rao, A. Meka, X. Zhou, G. Fox, B.R. Mallikarjun, F. Zhan, T. Weyrich, B. Bickel, H. Pfister, W. Matusik, T. Beeler, M. Elgharib, M. Habermann, C. Theobalt, in:, Proceedings SIGGRAPH Asia 2025 Conference Papers 2025, Association for Computing Machinery, 2025.","ieee":"P. Rao <i>et al.</i>, “3DPR: Single image 3D portrait relighting with generative priors,” in <i>Proceedings SIGGRAPH Asia 2025 Conference Papers 2025</i>, Hong Kong, Hong Kong, 2025."},"scopus_import":"1","_id":"21474","oa_version":"Published Version","type":"conference","acknowledgement":"This work was supported by the ERC Consolidator Grant 4DReply (770784) and Saarbrücken Research Center for Visual Comput- ing, Interaction, and AI. We thank Oleksandr Sotnychenko for helping us with setting up data capture. Finally, we thank Shrisha Bharadwaj for discussions, proofreading and innumerable support.","date_published":"2025-12-14T00:00:00Z","month":"12","language":[{"iso":"eng"}],"date_updated":"2026-03-23T14:45:58Z","department":[{"_id":"BeBi"}],"arxiv":1,"publisher":"Association for Computing Machinery","file_date_updated":"2026-03-23T14:41:07Z","oa":1},{"OA_place":"repository","type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Hartmanns, Arnd","first_name":"Arnd","last_name":"Hartmanns"},{"full_name":"Junges, Sebastian","first_name":"Sebastian","last_name":"Junges"},{"first_name":"Tim","last_name":"Quatmann","full_name":"Quatmann, Tim"},{"id":"02ab0197-cc70-11ed-ab61-918e71f56881","orcid":"0000-0002-0163-2152","full_name":"Weininger, Maximilian","first_name":"Maximilian","last_name":"Weininger"}],"oa_version":"Published Version","_id":"21668","related_material":{"record":[{"relation":"used_for_analysis_in","id":"21661","status":"public"}]},"oa":1,"abstract":[{"text":"This artifact allows to review and reproduce the experiments from the paper *A Revised Practitioner's Guide to MDP Model Checking Algorithms*.\r\nThe package contains all original logfiles and derived data used to generate the plots as in the paper. Furthermore, the artifact contains the model checking tools `Storm` and `mcsta` in the version exercised in the paper, the used Docker container, as well as benchmark instances and execution scripts to reproduce the experiments.\r\n\r\nSee also the artifact of the conference paper: https://zenodo.org/records/7509474","lang":"eng"}],"article_processing_charge":"No","department":[{"_id":"KrCh"}],"publisher":"Zenodo","date_updated":"2026-04-07T09:52:55Z","month":"03","title":"Benchmark data for the revised practitioner's guide to MDP model checking algorithms","date_published":"2025-03-07T00:00:00Z","OA_type":"gold","year":"2025","date_created":"2026-04-07T09:47:22Z","day":"07","status":"public","doi":"10.5281/ZENODO.14500423","citation":{"chicago":"Hartmanns, Arnd, Sebastian Junges, Tim Quatmann, and Maximilian Weininger. “Benchmark Data for the Revised Practitioner’s Guide to MDP Model Checking Algorithms.” Zenodo, 2025. <a href=\"https://doi.org/10.5281/ZENODO.14500423\">https://doi.org/10.5281/ZENODO.14500423</a>.","apa":"Hartmanns, A., Junges, S., Quatmann, T., &#38; Weininger, M. (2025). Benchmark data for the revised practitioner’s guide to MDP model checking algorithms. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.14500423\">https://doi.org/10.5281/ZENODO.14500423</a>","mla":"Hartmanns, Arnd, et al. <i>Benchmark Data for the Revised Practitioner’s Guide to MDP Model Checking Algorithms</i>. Zenodo, 2025, doi:<a href=\"https://doi.org/10.5281/ZENODO.14500423\">10.5281/ZENODO.14500423</a>.","ieee":"A. Hartmanns, S. Junges, T. Quatmann, and M. Weininger, “Benchmark data for the revised practitioner’s guide to MDP model checking algorithms.” Zenodo, 2025.","short":"A. Hartmanns, S. Junges, T. Quatmann, M. Weininger, (2025).","ista":"Hartmanns A, Junges S, Quatmann T, Weininger M. 2025. Benchmark data for the revised practitioner’s guide to MDP model checking algorithms, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.14500423\">10.5281/ZENODO.14500423</a>.","ama":"Hartmanns A, Junges S, Quatmann T, Weininger M. Benchmark data for the revised practitioner’s guide to MDP model checking algorithms. 2025. doi:<a href=\"https://doi.org/10.5281/ZENODO.14500423\">10.5281/ZENODO.14500423</a>"},"ddc":["000"],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/ZENODO.14500423"}]},{"file_date_updated":"2026-05-04T09:41:25Z","oa":1,"date_updated":"2026-05-04T09:42:57Z","department":[{"_id":"MaKw"}],"publisher":"Cambridge University Press","arxiv":1,"date_published":"2025-12-01T00:00:00Z","language":[{"iso":"eng"}],"month":"12","acknowledgement":"We would like to thank the anonymous referee for a number of helpful comments and suggestions. Matthew Kwan was supported by ERC Starting Grant “RANDSTRUCT” No. 101076777. Lisa Sauermann was supported in part by NSF Award DMS-2100157 and a Sloan Research Fellowship, and in part by the DFG Heisenberg Program.","type":"journal_article","intvolume":"       161","oa_version":"Published Version","article_type":"original","scopus_import":"1","_id":"21706","project":[{"grant_number":"101076777","_id":"bd95085b-d553-11ed-ba76-e55d3349be45","name":"Randomness and structure in combinatorics"}],"citation":{"mla":"Kwan, Matthew Alan, and Lisa Sauermann. “Resolution of the Quadratic Littlewood–Offord Problem.” <i>Compositio Mathematica</i>, vol. 161, no. 12, Cambridge University Press, 2025, pp. 3089–139, doi:<a href=\"https://doi.org/10.1112/S0010437X25102789\">10.1112/S0010437X25102789</a>.","chicago":"Kwan, Matthew Alan, and Lisa Sauermann. “Resolution of the Quadratic Littlewood–Offord Problem.” <i>Compositio Mathematica</i>. Cambridge University Press, 2025. <a href=\"https://doi.org/10.1112/S0010437X25102789\">https://doi.org/10.1112/S0010437X25102789</a>.","apa":"Kwan, M. A., &#38; Sauermann, L. (2025). Resolution of the quadratic Littlewood–Offord problem. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/S0010437X25102789\">https://doi.org/10.1112/S0010437X25102789</a>","ama":"Kwan MA, Sauermann L. Resolution of the quadratic Littlewood–Offord problem. <i>Compositio Mathematica</i>. 2025;161(12):3089-3139. doi:<a href=\"https://doi.org/10.1112/S0010437X25102789\">10.1112/S0010437X25102789</a>","ista":"Kwan MA, Sauermann L. 2025. Resolution of the quadratic Littlewood–Offord problem. Compositio Mathematica. 161(12), 3089–3139.","short":"M.A. Kwan, L. Sauermann, Compositio Mathematica 161 (2025) 3089–3139.","ieee":"M. A. Kwan and L. Sauermann, “Resolution of the quadratic Littlewood–Offord problem,” <i>Compositio Mathematica</i>, vol. 161, no. 12. Cambridge University Press, pp. 3089–3139, 2025."},"PlanS_conform":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"OA_type":"hybrid","status":"public","day":"01","publication_status":"published","external_id":{"arxiv":["2312.13826"]},"abstract":[{"lang":"eng","text":"Consider a quadratic polynomial Q(ξ1, . . . , ξn) of independent Rademacher random variables ξ1, . . . , ξn. To what extent can Q(ξ1, . . . , ξn) concentrate on a single value? This quadratic version of the classical Littlewood–Offord problem was popularised by Costello, Tao and Vu in their study of symmetric random matrices. In this paper, we obtain an essentially optimal bound for this problem, as conjectured by Nguyen and Vu. Specifically, if Q(ξ1, . . . , ξn) ‘robustly depends on at least m of the ξi’ in the sense that there is no way to pin down the value of Q(ξ1, . . . , ξn) by fixing values for fewer than m of the variables ξi, then we have Pr[Q(ξ1, . . . , ξn) = 0] ≤ O(1/√m). This also implies a similar result in the case where ξ1, . . . , ξn have arbitrary distributions. Our proof combines a number of ideas that may be of independent interest, including an inductive decoupling scheme that reduces quadratic anticoncentration problems\r\nto high-dimensional linear anticoncentration problems. Also, one application of our main result is the resolution of a conjecture of Alon, Hefetz, Krivelevich and Tyomkyn related to graph inducibility. "}],"license":"https://creativecommons.org/licenses/by/4.0/","article_processing_charge":"Yes (via OA deal)","page":"3089-3139","title":"Resolution of the quadratic Littlewood–Offord problem","volume":161,"OA_place":"publisher","author":[{"full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","last_name":"Kwan","first_name":"Matthew Alan"},{"first_name":"Lisa","last_name":"Sauermann","full_name":"Sauermann, Lisa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","file":[{"creator":"dernst","success":1,"date_created":"2026-05-04T09:41:25Z","file_name":"2025_CompositioMath_Kwan.pdf","content_type":"application/pdf","relation":"main_file","checksum":"bd3415bb435da9d0b39f6f9a18c61abb","access_level":"open_access","file_size":858727,"date_updated":"2026-05-04T09:41:25Z","file_id":"21787"}],"corr_author":"1","ddc":["510"],"has_accepted_license":"1","date_created":"2026-04-12T22:01:48Z","year":"2025","publication":"Compositio Mathematica","doi":"10.1112/S0010437X25102789","publication_identifier":{"issn":["0010-437X"],"eissn":["1570-5846"]},"issue":"12"},{"publication_identifier":{"issn":["0004-637X"],"eissn":["1538-4357"]},"doi":"10.3847/1538-4357/ae1ca7","issue":"1","publication":"The Astrophysical Journal","date_created":"2026-04-12T22:01:52Z","year":"2025","article_number":"36","has_accepted_license":"1","ddc":["520"],"file":[{"creator":"dernst","success":1,"date_created":"2026-04-13T08:20:16Z","file_name":"2025_AstrophysicalJournal_Lee.pdf","content_type":"application/pdf","relation":"main_file","checksum":"0d8fa05617420230eac39944b36839e9","access_level":"open_access","file_size":4122087,"date_updated":"2026-04-13T08:20:16Z","file_id":"21732"}],"quality_controlled":"1","author":[{"full_name":"Lee, Max E.","last_name":"Lee","first_name":"Max E."},{"last_name":"Haiman","first_name":"Zoltán","orcid":"0000-0003-3633-5403","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán"},{"full_name":"Pandey, Shivam","first_name":"Shivam","last_name":"Pandey"},{"last_name":"Genel","first_name":"Shy","full_name":"Genel, Shy"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":996,"OA_place":"publisher","title":"The effect of intrinsic alignments on weak-lensing statistics in hydrodynamical simulations","article_processing_charge":"Yes","publication_status":"published","external_id":{"arxiv":["2504.12460"]},"abstract":[{"lang":"eng","text":"The next generation of weak-gravitational-lensing surveys has the potential to place stringent constraints on cosmological parameters. However, their analysis is limited by systematics such as the intrinsic alignments of galaxies, which alter weak-lensing convergence and can lead to biases in cosmological parameter estimations. For the first time, in this work, we investigate the impact of intrinsic alignments on non-Gaussian statistics of the weak-lensing field using galaxy shapes derived from the IllustrisTNG hydrodynamical simulation. We create two catalogs of ray-traced convergence maps: one that includes the measured intrinsic shape of each galaxy and another where all galaxies are randomly rotated to eliminate intrinsic alignments. We compare a range of weak-lensing statistics between the two catalogs, including the shear–shear correlation function, the map-level angular power spectrum, one-point, peak count, and minimum distribution functions, and Minkowski functionals. For each statistic, we assess the level of statistical distinguishability between catalogs for a set of future survey angular areas. Our results reveal strong small-scale correlation in the alignment of galaxies and statistically significant boosts in weak-lensing convergence in both positive and negative directions for high-significance peaks and minima, respectively. We note that our analysis is at a fixed number density of  ˜ 5 arcmin^-2, drawn from a single realization of initial conditions, and does not include observational uncertainties or supersample covariance contributions. Weak-lensing analyses utilizing non-Gaussian statistics must account for intrinsic alignments to avoid significantly compromised cosmological inferences."}],"day":"23","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"OA_type":"gold","citation":{"ama":"Lee ME, Haiman Z, Pandey S, Genel S. The effect of intrinsic alignments on weak-lensing statistics in hydrodynamical simulations. <i>The Astrophysical Journal</i>. 2025;996(1). doi:<a href=\"https://doi.org/10.3847/1538-4357/ae1ca7\">10.3847/1538-4357/ae1ca7</a>","ista":"Lee ME, Haiman Z, Pandey S, Genel S. 2025. The effect of intrinsic alignments on weak-lensing statistics in hydrodynamical simulations. The Astrophysical Journal. 996(1), 36.","short":"M.E. Lee, Z. Haiman, S. Pandey, S. Genel, The Astrophysical Journal 996 (2025).","ieee":"M. E. Lee, Z. Haiman, S. Pandey, and S. Genel, “The effect of intrinsic alignments on weak-lensing statistics in hydrodynamical simulations,” <i>The Astrophysical Journal</i>, vol. 996, no. 1. IOP Publishing, 2025.","mla":"Lee, Max E., et al. “The Effect of Intrinsic Alignments on Weak-Lensing Statistics in Hydrodynamical Simulations.” <i>The Astrophysical Journal</i>, vol. 996, no. 1, 36, IOP Publishing, 2025, doi:<a href=\"https://doi.org/10.3847/1538-4357/ae1ca7\">10.3847/1538-4357/ae1ca7</a>.","apa":"Lee, M. E., Haiman, Z., Pandey, S., &#38; Genel, S. (2025). The effect of intrinsic alignments on weak-lensing statistics in hydrodynamical simulations. <i>The Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4357/ae1ca7\">https://doi.org/10.3847/1538-4357/ae1ca7</a>","chicago":"Lee, Max E., Zoltán Haiman, Shivam Pandey, and Shy Genel. “The Effect of Intrinsic Alignments on Weak-Lensing Statistics in Hydrodynamical Simulations.” <i>The Astrophysical Journal</i>. IOP Publishing, 2025. <a href=\"https://doi.org/10.3847/1538-4357/ae1ca7\">https://doi.org/10.3847/1538-4357/ae1ca7</a>."},"PlanS_conform":"1","scopus_import":"1","_id":"21724","oa_version":"Published Version","intvolume":"       996","article_type":"original","type":"journal_article","acknowledgement":"We thank Fulvio Ferlito, Ana Maria Delgado, and Ken Osato for helpful conversations during this work. M.E.L. is supported by NSF grant DGE-2036197. Z.H. acknowledges financial support from NASA ATP grant 80NSSC24K1093. The Flatiron Institute is supported by the Simons Foundation.","date_published":"2025-12-23T00:00:00Z","language":[{"iso":"eng"}],"month":"12","date_updated":"2026-04-13T08:30:52Z","publisher":"IOP Publishing","arxiv":1,"department":[{"_id":"ZoHa"}],"DOAJ_listed":"1","file_date_updated":"2026-04-13T08:20:16Z","oa":1},{"DOAJ_listed":"1","file_date_updated":"2026-04-13T07:53:00Z","oa":1,"date_published":"2025-11-20T00:00:00Z","month":"11","language":[{"iso":"eng"}],"date_updated":"2026-04-13T07:54:11Z","publisher":"IOP Publishing","department":[{"_id":"JoMa"}],"oa_version":"Published Version","intvolume":"       994","article_type":"original","type":"journal_article","acknowledgement":"The authors are deeply grateful to Antonello Calabrò for valuable insights on CLOUDY and pyCloudy, and for publicly sharing their SFG and AGN models, which were used as a reference to verify the consistency of our photoionization models. The authors also thank Adam Carnall for insightful input on bagpipes and for assistance with the implementation of the two-population model adopted in this work. Finally, they also thank Camilla Pacifici, Vasily Kokorev, and Cristian Vignali for their insightful discussions.\r\n\r\nThis work is based on observations made with the NASA/ESA/CSA JWST. The data were obtained from the Mikulski Archive for Space Telescopes (MAST) 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 JWST programs GTO #1180, GO #1210, GTO#1283, GO #1963, GO #1895, GO# 3215, and GO#6511.\r\n\r\nThe authors acknowledge the FRESCO, JEMS, and #3215 teams led by co-PIs P. Oesch, C. C. Williams, M. Maseda, D. Eisenstein, and R. Maiolino for developing their observing program with a zero-exclusive-access period. Processing for the JADES NIRCam data release was performed on the lux cluster at the University of California, Santa Cruz, funded by NSF MRI grant AST 1828315. Also based on observations made with the NASA/ESA Hubble Space Telescope obtained from the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 526555. The data presented in this article were obtained from MAST at the Space Telescope Science Institute. The specific observations analyzed can be accessed via doi: 10.17909/1rq3-8048 P. Oesch & D. Magee (2023), C. Williams et al. (2023), G. Illingworth (2015), and M. Rieke et al. (2023).\r\n\r\nA.J.B. acknowledges funding from the “FirstGalaxies” Advanced Grant from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement No. 789056).\r\n\r\nP.G.P.-G. acknowledges support from grant PID2022-139567NB-I00 funded by the Spanish Ministerio de Ciencia e Innovación MCIN/AEI/10.13039/501100011033, FEDER, UE.\r\n\r\nB.E.R. acknowledges support from the NIRCam Science Team contract to the University of Arizona, NAS5-02015, and JWST Program 3215.\r\n\r\nS.T. acknowledges support by the Royal Society Research Grant G125142.\r\n\r\nThe research of C.C.W. is supported by NOIRLab, which is managed by the Association of Universities for Research in Astronomy (AURA) under a cooperative agreement with the National Science Foundation.\r\n\r\nJ.W. gratefully acknowledges support from the Cosmic Dawn Center through the DAWN Fellowship. The Cosmic Dawn Center (DAWN) is funded by the Danish National Research Foundation under grant No. 140.\r\n\r\nY.Z., Z.J., and P.L. gratefully acknowledge the JWST/NIRCam contract to the University of Arizona NAS5-02015.\r\n\r\nThe work of G.H.R. and P.L. was also supported by grant 80NSSC18K0555, from the NASA Goddard Space Flight Center to the University of Arizona.\r\n\r\nH.Ü. acknowledges funding by the European Union (ERC APEX, 101164796). Views and opinions expressed are however those of the authors only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them.\r\n\r\nG.C.J. acknowledges support by the Science and Technology Facilities Council (STFC), ERC Advanced grant 695671 “QUENCH.”\r\n\r\nA.C.G. acknowledges support by JWST contract B0215/JWST-GO-02926.\r\n\r\nG.O. acknowledges support from the Swedish National Space Agency (SNSA).\r\n\r\nH.I. acknowledges support from JSPS KAKENHI grant No. JP21H01129.\r\n\r\nM.A. gratefully acknowledges support from ANID Basal Project FB210003 and ANID MILENIO NCN2024_112.\r\n\r\nT.D.S. acknowledges the research project was supported by the Hellenic Foundation for Research and Innovation (HFRI) under the “2nd Call for HFRI Research Projects to Support Faculty Members and Researchers” (project No.: 03382).\r\n\r\nR.M. acknowledges support by the Science and Technology Facilities Council (STFC), by the ERC through Advanced grant 695671 “QUENCH,” and by the UKRI Frontier Research grant RISEandFALL. R.M. also acknowledges funding from a research professorship from the Royal Society.\r\n\r\nI.S. acknowledges funding from the Atraccíon de Talento grant No. 2022-T1/TIC-20472 of the Comunidad de Madrid, Spain, and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant No. 101117541, DistantDust).\r\n\r\nK.I.C. acknowledges funding from the Dutch Research Council (NWO) through the award of the Vici grant VI.C.212.036.\r\n\r\nFacilities: HST - Hubble Space Telescope satellite, JWST. -\r\n\r\nSoftware: Astropy (Astropy Collaboration et al. 2022), Bagpipes (A. C. Carnall et al. 2019), MSAEXP (G. Brammer 2023) NumPy (C. R. Harris et al. 2020), pandas (The pandas development team 2024) Photutils (L. Bradley et al. 2016), TOPCAT (M. Taylor 2022).","scopus_import":"1","_id":"21727","citation":{"ama":"Rinaldi P, Pérez-González PG, Rieke GH, et al. Deciphering the nature of Virgil: An obscured active galactic nucleus lurking within an apparently normal Lyα emitter during cosmic reionization. <i>The Astrophysical Journal</i>. 2025;994(1). doi:<a href=\"https://doi.org/10.3847/1538-4357/ae089c\">10.3847/1538-4357/ae089c</a>","ista":"Rinaldi P, Pérez-González PG, Rieke GH, Lyu J, D’Eugenio F, Wu Z, Carniani S, Looser TJ, Shivaei I, Boogaard LA, Diaz-Santos T, Colina L, Östlin G, Alberts S, Álvarez-Márquez J, Annuziatella M, Aravena M, Bhatawdekar R, Bunker AJ, Caputi KI, Charlot S, Crespo Gómez A, Curti M, Eckart A, Gillman S, Hainline K, Kumari N, Hjorth J, Iani E, Inami H, Ji Z, Johnson BD, Jones GC, Labiano Á, Maiolino R, Melinder J, Moutard T, Peissker F, Rieke M, Robertson B, Scholtz J, Tacchella S, Van Der Werf PP, Walter F, Williams CC, Willott C, Witstok J, Übler H, Zhu Y. 2025. Deciphering the nature of Virgil: An obscured active galactic nucleus lurking within an apparently normal Lyα emitter during cosmic reionization. The Astrophysical Journal. 994(1), 86.","ieee":"P. Rinaldi <i>et al.</i>, “Deciphering the nature of Virgil: An obscured active galactic nucleus lurking within an apparently normal Lyα emitter during cosmic reionization,” <i>The Astrophysical Journal</i>, vol. 994, no. 1. IOP Publishing, 2025.","short":"P. Rinaldi, P.G. Pérez-González, G.H. Rieke, J. Lyu, F. D’Eugenio, Z. Wu, S. Carniani, T.J. Looser, I. Shivaei, L.A. Boogaard, T. Diaz-Santos, L. Colina, G. Östlin, S. Alberts, J. Álvarez-Márquez, M. Annuziatella, M. Aravena, R. Bhatawdekar, A.J. Bunker, K.I. Caputi, S. Charlot, A. Crespo Gómez, M. Curti, A. Eckart, S. Gillman, K. Hainline, N. Kumari, J. Hjorth, E. Iani, H. Inami, Z. Ji, B.D. Johnson, G.C. Jones, Á. Labiano, R. Maiolino, J. Melinder, T. Moutard, F. Peissker, M. Rieke, B. Robertson, J. Scholtz, S. Tacchella, P.P. Van Der Werf, F. Walter, C.C. Williams, C. Willott, J. Witstok, H. Übler, Y. Zhu, The Astrophysical Journal 994 (2025).","mla":"Rinaldi, Pierluigi, et al. “Deciphering the Nature of Virgil: An Obscured Active Galactic Nucleus Lurking within an Apparently Normal Lyα Emitter during Cosmic Reionization.” <i>The Astrophysical Journal</i>, vol. 994, no. 1, 86, IOP Publishing, 2025, doi:<a href=\"https://doi.org/10.3847/1538-4357/ae089c\">10.3847/1538-4357/ae089c</a>.","chicago":"Rinaldi, Pierluigi, Pablo G. Pérez-González, George H. Rieke, Jianwei Lyu, Francesco D’Eugenio, Zihao Wu, Stefano Carniani, et al. “Deciphering the Nature of Virgil: An Obscured Active Galactic Nucleus Lurking within an Apparently Normal Lyα Emitter during Cosmic Reionization.” <i>The Astrophysical Journal</i>. IOP Publishing, 2025. <a href=\"https://doi.org/10.3847/1538-4357/ae089c\">https://doi.org/10.3847/1538-4357/ae089c</a>.","apa":"Rinaldi, P., Pérez-González, P. G., Rieke, G. H., Lyu, J., D’Eugenio, F., Wu, Z., … Zhu, Y. (2025). Deciphering the nature of Virgil: An obscured active galactic nucleus lurking within an apparently normal Lyα emitter during cosmic reionization. <i>The Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4357/ae089c\">https://doi.org/10.3847/1538-4357/ae089c</a>"},"PlanS_conform":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"OA_type":"gold","status":"public","day":"20","article_processing_charge":"Yes","publication_status":"published","abstract":[{"text":"We present a comprehensive analysis of the MIRI Extremely Red Object Virgil, a Lyα emitter at zspec = 6.6379 ± 0.0035 with the photometric properties of a Little Red Dot. Leveraging new JWST/MIRI imaging from the MIDIS and PAHSPECS programs, we confirm Virgil’s extraordinary nature among galaxies in JADES/GOODS-South, exhibiting a strikingly red NIRCam-to-MIRI color (F444W–F1500W = 2.84 ± 0.04 mag). Deep NIRSpec/PRISM spectroscopy from the OASIS program offers key insights into the host galaxy, revealing properties of an average star-forming galaxy during Cosmic Reionization, such as a subsolar metallicity, low-to-moderate dust content, and a relatively high ionization parameter and electron temperature. By estimating the star formation rate of Virgil from UV and Hα, we find evidence that the galaxy is either entering or fading out of a bursty episode. Although line-ratio diagnostics employed at high z would classify Virgil as an active galactic nucleus (AGN), this classification becomes ambiguous once redshift evolution is considered. Nonetheless, Virgil occupies the same parameter space as recently confirmed AGNs at similar redshifts. The new deep MIRI data at 15 μm reinforce the AGN nature of Virgil, as inferred from multiple spectral energy distribution (SED) fitting codes. Virgil’s rising infrared SED and UV excess resemble those of Dust-Obscured Galaxies (DOGs) studied with Spitzer at Cosmic Noon, particularly blue-excess HotDOGs. Our results highlight the need for a multiwavelength approach incorporating MIRI to uncover such extreme sources at z ≳ 6 and to shed light on the interplay between galaxy evolution and early black hole growth during Cosmic Reionization.","lang":"eng"}],"title":"Deciphering the nature of Virgil: An obscured active galactic nucleus lurking within an apparently normal Lyα emitter during cosmic reionization","author":[{"full_name":"Rinaldi, Pierluigi","first_name":"Pierluigi","last_name":"Rinaldi"},{"last_name":"Pérez-González","first_name":"Pablo G.","full_name":"Pérez-González, Pablo G."},{"last_name":"Rieke","first_name":"George H.","full_name":"Rieke, George H."},{"full_name":"Lyu, Jianwei","last_name":"Lyu","first_name":"Jianwei"},{"full_name":"D’Eugenio, Francesco","first_name":"Francesco","last_name":"D’Eugenio"},{"full_name":"Wu, Zihao","last_name":"Wu","first_name":"Zihao"},{"full_name":"Carniani, Stefano","first_name":"Stefano","last_name":"Carniani"},{"full_name":"Looser, Tobias J.","last_name":"Looser","first_name":"Tobias J."},{"full_name":"Shivaei, Irene","first_name":"Irene","last_name":"Shivaei"},{"full_name":"Boogaard, Leindert A.","last_name":"Boogaard","first_name":"Leindert A."},{"full_name":"Diaz-Santos, Tanio","first_name":"Tanio","last_name":"Diaz-Santos"},{"full_name":"Colina, Luis","first_name":"Luis","last_name":"Colina"},{"first_name":"Göran","last_name":"Östlin","full_name":"Östlin, Göran"},{"first_name":"Stacey","last_name":"Alberts","full_name":"Alberts, Stacey"},{"last_name":"Álvarez-Márquez","first_name":"Javier","full_name":"Álvarez-Márquez, Javier"},{"full_name":"Annuziatella, Marianna","first_name":"Marianna","last_name":"Annuziatella"},{"full_name":"Aravena, Manuel","first_name":"Manuel","last_name":"Aravena"},{"full_name":"Bhatawdekar, Rachana","last_name":"Bhatawdekar","first_name":"Rachana"},{"full_name":"Bunker, Andrew J.","first_name":"Andrew J.","last_name":"Bunker"},{"full_name":"Caputi, Karina I.","last_name":"Caputi","first_name":"Karina I."},{"full_name":"Charlot, Stéphane","last_name":"Charlot","first_name":"Stéphane"},{"full_name":"Crespo Gómez, Alejandro","last_name":"Crespo Gómez","first_name":"Alejandro"},{"full_name":"Curti, Mirko","first_name":"Mirko","last_name":"Curti"},{"last_name":"Eckart","first_name":"Andreas","full_name":"Eckart, Andreas"},{"first_name":"Steven","last_name":"Gillman","full_name":"Gillman, Steven"},{"full_name":"Hainline, Kevin","first_name":"Kevin","last_name":"Hainline"},{"last_name":"Kumari","first_name":"Nimisha","full_name":"Kumari, Nimisha"},{"full_name":"Hjorth, Jens","first_name":"Jens","last_name":"Hjorth"},{"full_name":"Iani, Edoardo","id":"4053390a-6b68-11ef-9828-a3b8adef8d0a","orcid":"0000-0001-8386-3546","last_name":"Iani","first_name":"Edoardo"},{"full_name":"Inami, Hanae","first_name":"Hanae","last_name":"Inami"},{"full_name":"Ji, Zhiyuan","first_name":"Zhiyuan","last_name":"Ji"},{"last_name":"Johnson","first_name":"Benjamin D.","full_name":"Johnson, Benjamin D."},{"last_name":"Jones","first_name":"Gareth C.","full_name":"Jones, Gareth C."},{"last_name":"Labiano","first_name":"Álvaro","full_name":"Labiano, Álvaro"},{"full_name":"Maiolino, Roberto","first_name":"Roberto","last_name":"Maiolino"},{"last_name":"Melinder","first_name":"Jens","full_name":"Melinder, Jens"},{"full_name":"Moutard, Thibaud","first_name":"Thibaud","last_name":"Moutard"},{"full_name":"Peissker, Florian","first_name":"Florian","last_name":"Peissker"},{"first_name":"Marcia","last_name":"Rieke","full_name":"Rieke, Marcia"},{"first_name":"Brant","last_name":"Robertson","full_name":"Robertson, Brant"},{"full_name":"Scholtz, Jan","first_name":"Jan","last_name":"Scholtz"},{"last_name":"Tacchella","first_name":"Sandro","full_name":"Tacchella, Sandro"},{"first_name":"Paul P.","last_name":"Van Der Werf","full_name":"Van Der Werf, Paul P."},{"full_name":"Walter, Fabian","last_name":"Walter","first_name":"Fabian"},{"full_name":"Williams, Christina C.","last_name":"Williams","first_name":"Christina C."},{"full_name":"Willott, Chris","last_name":"Willott","first_name":"Chris"},{"first_name":"Joris","last_name":"Witstok","full_name":"Witstok, Joris"},{"last_name":"Übler","first_name":"Hannah","full_name":"Übler, Hannah"},{"full_name":"Zhu, Yongda","last_name":"Zhu","first_name":"Yongda"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":994,"OA_place":"publisher","file":[{"file_name":"2025_AstrophysicalJournal_Rinaldi.pdf","content_type":"application/pdf","date_created":"2026-04-13T07:53:00Z","success":1,"creator":"dernst","file_id":"21731","file_size":10298729,"date_updated":"2026-04-13T07:53:00Z","access_level":"open_access","relation":"main_file","checksum":"5d13b0ad3e9f56cbe29c5de0ba5757c8"}],"quality_controlled":"1","has_accepted_license":"1","ddc":["520"],"date_created":"2026-04-12T22:01:53Z","year":"2025","article_number":"86","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"doi":"10.3847/1538-4357/ae089c","issue":"1","publication":"The Astrophysical Journal"},{"OA_type":"closed access","date_created":"2026-05-17T22:02:11Z","year":"2025","status":"public","day":"01","publication":"Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","doi":"10.1109/SYNASC69064.2025.00008","publication_identifier":{"eissn":["2470-881X"],"eisbn":["9798331590116"]},"quality_controlled":"1","citation":{"mla":"Henzinger, Thomas A. “Neural Certificates.” <i>Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.1109/SYNASC69064.2025.00008\">10.1109/SYNASC69064.2025.00008</a>.","chicago":"Henzinger, Thomas A. “Neural Certificates.” In <i>Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing</i>. IEEE, 2025. <a href=\"https://doi.org/10.1109/SYNASC69064.2025.00008\">https://doi.org/10.1109/SYNASC69064.2025.00008</a>.","apa":"Henzinger, T. A. (2025). Neural Certificates. In <i>Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing</i>. Timisoara, Romania: IEEE. <a href=\"https://doi.org/10.1109/SYNASC69064.2025.00008\">https://doi.org/10.1109/SYNASC69064.2025.00008</a>","ista":"Henzinger TA. 2025. Neural Certificates. Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. SYNASC: Symposium on Symbolic and Numeric Algorithms for Scientific Computing.","ama":"Henzinger TA. Neural Certificates. In: <i>Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.1109/SYNASC69064.2025.00008\">10.1109/SYNASC69064.2025.00008</a>","ieee":"T. A. Henzinger, “Neural Certificates,” in <i>Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing</i>, Timisoara, Romania, 2025.","short":"T.A. Henzinger, in:, Proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, IEEE, 2025."},"corr_author":"1","conference":{"start_date":"2025-09-22","name":"SYNASC: Symposium on Symbolic and Numeric Algorithms for Scientific Computing","end_date":"2025-09-25","location":"Timisoara, Romania"},"type":"conference","author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","_id":"21885","publication_status":"published","abstract":[{"lang":"eng","text":"Symbolic datatypes have proved to be central for automated reasoning about dynamical systems. In its basic form, a symbolic datatype for a class of dynamical systems supports the representation of state and transition sets, boolean operations and emptiness checks on such sets, and the transformation of a state set by a transition set. Successful examples of symbolic datatypes include BDDs and SAT for reasoning about finitestate systems, as well as polyhedra and SMT for reasoning about discrete dynamical systems over multidimensional realvalued state spaces. Most automated verification engines are based on such symbolic datatypes."}],"article_processing_charge":"No","date_updated":"2026-05-18T08:34:15Z","publisher":"IEEE","department":[{"_id":"ToHe"}],"date_published":"2025-10-01T00:00:00Z","title":"Neural Certificates","language":[{"iso":"eng"}],"month":"10"},{"oa_version":"Preprint","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Ignatyev, Yuri","last_name":"Ignatyev","first_name":"Yuri"},{"id":"40606b92-f128-11eb-9611-bf66a98cfa5c","full_name":"Papadopoulos, Stavros","first_name":"Stavros","last_name":"Papadopoulos"},{"full_name":"Soretić, Mateja","first_name":"Mateja","last_name":"Soretić"},{"first_name":"Jake","last_name":"Yeung","orcid":"0000-0003-1732-1559","id":"123012b2-db30-11eb-b4d8-a35840c0551b","full_name":"Yeung, Jake"},{"last_name":"Lin","first_name":"Tzi-Yang","full_name":"Lin, Tzi-Yang"},{"full_name":"Tanaka, Elly M","first_name":"Elly M","last_name":"Tanaka"},{"last_name":"Peshkin","first_name":"Leonid","full_name":"Peshkin, Leonid"},{"first_name":"Ariel J","last_name":"Levine","full_name":"Levine, Ariel J"},{"last_name":"Gabitto","first_name":"Mariano I","full_name":"Gabitto, Mariano I"},{"first_name":"Lora Beatrice Jaeger","last_name":"Sweeney","orcid":"0000-0001-9242-5601","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","full_name":"Sweeney, Lora Beatrice Jaeger"}],"acknowledgement":"We would like to thank the members of the Sweeney Lab for discussion and support; Andrey\r\nBydanov for technical assistance with single-cell sequencing processing; and Jay Bikoff,\r\nNikos Konstantinides, Maria Tosches, and Graziana Gatto for comments on the manuscript. \r\nThis research was supported by: Horizon Europe ERC Starting Grant 101041551 (L.B.S,\r\nY.I., S.P.); Special Research Program (SFB) of the Austrian Science Fund (FWF) F7814-B\r\n(L.B.S., S.P., E.M.T); Austrian Science Fund (FWF) 10.55776/COE16 (L.B.S., Y.I., E.M.T.);\r\nAustrian Academy of Sciences DOC Fellowship 27229 (S.P.); ERC Advanced Grant 742046\r\n(E.M.T.); NIH award R24 OD031956 (L.P.); and in part by the Intramural Research\r\nProgram of the National Institutes of Health (NIH) through 1ZIA NS003153 to A.J.L.\r\nThe contributions of the NIH author are considered Works of the United States\r\nGovernment. The findings and conclusions presented in this paper are those of\r\nthe authors and do not necessarily reflect the views of the NIH or the U.S. Department\r\nof Health and Human Services. ","OA_place":"repository","type":"preprint","_id":"21920","article_processing_charge":"No","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":[{"text":"Vertebrates display remarkable diversity of sensorimotor behaviors, each adapted to distinct ecological and survival demands. This diversity raises fundamental questions about the evolutionary origin of motor control: do conserved spinal circuits underlie these behaviors, and how have they diverged across species. Recent studies detail spinal cell-type architecture in mammals but comparable, high-resolution atlases of the non-mammalian spinal cord are lacking. Here, we compare spinal cord cell types between fish, frogs, mice and humans, spanning ∼450 million years of evolution. Across species, we define highly conserved programs of cell type specification that segregate spinal neurons into nearly identical cardinal classes during development. This contrasts with adult stages, when spinal cell-type composition selectively diverges for excitatory neuron subpopulations. Using spatial transcriptomics, we localize this species divergence to the superficial, dorsal spinal cord, where variant neuropeptide expression defines mammalian-specific cell types. The most dorsal spinal cord thus emerges as a recently evolved hub for sensory integration in mammals, a neospinal cord analogous to the neocortex.</jats:p>","lang":"eng"}],"oa":1,"publication_status":"submitted","month":"10","language":[{"iso":"eng"}],"title":"Innovations in spinal cord cell type heterogeneity across vertebrate evolution","date_published":"2025-10-11T00:00:00Z","department":[{"_id":"LoSw"},{"_id":"ScienComp"}],"date_updated":"2026-05-27T07:25:41Z","year":"2025","date_created":"2026-05-27T06:54:04Z","OA_type":"green","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"doi":"10.1101/2025.10.09.680955","status":"public","day":"11","publication":"bioRxiv","corr_author":"1","citation":{"mla":"Ignatyev, Yuri, et al. “Innovations in Spinal Cord Cell Type Heterogeneity across Vertebrate Evolution.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2025.10.09.680955\">10.1101/2025.10.09.680955</a>.","apa":"Ignatyev, Y., Papadopoulos, S., Soretić, M., Yeung, J., Lin, T.-Y., Tanaka, E. M., … Sweeney, L. B. (n.d.). Innovations in spinal cord cell type heterogeneity across vertebrate evolution. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2025.10.09.680955\">https://doi.org/10.1101/2025.10.09.680955</a>","chicago":"Ignatyev, Yuri, Stavros Papadopoulos, Mateja Soretić, Jake Yeung, Tzi-Yang Lin, Elly M Tanaka, Leonid Peshkin, Ariel J Levine, Mariano I Gabitto, and Lora B. Sweeney. “Innovations in Spinal Cord Cell Type Heterogeneity across Vertebrate Evolution.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2025.10.09.680955\">https://doi.org/10.1101/2025.10.09.680955</a>.","ama":"Ignatyev Y, Papadopoulos S, Soretić M, et al. Innovations in spinal cord cell type heterogeneity across vertebrate evolution. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2025.10.09.680955\">10.1101/2025.10.09.680955</a>","ista":"Ignatyev Y, Papadopoulos S, Soretić M, Yeung J, Lin T-Y, Tanaka EM, Peshkin L, Levine AJ, Gabitto MI, Sweeney LB. Innovations in spinal cord cell type heterogeneity across vertebrate evolution. bioRxiv, <a href=\"https://doi.org/10.1101/2025.10.09.680955\">10.1101/2025.10.09.680955</a>.","short":"Y. Ignatyev, S. Papadopoulos, M. Soretić, J. Yeung, T.-Y. Lin, E.M. Tanaka, L. Peshkin, A.J. Levine, M.I. Gabitto, L.B. Sweeney, BioRxiv (n.d.).","ieee":"Y. Ignatyev <i>et al.</i>, “Innovations in spinal cord cell type heterogeneity across vertebrate evolution,” <i>bioRxiv</i>. ."},"project":[{"_id":"ebb66355-77a9-11ec-83b8-b8ac210a4dae","grant_number":"101041551","name":"Development and Evolution of Tetrapod Motor Circuits"},{"_id":"907b765e-16d5-11f0-9cad-fef108a945b1","grant_number":"27229","name":"A Tale of Two Circuits: Rostrocaudal spinal cord patterning during the swim-to-limb transition of Xenopus metamorphosis"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2025.10.09.680955"}]},{"ddc":["570"],"has_accepted_license":"1","file":[{"date_created":"2025-04-03T11:19:26Z","content_type":"application/pdf","file_name":"2025_eLife_Bose.pdf","creator":"dernst","success":1,"file_id":"19467","relation":"main_file","checksum":"64a6a6f86e24b21fe72c7a7fd6056fed","access_level":"open_access","file_size":17462771,"date_updated":"2025-04-03T11:19:26Z"}],"quality_controlled":"1","publication":"eLife","doi":"10.7554/elife.101851.3","publication_identifier":{"eissn":["2050-084X"]},"article_number":"101851","year":"2025","date_created":"2023-12-06T13:07:01Z","title":"Dual role of FOXG1 in regulating gliogenesis in the developing neocortex via the FGF signalling pathway","abstract":[{"text":"In the developing vertebrate central nervous system, neurons and glia typically arise\r\nsequentially from common progenitors. Here, we report that the transcription factor Forkhead\r\nBox G1 (Foxg1) regulates gliogenesis in the mouse neocortex via distinct cell-autonomous roles in progenitors and postmitotic neurons that regulate different aspects of the gliogenic FGF signalling pathway. We demonstrate that loss of Foxg1 in cortical progenitors at neurogenic stages causes premature astrogliogenesis. We identify a novel FOXG1 target, the pro-gliogenic FGF pathway component Fgfr3, which is suppressed by FOXG1 cell-autonomously to maintain neurogenesis. Furthermore, FOXG1 can also suppress premature astrogliogenesis triggered by the augmentation of FGF signalling. We identify a second novel function of FOXG1 in regulating the expression of gliogenic cues in newborn neocortical upper-layer neurons. Loss of FOXG1 in postmitotic neurons non-autonomously enhances gliogenesis in the progenitors via FGF signalling. These results fit well with the model that newborn neurons secrete cues that trigger progenitors to produce the next wave of cell types, astrocytes. If FGF signalling is attenuated in Foxg1 null progenitors, they progress to oligodendrocyte production. Therefore, loss of FOXG1 transitions the progenitor to a gliogenic state, producing either astrocytes or oligodendrocytes depending on FGF signalling levels. Our results uncover how FOXG1 integrates extrinsic signalling via the FGF pathway to regulate the sequential generation of neurons, astrocytes, and oligodendrocytes in the cerebral cortex. ","lang":"eng"}],"external_id":{"pmid":["40085500"]},"publication_status":"published","article_processing_charge":"Yes","pmid":1,"OA_place":"publisher","volume":13,"author":[{"full_name":"Bose, Mahima","first_name":"Mahima","last_name":"Bose"},{"first_name":"Varun","last_name":"Suresh","full_name":"Suresh, Varun"},{"full_name":"Mishra, Urvi","last_name":"Mishra","first_name":"Urvi"},{"first_name":"Ishita","last_name":"Talwar","full_name":"Talwar, Ishita"},{"full_name":"Yadav, Anuradha","first_name":"Anuradha","last_name":"Yadav"},{"first_name":"Shiona","last_name":"Biswas","full_name":"Biswas, Shiona"},{"full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","first_name":"Simon","last_name":"Hippenmeyer"},{"full_name":"Tole, Shubha","first_name":"Shubha","last_name":"Tole"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Bose, Mahima, Varun Suresh, Urvi Mishra, Ishita Talwar, Anuradha Yadav, Shiona Biswas, Simon Hippenmeyer, and Shubha Tole. “Dual Role of FOXG1 in Regulating Gliogenesis in the Developing Neocortex via the FGF Signalling Pathway.” <i>ELife</i>. eLife Sciences Publications, 2025. <a href=\"https://doi.org/10.7554/elife.101851.3\">https://doi.org/10.7554/elife.101851.3</a>.","apa":"Bose, M., Suresh, V., Mishra, U., Talwar, I., Yadav, A., Biswas, S., … Tole, S. (2025). Dual role of FOXG1 in regulating gliogenesis in the developing neocortex via the FGF signalling pathway. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.101851.3\">https://doi.org/10.7554/elife.101851.3</a>","mla":"Bose, Mahima, et al. “Dual Role of FOXG1 in Regulating Gliogenesis in the Developing Neocortex via the FGF Signalling Pathway.” <i>ELife</i>, vol. 13, 101851, eLife Sciences Publications, 2025, doi:<a href=\"https://doi.org/10.7554/elife.101851.3\">10.7554/elife.101851.3</a>.","ieee":"M. Bose <i>et al.</i>, “Dual role of FOXG1 in regulating gliogenesis in the developing neocortex via the FGF signalling pathway,” <i>eLife</i>, vol. 13. eLife Sciences Publications, 2025.","short":"M. Bose, V. Suresh, U. Mishra, I. Talwar, A. Yadav, S. Biswas, S. Hippenmeyer, S. Tole, ELife 13 (2025).","ama":"Bose M, Suresh V, Mishra U, et al. Dual role of FOXG1 in regulating gliogenesis in the developing neocortex via the FGF signalling pathway. <i>eLife</i>. 2025;13. doi:<a href=\"https://doi.org/10.7554/elife.101851.3\">10.7554/elife.101851.3</a>","ista":"Bose M, Suresh V, Mishra U, Talwar I, Yadav A, Biswas S, Hippenmeyer S, Tole S. 2025. Dual role of FOXG1 in regulating gliogenesis in the developing neocortex via the FGF signalling pathway. eLife. 13, 101851."},"status":"public","day":"14","OA_type":"gold","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"SiHi"}],"publisher":"eLife Sciences Publications","date_updated":"2025-05-14T11:41:52Z","month":"03","language":[{"iso":"eng"}],"date_published":"2025-03-14T00:00:00Z","oa":1,"file_date_updated":"2025-04-03T11:19:26Z","_id":"14647","scopus_import":"1","acknowledgement":"We thank the animal house staff of the Tata Institute of Fundamental Research, Mumbai (TIFR), for their excellent support; Gordon Fishell (Harvard Medical School, USA), and Goichi Miyoshi (Gunma University, Japan) for the Foxg1 floxed mouse line; Hiroshi Kawasaki (Kanazawa University, Japan) for the plasmids pCAG-FGF8 and pCAG-sFgfr3c; Soo Kyung Lee (University at Buffalo, The State University of New York, USA) for the Foxg1lox/lox genotyping primers and protocol. We thank Deepak Modi and Vainav Patel (National Institute for Research in Reproductive and Child Health, NIRRCH, Mumbai, India) for the use of the NIRRCH FACS Facility, and the staff of the NIRRCH and TIFR FACS facilities for their assistance. We thank Denis Jabaudon (University of Geneva, Switzerland) for his critical comments on the manuscript and members of the Jabaudon lab for helpful discussions. This work was funded by the Department of Atomic Energy (DAE), Govt. of India (Project Identification no. RTI4003,\r\nDAE OM no. 1303/2/2019/R&D-II/DAE/2079). ","type":"journal_article","article_type":"original","intvolume":"        13","oa_version":"Published Version"},{"acknowledgement":"The first author thanks Chandra Chekuri for useful discussions about this paper. This work was done in part at the University of Vienna. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","type":"journal_article","article_type":"original","oa_version":"Preprint","intvolume":"       210","_id":"15121","scopus_import":"1","oa":1,"isi":1,"department":[{"_id":"MoHe"}],"publisher":"Springer Nature","arxiv":1,"date_updated":"2025-09-09T12:39:58Z","month":"03","language":[{"iso":"eng"}],"date_published":"2025-03-01T00:00:00Z","OA_type":"green","ec_funded":1,"day":"01","status":"public","project":[{"name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775"}],"citation":{"mla":"Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” <i>Mathematical Programming</i>, vol. 210, Springer Nature, 2025, pp. 881–94, doi:<a href=\"https://doi.org/10.1007/s10107-024-02066-3\">10.1007/s10107-024-02066-3</a>.","chicago":"Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” <i>Mathematical Programming</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s10107-024-02066-3\">https://doi.org/10.1007/s10107-024-02066-3</a>.","apa":"Zheng, D. W., &#38; Henzinger, M. (2025). Multiplicative auction algorithm for approximate maximum weight bipartite matching. <i>Mathematical Programming</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10107-024-02066-3\">https://doi.org/10.1007/s10107-024-02066-3</a>","ama":"Zheng DW, Henzinger M. Multiplicative auction algorithm for approximate maximum weight bipartite matching. <i>Mathematical Programming</i>. 2025;210:881-894. doi:<a href=\"https://doi.org/10.1007/s10107-024-02066-3\">10.1007/s10107-024-02066-3</a>","ista":"Zheng DW, Henzinger M. 2025. Multiplicative auction algorithm for approximate maximum weight bipartite matching. Mathematical Programming. 210, 881–894.","short":"D.W. Zheng, M. Henzinger, Mathematical Programming 210 (2025) 881–894.","ieee":"D. W. Zheng and M. Henzinger, “Multiplicative auction algorithm for approximate maximum weight bipartite matching,” <i>Mathematical Programming</i>, vol. 210. Springer Nature, pp. 881–894, 2025."},"OA_place":"repository","volume":210,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Zheng, Da Wei","last_name":"Zheng","first_name":"Da Wei"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"13236"}]},"abstract":[{"lang":"eng","text":"We present an auction algorithm using multiplicative instead of constant weight updates to compute a (1-E)-approximate maximum weight matching (MWM) in a bipartite graph with n vertices and m edges in time 0(mE-1), beating the running time of the fastest known approximation algorithm of Duan and Pettie [JACM ’14] that runs in 0(mE-1 log E-1). Our algorithm is very simple and it can be extended to give a dynamic data structure that maintains a (1-E)-approximate maximum weight matching under (1) one-sided vertex deletions (with incident edges) and (2) one-sided vertex insertions (with incident edges sorted by weight) to the other side. The total time time used is 0(mE-1), where m is the sum of the number of initially existing and inserted edges."}],"publication_status":"published","external_id":{"arxiv":["2301.09217"],"isi":["001176048100003"]},"page":"881-894","article_processing_charge":"No","title":"Multiplicative auction algorithm for approximate maximum weight bipartite matching","year":"2025","date_created":"2024-03-17T23:00:58Z","publication":"Mathematical Programming","doi":"10.1007/s10107-024-02066-3","publication_identifier":{"issn":["0025-5610"],"eissn":["1436-4646"]},"quality_controlled":"1","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2301.09217"}]},{"oa":1,"isi":1,"date_updated":"2025-05-19T13:54:31Z","publisher":"Institute of Mathematical Statistics","arxiv":1,"department":[{"_id":"GradSch"},{"_id":"LaEr"}],"date_published":"2025-02-01T00:00:00Z","language":[{"iso":"eng"}],"month":"02","type":"journal_article","acknowledgement":"I would like to express my gratitude to László Erdős for suggesting the project and supervising my work. I am also thankful to Yuanyuan Xu and Oleksii Kolupaiev for many helpful discussions. Furthermore, I am grateful to Guillaume Dubach for translating the abstract into French.\r\nThe author was supported by the ERC Advanced Grant “RMTBeyond” No. 101020331.","intvolume":"        61","oa_version":"Preprint","article_type":"original","scopus_import":"1","_id":"15128","project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"citation":{"mla":"Riabov, Volodymyr. “Mesoscopic Eigenvalue Statistics for Wigner-Type Matrices.” <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>, vol. 61, no. 1, Institute of Mathematical Statistics, 2025, pp. 129–54, doi:<a href=\"https://doi.org/10.1214/23-AIHP1438\">10.1214/23-AIHP1438</a>.","apa":"Riabov, V. (2025). Mesoscopic eigenvalue statistics for Wigner-type matrices. <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/23-AIHP1438\">https://doi.org/10.1214/23-AIHP1438</a>","chicago":"Riabov, Volodymyr. “Mesoscopic Eigenvalue Statistics for Wigner-Type Matrices.” <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>. Institute of Mathematical Statistics, 2025. <a href=\"https://doi.org/10.1214/23-AIHP1438\">https://doi.org/10.1214/23-AIHP1438</a>.","ista":"Riabov V. 2025. Mesoscopic eigenvalue statistics for Wigner-type matrices. Annales de l’institut Henri Poincare (B) Probability and Statistics. 61(1), 129–154.","ama":"Riabov V. Mesoscopic eigenvalue statistics for Wigner-type matrices. <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>. 2025;61(1):129-154. doi:<a href=\"https://doi.org/10.1214/23-AIHP1438\">10.1214/23-AIHP1438</a>","ieee":"V. Riabov, “Mesoscopic eigenvalue statistics for Wigner-type matrices,” <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>, vol. 61, no. 1. Institute of Mathematical Statistics, pp. 129–154, 2025.","short":"V. Riabov, Annales de l’institut Henri Poincare (B) Probability and Statistics 61 (2025) 129–154."},"ec_funded":1,"OA_type":"green","day":"01","status":"public","publication_status":"published","external_id":{"arxiv":["2301.01712"],"isi":["001427953600004"]},"abstract":[{"text":"We prove a universal mesoscopic central limit theorem for linear eigenvalue statistics of a Wigner-type matrix inside the bulk of the spectrum with compactly supported twice continuously differentiable test functions. The main novel ingredient is an optimal local law for the two-point function $T(z,\\zeta)$  and a general class of related quantities involving two resolvents at nearby spectral parameters.","lang":"eng"},{"text":"On établit un théorème limite central universel pour les statistiques linéaires mésoscopiques des valeurs propres d’une matrice de type Wigner au milieu du spectre, avec des fonctions de classe \r\n et à support compact. La principale nouveauté de cette approche est qu’elle repose sur une loi locale optimale pour la fonction à deux points $T(z,\\zeta)$ , ainsi que pour une classe plus générale d’observables impliquant deux résolvantes évaluées en des paramètres proches.","lang":"fre"}],"article_processing_charge":"No","page":"129-154","title":"Mesoscopic eigenvalue statistics for Wigner-type matrices","volume":61,"OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Volodymyr","last_name":"Riabov","full_name":"Riabov, Volodymyr","id":"1949f904-edfb-11eb-afb5-e2dfddabb93b"}],"quality_controlled":"1","corr_author":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2301.01712","open_access":"1"}],"date_created":"2024-03-20T09:41:04Z","year":"2025","publication":"Annales de l'institut Henri Poincare (B) Probability and Statistics","doi":"10.1214/23-AIHP1438","publication_identifier":{"issn":["0246-0203"]},"issue":"1"},{"publication":"Formal Methods in System Design","publication_identifier":{"issn":["0925-9856"],"eissn":["1572-8102"]},"doi":"10.1007/s10703-024-00447-0","date_created":"2024-06-02T22:00:57Z","year":"2025","ddc":["000"],"has_accepted_license":"1","file":[{"success":1,"creator":"dernst","content_type":"application/pdf","file_name":"2025_FormalMethodsSysDesign_Bartocci.pdf","date_created":"2025-12-30T06:50:12Z","file_size":3860690,"date_updated":"2025-12-30T06:50:12Z","access_level":"open_access","checksum":"244a71a916103b8ea08e9d0bab32bcd9","relation":"main_file","file_id":"20879"}],"quality_controlled":"1","corr_author":"1","related_material":{"record":[{"id":"11355","relation":"shorter_version","status":"public"}]},"OA_place":"publisher","volume":66,"author":[{"last_name":"Bartocci","first_name":"Ezio","full_name":"Bartocci, Ezio"},{"full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","first_name":"Thomas","last_name":"Ferrere"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic"},{"first_name":"Ana","last_name":"Oliveira da Costa","full_name":"Oliveira da Costa, Ana","orcid":"0000-0002-8741-5799","id":"f347ec37-6676-11ee-b395-a888cb7b4fb4"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Information-flow interfaces","publication_status":"published","external_id":{"isi":["001230084200001"],"arxiv":["2002.06465"]},"abstract":[{"lang":"eng","text":"Contract-based design is a promising methodology for taming the complexity of developing sophisticated systems. A formal contract distinguishes between assumptions, which are constraints that the designer of a component puts on the environments in which the component can be used safely, and guarantees, which are promises that the designer asks from the team that implements the component. A theory of formal contracts can be formalized as an interface theory, which supports the composition and refinement of both assumptions and guarantees. Although there is a rich landscape of contract-based design methods that address functional and extra-functional properties, we present the first interface theory designed to ensure system-wide security properties. Our framework provides a refinement relation and a composition operation that support both incremental design and independent implementability. We develop our theory for both stateless and stateful interfaces. Additionally, we introduce information-flow contracts where assumptions and guarantees are sets of flow relations. We use these contracts to illustrate how to enrich information-flow interfaces with a semantic view. We illustrate the applicability of our framework with two examples inspired by the automotive domain."}],"article_processing_charge":"Yes (via OA deal)","page":"3-48","status":"public","day":"01","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"OA_type":"hybrid","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"name":"Interface Theory for Security and Privacy","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","grant_number":"F8502"}],"citation":{"mla":"Bartocci, Ezio, et al. “Information-Flow Interfaces.” <i>Formal Methods in System Design</i>, vol. 66, Springer Nature, 2025, pp. 3–48, doi:<a href=\"https://doi.org/10.1007/s10703-024-00447-0\">10.1007/s10703-024-00447-0</a>.","apa":"Bartocci, E., Ferrere, T., Henzinger, T. A., Nickovic, D., &#38; Oliveira da Costa, A. (2025). Information-flow interfaces. <i>Formal Methods in System Design</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10703-024-00447-0\">https://doi.org/10.1007/s10703-024-00447-0</a>","chicago":"Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Information-Flow Interfaces.” <i>Formal Methods in System Design</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s10703-024-00447-0\">https://doi.org/10.1007/s10703-024-00447-0</a>.","ama":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Oliveira da Costa A. Information-flow interfaces. <i>Formal Methods in System Design</i>. 2025;66:3-48. doi:<a href=\"https://doi.org/10.1007/s10703-024-00447-0\">10.1007/s10703-024-00447-0</a>","ista":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Oliveira da Costa A. 2025. Information-flow interfaces. Formal Methods in System Design. 66, 3–48.","ieee":"E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Information-flow interfaces,” <i>Formal Methods in System Design</i>, vol. 66. Springer Nature, pp. 3–48, 2025.","short":"E. Bartocci, T. Ferrere, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, Formal Methods in System Design 66 (2025) 3–48."},"PlanS_conform":"1","scopus_import":"1","_id":"17094","type":"journal_article","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 956123 and it was funded in part by the Austrian Science Fund (FWF) project W1255-N23, by the Austrian FWF project ZK-35, by the FWF project SpyCoDe 10.55776/F85 and by the ERC-2020-AdG 101020093. This paper extends the text and the results of the manuscript published at FASE 2022 [1].","intvolume":"        66","oa_version":"Published Version","article_type":"original","date_updated":"2025-12-30T06:50:51Z","publisher":"Springer Nature","arxiv":1,"department":[{"_id":"ToHe"}],"date_published":"2025-05-01T00:00:00Z","language":[{"iso":"eng"}],"month":"05","file_date_updated":"2025-12-30T06:50:12Z","oa":1,"isi":1},{"abstract":[{"lang":"eng","text":"The approximation of a circle with the edges of a fine square grid distorts the perimeter by a factor about 4/Pi. We prove that this factor is the same on average (in the ergodic sense) for approximations of any rectifiable curve by the edges of any non-exotic Delaunay mosaic (known as Voronoi path), and extend the results to all dimensions, generalizing Voronoi paths to Voronoi scapes."}],"publication_status":"published","external_id":{"pmid":["39974750"],"arxiv":["2012.03350"],"isi":["001238566200004"]},"page":"490-499","article_processing_charge":"Yes (via OA deal)","title":"Average and expected distortion of Voronoi paths and scapes","volume":73,"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner"},{"last_name":"Nikitenko","first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton"}],"pmid":1,"quality_controlled":"1","file":[{"file_name":"2025_DiscreteComputGeom_EdelsbrunnerHe.pdf","content_type":"application/pdf","date_created":"2025-04-23T07:31:32Z","success":1,"creator":"dernst","file_id":"19610","date_updated":"2025-04-23T07:31:32Z","file_size":283443,"access_level":"open_access","checksum":"ffb0c818222138f9f113f4bbea41e834","relation":"main_file"}],"corr_author":"1","ddc":["510"],"has_accepted_license":"1","year":"2025","date_created":"2024-06-16T22:01:07Z","publication":"Discrete & Computational Geometry","doi":"10.1007/s00454-024-00660-y","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"oa":1,"file_date_updated":"2025-04-23T07:31:32Z","isi":1,"department":[{"_id":"HeEd"}],"arxiv":1,"publisher":"Springer Nature","date_updated":"2026-02-16T12:18:50Z","language":[{"iso":"eng"}],"month":"03","date_published":"2025-03-01T00:00:00Z","acknowledgement":"The authors thank Ranita Biswas and Tatiana Ezubova for the collaboration on computational experiments that motivated the work reported in this paper. The authors also thank Daniel Bonnema for proofreading and noticing an issue with the original proof of Lemma 4.3.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.","type":"journal_article","article_type":"original","intvolume":"        73","oa_version":"Published Version","_id":"17149","scopus_import":"1","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020","name":"Alpha Shape Theory Extended"},{"grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","call_identifier":"FWF"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"}],"citation":{"apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2025). Average and expected distortion of Voronoi paths and scapes. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-024-00660-y\">https://doi.org/10.1007/s00454-024-00660-y</a>","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00454-024-00660-y\">https://doi.org/10.1007/s00454-024-00660-y</a>.","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” <i>Discrete &#38; Computational Geometry</i>, vol. 73, Springer Nature, 2025, pp. 490–99, doi:<a href=\"https://doi.org/10.1007/s00454-024-00660-y\">10.1007/s00454-024-00660-y</a>.","short":"H. Edelsbrunner, A. Nikitenko, Discrete &#38; Computational Geometry 73 (2025) 490–499.","ieee":"H. Edelsbrunner and A. Nikitenko, “Average and expected distortion of Voronoi paths and scapes,” <i>Discrete &#38; Computational Geometry</i>, vol. 73. Springer Nature, pp. 490–499, 2025.","ista":"Edelsbrunner H, Nikitenko A. 2025. Average and expected distortion of Voronoi paths and scapes. Discrete &#38; Computational Geometry. 73, 490–499.","ama":"Edelsbrunner H, Nikitenko A. Average and expected distortion of Voronoi paths and scapes. <i>Discrete &#38; Computational Geometry</i>. 2025;73:490-499. doi:<a href=\"https://doi.org/10.1007/s00454-024-00660-y\">10.1007/s00454-024-00660-y</a>"},"ec_funded":1,"OA_type":"hybrid","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","day":"01"},{"ddc":["570"],"has_accepted_license":"1","quality_controlled":"1","file":[{"creator":"dernst","success":1,"date_created":"2025-12-30T06:54:03Z","content_type":"application/pdf","file_name":"2025_WrKlinischeWochenschrift_Schober.pdf","relation":"main_file","checksum":"321be8a584117feaea9f3feaa28caabd","access_level":"open_access","file_size":580791,"date_updated":"2025-12-30T06:54:03Z","file_id":"20880"}],"corr_author":"1","publication":"Wiener Klinische Wochenschrift","doi":"10.1007/s00508-024-02462-x","publication_identifier":{"issn":["0043-5325"],"eissn":["1613-7671"]},"year":"2025","date_created":"2024-10-20T22:02:07Z","title":"The role of institutional ethics committees in Austria: Report of the Commission on Ethics and Scientific Integrity of the Karl Landsteiner University of Health Sciences 2018–2023","abstract":[{"text":"Research involving human subjects or identifiable human material and data must be assessed by an ethics committee. The Karl Landsteiner University of Health Sciences has established a Commission on Ethics and Scientific Integrity to evaluate medical research conducted by its faculty and students and at its affiliated hospitals.\r\nAll projects submitted to the Commission on Ethics and Scientific Integrity between 2018 and 2023 were analyzed regarding their major characteristics, the duration of the evaluation process, and votes issued.\r\nA total of 520 applications were electronically submitted during the observation period. Most of the studies were retrospective data analyses in the field of oncology, psychology and surgery. Most studies included less than 100 volunteers. Of the applications 50% received a final vote within 5 months, during which several revision rounds took place. Overall, about 77% of votes issued during the observation period were positive and 2% were rejections. In 11% files were closed due to withdrawal. In 11% final votes were pending at the end of the observation period due to requests for revisions.\r\nOur results emphasize the importance of institutional ethics committees using the example of the Commission on Ethics and Scientific Integrity at the Karl Landsteiner University. Such committees fill a gap in evaluating research not covered by Austrian legal regulations. Continuous development of standards, operating procedures, and national and international collaborations are required to assess and minimize risks to trial subjects and to provide a safe and productive environment for research in human medicine and related fields.","lang":"eng"}],"external_id":{"isi":["001329812000001"]},"publication_status":"published","page":"432-437","article_processing_charge":"Yes (via OA deal)","volume":137,"OA_place":"publisher","author":[{"last_name":"Schober","first_name":"Sophie","full_name":"Schober, Sophie","id":"80b0a0ef-4b9f-11ec-b119-8d9d94c4a1d8"},{"first_name":"Sascha","last_name":"Klee","full_name":"Klee, Sascha"},{"first_name":"Franz","last_name":"Trautinger","full_name":"Trautinger, Franz"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","PlanS_conform":"1","citation":{"ama":"Schober S, Klee S, Trautinger F. The role of institutional ethics committees in Austria: Report of the Commission on Ethics and Scientific Integrity of the Karl Landsteiner University of Health Sciences 2018–2023. <i>Wiener Klinische Wochenschrift</i>. 2025;137:432-437. doi:<a href=\"https://doi.org/10.1007/s00508-024-02462-x\">10.1007/s00508-024-02462-x</a>","ista":"Schober S, Klee S, Trautinger F. 2025. The role of institutional ethics committees in Austria: Report of the Commission on Ethics and Scientific Integrity of the Karl Landsteiner University of Health Sciences 2018–2023. Wiener Klinische Wochenschrift. 137, 432–437.","ieee":"S. Schober, S. Klee, and F. Trautinger, “The role of institutional ethics committees in Austria: Report of the Commission on Ethics and Scientific Integrity of the Karl Landsteiner University of Health Sciences 2018–2023,” <i>Wiener Klinische Wochenschrift</i>, vol. 137. Springer Nature, pp. 432–437, 2025.","short":"S. Schober, S. Klee, F. Trautinger, Wiener Klinische Wochenschrift 137 (2025) 432–437.","mla":"Schober, Sophie, et al. “The Role of Institutional Ethics Committees in Austria: Report of the Commission on Ethics and Scientific Integrity of the Karl Landsteiner University of Health Sciences 2018–2023.” <i>Wiener Klinische Wochenschrift</i>, vol. 137, Springer Nature, 2025, pp. 432–37, doi:<a href=\"https://doi.org/10.1007/s00508-024-02462-x\">10.1007/s00508-024-02462-x</a>.","apa":"Schober, S., Klee, S., &#38; Trautinger, F. (2025). The role of institutional ethics committees in Austria: Report of the Commission on Ethics and Scientific Integrity of the Karl Landsteiner University of Health Sciences 2018–2023. <i>Wiener Klinische Wochenschrift</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00508-024-02462-x\">https://doi.org/10.1007/s00508-024-02462-x</a>","chicago":"Schober, Sophie, Sascha Klee, and Franz Trautinger. “The Role of Institutional Ethics Committees in Austria: Report of the Commission on Ethics and Scientific Integrity of the Karl Landsteiner University of Health Sciences 2018–2023.” <i>Wiener Klinische Wochenschrift</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00508-024-02462-x\">https://doi.org/10.1007/s00508-024-02462-x</a>."},"status":"public","day":"01","OA_type":"hybrid","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"PreCl"}],"publisher":"Springer Nature","date_updated":"2025-12-30T06:55:59Z","language":[{"iso":"eng"}],"month":"07","date_published":"2025-07-01T00:00:00Z","oa":1,"file_date_updated":"2025-12-30T06:54:03Z","isi":1,"_id":"18449","scopus_import":"1","acknowledgement":"Open access funding provided by Karl Landsteiner University.","type":"journal_article","article_type":"original","oa_version":"Published Version","intvolume":"       137"},{"_id":"18478","scopus_import":"1","article_type":"original","intvolume":"       360","oa_version":"Published Version","type":"journal_article","acknowledgement":"This work was initiated at the annual workshop of the Combinatorics and Graph Theory group of Freie Universität Berlin in Wilhelmsaue in September 2023. The authors would like to thank the institution for enabling this research. Finally, the fourth author would like to thank Tibor Szabó and the Combinatorics and Graph Theory group at Freie Universität Berlin for their hospitality during the research visit. Additionally, we thank Moharram Iradmusa for bringing the papers [5], [7] to our attention. Finally, we thank the anonymous referees for their suggestions on the manuscript, which have improved the quality of the document.\r\nM.A.: This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413 .\r\nS.B.: The research leading to these results was supported by EPSRC, UK, grant no. EP/V048287/1. There are no additional data beyond that contained within the main manuscript.\r\nS.R.: Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – The Berlin Mathematics Research Center MATH+ (EXC-2046/1, project ID: 390685689).\r\nJ.R. acknowledges the support of the Grant PID2020-113082GB-I00 funded by MICIU/AEI/10.13039/501100011033, Spain, and the Severo Ochoa and María de Maeztu Program for Centers and Units of Excellence in R&D, Spain (CEX2020-001084-M).","month":"01","language":[{"iso":"eng"}],"date_published":"2025-01-15T00:00:00Z","department":[{"_id":"MaKw"}],"arxiv":1,"publisher":"Elsevier","date_updated":"2025-04-14T07:54:56Z","isi":1,"oa":1,"file_date_updated":"2025-01-13T09:25:59Z","day":"15","status":"public","ec_funded":1,"OA_type":"hybrid","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"citation":{"ista":"Anastos M, Boyadzhiyska S, Rathke S, Rué J. 2025. On the chromatic number of powers of subdivisions of graphs. Discrete Applied Mathematics. 360, 506–511.","ama":"Anastos M, Boyadzhiyska S, Rathke S, Rué J. On the chromatic number of powers of subdivisions of graphs. <i>Discrete Applied Mathematics</i>. 2025;360:506-511. doi:<a href=\"https://doi.org/10.1016/j.dam.2024.10.002\">10.1016/j.dam.2024.10.002</a>","short":"M. Anastos, S. Boyadzhiyska, S. Rathke, J. Rué, Discrete Applied Mathematics 360 (2025) 506–511.","ieee":"M. Anastos, S. Boyadzhiyska, S. Rathke, and J. Rué, “On the chromatic number of powers of subdivisions of graphs,” <i>Discrete Applied Mathematics</i>, vol. 360. Elsevier, pp. 506–511, 2025.","mla":"Anastos, Michael, et al. “On the Chromatic Number of Powers of Subdivisions of Graphs.” <i>Discrete Applied Mathematics</i>, vol. 360, Elsevier, 2025, pp. 506–11, doi:<a href=\"https://doi.org/10.1016/j.dam.2024.10.002\">10.1016/j.dam.2024.10.002</a>.","apa":"Anastos, M., Boyadzhiyska, S., Rathke, S., &#38; Rué, J. (2025). On the chromatic number of powers of subdivisions of graphs. <i>Discrete Applied Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.dam.2024.10.002\">https://doi.org/10.1016/j.dam.2024.10.002</a>","chicago":"Anastos, Michael, Simona Boyadzhiyska, Silas Rathke, and Juanjo Rué. “On the Chromatic Number of Powers of Subdivisions of Graphs.” <i>Discrete Applied Mathematics</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.dam.2024.10.002\">https://doi.org/10.1016/j.dam.2024.10.002</a>."},"project":[{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Anastos","first_name":"Michael","full_name":"Anastos, Michael","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb"},{"full_name":"Boyadzhiyska, Simona","first_name":"Simona","last_name":"Boyadzhiyska"},{"last_name":"Rathke","first_name":"Silas","full_name":"Rathke, Silas"},{"last_name":"Rué","first_name":"Juanjo","full_name":"Rué, Juanjo"}],"OA_place":"publisher","volume":360,"title":"On the chromatic number of powers of subdivisions of graphs","page":"506-511","article_processing_charge":"Yes (in subscription journal)","abstract":[{"text":"For a given graph G=(V,E), we define its \\emph{nth subdivision} as the graph obtained from G by replacing every edge by a path of length n. We also define the \\emph{mth power} of G as the graph on vertex set V where we connect every pair of vertices at distance at most m in G. In this paper, we study the chromatic number of powers of subdivisions of graphs and resolve the case m=n asymptotically. In particular, our result confirms a conjecture of Mozafari-Nia and Iradmusa in the case m=n=3 in a strong sense.","lang":"eng"}],"publication_status":"published","external_id":{"isi":["001343647000001"],"arxiv":["2404.05542"]},"publication_identifier":{"issn":["0166-218X"]},"doi":"10.1016/j.dam.2024.10.002","publication":"Discrete Applied Mathematics","year":"2025","date_created":"2024-10-27T23:01:44Z","has_accepted_license":"1","ddc":["510"],"corr_author":"1","file":[{"file_id":"18836","checksum":"bd20a13e56b3ea01daf5e7aca5247c60","relation":"main_file","access_level":"open_access","date_updated":"2025-01-13T09:25:59Z","file_size":441060,"date_created":"2025-01-13T09:25:59Z","content_type":"application/pdf","file_name":"2025_DiscreteApplMath_Anastos.pdf","creator":"dernst","success":1}],"quality_controlled":"1"},{"OA_type":"closed access","status":"public","day":"01","citation":{"mla":"Zhang, Yichao, et al. “Limitation of Time Promotes Cooperation in Structured Collaboration Systems.” <i>IEEE Transactions on Network Science and Engineering</i>, vol. 12, no. 1, IEEE, 2025, pp. 4–12, doi:<a href=\"https://doi.org/10.1109/TNSE.2024.3481434\">10.1109/TNSE.2024.3481434</a>.","apa":"Zhang, Y., Wang, J., Wen, G., Guan, J., Zhou, S., Chen, G., … Perc, M. (2025). Limitation of time promotes cooperation in structured collaboration systems. <i>IEEE Transactions on Network Science and Engineering</i>. IEEE. <a href=\"https://doi.org/10.1109/TNSE.2024.3481434\">https://doi.org/10.1109/TNSE.2024.3481434</a>","chicago":"Zhang, Yichao, Jiasheng Wang, Guanghui Wen, Jihong Guan, Shuigeng Zhou, Guanrong Chen, Krishnendu Chatterjee, and Matjaz Perc. “Limitation of Time Promotes Cooperation in Structured Collaboration Systems.” <i>IEEE Transactions on Network Science and Engineering</i>. IEEE, 2025. <a href=\"https://doi.org/10.1109/TNSE.2024.3481434\">https://doi.org/10.1109/TNSE.2024.3481434</a>.","ista":"Zhang Y, Wang J, Wen G, Guan J, Zhou S, Chen G, Chatterjee K, Perc M. 2025. Limitation of time promotes cooperation in structured collaboration systems. IEEE Transactions on Network Science and Engineering. 12(1), 4–12.","ama":"Zhang Y, Wang J, Wen G, et al. Limitation of time promotes cooperation in structured collaboration systems. <i>IEEE Transactions on Network Science and Engineering</i>. 2025;12(1):4-12. doi:<a href=\"https://doi.org/10.1109/TNSE.2024.3481434\">10.1109/TNSE.2024.3481434</a>","short":"Y. Zhang, J. Wang, G. Wen, J. Guan, S. Zhou, G. Chen, K. Chatterjee, M. Perc, IEEE Transactions on Network Science and Engineering 12 (2025) 4–12.","ieee":"Y. Zhang <i>et al.</i>, “Limitation of time promotes cooperation in structured collaboration systems,” <i>IEEE Transactions on Network Science and Engineering</i>, vol. 12, no. 1. IEEE, pp. 4–12, 2025."},"article_type":"original","intvolume":"        12","oa_version":"None","type":"journal_article","_id":"18529","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"month":"01","date_published":"2025-01-01T00:00:00Z","department":[{"_id":"KrCh"}],"publisher":"IEEE","date_updated":"2025-02-27T12:35:48Z","year":"2025","date_created":"2024-11-10T23:02:00Z","issue":"1","publication_identifier":{"eissn":["2327-4697"]},"doi":"10.1109/TNSE.2024.3481434","publication":"IEEE Transactions on Network Science and Engineering","quality_controlled":"1","author":[{"first_name":"Yichao","last_name":"Zhang","full_name":"Zhang, Yichao"},{"full_name":"Wang, Jiasheng","last_name":"Wang","first_name":"Jiasheng"},{"full_name":"Wen, Guanghui","last_name":"Wen","first_name":"Guanghui"},{"full_name":"Guan, Jihong","last_name":"Guan","first_name":"Jihong"},{"first_name":"Shuigeng","last_name":"Zhou","full_name":"Zhou, Shuigeng"},{"last_name":"Chen","first_name":"Guanrong","full_name":"Chen, Guanrong"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Perc","first_name":"Matjaz","full_name":"Perc, Matjaz"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":12,"page":"4-12","article_processing_charge":"No","abstract":[{"text":"Temporal networks are obtained from time-dependent interactions among individuals, whereas the interactions can be emails, phone calls, face-to-face meetings, or work collaboration. In this article, a temporal game framework is established, in which interactions among rational individuals are embedded into two-player games in a time-dependent manner. This allows studying the time-dependent complexity and variability of interactions, and the way they affect prosocial behaviors. Based on this simple mathematical model, it is found that the level of cooperation is promoted when the time of collaboration is equally limited for every individual. This observation is confirmed by a series of systematic human experiments on over 1,400 subjects, forming a foundation for comprehensively describing human temporal interactions in collaboration. The research results reveal an important incentive for human cooperation, leading to a better understanding of a fascinating aspect of human nature in society.","lang":"eng"}],"publication_status":"published","external_id":{"isi":["001385382200040"]},"title":"Limitation of time promotes cooperation in structured collaboration systems"},{"title":"Efficient and rapid sunlight-driven photocatalytic degradation of methylene blue dye using multiferroic BiFeO3 nanoparticles","page":"356-373","article_processing_charge":"No","abstract":[{"text":"The current investigation presents a facile and cost-effective sol-gel approach for the synthesis of phase-pure multiferroic bismuth ferrite (BiFeO3) nanoparticles (BFO NPs) by using propylene glycol as a complexing agent, intended for use as a photocatalyst to efficiently degrade organic dyes in aqueous solutions under natural sunlight. Characterization techniques, including thermogravimetric analysis (TGA), Fourier transform infrared spectroscopy (FT-IR), and X-ray diffraction (XRD), elucidated a plausible reaction pathway for the formation of phase-pure BFO NPs. Rietveld refinement of the XRD data, in conjunction with transmission electron microscopy (TEM) and Raman spectroscopy, confirmed the synthesis of single-phase BFO NPs at 400 °C, displaying a space group of R3c and an average crystallite size of 25 nm. UV–visible diffuse reflectance spectroscopy revealed an absorption cut-off wavelength near 590 nm, corresponding to a band gap of 2.08 eV, indicating the capability of BFO NPs to absorb visible light within the 400–590 nm range. BFO NPs have shown efficient and rapid photocatalytic degradation of methylene blue (MB) in acidic, neutral, and basic pH conditions under natural sunlight. This is attributed to the intrinsic ferroelectric and ferromagnetic ordering present in synthesized BFO NPs which facilitates the separation and migration of photoinduced charges through band bending phenomena at the interface.","lang":"eng"}],"external_id":{"isi":["001348590700001"]},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Verma, Madhu","last_name":"Verma","first_name":"Madhu"},{"first_name":"Ajay","last_name":"Kumar","full_name":"Kumar, Ajay"},{"full_name":"Thakur, Vijay Kumar","first_name":"Vijay Kumar","last_name":"Thakur"},{"full_name":"Maurya, Akanksha","first_name":"Akanksha","last_name":"Maurya"},{"full_name":"Kumar, Sachin","last_name":"Kumar","first_name":"Sachin"},{"first_name":"Saurabh","last_name":"Singh","orcid":"0000-0003-2209-5269","id":"12d625da-9cb3-11ed-9667-af09d37d3f0a","full_name":"Singh, Saurabh"},{"full_name":"Srivastav, Simant Kumar","last_name":"Srivastav","first_name":"Simant Kumar"}],"volume":113,"quality_controlled":"1","publication_identifier":{"issn":["0928-0707"],"eissn":["1573-4846"]},"doi":"10.1007/s10971-024-06607-2","publication":"Journal of Sol-Gel Science and Technology","year":"2025","date_created":"2024-11-17T23:01:47Z","language":[{"iso":"eng"}],"month":"02","date_published":"2025-02-01T00:00:00Z","publisher":"Springer Nature","department":[{"_id":"MaIb"}],"date_updated":"2025-05-19T14:00:43Z","isi":1,"_id":"18558","scopus_import":"1","article_type":"original","intvolume":"       113","oa_version":"None","type":"journal_article","acknowledgement":"Simant Kumar Srivastav greatly acknowledges the University Grant Commission (UGC), New Delhi, India for providing BSR start-up grant to carry out this research work.\r\nThis research was supported by start-up grant of the University Grant Commission (UGC), New Delhi, India through project no F-30-500/2019 (BSR).","citation":{"ama":"Verma M, Kumar A, Thakur VK, et al. Efficient and rapid sunlight-driven photocatalytic degradation of methylene blue dye using multiferroic BiFeO3 nanoparticles. <i>Journal of Sol-Gel Science and Technology</i>. 2025;113:356-373. doi:<a href=\"https://doi.org/10.1007/s10971-024-06607-2\">10.1007/s10971-024-06607-2</a>","ista":"Verma M, Kumar A, Thakur VK, Maurya A, Kumar S, Singh S, Srivastav SK. 2025. Efficient and rapid sunlight-driven photocatalytic degradation of methylene blue dye using multiferroic BiFeO3 nanoparticles. Journal of Sol-Gel Science and Technology. 113, 356–373.","ieee":"M. Verma <i>et al.</i>, “Efficient and rapid sunlight-driven photocatalytic degradation of methylene blue dye using multiferroic BiFeO3 nanoparticles,” <i>Journal of Sol-Gel Science and Technology</i>, vol. 113. Springer Nature, pp. 356–373, 2025.","short":"M. Verma, A. Kumar, V.K. Thakur, A. Maurya, S. Kumar, S. Singh, S.K. Srivastav, Journal of Sol-Gel Science and Technology 113 (2025) 356–373.","mla":"Verma, Madhu, et al. “Efficient and Rapid Sunlight-Driven Photocatalytic Degradation of Methylene Blue Dye Using Multiferroic BiFeO3 Nanoparticles.” <i>Journal of Sol-Gel Science and Technology</i>, vol. 113, Springer Nature, 2025, pp. 356–73, doi:<a href=\"https://doi.org/10.1007/s10971-024-06607-2\">10.1007/s10971-024-06607-2</a>.","chicago":"Verma, Madhu, Ajay Kumar, Vijay Kumar Thakur, Akanksha Maurya, Sachin Kumar, Saurabh Singh, and Simant Kumar Srivastav. “Efficient and Rapid Sunlight-Driven Photocatalytic Degradation of Methylene Blue Dye Using Multiferroic BiFeO3 Nanoparticles.” <i>Journal of Sol-Gel Science and Technology</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s10971-024-06607-2\">https://doi.org/10.1007/s10971-024-06607-2</a>.","apa":"Verma, M., Kumar, A., Thakur, V. K., Maurya, A., Kumar, S., Singh, S., &#38; Srivastav, S. K. (2025). Efficient and rapid sunlight-driven photocatalytic degradation of methylene blue dye using multiferroic BiFeO3 nanoparticles. <i>Journal of Sol-Gel Science and Technology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10971-024-06607-2\">https://doi.org/10.1007/s10971-024-06607-2</a>"},"day":"01","status":"public","OA_type":"closed access"},{"date_created":"2024-11-24T23:01:47Z","year":"2025","article_number":"5","doi":"10.1007/s12346-024-01144-3","publication_identifier":{"issn":["1575-5460"],"eissn":["1662-3592"]},"issue":"1","publication":"Qualitative Theory of Dynamical Systems","corr_author":"1","file":[{"file_id":"18595","access_level":"open_access","checksum":"73309a57cc798d696caa57b6aa1467d8","relation":"main_file","file_size":1483668,"date_updated":"2024-11-28T06:52:38Z","date_created":"2024-11-28T06:52:38Z","file_name":"2025_predecomposition.pdf","content_type":"application/pdf","success":1,"creator":"mlipinsk"}],"quality_controlled":"1","has_accepted_license":"1","ddc":["514","510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"dfffb474-4317-11ee-8f5c-fe3fc95a425e","orcid":"0000-0001-9789-9750","full_name":"Lipiński, Michał","last_name":"Lipiński","first_name":"Michał"},{"last_name":"Mischaikow","first_name":"Konstantin","full_name":"Mischaikow, Konstantin"},{"first_name":"Marian","last_name":"Mrozek","full_name":"Mrozek, Marian"}],"OA_place":"publisher","volume":24,"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["001356000500005"],"arxiv":["2312.08013"]},"publication_status":"published","abstract":[{"text":"Motivated by the study of recurrent orbits and dynamics within a Morse set of a Morse decomposition we introduce the concept of Morse predecomposition of an isolated invariant set within the setting of both combinatorial and classical dynamical systems. While Morse decomposition summarizes solely the gradient part of a dynamical system, the developed generalization extends to the recurrent component as well. In particular, a chain recurrent set, which is indecomposable in terms of Morse decomposition, can be represented more finely in the Morse predecomposition framework. This generalization is achieved by forgoing the poset structure inherent to Morse decomposition and relaxing the notion of connection between Morse sets (elements of Morse decomposition) in favor of what we term ’links’. We prove that a Morse decomposition is a special case of Morse predecomposition indexed by a poset. Additionally, we show how a Morse predecomposition may be condensed back to retrieve a Morse decomposition.","lang":"eng"}],"title":"Morse predecomposition of an invariant set","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"OA_type":"hybrid","status":"public","day":"01","citation":{"short":"M. Lipiński, K. Mischaikow, M. Mrozek, Qualitative Theory of Dynamical Systems 24 (2025).","ieee":"M. Lipiński, K. Mischaikow, and M. Mrozek, “Morse predecomposition of an invariant set,” <i>Qualitative Theory of Dynamical Systems</i>, vol. 24, no. 1. Springer Nature, 2025.","ama":"Lipiński M, Mischaikow K, Mrozek M. Morse predecomposition of an invariant set. <i>Qualitative Theory of Dynamical Systems</i>. 2025;24(1). doi:<a href=\"https://doi.org/10.1007/s12346-024-01144-3\">10.1007/s12346-024-01144-3</a>","ista":"Lipiński M, Mischaikow K, Mrozek M. 2025. Morse predecomposition of an invariant set. Qualitative Theory of Dynamical Systems. 24(1), 5.","chicago":"Lipiński, Michał, Konstantin Mischaikow, and Marian Mrozek. “Morse Predecomposition of an Invariant Set.” <i>Qualitative Theory of Dynamical Systems</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s12346-024-01144-3\">https://doi.org/10.1007/s12346-024-01144-3</a>.","apa":"Lipiński, M., Mischaikow, K., &#38; Mrozek, M. (2025). Morse predecomposition of an invariant set. <i>Qualitative Theory of Dynamical Systems</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s12346-024-01144-3\">https://doi.org/10.1007/s12346-024-01144-3</a>","mla":"Lipiński, Michał, et al. “Morse Predecomposition of an Invariant Set.” <i>Qualitative Theory of Dynamical Systems</i>, vol. 24, no. 1, 5, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1007/s12346-024-01144-3\">10.1007/s12346-024-01144-3</a>."},"project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"intvolume":"        24","oa_version":"Published Version","article_type":"original","type":"journal_article","acknowledgement":"M.L. acknowledge support by the Dioscuri program initiated by the Max Planck Society, jointly managed with the National Science Centre (Poland), and mutually funded by the Polish Ministry of Science and Higher Education and the German Federal Ministry of Education and Research. M.L. also acknowledges that this project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. Research of M.M. is partially supported by the Polish National Science Center under Opus Grant No. 2019/35/B/ST1/00874. The work of K.M. was partially supported by the National Science Foundation under awards DMS-1839294 and HDR TRIPODS award CCF-1934924, DARPA contract HR0011-16-2-0033, National Institutes of Health award R01 GM126555, Air Force Office of Scientific Research under award numbers FA9550-23-1-0011, AWD00010853-MOD002 and MURI FA9550-23-1-0400. K.M. was also supported by a grant from the Simons Foundation. Open access funding provided by Institute of Science and Technology (IST Austria). ","scopus_import":"1","_id":"18580","isi":1,"file_date_updated":"2024-11-28T06:52:38Z","oa":1,"date_published":"2025-02-01T00:00:00Z","language":[{"iso":"eng"}],"month":"02","date_updated":"2025-04-14T07:54:56Z","department":[{"_id":"UlWa"}],"publisher":"Springer Nature","arxiv":1},{"ddc":["550"],"has_accepted_license":"1","quality_controlled":"1","file":[{"file_size":5924105,"date_updated":"2025-07-03T06:46:27Z","checksum":"2b4968f1c794da56d1eb7b856a406de7","relation":"main_file","access_level":"open_access","file_id":"19958","creator":"dernst","success":1,"file_name":"2025_QuartJRMS_Agasthya.pdf","content_type":"application/pdf","date_created":"2025-07-03T06:46:27Z"}],"corr_author":"1","publication":"Quarterly Journal of the Royal Meteorological Society","doi":"10.1002/qj.4902","publication_identifier":{"eissn":["1477-870X"],"issn":["0035-9009"]},"issue":"766","article_number":"e4902","date_created":"2024-12-01T23:01:54Z","year":"2025","title":"Moist convective scaling: Insights from an idealised model","external_id":{"isi":["001363135200001"]},"publication_status":"published","abstract":[{"lang":"eng","text":"The response of clouds and moist-convective processes to heat loss to space by long-wave radiative cooling is an important feedback in the Earth's atmosphere. It is known that moist convection increases roughly in equilibrium with radiative cooling, an assumption often made in simplified models of the tropical atmosphere. In this study, we use an idealised two-dimensional model of the atmosphere introduced by Vallis et. al. and incorporate a bulk-cooling term, which is an idealisation of radiative cooling in the atmosphere. We comment briefly on the static stability of the system to dry and moist convection and characteris its moist convective response to changes in the bulk cooling. We find that, while the clear-sky regions of the model respond directly to the change in the cooling term, the regions dominated by moist convective plumes are insensitive to changes in cooling. Similar to previous findings from cloud-resolving models, we too find in our idealised setting that the majority of the increase in convection occurs via an increase in the areal coverage of convection, rather than its intensity. We argue that these small-scale convective processes are an upper bound on how quickly convective intensity can change to stay in equilibrium with radiative cooling."}],"article_processing_charge":"Yes (via OA deal)","acknowledged_ssus":[{"_id":"ScienComp"}],"volume":151,"OA_place":"publisher","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Lokahith N","last_name":"Agasthya","id":"cd100965-0804-11ed-9c55-f4878ff4e877","full_name":"Agasthya, Lokahith N"},{"full_name":"Muller, Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","orcid":"0000-0001-5836-5350","last_name":"Muller","first_name":"Caroline J"},{"id":"c2cdb722-b15c-11ef-9e63-db902a30b40d","full_name":"Cheve, Mathis","first_name":"Mathis","last_name":"Cheve"}],"project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"},{"call_identifier":"H2020","name":"Organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate","_id":"629205d8-2b32-11ec-9570-e1356ff73576","grant_number":"805041"}],"citation":{"ieee":"L. N. Agasthya, C. J. Muller, and M. Cheve, “Moist convective scaling: Insights from an idealised model,” <i>Quarterly Journal of the Royal Meteorological Society</i>, vol. 151, no. 766. Wiley, 2025.","short":"L.N. Agasthya, C.J. Muller, M. Cheve, Quarterly Journal of the Royal Meteorological Society 151 (2025).","ama":"Agasthya LN, Muller CJ, Cheve M. Moist convective scaling: Insights from an idealised model. <i>Quarterly Journal of the Royal Meteorological Society</i>. 2025;151(766). doi:<a href=\"https://doi.org/10.1002/qj.4902\">10.1002/qj.4902</a>","ista":"Agasthya LN, Muller CJ, Cheve M. 2025. Moist convective scaling: Insights from an idealised model. Quarterly Journal of the Royal Meteorological Society. 151(766), e4902.","apa":"Agasthya, L. N., Muller, C. J., &#38; Cheve, M. (2025). Moist convective scaling: Insights from an idealised model. <i>Quarterly Journal of the Royal Meteorological Society</i>. Wiley. <a href=\"https://doi.org/10.1002/qj.4902\">https://doi.org/10.1002/qj.4902</a>","chicago":"Agasthya, Lokahith N, Caroline J Muller, and Mathis Cheve. “Moist Convective Scaling: Insights from an Idealised Model.” <i>Quarterly Journal of the Royal Meteorological Society</i>. Wiley, 2025. <a href=\"https://doi.org/10.1002/qj.4902\">https://doi.org/10.1002/qj.4902</a>.","mla":"Agasthya, Lokahith N., et al. “Moist Convective Scaling: Insights from an Idealised Model.” <i>Quarterly Journal of the Royal Meteorological Society</i>, vol. 151, no. 766, e4902, Wiley, 2025, doi:<a href=\"https://doi.org/10.1002/qj.4902\">10.1002/qj.4902</a>."},"day":"01","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"OA_type":"hybrid","date_updated":"2025-09-30T10:22:46Z","department":[{"_id":"CaMu"}],"publisher":"Wiley","date_published":"2025-01-01T00:00:00Z","language":[{"iso":"eng"}],"month":"01","file_date_updated":"2025-07-03T06:46:27Z","oa":1,"isi":1,"scopus_import":"1","_id":"18605","type":"journal_article","acknowledgement":"The authors gratefully acknowledge the help of Julian Renaud and Alzbeta “Bety” Pechacova. Julian went through the relevant literature on the topic in the initial stages of the study in a very thorough manner and allowed the authors to understand the various types of idealised models that have been studied and the various approaches used. Bety ran simulations and performed analysis of the outputs of several simulations, which were crucial to bringing the article to its final form.\r\n\r\nThe authors also acknowledge the input of Prof. Martin Singh (Monash University, Australia) and discussions with Gregory Dritschel, Prof. Steven Tobias, and Prof. Douglas Parker (Leeds University, United Kingdom).\r\n\r\nThis project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 101034413. C. Muller gratefully acknowledges funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, Grant Agreement No. 805041). This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).","intvolume":"       151","oa_version":"Published Version","article_type":"original"},{"status":"public","day":"13","OA_type":"gold","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"citation":{"ama":"Wei H, Zhu H, Ying W, et al. Structural insights into brassinosteroid export mediated by the Arabidopsis ABC transporter ABCB1. <i>Plant Communications</i>. 2025;6(1). doi:<a href=\"https://doi.org/10.1016/j.xplc.2024.101181\">10.1016/j.xplc.2024.101181</a>","ista":"Wei H, Zhu H, Ying W, Janssens H, Kvasnica M, Winne J, Gao Y, Friml J, Ma Q, Tan S, Liu X, Russinova E, Sun L. 2025. Structural insights into brassinosteroid export mediated by the Arabidopsis ABC transporter ABCB1. Plant Communications. 6(1), 101181.","short":"H. Wei, H. Zhu, W. Ying, H. Janssens, M. Kvasnica, J. Winne, Y. Gao, J. Friml, Q. Ma, S. Tan, X. Liu, E. Russinova, L. Sun, Plant Communications 6 (2025).","ieee":"H. Wei <i>et al.</i>, “Structural insights into brassinosteroid export mediated by the Arabidopsis ABC transporter ABCB1,” <i>Plant Communications</i>, vol. 6, no. 1. Elsevier, 2025.","mla":"Wei, H., et al. “Structural Insights into Brassinosteroid Export Mediated by the Arabidopsis ABC Transporter ABCB1.” <i>Plant Communications</i>, vol. 6, no. 1, 101181, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.xplc.2024.101181\">10.1016/j.xplc.2024.101181</a>.","chicago":"Wei, H, H Zhu, W Ying, H Janssens, M Kvasnica, JM Winne, Y Gao, et al. “Structural Insights into Brassinosteroid Export Mediated by the Arabidopsis ABC Transporter ABCB1.” <i>Plant Communications</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.xplc.2024.101181\">https://doi.org/10.1016/j.xplc.2024.101181</a>.","apa":"Wei, H., Zhu, H., Ying, W., Janssens, H., Kvasnica, M., Winne, J., … Sun, L. (2025). Structural insights into brassinosteroid export mediated by the Arabidopsis ABC transporter ABCB1. <i>Plant Communications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.xplc.2024.101181\">https://doi.org/10.1016/j.xplc.2024.101181</a>"},"_id":"18619","scopus_import":"1","acknowledgement":"We thank the Cryo-EM Center of the University of Science and Technology of China for the EM facility support. We thank Yaowei Wang, Yongming Luo, and Nemanja Vukašinović (VIB-UGhent, Belgium) for useful discussions and technical support. L.S. is supported by an Outstanding Young Scholar Award from the Qiu Shi Science and Technologies Foundation and a Young Scholar Award from the Cyrus Tang Foundation. No conflict of interest is declared.","type":"journal_article","article_type":"original","oa_version":"Published Version","intvolume":"         6","publisher":"Elsevier","department":[{"_id":"JiFr"}],"date_updated":"2025-05-19T14:02:01Z","language":[{"iso":"eng"}],"month":"01","date_published":"2025-01-13T00:00:00Z","oa":1,"DOAJ_listed":"1","file_date_updated":"2025-04-16T09:02:05Z","isi":1,"publication":"Plant Communications","issue":"1","publication_identifier":{"issn":["2590-3462"]},"doi":"10.1016/j.xplc.2024.101181","article_number":"101181","year":"2025","date_created":"2024-12-04T11:21:16Z","ddc":["580"],"has_accepted_license":"1","file":[{"file_id":"19575","file_size":4443183,"date_updated":"2025-04-16T09:02:05Z","relation":"main_file","checksum":"7b0e4511e43cc0da06730c3edb7c1167","access_level":"open_access","content_type":"application/pdf","file_name":"2025_PlantComm_Wei.pdf","date_created":"2025-04-16T09:02:05Z","creator":"dernst","success":1}],"quality_controlled":"1","pmid":1,"volume":6,"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Wei","first_name":"H","full_name":"Wei, H"},{"first_name":"H","last_name":"Zhu","full_name":"Zhu, H"},{"full_name":"Ying, W","first_name":"W","last_name":"Ying"},{"last_name":"Janssens","first_name":"H","full_name":"Janssens, H"},{"full_name":"Kvasnica, M","last_name":"Kvasnica","first_name":"M"},{"full_name":"Winne, JM","last_name":"Winne","first_name":"JM"},{"first_name":"Y","last_name":"Gao","full_name":"Gao, Y"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","last_name":"Friml","first_name":"Jiří"},{"first_name":"Q","last_name":"Ma","full_name":"Ma, Q"},{"first_name":"S","last_name":"Tan","full_name":"Tan, S"},{"full_name":"Liu, X","last_name":"Liu","first_name":"X"},{"full_name":"Russinova, E","last_name":"Russinova","first_name":"E"},{"last_name":"Sun","first_name":"L","full_name":"Sun, L"}],"title":"Structural insights into brassinosteroid export mediated by the Arabidopsis ABC transporter ABCB1","abstract":[{"lang":"eng","text":"Brassinosteroids (BRs) are steroidal phytohormones indispensable for plant growth, development, and responses to environmental stresses. The export of bioactive BRs to the apoplast is essential for BR signalling initiation, which requires binding of BR molecule to the extracellular domains of the plasma membrane-localized receptor complex. We have previously shown that the Arabidopsis thaliana ATP-binding cassette (ABC) transporter, ABCB19, functions as a BR exporter, and together with its close homologue, ABCB1, positively regulate BR signalling. Here, we demonstrate that ABCB1 is another BR transporter. The ATP hydrolysis activity of ABCB1 was stimulated by bioactive BRs, and its transport activity was confirmed in proteoliposomes and protoplasts. Structures of ABCB1 in substrate-unbound (apo), brassinolide (BL)-bound, and ATP plus BL-bound states were determined. In the BL-bound structure, BL was bound to the hydrophobic cavity formed by the transmembrane domain, and triggered local conformational changes. Together, our data provide additional insights into the ABC transporter-mediated BR export."}],"publication_status":"published","external_id":{"isi":["001416757300001"],"pmid":["39497419"]},"article_processing_charge":"Yes"},{"corr_author":"1","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.18238"}],"year":"2025","date_created":"2024-12-08T23:01:54Z","article_number":"110055","doi":"10.1016/j.aim.2024.110055","publication_identifier":{"issn":["0001-8708"],"eissn":["1090-2082"]},"publication":"Advances in Mathematics","article_processing_charge":"No","abstract":[{"text":"The local angle property of the (order-1) Delaunay triangulations of a generic set in R2\r\n asserts that the sum of two angles opposite a common edge is less than π. This paper extends this property to higher order and uses it to generalize two classic properties from order-1 to order-2: (1) among the complete level-2 hypertriangulations of a generic point set in R2, the order-2 Delaunay triangulation lexicographically maximizes the sorted angle vector; (2) among the maximal level-2 hypertriangulations of a generic point set in R2, the order-2 Delaunay triangulation is the only one that has the local angle property. We also use our method of establishing (2) to give a new short proof of the angle vector optimality for the (order-1) Delaunay triangulation. For order-1, both properties have been instrumental in numerous applications of Delaunay triangulations, and we expect that their generalization will make order-2 Delaunay triangulations more attractive to applications as well.","lang":"eng"}],"publication_status":"published","external_id":{"isi":["001370682500001"],"arxiv":["2310.18238"]},"title":"Order-2 Delaunay triangulations optimize angles","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Garber, Alexey","first_name":"Alexey","last_name":"Garber"},{"last_name":"Saghafian","first_name":"Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824","full_name":"Saghafian, Morteza"}],"OA_place":"repository","volume":461,"citation":{"chicago":"Edelsbrunner, Herbert, Alexey Garber, and Morteza Saghafian. “Order-2 Delaunay Triangulations Optimize Angles.” <i>Advances in Mathematics</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.aim.2024.110055\">https://doi.org/10.1016/j.aim.2024.110055</a>.","apa":"Edelsbrunner, H., Garber, A., &#38; Saghafian, M. (2025). Order-2 Delaunay triangulations optimize angles. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2024.110055\">https://doi.org/10.1016/j.aim.2024.110055</a>","mla":"Edelsbrunner, Herbert, et al. “Order-2 Delaunay Triangulations Optimize Angles.” <i>Advances in Mathematics</i>, vol. 461, 110055, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.aim.2024.110055\">10.1016/j.aim.2024.110055</a>.","short":"H. Edelsbrunner, A. Garber, M. Saghafian, Advances in Mathematics 461 (2025).","ieee":"H. Edelsbrunner, A. Garber, and M. Saghafian, “Order-2 Delaunay triangulations optimize angles,” <i>Advances in Mathematics</i>, vol. 461. Elsevier, 2025.","ista":"Edelsbrunner H, Garber A, Saghafian M. 2025. Order-2 Delaunay triangulations optimize angles. Advances in Mathematics. 461, 110055.","ama":"Edelsbrunner H, Garber A, Saghafian M. Order-2 Delaunay triangulations optimize angles. <i>Advances in Mathematics</i>. 2025;461. doi:<a href=\"https://doi.org/10.1016/j.aim.2024.110055\">10.1016/j.aim.2024.110055</a>"},"project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"call_identifier":"FWF","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"ec_funded":1,"OA_type":"green","status":"public","day":"01","isi":1,"oa":1,"month":"02","language":[{"iso":"eng"}],"date_published":"2025-02-01T00:00:00Z","arxiv":1,"publisher":"Elsevier","department":[{"_id":"HeEd"}],"date_updated":"2025-04-15T07:16:53Z","article_type":"original","oa_version":"Preprint","intvolume":"       461","acknowledgement":"Work by the first and third authors is partially supported by the European Research Council (ERC), grant no. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. I 02979-N35. Work by the second author is partially supported by the Alexander von Humboldt Foundation.","type":"journal_article","_id":"18626","scopus_import":"1"}]