[{"author":[{"full_name":"Agafonova, Sofya","first_name":"Sofya","id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80","orcid":"0000-0003-0582-2946","last_name":"Agafonova"},{"full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko"},{"last_name":"Volosniev","orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem"}],"scopus_import":"1","publication_identifier":{"eissn":["2469-9934"],"issn":["2469-9926"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2302.01022"}],"supplementarymaterial":"yes","article_number":"L061304","corr_author":"1","article_processing_charge":"No","type":"journal_article","day":"20","fulldoi":"https://doi.org/10.1103/PhysRevA.107.L061304","language":[{"iso":"eng"}],"arxiv":1,"external_id":{"arxiv":["2302.01022"],"isi":["001019748000005"]},"date_published":"2023-06-20T00:00:00Z","doi":"10.1103/PhysRevA.107.L061304","researchdata_availability":"no","volume":107,"year":"2023","citation":{"ista":"Agafonova S, Lemeshko M, Volosniev A. 2023. Finite-range bias in fitting three-body loss to the zero-range model. Physical Review A. 107(6), L061304.","ama":"Agafonova S, Lemeshko M, Volosniev A. Finite-range bias in fitting three-body loss to the zero-range model. <i>Physical Review A</i>. 2023;107(6). doi:<a href=\"https://doi.org/10.1103/PhysRevA.107.L061304\">10.1103/PhysRevA.107.L061304</a>","mla":"Agafonova, Sofia, et al. “Finite-Range Bias in Fitting Three-Body Loss to the Zero-Range Model.” <i>Physical Review A</i>, vol. 107, no. 6, L061304, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevA.107.L061304\">10.1103/PhysRevA.107.L061304</a>.","chicago":"Agafonova, Sofia, Mikhail Lemeshko, and Artem Volosniev. “Finite-Range Bias in Fitting Three-Body Loss to the Zero-Range Model.” <i>Physical Review A</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevA.107.L061304\">https://doi.org/10.1103/PhysRevA.107.L061304</a>.","apa":"Agafonova, S., Lemeshko, M., &#38; Volosniev, A. (2023). Finite-range bias in fitting three-body loss to the zero-range model. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.107.L061304\">https://doi.org/10.1103/PhysRevA.107.L061304</a>","short":"S. Agafonova, M. Lemeshko, A. Volosniev, Physical Review A 107 (2023).","ieee":"S. Agafonova, M. Lemeshko, and A. Volosniev, “Finite-range bias in fitting three-body loss to the zero-range model,” <i>Physical Review A</i>, vol. 107, no. 6. American Physical Society, 2023."},"publication_status":"published","abstract":[{"lang":"eng","text":"We study the impact of finite-range physics on the zero-range-model analysis of three-body recombination in ultracold atoms. We find that temperature dependence of the zero-range parameters can vary from one set of measurements to another as it may be driven by the distribution of error bars in the experiment, and not by the underlying three-body physics. To study finite-temperature effects in three-body recombination beyond the zero-range physics, we introduce and examine a finite-range model based upon a hyperspherical formalism. The systematic error discussed in this Letter may provide a significant contribution to the error bars of measured three-body parameters."}],"title":"Finite-range bias in fitting three-body loss to the zero-range model","acknowledgement":"We thank Jan Arlt, Hans-Werner Hammer, and Karsten Riisager for useful discussions. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).","publisher":"American Physical Society","project":[{"name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425"}],"issue":"6","status":"public","quality_controlled":"1","month":"06","ec_funded":1,"_id":"13233","article_type":"letter_note","department":[{"_id":"MiLe"},{"_id":"OnHo"}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","date_created":"2023-07-16T22:01:10Z","oa":1,"date_updated":"2026-07-08T08:30:05Z","isi":1,"das_tickbox":"0","intvolume":"       107","oa_version":"Preprint","publication":"Physical Review A"},{"fulldoi":"https://doi.org/10.1103/PhysRevApplied.19.064032","language":[{"iso":"eng"}],"external_id":{"arxiv":["2206.05746"],"isi":["001012022600004"]},"date_published":"2023-06-09T00:00:00Z","arxiv":1,"scopus_import":"1","publication_identifier":{"eissn":["2331-7019"]},"main_file_link":[{"url":"https://arxiv.org/abs/2206.05746","open_access":"1"}],"author":[{"full_name":"Phan, Duc T","first_name":"Duc T","id":"29C8C0B4-F248-11E8-B48F-1D18A9856A87","last_name":"Phan"},{"id":"85b43b21-15b2-11ec-abd3-e2c252cc2285","first_name":"Paul","full_name":"Falthansl-Scheinecker, Paul","last_name":"Falthansl-Scheinecker"},{"last_name":"Mishra","first_name":"Umang","id":"4328fa4c-f128-11eb-9611-c107b0fe4d51","full_name":"Mishra, Umang"},{"last_name":"Strickland","full_name":"Strickland, W. M.","first_name":"W. M."},{"last_name":"Langone","first_name":"D.","full_name":"Langone, D."},{"last_name":"Shabani","first_name":"J.","full_name":"Shabani, J."},{"first_name":"Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","full_name":"Higginbotham, Andrew P","last_name":"Higginbotham","orcid":"0000-0003-2607-2363"}],"article_number":"064032","corr_author":"1","supplementarymaterial":"yes","type":"journal_article","article_processing_charge":"No","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"day":"09","_id":"13264","month":"06","dataavailabilitystatement":"The raw data and the plotting code are available in the Supplemental Material at http://link.aps.org/supplemental/10.1103/PhysRevApplied.19.064032. Further data are available upon reasonable request.","date_created":"2023-07-23T22:01:12Z","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","article_type":"original","department":[{"_id":"AnHi"},{"_id":"OnHo"}],"das_tickbox":"1","related_material":{"record":[{"relation":"dissertation_contains","id":"14547","status":"public"}]},"oa":1,"date_updated":"2026-07-08T08:38:44Z","isi":1,"publication":"Physical Review Applied","oa_version":"Preprint","intvolume":"        19","doi":"10.1103/PhysRevApplied.19.064032","publication_status":"published","citation":{"ieee":"D. T. Phan <i>et al.</i>, “Gate-tunable superconductor-semiconductor parametric amplifier,” <i>Physical Review Applied</i>, vol. 19, no. 6. American Physical Society, 2023.","short":"D.T. Phan, P. Falthansl-Scheinecker, U. Mishra, W.M. Strickland, D. Langone, J. Shabani, A.P. Higginbotham, Physical Review Applied 19 (2023).","apa":"Phan, D. T., Falthansl-Scheinecker, P., Mishra, U., Strickland, W. M., Langone, D., Shabani, J., &#38; Higginbotham, A. P. (2023). Gate-tunable superconductor-semiconductor parametric amplifier. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevApplied.19.064032\">https://doi.org/10.1103/PhysRevApplied.19.064032</a>","chicago":"Phan, Duc T, Paul Falthansl-Scheinecker, Umang Mishra, W. M. Strickland, D. Langone, J. Shabani, and Andrew P Higginbotham. “Gate-Tunable Superconductor-Semiconductor Parametric Amplifier.” <i>Physical Review Applied</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/PhysRevApplied.19.064032\">https://doi.org/10.1103/PhysRevApplied.19.064032</a>.","mla":"Phan, Duc T., et al. “Gate-Tunable Superconductor-Semiconductor Parametric Amplifier.” <i>Physical Review Applied</i>, vol. 19, no. 6, 064032, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.19.064032\">10.1103/PhysRevApplied.19.064032</a>.","ama":"Phan DT, Falthansl-Scheinecker P, Mishra U, et al. Gate-tunable superconductor-semiconductor parametric amplifier. <i>Physical Review Applied</i>. 2023;19(6). doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.19.064032\">10.1103/PhysRevApplied.19.064032</a>","ista":"Phan DT, Falthansl-Scheinecker P, Mishra U, Strickland WM, Langone D, Shabani J, Higginbotham AP. 2023. Gate-tunable superconductor-semiconductor parametric amplifier. Physical Review Applied. 19(6), 064032."},"volume":19,"researchdata_availability":"yes (supplementary data)","year":"2023","acknowledgement":"We thank Shyam Shankar for helpful feedback on the manuscript. We gratefully acknowledge the support of the ISTA nanofabrication facility, the Miba Machine Shop, and the eMachine Shop. The NYU team acknowledges support from Army Research Office Grant No. W911NF2110303.","abstract":[{"lang":"eng","text":"We build a parametric amplifier with a Josephson field-effect transistor (JoFET) as the active element. The resonant frequency of the device is field-effect tunable over a range of 2 GHz. The JoFET amplifier has 20 dB of gain, 4 MHz of instantaneous bandwidth, and a 1-dB compression point of -125.5 dBm when operated at a fixed resonance frequency.\r\n\r\n"}],"title":"Gate-tunable superconductor-semiconductor parametric amplifier","quality_controlled":"1","publisher":"American Physical Society","status":"public","issue":"6"},{"OA_place":"repository","publication_status":"published","citation":{"ieee":"Y. Li, Y. Qiao, A. Wigderson, Y. Wigderson, and C. Zhang, “Connections between graphs and matrix spaces,” <i>Israel Journal of Mathematics</i>, vol. 256, no. 2. Springer Nature, pp. 513–580, 2023.","short":"Y. Li, Y. Qiao, A. Wigderson, Y. Wigderson, C. Zhang, Israel Journal of Mathematics 256 (2023) 513–580.","apa":"Li, Y., Qiao, Y., Wigderson, A., Wigderson, Y., &#38; Zhang, C. (2023). Connections between graphs and matrix spaces. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-023-2515-7\">https://doi.org/10.1007/s11856-023-2515-7</a>","chicago":"Li, Yinan, Youming Qiao, Avi Wigderson, Yuval Wigderson, and Chuanqi Zhang. “Connections between Graphs and Matrix Spaces.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s11856-023-2515-7\">https://doi.org/10.1007/s11856-023-2515-7</a>.","mla":"Li, Yinan, et al. “Connections between Graphs and Matrix Spaces.” <i>Israel Journal of Mathematics</i>, vol. 256, no. 2, Springer Nature, 2023, pp. 513–80, doi:<a href=\"https://doi.org/10.1007/s11856-023-2515-7\">10.1007/s11856-023-2515-7</a>.","ama":"Li Y, Qiao Y, Wigderson A, Wigderson Y, Zhang C. Connections between graphs and matrix spaces. <i>Israel Journal of Mathematics</i>. 2023;256(2):513-580. doi:<a href=\"https://doi.org/10.1007/s11856-023-2515-7\">10.1007/s11856-023-2515-7</a>","ista":"Li Y, Qiao Y, Wigderson A, Wigderson Y, Zhang C. 2023. Connections between graphs and matrix spaces. Israel Journal of Mathematics. 256(2), 513–580."},"year":"2023","volume":256,"doi":"10.1007/s11856-023-2515-7","OA_type":"green","quality_controlled":"1","issue":"2","status":"public","publisher":"Springer Nature","abstract":[{"lang":"eng","text":"Given a bipartite graph G, the graphical matrix space SG consists of\r\nmatrices whose non-zero entries can only be at those positions corresponding to edges in G. Tutte (J. London Math. Soc., 1947), Edmonds\r\n(J. Res. Nat. Bur. Standards Sect. B, 1967) and Lov´asz (FCT, 1979) observed connections between perfect matchings in G and full-rank matrices\r\nin SG. Dieudonn´e (Arch. Math., 1948) proved a tight upper bound on\r\nthe dimensions of those matrix spaces containing only singular matrices.\r\nThe starting point of this paper is a simultaneous generalization of these\r\ntwo classical results: we show that the largest dimension over subspaces\r\nof SG containing only singular matrices is equal to the maximum size over\r\nsubgraphs of G without perfect matchings, based on Meshulam’s proof of\r\nDieudonn´e’s result (Quart. J. Math., 1985).\r\nStarting from this result, we go on to establish more connections\r\nbetween properties of graphs and matrix spaces. For example, we\r\nestablish connections between acyclicity and nilpotency, between strong\r\nconnectivity and irreducibility, and between isomorphism and\r\nconjugacy/congruence. For each connection, we study three types of correspondences, namely the basic correspondence, the inherited correspondence (for subgraphs and subspaces), and the induced correspondence\r\n(for induced subgraphs and restrictions). Some correspondences lead to\r\nintriguing generalizations of classical results, such as Dieudonn´e’s result\r\nmentioned above, and a celebrated theorem of Gerstenhaber regarding the\r\nlargest dimension of nil matrix spaces (Amer. J. Math., 1958).\r\nFinally, we show some implications of our results to quantum information and present open problems in computational complexity motivated\r\nby these results."}],"title":"Connections between graphs and matrix spaces","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-29T10:52:37Z","article_type":"original","extern":"1","_id":"22162","month":"09","oa_version":"Preprint","publication":"Israel Journal of Mathematics","intvolume":"       256","date_updated":"2026-07-08T10:44:50Z","oa":1,"page":"513-580","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2206.04815","open_access":"1"}],"scopus_import":"1","publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]},"author":[{"first_name":"Yinan","full_name":"Li, Yinan","last_name":"Li"},{"full_name":"Qiao, Youming","first_name":"Youming","last_name":"Qiao"},{"last_name":"Wigderson","first_name":"Avi","full_name":"Wigderson, Avi"},{"last_name":"Wigderson","full_name":"Wigderson, Yuval","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5"},{"last_name":"Zhang","first_name":"Chuanqi","full_name":"Zhang, Chuanqi"}],"day":"01","type":"journal_article","article_processing_charge":"No","fulldoi":"https://doi.org/10.1007/s11856-023-2515-7","date_published":"2023-09-01T00:00:00Z","external_id":{"arxiv":["2206.04815"]},"arxiv":1,"language":[{"iso":"eng"}]},{"day":"01","article_processing_charge":"No","type":"journal_article","page":"743-768","author":[{"last_name":"Conlon","full_name":"Conlon, David","first_name":"David"},{"full_name":"Fox, Jacob","first_name":"Jacob","last_name":"Fox"},{"id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval","full_name":"Wigderson, Yuval","last_name":"Wigderson"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2111.05420","open_access":"1"}],"scopus_import":"1","publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"arxiv":1,"date_published":"2023-08-01T00:00:00Z","external_id":{"arxiv":["2111.05420"]},"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/s00493-023-00034-7","issue":"4","status":"public","publisher":"Springer Nature","quality_controlled":"1","title":"Three early problems on size Ramsey numbers","abstract":[{"lang":"eng","text":"The size Ramsey number of a graph H is defined as the minimum number of edges in a graph G such that there is a monochromatic copy of H in every two-coloring of E(G). The size Ramsey number was introduced by Erdős, Faudree, Rousseau, and Schelp in 1978 and they ended their foundational paper by asking whether one can determine up to a constant factor the size Ramsey numbers of three families of graphs: complete bipartite graphs, book graphs (obtained by adding many common neighbors to the vertices of a clique), and starburst graphs (obtained by adding many pendant edges to each vertex of a clique). In this paper, we completely resolve the latter two questions and make substantial progress on the first by determining the size Ramsey number of Ks,t up to a constant factor for all t=Ω(s log s)."}],"volume":43,"year":"2023","OA_place":"repository","citation":{"short":"D. Conlon, J. Fox, Y. Wigderson, Combinatorica 43 (2023) 743–768.","ieee":"D. Conlon, J. Fox, and Y. Wigderson, “Three early problems on size Ramsey numbers,” <i>Combinatorica</i>, vol. 43, no. 4. Springer Nature, pp. 743–768, 2023.","chicago":"Conlon, David, Jacob Fox, and Yuval Wigderson. “Three Early Problems on Size Ramsey Numbers.” <i>Combinatorica</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00493-023-00034-7\">https://doi.org/10.1007/s00493-023-00034-7</a>.","apa":"Conlon, D., Fox, J., &#38; Wigderson, Y. (2023). Three early problems on size Ramsey numbers. <i>Combinatorica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00493-023-00034-7\">https://doi.org/10.1007/s00493-023-00034-7</a>","ama":"Conlon D, Fox J, Wigderson Y. Three early problems on size Ramsey numbers. <i>Combinatorica</i>. 2023;43(4):743-768. doi:<a href=\"https://doi.org/10.1007/s00493-023-00034-7\">10.1007/s00493-023-00034-7</a>","mla":"Conlon, David, et al. “Three Early Problems on Size Ramsey Numbers.” <i>Combinatorica</i>, vol. 43, no. 4, Springer Nature, 2023, pp. 743–68, doi:<a href=\"https://doi.org/10.1007/s00493-023-00034-7\">10.1007/s00493-023-00034-7</a>.","ista":"Conlon D, Fox J, Wigderson Y. 2023. Three early problems on size Ramsey numbers. Combinatorica. 43(4), 743–768."},"publication_status":"published","OA_type":"green","doi":"10.1007/s00493-023-00034-7","intvolume":"        43","publication":"Combinatorica","oa_version":"Preprint","date_updated":"2026-07-08T10:34:40Z","oa":1,"article_type":"original","date_created":"2026-06-29T10:51:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","extern":"1","_id":"22159"},{"year":"2023","OA_place":"publisher","publication_status":"published","citation":{"short":"M. Hennessey-Wesen, Adaptive Mutation in E. Coli Modulated by LuxS, Institute of Science and Technology Austria, 2023.","ieee":"M. Hennessey-Wesen, “Adaptive mutation in E. coli modulated by luxS,” Institute of Science and Technology Austria, 2023.","chicago":"Hennessey-Wesen, Mike. “Adaptive Mutation in E. Coli Modulated by LuxS.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/at:ista:14641\">https://doi.org/10.15479/at:ista:14641</a>.","apa":"Hennessey-Wesen, M. (2023). <i>Adaptive mutation in E. coli modulated by luxS</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:14641\">https://doi.org/10.15479/at:ista:14641</a>","ama":"Hennessey-Wesen M. Adaptive mutation in E. coli modulated by luxS. 2023. doi:<a href=\"https://doi.org/10.15479/at:ista:14641\">10.15479/at:ista:14641</a>","mla":"Hennessey-Wesen, Mike. <i>Adaptive Mutation in E. Coli Modulated by LuxS</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/at:ista:14641\">10.15479/at:ista:14641</a>.","ista":"Hennessey-Wesen M. 2023. Adaptive mutation in E. coli modulated by luxS. Institute of Science and Technology Austria."},"doi":"10.15479/at:ista:14641","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"publisher":"Institute of Science and Technology Austria","status":"public","supervisor":[{"orcid":"0000-0003-2057-2754","last_name":"Hof","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn"}],"abstract":[{"lang":"eng","text":"Mutation rates represent the net result of complex interactions among various\r\ncellular processes and can dramatically influence the evolutionary fate of\r\nmicrobial populations. However, many popular techniques used to study\r\nmutations are subject to the confounding effects of heredity and the subtleties\r\nof adaptation to selection, all of which make it difficult to observe any dynamic\r\nresponses of mutation rates to fitness challenges. Furthermore, in spite of the\r\nubiquity of quorum sensing systems across the bacterial domain and relevance\r\nfor many physiological behaviors, the effects of such mechanisms on mutation\r\nrate and adaptation remain poorly understood. In the following work, I\r\npresent the development of a microfluidic droplet-based method to measure\r\nsingle base-pair mutation rates in growing populations of the bacterium\r\nEscherichia coli. I use this method to observe a stress-induced increase in\r\nmutation rate that is mediated by luxS, a highly conserved bacterial quorum\r\nsensing component. I also show that the aforementioned increase in mutation\r\nrate, and its associated control by luxS, corresponds to a higher degree of\r\nadaptability under competitive environments."}],"title":"Adaptive mutation in E. coli modulated by luxS","department":[{"_id":"GradSch"},{"_id":"BjHo"}],"date_created":"2023-12-04T13:17:37Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"11","_id":"14641","ec_funded":1,"file_date_updated":"2026-07-13T10:55:56Z","oa_version":"Published Version","file":[{"date_updated":"2024-11-30T23:30:05Z","file_id":"14648","file_name":"mike_thesis_v06-12-2023.odt","creator":"mhenness","relation":"source_file","file_size":46405919,"checksum":"4127c285b34f4bf7fb31ef24f9d14c25","embargo_to":"open_access","date_created":"2023-12-06T13:13:26Z","content_type":"application/vnd.oasis.opendocument.text","access_level":"closed"},{"checksum":"f5203a61eddaf35235bbc51904d73982","file_size":21282155,"embargo_to":"open_access","relation":"main_file","access_level":"closed","date_created":"2023-12-06T13:14:15Z","content_type":"application/pdf","file_id":"14649","date_updated":"2026-07-13T10:55:56Z","file_name":"mike_thesis_v06-12-2023.pdf","creator":"mhenness","embargo":"2026-11-18"},{"relation":"other","embargo_to":"open_access","file_size":45847968,"checksum":"902102d26d30e74dbd6cdd70a65820c3","content_type":"application/pdf","date_created":"2025-05-20T12:59:12Z","access_level":"closed","description":"for printing purposes only","file_id":"19720","date_updated":"2025-05-20T22:31:34Z","title":"Print version","file_name":"2023_Hennessey_Michael_Thesis_print.pdf","creator":"cchlebak"}],"date_updated":"2026-07-13T10:55:56Z","das_tickbox":"1","corr_author":"1","page":"104","doi_confirm":"1","author":[{"last_name":"Hennessey-Wesen","full_name":"Hennessey-Wesen, Mike","first_name":"Mike","id":"3F338C72-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"]},"day":"30","article_processing_charge":"No","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"CampIT"}],"type":"dissertation","fulldoi":"https://doi.org/10.15479/at:ista:14641","ddc":["570"],"degree_awarded":"PhD","has_accepted_license":"1","alternative_title":["ISTA Thesis"],"date_published":"2023-11-30T00:00:00Z","language":[{"iso":"eng"}],"keyword":["microfluidics","miceobiology","mutations","quorum sensing"]},{"oa":1,"file":[{"relation":"main_file","file_size":16891602,"checksum":"bf4ec38602a70dae4338077a5a4d497f","date_created":"2023-12-11T12:45:12Z","content_type":"application/pdf","access_level":"open_access","success":1,"date_updated":"2023-12-11T12:45:12Z","file_id":"14678","file_name":"2023_PNAS_Chintaluri.pdf","creator":"dernst"}],"isi":1,"date_updated":"2026-07-13T12:30:49Z","das_tickbox":"1","related_material":{"link":[{"url":"https://github.com/ccluri/metabolic_spiking","relation":"software"}]},"intvolume":"       120","file_date_updated":"2023-12-11T12:45:12Z","oa_version":"Published Version","publication":"Proceedings of the National Academy of Sciences of the United States of America","month":"11","_id":"14666","article_type":"original","department":[{"_id":"TiVo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-12-10T23:01:00Z","abstract":[{"text":"So-called spontaneous activity is a central hallmark of most nervous systems. Such non-causal firing is contrary to the tenet of spikes as a means of communication, and its purpose remains unclear. We propose that self-initiated firing can serve as a release valve to protect neurons from the toxic conditions arising in mitochondria from lower-than-baseline energy consumption. To demonstrate the viability of our hypothesis, we built a set of models that incorporate recent experimental results indicating homeostatic control of metabolic products—Adenosine triphosphate (ATP), adenosine diphosphate (ADP), and reactive oxygen species (ROS)—by changes in firing. We explore the relationship of metabolic cost of spiking with its effect on the temporal patterning of spikes and reproduce experimentally observed changes in intrinsic firing in the fruitfly dorsal fan-shaped body neuron in a model with ROS-modulated potassium channels. We also show that metabolic spiking homeostasis can produce indefinitely sustained avalanche dynamics in cortical circuits. Our theory can account for key features of neuronal activity observed in many studies ranging from ion channel function all the way to resting state dynamics. We finish with a set of experimental predictions that would confirm an integrated, crucial role for metabolically regulated spiking and firmly link metabolic homeostasis and neuronal function.","lang":"eng"}],"title":"Metabolically regulated spiking could serve neuronal energy homeostasis and protect from reactive oxygen species","acknowledgement":"We thank Prof. C. Nazaret and Prof. J.-P. Mazat for sharing the code of their mitochondrial model. We also thank G. Miesenböck, E. Marder, L. Abbott, A. Kempf, P. Hasenhuetl, W. Podlaski, F. Zenke, E. Agnes, P. Bozelos, J. Watson, B. Confavreux, and G. Christodoulou, and the rest of the Vogels Lab for their feedback. This work was funded by Wellcome Trust and Royal Society Sir Henry Dale Research Fellowship (WT100000), a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z), and a UK Research and Innovation, Biotechnology and Biological Sciences Research Council grant (UKRI-BBSRC BB/N019512/1).","project":[{"name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks.","_id":"c084a126-5a5b-11eb-8a69-d75314a70a87","grant_number":"214316/Z/18/Z"}],"publisher":"National Academy of Sciences","status":"public","issue":"48","quality_controlled":"1","OA_type":"hybrid","doi":"10.1073/pnas.2306525120","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2023","volume":120,"citation":{"ama":"Chintaluri C, Vogels TP. Metabolically regulated spiking could serve neuronal energy homeostasis and protect from reactive oxygen species. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2023;120(48). doi:<a href=\"https://doi.org/10.1073/pnas.2306525120\">10.1073/pnas.2306525120</a>","mla":"Chintaluri, Chaitanya, and Tim P. Vogels. “Metabolically Regulated Spiking Could Serve Neuronal Energy Homeostasis and Protect from Reactive Oxygen Species.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 120, no. 48, e2306525120, National Academy of Sciences, 2023, doi:<a href=\"https://doi.org/10.1073/pnas.2306525120\">10.1073/pnas.2306525120</a>.","ista":"Chintaluri C, Vogels TP. 2023. Metabolically regulated spiking could serve neuronal energy homeostasis and protect from reactive oxygen species. Proceedings of the National Academy of Sciences of the United States of America. 120(48), e2306525120.","short":"C. Chintaluri, T.P. Vogels, Proceedings of the National Academy of Sciences of the United States of America 120 (2023).","ieee":"C. Chintaluri and T. P. Vogels, “Metabolically regulated spiking could serve neuronal energy homeostasis and protect from reactive oxygen species,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 120, no. 48. National Academy of Sciences, 2023.","chicago":"Chintaluri, Chaitanya, and Tim P Vogels. “Metabolically Regulated Spiking Could Serve Neuronal Energy Homeostasis and Protect from Reactive Oxygen Species.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2023. <a href=\"https://doi.org/10.1073/pnas.2306525120\">https://doi.org/10.1073/pnas.2306525120</a>.","apa":"Chintaluri, C., &#38; Vogels, T. P. (2023). Metabolically regulated spiking could serve neuronal energy homeostasis and protect from reactive oxygen species. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2306525120\">https://doi.org/10.1073/pnas.2306525120</a>"},"publication_status":"published","OA_place":"publisher","language":[{"iso":"eng"}],"pmid":1,"date_published":"2023-11-21T00:00:00Z","external_id":{"isi":["001157389000005"],"pmid":["37988463"]},"fulldoi":"https://doi.org/10.1073/pnas.2306525120","ddc":["570"],"has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","type":"journal_article","day":"21","author":[{"orcid":"0000-0003-4252-1608","last_name":"Chintaluri","full_name":"Chintaluri, Chaitanya","id":"BA06AFEE-A4BA-11EA-AE5C-14673DDC885E","first_name":"Chaitanya"},{"last_name":"Vogels","orcid":"0000-0003-3295-6181","full_name":"Vogels, Tim P","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","first_name":"Tim P"}],"scopus_import":"1","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"article_number":"e2306525120","corr_author":"1"},{"external_id":{"arxiv":["2105.09194"]},"date_published":"2023-04-01T00:00:00Z","arxiv":1,"keyword":["chromatic threshold","graph removal lemma","homomorphism threshold","minimum degree conditions"],"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1002/jgt.22891","day":"01","type":"journal_article","article_processing_charge":"No","page":"648-665","publication_identifier":{"issn":["0364-9024"],"eissn":["1097-0118"]},"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2105.09194"}],"author":[{"full_name":"Fox, Jacob","first_name":"Jacob","last_name":"Fox"},{"last_name":"Wigderson","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval","full_name":"Wigderson, Yuval"}],"publication":"Journal of Graph Theory","oa_version":"Preprint","intvolume":"       102","oa":1,"date_updated":"2026-07-14T08:24:20Z","date_created":"2026-06-29T10:53:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","_id":"22164","extern":"1","month":"04","quality_controlled":"1","publisher":"Wiley","status":"public","issue":"4","title":"Minimum degree and the graph removal lemma","abstract":[{"lang":"eng","text":"The clique removal lemma says that for every ≥r 3 andε > 0, there exists some δ > 0 so that every n‐vertex graph G with fewer than δnr copies of K r can be made K r ‐free by removing at most εn2 edges. The dependence of δ on ε in this result is notoriously difficult to determine: it is known that δ−1 must be at least super‐polynomial in ε−1, and that it is at most of tower type in εlog −1. We prove that if one imposes an appropriate minimum degree condition on G, then one can actually take δ to be a linear function of ε in the clique removal lemma. Moreover, we determine the threshold for such a minimum degree requirement, showing that above this threshold we have linear bounds, whereas below the threshold the bounds are once again super‐polynomial, as in the unrestricted removal lemma. We also investigate this question for other graphs besides cliques, and prove some general results about how minimum degree conditions affect the bounds in the graph removal lemma."}],"OA_place":"repository","publication_status":"published","citation":{"short":"J. Fox, Y. Wigderson, Journal of Graph Theory 102 (2023) 648–665.","ieee":"J. Fox and Y. Wigderson, “Minimum degree and the graph removal lemma,” <i>Journal of Graph Theory</i>, vol. 102, no. 4. Wiley, pp. 648–665, 2023.","chicago":"Fox, Jacob, and Yuval Wigderson. “Minimum Degree and the Graph Removal Lemma.” <i>Journal of Graph Theory</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/jgt.22891\">https://doi.org/10.1002/jgt.22891</a>.","apa":"Fox, J., &#38; Wigderson, Y. (2023). Minimum degree and the graph removal lemma. <i>Journal of Graph Theory</i>. Wiley. <a href=\"https://doi.org/10.1002/jgt.22891\">https://doi.org/10.1002/jgt.22891</a>","ama":"Fox J, Wigderson Y. Minimum degree and the graph removal lemma. <i>Journal of Graph Theory</i>. 2023;102(4):648-665. doi:<a href=\"https://doi.org/10.1002/jgt.22891\">10.1002/jgt.22891</a>","mla":"Fox, Jacob, and Yuval Wigderson. “Minimum Degree and the Graph Removal Lemma.” <i>Journal of Graph Theory</i>, vol. 102, no. 4, Wiley, 2023, pp. 648–65, doi:<a href=\"https://doi.org/10.1002/jgt.22891\">10.1002/jgt.22891</a>.","ista":"Fox J, Wigderson Y. 2023. Minimum degree and the graph removal lemma. Journal of Graph Theory. 102(4), 648–665."},"year":"2023","volume":102,"doi":"10.1002/jgt.22891","OA_type":"green"},{"day":"01","type":"journal_article","article_processing_charge":"No","page":"516-545","mathsc":["05C55","05D10"],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2110.14483","open_access":"1"}],"scopus_import":"1","publication_identifier":{"eissn":["1469-2163"],"issn":["0963-5483"]},"author":[{"first_name":"David","full_name":"Conlon, David","last_name":"Conlon"},{"last_name":"Fox","first_name":"Jacob","full_name":"Fox, Jacob"},{"full_name":"Wigderson, Yuval","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","last_name":"Wigderson"}],"date_published":"2023-05-01T00:00:00Z","external_id":{"arxiv":["2110.14483"]},"arxiv":1,"keyword":["Ramsey theory","book graphs","Ramsey goodness"],"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1017/s0963548322000360","quality_controlled":"1","issue":"3","status":"public","publisher":"Cambridge University Press","abstract":[{"lang":"eng","text":"The book graph 𝐵(𝑘)\r\n𝑛 consists of 𝑛 copies of 𝐾𝑘+1 joined along a common 𝐾𝑘. In the prequel to this paper, we studied the diagonal Ramsey number 𝑟⁡(𝐵(𝑘)\r\n𝑛,𝐵(𝑘)\r\n𝑛). Here we consider the natural off-diagonal variant 𝑟⁡(𝐵(𝑘)\r\n𝑐⁢𝑛,𝐵(𝑘)\r\n𝑛) for fixed 𝑐 ∈(0,1]. In this more general setting, we show that an interesting dichotomy emerges: for very small 𝑐, a simple 𝑘-partite construction dictates the Ramsey function and all nearly-extremal colourings are close to being 𝑘-partite, while, for 𝑐 bounded away from 0, random colourings of an appropriate density are asymptotically optimal and all nearly-extremal colourings are quasirandom. Our investigations also open up a range of questions about what happens for intermediate values of 𝑐.\r\n\r\n"}],"title":"Off-diagonal book Ramsey numbers","publication_status":"published","citation":{"ama":"Conlon D, Fox J, Wigderson Y. Off-diagonal book Ramsey numbers. <i>Combinatorics, Probability and Computing</i>. 2023;32(3):516-545. doi:<a href=\"https://doi.org/10.1017/s0963548322000360\">10.1017/s0963548322000360</a>","mla":"Conlon, David, et al. “Off-Diagonal Book Ramsey Numbers.” <i>Combinatorics, Probability and Computing</i>, vol. 32, no. 3, Cambridge University Press, 2023, pp. 516–45, doi:<a href=\"https://doi.org/10.1017/s0963548322000360\">10.1017/s0963548322000360</a>.","ista":"Conlon D, Fox J, Wigderson Y. 2023. Off-diagonal book Ramsey numbers. Combinatorics, Probability and Computing. 32(3), 516–545.","short":"D. Conlon, J. Fox, Y. Wigderson, Combinatorics, Probability and Computing 32 (2023) 516–545.","ieee":"D. Conlon, J. Fox, and Y. Wigderson, “Off-diagonal book Ramsey numbers,” <i>Combinatorics, Probability and Computing</i>, vol. 32, no. 3. Cambridge University Press, pp. 516–545, 2023.","chicago":"Conlon, David, Jacob Fox, and Yuval Wigderson. “Off-Diagonal Book Ramsey Numbers.” <i>Combinatorics, Probability and Computing</i>. Cambridge University Press, 2023. <a href=\"https://doi.org/10.1017/s0963548322000360\">https://doi.org/10.1017/s0963548322000360</a>.","apa":"Conlon, D., Fox, J., &#38; Wigderson, Y. (2023). Off-diagonal book Ramsey numbers. <i>Combinatorics, Probability and Computing</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/s0963548322000360\">https://doi.org/10.1017/s0963548322000360</a>"},"OA_place":"repository","year":"2023","volume":32,"doi":"10.1017/s0963548322000360","OA_type":"green","oa_version":"Preprint","publication":"Combinatorics, Probability and Computing","intvolume":"        32","date_updated":"2026-07-14T08:27:40Z","oa":1,"date_created":"2026-06-29T10:53:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","_id":"22165","extern":"1","month":"05"},{"language":[{"iso":"eng"}],"date_published":"2023-01-01T00:00:00Z","external_id":{"arxiv":["2207.07775"]},"arxiv":1,"fulldoi":"https://doi.org/10.19086/aic.2023.2","type":"journal_article","article_processing_charge":"No","day":"01","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2207.07775","open_access":"1"}],"scopus_import":"1","publication_identifier":{"eissn":["2517-5599"]},"author":[{"first_name":"Jacob","full_name":"Fox, Jacob","last_name":"Fox"},{"last_name":"Wigderson","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval","full_name":"Wigderson, Yuval"}],"date_updated":"2026-07-14T08:45:53Z","oa":1,"oa_version":"Preprint","publication":"Advances in Combinatorics","extern":"1","_id":"22170","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-29T10:55:46Z","article_type":"original","title":"Ramsey multiplicity and the Turán coloring","abstract":[{"text":"Extending an earlier conjecture of Erdős, Burr and Rosta conjectured that among all two-colorings of the edges of a complete graph, the uniformly random coloring asymptotically minimizes the number of monochromatic copies of any fixed graph H. This conjecture was disproved independently by Sidorenko and Thomason. The first author later found quantitatively stronger counterexamples, using the Turán coloring, in which one of the two colors spans a balanced complete multipartite graph.\r\nWe prove that the Turán coloring is extremal for an infinite family of graphs, and that it is the unique extremal coloring. This yields the first determination of the Ramsey multiplicity constant of a graph for which the Burr--Rosta conjecture fails.\r\nWe also prove an analogous three-color result. In this case, our result is conditional on a certain natural conjecture on the behavior of two-color Ramsey numbers.","lang":"eng"}],"quality_controlled":"1","status":"public","publisher":"Alliance of Diamond Open Access Journals","doi":"10.19086/aic.2023.2","OA_type":"green","OA_place":"repository","publication_status":"published","citation":{"mla":"Fox, Jacob, and Yuval Wigderson. “Ramsey Multiplicity and the Turán Coloring.” <i>Advances in Combinatorics</i>, Alliance of Diamond Open Access Journals, 2023, doi:<a href=\"https://doi.org/10.19086/aic.2023.2\">10.19086/aic.2023.2</a>.","ama":"Fox J, Wigderson Y. Ramsey multiplicity and the Turán coloring. <i>Advances in Combinatorics</i>. 2023. doi:<a href=\"https://doi.org/10.19086/aic.2023.2\">10.19086/aic.2023.2</a>","ista":"Fox J, Wigderson Y. 2023. Ramsey multiplicity and the Turán coloring. Advances in Combinatorics.","ieee":"J. Fox and Y. Wigderson, “Ramsey multiplicity and the Turán coloring,” <i>Advances in Combinatorics</i>. Alliance of Diamond Open Access Journals, 2023.","short":"J. Fox, Y. Wigderson, Advances in Combinatorics (2023).","apa":"Fox, J., &#38; Wigderson, Y. (2023). Ramsey multiplicity and the Turán coloring. <i>Advances in Combinatorics</i>. Alliance of Diamond Open Access Journals. <a href=\"https://doi.org/10.19086/aic.2023.2\">https://doi.org/10.19086/aic.2023.2</a>","chicago":"Fox, Jacob, and Yuval Wigderson. “Ramsey Multiplicity and the Turán Coloring.” <i>Advances in Combinatorics</i>. Alliance of Diamond Open Access Journals, 2023. <a href=\"https://doi.org/10.19086/aic.2023.2\">https://doi.org/10.19086/aic.2023.2</a>."},"year":"2023"},{"oa_version":"Preprint","publication":"Advances in Combinatorics","date_updated":"2026-07-14T09:05:44Z","oa":1,"date_created":"2026-06-29T10:58:11Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","extern":"1","_id":"22176","month":"07","quality_controlled":"1","status":"public","publisher":"Alliance of Diamond Open Access Journals","title":"Ramsey goodness of books revisited","abstract":[{"lang":"eng","text":"The Ramsey number r(G,H) is the minimum N such that every graph on N vertices contains G as a subgraph or its complement contains H as a subgraph. For integers n≥k≥1, the k-book Bk,n is the graph on n vertices consisting of a copy of Kk, called the spine, as well as n−k additional vertices each adjacent to every vertex of the spine and non-adjacent to each other. A connected graph H on n vertices is called p-good if r(Kp,H)=(p−1)(n−1)+1. Nikiforov and Rousseau proved that if n is sufficiently large in terms of p and k, then Bk,n is p-good. Their proof uses Szemerédi's regularity lemma and gives a tower-type bound on n. We give a short new proof that avoids using the regularity method and shows that every Bk,n with n≥2k10p is p-good.\r\nUsing Szemerédi's regularity lemma, Nikiforov and Rousseau also proved much more general goodness-type results, proving a tight bound on r(G,H) for several families of sparse graphs G and H as long as |V(G)|<δ|V(H)| for a small constant δ>0. Using our techniques, we prove a new result of this type, showing that r(G,H)=(p−1)(n−1)+1 when H=Bk,n and G is a complete p-partite graph whose first p−1 parts have constant size and whose last part has size δn, for some small constant δ>0. Again, our proof does not use the regularity method, and thus yields double-exponential bounds on δ.\r\n"}],"publication_status":"published","citation":{"ieee":"J. Fox, X. He, and Y. Wigderson, “Ramsey goodness of books revisited,” <i>Advances in Combinatorics</i>. Alliance of Diamond Open Access Journals, 2023.","short":"J. Fox, X. He, Y. Wigderson, Advances in Combinatorics (2023).","apa":"Fox, J., He, X., &#38; Wigderson, Y. (2023). Ramsey goodness of books revisited. <i>Advances in Combinatorics</i>. Alliance of Diamond Open Access Journals. <a href=\"https://doi.org/10.19086/aic.2023.4\">https://doi.org/10.19086/aic.2023.4</a>","chicago":"Fox, Jacob, Xiaoyu He, and Yuval Wigderson. “Ramsey Goodness of Books Revisited.” <i>Advances in Combinatorics</i>. Alliance of Diamond Open Access Journals, 2023. <a href=\"https://doi.org/10.19086/aic.2023.4\">https://doi.org/10.19086/aic.2023.4</a>.","mla":"Fox, Jacob, et al. “Ramsey Goodness of Books Revisited.” <i>Advances in Combinatorics</i>, Alliance of Diamond Open Access Journals, 2023, doi:<a href=\"https://doi.org/10.19086/aic.2023.4\">10.19086/aic.2023.4</a>.","ama":"Fox J, He X, Wigderson Y. Ramsey goodness of books revisited. <i>Advances in Combinatorics</i>. 2023. doi:<a href=\"https://doi.org/10.19086/aic.2023.4\">10.19086/aic.2023.4</a>","ista":"Fox J, He X, Wigderson Y. 2023. Ramsey goodness of books revisited. Advances in Combinatorics."},"OA_place":"repository","year":"2023","doi":"10.19086/aic.2023.4","OA_type":"green","date_published":"2023-07-29T00:00:00Z","external_id":{"arxiv":["2109.09205"]},"arxiv":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.19086/aic.2023.4","day":"29","type":"journal_article","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2109.09205","open_access":"1"}],"publication_identifier":{"eissn":["2517-5599"]},"scopus_import":"1","author":[{"first_name":"Jacob","full_name":"Fox, Jacob","last_name":"Fox"},{"last_name":"He","first_name":"Xiaoyu","full_name":"He, Xiaoyu"},{"last_name":"Wigderson","full_name":"Wigderson, Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval"}]},{"article_processing_charge":"No","type":"journal_article","day":"01","author":[{"full_name":"Kuperberg, Vivian Zieve","first_name":"Vivian Zieve","id":"c3bac823-112d-11f0-a3f5-c264f852e697","last_name":"Kuperberg"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2210.09775"}],"scopus_import":"1","publication_identifier":{"eissn":["1464-3847"],"issn":["0033-5606"]},"page":"1457-1479","language":[{"iso":"eng"}],"arxiv":1,"date_published":"2023-12-01T00:00:00Z","external_id":{"arxiv":["2210.09775"]},"fulldoi":"https://doi.org/10.1093/qmath/haad030","title":"Sums of singular series with large sets and the tail of the distribution of primes","abstract":[{"lang":"eng","text":"In 1976, Gallagher showed that the Hardy–Littlewood conjectures on prime k-tuples imply that the\r\ndistribution of primes in log-size intervals is Poissonian. He did so by computing average values\r\nof the singular series constants over different sets of a fixed size k contained in an interval [1,h]\r\nas h → ∞, and then using this average to compute moments of the distribution of primes. In this\r\npaper, we study averages where k is relatively large with respect to h. We then apply these averages\r\nto the tail of the distribution. For example, we show, assuming appropriate Hardy–Littlewood\r\nconjectures and in certain ranges of the parameters, the number of intervals [n,n + λlogx] with\r\nn ≤ x containing at least k primes is ≪ x exp(−k/(λe))."}],"issue":"4","status":"public","publisher":"Oxford University Press","quality_controlled":"1","OA_type":"green","doi":"10.1093/qmath/haad030","year":"2023","volume":74,"citation":{"ista":"Kuperberg VZ. 2023. Sums of singular series with large sets and the tail of the distribution of primes. The Quarterly Journal of Mathematics. 74(4), 1457–1479.","ama":"Kuperberg VZ. Sums of singular series with large sets and the tail of the distribution of primes. <i>The Quarterly Journal of Mathematics</i>. 2023;74(4):1457-1479. doi:<a href=\"https://doi.org/10.1093/qmath/haad030\">10.1093/qmath/haad030</a>","mla":"Kuperberg, Vivian Zieve. “Sums of Singular Series with Large Sets and the Tail of the Distribution of Primes.” <i>The Quarterly Journal of Mathematics</i>, vol. 74, no. 4, Oxford University Press, 2023, pp. 1457–79, doi:<a href=\"https://doi.org/10.1093/qmath/haad030\">10.1093/qmath/haad030</a>.","chicago":"Kuperberg, Vivian Zieve. “Sums of Singular Series with Large Sets and the Tail of the Distribution of Primes.” <i>The Quarterly Journal of Mathematics</i>. Oxford University Press, 2023. <a href=\"https://doi.org/10.1093/qmath/haad030\">https://doi.org/10.1093/qmath/haad030</a>.","apa":"Kuperberg, V. Z. (2023). Sums of singular series with large sets and the tail of the distribution of primes. <i>The Quarterly Journal of Mathematics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/qmath/haad030\">https://doi.org/10.1093/qmath/haad030</a>","short":"V.Z. Kuperberg, The Quarterly Journal of Mathematics 74 (2023) 1457–1479.","ieee":"V. Z. Kuperberg, “Sums of singular series with large sets and the tail of the distribution of primes,” <i>The Quarterly Journal of Mathematics</i>, vol. 74, no. 4. Oxford University Press, pp. 1457–1479, 2023."},"OA_place":"repository","publication_status":"published","date_updated":"2026-07-14T10:55:52Z","oa":1,"intvolume":"        74","oa_version":"Preprint","publication":"The Quarterly Journal of Mathematics","month":"12","extern":"1","_id":"22192","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-29T12:56:30Z"},{"OA_place":"repository","publication_status":"published","citation":{"ista":"Ulbrich J-A, Fernández-Rico C, Rost B, Vialetto J, Isa L, Urbach JS, Dullens RPA. 2023. Effect of curvature on the diffusion of colloidal bananas. Physical Review E. 107(4), L042602.","mla":"Ulbrich, Justin-Aurel, et al. “Effect of Curvature on the Diffusion of Colloidal Bananas.” <i>Physical Review E</i>, vol. 107, no. 4, L042602, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/physreve.107.l042602\">10.1103/physreve.107.l042602</a>.","ama":"Ulbrich J-A, Fernández-Rico C, Rost B, et al. Effect of curvature on the diffusion of colloidal bananas. <i>Physical Review E</i>. 2023;107(4). doi:<a href=\"https://doi.org/10.1103/physreve.107.l042602\">10.1103/physreve.107.l042602</a>","apa":"Ulbrich, J.-A., Fernández-Rico, C., Rost, B., Vialetto, J., Isa, L., Urbach, J. S., &#38; Dullens, R. P. A. (2023). Effect of curvature on the diffusion of colloidal bananas. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physreve.107.l042602\">https://doi.org/10.1103/physreve.107.l042602</a>","chicago":"Ulbrich, Justin-Aurel, Carla Fernández-Rico, Brian Rost, Jacopo Vialetto, Lucio Isa, Jeffrey S. Urbach, and Roel P. A. Dullens. “Effect of Curvature on the Diffusion of Colloidal Bananas.” <i>Physical Review E</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/physreve.107.l042602\">https://doi.org/10.1103/physreve.107.l042602</a>.","ieee":"J.-A. Ulbrich <i>et al.</i>, “Effect of curvature on the diffusion of colloidal bananas,” <i>Physical Review E</i>, vol. 107, no. 4. American Physical Society, 2023.","short":"J.-A. Ulbrich, C. Fernández-Rico, B. Rost, J. Vialetto, L. Isa, J.S. Urbach, R.P.A. Dullens, Physical Review E 107 (2023)."},"volume":107,"year":"2023","doi":"10.1103/physreve.107.l042602","OA_type":"green","quality_controlled":"1","publisher":"American Physical Society","issue":"4","status":"public","abstract":[{"lang":"eng","text":"Anisotropic colloidal particles exhibit complex dynamics which play a crucial role in their functionality,\r\ntransport, and phase behavior. In this Letter, we investigate the two-dimensional diffusion of smoothly curved\r\ncolloidal rods—also known as colloidal bananas—as a function of their opening angle α. We measure the\r\ntranslational and rotational diffusion coefficients of the particles with opening angles ranging from 0◦ (straight\r\nrods) to nearly 360◦(closed rings). In particular, we find that the anisotropic diffusion of the particles varies\r\nnonmonotonically with their opening angle and that the axis of fastest diffusion switches from the long to the\r\nshort axis of the particles when α> 180◦. We also find that the rotational diffusion coefficient of nearly closed\r\nrings is approximately an order of magnitude higher than that of straight rods of the same length. Finally, we\r\nshow that the experimental results are consistent with slender body theory, indicating that the dynamical behavior\r\nof the particles arises primarily from their local drag anisotropy. These results highlight the impact of curvature\r\non the Brownian motion of elongated colloidal particles, which must be taken into account when seeking to\r\nunderstand the behavior of curved colloidal particles."}],"title":"Effect of curvature on the diffusion of colloidal bananas","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-30T06:32:12Z","article_type":"letter_note","extern":"1","_id":"22212","month":"04","oa_version":"Preprint","publication":"Physical Review E","intvolume":"       107","oa":1,"date_updated":"2026-07-15T07:09:52Z","article_number":"L042602","publication_identifier":{"eissn":["2470-0053"],"issn":["2470-0045"]},"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2211.07274"}],"author":[{"last_name":"Ulbrich","first_name":"Justin-Aurel","full_name":"Ulbrich, Justin-Aurel"},{"last_name":"Fernández-Rico","id":"492def71-6250-11f0-b278-d41dbd241b62","first_name":"Carla","full_name":"Fernández-Rico, Carla"},{"last_name":"Rost","full_name":"Rost, Brian","first_name":"Brian"},{"last_name":"Vialetto","full_name":"Vialetto, Jacopo","first_name":"Jacopo"},{"last_name":"Isa","first_name":"Lucio","full_name":"Isa, Lucio"},{"last_name":"Urbach","first_name":"Jeffrey S.","full_name":"Urbach, Jeffrey S."},{"first_name":"Roel P. A.","full_name":"Dullens, Roel P. A.","last_name":"Dullens"}],"day":"21","type":"journal_article","article_processing_charge":"No","has_accepted_license":"1","fulldoi":"https://doi.org/10.1103/physreve.107.l042602","ddc":["530"],"date_published":"2023-04-21T00:00:00Z","external_id":{"arxiv":["2211.07274"]},"arxiv":1,"language":[{"iso":"eng"}]},{"external_id":{"pmid":["36738230"],"isi":["000956919900001"]},"pmid":1,"date_published":"2023-05-01T00:00:00Z","keyword":["General Chemistry","Catalysis"],"language":[{"iso":"eng"}],"has_accepted_license":"1","ddc":["540"],"fulldoi":"https://doi.org/10.1002/anie.202219314","day":"01","type":"journal_article","article_processing_charge":"Yes (via OA deal)","corr_author":"1","article_number":"e202219314","scopus_import":"1","publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"author":[{"last_name":"Becker","orcid":"0000-0002-6401-5151","full_name":"Becker, Lea Marie","first_name":"Lea Marie","id":"36336939-eb97-11eb-a6c2-c83f1214ca79"},{"last_name":"Berbon","first_name":"Mélanie","full_name":"Berbon, Mélanie"},{"full_name":"Vallet, Alicia","first_name":"Alicia","last_name":"Vallet"},{"full_name":"Grelard, Axelle","first_name":"Axelle","last_name":"Grelard"},{"last_name":"Morvan","first_name":"Estelle","full_name":"Morvan, Estelle"},{"full_name":"Bardiaux, Benjamin","first_name":"Benjamin","last_name":"Bardiaux"},{"first_name":"Roman","full_name":"Lichtenecker, Roman","last_name":"Lichtenecker"},{"full_name":"Ernst, Matthias","first_name":"Matthias","last_name":"Ernst"},{"last_name":"Loquet","first_name":"Antoine","full_name":"Loquet, Antoine"},{"first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul","last_name":"Schanda","orcid":"0000-0002-9350-7606"}],"oa_version":"Published Version","publication":"Angewandte Chemie International Edition","file_date_updated":"2023-08-16T12:33:31Z","intvolume":"        62","related_material":{"link":[{"description":"News on ISTA website","relation":"press_release","url":"https://ista.ac.at/en/news/dancing-styles-of-atoms/"}],"record":[{"relation":"research_data","status":"public","id":"12497"},{"relation":"other","id":"14861","status":"public"},{"id":"22334","status":"public","relation":"dissertation_contains"}]},"file":[{"content_type":"application/pdf","date_created":"2023-08-16T12:33:31Z","access_level":"open_access","relation":"main_file","file_size":1422445,"checksum":"7dd083ed8850faa55c34e411ed390de9","creator":"dernst","file_name":"2023_AngewChemInt_Becker.pdf","date_updated":"2023-08-16T12:33:31Z","file_id":"14072","success":1}],"date_updated":"2026-07-20T09:49:12Z","isi":1,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-02-24T10:45:01Z","department":[{"_id":"GradSch"},{"_id":"PaSc"}],"article_type":"original","_id":"12675","month":"05","quality_controlled":"1","status":"public","issue":"19","publisher":"Wiley","acknowledgement":"We thank AlbertA. Smith (Leipzig)for insightful discussions. This work was supported by funding from the European Research Council (StG-2012-311318 to P.S.) and used the platforms of the Grenoble Instruct-ERIC center (ISBG;UMS 3518 CNRS-CEA-UJF-EMBL) within the Grenoble Partnership for Structural Biology(PSB) and facilities and expertiseof the Biophysical and Structural Chemistry platform (BPCS) at IECB,CNRSUAR3033,INSERMUS001 and Bordeaux University.","abstract":[{"text":"Aromatic side chains are important reporters of the plasticity of proteins, and often form important contacts in protein--protein interactions. By studying a pair of structurally homologous cross-β amyloid fibrils, HET-s and HELLF, with a specific isotope-labeling approach and magic-angle-spinning (MAS) NMR, we have characterized the dynamic behavior of Phe and Tyr aromatic rings to show that the hydrophobic amyloid core is rigid, without any sign of \"breathing motions\" over hundreds of milliseconds at least. Aromatic residues exposed at the fibril surface have a rigid ring axis but undergo ring flips, on a variety of time scales from ns to µs. Our approach provides direct insight into hydrophobic-core motions, enabling a better evaluation of the conformational heterogeneity generated from a NMR structural ensemble of such amyloid cross-β architecture.","lang":"eng"}],"title":"The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues","citation":{"short":"L.M. Becker, M. Berbon, A. Vallet, A. Grelard, E. Morvan, B. Bardiaux, R. Lichtenecker, M. Ernst, A. Loquet, P. Schanda, Angewandte Chemie International Edition 62 (2023).","ieee":"L. M. Becker <i>et al.</i>, “The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues,” <i>Angewandte Chemie International Edition</i>, vol. 62, no. 19. Wiley, 2023.","chicago":"Becker, Lea Marie, Mélanie Berbon, Alicia Vallet, Axelle Grelard, Estelle Morvan, Benjamin Bardiaux, Roman Lichtenecker, Matthias Ernst, Antoine Loquet, and Paul Schanda. “The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle Spinning NMR of Aromatic Residues.” <i>Angewandte Chemie International Edition</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/anie.202219314\">https://doi.org/10.1002/anie.202219314</a>.","apa":"Becker, L. M., Berbon, M., Vallet, A., Grelard, A., Morvan, E., Bardiaux, B., … Schanda, P. (2023). The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.202219314\">https://doi.org/10.1002/anie.202219314</a>","ama":"Becker LM, Berbon M, Vallet A, et al. The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues. <i>Angewandte Chemie International Edition</i>. 2023;62(19). doi:<a href=\"https://doi.org/10.1002/anie.202219314\">10.1002/anie.202219314</a>","mla":"Becker, Lea Marie, et al. “The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle Spinning NMR of Aromatic Residues.” <i>Angewandte Chemie International Edition</i>, vol. 62, no. 19, e202219314, Wiley, 2023, doi:<a href=\"https://doi.org/10.1002/anie.202219314\">10.1002/anie.202219314</a>.","ista":"Becker LM, Berbon M, Vallet A, Grelard A, Morvan E, Bardiaux B, Lichtenecker R, Ernst M, Loquet A, Schanda P. 2023. The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues. Angewandte Chemie International Edition. 62(19), e202219314."},"publication_status":"published","volume":62,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"year":"2023","doi":"10.1002/anie.202219314"},{"publication_identifier":{"issn":["2590-1524"]},"scopus_import":"1","author":[{"last_name":"Gauto","first_name":"Diego F.","full_name":"Gauto, Diego F."},{"last_name":"Lebedenko","first_name":"Olga O.","full_name":"Lebedenko, Olga O."},{"last_name":"Becker","orcid":"0000-0002-6401-5151","full_name":"Becker, Lea Marie","first_name":"Lea Marie","id":"36336939-eb97-11eb-a6c2-c83f1214ca79"},{"full_name":"Ayala, Isabel","first_name":"Isabel","last_name":"Ayala"},{"last_name":"Lichtenecker","first_name":"Roman","full_name":"Lichtenecker, Roman"},{"last_name":"Skrynnikov","first_name":"Nikolai R.","full_name":"Skrynnikov, Nikolai R."},{"full_name":"Schanda, Paul","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606","last_name":"Schanda"}],"corr_author":"1","article_number":"100079","type":"journal_article","article_processing_charge":"No","day":"01","has_accepted_license":"1","ddc":["570"],"fulldoi":"https://doi.org/10.1016/j.yjsbx.2022.100079","keyword":["Structural Biology"],"language":[{"iso":"eng"}],"pmid":1,"date_published":"2023-01-01T00:00:00Z","external_id":{"pmid":["36578472"]},"doi":"10.1016/j.yjsbx.2022.100079","publication_status":"published","citation":{"chicago":"Gauto, Diego F., Olga O. Lebedenko, Lea Marie Becker, Isabel Ayala, Roman Lichtenecker, Nikolai R. Skrynnikov, and Paul Schanda. “Aromatic Ring Flips in Differently Packed Ubiquitin Protein Crystals from MAS NMR and MD.” <i>Journal of Structural Biology: X</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.yjsbx.2022.100079\">https://doi.org/10.1016/j.yjsbx.2022.100079</a>.","apa":"Gauto, D. F., Lebedenko, O. O., Becker, L. M., Ayala, I., Lichtenecker, R., Skrynnikov, N. R., &#38; Schanda, P. (2023). Aromatic ring flips in differently packed ubiquitin protein crystals from MAS NMR and MD. <i>Journal of Structural Biology: X</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.yjsbx.2022.100079\">https://doi.org/10.1016/j.yjsbx.2022.100079</a>","short":"D.F. Gauto, O.O. Lebedenko, L.M. Becker, I. Ayala, R. Lichtenecker, N.R. Skrynnikov, P. Schanda, Journal of Structural Biology: X 7 (2023).","ieee":"D. F. Gauto <i>et al.</i>, “Aromatic ring flips in differently packed ubiquitin protein crystals from MAS NMR and MD,” <i>Journal of Structural Biology: X</i>, vol. 7. Elsevier, 2023.","ista":"Gauto DF, Lebedenko OO, Becker LM, Ayala I, Lichtenecker R, Skrynnikov NR, Schanda P. 2023. Aromatic ring flips in differently packed ubiquitin protein crystals from MAS NMR and MD. Journal of Structural Biology: X. 7, 100079.","ama":"Gauto DF, Lebedenko OO, Becker LM, et al. Aromatic ring flips in differently packed ubiquitin protein crystals from MAS NMR and MD. <i>Journal of Structural Biology: X</i>. 2023;7. doi:<a href=\"https://doi.org/10.1016/j.yjsbx.2022.100079\">10.1016/j.yjsbx.2022.100079</a>","mla":"Gauto, Diego F., et al. “Aromatic Ring Flips in Differently Packed Ubiquitin Protein Crystals from MAS NMR and MD.” <i>Journal of Structural Biology: X</i>, vol. 7, 100079, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.yjsbx.2022.100079\">10.1016/j.yjsbx.2022.100079</a>."},"volume":7,"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"year":"2023","acknowledgement":"The NMR platform in Grenoble is part of the Grenoble Instruct-ERIC center (ISBG; UAR 3518 CNRS-CEA-UGA-EMBL) within the Grenoble Partnership for Structural Biology (PSB), supported by FRISBI (ANR-10-INBS-0005-02) and GRAL, financed within the University Grenoble Alpes graduate school (Ecoles Universitaires de Recherche) CBH-EUR-GS (ANR-17-EURE-0003). This work was supported by the European Research Council (StG-2012-311318-ProtDyn2Function to P.S.) and used the platforms of the Grenoble Instruct Center (ISBG; UMS 3518 CNRS-CEA-UJF-EMBL) with support from FRISBI (ANR-10-INSB-05–02) and GRAL (ANR-10-LABX-49–01) within the Grenoble Partnership for Structural Biology (PSB). We would like to thank Sergei Izmailov for developing and maintaining the pyxmolpp2 library. N.R.S. acknowledges support from St. Petersburg State University in a form of the grant 92425251 and the access to the MRR, MCT and CAMR resource centers. P.S. thanks Malcolm Levitt for pointing out the fact that “tensor asymmetry” is better called “tensor biaxiality”.","abstract":[{"lang":"eng","text":"Probing the dynamics of aromatic side chains provides important insights into the behavior of a protein because flips of aromatic rings in a protein’s hydrophobic core report on breathing motion involving a large part of the protein. Inherently invisible to crystallography, aromatic motions have been primarily studied by solution NMR. The question how packing of proteins in crystals affects ring flips has, thus, remained largely unexplored. Here we apply magic-angle spinning NMR, advanced phenylalanine 1H-13C/2H isotope labeling and MD simulation to a protein in three different crystal packing environments to shed light onto possible impact of packing on ring flips. The flips of the two Phe residues in ubiquitin, both surface exposed, appear remarkably conserved in the different crystal forms, even though the intermolecular packing is quite different: Phe4 flips on a ca. 10–20 ns time scale, and Phe45 are broadened in all crystals, presumably due to µs motion. Our findings suggest that intramolecular influences are more important for ring flips than intermolecular (packing) effects."}],"title":"Aromatic ring flips in differently packed ubiquitin protein crystals from MAS NMR and MD","quality_controlled":"1","status":"public","publisher":"Elsevier","_id":"12114","month":"01","date_created":"2023-01-12T11:55:38Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"PaSc"}],"article_type":"original","related_material":{"record":[{"id":"22334","status":"public","relation":"dissertation_contains"}]},"date_updated":"2026-07-20T09:49:12Z","file":[{"date_created":"2023-08-16T09:36:28Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":5132322,"checksum":"b4b1c10a31018aafe053b7d55a470e54","creator":"dernst","file_name":"2023_JourStrucBiologyX_Gauto.pdf","success":1,"date_updated":"2023-08-16T09:36:28Z","file_id":"14064"}],"oa":1,"oa_version":"Published Version","publication":"Journal of Structural Biology: X","file_date_updated":"2023-08-16T09:36:28Z","intvolume":"         7"},{"language":[{"iso":"eng"}],"date_published":"2023-07-14T00:00:00Z","external_id":{"isi":["001038636400001"]},"ddc":["530"],"fulldoi":"https://doi.org/10.3389/fphy.2023.1202132","has_accepted_license":"1","acknowledged_ssus":[{"_id":"EM-Fac"}],"article_processing_charge":"Yes","type":"journal_article","day":"14","author":[{"last_name":"Hasler","first_name":"Roger","full_name":"Hasler, Roger"},{"full_name":"Steger-Polt, Marie Helene","first_name":"Marie Helene","last_name":"Steger-Polt"},{"first_name":"Ciril","full_name":"Reiner-Rozman, Ciril","last_name":"Reiner-Rozman"},{"first_name":"Stefan","full_name":"Fossati, Stefan","last_name":"Fossati"},{"last_name":"Lee","orcid":"0000-0002-6962-8598","full_name":"Lee, Seungho","id":"BB243B88-D767-11E9-B658-BC13E6697425","first_name":"Seungho"},{"last_name":"Aspermair","first_name":"Patrik","full_name":"Aspermair, Patrik"},{"first_name":"Christoph","full_name":"Kleber, Christoph","last_name":"Kleber"},{"orcid":"0000-0001-5013-2843","last_name":"Ibáñez","full_name":"Ibáñez, Maria","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Dostalek","first_name":"Jakub","full_name":"Dostalek, Jakub"},{"last_name":"Knoll","full_name":"Knoll, Wolfgang","first_name":"Wolfgang"}],"publication_identifier":{"eissn":["2296-424X"]},"scopus_import":"1","article_number":"1202132","date_updated":"2026-07-22T06:16:47Z","isi":1,"file":[{"file_name":"2023_FrontiersPhysics_Hasler.pdf","creator":"dernst","success":1,"date_updated":"2023-08-07T07:48:11Z","file_id":"13978","date_created":"2023-08-07T07:48:11Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"fb36dda665e57bab006a000bf0faacd5","file_size":2421758}],"oa":1,"related_material":{"record":[{"relation":"research_data","id":"19308","status":"public"}]},"file_date_updated":"2023-08-07T07:48:11Z","intvolume":"        11","publication":"Frontiers in Physics","oa_version":"Published Version","month":"07","_id":"13968","department":[{"_id":"MaIb"}],"article_type":"original","date_created":"2023-08-06T22:01:11Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The use of multimodal readout mechanisms next to label-free real-time monitoring of biomolecular interactions can provide valuable insight into surface-based reaction mechanisms. To this end, the combination of an electrolyte-gated field-effect transistor (EG-FET) with a fiber optic-coupled surface plasmon resonance (FO-SPR) probe serving as gate electrode has been investigated to deconvolute surface mass and charge density variations associated to surface reactions. However, applying an electrochemical potential on such gold-coated FO-SPR gate electrodes can induce gradual morphological changes of the thin gold film, leading to an irreversible blue-shift of the SPR wavelength and a substantial signal drift. We show that mild annealing leads to optical and electronic signal stabilization (20-fold lower signal drift than as-sputtered fiber optic gates) and improved overall analytical performance characteristics. The thermal treatment prevents morphological changes of the thin gold-film occurring during operation, hence providing reliable and stable data immediately upon gate voltage application. Thus, the readout output of both transducing principles, the optical FO-SPR and electronic EG-FET, stays constant throughout the whole sensing time-window and the long-term effect of thermal treatment is also improved, providing stable signals even after 1 year of storage. Annealing should therefore be considered a necessary modification for applying fiber optic gate electrodes in real-time multimodal investigations of surface reactions at the solid-liquid interface."}],"title":"Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 Research and Innovation Programme under the Marie Skłodowska-Curie grant agreement No. 813863–BORGES. We further thank the office of the Federal Government of Lower Austria, K3-Group–Culture, Science and Education, for their financial support as part of the project “Responsive Wound Dressing”. We gratefully acknowledge the financial support from the Austrian Research Promotion Agency (FFG; 888067).\r\nWe thank the Electron Microscopy Facility at IST Austria for their support with sputter coating the FO tips and Bernhard Pichler from AIT for software development to facilitate data evaluation.","status":"public","publisher":"Frontiers","quality_controlled":"1","doi":"10.3389/fphy.2023.1202132","volume":11,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2023","citation":{"ama":"Hasler R, Steger-Polt MH, Reiner-Rozman C, et al. Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing. <i>Frontiers in Physics</i>. 2023;11. doi:<a href=\"https://doi.org/10.3389/fphy.2023.1202132\">10.3389/fphy.2023.1202132</a>","mla":"Hasler, Roger, et al. “Optical and Electronic Signal Stabilization of Plasmonic Fiber Optic Gate Electrodes: Towards Improved Real-Time Dual-Mode Biosensing.” <i>Frontiers in Physics</i>, vol. 11, 1202132, Frontiers, 2023, doi:<a href=\"https://doi.org/10.3389/fphy.2023.1202132\">10.3389/fphy.2023.1202132</a>.","ista":"Hasler R, Steger-Polt MH, Reiner-Rozman C, Fossati S, Lee S, Aspermair P, Kleber C, Ibáñez M, Dostalek J, Knoll W. 2023. Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing. Frontiers in Physics. 11, 1202132.","short":"R. Hasler, M.H. Steger-Polt, C. Reiner-Rozman, S. Fossati, S. Lee, P. Aspermair, C. Kleber, M. Ibáñez, J. Dostalek, W. Knoll, Frontiers in Physics 11 (2023).","ieee":"R. Hasler <i>et al.</i>, “Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing,” <i>Frontiers in Physics</i>, vol. 11. Frontiers, 2023.","chicago":"Hasler, Roger, Marie Helene Steger-Polt, Ciril Reiner-Rozman, Stefan Fossati, Seungho Lee, Patrik Aspermair, Christoph Kleber, Maria Ibáñez, Jakub Dostalek, and Wolfgang Knoll. “Optical and Electronic Signal Stabilization of Plasmonic Fiber Optic Gate Electrodes: Towards Improved Real-Time Dual-Mode Biosensing.” <i>Frontiers in Physics</i>. Frontiers, 2023. <a href=\"https://doi.org/10.3389/fphy.2023.1202132\">https://doi.org/10.3389/fphy.2023.1202132</a>.","apa":"Hasler, R., Steger-Polt, M. H., Reiner-Rozman, C., Fossati, S., Lee, S., Aspermair, P., … Knoll, W. (2023). Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing. <i>Frontiers in Physics</i>. Frontiers. <a href=\"https://doi.org/10.3389/fphy.2023.1202132\">https://doi.org/10.3389/fphy.2023.1202132</a>"},"publication_status":"published"},{"date_published":"2023-07-14T00:00:00Z","oa_version":"Published Version","oa":1,"date_updated":"2026-07-22T06:16:48Z","related_material":{"record":[{"status":"public","id":"13968","relation":"used_in_publication"}]},"department":[{"_id":"MaIb"}],"date_created":"2025-03-07T08:40:58Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","fulldoi":"https://doi.org/10.5281/ZENODO.7716920","ddc":["540"],"has_accepted_license":"1","_id":"19308","publisher":"Zenodo","day":"14","status":"public","title":"Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing","article_processing_charge":"No","abstract":[{"text":"This Dataset contains the raw data from the following publication: \"Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: towards improved real-time dual-mode biosensing\" (DOI 10.3389/fphy.2023.1202132)","lang":"eng"}],"type":"research_data_reference","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2023","OA_place":"repository","citation":{"apa":"Hasler, R., Polt, M.-H., Reiner-Rozman, C., Fossati, S., Lee, S., Aspermair, P., … Knoll, W. (2023). Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7716920\">https://doi.org/10.5281/ZENODO.7716920</a>","chicago":"Hasler, Roger, Marie-Helene Polt, Ciril Reiner-Rozman, Stefan Fossati, Seungho Lee, Patrik Aspermair, Christoph Kleber, Maria Ibáñez, Jakub Dostalek, and Wolfgang Knoll. “Optical and Electronic Signal Stabilization of Plasmonic Fiber Optic Gate Electrodes: Towards Improved Real-Time Dual-Mode Biosensing.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7716920\">https://doi.org/10.5281/ZENODO.7716920</a>.","ieee":"R. Hasler <i>et al.</i>, “Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing.” Zenodo, 2023.","short":"R. Hasler, M.-H. Polt, C. Reiner-Rozman, S. Fossati, S. Lee, P. Aspermair, C. Kleber, M. Ibáñez, J. Dostalek, W. Knoll, (2023).","ista":"Hasler R, Polt M-H, Reiner-Rozman C, Fossati S, Lee S, Aspermair P, Kleber C, Ibáñez M, Dostalek J, Knoll W. 2023. Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7716920\">10.5281/ZENODO.7716920</a>.","mla":"Hasler, Roger, et al. <i>Optical and Electronic Signal Stabilization of Plasmonic Fiber Optic Gate Electrodes: Towards Improved Real-Time Dual-Mode Biosensing</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7716920\">10.5281/ZENODO.7716920</a>.","ama":"Hasler R, Polt M-H, Reiner-Rozman C, et al. Optical and electronic signal stabilization of plasmonic fiber optic gate electrodes: Towards improved real-time dual-mode biosensing. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7716920\">10.5281/ZENODO.7716920</a>"},"OA_type":"green","author":[{"full_name":"Hasler, Roger","first_name":"Roger","last_name":"Hasler"},{"full_name":"Polt, Marie-Helene","first_name":"Marie-Helene","last_name":"Polt"},{"last_name":"Reiner-Rozman","full_name":"Reiner-Rozman, Ciril","first_name":"Ciril"},{"last_name":"Fossati","full_name":"Fossati, Stefan","first_name":"Stefan"},{"last_name":"Lee","full_name":"Lee, Seungho","first_name":"Seungho"},{"last_name":"Aspermair","full_name":"Aspermair, Patrik","first_name":"Patrik"},{"full_name":"Kleber, Christoph","first_name":"Christoph","last_name":"Kleber"},{"orcid":"0000-0001-5013-2843","last_name":"Ibáñez","full_name":"Ibáñez, Maria","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Dostalek","full_name":"Dostalek, Jakub","first_name":"Jakub"},{"full_name":"Knoll, Wolfgang","first_name":"Wolfgang","last_name":"Knoll"}],"doi":"10.5281/ZENODO.7716920","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/ZENODO.7716920"}]},{"language":[{"iso":"eng"}],"keyword":["broadcast","cover","k-broadcast","dynamic radius","dynamic graphs","oblivious message adversary","time complexity","Theory of computation → Distributed algorithms","Networks → Network algorithms"],"arxiv":1,"alternative_title":["LIPIcs"],"external_id":{"arxiv":["2211.10151"]},"date_published":"2023-02-01T00:00:00Z","ddc":["000"],"fulldoi":"https://doi.org/10.4230/LIPICS.ITCS.2023.47","has_accepted_license":"1","article_processing_charge":"No","type":"conference","day":"01","author":[{"orcid":"0000-0003-4268-7368","last_name":"El-Hayek","full_name":"El-Hayek, Antoine","first_name":"Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Stefan","full_name":"Schmid, Stefan","orcid":"0000-0002-7798-1711","last_name":"Schmid"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772631"]},"scopus_import":"1","article_number":"47","date_updated":"2026-07-24T12:48:29Z","file":[{"date_updated":"2026-07-22T08:04:03Z","file_id":"22383","success":1,"file_name":"2023_LIPIcs_El-Hayek.pdf","creator":"cchlebak","checksum":"d7f45fdcbc5fccd61db69f56d775c636","file_size":1077427,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_created":"2026-07-22T08:04:03Z"}],"oa":1,"related_material":{"record":[{"id":"22281","status":"public","relation":"dissertation_contains"}]},"file_date_updated":"2026-07-22T08:04:03Z","intvolume":"       251","oa_version":"Published Version","publication":"14th Innovations in Theoretical Computer Science Conference","month":"02","editor":[{"last_name":"Tauman Kalai","first_name":"Yael","full_name":"Tauman Kalai, Yael"}],"_id":"22373","extern":"1","conference":{"start_date":"2023-01-10","location":"Cambridge, Massachusetts, USA","name":"ITCS: Innovations in Theoretical Computer Science","end_date":"2023-01-13"},"date_created":"2026-07-20T11:45:04Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","abstract":[{"text":"Data dissemination is a fundamental task in distributed computing. This paper studies broadcast problems in various innovative models where the communication network connecting n processes is dynamic (e.g., due to mobility or failures) and controlled by an adversary. \r\nIn the first model, the processes transitively communicate their ids in synchronous rounds along a rooted tree given in each round by the adversary whose goal is to maximize the number of rounds until at least one id is known by all processes. Previous research has shown a ⌈(3n-1)/2⌉-2 lower bound and an O(nlog log n) upper bound. We show the first linear upper bound for this problem, namely ⌈(1+√2) n-1⌉ ≈ 2.4n.\r\nWe extend these results to the setting where the adversary gives in each round k-disjoint forests and their goal is to maximize the number of rounds until there is a set of k ids such that each process knows of at least one of them. We give a ⌈3(n-k)/2⌉-1 lower bound and a (π²+6)/6 n+1 ≈ 2.6n upper bound for this problem.\r\nFinally, we study the setting where the adversary gives in each round a directed graph with k roots and their goal is to maximize the number of rounds until there exist k ids that are known by all processes. We give a ⌈3(n-3k)/2⌉+2 lower bound and a ⌈(1+√2)n⌉+k-1 ≈ 2.4n+k upper bound for this problem.\r\nFor the two latter problems no upper or lower bounds were previously known.","lang":"eng"}],"title":"Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks","acknowledgement":" This project has received funding from the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme (grant agreement No.\r\n101019564). This work was further supported by the Austrian Science Fund (FWF) and netIDEE\r\nSCIENCE project P 33775-N, as well as the FWF project I 4800-N (ADVISE)","status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","doi":"10.4230/LIPICS.ITCS.2023.47","volume":251,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2023","citation":{"chicago":"El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks.” In <i>14th Innovations in Theoretical Computer Science Conference</i>, edited by Yael Tauman Kalai, Vol. 251. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPICS.ITCS.2023.47\">https://doi.org/10.4230/LIPICS.ITCS.2023.47</a>.","apa":"El-Hayek, A., Henzinger, M., &#38; Schmid, S. (2023). Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks. In Y. Tauman Kalai (Ed.), <i>14th Innovations in Theoretical Computer Science Conference</i> (Vol. 251). Cambridge, Massachusetts, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ITCS.2023.47\">https://doi.org/10.4230/LIPICS.ITCS.2023.47</a>","short":"A. El-Hayek, M. Henzinger, S. Schmid, in:, Y. Tauman Kalai (Ed.), 14th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"A. El-Hayek, M. Henzinger, and S. Schmid, “Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks,” in <i>14th Innovations in Theoretical Computer Science Conference</i>, Cambridge, Massachusetts, USA, 2023, vol. 251.","ista":"El-Hayek A, Henzinger M, Schmid S. 2023. Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks. 14th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 251, 47.","ama":"El-Hayek A, Henzinger M, Schmid S. Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks. In: Tauman Kalai Y, ed. <i>14th Innovations in Theoretical Computer Science Conference</i>. Vol 251. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPICS.ITCS.2023.47\">10.4230/LIPICS.ITCS.2023.47</a>","mla":"El-Hayek, Antoine, et al. “Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks.” <i>14th Innovations in Theoretical Computer Science Conference</i>, edited by Yael Tauman Kalai, vol. 251, 47, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPICS.ITCS.2023.47\">10.4230/LIPICS.ITCS.2023.47</a>."},"publication_status":"published"},{"date_created":"2024-02-28T17:59:32Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"_id":"15039","month":"11","publication":"arXiv","oa_version":"Preprint","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"19759"}]},"date_updated":"2026-07-27T12:47:43Z","oa":1,"OA_place":"repository","citation":{"ista":"Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations. arXiv, 2311.06103.","ama":"Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">10.48550/ARXIV.2311.06103</a>","mla":"Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More Expressive with N-Activations.” <i>ArXiv</i>, 2311.06103, doi:<a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">10.48550/ARXIV.2311.06103</a>.","chicago":"Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More Expressive with N-Activations.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">https://doi.org/10.48550/ARXIV.2311.06103</a>.","apa":"Prach, B., &#38; Lampert, C. (n.d.). 1-Lipschitz neural networks are more expressive with N-activations. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">https://doi.org/10.48550/ARXIV.2311.06103</a>","short":"B. Prach, C. Lampert, ArXiv (n.d.).","ieee":"B. Prach and C. Lampert, “1-Lipschitz neural networks are more expressive with N-activations,” <i>arXiv</i>. ."},"publication_status":"draft","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2023","doi":"10.48550/ARXIV.2311.06103","status":"public","title":"1-Lipschitz neural networks are more expressive with N-activations","abstract":[{"text":"A crucial property for achieving secure, trustworthy and interpretable deep learning systems is their robustness: small changes to a system's inputs should not result in large changes to its outputs. Mathematically, this means one strives for networks with a small Lipschitz constant. Several recent works have focused on how to construct such Lipschitz networks, typically by imposing constraints on the weight matrices. In this work, we study an orthogonal aspect, namely the role of the activation function. We show that commonly used activation functions, such as MaxMin, as well as all piece-wise linear ones with two segments unnecessarily restrict the class of representable functions, even in the simplest one-dimensional setting. We furthermore introduce the new N-activation function that is provably more expressive than currently popular activation functions. We provide code at this https URL.","lang":"eng"}],"fulldoi":"https://doi.org/10.48550/ARXIV.2311.06103","external_id":{"arxiv":["2311.06103"]},"date_published":"2023-11-10T00:00:00Z","arxiv":1,"language":[{"iso":"eng"}],"corr_author":"1","article_number":"2311.06103","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.06103","open_access":"1"}],"author":[{"last_name":"Prach","full_name":"Prach, Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","first_name":"Bernd"},{"full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"day":"10","type":"preprint","article_processing_charge":"No"},{"type":"conference","article_processing_charge":"No","day":"22","publication_identifier":{"eissn":["2575-7075"],"eisbn":["9798350301298"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2304.12622"}],"author":[{"full_name":"Iofinova, Eugenia B","first_name":"Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","orcid":"0000-0002-7778-3221","last_name":"Iofinova"},{"last_name":"Peste","first_name":"Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87","full_name":"Peste, Elena-Alexandra"},{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"}],"corr_author":"1","page":"24364-24373","language":[{"iso":"eng"}],"date_published":"2023-08-22T00:00:00Z","external_id":{"isi":["001062531308068"],"arxiv":["2304.12622"]},"arxiv":1,"fulldoi":"https://doi.org/10.1109/cvpr52729.2023.02334","acknowledgement":"The authors would like to sincerely thank Sara Hooker for her feedback during the development of this work. EI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. AP and DA acknowledge generous ERC support, via Starting Grant 805223 ScaleML.","abstract":[{"text":"Pruning—that is, setting a significant subset of the parameters of a neural network to zero—is one of the most popular methods of model compression. Yet, several recent works have raised the issue that pruning may induce or exacerbate bias in the output of the compressed model. Despite existing evidence for this phenomenon, the relationship between neural network pruning and induced bias is not well-understood. In this work, we systematically investigate and characterize this phenomenon in Convolutional Neural Networks for computer vision. First, we show that it is in fact possible to obtain highly-sparse models, e.g. with less than 10% remaining weights, which do not decrease in accuracy nor substantially increase in bias when compared to dense models. At the same time, we also find that, at higher sparsities, pruned models exhibit higher uncertainty in their outputs, as well as increased correlations, which we directly link to increased bias. We propose easy-to-use criteria which, based only on the uncompressed model, establish whether bias will increase with pruning, and identify the samples most susceptible to biased predictions post-compression. Our code can be found at https://github.com/IST-DASLab/pruned-vision-model-bias.","lang":"eng"}],"title":"Bias in pruned vision models: In-depth analysis and countermeasures","quality_controlled":"1","project":[{"name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"},{"name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020"}],"publisher":"IEEE","status":"public","doi":"10.1109/cvpr52729.2023.02334","publication_status":"published","citation":{"mla":"Iofinova, Eugenia B., et al. “Bias in Pruned Vision Models: In-Depth Analysis and Countermeasures.” <i>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, IEEE, 2023, pp. 24364–73, doi:<a href=\"https://doi.org/10.1109/cvpr52729.2023.02334\">10.1109/cvpr52729.2023.02334</a>.","ama":"Iofinova EB, Krumes A, Alistarh D-A. Bias in pruned vision models: In-depth analysis and countermeasures. In: <i>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. IEEE; 2023:24364-24373. doi:<a href=\"https://doi.org/10.1109/cvpr52729.2023.02334\">10.1109/cvpr52729.2023.02334</a>","ista":"Iofinova EB, Krumes A, Alistarh D-A. 2023. Bias in pruned vision models: In-depth analysis and countermeasures. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 24364–24373.","ieee":"E. B. Iofinova, A. Krumes, and D.-A. Alistarh, “Bias in pruned vision models: In-depth analysis and countermeasures,” in <i>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Vancouver, BC, Canada, 2023, pp. 24364–24373.","short":"E.B. Iofinova, A. Krumes, D.-A. Alistarh, in:, 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2023, pp. 24364–24373.","apa":"Iofinova, E. B., Krumes, A., &#38; Alistarh, D.-A. (2023). Bias in pruned vision models: In-depth analysis and countermeasures. In <i>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 24364–24373). Vancouver, BC, Canada: IEEE. <a href=\"https://doi.org/10.1109/cvpr52729.2023.02334\">https://doi.org/10.1109/cvpr52729.2023.02334</a>","chicago":"Iofinova, Eugenia B, Alexandra Krumes, and Dan-Adrian Alistarh. “Bias in Pruned Vision Models: In-Depth Analysis and Countermeasures.” In <i>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 24364–73. IEEE, 2023. <a href=\"https://doi.org/10.1109/cvpr52729.2023.02334\">https://doi.org/10.1109/cvpr52729.2023.02334</a>."},"year":"2023","related_material":{"record":[{"status":"public","id":"21854","relation":"dissertation_contains"}],"link":[{"relation":"software","url":"https://github.com/IST-DASLab/pruned-vision-model-bias"}]},"oa":1,"date_updated":"2026-07-27T12:50:03Z","isi":1,"publication":"2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition","oa_version":"Preprint","conference":{"start_date":"2023-06-17","end_date":"2023-06-24","name":"CVPR: Conference on Computer Vision and Pattern Recognition","location":"Vancouver, BC, Canada"},"_id":"14771","ec_funded":1,"month":"08","date_created":"2024-01-10T08:42:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"},{"_id":"ChLa"}]},{"ddc":["570"],"fulldoi":"https://doi.org/10.1038/s43588-023-00410-9","has_accepted_license":"1","language":[{"iso":"eng"}],"arxiv":1,"pmid":1,"external_id":{"isi":["000968161800002"],"arxiv":["2108.06686"],"pmid":["38177880"]},"date_published":"2023-03-20T00:00:00Z","author":[{"id":"A057D288-3E88-11E9-986D-0CF4E5697425","first_name":"Fabrizio","full_name":"Lombardi, Fabrizio","orcid":"0000-0003-2623-5249","last_name":"Lombardi"},{"last_name":"Pepic","full_name":"Pepic, Selver","first_name":"Selver","id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425"},{"first_name":"Oren","full_name":"Shriki, Oren","last_name":"Shriki"},{"orcid":"0000-0002-6699-1455","last_name":"Tkačik","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper"},{"orcid":"0000-0002-5214-4706","last_name":"De Martino","full_name":"De Martino, Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","first_name":"Daniele"}],"scopus_import":"1","publication_identifier":{"eissn":["2662-8457"]},"corr_author":"1","page":"254-263","article_processing_charge":"No","type":"journal_article","day":"20","month":"03","_id":"12762","ec_funded":1,"department":[{"_id":"GaTk"},{"_id":"GradSch"}],"article_type":"original","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2023-03-26T22:01:08Z","isi":1,"date_updated":"2026-07-29T06:53:41Z","file":[{"creator":"dernst","file_name":"2023_NatureCompScience_Lombardi.pdf","file_id":"14073","date_updated":"2023-08-16T12:39:57Z","success":1,"content_type":"application/pdf","date_created":"2023-08-16T12:39:57Z","access_level":"open_access","relation":"main_file","file_size":4474284,"checksum":"7c63b2b2edfd68aaffe96d70ca6a865a"}],"oa":1,"related_material":{"record":[{"status":"public","id":"10912","relation":"earlier_version"}]},"file_date_updated":"2023-08-16T12:39:57Z","intvolume":"         3","oa_version":"Published Version","publication":"Nature Computational Science","doi":"10.1038/s43588-023-00410-9","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2023","volume":3,"citation":{"ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. 2023. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. 3, 254–263.","mla":"Lombardi, Fabrizio, et al. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” <i>Nature Computational Science</i>, vol. 3, Springer Nature, 2023, pp. 254–63, doi:<a href=\"https://doi.org/10.1038/s43588-023-00410-9\">10.1038/s43588-023-00410-9</a>.","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. <i>Nature Computational Science</i>. 2023;3:254-263. doi:<a href=\"https://doi.org/10.1038/s43588-023-00410-9\">10.1038/s43588-023-00410-9</a>","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., &#38; De Martino, D. (2023). Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. <i>Nature Computational Science</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s43588-023-00410-9\">https://doi.org/10.1038/s43588-023-00410-9</a>","chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” <i>Nature Computational Science</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s43588-023-00410-9\">https://doi.org/10.1038/s43588-023-00410-9</a>.","ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain,” <i>Nature Computational Science</i>, vol. 3. Springer Nature, pp. 254–263, 2023.","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, Nature Computational Science 3 (2023) 254–263."},"publication_status":"published","abstract":[{"lang":"eng","text":"Neurons in the brain are wired into adaptive networks that exhibit collective dynamics as diverse as scale-specific oscillations and scale-free neuronal avalanches. Although existing models account for oscillations and avalanches separately, they typically do not explain both phenomena, are too complex to analyze analytically or intractable to infer from data rigorously. Here we propose a feedback-driven Ising-like class of neural networks that captures avalanches and oscillations simultaneously and quantitatively. In the simplest yet fully microscopic model version, we can analytically compute the phase diagram and make direct contact with human brain resting-state activity recordings via tractable inference of the model’s two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor oscillations to collective behaviors of extreme events and neuronal avalanches. Importantly, the inferred parameters indicate that the co-existence of scale-specific (oscillations) and scale-free (avalanches) dynamics occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations."}],"title":"Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain","acknowledgement":"This research was funded in whole, or in part, by the Austrian Science Fund (FWF) (grant no. PT1013M03318 to F.L. and no. P34015 to G.T.). For the purpose of open access, the author has applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. The study was supported by the European Union Horizon 2020 research and innovation program under the Marie Sklodowska-Curie action (grant agreement No. 754411 to F.L.).","status":"public","publisher":"Springer Nature","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"name":"Functional Advantages of Critical Brain Dynamics","_id":"eb943429-77a9-11ec-83b8-9f471cdf5c67","grant_number":"M03318"},{"_id":"626c45b5-2b32-11ec-9570-e509828c1ba6","grant_number":"P34015","name":"Efficient coding with biophysical realism"}],"quality_controlled":"1"}]
