[{"intvolume":"       114","language":[{"iso":"eng"}],"type":"journal_article","OA_type":"closed access","date_published":"2026-05-20T00:00:00Z","supplementarymaterial":"no","researchdata_availability":"no","das_tickbox":"0","quality_controlled":"1","citation":{"mla":"Bhattacharya, Subhodeep, and Peter M. Jonas. “Mission Impossible? Quantitative Analysis of Dendritic Computations in Vivo.” <i>Neuron</i>, vol. 114, no. 10, Elsevier, 2026, pp. 1706–08, doi:<a href=\"https://doi.org/10.1016/j.neuron.2026.04.002\">10.1016/j.neuron.2026.04.002</a>.","short":"S. Bhattacharya, P.M. Jonas, Neuron 114 (2026) 1706–1708.","apa":"Bhattacharya, S., &#38; Jonas, P. M. (2026). Mission impossible? Quantitative analysis of dendritic computations in vivo. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2026.04.002\">https://doi.org/10.1016/j.neuron.2026.04.002</a>","chicago":"Bhattacharya, Subhodeep, and Peter M Jonas. “Mission Impossible? Quantitative Analysis of Dendritic Computations in Vivo.” <i>Neuron</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.neuron.2026.04.002\">https://doi.org/10.1016/j.neuron.2026.04.002</a>.","ista":"Bhattacharya S, Jonas PM. 2026. Mission impossible? Quantitative analysis of dendritic computations in vivo. Neuron. 114(10), 1706–1708.","ama":"Bhattacharya S, Jonas PM. Mission impossible? Quantitative analysis of dendritic computations in vivo. <i>Neuron</i>. 2026;114(10):1706-1708. doi:<a href=\"https://doi.org/10.1016/j.neuron.2026.04.002\">10.1016/j.neuron.2026.04.002</a>","ieee":"S. Bhattacharya and P. M. Jonas, “Mission impossible? Quantitative analysis of dendritic computations in vivo,” <i>Neuron</i>, vol. 114, no. 10. Elsevier, pp. 1706–1708, 2026."},"date_updated":"2026-07-14T06:39:59Z","corr_author":"1","department":[{"_id":"PeJo"}],"date_created":"2026-07-13T10:51:27Z","status":"public","publication_identifier":{"issn":["0896-6273"]},"article_processing_charge":"No","day":"20","author":[{"first_name":"Subhodeep","last_name":"Bhattacharya","id":"45f74010-66f6-11f0-a7d4-c441fa3685ff","full_name":"Bhattacharya, Subhodeep","orcid":"0009-0009-0334-9068"},{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M"}],"article_type":"letter_note","publisher":"Elsevier","external_id":{"pmid":["42161246"]},"month":"05","page":"1706-1708","pmid":1,"publication_status":"published","_id":"22305","issue":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Active dendrites enrich the repertoire of single-neuron computations. Whereas a lot is known about the function of dendrites in vitro, information about their in vivo properties is limited. A new study1 uses advanced imaging to study hippocampal CA1 pyramidal neuron dendrites in head-fixed, awake animals."}],"doi":"10.1016/j.neuron.2026.04.002","scopus_import":"1","volume":114,"title":"Mission impossible? Quantitative analysis of dendritic computations in vivo","publication":"Neuron","oa_version":"None","year":"2026"},{"month":"07","OA_place":"publisher","acknowledgement":"We thank all members of the Heisenberg group for discussion and feedback on the manuscript, and the Imaging and Optics Facility, the Life Science Support Facility and the Electron Microscopy Facility of the Institute of Science and Technology Austria (ISTA) for their continued support. We are grateful to M. Sonawane (Tata Institute of Fundamental Research, India) for providing the pCS2-HA-aPKC (PKCι)-V260F (DN) and pCS2-HA-aPKC (PKCι)-A122E (CA) plasmids, and to I. Mayer for the discussion. Molecular graphics and analyses were performed with UCSF ChimeraX, developed by the Resource for Biocomputing, Visualization, and Informatics at the University of California, San Francisco, with support from National Institutes of Health R01-GM129325 and the Office of Cyber Infrastructure and Computational Biology, National Institute of Allergy and Infectious Diseases. This research was funded in whole or in part by the Austrian Science Fund (FWF; grant no. PAT5044023) to C.-P.H., and by a JSPS Overseas Research Fellowship and an EMBO Postdoctoral Fellowship (ALTF 16-2022) to N.H.","_id":"22276","license":"https://creativecommons.org/licenses/by/4.0/","publication_status":"draft","abstract":[{"text":"Tissue tension is a key determinant of tissue shape, and its regulation is essential for both morphogenesis and the maintenance of tissue integrity. During zebrafish embryogenesis, the enveloping layer (EVL) – an epithelial monolayer covering the blastoderm – undergoes extensive spreading that is driven by pulling forces exerted at its margin and more than doubles its surface area. Yet whether and how the EVL actively regulates its tissue tension during this process remains unclear. Here, we show that the EVL maintains constant tissue tension while spreading, and that it achieves this by reducing apical cell contractility in response to the same pulling forces that drive its spreading. We identify a mechanosensitive pathway underlying this response, mediated by the scaffold/adaptor protein Kibra regulating the activity of atypical protein kinase C (aPKC) at the apical domain of EVL cells. Under low mechanical stretch, Kibra forms condensates at the base of actin-based apical projections, where it activates Myosin II to increase apical contractility through aPKC downregulation. As mechanical stretch increases, apical projections disassemble, Kibra condensates dissolve, and aPKC activity rises. Elevated aPKC activity in turn reduces apical contractility by reducing Myosin II activity, thereby maintaining constant tissue tension despite increased mechanical stretch. Together, these findings reveal a mechanosensitive mechanism that enables robust adaptation of tissue tension to changing mechanical stretch, ensuring efficient tissue spreading and morphogenesis.","lang":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"EM-Fac"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["Epithelial spreading","tissue tension","mechanosensation","aPKC","Kibra","zebrafish"],"title":"Apical domain mechanosensation regulates tissue tension homeostasis","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Preprint","oa":1,"file":[{"relation":"main_file","date_updated":"2026-07-13T09:16:20Z","content_type":"application/pdf","creator":"nhino","success":1,"file_id":"22283","access_level":"open_access","file_size":12477675,"checksum":"66444afd243dce7d383d52d44e8d34a4","file_name":"Main_text_and_figures.pdf","date_created":"2026-07-13T09:16:20Z"},{"access_level":"open_access","file_size":4545901,"date_created":"2026-07-13T09:16:25Z","checksum":"90bceb34de64ec792c5de117f0890d05","file_name":"Supplementary_figures.pdf","date_updated":"2026-07-13T09:16:25Z","relation":"main_file","file_id":"22284","creator":"nhino","success":1,"content_type":"application/pdf"},{"file_name":"Supplementary_Video1.mp4","checksum":"9d9ab89c372142f2ffb6c8c625334d7f","date_created":"2026-07-13T09:16:28Z","access_level":"open_access","file_size":10349451,"success":1,"creator":"nhino","content_type":"video/mp4","file_id":"22285","relation":"main_file","date_updated":"2026-07-13T09:16:28Z"}],"has_accepted_license":"1","year":"2026","ddc":["570"],"dataavailabilitystatement":"The MATLAB code for image analysis, and the full model code, including all parameter values\r\nand condition-specific settings, are available on GitHub at https://github.com/uday2607/EVL-tension-homeostasis.git.","language":[{"iso":"eng"}],"OA_type":"green","type":"preprint","project":[{"_id":"8f060199-16d5-11f0-9cad-f3253b266c46","grant_number":"PAT 5044023","name":"Keratins in epithelial tissue spreading"},{"_id":"34dd7f3b-11ca-11ed-8bc3-856f2c87f5da","grant_number":"LTF 16-2022","name":"Mechanosensitive signaling activation in the crosstalk between mechanical force and tissuefluidity"}],"supplementarymaterial":"yes","date_published":"2026-07-14T00:00:00Z","das_tickbox":"1","researchdata_availability":"yes","file_date_updated":"2026-07-13T09:16:28Z","date_updated":"2026-07-14T07:07:41Z","citation":{"ista":"Hino N, Kapoor T, Gubbala UR, Hannezo EB, Heisenberg C-PJ. Apical domain mechanosensation regulates tissue tension homeostasis.","ieee":"N. Hino, T. Kapoor, U. R. Gubbala, E. B. Hannezo, and C.-P. J. Heisenberg, “Apical domain mechanosensation regulates tissue tension homeostasis.” Institute of Science and Technology Austria.","ama":"Hino N, Kapoor T, Gubbala UR, Hannezo EB, Heisenberg C-PJ. Apical domain mechanosensation regulates tissue tension homeostasis.","short":"N. Hino, T. Kapoor, U.R. Gubbala, E.B. Hannezo, C.-P.J. Heisenberg, (n.d.).","mla":"Hino, Naoya, et al. <i>Apical Domain Mechanosensation Regulates Tissue Tension Homeostasis</i>. Institute of Science and Technology Austria.","apa":"Hino, N., Kapoor, T., Gubbala, U. R., Hannezo, E. B., &#38; Heisenberg, C.-P. J. (n.d.). Apical domain mechanosensation regulates tissue tension homeostasis. Institute of Science and Technology Austria.","chicago":"Hino, Naoya, Tushna Kapoor, Uday R Gubbala, Edouard B Hannezo, and Carl-Philipp J Heisenberg. “Apical Domain Mechanosensation Regulates Tissue Tension Homeostasis.” Institute of Science and Technology Austria, n.d."},"corr_author":"1","date_created":"2026-07-13T09:03:26Z","department":[{"_id":"CaHe"},{"_id":"EdHa"},{"_id":"GradSch"}],"article_processing_charge":"No","status":"public","day":"14","related_material":{"record":[{"id":"21864","relation":"earlier_version","status":"public"}]},"author":[{"last_name":"Hino","id":"5299a9ce-7679-11eb-a7bc-d1e62b936307","first_name":"Naoya","full_name":"Hino, Naoya"},{"full_name":"Kapoor, Tushna","first_name":"Tushna","last_name":"Kapoor","id":"e3b3eda7-fd4d-11eb-8fd8-c40af7a478b1"},{"first_name":"Uday R","id":"bb4a0dc4-32c9-11ee-b5ce-a97ceedd5924","last_name":"Gubbala","full_name":"Gubbala, Uday R"},{"orcid":"0000-0001-6005-1561","full_name":"Hannezo, Edouard B","first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo"},{"full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-14T07:07:41Z","citation":{"ieee":"1 Anonymous, 2 Anonymous, and 3 Anonymous, <i>Mechanism of tissue tension homeostasis during embryogenesis</i>. Institute of Science and Technology Austria.","ista":"Anonymous 1, Anonymous 2, Anonymous 3. Mechanism of tissue tension homeostasis during embryogenesis, Institute of Science and Technology Austria, 32p.","ama":"Anonymous 1, Anonymous 2, Anonymous 3. <i>Mechanism of Tissue Tension Homeostasis during Embryogenesis</i>. Institute of Science and Technology Austria","apa":"Anonymous, 1, Anonymous, 2, &#38; Anonymous, 3. (n.d.). <i>Mechanism of tissue tension homeostasis during embryogenesis</i>. Institute of Science and Technology Austria.","chicago":"Anonymous, 1, 2 Anonymous, and 3 Anonymous. <i>Mechanism of Tissue Tension Homeostasis during Embryogenesis</i>. Institute of Science and Technology Austria, n.d.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, Mechanism of Tissue Tension Homeostasis during Embryogenesis, Institute of Science and Technology Austria, n.d.","mla":"Anonymous, 1, et al. <i>Mechanism of Tissue Tension Homeostasis during Embryogenesis</i>. Institute of Science and Technology Austria."},"date_published":"2026-05-13T00:00:00Z","file_date_updated":"2026-05-13T06:11:26Z","_id":"21864","page":"32","publication_status":"draft","language":[{"iso":"eng"}],"alternative_title":["ISTA Technical Report"],"type":"technical_report","month":"05","has_accepted_license":"1","year":"2026","ddc":["570"],"oa_version":"Preprint","oa":1,"author":[{"first_name":"1","last_name":"Anonymous","full_name":"Anonymous, 1"},{"first_name":"2","last_name":"Anonymous","full_name":"Anonymous, 2"},{"last_name":"Anonymous","first_name":"3","full_name":"Anonymous, 3"}],"file":[{"checksum":"1512170d78f9f31025c87b3a03c62f0c","file_name":"Main_text_and_figures.pdf","date_created":"2026-05-12T12:43:32Z","file_size":10079104,"access_level":"open_access","content_type":"application/pdf","creator":"nhino","success":1,"file_id":"21865","relation":"main_file","date_updated":"2026-05-12T12:43:32Z"},{"date_created":"2026-05-12T12:44:02Z","file_name":"Supplementary_figures.pdf","checksum":"bee92c26b42433e4ff5ca3f17e3f0640","access_level":"open_access","file_size":1820979,"file_id":"21866","success":1,"creator":"nhino","content_type":"application/pdf","date_updated":"2026-05-12T12:44:02Z","relation":"main_file"},{"file_size":10349451,"access_level":"open_access","file_name":"Supplementary_Video1.mp4","checksum":"9d9ab89c372142f2ffb6c8c625334d7f","date_created":"2026-05-12T12:44:09Z","relation":"main_file","date_updated":"2026-05-12T12:44:09Z","creator":"nhino","success":1,"content_type":"video/mp4","file_id":"21867"},{"date_created":"2026-05-13T06:11:26Z","file_name":"authors.txt","checksum":"3e220d1cc8f883bef02eaf5d810cd911","access_level":"closed","file_size":91,"file_id":"21874","creator":"dernst","content_type":"text/plain","date_updated":"2026-05-13T06:11:26Z","relation":"main_file"}],"publisher":"Institute of Science and Technology Austria","status":"public","publication_identifier":{"eissn":["2664-1690"]},"article_processing_charge":"No","day":"13","related_material":{"record":[{"status":"public","relation":"later_version","id":"22276"}]},"date_created":"2026-05-12T12:52:44Z","title":"Mechanism of tissue tension homeostasis during embryogenesis"},{"date_created":"2026-07-13T10:53:35Z","department":[{"_id":"MiLe"}],"status":"public","publication_identifier":{"issn":["1434-6060"],"eissn":["1434-6079"]},"article_processing_charge":"No","day":"04","article_number":"50","author":[{"full_name":"Hansen, Klavs","last_name":"Hansen","first_name":"Klavs"},{"first_name":"Vitaly","last_name":"Kresin","full_name":"Kresin, Vitaly"},{"first_name":"Ragheed","last_name":"Al Hyder","id":"d1c405be-ae15-11ed-8510-ccf53278162e","full_name":"Al Hyder, Ragheed"},{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michal","last_name":"Fárník","full_name":"Fárník, Michal"},{"first_name":"Juraj","last_name":"Fedor","full_name":"Fedor, Juraj"},{"last_name":"Ferrari","first_name":"Piero","full_name":"Ferrari, Piero"},{"last_name":"Worutowicz","first_name":"Laura X.","full_name":"Worutowicz, Laura X."},{"first_name":"Rick J.","last_name":"Louwerse","full_name":"Louwerse, Rick J."},{"full_name":"Kiawi, Denis","first_name":"Denis","last_name":"Kiawi"},{"full_name":"Waters, Laurens B. F. M.","last_name":"Waters","first_name":"Laurens B. F. M."},{"full_name":"Lang, Sandra M.","first_name":"Sandra M.","last_name":"Lang"},{"full_name":"Bakker, Joost M.","first_name":"Joost M.","last_name":"Bakker"},{"first_name":"Bernd","last_name":"von Issendorff","full_name":"von Issendorff, Bernd"},{"last_name":"Kong","first_name":"Wei","full_name":"Kong, Wei"},{"full_name":"Mehmel, Jannik","last_name":"Mehmel","first_name":"Jannik"},{"full_name":"Schäfer, Rolf","first_name":"Rolf","last_name":"Schäfer"},{"full_name":"Pedalino, Sebastian","first_name":"Sebastian","last_name":"Pedalino"},{"last_name":"Ramírez-Galindo","first_name":"Bruno E.","full_name":"Ramírez-Galindo, Bruno E."},{"full_name":"Ferstl, Richard","first_name":"Richard","last_name":"Ferstl"},{"full_name":"Sindelar, Severin","first_name":"Severin","last_name":"Sindelar"},{"last_name":"Gerlich","first_name":"Stefan","full_name":"Gerlich, Stefan"},{"full_name":"Arndt, Markus","first_name":"Markus","last_name":"Arndt"},{"last_name":"Sayres","first_name":"Scott G.","full_name":"Sayres, Scott G."},{"first_name":"Lai-Sheng","last_name":"Wang","full_name":"Wang, Lai-Sheng"}],"external_id":{"arxiv":["2605.03402"]},"article_type":"original","publisher":"Springer Nature","intvolume":"        80","language":[{"iso":"eng"}],"type":"journal_article","OA_type":"green","supplementarymaterial":"no","date_published":"2026-05-04T00:00:00Z","quality_controlled":"1","das_tickbox":"0","researchdata_availability":"not applicable","date_updated":"2026-07-14T08:03:03Z","citation":{"ista":"Hansen K, Kresin V, Al Hyder R, Lemeshko M, Fárník M, Fedor J, Ferrari P, Worutowicz LX, Louwerse RJ, Kiawi D, Waters LBFM, Lang SM, Bakker JM, von Issendorff B, Kong W, Mehmel J, Schäfer R, Pedalino S, Ramírez-Galindo BE, Ferstl R, Sindelar S, Gerlich S, Arndt M, Sayres SG, Wang L-S. 2026. Reflections on future problems in cluster science. The European Physical Journal D. 80(5), 50.","ama":"Hansen K, Kresin V, Al Hyder R, et al. Reflections on future problems in cluster science. <i>The European Physical Journal D</i>. 2026;80(5). doi:<a href=\"https://doi.org/10.1140/epjd/s10053-026-01126-x\">10.1140/epjd/s10053-026-01126-x</a>","ieee":"K. Hansen <i>et al.</i>, “Reflections on future problems in cluster science,” <i>The European Physical Journal D</i>, vol. 80, no. 5. Springer Nature, 2026.","short":"K. Hansen, V. Kresin, R. Al Hyder, M. Lemeshko, M. Fárník, J. Fedor, P. Ferrari, L.X. Worutowicz, R.J. Louwerse, D. Kiawi, L.B.F.M. Waters, S.M. Lang, J.M. Bakker, B. von Issendorff, W. Kong, J. Mehmel, R. Schäfer, S. Pedalino, B.E. Ramírez-Galindo, R. Ferstl, S. Sindelar, S. Gerlich, M. Arndt, S.G. Sayres, L.-S. Wang, The European Physical Journal D 80 (2026).","mla":"Hansen, Klavs, et al. “Reflections on Future Problems in Cluster Science.” <i>The European Physical Journal D</i>, vol. 80, no. 5, 50, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1140/epjd/s10053-026-01126-x\">10.1140/epjd/s10053-026-01126-x</a>.","apa":"Hansen, K., Kresin, V., Al Hyder, R., Lemeshko, M., Fárník, M., Fedor, J., … Wang, L.-S. (2026). Reflections on future problems in cluster science. <i>The European Physical Journal D</i>. Springer Nature. <a href=\"https://doi.org/10.1140/epjd/s10053-026-01126-x\">https://doi.org/10.1140/epjd/s10053-026-01126-x</a>","chicago":"Hansen, Klavs, Vitaly Kresin, Ragheed Al Hyder, Mikhail Lemeshko, Michal Fárník, Juraj Fedor, Piero Ferrari, et al. “Reflections on Future Problems in Cluster Science.” <i>The European Physical Journal D</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1140/epjd/s10053-026-01126-x\">https://doi.org/10.1140/epjd/s10053-026-01126-x</a>."},"volume":80,"title":"Reflections on future problems in cluster science","publication":"The European Physical Journal D","oa_version":"Preprint","oa":1,"has_accepted_license":"1","ddc":["530"],"year":"2026","month":"05","OA_place":"repository","_id":"22308","issue":"5","publication_status":"published","arxiv":1,"abstract":[{"text":"This article is a collection of contributions from speakers at the 2025 DEAMN workshop at the Majorana Centre in Erice. Not ordinary contributions to a conference proceeding, this gives a new and different perspective on the work done by the workshop participants.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2605.03402","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","doi":"10.1140/epjd/s10053-026-01126-x"},{"date_created":"2026-06-29T10:54:32Z","day":"16","article_processing_charge":"No","publication_identifier":{"eissn":["1088-6826"],"issn":["0002-9939"]},"status":"public","article_type":"original","publisher":"American Mathematical Society","external_id":{"arxiv":["2412.17599"]},"author":[{"first_name":"Domagoj","last_name":"Bradač","full_name":"Bradač, Domagoj"},{"last_name":"Morawski","first_name":"Patryk","full_name":"Morawski, Patryk"},{"full_name":"Sudakov, Benny","last_name":"Sudakov","first_name":"Benny"},{"full_name":"Wigderson, Yuval","first_name":"Yuval","last_name":"Wigderson","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5"}],"intvolume":"       154","type":"journal_article","OA_type":"green","language":[{"iso":"eng"}],"quality_controlled":"1","date_published":"2026-01-16T00:00:00Z","citation":{"mla":"Bradač, Domagoj, et al. “Ordered Ramsey Numbers of Graphs with 𝑚 Edges.” <i>Proceedings of the American Mathematical Society</i>, vol. 154, no. 3, American Mathematical Society, 2026, pp. 927–42, doi:<a href=\"https://doi.org/10.1090/proc/17442\">10.1090/proc/17442</a>.","short":"D. Bradač, P. Morawski, B. Sudakov, Y. Wigderson, Proceedings of the American Mathematical Society 154 (2026) 927–942.","chicago":"Bradač, Domagoj, Patryk Morawski, Benny Sudakov, and Yuval Wigderson. “Ordered Ramsey Numbers of Graphs with 𝑚 Edges.” <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society, 2026. <a href=\"https://doi.org/10.1090/proc/17442\">https://doi.org/10.1090/proc/17442</a>.","apa":"Bradač, D., Morawski, P., Sudakov, B., &#38; Wigderson, Y. (2026). Ordered Ramsey numbers of graphs with 𝑚 edges. <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/proc/17442\">https://doi.org/10.1090/proc/17442</a>","ieee":"D. Bradač, P. Morawski, B. Sudakov, and Y. Wigderson, “Ordered Ramsey numbers of graphs with 𝑚 edges,” <i>Proceedings of the American Mathematical Society</i>, vol. 154, no. 3. American Mathematical Society, pp. 927–942, 2026.","ista":"Bradač D, Morawski P, Sudakov B, Wigderson Y. 2026. Ordered Ramsey numbers of graphs with 𝑚 edges. Proceedings of the American Mathematical Society. 154(3), 927–942.","ama":"Bradač D, Morawski P, Sudakov B, Wigderson Y. Ordered Ramsey numbers of graphs with 𝑚 edges. <i>Proceedings of the American Mathematical Society</i>. 2026;154(3):927-942. doi:<a href=\"https://doi.org/10.1090/proc/17442\">10.1090/proc/17442</a>"},"date_updated":"2026-07-14T08:34:43Z","volume":154,"title":"Ordered Ramsey numbers of graphs with 𝑚 edges","extern":"1","publication":"Proceedings of the American Mathematical Society","oa_version":"Preprint","oa":1,"year":"2026","OA_place":"repository","month":"01","page":"927-942","publication_status":"published","_id":"22167","issue":"3","doi":"10.1090/proc/17442","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2412.17599","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"abstract":[{"text":"Given a vertex-ordered graph G, the ordered Ramsey number\r\nr<(G) is the minimum integer N such that every 2-coloring of the edges of\r\nthe complete ordered graph KN contains a monochromatic ordered copy of G.\r\nMotivated by a similar question posed by Erd˝os and Graham [On partition\r\ntheorems for finite graphs, Infinite and finite sets (Colloq., Keszthely, 1973),\r\nNorth-Holland, Amsterdam-London, pp. 515–527] in the unordered setting,\r\nwe study the problem of bounding the ordered Ramsey number of any ordered graph G with m edges and no isolated vertices. We prove that r<(G) ≤\r\ne109√m(log log m)3/2\r\nfor any such G, which is tight up to the (log log m)3/2\r\nfactor in the exponent. As a corollary, we obtain the corresponding bound for\r\nthe oriented Ramsey number of a directed graph with m edges.","lang":"eng"}]},{"oa":1,"oa_version":"Preprint","year":"2026","volume":2026,"title":"Is it easy to regularize a hypergraph with easy links?","extern":"1","publication":"International Mathematics Research Notices","_id":"22183","issue":"4","publication_status":"published","scopus_import":"1","doi":"10.1093/imrn/rnag018","arxiv":1,"abstract":[{"text":"A partition of a (hyper)graph is ε-homogeneous if the edge densities between almost all clusters are\r\neither at most ε or at least 1 − ε. Suppose a 3-graph has the property that the link of every vertex has\r\nan ε-homogeneous partition of size poly(1/ε). Does this guarantee that the 3-graph also has a small\r\nhomogeneous partition? Terry and Wolf proved that such a 3-graph has an ε-homogeneous partition\r\nof size given by a wowzer-type function. Terry recently improved this to a double exponential bound,\r\nand conjectured that this bound is tight. Our first result in this paper disproves this conjecture by\r\ngiving an improved (single) exponential bound, which is best possible. We further obtain an analogous\r\nresult for k-graphs of all uniformities k  3. The above problem is part of a much broader programme,\r\nwhich seeks to understand the conditions under which a (hyper)graph has small ε-regular partitions.\r\nWhile this problem is fairly well understood for graphs, the situation is (as always) much more\r\ninvolved already for 3-graphs. For example, it is natural to ask if one can strengthen our first result\r\nby only requiring each link to have ε-regular partitions of size poly(1/ε). Our second result shows that\r\nsurprisingly the answer is “no”, namely, a 3-graph might only have regular partitions of tower-type size,\r\neven though the link of every vertex has an ε-regular partition of polynomial size.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2506.15582","open_access":"1"}],"month":"02","OA_place":"repository","external_id":{"arxiv":["2506.15582"]},"publisher":"Oxford University Press","article_type":"original","author":[{"first_name":"Lior","last_name":"Gishboliner","full_name":"Gishboliner, Lior"},{"full_name":"Shapira, Asaf","first_name":"Asaf","last_name":"Shapira"},{"full_name":"Wigderson, Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","last_name":"Wigderson","first_name":"Yuval"}],"date_created":"2026-06-29T12:02:25Z","day":"01","article_number":"rnag018","status":"public","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"article_processing_charge":"No","quality_controlled":"1","date_published":"2026-02-01T00:00:00Z","date_updated":"2026-07-14T09:25:22Z","citation":{"mla":"Gishboliner, Lior, et al. “Is It Easy to Regularize a Hypergraph with Easy Links?” <i>International Mathematics Research Notices</i>, vol. 2026, no. 4, rnag018, Oxford University Press, 2026, doi:<a href=\"https://doi.org/10.1093/imrn/rnag018\">10.1093/imrn/rnag018</a>.","short":"L. Gishboliner, A. Shapira, Y. Wigderson, International Mathematics Research Notices 2026 (2026).","chicago":"Gishboliner, Lior, Asaf Shapira, and Yuval Wigderson. “Is It Easy to Regularize a Hypergraph with Easy Links?” <i>International Mathematics Research Notices</i>. Oxford University Press, 2026. <a href=\"https://doi.org/10.1093/imrn/rnag018\">https://doi.org/10.1093/imrn/rnag018</a>.","apa":"Gishboliner, L., Shapira, A., &#38; Wigderson, Y. (2026). Is it easy to regularize a hypergraph with easy links? <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnag018\">https://doi.org/10.1093/imrn/rnag018</a>","ista":"Gishboliner L, Shapira A, Wigderson Y. 2026. Is it easy to regularize a hypergraph with easy links? International Mathematics Research Notices. 2026(4), rnag018.","ama":"Gishboliner L, Shapira A, Wigderson Y. Is it easy to regularize a hypergraph with easy links? <i>International Mathematics Research Notices</i>. 2026;2026(4). doi:<a href=\"https://doi.org/10.1093/imrn/rnag018\">10.1093/imrn/rnag018</a>","ieee":"L. Gishboliner, A. Shapira, and Y. Wigderson, “Is it easy to regularize a hypergraph with easy links?,” <i>International Mathematics Research Notices</i>, vol. 2026, no. 4. Oxford University Press, 2026."},"intvolume":"      2026","type":"journal_article","OA_type":"green","language":[{"iso":"eng"}]},{"date_published":"2026-01-01T00:00:00Z","quality_controlled":"1","date_updated":"2026-07-14T09:53:07Z","citation":{"chicago":"Wigderson, Yuval. “Exposé Bourbaki 1230 : Upper Bounds on Diagonal Ramsey Numbers (after Campos, Griffiths, Morris, and Sahasrabudhe).” <i>Astérisque</i>. Societe Mathematique de France, 2026. <a href=\"https://doi.org/10.24033/ast.1255\">https://doi.org/10.24033/ast.1255</a>.","apa":"Wigderson, Y. (2026). Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe). <i>Astérisque</i>. Societe Mathematique de France. <a href=\"https://doi.org/10.24033/ast.1255\">https://doi.org/10.24033/ast.1255</a>","short":"Y. Wigderson, Astérisque (2026) 85–138.","mla":"Wigderson, Yuval. “Exposé Bourbaki 1230 : Upper Bounds on Diagonal Ramsey Numbers (after Campos, Griffiths, Morris, and Sahasrabudhe).” <i>Astérisque</i>, Societe Mathematique de France, 2026, pp. 85–138, doi:<a href=\"https://doi.org/10.24033/ast.1255\">10.24033/ast.1255</a>.","ama":"Wigderson Y. Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe). <i>Astérisque</i>. 2026:85-138. doi:<a href=\"https://doi.org/10.24033/ast.1255\">10.24033/ast.1255</a>","ista":"Wigderson Y. 2026. Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe). Astérisque., 85–138.","ieee":"Y. Wigderson, “Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe),” <i>Astérisque</i>. Societe Mathematique de France, pp. 85–138, 2026."},"language":[{"iso":"eng"}],"type":"journal_article","OA_type":"green","author":[{"last_name":"Wigderson","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval","full_name":"Wigderson, Yuval"}],"external_id":{"arxiv":["2411.09321"]},"publisher":"Societe Mathematique de France","article_type":"original","mathsc":["05D10","05C55"],"date_created":"2026-06-29T12:02:59Z","status":"public","publication_identifier":{"issn":["0303-1179","2492-5926"]},"article_processing_charge":"No","day":"01","_id":"22184","publication_status":"published","page":"85-138","arxiv":1,"abstract":[{"text":"Ramsey's theorem states that if N\r\n is sufficiently large, then no matter how one colors the edges among N\r\n vertices with two colors, there are always k\r\n vertices spanning edges in only one color. Given this theorem, it is natural to ask \"how large is sufficiently large?\" Ramsey's original proof showed that N=k!\r\n is sufficient, and five years later Erdős and Szekeres improved this bound to N=4^k\r\n. And then progress stalled for almost 90 years.\r\n\r\nIn this survey, I present the history of the problem, and discuss some of the ideas used in the recent breakthrough of Campos–Griffiths–Morris–Sahasrabudhe, who proved that N=3.993^k\r\n is sufficient. In addition, I discuss the subsequent work of Balister, Bollobás, Campos, Griffiths, Hurley, Morris, Sahasrabudhe, and Tiba, who gave an alternative, and more conceptual, proof.","lang":"eng"},{"lang":"fre","text":"Le théorème de Ramsey stipule que si N\r\n est suffisamment grand, alors quelle que soit la manière dont l'on colore les arêtes entre N\r\n sommets avec deux couleurs, il y a toujours k\r\n sommets dont les arêtes ne sont colorées que d'une seule couleur. Compte tenu de ce théorème, il est naturel de se demander \"À quel point N\r\n doit être grand ?\" La preuve originale de Ramsey a montré que N=k!\r\n suffit, et cinq ans plus tard, Erdős et Szekeres ont amélioré cette borne à N=4k\r\n. Puis le progrès s'est arrêté pendant près de 90 ans.\r\n\r\nDans cet exposé, je présente l'histoire du problème et je discute certaines idées utilisées dans la percée récente de Campos--Griffiths-Morris--Sahasrabudhe, qui ont prouvé que N=3,993k\r\n suffit. De plus, je discute le travail suivant de Balister, Bollobás, Campos, Griffiths, Hurley, Morris, Sahasrabudhe, et Tiba, qui ont donné une preuve alternative et plus conceptuelle."}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2411.09321 ","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","doi":"10.24033/ast.1255","month":"01","OA_place":"repository","oa_version":"Preprint","oa":1,"year":"2026","title":"Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe)","publication":"Astérisque","extern":"1"},{"article_number":"e07385","day":"02","publication_identifier":{"eissn":["1521-4095"],"issn":["0935-9648"]},"article_processing_charge":"No","status":"public","date_created":"2026-06-30T06:36:20Z","publisher":"Wiley","article_type":"original","external_id":{"pmid":["41312612"]},"author":[{"full_name":"Puiggalí‐Jou, Anna","first_name":"Anna","last_name":"Puiggalí‐Jou"},{"full_name":"Hui, Isabel B.","first_name":"Isabel B.","last_name":"Hui"},{"last_name":"Fernández-Rico","id":"492def71-6250-11f0-b278-d41dbd241b62","first_name":"Carla","full_name":"Fernández-Rico, Carla"},{"last_name":"Zenobi‐Wong","first_name":"Marcy","full_name":"Zenobi‐Wong, Marcy"}],"OA_type":"hybrid","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"        38","citation":{"ieee":"A. Puiggalí‐Jou, I. B. Hui, C. Fernández-Rico, and M. Zenobi‐Wong, “The space within: How architected voids promote tissue formation,” <i>Advanced Materials</i>, vol. 38, no. 7. Wiley, 2026.","ama":"Puiggalí‐Jou A, Hui IB, Fernández-Rico C, Zenobi‐Wong M. The space within: How architected voids promote tissue formation. <i>Advanced Materials</i>. 2026;38(7). doi:<a href=\"https://doi.org/10.1002/adma.202507385\">10.1002/adma.202507385</a>","ista":"Puiggalí‐Jou A, Hui IB, Fernández-Rico C, Zenobi‐Wong M. 2026. The space within: How architected voids promote tissue formation. Advanced Materials. 38(7), e07385.","apa":"Puiggalí‐Jou, A., Hui, I. B., Fernández-Rico, C., &#38; Zenobi‐Wong, M. (2026). The space within: How architected voids promote tissue formation. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.202507385\">https://doi.org/10.1002/adma.202507385</a>","chicago":"Puiggalí‐Jou, Anna, Isabel B. Hui, Carla Fernández-Rico, and Marcy Zenobi‐Wong. “The Space within: How Architected Voids Promote Tissue Formation.” <i>Advanced Materials</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/adma.202507385\">https://doi.org/10.1002/adma.202507385</a>.","mla":"Puiggalí‐Jou, Anna, et al. “The Space within: How Architected Voids Promote Tissue Formation.” <i>Advanced Materials</i>, vol. 38, no. 7, e07385, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/adma.202507385\">10.1002/adma.202507385</a>.","short":"A. Puiggalí‐Jou, I.B. Hui, C. Fernández-Rico, M. Zenobi‐Wong, Advanced Materials 38 (2026)."},"date_updated":"2026-07-15T08:08:38Z","quality_controlled":"1","date_published":"2026-02-02T00:00:00Z","extern":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Advanced Materials","volume":38,"title":"The space within: How architected voids promote tissue formation","year":"2026","ddc":["540"],"has_accepted_license":"1","oa_version":"Published Version","oa":1,"OA_place":"publisher","month":"02","doi":"10.1002/adma.202507385","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","PlanS_conform":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/adma.202507385"}],"abstract":[{"text":"Physiological void spaces exist at every scale of the human body, from organs to molecules, facilitating transport, signal propagation, and localized biochemical activity. Constriction of these spaces (e.g., arterial occlusion, fibrosis) highlights their importance, making their mimicry essential in tissue engineering (TE). This review examines four key strategies for introducing porosity into hydrogels across multiple length scales: templating, microgels, phase separation, and 3D printing. The first three methods enable the engineering of physiological environments at the nano‐ to micro‐scale, mimicking tissue‐ and extracellular matrix (ECM)‐level spaces. Templating involves embedding and removal of gas, liquid, or solid phases, leaving behind pores. Microgel annealing generates inherent interstitial voids. Liquid–liquid phase separation (LLPS) creates biphasic networks reminiscent of native ECM. The fourth approach, extrusion‐ and light‐based 3D printing techniques, enables the fabrication of larger‐scale spaces, such as luminal structures (e.g., vasculature, airways, and ducts). Combining these methods enables the creation of hierarchical architectures from the nano‐ to centimeter scale. The review also highlights Filamented Light (FLight) technology, which creates internal microstructural voids relevant to anisotropic tissues. This review offers insights into current methods and their convergence for generating biomimetic void spaces to meet the physiological demands of cells, tissues, and organs.","lang":"eng"}],"pmid":1,"publication_status":"published","issue":"7","_id":"22218"},{"article_processing_charge":"No","publication_identifier":{"issn":["1744-683X"],"eissn":["1744-6848"]},"status":"public","day":"14","date_created":"2026-06-30T06:33:11Z","author":[{"full_name":"Fernández-Rico, Carla","last_name":"Fernández-Rico","id":"492def71-6250-11f0-b278-d41dbd241b62","first_name":"Carla"},{"last_name":"Style","first_name":"Robert W.","full_name":"Style, Robert W."},{"last_name":"Heyden","first_name":"Stefanie","full_name":"Heyden, Stefanie"},{"first_name":"Shichen","last_name":"Wang","full_name":"Wang, Shichen"},{"full_name":"Olmsted, Peter D.","last_name":"Olmsted","first_name":"Peter D."},{"full_name":"Dufresne, Eric R.","first_name":"Eric R.","last_name":"Dufresne"}],"external_id":{"arxiv":["2506.08958"],"pmid":["41400267"]},"publisher":"Royal Society of Chemistry","article_type":"original","language":[{"iso":"eng"}],"type":"journal_article","OA_type":"hybrid","intvolume":"        22","date_updated":"2026-07-15T07:42:04Z","citation":{"ama":"Fernández-Rico C, Style RW, Heyden S, Wang S, Olmsted PD, Dufresne ER. Thermodynamics of microphase separation in a swollen, strain-stiffening polymer network. <i>Soft Matter</i>. 2026;22(2):330-342. doi:<a href=\"https://doi.org/10.1039/d5sm00594a\">10.1039/d5sm00594a</a>","ista":"Fernández-Rico C, Style RW, Heyden S, Wang S, Olmsted PD, Dufresne ER. 2026. Thermodynamics of microphase separation in a swollen, strain-stiffening polymer network. Soft Matter. 22(2), 330–342.","ieee":"C. Fernández-Rico, R. W. Style, S. Heyden, S. Wang, P. D. Olmsted, and E. R. Dufresne, “Thermodynamics of microphase separation in a swollen, strain-stiffening polymer network,” <i>Soft Matter</i>, vol. 22, no. 2. Royal Society of Chemistry, pp. 330–342, 2026.","chicago":"Fernández-Rico, Carla, Robert W. Style, Stefanie Heyden, Shichen Wang, Peter D. Olmsted, and Eric R. Dufresne. “Thermodynamics of Microphase Separation in a Swollen, Strain-Stiffening Polymer Network.” <i>Soft Matter</i>. Royal Society of Chemistry, 2026. <a href=\"https://doi.org/10.1039/d5sm00594a\">https://doi.org/10.1039/d5sm00594a</a>.","apa":"Fernández-Rico, C., Style, R. W., Heyden, S., Wang, S., Olmsted, P. D., &#38; Dufresne, E. R. (2026). Thermodynamics of microphase separation in a swollen, strain-stiffening polymer network. <i>Soft Matter</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/d5sm00594a\">https://doi.org/10.1039/d5sm00594a</a>","mla":"Fernández-Rico, Carla, et al. “Thermodynamics of Microphase Separation in a Swollen, Strain-Stiffening Polymer Network.” <i>Soft Matter</i>, vol. 22, no. 2, Royal Society of Chemistry, 2026, pp. 330–42, doi:<a href=\"https://doi.org/10.1039/d5sm00594a\">10.1039/d5sm00594a</a>.","short":"C. Fernández-Rico, R.W. Style, S. Heyden, S. Wang, P.D. Olmsted, E.R. Dufresne, Soft Matter 22 (2026) 330–342."},"date_published":"2026-01-14T00:00:00Z","quality_controlled":"1","publication":"Soft Matter","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"extern":"1","volume":22,"title":"Thermodynamics of microphase separation in a swollen, strain-stiffening polymer network","has_accepted_license":"1","year":"2026","ddc":["540"],"oa":1,"oa_version":"Published Version","month":"01","OA_place":"publisher","abstract":[{"text":"Elastic MicroPhase separation (EMPS) provides a simple route to create soft materials with homogeneous microstructures by leveraging the supersaturation of crosslinked polymer networks with liquids. At low supersaturation, network elasticity stabilizes a uniform mixture, but beyond a critical threshold, metastable microphase-separated domains emerge. While previous theories have focused on describing qualitative features about the size and morphology of these domains, they do not make quantitative predictions about EMPS phase diagrams. In this work, we extend Flory–Huggins theory to quantitatively capture EMPS phase diagrams by incorporating strain-stiffening effects. This model requires no fitting parameters and relies solely on independently measured solubility parameters and large-deformation mechanical responses. Our results confirm that strain-stiffening enables metastable microphase separation within the swelling equilibrium state and reveal why the microstructures can range from discrete droplets to bicontinuous networks. This works highlights the critical role of nonlinear elasticity in controlling phase-separated morphologies in polymer gels.","lang":"eng"}],"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1039/d5sm00594a"}],"scopus_import":"1","doi":"10.1039/d5sm00594a","issue":"2","_id":"22215","page":"330-342","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","publication_status":"published","pmid":1},{"title":"The Davenport–Heilbronn method: 80 years on","volume":113,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Journal of the London Mathematical Society","oa_version":"Published Version","oa":1,"file":[{"file_id":"21004","creator":"dernst","content_type":"application/pdf","success":1,"date_updated":"2026-01-19T08:19:46Z","relation":"main_file","date_created":"2026-01-19T08:19:46Z","checksum":"3b05bd625c81d038259a14f7e2ddd57c","file_name":"2026_JourLondonMathSoc_Browning.pdf","access_level":"open_access","file_size":235238}],"has_accepted_license":"1","ddc":["510"],"year":"2026","OA_place":"publisher","month":"01","acknowledgement":"The author is very grateful to Jörg Brüdern, Simon Rydin Myerson and Trevor Wooley for their help and advice with preparing this survey, in addition to Vinay Kumaraswamy, Victor Wang and the anonymous referee for useful comments on an earlier draft. This work was supported by a FWF Grant (DOI 10.55776/P36278).\r\nOpen Access funding provided by Institute of Science and Technology Austria/KEMÖ.","publication_status":"published","issue":"1","_id":"21002","PlanS_conform":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"The Davenport–Heilbronn method is a version of the circle method that was developed for studying Diophantine inequalities in the paper (Davenport and Heilbronn, J. Lond. Math. Soc. (1) 21 (1946), 185–193). We discuss the main ideas in the paper, together with an account of the development of the subject in the intervening 80 years."}],"doi":"10.1112/jlms.70371","scopus_import":"1","corr_author":"1","department":[{"_id":"TiBr"}],"date_created":"2026-01-18T23:02:44Z","status":"public","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"issn":["0024-6107"],"eissn":["1469-7750"]},"article_number":"e70371","day":"06","author":[{"full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning"}],"article_type":"original","publisher":"Wiley","intvolume":"       113","language":[{"iso":"eng"}],"project":[{"_id":"bd8a4fdc-d553-11ed-ba76-80a0167441a3","name":"Rational curves via function field analytic number theory","grant_number":"P36278"}],"type":"journal_article","OA_type":"hybrid","supplementarymaterial":"no","date_published":"2026-01-06T00:00:00Z","researchdata_availability":"no","das_tickbox":"0","quality_controlled":"1","file_date_updated":"2026-01-19T08:19:46Z","citation":{"mla":"Browning, Timothy D. “The Davenport–Heilbronn Method: 80 Years On.” <i>Journal of the London Mathematical Society</i>, vol. 113, no. 1, e70371, Wiley, 2026, doi:<a href=\"https://doi.org/10.1112/jlms.70371\">10.1112/jlms.70371</a>.","short":"T.D. Browning, Journal of the London Mathematical Society 113 (2026).","apa":"Browning, T. D. (2026). The Davenport–Heilbronn method: 80 years on. <i>Journal of the London Mathematical Society</i>. Wiley. <a href=\"https://doi.org/10.1112/jlms.70371\">https://doi.org/10.1112/jlms.70371</a>","chicago":"Browning, Timothy D. “The Davenport–Heilbronn Method: 80 Years On.” <i>Journal of the London Mathematical Society</i>. Wiley, 2026. <a href=\"https://doi.org/10.1112/jlms.70371\">https://doi.org/10.1112/jlms.70371</a>.","ista":"Browning TD. 2026. The Davenport–Heilbronn method: 80 years on. Journal of the London Mathematical Society. 113(1), e70371.","ama":"Browning TD. The Davenport–Heilbronn method: 80 years on. <i>Journal of the London Mathematical Society</i>. 2026;113(1). doi:<a href=\"https://doi.org/10.1112/jlms.70371\">10.1112/jlms.70371</a>","ieee":"T. D. Browning, “The Davenport–Heilbronn method: 80 years on,” <i>Journal of the London Mathematical Society</i>, vol. 113, no. 1. Wiley, 2026."},"date_updated":"2026-07-16T08:33:56Z"},{"publication":"Proceedings of the Royal Society of Edinburgh: Section A Mathematics","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"title":"Average sizes of mixed character sums","has_accepted_license":"1","year":"2026","ddc":["510"],"oa":1,"oa_version":"Published Version","acknowledgement":"We thank Ofir Gorodetsky, Andrew Granville, Adam Harper, Youness Lamzouri,\r\nKannan Soundararajan, Ping Xi, and Matt Young for their interest, helpful discussions, and comments. Special thanks are due to Jonathan Bober, Oleksiy Klurman,\r\nand Besfort Shala for sending us a letter about Question 1.3, and to Hung Bui\r\nfor informing us of [7]. V.W. thanks Stanford University for its hospitality and is supported by the European Union’s Horizon 2020 research and innovation program\r\nunder the Marie Skłodowska–Curie Grant Agreement No. 101034413. M.X. is supported by a Simons Junior Fellowship from the Simons Society of Fellows at the\r\nSimons Foundation.","OA_place":"publisher","month":"01","PlanS_conform":"1","main_file_link":[{"url":"https://doi.org/10.1017/prm.2026.10123","open_access":"1"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","arxiv":1,"abstract":[{"lang":"eng","text":"We prove that the average size of a mixed character sum (math. formular) (for a suitable smooth function w) is on the order of √x for all irrational real θ satisfying a weak Diophantine condition, where χ is drawn from the family of Dirichlet characters modulo a large prime r and where x 6 r. In contrast, it was proved by Harper that the average size is o(√x) for rational θ. Certain quadratic Diophantine equations play a key role in the present paper. "}],"doi":"10.1017/prm.2026.10123","page":"1-15","publication_status":"epub_ahead","_id":"21385","publication_identifier":{"issn":["0308-2105"],"eissn":["1473-7124"]},"status":"public","article_processing_charge":"Yes (via OA deal)","corr_author":"1","department":[{"_id":"TiBr"}],"date_created":"2026-03-02T10:09:23Z","author":[{"full_name":"Wang, Victor","orcid":"0000-0002-0704-7026","first_name":"Victor","last_name":"Wang","id":"76096395-aea4-11ed-a680-ab8ebbd3f1b9"},{"last_name":"Xu","first_name":"Max","full_name":"Xu, Max"}],"publisher":"Cambridge University Press","article_type":"original","external_id":{"arxiv":["2411.14181"]},"language":[{"iso":"eng"}],"type":"journal_article","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"}],"OA_type":"hybrid","citation":{"short":"V. Wang, M. Xu, Proceedings of the Royal Society of Edinburgh: Section A Mathematics (2026) 1–15.","mla":"Wang, Victor, and Max Xu. “Average Sizes of Mixed Character Sums.” <i>Proceedings of the Royal Society of Edinburgh: Section A Mathematics</i>, Cambridge University Press, 2026, pp. 1–15, doi:<a href=\"https://doi.org/10.1017/prm.2026.10123\">10.1017/prm.2026.10123</a>.","chicago":"Wang, Victor, and Max Xu. “Average Sizes of Mixed Character Sums.” <i>Proceedings of the Royal Society of Edinburgh: Section A Mathematics</i>. Cambridge University Press, 2026. <a href=\"https://doi.org/10.1017/prm.2026.10123\">https://doi.org/10.1017/prm.2026.10123</a>.","apa":"Wang, V., &#38; Xu, M. (2026). Average sizes of mixed character sums. <i>Proceedings of the Royal Society of Edinburgh: Section A Mathematics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/prm.2026.10123\">https://doi.org/10.1017/prm.2026.10123</a>","ama":"Wang V, Xu M. Average sizes of mixed character sums. <i>Proceedings of the Royal Society of Edinburgh: Section A Mathematics</i>. 2026:1-15. doi:<a href=\"https://doi.org/10.1017/prm.2026.10123\">10.1017/prm.2026.10123</a>","ieee":"V. Wang and M. Xu, “Average sizes of mixed character sums,” <i>Proceedings of the Royal Society of Edinburgh: Section A Mathematics</i>. Cambridge University Press, pp. 1–15, 2026.","ista":"Wang V, Xu M. 2026. Average sizes of mixed character sums. Proceedings of the Royal Society of Edinburgh: Section A Mathematics., 1–15."},"date_updated":"2026-07-16T08:39:57Z","date_published":"2026-01-01T00:00:00Z","supplementarymaterial":"no","researchdata_availability":"no","quality_controlled":"1","das_tickbox":"0"},{"supplementarymaterial":"no","date_published":"2026-01-01T00:00:00Z","das_tickbox":"0","quality_controlled":"1","researchdata_availability":"no","date_updated":"2026-07-16T08:36:20Z","citation":{"ista":"Rome N, Yamagishi S. 2026. Integral solutions to systems of diagonal equations. Pacific Journal of Mathematics. 340(1), 179–198.","ieee":"N. Rome and S. Yamagishi, “Integral solutions to systems of diagonal equations,” <i>Pacific Journal of Mathematics</i>, vol. 340, no. 1. Mathematical Sciences Publishers, pp. 179–198, 2026.","ama":"Rome N, Yamagishi S. Integral solutions to systems of diagonal equations. <i>Pacific Journal of Mathematics</i>. 2026;340(1):179-198. doi:<a href=\"https://doi.org/10.2140/pjm.2026.340.179\">10.2140/pjm.2026.340.179</a>","mla":"Rome, Nick, and Shuntaro Yamagishi. “Integral Solutions to Systems of Diagonal Equations.” <i>Pacific Journal of Mathematics</i>, vol. 340, no. 1, Mathematical Sciences Publishers, 2026, pp. 179–98, doi:<a href=\"https://doi.org/10.2140/pjm.2026.340.179\">10.2140/pjm.2026.340.179</a>.","short":"N. Rome, S. Yamagishi, Pacific Journal of Mathematics 340 (2026) 179–198.","chicago":"Rome, Nick, and Shuntaro Yamagishi. “Integral Solutions to Systems of Diagonal Equations.” <i>Pacific Journal of Mathematics</i>. Mathematical Sciences Publishers, 2026. <a href=\"https://doi.org/10.2140/pjm.2026.340.179\">https://doi.org/10.2140/pjm.2026.340.179</a>.","apa":"Rome, N., &#38; Yamagishi, S. (2026). Integral solutions to systems of diagonal equations. <i>Pacific Journal of Mathematics</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/pjm.2026.340.179\">https://doi.org/10.2140/pjm.2026.340.179</a>"},"intvolume":"       340","language":[{"iso":"eng"}],"OA_type":"green","type":"journal_article","author":[{"full_name":"Rome, Nick","last_name":"Rome","first_name":"Nick"},{"id":"0c3fbc5c-f7a6-11ec-8d70-9485e75b416b","last_name":"Yamagishi","first_name":"Shuntaro","full_name":"Yamagishi, Shuntaro"}],"external_id":{"arxiv":["2406.09256"]},"article_type":"original","publisher":"Mathematical Sciences Publishers","date_created":"2026-02-16T15:17:27Z","department":[{"_id":"TiBr"}],"article_processing_charge":"No","publication_identifier":{"issn":["0030-8730"],"eissn":["1945-5844"]},"status":"public","day":"01","issue":"1","_id":"21242","page":"179-198","publication_status":"published","abstract":[{"lang":"eng","text":"We obtain an asymptotic formula for the number of integral solutions to a system of diagonal equations. We obtain an asymptotic formula for the number of solutions with variables restricted to smooth numbers as well. We improve the required number of variables compared to previous results by incorporating recent progress on Waring’s problem and the resolution of the main conjecture in Vinogradov’s mean value theorem."}],"arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2406.09256","open_access":"1"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.2140/pjm.2026.340.179","month":"01","OA_place":"repository","oa_version":"Preprint","oa":1,"year":"2026","title":"Integral solutions to systems of diagonal equations","volume":340,"publication":"Pacific Journal of Mathematics"},{"_id":"22318","issue":"2","publication_status":"published","page":"1-26","scopus_import":"1","keyword":["differential privacy","concurrent composition","continual release","continual observation","data streaming","continual mechanisms","concurrent parallel composition","concurrent filter composition"],"doi":"10.1145/3801895","abstract":[{"lang":"eng","text":"Many intended uses of differential privacy involve a continual mechanism that is set up to run continuously\r\nover a long period of time, making more statistical releases as either queries come in or the dataset is updated.\r\nIn this paper, we give the first general treatment of privacy against adaptive adversaries for mechanisms that\r\nsupport dataset updates and a variety of queries, all arbitrarily interleaved. It also models a very general notion\r\nof neighboring, that includes both event-level and user-level privacy. We prove several concurrent composition\r\ntheorems for continual mechanisms, which ensure privacy even when an adversary can interleave its queries\r\nand dataset updates to the different composed mechanisms. Previous concurrent composition theorems for\r\ndifferential privacy were only for the case when the dataset is static, with no adaptive updates. We also give\r\nthe first interactive and continual generalizations of the “parallel composition theorem” for noninteractive\r\ndifferential privacy. Specifically, we show that the analogue of the noninteractive parallel composition theorem\r\nholds if either there are no adaptive dataset updates or each of the composed mechanisms satisfies pure\r\ndifferential privacy, but it fails to hold for composing approximately differentially private mechanisms with\r\ndataset updates. Thus, we prove a tight new composition theorem for this case. In addition, we prove concurrent\r\nfilter compositions theorems for the scenarios in which the privacy parameters are adaptively chosen. We\r\nextend these results to other measures of differential privacy, including Rényi DP and 𝑓 -DP.\r\nWe then formalize a set of general conditions on a continual mechanism M that runs multiple continual submechanisms such that the privacy guarantees of M follow directly using the above concurrent composition\r\ntheorems on the sub-mechanisms, without further privacy loss. This enables us to give a simpler and modular\r\nprivacy analysis of a recent continual histogram mechanism of Henzinger, Sricharan, and Steiner. In the\r\ncase of approximate DP, ours is the first proof that shows that its privacy holds against adaptive adversaries.\r\nWe also provide a framework that simplifies the analysis of local differential privacy when the protocol\r\nincludes multi-round server-user interactions. Using this result, we simplify the privacy analysis of the core\r\ndecomposition protocol of Dhulipala, Henzinger, Li, Liu, Sricharan, and Zhu [5]."}],"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","PlanS_conform":"1","month":"06","OA_place":"publisher","acknowledgement":"1Salil Vadhan was supported by NSF grant BCS-2218803, a grant from the Sloan Foundation, and\r\na Simons Investigator Award. Work began while a Visiting Researcher at the Bocconi University\r\nDepartment of Computing Sciences, supported by Luca Trevisan’s ERC Project GA-834861.\r\n2Monika Henzinger and Roodabeh Safavi were supported by the European Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation programme (Grant agreement\r\nNo. 101019564), and the Austrian Science Fund (FWF) under grants DOI 10.55776/Z422, DOI\r\n10.55776/I5982, and DOI 10.55776/P33775. For open access purposes, the author has applied a CC BY\r\npublic copyright license to any author-accepted manuscript version arising from this submission.\r\nViews and opinions expressed are however those of the author(s)\r\nonly and do not necessarily reflect those of the European Union\r\nor the European Research Council Executive Agency. Neither the\r\nEuropean Union nor the granting authority can be held responsible for them.","file":[{"relation":"main_file","date_updated":"2026-07-16T09:09:53Z","content_type":"application/pdf","success":1,"creator":"dernst","file_id":"22345","access_level":"open_access","file_size":655405,"file_name":"2026_ACMMgmtData_Henzinger.pdf","checksum":"c6c5e256d02b90682c0690c3bee94040","date_created":"2026-07-16T09:09:53Z"}],"oa":1,"oa_version":"Published Version","year":"2026","ddc":["000"],"has_accepted_license":"1","volume":4,"title":"Concurrent composition for differentially private continual mechanisms","ec_funded":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Proceedings of the ACM on Management of Data","das_tickbox":"0","quality_controlled":"1","file_date_updated":"2026-07-16T09:09:53Z","researchdata_availability":"no","date_published":"2026-06-01T00:00:00Z","supplementarymaterial":"no","date_updated":"2026-07-16T09:14:49Z","citation":{"chicago":"Henzinger, Monika, Roodabeh Safavi Hemami, and Salil Vadhan. “Concurrent Composition for Differentially Private Continual Mechanisms.” <i>Proceedings of the ACM on Management of Data</i>. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3801895\">https://doi.org/10.1145/3801895</a>.","apa":"Henzinger, M., Safavi Hemami, R., &#38; Vadhan, S. (2026). Concurrent composition for differentially private continual mechanisms. <i>Proceedings of the ACM on Management of Data</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3801895\">https://doi.org/10.1145/3801895</a>","short":"M. Henzinger, R. Safavi Hemami, S. Vadhan, Proceedings of the ACM on Management of Data 4 (2026) 1–26.","mla":"Henzinger, Monika, et al. “Concurrent Composition for Differentially Private Continual Mechanisms.” <i>Proceedings of the ACM on Management of Data</i>, vol. 4, no. 2, Association for Computing Machinery, 2026, pp. 1–26, doi:<a href=\"https://doi.org/10.1145/3801895\">10.1145/3801895</a>.","ama":"Henzinger M, Safavi Hemami R, Vadhan S. Concurrent composition for differentially private continual mechanisms. <i>Proceedings of the ACM on Management of Data</i>. 2026;4(2):1-26. doi:<a href=\"https://doi.org/10.1145/3801895\">10.1145/3801895</a>","ieee":"M. Henzinger, R. Safavi Hemami, and S. Vadhan, “Concurrent composition for differentially private continual mechanisms,” <i>Proceedings of the ACM on Management of Data</i>, vol. 4, no. 2. Association for Computing Machinery, pp. 1–26, 2026.","ista":"Henzinger M, Safavi Hemami R, Vadhan S. 2026. Concurrent composition for differentially private continual mechanisms. Proceedings of the ACM on Management of Data. 4(2), 1–26."},"intvolume":"         4","project":[{"call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422","name":"Efficient algorithms"}],"OA_type":"gold","type":"journal_article","language":[{"iso":"eng"}],"external_id":{"arxiv":["2411.03299"]},"publisher":"Association for Computing Machinery","article_type":"original","author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Roodabeh","id":"72ed2640-8972-11ed-ae7b-f9c81ec75154","last_name":"Safavi Hemami","full_name":"Safavi Hemami, Roodabeh"},{"last_name":"Vadhan","first_name":"Salil","full_name":"Vadhan, Salil"}],"date_created":"2026-07-13T14:59:14Z","department":[{"_id":"MoHe"}],"corr_author":"1","day":"01","status":"public","publication_identifier":{"issn":["2836-6573"]},"article_processing_charge":"Yes"},{"language":[{"iso":"eng"}],"OA_type":"green","type":"conference","intvolume":"         2","citation":{"mla":"Hatua, Amartya, et al. “Machine Unlearning Using Forgetting Neural Networks.” <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, vol. 2, SciTePress, 2026, pp. 1536–46, doi:<a href=\"https://doi.org/10.5220/0014326500004052\">10.5220/0014326500004052</a>.","short":"A. Hatua, T. Nguyen, F. Cano Cordoba, A. Sung, in:, Proceedings of the 18th International Conference on Agents and Artificial Intelligence, SciTePress, 2026, pp. 1536–1546.","apa":"Hatua, A., Nguyen, T., Cano Cordoba, F., &#38; Sung, A. (2026). Machine unlearning using forgetting neural networks. In <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i> (Vol. 2, pp. 1536–1546). Marbella, Spain: SciTePress. <a href=\"https://doi.org/10.5220/0014326500004052\">https://doi.org/10.5220/0014326500004052</a>","chicago":"Hatua, Amartya, Trung Nguyen, Filip Cano Cordoba, and Andrew Sung. “Machine Unlearning Using Forgetting Neural Networks.” In <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, 2:1536–46. SciTePress, 2026. <a href=\"https://doi.org/10.5220/0014326500004052\">https://doi.org/10.5220/0014326500004052</a>.","ieee":"A. Hatua, T. Nguyen, F. Cano Cordoba, and A. Sung, “Machine unlearning using forgetting neural networks,” in <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, Marbella, Spain, 2026, vol. 2, pp. 1536–1546.","ista":"Hatua A, Nguyen T, Cano Cordoba F, Sung A. 2026. Machine unlearning using forgetting neural networks. Proceedings of the 18th International Conference on Agents and Artificial Intelligence. ICAART: International Conference on Agents and Artificial Intelligence vol. 2, 1536–1546.","ama":"Hatua A, Nguyen T, Cano Cordoba F, Sung A. Machine unlearning using forgetting neural networks. In: <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>. Vol 2. SciTePress; 2026:1536-1546. doi:<a href=\"https://doi.org/10.5220/0014326500004052\">10.5220/0014326500004052</a>"},"conference":{"start_date":"2026-03-05","end_date":"2026-03-08","location":"Marbella, Spain","name":"ICAART: International Conference on Agents and Artificial Intelligence"},"date_updated":"2026-07-16T09:02:53Z","date_published":"2026-06-30T00:00:00Z","das_tickbox":"1","quality_controlled":"1","article_processing_charge":"No","publication_identifier":{"eissn":["2184-433X"],"isbn":["9789897587962"]},"status":"public","day":"30","department":[{"_id":"ToHe"}],"date_created":"2026-07-13T09:46:46Z","author":[{"last_name":"Hatua","first_name":"Amartya","full_name":"Hatua, Amartya"},{"full_name":"Nguyen, Trung","last_name":"Nguyen","first_name":"Trung"},{"full_name":"Cano Cordoba, Filip","orcid":"0000-0002-0783-904X","first_name":"Filip","last_name":"Cano Cordoba","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1"},{"full_name":"Sung, Andrew","last_name":"Sung","first_name":"Andrew"}],"publisher":"SciTePress","external_id":{"arxiv":["2410.22374"]},"OA_place":"repository","month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2410.22374"}],"arxiv":1,"abstract":[{"lang":"eng","text":"Modern computer systems store vast amounts of personal data, enabling advances in AI and ML but risking user privacy and trust. For privacy reasons, it is sometimes desired for an ML model to forget part of the data it was trained on. In this paper, we introduce a novel unlearning approach based on Forgetting Neural Networks (FNNs), a neuroscience-inspired architecture that explicitly encodes forgetting through multiplicative decay factors. While FNNs had previously been studied as a theoretical construct, we provide the first concrete implementation and demonstrate their effectiveness for targeted unlearning. We propose several variants with per-neuron forgetting factors, including rank-based assignments guided by activation levels, and evaluate them on MNIST and Fashion-MNIST benchmarks. Our method systematically removes information associated with forget sets while preserving performance on retained data. Membership inference attacks confirm the effectiveness of FNN-based unlearning in erasing information about the training data from the neural network. These results establish FNNs as a promising foundation for efficient and interpretable unlearning. "}],"doi":"10.5220/0014326500004052","scopus_import":"1","keyword":["Machine Unlearning","Neuroscience-Inspired Machine Learning","Membership Inference Attacks"],"publication_status":"published","page":"1536-1546","_id":"22294","publication":"Proceedings of the 18th International Conference on Agents and Artificial Intelligence","title":"Machine unlearning using forgetting neural networks","volume":2,"year":"2026","oa_version":"Preprint","oa":1},{"has_accepted_license":"1","ddc":["000"],"year":"2026","oa_version":"Published Version","oa":1,"file":[{"date_created":"2026-07-16T09:29:08Z","file_name":"2026_ACMMgmtData_Aryanfard.pdf","checksum":"21a48a620e415a31a3874077c55bc6c3","access_level":"open_access","file_size":934963,"file_id":"22349","success":1,"creator":"dernst","content_type":"application/pdf","date_updated":"2026-07-16T09:29:08Z","relation":"main_file"}],"publication":"Proceedings of the ACM on Management of Data","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"volume":4,"title":"Improved lower bounds for privacy under continual release","PlanS_conform":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We study the problem of continually releasing statistics of an evolving dataset under differential privacy. In the event-level setting, we show the first polynomial lower bounds on the additive error for insertions-only graph problems such as maximum matching, degree histogram and k-core number computation. These results represent an exponential improvement on the polylogarithmic lower bounds of Fichtenberger, Henzinger and Ost [ESA 2021] for the former two problems, and are the first lower bounds in the continual release setting for the latter problem. Our results run counter to the intuition that the difference between insertions-only vs fully dynamic updates causes the gap between polylogarithmic and polynomial additive error. Indeed, we show that for estimating the size of the maximum matching or k-core number of a vertex, allowing small multiplicative approximations is what brings the additive error down to polylogarithmic. We complement these results with improved upper bounds on the additive error when no multiplicative approximation is allowed.\r\nBeyond graphs, our techniques also show that polynomial additive error is unavoidable for the Simultaneous Norm Estimation problem in the insertions-only setting. When multiplicative approximations are allowed, we circumvent this lower bound by giving the first continual mechanism with polylogarithmic additive error under (1 + ζ) multiplicative approximations, for any ζ > 0, for estimating all monotone symmetric norms simultaneously.\r\nIn the item-level setting, we show polynomial lower bounds on the product of the multiplicative and the additive error of continual mechanisms for a large range of graph problems. To the best of our knowledge, these are the first lower bounds shown for any differentially private mechanism under continual release with multiplicative error. To obtain these results, we prove a new lower bound on the product of multiplicative and additive error for the 1-Way-Marginals problem, and give reductions from 1-Way-Marginals to our desired graph problems. This generalizes the prior results of Hardt and Talwar [STOC 2010] and Bun, Ullman and Vadhan [STOC 2014, SIAM J. Comput. 2018], who gave lower bounds on the additive error for the special case of mechanisms with no multiplicative error.","lang":"eng"}],"arxiv":1,"doi":"10.1145/3801903","scopus_import":"1","page":"1-27","publication_status":"published","issue":"2","_id":"22322","acknowledgement":"Bardiya Aryanfard and Monika Henzinger were supported by the European Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation programme (Grant agreement\r\nNo. 101019564). For open access purposes, the author has applied a CC BY public copyright\r\nlicense to any author-accepted manuscript version arising from this submission. Funded by the\r\nEuropean union. Views and opinions expressed are however those of the author(s) only and do\r\nnot necessarily reflect those of the European Union or the European Research Council Executive\r\nAgency. Neither the European Union nor the granting authority can be held responsible for them","OA_place":"publisher","month":"06","author":[{"id":"1e8f4084-31df-11ee-b195-f706b4b77091","last_name":"Aryanfard","first_name":"Bardiya","full_name":"Aryanfard, Bardiya"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"last_name":"Saulpic","id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","first_name":"David","full_name":"Saulpic, David"},{"full_name":"Sricharan, A. R.","last_name":"Sricharan","first_name":"A. R."}],"article_type":"original","publisher":"Association for Computing Machinery","external_id":{"arxiv":["2512.15981"]},"publication_identifier":{"issn":["2836-6573"]},"article_processing_charge":"Yes","status":"public","day":"01","corr_author":"1","department":[{"_id":"MoHe"},{"_id":"GradSch"}],"date_created":"2026-07-14T05:33:58Z","citation":{"apa":"Aryanfard, B., Henzinger, M., Saulpic, D., &#38; Sricharan, A. R. (2026). Improved lower bounds for privacy under continual release. <i>Proceedings of the ACM on Management of Data</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3801903\">https://doi.org/10.1145/3801903</a>","chicago":"Aryanfard, Bardiya, Monika Henzinger, David Saulpic, and A. R. Sricharan. “Improved Lower Bounds for Privacy under Continual Release.” <i>Proceedings of the ACM on Management of Data</i>. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3801903\">https://doi.org/10.1145/3801903</a>.","short":"B. Aryanfard, M. Henzinger, D. Saulpic, A.R. Sricharan, Proceedings of the ACM on Management of Data 4 (2026) 1–27.","mla":"Aryanfard, Bardiya, et al. “Improved Lower Bounds for Privacy under Continual Release.” <i>Proceedings of the ACM on Management of Data</i>, vol. 4, no. 2, Association for Computing Machinery, 2026, pp. 1–27, doi:<a href=\"https://doi.org/10.1145/3801903\">10.1145/3801903</a>.","ieee":"B. Aryanfard, M. Henzinger, D. Saulpic, and A. R. Sricharan, “Improved lower bounds for privacy under continual release,” <i>Proceedings of the ACM on Management of Data</i>, vol. 4, no. 2. Association for Computing Machinery, pp. 1–27, 2026.","ama":"Aryanfard B, Henzinger M, Saulpic D, Sricharan AR. Improved lower bounds for privacy under continual release. <i>Proceedings of the ACM on Management of Data</i>. 2026;4(2):1-27. doi:<a href=\"https://doi.org/10.1145/3801903\">10.1145/3801903</a>","ista":"Aryanfard B, Henzinger M, Saulpic D, Sricharan AR. 2026. Improved lower bounds for privacy under continual release. Proceedings of the ACM on Management of Data. 4(2), 1–27."},"date_updated":"2026-07-16T09:30:31Z","supplementarymaterial":"no","date_published":"2026-06-01T00:00:00Z","das_tickbox":"0","quality_controlled":"1","researchdata_availability":"no","file_date_updated":"2026-07-16T09:29:08Z","language":[{"iso":"eng"}],"type":"journal_article","OA_type":"gold","project":[{"call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564"}],"intvolume":"         4"},{"doi":"10.1103/mbjk-v4ym","scopus_import":"1","PlanS_conform":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"In many developmental systems, cells differentiate into a tissue by reading out morphogen concentration fields, a process fundamentally limited by noise. How much can the precision of this process be improved by nonlocal information, e.g., via cell-cell communication? Using a Bayes-optimal framework, we show that positional inference depends crucially on morphogen spatial correlations and on the \"structural prior\" that encodes the geometry of the cellular lattice performing the readout, thereby determining what a cell can reliably assume about the position of its neighbors when interpreting nonlocal morphogen signals. We derive upper bounds on positional information gain due to nonlocal readout and identify signal processing algorithms that approximate optimal positional inference, as well as simple chemical reaction schemes which implement such algorithms. Our theory suggests that correlational information can be exploited to significantly enhance developmental precision.","lang":"eng"}],"publication_status":"published","_id":"22326","acknowledgement":"This work was supported in part\r\nby European Research Council No. ERC-2023-SyG\r\n“DynaTrans” Grant No. 101118866 (G. T.). We thank\r\nPieter Rein ten Wolde and Vahe Galstyan for stimulating\r\ndiscussions.","OA_place":"publisher","month":"07","year":"2026","ddc":["530"],"has_accepted_license":"1","file":[{"checksum":"28861d31d0f6cf541aaca04faaed1767","file_name":"2026_PhysicalReviewLetters_Zhang.pdf","date_created":"2026-07-16T09:54:55Z","file_size":2550345,"access_level":"open_access","creator":"dernst","success":1,"content_type":"application/pdf","file_id":"22352","relation":"main_file","date_updated":"2026-07-16T09:54:55Z"}],"oa":1,"oa_version":"Published Version","publication":"Physical Review Letters","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Nonlocal decoding of positional and correlational information during development","volume":137,"citation":{"ieee":"C. Y. Zhang, P. Mateu Hoyos, D. Brückner, and G. Tkačik, “Nonlocal decoding of positional and correlational information during development,” <i>Physical Review Letters</i>, vol. 137. American Physical Society, 2026.","ista":"Zhang CY, Mateu Hoyos P, Brückner D, Tkačik G. 2026. Nonlocal decoding of positional and correlational information during development. Physical Review Letters. 137, 038401.","ama":"Zhang CY, Mateu Hoyos P, Brückner D, Tkačik G. Nonlocal decoding of positional and correlational information during development. <i>Physical Review Letters</i>. 2026;137. doi:<a href=\"https://doi.org/10.1103/mbjk-v4ym\">10.1103/mbjk-v4ym</a>","chicago":"Zhang, Chen Y, Pablo Mateu Hoyos, David Brückner, and Gašper Tkačik. “Nonlocal Decoding of Positional and Correlational Information during Development.” <i>Physical Review Letters</i>. American Physical Society, 2026. <a href=\"https://doi.org/10.1103/mbjk-v4ym\">https://doi.org/10.1103/mbjk-v4ym</a>.","apa":"Zhang, C. Y., Mateu Hoyos, P., Brückner, D., &#38; Tkačik, G. (2026). Nonlocal decoding of positional and correlational information during development. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/mbjk-v4ym\">https://doi.org/10.1103/mbjk-v4ym</a>","mla":"Zhang, Chen Y., et al. “Nonlocal Decoding of Positional and Correlational Information during Development.” <i>Physical Review Letters</i>, vol. 137, 038401, American Physical Society, 2026, doi:<a href=\"https://doi.org/10.1103/mbjk-v4ym\">10.1103/mbjk-v4ym</a>.","short":"C.Y. Zhang, P. Mateu Hoyos, D. Brückner, G. Tkačik, Physical Review Letters 137 (2026)."},"date_updated":"2026-07-16T09:58:04Z","das_tickbox":"1","researchdata_availability":"no","file_date_updated":"2026-07-16T09:54:55Z","quality_controlled":"1","date_published":"2026-07-15T00:00:00Z","supplementarymaterial":"no","OA_type":"hybrid","type":"journal_article","project":[{"_id":"7bfe6a29-9f16-11ee-852c-c0da5e2045d9","grant_number":"101118866","name":"Transcription in 4D: the dynamic interplay between chromatin architecture and gene expression in developing pseudo-embryos"}],"language":[{"iso":"eng"}],"dataavailabilitystatement":"Code to evaluate PI, to run algorithmic implementations of ALP and RLP decoding, and to\r\nperform simulations is publicly available at https://github.com/alex-chenyi-zhang/nonlocdec_pici.","intvolume":"       137","article_type":"original","publisher":"American Physical Society","author":[{"full_name":"Zhang, Chen Y","first_name":"Chen Y","last_name":"Zhang","id":"81b43fb8-c9d5-11ef-bf68-ade532a1f204"},{"last_name":"Mateu Hoyos","id":"50b236c7-50c1-11ef-bb9a-a2375694f8b5","first_name":"Pablo","full_name":"Mateu Hoyos, Pablo"},{"orcid":"0000-0001-7205-2975","full_name":"Brückner, David","first_name":"David","id":"e1e86031-6537-11eb-953a-f7ab92be508d","last_name":"Brückner"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkačik","first_name":"Gašper","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455"}],"article_number":"038401","day":"15","publication_identifier":{"eissn":[" 1079-7114"],"issn":["0031-9007"]},"status":"public","article_processing_charge":"Yes (via OA deal)","department":[{"_id":"GaTk"},{"_id":"EdHa"},{"_id":"GradSch"}],"date_created":"2026-07-14T05:38:28Z","corr_author":"1"},{"doi":"10.1038/s41467-026-75416-8","scopus_import":"1","PlanS_conform":"1","main_file_link":[{"url":"https://doi.org/10.1038/s41467-026-75416-8","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"RNA polymerase II (Pol II) must be assembled in the cytoplasm before it enters the nucleus, where it transcribes protein-coding genes. Although transcription by Pol II is intensively studied, how this central multi-subunit enzyme is made and the role of dedicated assembly factors remains unclear. Here, we report the integrative structural analysis of a native human Pol II from the cytoplasm captured near the end of biogenesis. The complex contains Gdown1 and three biogenesis factors – RPAP2 and the critical small GTPases GPN1 and GPN3. Cryo-EM analysis of the complex reveals how Gdown1 and RPAP2 associate with Pol II and prevent the premature association of transcription factors. Further biochemical and cryo-EM analysis reveals how RPAP2 tethers GPN1–GPN3 to the complex and how the assembly of the RPAP2–GPN1–GPN3 complex is controlled by GTP hydrolysis. The combined results uncover a network of interactions that chaperone cytoplasmic Pol II to prevent aberrant interactions, reveal a molecular switch regulating biogenesis factor association, and suggest a general mechanism for the action of GPN-loop GTPase family of enzymes.","lang":"eng"}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"EM-Fac"},{"_id":"ScienComp"},{"_id":"PreCl"}],"publication_status":"epub_ahead","_id":"22333","acknowledgement":"We thank A. Salmazo for assistance with Pol II purification. We thank staff at the Vienna BioCenter Core Facilities (VBCF) Proteomics facility for immunoprecipitation-mass spectrometry analysis, and J.A. Stopp for assistance with IP-MS data visualization. This research was further supported by the Scientific Service Units (SSUs) of ISTA through resources provided by the Lab Support Facility (LSF), Electron Microscopy Facility (EMF), Scientific Computing (SciComp), and the Preclinical Facility (PCF). F.H. was funded by the Endowed Professorship of the Lower Austria Research Funding Agency (GFF NÖ) and by the Austrian Research Promotion Agency (FFG) through the COIN Establishment Grant n.o. 45624401.","OA_place":"publisher","month":"07","year":"2026","ddc":["570"],"has_accepted_license":"1","oa":1,"oa_version":"Published Version","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Nature Communications","title":"Structure of cytoplasmic RNA polymerase II","biorxivid":1,"citation":{"apa":"Hlavata, A., Neuditschko, B., Schellhaas, U., Plaschka, C., Herzog, F., &#38; Bernecky, C. (2026). Structure of cytoplasmic RNA polymerase II. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-75416-8\">https://doi.org/10.1038/s41467-026-75416-8</a>","chicago":"Hlavata, Annamaria, Benjamin Neuditschko, Ulla Schellhaas, Clemens Plaschka, Franz Herzog, and Carrie Bernecky. “Structure of Cytoplasmic RNA Polymerase II.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-75416-8\">https://doi.org/10.1038/s41467-026-75416-8</a>.","mla":"Hlavata, Annamaria, et al. “Structure of Cytoplasmic RNA Polymerase II.” <i>Nature Communications</i>, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-75416-8\">10.1038/s41467-026-75416-8</a>.","short":"A. Hlavata, B. Neuditschko, U. Schellhaas, C. Plaschka, F. Herzog, C. Bernecky, Nature Communications (2026).","ista":"Hlavata A, Neuditschko B, Schellhaas U, Plaschka C, Herzog F, Bernecky C. 2026. Structure of cytoplasmic RNA polymerase II. Nature Communications.","ama":"Hlavata A, Neuditschko B, Schellhaas U, Plaschka C, Herzog F, Bernecky C. Structure of cytoplasmic RNA polymerase II. <i>Nature Communications</i>. 2026. doi:<a href=\"https://doi.org/10.1038/s41467-026-75416-8\">10.1038/s41467-026-75416-8</a>","ieee":"A. Hlavata, B. Neuditschko, U. Schellhaas, C. Plaschka, F. Herzog, and C. Bernecky, “Structure of cytoplasmic RNA polymerase II,” <i>Nature Communications</i>. Springer Nature, 2026."},"date_updated":"2026-07-16T11:29:31Z","quality_controlled":"1","DOAJ_listed":"1","das_tickbox":"1","researchdata_availability":"yes","date_published":"2026-07-13T00:00:00Z","supplementarymaterial":"yes","type":"journal_article","OA_type":"gold","language":[{"iso":"eng"}],"dataavailabilitystatement":"The\r\nc ryo EM maps generated in this study were deposited to the EM Data Bank under the\r\naccession codes: EMD 55583 [https://www.ebi.ac.uk/pdbe/entry/emdb/EMD 55583\r\n(Pol II Gdown1 RPAP2 composite map), EMD 55578\r\n[https://www.ebi.ac.uk/pdbe/entry/emdb/EMD 55578 Pol II Gdown1 RPAP2 Pol II core\r\nmap EMD 55579 [https://www.ebi.ac.uk/pdbe/entry/emdb/EMD 55579 Pol II\r\nGdown1 RPAP2 Pol II stalk map EMD 55580\r\n[https://www.ebi.ac.uk/pdbe/entry/emdb/EMD 55580 Pol II Gdown1 RPAP2 RPAP2\r\nmap EMD 55581 [https://www.ebi.ac.uk/pdbe/entry/emdb/EMD 55 581 Pol II\r\nGdown1 RPAP2 Gdown1 N terminus map EMD 55582\r\n[https://www.ebi.ac.uk/pdbe/entry/emdb/EMD 55582 Pol II Gdown1 RPAP2 Gdown1\r\nC terminus map and EMD 55585 [https://www.ebi.ac.uk/pdbe/entry/emdb/EMD\r\n55585 RPAP2 GPN1 GPN3 map Model coordi nates were deposited to the PDBe under\r\nthe accession codes: 9T5H [http://doi.org/10.2210/pdb 9T5H / (Pol II Gdown1\r\nRPAP2 complex structure) and 9T5J [http://doi.org/10.2210/pdb 9T5H / (GPN1\r\nGPN3 RPAP2 structure). Immunoprecipitation mass spectrometry and crosslinking mass\r\nspectrometry proteomics data have been deposited to the ProteomeXchange Consortium\r\nvia the PRIDE partner repository with the dataset identifiers PXD071638\r\n[http://proteomecentral.proteomexchange.org/cgi/GetDataset?ID=PXD 071638 and\r\nP XD070852\r\n[http://proteomecentral.proteomexchange.org/cgi/GetDataset?ID=PXD 070852\r\nAlphaFold3 structure predictions have been deposited to the Zenodo repository\r\nhttps://doi.org/10.5281/zenodo.20687910 P reviously published model coordinates\r\nwere utilized and are available at the PDB under the accession codes 8QEP\r\n[http://doi.org/10.2210/pdb 8QEP / 9BZ 0 [http://doi.org/10.2210/pdb 9BZ 0 /\r\nand 7B7U [http://doi.org/10.2210/pdb 7B7U / Source Data are provided with this\r\npaper.","publisher":"Springer Nature","article_type":"original","external_id":{"biorxivid":["10.64898/2025.12.10.692585"]},"author":[{"full_name":"Hlavata, Annamaria","last_name":"Hlavata","id":"36062FEC-F248-11E8-B48F-1D18A9856A87","first_name":"Annamaria"},{"first_name":"Benjamin","last_name":"Neuditschko","full_name":"Neuditschko, Benjamin"},{"first_name":"Ulla","last_name":"Schellhaas","full_name":"Schellhaas, Ulla"},{"full_name":"Plaschka, Clemens","first_name":"Clemens","last_name":"Plaschka"},{"last_name":"Herzog","first_name":"Franz","full_name":"Herzog, Franz"},{"full_name":"Bernecky, Carrie A","orcid":"0000-0003-0893-7036","first_name":"Carrie A","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","last_name":"Bernecky"}],"day":"13","article_processing_charge":"Yes","publication_identifier":{"eissn":["2041-1723"]},"status":"public","department":[{"_id":"CaBe"}],"date_created":"2026-07-14T07:27:59Z","corr_author":"1"},{"issue":"1","_id":"21777","pmid":1,"page":"29-37","publication_status":"published","scopus_import":"1","doi":"10.5194/mr-7-29-2026","abstract":[{"lang":"eng","text":"The advantageous characteristics attributed to the 19F nucleus have made it a popular target for nuclear magnetic resonance (NMR) once again in recent years. Aside from solution NMR, an increasing number of studies have been conducted applying solid-state magic-angle spinning (MAS) NMR to fluorine-labelled samples. Here, the high chemical shift anisotropy and strong dipolar couplings can be utilised to get structural insights into proteins and measure long distances. Despite increasing popularity and promising benefits, the sensitivity of biomolecular 19F MAS NMR often suffers from slow longitudinal T1 relaxation and therefore long recycle delays. In this work, we expand paramagnetic doping, an approach commonly used to reduce proton T1 relaxation times, to 19F-labelled biological samples. We study the effect of Gd(DTPA) and Gd(DTPA-BMA) on 19F T1 and T2, and 13C T1 and T2 relaxation in a [5-19F13C]-tryptophan-labelled protein via 19F-detected MAS NMR experiments. The observed paramagnetic relaxation enhancement substantially reduces measurement times of 19F MAS NMR experiments without compromising resolution. Additionally, we report the chemical shift assignments of all four fluorotryptophan signals in the 12×39 kDa-large protein TET2 using a mutagenesis approach."}],"acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","PlanS_conform":"1","main_file_link":[{"url":"https://doi.org/10.5194/mr-7-29-2026","open_access":"1"}],"month":"04","OA_place":"publisher","acknowledgement":"We thank Ben P. Tatman for insightful discussions. This research was supported by the Scientific Service Units (SSUs) of ISTA through resources provided by the Nuclear Magnetic Resonance Facility and the Lab Support Facility. We thank Prof. Tobias Madl (Medical University Graz) for a sample of Omniscan. Lea M. Becker is the recipient of a DOC fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria (grant no. PR10660EAW01).","oa_version":"Published Version","oa":1,"ddc":["540"],"year":"2026","has_accepted_license":"1","volume":7,"title":"Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Magnetic Resonance","DOAJ_listed":"1","quality_controlled":"1","date_published":"2026-04-16T00:00:00Z","date_updated":"2026-07-20T09:49:12Z","citation":{"ama":"Becker LM, Toscano G, Kapitonova A, et al. Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants. <i>Magnetic Resonance</i>. 2026;7(1):29-37. doi:<a href=\"https://doi.org/10.5194/mr-7-29-2026\">10.5194/mr-7-29-2026</a>","ieee":"L. M. Becker <i>et al.</i>, “Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants,” <i>Magnetic Resonance</i>, vol. 7, no. 1. Copernicus Publications, pp. 29–37, 2026.","ista":"Becker LM, Toscano G, Kapitonova A, Singh R, Guillerm U, Lichtenecker RJ, Schanda P. 2026. Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants. Magnetic Resonance. 7(1), 29–37.","mla":"Becker, Lea Marie, et al. “Accelerated 19F Biomolecular Magic-Angle Spinning NMR with Paramagnetic Dopants.” <i>Magnetic Resonance</i>, vol. 7, no. 1, Copernicus Publications, 2026, pp. 29–37, doi:<a href=\"https://doi.org/10.5194/mr-7-29-2026\">10.5194/mr-7-29-2026</a>.","short":"L.M. Becker, G. Toscano, A. Kapitonova, R. Singh, U. Guillerm, R.J. Lichtenecker, P. Schanda, Magnetic Resonance 7 (2026) 29–37.","apa":"Becker, L. M., Toscano, G., Kapitonova, A., Singh, R., Guillerm, U., Lichtenecker, R. J., &#38; Schanda, P. (2026). Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants. <i>Magnetic Resonance</i>. Copernicus Publications. <a href=\"https://doi.org/10.5194/mr-7-29-2026\">https://doi.org/10.5194/mr-7-29-2026</a>","chicago":"Becker, Lea Marie, Giorgia Toscano, Anna Kapitonova, Rajkumar Singh, Undina Guillerm, Roman J. Lichtenecker, and Paul Schanda. “Accelerated 19F Biomolecular Magic-Angle Spinning NMR with Paramagnetic Dopants.” <i>Magnetic Resonance</i>. Copernicus Publications, 2026. <a href=\"https://doi.org/10.5194/mr-7-29-2026\">https://doi.org/10.5194/mr-7-29-2026</a>."},"intvolume":"         7","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches","grant_number":"26777","_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0"}],"OA_type":"gold","type":"journal_article","language":[{"iso":"eng"}],"external_id":{"pmid":["42057802"]},"publisher":"Copernicus Publications","article_type":"original","author":[{"id":"36336939-eb97-11eb-a6c2-c83f1214ca79","last_name":"Becker","first_name":"Lea Marie","orcid":"0000-0002-6401-5151","full_name":"Becker, Lea Marie"},{"first_name":"Giorgia","id":"334a5e40-8747-11f0-b671-ba1f5154b4b4","last_name":"Toscano","full_name":"Toscano, Giorgia"},{"full_name":"Kapitonova, Anna","first_name":"Anna","last_name":"Kapitonova","id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471"},{"full_name":"Singh, Rajkumar","first_name":"Rajkumar","id":"a3089acd-6806-11ee-bacc-f0c7d500ad20","last_name":"Singh"},{"full_name":"Guillerm, Undina","first_name":"Undina","id":"bb74f472-ae54-11eb-9835-bc9c22fb1183","last_name":"Guillerm"},{"full_name":"Lichtenecker, Roman J.","last_name":"Lichtenecker","first_name":"Roman J."},{"orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul"}],"date_created":"2026-05-03T22:01:36Z","department":[{"_id":"PaSc"},{"_id":"GradSch"}],"corr_author":"1","day":"16","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"22334"}]},"publication_identifier":{"eissn":["2699-0016"]},"article_processing_charge":"Yes","status":"public"},{"year":"2026","oa":1,"oa_version":"Preprint","title":"Mesoscopic eigenvalue statistics for correlated random matrices","ec_funded":1,"keyword":["Central limit theorem","universality","matrix Dyson equation","multi-resolvent local law"],"doi":"10.48550/arXiv.2607.05848","arxiv":1,"abstract":[{"lang":"eng","text":"We prove a mesoscopic central limit theorem for linear eigenvalue statistics of correlated Hermitian random matrices. The class considered here includes Wigner and Wigner-type matrices, as well as models whose entry correlations decay polynomially in the distance between index pairs. The proof combines a multivariate cumulant expansion with multi-resolvent local laws and a detailed analysis of the resulting variance kernel on the operator-level."}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2607.05848","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"22359","publication_status":"submitted","acknowledgement":"Supported by ERC Advanced Grant “RMTBeyond” No. 101020331","month":"07","OA_place":"repository","external_id":{"arxiv":["2607.05848"]},"author":[{"full_name":"Lee, Jaehun","first_name":"Jaehun","id":"96155047-f36a-11ef-b766-8b5ae7cecd49","last_name":"Lee"},{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László"}],"day":"07","article_number":"2607.05848","status":"public","article_processing_charge":"No","date_created":"2026-07-18T08:59:02Z","department":[{"_id":"LaEr"}],"corr_author":"1","date_updated":"2026-07-20T10:55:10Z","citation":{"chicago":"Lee, Jaehun, and László Erdös. “Mesoscopic Eigenvalue Statistics for Correlated Random Matrices,” n.d. <a href=\"https://doi.org/10.48550/arXiv.2607.05848\">https://doi.org/10.48550/arXiv.2607.05848</a>.","apa":"Lee, J., &#38; Erdös, L. (n.d.). Mesoscopic eigenvalue statistics for correlated random matrices. <a href=\"https://doi.org/10.48550/arXiv.2607.05848\">https://doi.org/10.48550/arXiv.2607.05848</a>","short":"J. Lee, L. Erdös, (n.d.).","mla":"Lee, Jaehun, and László Erdös. <i>Mesoscopic Eigenvalue Statistics for Correlated Random Matrices</i>. 2607.05848, doi:<a href=\"https://doi.org/10.48550/arXiv.2607.05848\">10.48550/arXiv.2607.05848</a>.","ieee":"J. Lee and L. Erdös, “Mesoscopic eigenvalue statistics for correlated random matrices.” .","ama":"Lee J, Erdös L. Mesoscopic eigenvalue statistics for correlated random matrices. doi:<a href=\"https://doi.org/10.48550/arXiv.2607.05848\">10.48550/arXiv.2607.05848</a>","ista":"Lee J, Erdös L. Mesoscopic eigenvalue statistics for correlated random matrices. 2607.05848."},"das_tickbox":"1","date_published":"2026-07-07T00:00:00Z","OA_type":"green","type":"preprint","project":[{"call_identifier":"H2020","grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"language":[{"iso":"eng"}]},{"year":"2026","oa_version":"Preprint","oa":1,"extern":"1","publication":"Journal of Functional Analysis","volume":290,"title":"Phase transition for the bottom singular vector of rectangular random matrices","doi":"10.1016/j.jfa.2025.111266","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2409.01819","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"abstract":[{"text":"In this paper, we consider the rectangular random matrix\r\nX =(xij ) ∈ RN×n whose entries are iid with tail P(|xij | >\r\nt) ∼ t−α for some α> 0. We consider the regime N(n)/n →\r\na > 1 as n tends to infinity. Our main interest lies in the right\r\nsingular vector corresponding to the smallest singular value,\r\nwhich we will refer to as the ``bottom singular vector'', denoted\r\nby 𝔲. In this paper, we prove the following phase transition\r\nregarding the localization length of 𝔲: when α< 2 the\r\nlocalization length is O(n/ log n); when α> 2 the localization\r\nlength is of order n. Similar results hold for all right singular\r\nvectors around the smallest singular value. The variational\r\ndefinition of the bottom singular vector suggests that the\r\nmechanism for this localization-delocalization transition when\r\nα goes across 2 is intrinsically different from the one for the\r\ntop singular vector when α goes across 4","lang":"eng"}],"publication_status":"published","_id":"22360","issue":"4","OA_place":"repository","month":"02","article_type":"original","publisher":"Elsevier","external_id":{"arxiv":["2409.01819"]},"author":[{"full_name":"Bao, Zhigang","last_name":"Bao","first_name":"Zhigang"},{"last_name":"Lee","id":"96155047-f36a-11ef-b766-8b5ae7cecd49","first_name":"Jaehun","full_name":"Lee, Jaehun"},{"first_name":"Xiaocong","last_name":"Xu","full_name":"Xu, Xiaocong"}],"article_number":"111266","day":"15","status":"public","publication_identifier":{"eissn":["1096-0783"],"issn":["0022-1236"]},"article_processing_charge":"No","date_created":"2026-07-18T10:32:41Z","citation":{"mla":"Bao, Zhigang, et al. “Phase Transition for the Bottom Singular Vector of Rectangular Random Matrices.” <i>Journal of Functional Analysis</i>, vol. 290, no. 4, 111266, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.jfa.2025.111266\">10.1016/j.jfa.2025.111266</a>.","short":"Z. Bao, J. Lee, X. Xu, Journal of Functional Analysis 290 (2026).","chicago":"Bao, Zhigang, Jaehun Lee, and Xiaocong Xu. “Phase Transition for the Bottom Singular Vector of Rectangular Random Matrices.” <i>Journal of Functional Analysis</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.jfa.2025.111266\">https://doi.org/10.1016/j.jfa.2025.111266</a>.","apa":"Bao, Z., Lee, J., &#38; Xu, X. (2026). Phase transition for the bottom singular vector of rectangular random matrices. <i>Journal of Functional Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jfa.2025.111266\">https://doi.org/10.1016/j.jfa.2025.111266</a>","ista":"Bao Z, Lee J, Xu X. 2026. Phase transition for the bottom singular vector of rectangular random matrices. Journal of Functional Analysis. 290(4), 111266.","ieee":"Z. Bao, J. Lee, and X. Xu, “Phase transition for the bottom singular vector of rectangular random matrices,” <i>Journal of Functional Analysis</i>, vol. 290, no. 4. Elsevier, 2026.","ama":"Bao Z, Lee J, Xu X. Phase transition for the bottom singular vector of rectangular random matrices. <i>Journal of Functional Analysis</i>. 2026;290(4). doi:<a href=\"https://doi.org/10.1016/j.jfa.2025.111266\">10.1016/j.jfa.2025.111266</a>"},"date_updated":"2026-07-20T11:01:15Z","quality_controlled":"1","date_published":"2026-02-15T00:00:00Z","OA_type":"green","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"       290"}]