[{"year":"2026","date_created":"2026-01-20T10:04:57Z","day":"16","intvolume":" 16","_id":"21008","language":[{"iso":"eng"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"file":[{"date_updated":"2026-01-21T09:12:10Z","success":1,"creator":"dernst","file_id":"21030","file_name":"2026_ACSCatalysis_Bena.pdf","checksum":"05743d6d7b4bae37aad1a91471123032","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2026-01-21T09:12:10Z","file_size":3797064}],"corr_author":"1","issue":"2","scopus_import":"1","publication_identifier":{"eissn":["2155-5435"]},"project":[{"grant_number":"PAT 1250924","_id":"8f1d607d-16d5-11f0-9cad-ab453295ba5e","name":"Photoactive ligands for transformative nickel catalysis"}],"article_processing_charge":"Yes (via OA deal)","ddc":["540"],"department":[{"_id":"BaPi"},{"_id":"GradSch"}],"abstract":[{"lang":"eng","text":"C(sp2)–heteroatom couplings operating via NiI/NiIII catalysis have emerged as an alternative to canonical Pd0/PdII systems that require complex ligand architectures. Despite intensive research efforts during the past decade, catalytic methods employing this approach are still mostly confined to activated starting materials and require high catalyst loadings due to the low catalytic activity of NiI and undesired catalyst deactivation events. This article highlights recent advances in the field toward solving these long-standing challenges. We survey strategies that streamline the generation of catalytically competent NiI species from bench-stable NiII precatalysts, and discuss mechanistic studies that shed light on deactivation pathways and the rate-determining oxidative addition of aryl halides. In the final section, we highlight recently developed synthetic methodologies, which provide evidence that limitations can indeed be addressed by working at elevated temperatures, employing alternative electrophiles, harnessing the benefits of additives, or fine-tuning the metal’s reactivity through the ligand field."}],"type":"journal_article","article_type":"original","page":"866-881","OA_type":"hybrid","title":"Advances in NiI/NiIII-catalyzed C(sp2)–heteroatom cross-couplings","date_published":"2026-01-16T00:00:00Z","status":"public","oa_version":"Published Version","OA_place":"publisher","doi":"10.1021/acscatal.5c07964","author":[{"last_name":"Bena","id":"4197c39e-e8ec-11ed-86cb-afed934cd664","first_name":"Aleksander","full_name":"Bena, Aleksander"},{"first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Bena, Aleksander, and Bartholomäus Pieber. “Advances in NiI/NiIII-Catalyzed C(Sp2)–Heteroatom Cross-Couplings.” ACS Catalysis. American Chemical Society, 2026. https://doi.org/10.1021/acscatal.5c07964.","mla":"Bena, Aleksander, and Bartholomäus Pieber. “Advances in NiI/NiIII-Catalyzed C(Sp2)–Heteroatom Cross-Couplings.” ACS Catalysis, vol. 16, no. 2, American Chemical Society, 2026, pp. 866–81, doi:10.1021/acscatal.5c07964.","short":"A. Bena, B. Pieber, ACS Catalysis 16 (2026) 866–881.","ama":"Bena A, Pieber B. Advances in NiI/NiIII-catalyzed C(sp2)–heteroatom cross-couplings. ACS Catalysis. 2026;16(2):866-881. doi:10.1021/acscatal.5c07964","ieee":"A. Bena and B. Pieber, “Advances in NiI/NiIII-catalyzed C(sp2)–heteroatom cross-couplings,” ACS Catalysis, vol. 16, no. 2. American Chemical Society, pp. 866–881, 2026.","ista":"Bena A, Pieber B. 2026. Advances in NiI/NiIII-catalyzed C(sp2)–heteroatom cross-couplings. ACS Catalysis. 16(2), 866–881.","apa":"Bena, A., & Pieber, B. (2026). Advances in NiI/NiIII-catalyzed C(sp2)–heteroatom cross-couplings. ACS Catalysis. American Chemical Society. https://doi.org/10.1021/acscatal.5c07964"},"publisher":"American Chemical Society","file_date_updated":"2026-01-21T09:12:10Z","oa":1,"publication_status":"published","has_accepted_license":"1","acknowledgement":"We gratefully acknowledge the Institute of Science and Technology Austria for generous financial support. B.P. acknowledges the Austrian Science Fund (PAT 1250924) for funding.","PlanS_conform":"1","month":"01","quality_controlled":"1","publication":"ACS Catalysis","date_updated":"2026-01-21T09:15:16Z","volume":16},{"day":"01","_id":"21012","language":[{"iso":"eng"}],"intvolume":" 69","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"file":[{"file_size":2623108,"date_created":"2026-01-21T08:52:07Z","relation":"main_file","access_level":"open_access","checksum":"d909a9091c254b2d18ba014124663f69","content_type":"application/pdf","file_name":"2026_CommACM_Barrett.pdf","success":1,"file_id":"21028","creator":"dernst","date_updated":"2026-01-21T08:52:07Z"}],"corr_author":"1","year":"2026","date_created":"2026-01-20T10:08:21Z","article_processing_charge":"Yes (via OA deal)","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"issue":"1","scopus_import":"1","publication_identifier":{"issn":["0001-0782"],"eissn":["1557-7317"]},"ec_funded":1,"oa_version":"Published Version","OA_place":"publisher","doi":"10.1145/3737447","author":[{"first_name":"Clark","full_name":"Barrett, Clark","last_name":"Barrett"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Seshia","first_name":"Sanjit A.","full_name":"Seshia, Sanjit A."}],"publisher":"Association for Computing Machinery","citation":{"chicago":"Barrett, Clark, Thomas A Henzinger, and Sanjit A. Seshia. “Certificates in AI: Learn but Verify.” Communications of the ACM. Association for Computing Machinery, 2026. https://doi.org/10.1145/3737447.","short":"C. Barrett, T.A. Henzinger, S.A. Seshia, Communications of the ACM 69 (2026) 66–75.","mla":"Barrett, Clark, et al. “Certificates in AI: Learn but Verify.” Communications of the ACM, vol. 69, no. 1, Association for Computing Machinery, 2026, pp. 66–75, doi:10.1145/3737447.","ama":"Barrett C, Henzinger TA, Seshia SA. Certificates in AI: Learn but verify. Communications of the ACM. 2026;69(1):66-75. doi:10.1145/3737447","ieee":"C. Barrett, T. A. Henzinger, and S. A. Seshia, “Certificates in AI: Learn but verify,” Communications of the ACM, vol. 69, no. 1. Association for Computing Machinery, pp. 66–75, 2026.","ista":"Barrett C, Henzinger TA, Seshia SA. 2026. Certificates in AI: Learn but verify. Communications of the ACM. 69(1), 66–75.","apa":"Barrett, C., Henzinger, T. A., & Seshia, S. A. (2026). Certificates in AI: Learn but verify. Communications of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3737447"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-01-01T00:00:00Z","title":"Certificates in AI: Learn but verify","status":"public","article_type":"original","OA_type":"hybrid","page":"66-75","ddc":["000"],"department":[{"_id":"ToHe"}],"type":"journal_article","abstract":[{"text":"In certifiable machine learning, AI systems produce not only results but also verifiable certificates that the results can be trusted.","lang":"eng"}],"date_updated":"2026-01-21T08:55:24Z","volume":69,"month":"01","quality_controlled":"1","publication":"Communications of the ACM","acknowledgement":"T.A.H. thanks Đorde Žikelic for many stimulating discussions about CML. This work was supported in part by NSFCPS Frontier Grant 1545126, by a BAIR Commons project, by the Berkeley iCy-Phy Center, by the Stanford Center for Automated Reasoning, and by the ERC Advanced Grant 101020093.","has_accepted_license":"1","PlanS_conform":"1","file_date_updated":"2026-01-21T08:52:07Z","oa":1,"publication_status":"published"},{"project":[{"name":"Organization of CLoUdS, and implications of Tropical cyclones and for the Energetics of the tropics, in current and waRming climate","call_identifier":"H2020","_id":"629205d8-2b32-11ec-9570-e1356ff73576","grant_number":"805041"}],"article_processing_charge":"Yes","ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","scopus_import":"1","issue":"1","publication_identifier":{"eissn":["1942-2466"]},"_id":"21013","language":[{"iso":"eng"}],"intvolume":" 18","day":"12","corr_author":"1","tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"file":[{"content_type":"application/pdf","checksum":"6ea369e3b46bea58efab4f38b6c671a7","access_level":"open_access","relation":"main_file","date_created":"2026-01-21T08:39:01Z","file_size":19509786,"date_updated":"2026-01-21T08:39:01Z","creator":"dernst","file_id":"21027","success":1,"file_name":"2026_JAMES_Goswami.pdf"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"year":"2026","date_created":"2026-01-20T10:08:54Z","DOAJ_listed":"1","quality_controlled":"1","month":"01","publication":"Journal of Advances in Modeling Earth Systems","date_updated":"2026-01-21T08:41:19Z","volume":18,"oa":1,"file_date_updated":"2026-01-21T08:39:01Z","publication_status":"published","acknowledgement":"The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, Grant Agreement No. 805041). This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp). We are grateful to three anonymous reviewer(s) for their insightful suggestions that have improved the quality of our manuscript. Open Access funding provided by Institute of Science and Technology Austria/KEMÖ.","has_accepted_license":"1","PlanS_conform":"1","date_published":"2026-01-12T00:00:00Z","article_number":"e2024MS004576","title":"Convective self‐aggregation in diurnally oscillating sea surface temperature and solar forcing experiments","status":"public","doi":"10.1029/2024ms004576","oa_version":"Published Version","OA_place":"publisher","publisher":"Wiley","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"GOSWAMI BB, Lu Z, Muller CJ. 2026. Convective self‐aggregation in diurnally oscillating sea surface temperature and solar forcing experiments. Journal of Advances in Modeling Earth Systems. 18(1), e2024MS004576.","apa":"GOSWAMI, B. B., Lu, Z., & Muller, C. J. (2026). Convective self‐aggregation in diurnally oscillating sea surface temperature and solar forcing experiments. Journal of Advances in Modeling Earth Systems. Wiley. https://doi.org/10.1029/2024ms004576","ieee":"B. B. GOSWAMI, Z. Lu, and C. J. Muller, “Convective self‐aggregation in diurnally oscillating sea surface temperature and solar forcing experiments,” Journal of Advances in Modeling Earth Systems, vol. 18, no. 1. Wiley, 2026.","ama":"GOSWAMI BB, Lu Z, Muller CJ. Convective self‐aggregation in diurnally oscillating sea surface temperature and solar forcing experiments. Journal of Advances in Modeling Earth Systems. 2026;18(1). doi:10.1029/2024ms004576","short":"B.B. GOSWAMI, Z. Lu, C.J. Muller, Journal of Advances in Modeling Earth Systems 18 (2026).","mla":"GOSWAMI, BIDYUT B., et al. “Convective Self‐aggregation in Diurnally Oscillating Sea Surface Temperature and Solar Forcing Experiments.” Journal of Advances in Modeling Earth Systems, vol. 18, no. 1, e2024MS004576, Wiley, 2026, doi:10.1029/2024ms004576.","chicago":"GOSWAMI, BIDYUT B, Ziyin Lu, and Caroline J Muller. “Convective Self‐aggregation in Diurnally Oscillating Sea Surface Temperature and Solar Forcing Experiments.” Journal of Advances in Modeling Earth Systems. Wiley, 2026. https://doi.org/10.1029/2024ms004576."},"author":[{"first_name":"BIDYUT B","full_name":"GOSWAMI, BIDYUT B","last_name":"GOSWAMI","id":"3a4ac09c-6d61-11ec-bf66-884cde66b64b","orcid":"0000-0001-8602-3083"},{"full_name":"Lu, Ziyin","first_name":"Ziyin","orcid":"0009-0008-5320-7730","id":"a6e549c6-8972-11ed-ae7b-a336d97ac043","last_name":"Lu"},{"orcid":"0000-0001-5836-5350","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","last_name":"Muller","first_name":"Caroline J","full_name":"Muller, Caroline J"}],"abstract":[{"text":"We have addressed convective self‐aggregation (CSA) in steady and oscillating sea surface temperature (SST) and solar radiation (SOLIN) cloud‐resolving model simulations in a non‐rotating radiative‐convective equilibrium (RCE) framework. Our experiment designs are motivated by land‐ocean heterogeneity of atmospheric convection. The steady and oscillating forcings are idealizations of ocean and land conditions, respectively, based on their differences in heat capacities. In both kinds of simulations, the diurnal mean SST and SOLIN are the same, and both SST and SOLIN are only varied in time (i.e., they are spatially homogeneous at any given time). We find that diurnally oscillating forcing accelerates CSA. Stronger long‐wave cooling in dry regions at night and during the warm SST phase (late afternoon) both allow the long‐wave feedback, known to favor aggregation, to intensify compared to steady forcing simulations. In addition to the long‐wave, reduced short‐wave warming in dry regions (during the day) further enhances radiative cooling there compared to moist regions. Overall, the radiative cooling is enhanced in dry regions compared to neighboring moist convective regions. A dry subsidence is driven by this net radiative (short‐wave plus long‐wave) cooling, consistent with earlier work on CSA. Stronger radiative cooling allows stronger subsidence which allows low‐level circulation to more efficiently transport moisture and energy up‐gradient, driving convection to aggregate faster. We also note a sensitivity of our experimental setup to initial conditions, more so at warmer SST. This stochastic behavior might be critical in reconciling the differences of opinion regarding the response of convection aggregation to oscillating SST forcing.","lang":"eng"}],"type":"journal_article","ddc":["550"],"department":[{"_id":"CaMu"},{"_id":"BjHo"},{"_id":"GradSch"}],"OA_type":"gold","article_type":"original"},{"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"date_created":"2026-01-20T10:12:19Z","year":"2026","day":"05","intvolume":" 22","_id":"21015","language":[{"iso":"eng"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"file":[{"success":1,"file_id":"21026","creator":"dernst","date_updated":"2026-01-21T08:21:11Z","file_name":"2026_NaturePhysics_Mishra.pdf","access_level":"open_access","content_type":"application/pdf","checksum":"0ab7ac2fbcb61a364dba57152db64ed7","file_size":7335694,"date_created":"2026-01-21T08:21:11Z","relation":"main_file"}],"related_material":{"link":[{"description":"News on ISTA website","relation":"research_data","url":"https://ista.ac.at/en/news/geometry-shapes-life/"}]},"corr_author":"1","scopus_import":"1","publication_identifier":{"issn":["1745-2473"],"issnl":[" 1745-2473"],"eissn":["1745-2481"]},"ec_funded":1,"article_processing_charge":"Yes (via OA deal)","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413"},{"name":"Cytoplasmic self-organization into cell-like compartments as a common guiding principle in early animal development","_id":"917c023a-16d5-11f0-9cad-eb5cafc52090"}],"article_type":"original","OA_type":"hybrid","page":"139-150","oaworkid":1,"ddc":["570"],"department":[{"_id":"EdHa"},{"_id":"CaHe"}],"type":"journal_article","abstract":[{"text":"Early embryo geometry is one of the most invariant species-specific traits, yet its role in ensuring developmental reproducibility and robustness remains underexplored. Here we show that in zebrafish, the geometry of the fertilized egg—specifically its curvature and volume—serves as a critical initial condition triggering a cascade of events that influence development. The embryo geometry guides patterned asymmetric cell divisions in the blastoderm, generating radial gradients of cell volume and nucleocytoplasmic ratio. These gradients generate mitotic phase waves, with the nucleocytoplasmic ratio determining individual cell cycle periods independently of other cells. We demonstrate that reducing cell autonomy reshapes these waves, emphasizing the instructive role of geometry-derived volume patterns in setting the intrinsic period of the cell cycle oscillator. In addition to organizing cell cycles, early embryo geometry spatially patterns zygotic genome activation at the midblastula transition, a key step in establishing embryonic autonomy. Disrupting the embryo shape alters the zygotic genome activation pattern and causes ectopic germ layer specification, underscoring the developmental significance of geometry. Together, our findings reveal a symmetry-breaking function of early embryo geometry in coordinating cell cycle and transcriptional patterning.","lang":"eng"}],"oa_version":"Published Version","OA_place":"publisher","doi":"10.1038/s41567-025-03122-1","author":[{"last_name":"Mishra","id":"C4D70E82-1081-11EA-B3ED-9A4C3DDC885E","orcid":"0000-0002-6425-5788","first_name":"Nikhil","full_name":"Mishra, Nikhil"},{"full_name":"Li, Yuting I","first_name":"Yuting I","id":"ee7a5ca8-8b71-11ed-b662-b3341c05b7eb","last_name":"Li"},{"orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo","first_name":"Edouard B","full_name":"Hannezo, Edouard B"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J"}],"citation":{"ieee":"N. Mishra, Y. I. Li, E. B. Hannezo, and C.-P. J. Heisenberg, “Geometry-driven asymmetric cell divisions pattern cell cycles and zygotic genome activation in the zebrafish embryo,” Nature Physics, vol. 22. Springer Nature, pp. 139–150, 2026.","apa":"Mishra, N., Li, Y. I., Hannezo, E. B., & Heisenberg, C.-P. J. (2026). Geometry-driven asymmetric cell divisions pattern cell cycles and zygotic genome activation in the zebrafish embryo. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-025-03122-1","ista":"Mishra N, Li YI, Hannezo EB, Heisenberg C-PJ. 2026. Geometry-driven asymmetric cell divisions pattern cell cycles and zygotic genome activation in the zebrafish embryo. Nature Physics. 22, 139–150.","ama":"Mishra N, Li YI, Hannezo EB, Heisenberg C-PJ. Geometry-driven asymmetric cell divisions pattern cell cycles and zygotic genome activation in the zebrafish embryo. Nature Physics. 2026;22:139-150. doi:10.1038/s41567-025-03122-1","short":"N. Mishra, Y.I. Li, E.B. Hannezo, C.-P.J. Heisenberg, Nature Physics 22 (2026) 139–150.","mla":"Mishra, Nikhil, et al. “Geometry-Driven Asymmetric Cell Divisions Pattern Cell Cycles and Zygotic Genome Activation in the Zebrafish Embryo.” Nature Physics, vol. 22, Springer Nature, 2026, pp. 139–50, doi:10.1038/s41567-025-03122-1.","chicago":"Mishra, Nikhil, Yuting I Li, Edouard B Hannezo, and Carl-Philipp J Heisenberg. “Geometry-Driven Asymmetric Cell Divisions Pattern Cell Cycles and Zygotic Genome Activation in the Zebrafish Embryo.” Nature Physics. Springer Nature, 2026. https://doi.org/10.1038/s41567-025-03122-1."},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"Springer Nature","date_published":"2026-01-05T00:00:00Z","title":"Geometry-driven asymmetric cell divisions pattern cell cycles and zygotic genome activation in the zebrafish embryo","external_id":{"oaworkid":["W7118187193"]},"status":"public","has_accepted_license":"1","acknowledgement":"We thank N. Petridou (EMBL) for sharing results before publication. N.M. was supported by funding from the European Union’s Horizon 2020 programme under the Marie Skłodowska-Curie COFUND Actions ISTplus grant agreement number 754411. Y.I.L. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement number 101034413. The research was supported by funding to C.-P.H. from the NOMIS Foundation, Project ID 1.844. We would like to thank past and present members of the Heisenberg and Hannezo groups for discussions, particularly S. Shamipour, V. Doddihal, M. Jovic, N. Hino, F. N. Arslan, R. Kobylinska and C. Camelo for feedback on the draft manuscript. This research was supported by the Scientific Service Units (SSU) of Institute of Science and Technology Austria through resources provided by the Aquatics Facility, Imaging & Optics Facility (IOF), Scientific Computing (SciComp) facility and Lab Support Facility (LSF). Open access funding provided by Institute of Science and Technology (IST Austria).","PlanS_conform":"1","file_date_updated":"2026-01-21T08:21:11Z","oa":1,"publication_status":"published","date_updated":"2026-04-28T12:55:30Z","volume":22,"month":"01","quality_controlled":"1","publication":"Nature Physics"},{"year":"2026","date_created":"2026-01-20T10:14:55Z","day":"08","_id":"21018","language":[{"iso":"eng"}],"intvolume":" 5","file":[{"access_level":"open_access","checksum":"0702d8397f216555b1d5286e5d77f09c","content_type":"application/pdf","date_created":"2026-01-21T07:45:03Z","file_size":4992025,"relation":"main_file","success":1,"creator":"dernst","file_id":"21025","date_updated":"2026-01-21T07:45:03Z","file_name":"2026_LaMatematica_Brigati.pdf"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"corr_author":"1","ec_funded":1,"scopus_import":"1","publication_identifier":{"issn":["2730-9657"]},"project":[{"call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413"}],"article_processing_charge":"Yes (via OA deal)","ddc":["510"],"department":[{"_id":"JaMa"}],"type":"journal_article","abstract":[{"text":"In this paper, we review recent results on stability and instability in logarithmic Sobolev inequalities, with a particular emphasis on strong norms. We consider several versions of these inequalities on the Euclidean space, for the Lebesgue and the Gaussian measures, and discuss their differences in terms of moments and stability. We give new and direct proofs, as well as examples and discuss the stability of a logarithmic uncertainty principle. Although we do not cover all aspects of the topic, we hope to contribute to establishing the state of the art.","lang":"eng"}],"article_type":"original","OA_type":"hybrid","date_published":"2026-01-08T00:00:00Z","title":"Logarithmic Sobolev Inequalities: A review on stability and instability results","article_number":"5","external_id":{"arxiv":["2504.08658"]},"status":"public","oa_version":"Published Version","OA_place":"publisher","doi":"10.1007/s44007-025-00180-y","author":[{"first_name":"Giovanni","full_name":"Brigati, Giovanni","last_name":"Brigati","id":"63ff57e8-1fbb-11ee-88f2-f558ffc59cf1"},{"last_name":"Dolbeault","full_name":"Dolbeault, Jean","first_name":"Jean"},{"last_name":"Simonov","first_name":"Nikita","full_name":"Simonov, Nikita"}],"citation":{"ieee":"G. Brigati, J. Dolbeault, and N. Simonov, “Logarithmic Sobolev Inequalities: A review on stability and instability results,” La Matematica, vol. 5. Springer Nature, 2026.","ista":"Brigati G, Dolbeault J, Simonov N. 2026. Logarithmic Sobolev Inequalities: A review on stability and instability results. La Matematica. 5, 5.","apa":"Brigati, G., Dolbeault, J., & Simonov, N. (2026). Logarithmic Sobolev Inequalities: A review on stability and instability results. La Matematica. Springer Nature. https://doi.org/10.1007/s44007-025-00180-y","ama":"Brigati G, Dolbeault J, Simonov N. Logarithmic Sobolev Inequalities: A review on stability and instability results. La Matematica. 2026;5. doi:10.1007/s44007-025-00180-y","short":"G. Brigati, J. Dolbeault, N. Simonov, La Matematica 5 (2026).","mla":"Brigati, Giovanni, et al. “Logarithmic Sobolev Inequalities: A Review on Stability and Instability Results.” La Matematica, vol. 5, 5, Springer Nature, 2026, doi:10.1007/s44007-025-00180-y.","chicago":"Brigati, Giovanni, Jean Dolbeault, and Nikita Simonov. “Logarithmic Sobolev Inequalities: A Review on Stability and Instability Results.” La Matematica. Springer Nature, 2026. https://doi.org/10.1007/s44007-025-00180-y."},"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2026-01-21T07:45:03Z","oa":1,"publication_status":"published","has_accepted_license":"1","acknowledgement":"This work has been supported by the Project Conviviality (ANR-23-CE40–0003) of the French National Research Agency. G.B. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413. The authors thank a referee for a careful reading and suggestions which result in a significant improvement of the manuscript. Open access funding provided by Institute of Science and Technology (IST Austria). The work of GB has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413. This work has been supported by the Project Conviviality (ANR-23-CE40–0003) of the French National Research Agency.","PlanS_conform":"1","month":"01","quality_controlled":"1","arxiv":1,"publication":"La Matematica","date_updated":"2026-01-21T07:48:28Z","volume":5},{"date_created":"2026-01-25T23:01:38Z","year":"2026","tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"file":[{"date_updated":"2026-02-12T08:39:27Z","file_id":"21215","creator":"dernst","success":1,"file_name":"2026_njpClimateAtmScience_Bolot.pdf","access_level":"open_access","checksum":"c433bba3822b3c6c4a5260ad5e2429a0","content_type":"application/pdf","relation":"main_file","date_created":"2026-02-12T08:39:27Z","file_size":511226}],"language":[{"iso":"eng"}],"_id":"21035","intvolume":" 9","day":"15","publication_identifier":{"eissn":["2397-3722"]},"scopus_import":"1","ec_funded":1,"article_processing_charge":"Yes","project":[{"name":"Organization of CLoUdS, and implications of Tropical cyclones and for the Energetics of the tropics, in current and waRming climate","call_identifier":"H2020","_id":"629205d8-2b32-11ec-9570-e1356ff73576","grant_number":"805041"}],"OA_type":"gold","article_type":"original","abstract":[{"text":"According to the scientific consensus, tropical convection must decrease with global warming. This decrease is manifested by a decrease of the mass transported in the upward branch of the atmospheric overturning circulation – the convective mass flux – and a connected decrease of high clouds in the tropics, with implications for climate sensitivity. By using kilometer-scale simulations in radiative-convective equilibrium and a convective tracking algorithm, we show that no such decrease occurs in storms when taken individually and that the mass transport per storm increases instead. Storms can achieve this result by aggregating more surface of the convective cores – the inner part of the storm doing the vertical transport – so that the decrease of tropical convection is actually explained by a decrease in the total number of storms. There is little variation of the mean pressure velocity in the cores of the storms, a robust finding of this study. This remarkable invariance of the mean pressure velocity points to an emerging property of convection that should receive more attention in future studies.","lang":"eng"}],"type":"journal_article","ddc":["550"],"department":[{"_id":"CaMu"}],"citation":{"short":"M. Bolot, R. Roca, T. Fiolleau, C.J. Muller, Npj Climate and Atmospheric Science 9 (2026).","mla":"Bolot, Maximilien, et al. “No Decrease of Tropical Convection in Individual Deep Convective Systems with Global Warming.” Npj Climate and Atmospheric Science, vol. 9, 14, Springer Nature, 2026, doi:10.1038/s41612-025-01285-5.","chicago":"Bolot, Maximilien, Rémy Roca, Thomas Fiolleau, and Caroline J Muller. “No Decrease of Tropical Convection in Individual Deep Convective Systems with Global Warming.” Npj Climate and Atmospheric Science. Springer Nature, 2026. https://doi.org/10.1038/s41612-025-01285-5.","apa":"Bolot, M., Roca, R., Fiolleau, T., & Muller, C. J. (2026). No decrease of tropical convection in individual deep convective systems with global warming. Npj Climate and Atmospheric Science. Springer Nature. https://doi.org/10.1038/s41612-025-01285-5","ista":"Bolot M, Roca R, Fiolleau T, Muller CJ. 2026. No decrease of tropical convection in individual deep convective systems with global warming. npj Climate and Atmospheric Science. 9, 14.","ieee":"M. Bolot, R. Roca, T. Fiolleau, and C. J. Muller, “No decrease of tropical convection in individual deep convective systems with global warming,” npj Climate and Atmospheric Science, vol. 9. Springer Nature, 2026.","ama":"Bolot M, Roca R, Fiolleau T, Muller CJ. No decrease of tropical convection in individual deep convective systems with global warming. npj Climate and Atmospheric Science. 2026;9. doi:10.1038/s41612-025-01285-5"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","author":[{"first_name":"Maximilien","full_name":"Bolot, Maximilien","last_name":"Bolot"},{"first_name":"Rémy","full_name":"Roca, Rémy","last_name":"Roca"},{"first_name":"Thomas","full_name":"Fiolleau, Thomas","last_name":"Fiolleau"},{"first_name":"Caroline J","full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","last_name":"Muller","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"}],"doi":"10.1038/s41612-025-01285-5","pmid":1,"OA_place":"publisher","oa_version":"Published Version","status":"public","external_id":{"pmid":["41550270"]},"date_published":"2026-01-15T00:00:00Z","title":"No decrease of tropical convection in individual deep convective systems with global warming","article_number":"14","has_accepted_license":"1","acknowledgement":"We thank Sophie Cloché for her support with the handling of the various datasets. This study benefited from the IPSL mesocenter ESPRI facility which is supported by CNRS, UPMC, Labex L-IPSL, CNES and Ecole Polytechnique. The authors acknowledge the CNES and CNRS support under the Megha-Tropiques program. C.M. 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).","publication_status":"published","oa":1,"file_date_updated":"2026-02-12T08:39:27Z","volume":9,"date_updated":"2026-02-12T08:41:09Z","publication":"npj Climate and Atmospheric Science","DOAJ_listed":"1","quality_controlled":"1","month":"01"},{"oa":1,"file_date_updated":"2026-02-12T12:44:33Z","publication_status":"published","has_accepted_license":"1","acknowledgement":"The authorsthank the anonymousreferee for constructive comments, which improved the clarity of this paper. SJC acknowledges support from the ERC synergy grant 101166930 – RECAP. MG thanks the Max Planck Society for support through the Max Planck Research Group, and the European Union forsupport through ERC-2024-STG 101165038 (ReMMU). JM acknowledges funding by the European Union (ERC, AGENTS, 101076224). CAM acknowledges support\r\nby the European Union ERC grant RISES (101163035), Carlsberg Foundation (CF22-1322), and VILLUM FONDEN (37459). Computations were performed on HPC systems Freya and Orion at the Max Planck Computing and Data Facility.","PlanS_conform":"1","arxiv":1,"DOAJ_listed":"1","month":"02","quality_controlled":"1","publication":"Monthly Notices of the Royal Astronomical Society","date_updated":"2026-02-12T12:56:33Z","volume":545,"abstract":[{"lang":"eng","text":"Little Red Dots (LRDs) are compact sources at z > 5 discovered through James Webb Space Telescope spectroscopy. Their spectra exhibit broad Balmer emission lines (>~1000 km s^−1), alongside absorption features and a pronounced Balmer break – evidence for a dense, neutral hydrogen medium, in which the n = 2 state is significantly populated. When interpreted as arising\r\nfrom active galactic nucleus broad-line regions, inferred black hole masses from local scaling relations exceed expectations given their stellar masses, challenging models of early black hole–galaxy co-evolution. However, radiative transfer effects in dense media may also impact the formation of hydrogen emission lines. We model three scattering processes shaping hydrogen\r\nline profiles: resonance scattering by hydrogen in the n = 2 state, Raman scattering of ultraviolet (UV) radiation by ground-state hydrogen, and Thomson scattering by free electrons. Using 3D Monte Carlo radiative transfer simulations, we examine their imprint on line shapes and ratios. Resonance scattering produces strong deviations from Case B flux ratios, clear differences\r\nbetween Hα and Hβ, and encodes gas kinematics in line profiles but cannot broaden Hβ due to conversion to Paα. While Raman scattering can yield broad wings, scattering of the UV continuum is disfavoured given the absence of strong full width at half-maximum variations across transitions. Raman scattering of higher Lyman-series emission can produce Hα/Hβ wing\r\nwidth ratios of >~1.28, agreeing with observations. Thomson scattering can reproduce the observed >~ 1000 km s^−1 wings under plausible conditions – e.g. Te ∼ 10^4 K and Ne ∼ 10^24 cm^−2 – and lead to black hole mass overestimates by factors 10. Our results provide a framework for interpreting hydrogen lines in LRDs and similar systems."}],"type":"journal_article","ddc":["520"],"department":[{"_id":"JoMa"}],"OA_type":"gold","article_type":"original","external_id":{"arxiv":["2508.08768"]},"title":"Impact of resonance, Raman, and Thomson scattering on hydrogen line formation in Little Red Dots","date_published":"2026-02-01T00:00:00Z","article_number":"staf2131","status":"public","doi":"10.1093/mnras/staf2131","OA_place":"publisher","oa_version":"Published Version","publisher":"Oxford University Press","citation":{"ama":"Chang SJ, Gronke M, Matthee JJ, Mason C. Impact of resonance, Raman, and Thomson scattering on hydrogen line formation in Little Red Dots. Monthly Notices of the Royal Astronomical Society. 2026;545(4). doi:10.1093/mnras/staf2131","ieee":"S. J. Chang, M. Gronke, J. J. Matthee, and C. Mason, “Impact of resonance, Raman, and Thomson scattering on hydrogen line formation in Little Red Dots,” Monthly Notices of the Royal Astronomical Society, vol. 545, no. 4. Oxford University Press, 2026.","apa":"Chang, S. J., Gronke, M., Matthee, J. J., & Mason, C. (2026). Impact of resonance, Raman, and Thomson scattering on hydrogen line formation in Little Red Dots. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/staf2131","ista":"Chang SJ, Gronke M, Matthee JJ, Mason C. 2026. Impact of resonance, Raman, and Thomson scattering on hydrogen line formation in Little Red Dots. Monthly Notices of the Royal Astronomical Society. 545(4), staf2131.","chicago":"Chang, Seok Jun, Max Gronke, Jorryt J Matthee, and Charlotte Mason. “Impact of Resonance, Raman, and Thomson Scattering on Hydrogen Line Formation in Little Red Dots.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2026. https://doi.org/10.1093/mnras/staf2131.","mla":"Chang, Seok Jun, et al. “Impact of Resonance, Raman, and Thomson Scattering on Hydrogen Line Formation in Little Red Dots.” Monthly Notices of the Royal Astronomical Society, vol. 545, no. 4, staf2131, Oxford University Press, 2026, doi:10.1093/mnras/staf2131.","short":"S.J. Chang, M. Gronke, J.J. Matthee, C. Mason, Monthly Notices of the Royal Astronomical Society 545 (2026)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chang, Seok Jun","first_name":"Seok Jun","last_name":"Chang"},{"first_name":"Max","full_name":"Gronke, Max","last_name":"Gronke"},{"orcid":"0000-0003-2871-127X","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J","full_name":"Matthee, Jorryt J"},{"last_name":"Mason","first_name":"Charlotte","full_name":"Mason, Charlotte"}],"scopus_import":"1","issue":"4","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"project":[{"name":"Young galaxies as tracers and agents of cosmic reionization","grant_number":"101076224","_id":"bd9b2118-d553-11ed-ba76-db24564edfea"}],"article_processing_charge":"Yes","year":"2026","date_created":"2026-01-25T23:01:39Z","_id":"21038","intvolume":" 545","language":[{"iso":"eng"}],"day":"01","file":[{"file_name":"2026_MonthNoticesRAS_Chang.pdf","success":1,"file_id":"21220","creator":"dernst","date_updated":"2026-02-12T12:44:33Z","file_size":5600366,"date_created":"2026-02-12T12:44:33Z","relation":"main_file","checksum":"52ba7d7b5b80af0c50f57e4c2acc3930","content_type":"application/pdf","access_level":"open_access"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"}},{"volume":9,"date_updated":"2026-02-12T14:04:04Z","publication":"ACS Applied Energy Materials","quality_controlled":"1","month":"01","PlanS_conform":"1","acknowledgement":"Elettra-Sincrotrone Trieste S.C.p.A. and its staff are acknowledged for providing synchrotron radiation beamtime and laboratory facilities, in particular the MCX and XAFS beamlines, where the XRD and XAS experiments have been carried out, supported by the projects number: 20217082, 20205109, and 20195014. This study was carried out within the MOST─Sustainable Mobility Center and received funding from the European Union Next-Generation EU (PIANO NAZIONALE DI RIPRESA E RESILIENZA (PNRR)─MISSIONE 4 COMPONENTE 2, INVESTIMENTO 1.4─D.D. 1033 17/06/2022, CN00000023). Moreover, the contribution of S.B. and A.C. to this study was carried out within the NEST─Network for Energy Sustainable Transition and received funding from the European Union Next-Generation EU (PNRR─MISSIONE 4 COMPONENTE 2, INVESTIMENTO 1.3─D.D. 1561 11/10/2022, B53C22004070006). This manuscript reflects only the authors’ views and opinions, neither the European Union nor the European Commission can be considered responsible for them. Two of us, S.B. and S.A.F., would like to thank the Alistore ERI. L.S. received funds from the Ministry of Ecological Transition in the “Ricerca di Sistema Elettrico” framework. S.A.F. is indebted to ISTA for support. The Scientific Service Units of ISTA supported this research through resources provided by the Lab Support Facility and the Miba Machine Shop.","has_accepted_license":"1","publication_status":"published","oa":1,"file_date_updated":"2026-02-12T13:55:28Z","citation":{"chicago":"Busato, Matteo, Mariarosaria Tuccillo, Arcangelo Celeste, Alessandro Tofoni, Laura Silvestri, Paola D’Angelo, Stefan Alexander Freunberger, and Sergio Brutti. “Structural Rearrangements of a Cobalt-Free Lithium-Rich Layered Oxide Cathode during Formation.” ACS Applied Energy Materials. American Chemical Society, 2026. https://doi.org/10.1021/acsaem.5c03511.","short":"M. Busato, M. Tuccillo, A. Celeste, A. Tofoni, L. Silvestri, P. D’Angelo, S.A. Freunberger, S. Brutti, ACS Applied Energy Materials 9 (2026) 686–697.","mla":"Busato, Matteo, et al. “Structural Rearrangements of a Cobalt-Free Lithium-Rich Layered Oxide Cathode during Formation.” ACS Applied Energy Materials, vol. 9, no. 1, American Chemical Society, 2026, pp. 686–97, doi:10.1021/acsaem.5c03511.","ama":"Busato M, Tuccillo M, Celeste A, et al. Structural rearrangements of a Cobalt-free Lithium-rich layered oxide cathode during formation. ACS Applied Energy Materials. 2026;9(1):686-697. doi:10.1021/acsaem.5c03511","ista":"Busato M, Tuccillo M, Celeste A, Tofoni A, Silvestri L, D’Angelo P, Freunberger SA, Brutti S. 2026. Structural rearrangements of a Cobalt-free Lithium-rich layered oxide cathode during formation. ACS Applied Energy Materials. 9(1), 686–697.","apa":"Busato, M., Tuccillo, M., Celeste, A., Tofoni, A., Silvestri, L., D’Angelo, P., … Brutti, S. (2026). Structural rearrangements of a Cobalt-free Lithium-rich layered oxide cathode during formation. ACS Applied Energy Materials. American Chemical Society. https://doi.org/10.1021/acsaem.5c03511","ieee":"M. Busato et al., “Structural rearrangements of a Cobalt-free Lithium-rich layered oxide cathode during formation,” ACS Applied Energy Materials, vol. 9, no. 1. American Chemical Society, pp. 686–697, 2026."},"publisher":"American Chemical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Busato","first_name":"Matteo","full_name":"Busato, Matteo"},{"full_name":"Tuccillo, Mariarosaria","first_name":"Mariarosaria","last_name":"Tuccillo"},{"full_name":"Celeste, Arcangelo","first_name":"Arcangelo","last_name":"Celeste"},{"full_name":"Tofoni, Alessandro","first_name":"Alessandro","last_name":"Tofoni"},{"full_name":"Silvestri, Laura","first_name":"Laura","last_name":"Silvestri"},{"first_name":"Paola","full_name":"D’Angelo, Paola","last_name":"D’Angelo"},{"id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger","orcid":"0000-0003-2902-5319","full_name":"Freunberger, Stefan Alexander","first_name":"Stefan Alexander"},{"full_name":"Brutti, Sergio","first_name":"Sergio","last_name":"Brutti"}],"doi":"10.1021/acsaem.5c03511","OA_place":"publisher","oa_version":"Published Version","status":"public","title":"Structural rearrangements of a Cobalt-free Lithium-rich layered oxide cathode during formation","date_published":"2026-01-12T00:00:00Z","OA_type":"hybrid","page":"686-697","article_type":"original","type":"journal_article","abstract":[{"lang":"eng","text":"Formation during the first cycles of Li-rich layered oxide (LRLO) cathode materials consolidates the interphase and leads to structural changes that are decisive for long-term cyclability. However, the nature and effect of the changes are material-dependent and unknown for the important class of Co-free, Ni-poor LRLOs. Here, we analyze the processes during the tailored formation procedure of a typical class member, Li1.28Ni0.15Mn0.57O2, and demonstrate that it remarkably changes lattice composition and structure as a prerequisite for stable cycling. We combine electrochemistry, operando mass spectrometry, X-ray diffraction, and X-ray absorption spectroscopy with density functional theory simulations. Activation most prominently compresses the layer spacing along the c-axis and increases reversible structural breathing. The large capacity of ∼250 mAh g–1 originates from the Ni2+/Ni4+ and O2–/O– redox couples. Electron exchange during O-redox is smeared over the entire anionic sublattice rather than localized on specific oxygen atomic sites. This redox mechanism is reversible without detrimental oxygen evolution, avoiding continued degradation common in conventional LRLOs. Sequential Ni- and O-redox during activation irreversibly distorts the coordination of the redox-inactive Mn4+ centers. This structural evolution of the MnO6 octahedra appears to enable the superior electrochemical performance of this LRLO phase. These findings define an activation pathway for the important class of Co-free, Ni-poor LRLOs, offering potential guidance for the rational design of high-performance, more sustainable cathode materials."}],"department":[{"_id":"StFr"}],"ddc":["540"],"article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["2574-0962"]},"scopus_import":"1","issue":"1","corr_author":"1","file":[{"access_level":"open_access","checksum":"81272c19df41c696c1737168d3ea8c16","content_type":"application/pdf","file_size":5977526,"date_created":"2026-02-12T13:55:28Z","relation":"main_file","creator":"dernst","file_id":"21222","success":1,"date_updated":"2026-02-12T13:55:28Z","file_name":"2026_AppliedEnergyMaterials_Busato.pdf"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"21040","language":[{"iso":"eng"}],"intvolume":" 9","day":"12","date_created":"2026-01-25T23:01:40Z","year":"2026","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"LifeSc"}]},{"publication_identifier":{"eissn":["2475-1421"]},"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","date_created":"2026-01-25T23:01:40Z","year":"2026","file":[{"checksum":"79be391061efbf9542638996959ce11a","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2026-02-12T13:51:03Z","file_size":1058876,"date_updated":"2026-02-12T13:51:03Z","file_id":"21221","creator":"dernst","success":1,"file_name":"2026_ProcACMProgrammingLanguages_Mueck.pdf"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"day":"08","language":[{"iso":"eng"}],"_id":"21041","intvolume":" 10","publication_status":"published","file_date_updated":"2026-02-12T13:51:03Z","oa":1,"PlanS_conform":"1","has_accepted_license":"1","publication":"Proceedings of the ACM on Programming Languages","quality_controlled":"1","month":"01","volume":10,"date_updated":"2026-02-12T13:53:04Z","ddc":["000"],"department":[{"_id":"MiSa"}],"abstract":[{"lang":"eng","text":"It is common for programmers to assemble their programs from a combination of trusted and untrusted components. In this context, a trusted program component is said to be robustly safe if it behaves safely when linked against arbitrary untrusted code. Prior work has shown how various encapsulation mechanisms (in both high- and low-level languages) can be used to protect code so that it is robustly safe, but none of the existing work has explored how robust safety can be achieved in a patently unsafe language like C.\r\nIn this paper, we show how to bring robust safety to a simple yet representative C-like language we call Rec. Although Rec (like C) is inherently ”dangerous” and thus not robustly safe, we can ”save” Rec programs via compilation to Cap, a CHERI-like capability machine. To formalize the benefits of such a hardening compiler, we develop Reckon, a separation logic for verifying robust safety of Rec programs. Reckon is not sound under Rec’s unsafe, C-like semantics, but it is sound when Rec programs are hardened via compilation and linked against untrusted code running on Cap. As a crucial step in proving soundness of Reckon, we introduce a novel technique of semantic back-translation, which we formalize by building on the DimSum framework for multi-language semantics. All our results are mechanized in the Rocq prover."}],"type":"journal_article","article_type":"original","page":"1153-1182","OA_type":"hybrid","status":"public","title":"Endangered by the language but saved by the compiler: Robust safety via semantic back-translation","date_published":"2026-01-08T00:00:00Z","author":[{"last_name":"Mück","first_name":"Niklas","full_name":"Mück, Niklas"},{"first_name":"Aïna Linn","full_name":"Georges, Aïna Linn","last_name":"Georges"},{"last_name":"Dreyer","full_name":"Dreyer, Derek","first_name":"Derek"},{"last_name":"Garg","first_name":"Deepak","full_name":"Garg, Deepak"},{"full_name":"Sammler, Michael Joachim","first_name":"Michael Joachim","last_name":"Sammler","id":"510d3901-2a03-11ee-914d-d9ae9011f0a7"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Mück N, Georges AL, Dreyer D, Garg D, Sammler MJ. Endangered by the language but saved by the compiler: Robust safety via semantic back-translation. Proceedings of the ACM on Programming Languages. 2026;10:1153-1182. doi:10.1145/3776682","ieee":"N. Mück, A. L. Georges, D. Dreyer, D. Garg, and M. J. Sammler, “Endangered by the language but saved by the compiler: Robust safety via semantic back-translation,” Proceedings of the ACM on Programming Languages, vol. 10. Association for Computing Machinery, pp. 1153–1182, 2026.","ista":"Mück N, Georges AL, Dreyer D, Garg D, Sammler MJ. 2026. Endangered by the language but saved by the compiler: Robust safety via semantic back-translation. Proceedings of the ACM on Programming Languages. 10, 1153–1182.","apa":"Mück, N., Georges, A. L., Dreyer, D., Garg, D., & Sammler, M. J. (2026). Endangered by the language but saved by the compiler: Robust safety via semantic back-translation. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3776682","chicago":"Mück, Niklas, Aïna Linn Georges, Derek Dreyer, Deepak Garg, and Michael Joachim Sammler. “Endangered by the Language but Saved by the Compiler: Robust Safety via Semantic Back-Translation.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2026. https://doi.org/10.1145/3776682.","mla":"Mück, Niklas, et al. “Endangered by the Language but Saved by the Compiler: Robust Safety via Semantic Back-Translation.” Proceedings of the ACM on Programming Languages, vol. 10, Association for Computing Machinery, 2026, pp. 1153–82, doi:10.1145/3776682.","short":"N. Mück, A.L. Georges, D. Dreyer, D. Garg, M.J. Sammler, Proceedings of the ACM on Programming Languages 10 (2026) 1153–1182."},"publisher":"Association for Computing Machinery","OA_place":"publisher","oa_version":"Published Version","doi":"10.1145/3776682"},{"page":"307-323","OA_type":"green","department":[{"_id":"KrPi"}],"abstract":[{"lang":"eng","text":"Many blockchains such as Ethereum execute all incoming transactions sequentially significantly limiting the potential throughput. A common approach to scale execution is parallel execution engines that fully utilize modern multi-core architectures. Parallel execution is then either done optimistically, by executing transactions in parallel and detecting conflicts on the fly, or guided, by requiring exhaustive client transaction hints and scheduling transactions accordingly.\r\n\r\nHowever, recent studies have shown that the performance of parallel execution engines depends on the nature of the underlying workload. In fact, in some cases, only a 60% speed-up compared to sequential execution could be obtained. This is the case, as transactions that access the same resources must be executed sequentially. For example, if 10% of the transactions in a block access the same resource, the execution cannot meaningfully scale beyond 10 cores. Therefore, a single popular application can bottleneck the execution and limit the potential throughput.\r\n\r\nIn this paper, we introduce Anthemius, a block construction algorithm that optimizes parallel transaction execution throughput. We evaluate Anthemius exhaustively under a range of workloads, and show that Anthemius enables the underlying parallel execution engine to process over twice as many transactions."}],"type":"conference","author":[{"first_name":"Ray","full_name":"Neiheiser, Ray","orcid":"0000-0001-7227-8309","last_name":"Neiheiser","id":"f09651b9-fec0-11ec-b5d8-934aff0e52a4"},{"orcid":"0000-0002-8827-3382","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios"}],"publisher":"Springer Nature","citation":{"short":"R. Neiheiser, E. Kokoris Kogias, in:, 29th International Conference on Financial Cryptography and Data Security, Springer Nature, 2026, pp. 307–323.","mla":"Neiheiser, Ray, and Eleftherios Kokoris Kogias. “Anthemius: Efficient and Modular Block Assembly for Concurrent Execution.” 29th International Conference on Financial Cryptography and Data Security, vol. 15751, Springer Nature, 2026, pp. 307–23, doi:10.1007/978-3-032-07024-1_18.","chicago":"Neiheiser, Ray, and Eleftherios Kokoris Kogias. “Anthemius: Efficient and Modular Block Assembly for Concurrent Execution.” In 29th International Conference on Financial Cryptography and Data Security, 15751:307–23. Springer Nature, 2026. https://doi.org/10.1007/978-3-032-07024-1_18.","apa":"Neiheiser, R., & Kokoris Kogias, E. (2026). Anthemius: Efficient and modular block assembly for concurrent execution. In 29th International Conference on Financial Cryptography and Data Security (Vol. 15751, pp. 307–323). Miyakojima, Japan: Springer Nature. https://doi.org/10.1007/978-3-032-07024-1_18","ista":"Neiheiser R, Kokoris Kogias E. 2026. Anthemius: Efficient and modular block assembly for concurrent execution. 29th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 15751, 307–323.","ieee":"R. Neiheiser and E. Kokoris Kogias, “Anthemius: Efficient and modular block assembly for concurrent execution,” in 29th International Conference on Financial Cryptography and Data Security, Miyakojima, Japan, 2026, vol. 15751, pp. 307–323.","ama":"Neiheiser R, Kokoris Kogias E. Anthemius: Efficient and modular block assembly for concurrent execution. In: 29th International Conference on Financial Cryptography and Data Security. Vol 15751. Springer Nature; 2026:307-323. doi:10.1007/978-3-032-07024-1_18"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","OA_place":"repository","doi":"10.1007/978-3-032-07024-1_18","status":"public","date_published":"2026-01-01T00:00:00Z","title":"Anthemius: Efficient and modular block assembly for concurrent execution","external_id":{"arxiv":["2502.10074"]},"acknowledgement":"This work was supported by the Austrian Science Fund (FWF) SFB project SpyCoDe F8502 and the Vienna Science and Technology Fund (WWTF) project SCALE2 CT22-045.","publication_status":"published","oa":1,"volume":15751,"date_updated":"2026-02-12T13:39:07Z","publication":"29th International Conference on Financial Cryptography and Data Security","month":"01","quality_controlled":"1","arxiv":1,"conference":{"location":"Miyakojima, Japan","end_date":"2025-04-18","name":"FC: Financial Cryptography and Data Security","start_date":"2025-04-14"},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2502.10074","open_access":"1"}],"year":"2026","date_created":"2026-01-25T23:01:40Z","corr_author":"1","day":"01","language":[{"iso":"eng"}],"_id":"21042","intvolume":" 15751","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783032070234"]},"scopus_import":"1","article_processing_charge":"No","alternative_title":["LNCS"],"project":[{"_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","grant_number":"F8502","name":"Interface Theory for Security and Privacy"},{"grant_number":"ICT22-045","_id":"7bdd2f70-9f16-11ee-852c-b7950bc6d277","name":"SeCure, privAte, and interoperabLe layEr 2"}]},{"article_processing_charge":"No","alternative_title":["LNCS"],"scopus_import":"1","publication_identifier":{"isbn":["9783032070234"],"issn":["0302-9743"],"eissn":["1611-3349"]},"intvolume":" 15751","_id":"21044","language":[{"iso":"eng"}],"day":"01","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2401.16292"}],"conference":{"name":"FC: Financial Cryptography and Data Security","start_date":"2025-04-14","end_date":"2025-04-18","location":"Miyakojima, Japan"},"year":"2026","date_created":"2026-01-25T23:01:41Z","date_updated":"2026-02-16T07:56:09Z","volume":15751,"arxiv":1,"month":"01","quality_controlled":"1","publication":"29th International Conference on Financial Cryptography and Data Security","oa":1,"publication_status":"published","doi":"10.1007/978-3-032-07024-1_17","oa_version":"Preprint","OA_place":"repository","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Kniep Q, Kokoris Kogias E, Sonnino A, Zablotchi I, Zhang N. 2026. Pilotfish: Distributed execution for scalable blockchains. 29th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 15751, 287–306.","apa":"Kniep, Q., Kokoris Kogias, E., Sonnino, A., Zablotchi, I., & Zhang, N. (2026). Pilotfish: Distributed execution for scalable blockchains. In 29th International Conference on Financial Cryptography and Data Security (Vol. 15751, pp. 287–306). Miyakojima, Japan: Springer Nature. https://doi.org/10.1007/978-3-032-07024-1_17","ieee":"Q. Kniep, E. Kokoris Kogias, A. Sonnino, I. Zablotchi, and N. Zhang, “Pilotfish: Distributed execution for scalable blockchains,” in 29th International Conference on Financial Cryptography and Data Security, Miyakojima, Japan, 2026, vol. 15751, pp. 287–306.","ama":"Kniep Q, Kokoris Kogias E, Sonnino A, Zablotchi I, Zhang N. Pilotfish: Distributed execution for scalable blockchains. In: 29th International Conference on Financial Cryptography and Data Security. Vol 15751. Springer Nature; 2026:287-306. doi:10.1007/978-3-032-07024-1_17","mla":"Kniep, Quentin, et al. “Pilotfish: Distributed Execution for Scalable Blockchains.” 29th International Conference on Financial Cryptography and Data Security, vol. 15751, Springer Nature, 2026, pp. 287–306, doi:10.1007/978-3-032-07024-1_17.","short":"Q. Kniep, E. Kokoris Kogias, A. Sonnino, I. Zablotchi, N. Zhang, in:, 29th International Conference on Financial Cryptography and Data Security, Springer Nature, 2026, pp. 287–306.","chicago":"Kniep, Quentin, Eleftherios Kokoris Kogias, Alberto Sonnino, Igor Zablotchi, and Nuda Zhang. “Pilotfish: Distributed Execution for Scalable Blockchains.” In 29th International Conference on Financial Cryptography and Data Security, 15751:287–306. Springer Nature, 2026. https://doi.org/10.1007/978-3-032-07024-1_17."},"author":[{"last_name":"Kniep","full_name":"Kniep, Quentin","first_name":"Quentin"},{"first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios","orcid":"0000-0002-8827-3382","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"last_name":"Sonnino","first_name":"Alberto","full_name":"Sonnino, Alberto"},{"full_name":"Zablotchi, Igor","first_name":"Igor","last_name":"Zablotchi"},{"last_name":"Zhang","first_name":"Nuda","full_name":"Zhang, Nuda"}],"external_id":{"arxiv":["2401.16292"]},"date_published":"2026-01-01T00:00:00Z","title":"Pilotfish: Distributed execution for scalable blockchains","status":"public","page":"287-306","OA_type":"green","abstract":[{"lang":"eng","text":"Scalability is a crucial requirement for modern large-scale systems, enabling elasticity and ensuring responsiveness under varying load. While cloud systems have achieved scalable architectures, blockchain systems remain constrained by the need to over-provision validator machines to handle peak load. This leads to resource inefficiency, poor cost scaling, and limits on performance. To address these challenges, we introduce Pilotfish, the first scale-out transaction execution engine for blockchains. Pilotfish enables validators to scale horizontally by distributing transaction execution across multiple worker machines, allowing elasticity without compromising consistency or determinism. It integrates seamlessly with the lazy blockchain architecture, completing the missing piece of execution elasticity. To achieve this, Pilotfish tackles several key challenges: ensuring scalable and strongly consistent distributed transactions, handling partial crash recovery with lightweight replication, and maintaining concurrency with a novel versioned-queue scheduling algorithm. Our evaluation shows that Pilotfish scales linearly up to at least eight workers per validator for compute-bound workloads, while maintaining low latency. By solving scalable execution, Pilotfish brings blockchains closer to achieving end-to-end elasticity, unlocking new possibilities for efficient and adaptable blockchain systems."}],"type":"conference"},{"publication_status":"draft","oa":1,"date_updated":"2026-04-07T11:42:48Z","article_processing_charge":"No","publication":"arXiv","month":"01","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2504.11203"}],"date_created":"2026-01-27T14:41:44Z","department":[{"_id":"HeEd"}],"year":"2026","type":"preprint","abstract":[{"lang":"eng","text":"In this work, we introduce and study what we believe is an intriguing and, to the best of our knowledge, previously unknown connection between two areas in computational topology, topological data analysis (TDA) and knot theory. Given a function from a topological space to $\\mathbb{R}$, TDA provides tools to simplify and study the importance of topological features: in particular, the $l^{th}$-dimensional persistence diagram encodes the $l$-homology in the sublevel set as the function value increases as a set of points in the plane. Given a continuous one-parameter family of such functions, we can combine the persistence diagrams into an object known as a vineyard, which track the evolution of points in the persistence diagram. If we further restrict that family of functions to be periodic, we identify the two ends of the vineyard, yielding a closed vineyard. This allows the study of monodromy, which in this context means that following the family of functions for a period permutes the set of points in a non-trivial way. In this work, given a link and value $l$, we construct a topological space and periodic family of functions such that the closed $l$-vineyard contains this link. This shows that vineyards are topologically as rich as one could possibly hope. Importantly, it has at least two immediate consequences: First, monodromy of any periodicity can occur in a $l$-vineyard, answering a variant of a question by [Arya et al 2024]. To exhibit this, we also reformulate monodromy in a more geometric way, which may be of interest in itself. Second, distinguishing vineyards is likely to be difficult given the known difficulty of knot and link recognition, which have strong connections to many NP-hard problems."}],"author":[{"last_name":" Chambers","full_name":" Chambers, Erin","first_name":"Erin"},{"last_name":"Fillmore","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","full_name":"Fillmore, Christopher D","first_name":"Christopher D"},{"full_name":"Stephenson, Elizabeth R","first_name":"Elizabeth R","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","last_name":"Stephenson","orcid":"0000-0002-6862-208X"},{"full_name":"Wintraecken, Mathijs","first_name":"Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"mla":"Chambers, Erin, et al. “Braiding Vineyards.” ArXiv, doi:10.48550/ARXIV.2504.11203.","short":"E. Chambers, C.D. Fillmore, E.R. Stephenson, M. Wintraecken, ArXiv (n.d.).","chicago":"Chambers, Erin, Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “Braiding Vineyards.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2504.11203.","ieee":"E. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “Braiding vineyards,” arXiv. .","ista":"Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. Braiding vineyards. arXiv, 10.48550/ARXIV.2504.11203.","apa":"Chambers, E., Fillmore, C. D., Stephenson, E. R., & Wintraecken, M. (n.d.). Braiding vineyards. arXiv. https://doi.org/10.48550/ARXIV.2504.11203","ama":"Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. Braiding vineyards. arXiv. doi:10.48550/ARXIV.2504.11203"},"corr_author":"1","related_material":{"record":[{"relation":"later_version","status":"public","id":"21056"},{"relation":"dissertation_contains","status":"public","id":"21021"}]},"oa_version":"Preprint","OA_place":"repository","day":"02","doi":"10.48550/ARXIV.2504.11203","_id":"21051","language":[{"iso":"eng"}],"status":"public","title":"Braiding vineyards","date_published":"2026-01-02T00:00:00Z","external_id":{"arxiv":["2504.11203"]}},{"date_updated":"2026-02-16T08:06:23Z","quality_controlled":"1","month":"01","arxiv":1,"publication":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms","acknowledgement":"We thank the reviewers for both SODA and ATMCS for their comments, whichimproved the exposition. We thank Kate Turner for discussion and Clément Maria for pointing out thatAlexander’s theorem was already (well) known. Mathijs Wintraecken would like to express his gratitude tothe administrative support he received from University of Notre Dame during his visit and from Sophie Honnoratand Stephanie Verdonck at Inria in general.This work has been supported by the ANR grant StratMesh, ANR-24-CE48-1899, by NSF award 2444309, andthe welcome package from IDEX of the Université Côte d’Azur, ANR-15-IDEX-01.","oa":1,"publication_status":"published","OA_place":"repository","oa_version":"Preprint","doi":"10.1137/1.9781611978971.225","place":"Philadelphia, PA, United States","author":[{"first_name":"Erin W.","full_name":"Chambers, Erin W.","last_name":"Chambers"},{"first_name":"Christopher D","full_name":"Fillmore, Christopher D","last_name":"Fillmore","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425"},{"full_name":"Stephenson, Elizabeth R","first_name":"Elizabeth R","last_name":"Stephenson","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6862-208X"},{"full_name":"Wintraecken, Mathijs","first_name":"Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220"}],"citation":{"chicago":"Chambers, Erin W., Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “Braiding Vineyards.” In Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Kasper Green Larsen and Barna Saha, 6240–63. Philadelphia, PA, United States: Society for Industrial and Applied Mathematics, 2026. https://doi.org/10.1137/1.9781611978971.225.","short":"E.W. Chambers, C.D. Fillmore, E.R. Stephenson, M. Wintraecken, in:, K. Green Larsen, B. Saha (Eds.), Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, United States, 2026, pp. 6240–6263.","mla":"Chambers, Erin W., et al. “Braiding Vineyards.” Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Kasper Green Larsen and Barna Saha, Society for Industrial and Applied Mathematics, 2026, pp. 6240–63, doi:10.1137/1.9781611978971.225.","ama":"Chambers EW, Fillmore CD, Stephenson ER, Wintraecken M. Braiding Vineyards. In: Green Larsen K, Saha B, eds. Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA, United States: Society for Industrial and Applied Mathematics; 2026:6240-6263. doi:10.1137/1.9781611978971.225","ista":"Chambers EW, Fillmore CD, Stephenson ER, Wintraecken M. 2026.Braiding Vineyards. In: Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms. , 6240–6263.","apa":"Chambers, E. W., Fillmore, C. D., Stephenson, E. R., & Wintraecken, M. (2026). Braiding Vineyards. In K. Green Larsen & B. Saha (Eds.), Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 6240–6263). Philadelphia, PA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978971.225","ieee":"E. W. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “Braiding Vineyards,” in Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, K. Green Larsen and B. Saha, Eds. Philadelphia, PA, United States: Society for Industrial and Applied Mathematics, 2026, pp. 6240–6263."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Society for Industrial and Applied Mathematics","date_published":"2026-01-07T00:00:00Z","title":"Braiding Vineyards","external_id":{"arxiv":["2504.11203"]},"status":"public","editor":[{"last_name":"Green Larsen","first_name":"Kasper","full_name":"Green Larsen, Kasper"},{"first_name":"Barna","full_name":"Saha, Barna","last_name":"Saha"}],"page":"6240-6263","OA_type":"green","department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","text":"In this work, we introduce and study what we believe is an intriguing, and, to the best of our knowledge, previously unknown connection between two fundamental areas in computational topology, namely topological data analysis (TDA) and knot theory. Given a function from a topological space to ℝ, TDA provides tools to simplify and study the importance of topological features: in particular, the 𝑙^𝑡ℎ-dimensional persistence diagram encodes the topological changes (or 𝑙-homology) in the sublevel set as the function value increases into a set of points in the plane. Given a continuous one parameter family of such functions, we can combine the persistence diagrams into an object known as a vineyard, which tracks the evolution of points in the persistence diagram as the function changes. If we further restrict that family of functions to be periodic, we identify the two ends of the vineyard, yielding a closed vineyard. This allows the study of monodromy, which in this context means that following the family of functions for a period permutes the set of points in a non-trivial way. Recent work has studied monodromy in the directional persistent homology transform, demonstrating some interesting connections between an input shape and monodromy in the persistent homology transform for 0-dimensional homology embedded in ℝ^2.\r\nIn this work, given a link and a value 𝑙, we construct a topological space (based on the given link) and periodic family of functions on this space (based on the Euclidean distance function), such that the closed 𝑙-vineyard contains this link. This shows that vineyards are topologically as rich as one could possibly hope, suggesting many future directions of work. Importantly, it has at least two immediate consequences we explicitly point out:\r\n1.\tMonodromy of any periodicity can occur in a 𝑙-vineyard for any 𝑙. This answers a variant of a question by Arya and collaborators. To exhibit this as a consequence of our first main result we also reformulate monodromy in a more geometric way, which may be of interest in itself.\r\n2.\tTopologically distinguishing closed vineyards is likely to be difficult (from a complexity theory as well as from a practical perspective) because of the difficulty of knot and link recognition, which have strong connections to many NP-hard problems."}],"type":"book_chapter","article_processing_charge":"No","publication_identifier":{"eisbn":["9781611978971"]},"day":"07","language":[{"iso":"eng"}],"_id":"21056","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"21051"}]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2504.11203","open_access":"1"}],"year":"2026","date_created":"2026-01-28T12:58:16Z"},{"article_processing_charge":"No","day":"11","language":[{"iso":"eng"}],"_id":"21113","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2510.13583"}],"conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2026-04-23","location":"Rio de Janeiro, Brazil","end_date":"2026-04-27"},"date_created":"2026-01-30T08:16:25Z","year":"2026","date_updated":"2026-02-16T08:15:11Z","month":"02","arxiv":1,"publication":"The 14th International Conference on Learning Representations","has_accepted_license":"1","oa":1,"publication_status":"accepted","OA_place":"publisher","oa_version":"Published Version","author":[{"first_name":"Francesco","full_name":"Montagna, Francesco","id":"353afc8e-19f4-11f0-9db9-811f1723c83f","last_name":"Montagna"}],"citation":{"chicago":"Montagna, Francesco. “On the Identifiability of Causal Graphs with Multiple Environments.” In The 14th International Conference on Learning Representations. OpenReview, n.d.","short":"F. Montagna, in:, The 14th International Conference on Learning Representations, OpenReview, n.d.","mla":"Montagna, Francesco. “On the Identifiability of Causal Graphs with Multiple Environments.” The 14th International Conference on Learning Representations, OpenReview.","ama":"Montagna F. On the identifiability of causal graphs with multiple environments. In: The 14th International Conference on Learning Representations. OpenReview.","ieee":"F. Montagna, “On the identifiability of causal graphs with multiple environments,” in The 14th International Conference on Learning Representations, Rio de Janeiro, Brazil.","ista":"Montagna F. On the identifiability of causal graphs with multiple environments. The 14th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","apa":"Montagna, F. (n.d.). On the identifiability of causal graphs with multiple environments. In The 14th International Conference on Learning Representations. Rio de Janeiro, Brazil: OpenReview."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"OpenReview","date_published":"2026-02-11T00:00:00Z","title":"On the identifiability of causal graphs with multiple environments","external_id":{"arxiv":["2510.13583"]},"status":"public","OA_type":"gold","department":[{"_id":"FrLo"}],"ddc":["000"],"abstract":[{"text":"Causal discovery from i.i.d. observational data is known to be generally ill-posed. We demonstrate that if we have access to the distribution induced by a structural causal model, and additional data from (in the best case) only two environments that sufficiently differ in the noise statistics, the unique causal graph is identifiable. Notably, this is the first result in the literature that guarantees the entire causal graph recovery with a constant number of environments and arbitrary nonlinear mechanisms. Our only constraint is the Gaussianity of the noise terms; however, we propose potential ways to relax this requirement. Of interest on its own, we expand on the well-known duality between independent component analysis (ICA) and causal discovery; recent advancements have shown that nonlinear ICA can be solved from multiple environments, at least as many as the number of sources: we show that the same can be achieved for causal discovery while having access to much less auxiliary information.","lang":"eng"}],"type":"conference"},{"article_processing_charge":"Yes","publication_identifier":{"issn":["1553-7358"]},"scopus_import":"1","file":[{"file_name":"2026_PloSCompBio_Bleile.pdf","date_updated":"2026-02-10T07:13:06Z","file_id":"21204","success":1,"creator":"dernst","relation":"main_file","date_created":"2026-02-10T07:13:06Z","file_size":8908746,"content_type":"application/pdf","checksum":"3899d929ee9be0453c95524e49992d72","access_level":"open_access"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"corr_author":"1","related_material":{"link":[{"relation":"software","url":"https://github.com/yossibokorbleile/correa"}]},"day":"28","intvolume":" 22","_id":"21115","language":[{"iso":"eng"}],"year":"2026","date_created":"2026-01-30T10:36:32Z","volume":22,"date_updated":"2026-06-11T11:51:13Z","publication":"PLoS Computational Biology","month":"01","quality_controlled":"1","DOAJ_listed":"1","PlanS_conform":"1","acknowledgement":"We thank Stephan Huckemann, Katharine Turner, Benjamin Eltzner, Stephan Tillmann, Fariza Rashid, Vanessa Robins, and Lamiae Azizi for many useful discussions at various stages of this project. FR and PY gratefully acknowledge Matthias Weiss (Experimental Physics I, University of Bayreuth, Germany) for granting access to cell culture and laboratories, as well as funding consumables and the fruitful discussion that contributed to this work. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","has_accepted_license":"1","publication_status":"published","file_date_updated":"2026-02-10T07:13:06Z","oa":1,"author":[{"orcid":"0000-0002-4861-9174","last_name":"Bleile","id":"920a7385-7995-11ef-9bfd-8c434cd8f3c2","first_name":"Yossi","full_name":"Bleile, Yossi"},{"full_name":"Yadav, Pooja","first_name":"Pooja","last_name":"Yadav"},{"last_name":"Koehl","full_name":"Koehl, Patrice","first_name":"Patrice"},{"last_name":"Rehfeldt","first_name":"Florian","full_name":"Rehfeldt, Florian"}],"publisher":"Public Library of Science","citation":{"short":"Y. Bokor Bleile, P. Yadav, P. Koehl, F. Rehfeldt, PLoS Computational Biology 22 (2026).","mla":"Bokor Bleile, Yossi, et al. “Persistence Diagrams as Morphological Signatures of Cells: A Method to Measure and Compare Cells within a Population.” PLoS Computational Biology, vol. 22, e1013890, Public Library of Science, 2026, doi:10.1371/journal.pcbi.1013890.","chicago":"Bokor Bleile, Yossi, Pooja Yadav, Patrice Koehl, and Florian Rehfeldt. “Persistence Diagrams as Morphological Signatures of Cells: A Method to Measure and Compare Cells within a Population.” PLoS Computational Biology. Public Library of Science, 2026. https://doi.org/10.1371/journal.pcbi.1013890.","ista":"Bokor Bleile Y, Yadav P, Koehl P, Rehfeldt F. 2026. Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population. PLoS Computational Biology. 22, e1013890.","apa":"Bokor Bleile, Y., Yadav, P., Koehl, P., & Rehfeldt, F. (2026). Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1013890","ieee":"Y. Bokor Bleile, P. Yadav, P. Koehl, and F. Rehfeldt, “Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population,” PLoS Computational Biology, vol. 22. Public Library of Science, 2026.","ama":"Bokor Bleile Y, Yadav P, Koehl P, Rehfeldt F. Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population. PLoS Computational Biology. 2026;22. doi:10.1371/journal.pcbi.1013890"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","oa_version":"Published Version","doi":"10.1371/journal.pcbi.1013890","pmid":1,"status":"public","article_number":"e1013890","date_published":"2026-01-28T00:00:00Z","title":"Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population","external_id":{"pmid":["41604421"]},"article_type":"original","OA_type":"gold","department":[{"_id":"HeEd"}],"ddc":["000"],"type":"journal_article","abstract":[{"lang":"eng","text":"Quantifying cell morphology is central to understanding cellular regulation, fate, and heterogeneity, yet conventional image-based analyses often struggle with diverse or irregular shapes. We present a computational framework that uses topological data analysis to characterise and compare single-cell morphologies from fluorescence microscopy. Each cell is represented by its contour together with the position of its nucleus, from which we construct a filtration based on a radial distance function and derive a persistence diagram encoding the shape’s topological evolution. The similarity between two cells is quantified using the 2-Wasserstein distance between their diagrams, yielding a shape distance we call the PH distance. We apply this method to two representative experimental systems—primary human mesenchymal stem cells (hMSCs) and HeLa cells—and show that PH distances enable the detection of outliers in those systems, the identification of sub-populations, and the quantification of shape heterogeneity. We benchmark PH against three established contour-based distances (aspect ratio, Fourier descriptors, and elastic shape analysis) and show that PH offers better separation between cell types and greater robustness when clustering heterogeneous populations. Together, these results demonstrate that persistent-homology-based signatures provide a principled and sensitive approach for analysing cell morphology in settings where traditional geometric or image-based descriptors are insufficient."}]},{"month":"01","article_processing_charge":"No","date_updated":"2026-02-12T12:58:00Z","file_date_updated":"2026-01-30T11:00:56Z","oa":1,"has_accepted_license":"1","date_published":"2026-01-02T00:00:00Z","title":"Research Data for \"Causes and consequences of sex-chromosome turnovers in Diptera\"","status":"public","day":"2","oa_version":"Published Version","keyword":["Schizophora","sex chromosomes","sex-chromosome turnover","Diptera","genomic features","out-of-X movement."],"_id":"21116","doi":"10.15479/AT-ISTA-21116","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"author":[{"id":"02814589-eb8f-11eb-b029-a70074f3f18f","last_name":"Layana Franco","orcid":"0000-0002-1253-6297","first_name":"Lorena Alexandra","full_name":"Layana Franco, Lorena Alexandra"},{"id":"4E099E4E-F248-11E8-B48F-1D18A9856A87","last_name":"Toups","orcid":"0000-0002-9752-7380","first_name":"Melissa A","full_name":"Toups, Melissa A"},{"full_name":"Vicoso, Beatriz","first_name":"Beatriz","orcid":"0000-0002-4579-8306","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso"}],"file":[{"content_type":"text/plain","checksum":"0b79be6229f2ad9ac117ef00fc4f5c0e","access_level":"open_access","date_created":"2026-01-30T11:00:24Z","file_size":1201,"relation":"main_file","success":1,"creator":"llayanaf","file_id":"21117","date_updated":"2026-01-30T11:00:24Z","file_name":"README.txt"},{"file_name":"Supplementary_Tables.zip","date_updated":"2026-01-30T11:00:36Z","success":1,"creator":"llayanaf","file_id":"21118","relation":"main_file","date_created":"2026-01-30T11:00:36Z","file_size":572403,"access_level":"open_access","checksum":"a3cda72e4177fa1e5d3f0f6a88f8a79b","content_type":"application/zip"},{"file_name":"Supplementary_Datasets.zip","date_updated":"2026-01-30T11:00:48Z","success":1,"creator":"llayanaf","file_id":"21119","relation":"main_file","file_size":19054553,"date_created":"2026-01-30T11:00:48Z","access_level":"open_access","checksum":"efb5b64698d6ca9e7b675204f6fc1c29","content_type":"application/zip"},{"date_updated":"2026-01-30T11:00:56Z","creator":"llayanaf","success":1,"file_id":"21120","file_name":"Perl_scripts.zip","checksum":"254e050f648e9783ba8fe11adb3b49db","content_type":"application/zip","access_level":"open_access","relation":"main_file","date_created":"2026-01-30T11:00:56Z","file_size":4575}],"citation":{"ama":"Layana Franco LA, Toups MA, Vicoso B. Research Data for “Causes and consequences of sex-chromosome turnovers in Diptera.” 2026. doi:10.15479/AT-ISTA-21116","apa":"Layana Franco, L. A., Toups, M. A., & Vicoso, B. (2026). Research Data for “Causes and consequences of sex-chromosome turnovers in Diptera.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21116","ista":"Layana Franco LA, Toups MA, Vicoso B. 2026. Research Data for ‘Causes and consequences of sex-chromosome turnovers in Diptera’, Institute of Science and Technology Austria, 10.15479/AT-ISTA-21116.","ieee":"L. A. Layana Franco, M. A. Toups, and B. Vicoso, “Research Data for ‘Causes and consequences of sex-chromosome turnovers in Diptera.’” Institute of Science and Technology Austria, 2026.","chicago":"Layana Franco, Lorena Alexandra, Melissa A Toups, and Beatriz Vicoso. “Research Data for ‘Causes and Consequences of Sex-Chromosome Turnovers in Diptera.’” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21116.","mla":"Layana Franco, Lorena Alexandra, et al. Research Data for “Causes and Consequences of Sex-Chromosome Turnovers in Diptera.” Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21116.","short":"L.A. Layana Franco, M.A. Toups, B. Vicoso, (2026)."},"corr_author":"1","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","publisher":"Institute of Science and Technology Austria","year":"2026","department":[{"_id":"BeVi"}],"date_created":"2026-01-30T11:04:14Z","type":"research_data","abstract":[{"text":"Sex-chromosome systems are highly variable across animals, but how they transition from one to another is not well understood. Diptera have undergone multiple sex-chromosome turnovers and expansions while maintaining their general chromosomal content, which makes them an ideal clade to study such transitions. We analyzed more than 100 dipteran whole-genome assemblies and identified 4 new lineages that underwent sex-chromosome turnover (in addition to the 5 previously reported). We find that the majority of turnovers happened in the group Schizophora, which tend to have fewer genes on Muller element F (the chromosome homologous to the ancestral insect X chromosome) than lower dipterans, a factor previously hypothesized to facilitate turnover. Most derived X chromosomes have higher GC content than autosomes, consistent with a high prevalence of male achiasmy in Diptera. In addition, an excess of gene movement out of the X is detected for most of these new X chromosomes, and many of these moved genes have high testis expression in Drosophila, suggesting that out-of-X gene movement contributes to the long-term demasculinization of X chromosomes.","lang":"eng"}]},{"date_updated":"2026-02-16T08:43:24Z","publication":"Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs","quality_controlled":"1","month":"01","has_accepted_license":"1","acknowledgement":"We thank the anonymous reviewers for their insightful suggestions. This research is supported in part by generous awards from Android Security’s ASPIRE program and from Google Research. The third author is supported, in part, by ERC grant COCONUT (grant no. 101171349), funded by the European Union. Views and opinions expressed are however those of the author(s) 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.","publication_status":"published","file_date_updated":"2026-02-16T08:40:29Z","oa":1,"author":[{"full_name":"Elbeheiry, Laila","first_name":"Laila","last_name":"Elbeheiry"},{"first_name":"Michael Joachim","full_name":"Sammler, Michael Joachim","last_name":"Sammler","id":"510d3901-2a03-11ee-914d-d9ae9011f0a7"},{"first_name":"Robbert","full_name":"Krebbers, Robbert","last_name":"Krebbers"},{"last_name":"Dreyer","full_name":"Dreyer, Derek","first_name":"Derek"},{"last_name":"Garg","full_name":"Garg, Deepak","first_name":"Deepak"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Association for Computing Machinery","citation":{"apa":"Elbeheiry, L., Sammler, M. J., Krebbers, R., Dreyer, D., & Garg, D. (2026). A recipe for modular verification of generic tree traversals. In Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. 339–352). Rennes, France: Association for Computing Machinery. https://doi.org/10.1145/3779031.3779110","ista":"Elbeheiry L, Sammler MJ, Krebbers R, Dreyer D, Garg D. 2026. A recipe for modular verification of generic tree traversals. Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs. CPP: Conference on Certified Programs and Proofs, 339–352.","ieee":"L. Elbeheiry, M. J. Sammler, R. Krebbers, D. Dreyer, and D. Garg, “A recipe for modular verification of generic tree traversals,” in Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, Rennes, France, 2026, pp. 339–352.","ama":"Elbeheiry L, Sammler MJ, Krebbers R, Dreyer D, Garg D. A recipe for modular verification of generic tree traversals. In: Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs. Association for Computing Machinery; 2026:339-352. doi:10.1145/3779031.3779110","short":"L. Elbeheiry, M.J. Sammler, R. Krebbers, D. Dreyer, D. Garg, in:, Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, Association for Computing Machinery, 2026, pp. 339–352.","mla":"Elbeheiry, Laila, et al. “A Recipe for Modular Verification of Generic Tree Traversals.” Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, Association for Computing Machinery, 2026, pp. 339–52, doi:10.1145/3779031.3779110.","chicago":"Elbeheiry, Laila, Michael Joachim Sammler, Robbert Krebbers, Derek Dreyer, and Deepak Garg. “A Recipe for Modular Verification of Generic Tree Traversals.” In Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, 339–52. Association for Computing Machinery, 2026. https://doi.org/10.1145/3779031.3779110."},"OA_place":"publisher","oa_version":"Published Version","doi":"10.1145/3779031.3779110","status":"public","title":"A recipe for modular verification of generic tree traversals","date_published":"2026-01-08T00:00:00Z","OA_type":"gold","page":"339-352","department":[{"_id":"MiSa"}],"ddc":["000"],"abstract":[{"lang":"eng","text":"Data structures based on trees and tree traversals are ubiquitous in computer systems. Many low-level programs, including some implementations of critical systems like page tables and the web browser DOM, rely on generic tree-traversal functions that traverse tree nodes in a pre-determined order, applying a client-provided operation to each visited node. Developing a general approach to specifying and verifying such traversals is tricky since the client-provided per-node operation can be stateful and may potentially depend on or modify the structure of the tree being traversed.\r\nIn this paper, we present a recipe for (semi-)automated verification of such generic, stateful tree traversals. Our recipe is (a) general: it applies to a range of tree traversals, in particular, pre-, post- and in-order depth-first traversals; (b) modular: parts of a traversal’s proof can be reused in verifying other similar traversals; (c) expressive: using the specification of a tree traversal, we can verify clients that use the traversal in a variety of different ways; and (d) automatable: many proof obligations can be discharged automatically.\r\nAt the heart of our recipe is a novel use of tree zippers to represent a logical abstraction of the tree traversal state, and zipper transitions as an abstraction of traversal steps. We realize our recipe in the RefinedC framework in Rocq, which allows us to verify a number of different tree traversals and their clients written in C."}],"type":"conference","article_processing_charge":"No","publication_identifier":{"isbn":["9798400723414"]},"scopus_import":"1","file":[{"date_created":"2026-02-16T08:40:29Z","file_size":811872,"relation":"main_file","access_level":"open_access","checksum":"7df99991493e907d83a197151f378e3e","content_type":"application/pdf","file_name":"2026_CPP_Elbeheiry.pdf","success":1,"creator":"dernst","file_id":"21225","date_updated":"2026-02-16T08:40:29Z"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"day":"08","_id":"21133","language":[{"iso":"eng"}],"conference":{"name":"CPP: Conference on Certified Programs and Proofs","start_date":"2026-01-12","end_date":"2026-01-13","location":"Rennes, France"},"date_created":"2026-02-01T23:01:43Z","year":"2026"},{"quality_controlled":"1","month":"01","arxiv":1,"publication":"29th International Conference on Financial Cryptography and Data Security","date_updated":"2026-04-15T08:45:18Z","volume":15752,"oa":1,"publication_status":"published","acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/F85.","title":"On the (in)security of Proofs-of-space based longest-chain blockchains","date_published":"2026-01-01T00:00:00Z","external_id":{"arxiv":["2505.14891"]},"status":"public","oa_version":"Preprint","OA_place":"repository","doi":"10.1007/978-3-032-07035-7_8","author":[{"last_name":"Baig","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","first_name":"Mirza Ahad","full_name":"Baig, Mirza Ahad"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","citation":{"chicago":"Baig, Mirza Ahad, and Krzysztof Z Pietrzak. “On the (in)Security of Proofs-of-Space Based Longest-Chain Blockchains.” In 29th International Conference on Financial Cryptography and Data Security, 15752:127–42. Springer Nature, 2026. https://doi.org/10.1007/978-3-032-07035-7_8.","short":"M.A. Baig, K.Z. Pietrzak, in:, 29th International Conference on Financial Cryptography and Data Security, Springer Nature, 2026, pp. 127–142.","mla":"Baig, Mirza Ahad, and Krzysztof Z. Pietrzak. “On the (in)Security of Proofs-of-Space Based Longest-Chain Blockchains.” 29th International Conference on Financial Cryptography and Data Security, vol. 15752, Springer Nature, 2026, pp. 127–42, doi:10.1007/978-3-032-07035-7_8.","ama":"Baig MA, Pietrzak KZ. On the (in)security of Proofs-of-space based longest-chain blockchains. In: 29th International Conference on Financial Cryptography and Data Security. Vol 15752. Springer Nature; 2026:127-142. doi:10.1007/978-3-032-07035-7_8","ieee":"M. A. Baig and K. Z. Pietrzak, “On the (in)security of Proofs-of-space based longest-chain blockchains,” in 29th International Conference on Financial Cryptography and Data Security, Miyakojima, Japan, 2026, vol. 15752, pp. 127–142.","ista":"Baig MA, Pietrzak KZ. 2026. On the (in)security of Proofs-of-space based longest-chain blockchains. 29th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 15752, 127–142.","apa":"Baig, M. A., & Pietrzak, K. Z. (2026). On the (in)security of Proofs-of-space based longest-chain blockchains. In 29th International Conference on Financial Cryptography and Data Security (Vol. 15752, pp. 127–142). Miyakojima, Japan: Springer Nature. https://doi.org/10.1007/978-3-032-07035-7_8"},"department":[{"_id":"KrPi"}],"abstract":[{"text":"The Nakamoto consensus protocol underlying the Bitcoin blockchain uses proof of work as a voting mechanism. Honest miners who contribute hashing power towards securing the chain try to extend the longest chain they are aware of. Despite its simplicity, Nakamoto consensus achieves meaningful security guarantees assuming that at any point in time, a majority of the hashing power is controlled by honest parties. This also holds under “resource variability”, i.e., if the total hashing power varies greatly over time.\r\nProofs of space (PoSpace) have been suggested as a more sustainable replacement for proofs of work. Unfortunately, no construction of a “longest-chain” blockchain based on PoSpace, that is secure under dynamic availability, is known. In this work, we prove that without additional assumptions no such protocol exists. We exactly quantify this impossibility result by proving a bound on the length of the fork required for double spending as a function of the adversarial capabilities. This bound holds for any chain selection rule, and we also show a chain selection rule (albeit a very strange one) that almost matches this bound.\r\nThe Nakamoto consensus protocol underlying the Bitcoin blockchain uses proof of work as a voting mechanism. Honest miners who contribute hashing power towards securing the chain try to extend the longest chain they are aware of. Despite its simplicity, Nakamoto consensus achieves meaningful security guarantees assuming that at any point in time, a majority of the hashing power is controlled by honest parties. This also holds under “resource variability”, i.e., if the total hashing power varies greatly over time.\r\n\r\nProofs of space (PoSpace) have been suggested as a more sustainable replacement for proofs of work. Unfortunately, no construction of a “longest-chain” blockchain based on PoSpace, that is secure under dynamic availability, is known. In this work, we prove that without additional assumptions no such protocol exists. We exactly quantify this impossibility result by proving a bound on the length of the fork required for double spending as a function of the adversarial capabilities. This bound holds for any chain selection rule, and we also show a chain selection rule (albeit a very strange one) that almost matches this bound.\r\n\r\nConcretely, we consider a security game in which the honest parties at any point control 0 > 1\r\n times more space than the adversary. The adversary can change the honest space by a factor 1+- E with every block (dynamic availability), and “replotting” the space (which allows answering two challenges using the same space) takes as much time as p blocks.\r\nWe prove that no matter what chain selection rule is used, in this game the adversary can create a fork of length o^2 . p/E that will be picked as the winner by the chain selection rule.\r\nWe also provide an upper bound that matches the lower bound up to a factor o. There exists a chain selection rule (albeit a very strange one) which in the above game requires forks of length at least o . p/E\r\nOur results show the necessity of additional assumptions to create a secure PoSpace based longest-chain blockchain. The Chia network in addition to PoSpace uses a verifiable delay function. Our bounds show that an additional primitive like that is necessary.","lang":"eng"}],"type":"conference","page":"127-142","OA_type":"green","project":[{"name":"Security and Privacy by Design for Complex Systems","_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1","grant_number":"F8509"}],"alternative_title":["LNCS"],"article_processing_charge":"No","scopus_import":"1","publication_identifier":{"issn":["0302-9743"],"isbn":["9783032070340"],"eissn":["1611-3349"]},"day":"01","_id":"21134","language":[{"iso":"eng"}],"intvolume":" 15752","related_material":{"record":[{"id":"21651","status":"public","relation":"dissertation_contains"}]},"corr_author":"1","date_created":"2026-02-01T23:01:43Z","year":"2026","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2505.14891","open_access":"1"}],"conference":{"name":"FC: Financial Cryptography and Data Security","start_date":"2025-04-14","end_date":"2025-04-18","location":"Miyakojima, Japan"}},{"related_material":{"link":[{"url":"https://github.com/jakobtroidl/niiv-miccai","relation":"software"}]},"day":"03","_id":"21135","language":[{"iso":"eng"}],"intvolume":" 16318","year":"2026","date_created":"2026-02-01T23:01:44Z","conference":{"end_date":"2025-09-23","location":"Daejeon, South Korea","name":"EMA4MICCAI: Efficient Medical Artificial Intelligence","start_date":"2025-09-23"},"main_file_link":[{"url":"https://doi.org/10.1101/2024.09.07.611785","open_access":"1"}],"alternative_title":["LNCS"],"article_processing_charge":"No","publication_identifier":{"issn":["0302-9743"],"isbn":["9783032139603"],"eissn":["1611-3349"]},"scopus_import":"1","status":"public","date_published":"2026-01-03T00:00:00Z","title":"niiv: Interactive Self-supervised Neural Implicit Isotropic Volume Reconstruction","author":[{"last_name":"Troidl","first_name":"Jakob","full_name":"Troidl, Jakob"},{"last_name":"Liang","full_name":"Liang, Yiqing","first_name":"Yiqing"},{"last_name":"Beyer","first_name":"Johanna","full_name":"Beyer, Johanna"},{"first_name":"Mojtaba","full_name":"Tavakoli, Mojtaba","orcid":"0000-0002-7667-6854","last_name":"Tavakoli","id":"3A0A06F4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Johann G","full_name":"Danzl, Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","last_name":"Danzl","orcid":"0000-0001-8559-3973"},{"last_name":"Hadwiger","full_name":"Hadwiger, Markus","first_name":"Markus"},{"last_name":"Pfister","first_name":"Hanspeter","full_name":"Pfister, Hanspeter"},{"first_name":"James","full_name":"Tompkin, James","last_name":"Tompkin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","citation":{"chicago":"Troidl, Jakob, Yiqing Liang, Johanna Beyer, Mojtaba Tavakoli, Johann G Danzl, Markus Hadwiger, Hanspeter Pfister, and James Tompkin. “Niiv: Interactive Self-Supervised Neural Implicit Isotropic Volume Reconstruction.” In 1st International Workshop on Efficient Medical Artificial Intelligence, 16318:257–67. Springer Nature, 2026. https://doi.org/10.1007/978-3-032-13961-0_26.","short":"J. Troidl, Y. Liang, J. Beyer, M. Tavakoli, J.G. Danzl, M. Hadwiger, H. Pfister, J. Tompkin, in:, 1st International Workshop on Efficient Medical Artificial Intelligence, Springer Nature, 2026, pp. 257–267.","mla":"Troidl, Jakob, et al. “Niiv: Interactive Self-Supervised Neural Implicit Isotropic Volume Reconstruction.” 1st International Workshop on Efficient Medical Artificial Intelligence, vol. 16318, Springer Nature, 2026, pp. 257–67, doi:10.1007/978-3-032-13961-0_26.","ama":"Troidl J, Liang Y, Beyer J, et al. niiv: Interactive Self-supervised Neural Implicit Isotropic Volume Reconstruction. In: 1st International Workshop on Efficient Medical Artificial Intelligence. Vol 16318. Springer Nature; 2026:257-267. doi:10.1007/978-3-032-13961-0_26","apa":"Troidl, J., Liang, Y., Beyer, J., Tavakoli, M., Danzl, J. G., Hadwiger, M., … Tompkin, J. (2026). niiv: Interactive Self-supervised Neural Implicit Isotropic Volume Reconstruction. In 1st International Workshop on Efficient Medical Artificial Intelligence (Vol. 16318, pp. 257–267). Daejeon, South Korea: Springer Nature. https://doi.org/10.1007/978-3-032-13961-0_26","ista":"Troidl J, Liang Y, Beyer J, Tavakoli M, Danzl JG, Hadwiger M, Pfister H, Tompkin J. 2026. niiv: Interactive Self-supervised Neural Implicit Isotropic Volume Reconstruction. 1st International Workshop on Efficient Medical Artificial Intelligence. EMA4MICCAI: Efficient Medical Artificial Intelligence, LNCS, vol. 16318, 257–267.","ieee":"J. Troidl et al., “niiv: Interactive Self-supervised Neural Implicit Isotropic Volume Reconstruction,” in 1st International Workshop on Efficient Medical Artificial Intelligence, Daejeon, South Korea, 2026, vol. 16318, pp. 257–267."},"oa_version":"Preprint","OA_place":"repository","doi":"10.1007/978-3-032-13961-0_26","department":[{"_id":"JoDa"}],"type":"conference","abstract":[{"text":"Three-dimensional (3D) microscopy data is often anisotropic with significantly lower resolution (up to 8x) along the z axis than along the xy axes. Computationally generating plausible isotropic resolution from anisotropic imaging data would benefit the visual analysis of large-scale volumes. This paper proposes niiv, a self-supervised method for isotropic reconstruction of 3D microscopy data that can quickly produce images at arbitrary output resolutions. The representation embeds a learned latent code within a neural field that describes the implicit higher-resolution isotropic image region. We use an attention-guided latent interpolation approach, which allows flexible information exchange over a local latent neighborhood. Under isotropic volume assumptions, we self-supervise this representation on low-/high-resolution lateral image pairs to reconstruct an isotropic volume from low-resolution axial images. We evaluate our method on simulated and real anisotropic electron (EM) and light microscopy (LM) data. Compared to diffusion-based baselines, niiv shows improved reconstruction quality (+1 dB PSNR) and is over three orders of magnitude faster (1,000x) to infer. Specifically, niiv reconstructs a 128^3 voxel volume in 2/10th of a second, renderable at varying (continuous) high resolutions for display. Our code is available at https://github.com/jakobtroidl/niiv-miccai.","lang":"eng"}],"page":"257-267","OA_type":"green","publication":"1st International Workshop on Efficient Medical Artificial Intelligence","month":"01","quality_controlled":"1","volume":16318,"date_updated":"2026-02-16T08:50:50Z","publication_status":"published","oa":1,"acknowledgement":"This work was supported by NIH grants 1U01NS132158 and R01HD104969. We thank the reviewers for their constructive feedback."},{"doi":"10.15479/AT-ISTA-21137","_id":"21137","OA_place":"repository","day":"24","oa_version":"Published Version","corr_author":"1","citation":{"chicago":"Naik, Suyash. “Data Associated with Keratins Coordinate Tissue Spreading .” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21137.","mla":"Naik, Suyash. Data Associated with Keratins Coordinate Tissue Spreading . Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21137.","short":"S. Naik, (2026).","ama":"Naik S. Data associated with Keratins coordinate tissue spreading . 2026. doi:10.15479/AT-ISTA-21137","apa":"Naik, S. (2026). Data associated with Keratins coordinate tissue spreading . Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21137","ista":"Naik S. 2026. Data associated with Keratins coordinate tissue spreading , Institute of Science and Technology Austria, 10.15479/AT-ISTA-21137.","ieee":"S. Naik, “Data associated with Keratins coordinate tissue spreading .” Institute of Science and Technology Austria, 2026."},"publisher":"Institute of Science and Technology Austria","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","file":[{"access_level":"open_access","content_type":"application/zip","checksum":"5d1fda7e410f24c311fcf6bcf725698f","date_created":"2026-03-16T11:51:10Z","file_size":725916,"description":"Python3 library written in C++20 to integrate vertex models. Please read the readme at https://github.com/yketa/cells/blob/main/README.md for detailed instructions for installation and usage of the code in this repository. ","relation":"main_file","file_id":"21461","creator":"snaik","date_updated":"2026-03-16T11:51:10Z","file_name":"cells-main.zip","title":"Cell git repository"},{"file_size":282168895,"date_created":"2026-03-18T14:52:02Z","relation":"main_file","access_level":"open_access","checksum":"ee350c8eaed99f3ca348c47c8b190d3c","content_type":"application/x-zip-compressed","file_name":"DevBranchDataRepo.zip","success":1,"file_id":"21464","creator":"snaik","date_updated":"2026-03-18T14:52:02Z"},{"success":1,"creator":"snaik","file_id":"21466","date_updated":"2026-03-18T15:01:32Z","file_name":"ReadMe.md","access_level":"open_access","content_type":"text/markdown","checksum":"1ecaf2c1a2ce8ff9c75a128cc02d0b8f","file_size":2231,"date_created":"2026-03-18T15:01:32Z","relation":"main_file"},{"file_name":"PaperSchematics.svg","file_id":"21467","creator":"snaik","success":1,"date_updated":"2026-03-18T15:12:57Z","file_size":1951210,"date_created":"2026-03-18T15:12:57Z","relation":"main_file","access_level":"open_access","checksum":"da9a4687e5144b61a64ca341f922046a","content_type":"image/svg+xml"},{"file_name":"maxwell_sketch.tex","creator":"snaik","success":1,"file_id":"21468","date_updated":"2026-03-21T03:37:43Z","file_size":1897,"date_created":"2026-03-21T03:37:43Z","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","checksum":"9ac1054b16c212c6f34d402dce2c80e0"},{"relation":"main_file","file_size":749368723,"date_created":"2026-03-24T07:21:43Z","access_level":"open_access","content_type":"application/x-zip-compressed","checksum":"7c9ecf78e2593b3830d96fa94baa08df","file_name":"DataRepo.zip","date_updated":"2026-03-24T07:21:43Z","creator":"snaik","file_id":"21495","success":1}],"tmp":{"short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"author":[{"orcid":"0000-0001-8421-5508","id":"2C0B105C-F248-11E8-B48F-1D18A9856A87","last_name":"Naik","full_name":"Naik, Suyash","first_name":"Suyash"}],"title":"Data associated with Keratins coordinate tissue spreading ","date_published":"2026-03-24T00:00:00Z","status":"public","acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"type":"research_data","date_created":"2026-02-04T16:38:02Z","year":"2026","department":[{"_id":"GradSch"},{"_id":"CaHe"},{"_id":"EdHa"}],"article_processing_charge":"No","date_updated":"2026-06-10T09:44:10Z","contributor":[{"last_name":"Keta","first_name":"Yann-Edwin","contributor_type":"researcher"},{"first_name":"Silke ","contributor_type":"supervisor","last_name":"Henkes"},{"first_name":"Carl-Philipp J","contributor_type":"supervisor","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","orcid":"0000-0002-0912-4566"},{"last_name":"Hannezo","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6005-1561","first_name":"Edouard B","contributor_type":"supervisor"}],"project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"name":"Keratins in epithelial tissue spreading","grant_number":"PAT 5044023","_id":"8f060199-16d5-11f0-9cad-f3253b266c46"},{"call_identifier":"FWF","name":"Nano-Analytics of Cellular Systems","_id":"252C3B08-B435-11E9-9278-68D0E5697425","grant_number":"W1250-B20"}],"month":"3","acknowledgement":"We thank all members of the Heisenberg, Henkes, and Hannezo groups for their support. We are also grateful to the Imaging and Optics, Scientific Computing, Life Science Support, and Cryo-Electron Microscopy facilities at ISTA for their technical assistance and support. Numerical simulations were performed using the computational resources from Lorentz Institute and the Academic Leiden Interdisciplinary Cluster Environment (ALICE) provided by Leiden University, and from PMMH provided by Sorbonne Université. S.N has received funding from European Union’s Horizon 2020 research and innovation programme (grant agreement No. 665385). This work was supported by the Austrian Science Fund (FWF) under projects PAT5044023 and W1250 awarded to C.-P.H.","has_accepted_license":"1","oa":1,"file_date_updated":"2026-03-24T07:21:43Z","ec_funded":1}]