[{"_id":"19983","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2108.02655","open_access":"1"}],"oa_version":"Preprint","quality_controlled":"1","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"doi":"10.1137/1.9781611977585.ch17","citation":{"ista":"Balliu A, Korhonen J, Kuhn F, Lievonen H, Olivetti D, Pai S, Paz A, Rybicki J, Schmid S, Studený J, Suomela J, Uitto J. 2023.Sinkless Orientation Made Simple. In: Symposium on Simplicity in Algorithms. , 175–191.","apa":"Balliu, A., Korhonen, J., Kuhn, F., Lievonen, H., Olivetti, D., Pai, S., … Uitto, J. (2023). Sinkless Orientation Made Simple. In <i>Symposium on Simplicity in Algorithms</i> (pp. 175–191). Florence, Italy: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">https://doi.org/10.1137/1.9781611977585.ch17</a>","ama":"Balliu A, Korhonen J, Kuhn F, et al. Sinkless Orientation Made Simple. In: <i>Symposium on Simplicity in Algorithms</i>. Society for Industrial and Applied Mathematics; 2023:175-191. doi:<a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">10.1137/1.9781611977585.ch17</a>","mla":"Balliu, Alkida, et al. “Sinkless Orientation Made Simple.” <i>Symposium on Simplicity in Algorithms</i>, Society for Industrial and Applied Mathematics, 2023, pp. 175–91, doi:<a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">10.1137/1.9781611977585.ch17</a>.","ieee":"A. Balliu <i>et al.</i>, “Sinkless Orientation Made Simple,” in <i>Symposium on Simplicity in Algorithms</i>, Society for Industrial and Applied Mathematics, 2023, pp. 175–191.","short":"A. Balliu, J. Korhonen, F. Kuhn, H. Lievonen, D. Olivetti, S. Pai, A. Paz, J. Rybicki, S. Schmid, J. Studený, J. Suomela, J. Uitto, in:, Symposium on Simplicity in Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 175–191.","chicago":"Balliu, Alkida, Janne Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, et al. “Sinkless Orientation Made Simple.” In <i>Symposium on Simplicity in Algorithms</i>, 175–91. Society for Industrial and Applied Mathematics, 2023. <a href=\"https://doi.org/10.1137/1.9781611977585.ch17\">https://doi.org/10.1137/1.9781611977585.ch17</a>."},"department":[{"_id":"DaAl"}],"date_updated":"2026-07-06T11:57:38Z","title":"Sinkless Orientation Made Simple","author":[{"first_name":"Alkida","last_name":"Balliu","full_name":"Balliu, Alkida"},{"full_name":"Korhonen, Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","last_name":"Korhonen","first_name":"Janne"},{"full_name":"Kuhn, Fabian","last_name":"Kuhn","first_name":"Fabian"},{"full_name":"Lievonen, Henrik","first_name":"Henrik","last_name":"Lievonen"},{"last_name":"Olivetti","first_name":"Dennis","full_name":"Olivetti, Dennis"},{"full_name":"Pai, Shreyas","first_name":"Shreyas","last_name":"Pai"},{"last_name":"Paz","first_name":"Ami","full_name":"Paz, Ami"},{"first_name":"Joel","last_name":"Rybicki","orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"last_name":"Studený","first_name":"Jan","full_name":"Studený, Jan"},{"full_name":"Suomela, Jukka","first_name":"Jukka","last_name":"Suomela"},{"full_name":"Uitto, Jara","first_name":"Jara","last_name":"Uitto"}],"conference":{"end_date":"2023-01-25","start_date":"2023-01-23","name":"SOSA: Symposium on Simplicity in Algorithms","location":"Florence, Italy"},"OA_place":"repository","external_id":{"arxiv":["2108.02655"]},"publication_identifier":{"eisbn":["9781611977585"]},"acknowledgement":"We thank the anonymous reviewers for their helpful feedback on previous versions of this work. Parts ofthis work appeared in DISC 2021 as a brief announcement [ 21]. This work was supported in part by theEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovationprogramme (grant agreement No 805223 ScaleML), the Academy of Finland (grant agreement No 333837),the Austrian Science Fund (FWF) and netIDEE (grant agreement No P 33775-N), and the AustrianScience Fund (FWF) project DELTA (grant agreement No I 5025-N).","day":"12","arxiv":1,"das_tickbox":"1","month":"01","publication":"Symposium on Simplicity in Algorithms","status":"public","OA_type":"green","language":[{"iso":"eng"}],"abstract":[{"text":"The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distributed graph algorithms, LOCAL and SLOCAL: the locality of sinkless orientation is Ω(log n) in the deterministic LOCAL model and O(log log n) in the deterministic SLOCAL model. Both of these results are known by prior work, but here we give new simple, self-contained proofs for them.","lang":"eng"}],"date_created":"2025-07-10T13:11:47Z","publisher":"Society for Industrial and Applied Mathematics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-01-12T00:00:00Z","year":"2023","article_processing_charge":"No","publication_status":"published","ec_funded":1,"type":"book_chapter","oa":1,"page":"175-191"},{"article_number":"131","date_published":"2023-08-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2023-08-02T07:42:26Z","file_id":"13448","success":1,"access_level":"open_access","content_type":"application/pdf","file_size":4192386,"checksum":"f12452834d7ed6748dbf5ace18af4723","creator":"dernst","file_name":"2023_AstrophysicalJour_Mathur.pdf","date_created":"2023-08-02T07:42:26Z","relation":"main_file"}],"publication_status":"published","year":"2023","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"article_processing_charge":"Yes","oa":1,"isi":1,"type":"journal_article","month":"08","status":"public","publication":"The Astrophysical Journal","ddc":["520"],"das_tickbox":"1","issue":"2","intvolume":"       952","language":[{"iso":"eng"}],"publisher":"IOP Publishing","abstract":[{"lang":"eng","text":"The ages of solar-like stars have been at the center of many studies such as exoplanet characterization or Galactic-archeology. While ages are usually computed from stellar evolution models, relations linking ages to other stellar properties, such as rotation and magnetic activity, have been investigated. With the large catalog of 55,232 rotation periods, Prot, and photometric magnetic activity index, Sph from Kepler data, we have the opportunity to look for such magneto-gyro-chronology relations. Stellar ages are obtained with two stellar evolution codes that include treatment of angular momentum evolution, hence using Prot as input in addition to classical atmospheric parameters. We explore two different ways of predicting stellar ages on three subsamples with spectroscopic observations: solar analogs, late-F and G dwarfs, and K dwarfs. We first perform a Bayesian analysis to derive relations between Sph and ages between 1 and 5 Gyr, and other stellar properties. For late-F and G dwarfs, and K dwarfs, the multivariate regression favors the model with Prot and Sph with median differences of 0.1% and 0.2%, respectively. We also apply Machine Learning techniques with a Random Forest algorithm to predict ages up to 14 Gyr with the same set of input parameters. For late-F, G and K dwarfs together, predicted ages are on average within 5.3% of the model ages and improve to 3.1% when including Prot. These are very promising results for a quick age estimation for solar-like stars with photometric observations, especially with current and future space missions."}],"date_created":"2023-08-01T14:19:16Z","has_accepted_license":"1","title":"Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations","date_updated":"2026-07-06T12:20:17Z","author":[{"full_name":"Mathur, Savita","first_name":"Savita","last_name":"Mathur"},{"full_name":"Claytor, Zachary R.","last_name":"Claytor","first_name":"Zachary R."},{"last_name":"Santos","first_name":"Ângela R. G.","full_name":"Santos, Ângela R. G."},{"last_name":"García","first_name":"Rafael A.","full_name":"García, Rafael A."},{"full_name":"Amard, Louis","first_name":"Louis","last_name":"Amard"},{"first_name":"Lisa Annabelle","orcid":"0000-0003-0142-4000","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle"},{"full_name":"Corsaro, Enrico","last_name":"Corsaro","first_name":"Enrico"},{"first_name":"Alfio","last_name":"Bonanno","full_name":"Bonanno, Alfio"},{"full_name":"Breton, Sylvain N.","first_name":"Sylvain N.","last_name":"Breton"},{"full_name":"Godoy-Rivera, Diego","first_name":"Diego","last_name":"Godoy-Rivera"},{"full_name":"Pinsonneault, Marc H.","last_name":"Pinsonneault","first_name":"Marc H."},{"full_name":"van Saders, Jennifer","first_name":"Jennifer","last_name":"van Saders"}],"external_id":{"isi":["001034185700001"]},"license":"https://creativecommons.org/licenses/by/4.0/","day":"01","file_date_updated":"2023-08-02T07:42:26Z","acknowledgement":"This paper includes data collected by the Kepler mission and obtained from the MAST data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler mission is provided by the NASA Science Mission Directorate. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5–26555. We acknowledge that this research was supported in part by the National Science Foundation under grant No. NSF PHY-1748958. S.M. acknowledges support from the Spanish Ministry of Science and Innovation (MICINN) with the Ramón y Cajal fellowship No. RYC-2015-17697, the grant No. PID2019-107061GB-C66, and through AEI under the Severo Ochoa Centres of Excellence Programme 2020–2023 (CEX2019-000920-S). S.M. and D.G.R. acknowledge support from the Spanish Ministry of Science and Innovation (MICINN) with the grant No. PID2019-107187GB-I00. Z.R.C. acknowledges support from National Aeronautics and Space Administration via the TESS Guest Investigator Program (grant No. 80NSSC18K18584). The work presented here was partially supported by the NASA grant NNX17AF27G. A.R.G.S. acknowledges the support by FCT through national funds and by FEDER through COMPETE2020 by the following grants: UIDB/04434/2020 and UIDP/04434/2020. A.R.G.S. is supported by FCT through the work contract No. 2020.02480.CEECIND/CP1631/CT0001. R.A.G., L.A., and S.N.B. acknowledge the support from PLATO and GOLF CNES grants. S.N.B. acknowledges support from PLATO ASI-INAF agreement No. 2015-019-R.1-2018.","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"article_type":"original","oa_version":"Published Version","quality_controlled":"1","_id":"13443","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.3847/1538-4357/acd118","citation":{"ama":"Mathur S, Claytor ZR, Santos ÂRG, et al. Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. <i>The Astrophysical Journal</i>. 2023;952(2). doi:<a href=\"https://doi.org/10.3847/1538-4357/acd118\">10.3847/1538-4357/acd118</a>","ista":"Mathur S, Claytor ZR, Santos ÂRG, García RA, Amard L, Bugnet LA, Corsaro E, Bonanno A, Breton SN, Godoy-Rivera D, Pinsonneault MH, van Saders J. 2023. Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. The Astrophysical Journal. 952(2), 131.","apa":"Mathur, S., Claytor, Z. R., Santos, Â. R. G., García, R. A., Amard, L., Bugnet, L. A., … van Saders, J. (2023). Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. <i>The Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4357/acd118\">https://doi.org/10.3847/1538-4357/acd118</a>","mla":"Mathur, Savita, et al. “Magnetic Activity Evolution of Solar-like Stars. I. Sph–Age Relation Derived from Kepler Observations.” <i>The Astrophysical Journal</i>, vol. 952, no. 2, 131, IOP Publishing, 2023, doi:<a href=\"https://doi.org/10.3847/1538-4357/acd118\">10.3847/1538-4357/acd118</a>.","ieee":"S. Mathur <i>et al.</i>, “Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations,” <i>The Astrophysical Journal</i>, vol. 952, no. 2. IOP Publishing, 2023.","short":"S. Mathur, Z.R. Claytor, Â.R.G. Santos, R.A. García, L. Amard, L.A. Bugnet, E. Corsaro, A. Bonanno, S.N. Breton, D. Godoy-Rivera, M.H. Pinsonneault, J. van Saders, The Astrophysical Journal 952 (2023).","chicago":"Mathur, Savita, Zachary R. Claytor, Ângela R. G. Santos, Rafael A. García, Louis Amard, Lisa Annabelle Bugnet, Enrico Corsaro, et al. “Magnetic Activity Evolution of Solar-like Stars. I. Sph–Age Relation Derived from Kepler Observations.” <i>The Astrophysical Journal</i>. IOP Publishing, 2023. <a href=\"https://doi.org/10.3847/1538-4357/acd118\">https://doi.org/10.3847/1538-4357/acd118</a>."},"volume":952,"scopus_import":"1","department":[{"_id":"LiBu"}]},{"ddc":["546","541"],"status":"public","month":"04","corr_author":"1","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"degree_awarded":"PhD","supervisor":[{"last_name":"Ibáñez","orcid":"0000-0001-5013-2843","first_name":"Maria","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","abstract":[{"lang":"eng","text":"High-performance semiconductors rely upon precise control of heat and charge transport. This can be achieved by precisely engineering defects in polycrystalline solids. There are multiple approaches to preparing such polycrystalline semiconductors, and the transformation of solution-processed colloidal nanoparticles is appealing because colloidal nanoparticles combine low cost with structural and compositional tunability along with rich surface chemistry. However, the multiple processes from nanoparticle synthesis to the final bulk nanocomposites are very complex. They involve nanoparticle purification, post-synthetic modifications, and finally consolidation (thermal treatments and densification). All these properties dictate the final material’s composition and microstructure, ultimately affecting its functional properties. This thesis explores the synthesis, surface chemistry and consolidation of colloidal semiconductor nanoparticles into dense solids. In particular, the transformations that take place during these processes, and their effect on the material’s transport properties are evaluated. "}],"has_accepted_license":"1","date_created":"2023-05-02T07:58:57Z","alternative_title":["ISTA Thesis"],"date_published":"2023-04-28T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","file":[{"date_updated":"2023-05-02T07:43:18Z","file_id":"12887","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","file_size":99627036,"creator":"mcalcabr","file_name":"Thesis_Calcabrini.docx","checksum":"9347b0e09425f56fdcede5d3528404dc","relation":"source_file","date_created":"2023-05-02T07:43:18Z"},{"date_updated":"2023-05-02T07:42:45Z","file_id":"12888","success":1,"access_level":"open_access","content_type":"application/pdf","file_size":8742220,"creator":"mcalcabr","checksum":"2d188b76621086cd384f0b9264b0a576","file_name":"Thesis_Calcabrini_pdfa.pdf","date_created":"2023-05-02T07:42:45Z","relation":"main_file"}],"publication_status":"published","year":"2023","article_processing_charge":"No","oa":1,"type":"dissertation","ec_funded":1,"page":"82","oa_version":"Published Version","_id":"12885","citation":{"apa":"Calcabrini, M. (2023). <i>Nanoparticle-based semiconductor solids: From synthesis to consolidation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12885\">https://doi.org/10.15479/at:ista:12885</a>","ama":"Calcabrini M. Nanoparticle-based semiconductor solids: From synthesis to consolidation. 2023. doi:<a href=\"https://doi.org/10.15479/at:ista:12885\">10.15479/at:ista:12885</a>","ista":"Calcabrini M. 2023. Nanoparticle-based semiconductor solids: From synthesis to consolidation. Institute of Science and Technology Austria.","ieee":"M. Calcabrini, “Nanoparticle-based semiconductor solids: From synthesis to consolidation,” Institute of Science and Technology Austria, 2023.","mla":"Calcabrini, Mariano. <i>Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/at:ista:12885\">10.15479/at:ista:12885</a>.","short":"M. Calcabrini, Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation, Institute of Science and Technology Austria, 2023.","chicago":"Calcabrini, Mariano. “Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/at:ista:12885\">https://doi.org/10.15479/at:ista:12885</a>."},"doi":"10.15479/at:ista:12885","project":[{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"department":[{"_id":"GradSch"},{"_id":"MaIb"}],"title":"Nanoparticle-based semiconductor solids: From synthesis to consolidation","date_updated":"2026-07-06T12:16:05Z","author":[{"full_name":"Calcabrini, Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","last_name":"Calcabrini","orcid":"0000-0003-4566-5877","first_name":"Mariano"}],"OA_place":"publisher","day":"28","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-028-2"]},"file_date_updated":"2023-05-02T07:43:18Z","related_material":{"record":[{"status":"public","id":"12237","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"10806","status":"public"},{"relation":"part_of_dissertation","id":"10123","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"9118"},{"status":"public","id":"10042","relation":"part_of_dissertation"}]}},{"file":[{"creator":"dernst","checksum":"9c71eb2a03aa160415f01ad95f49ceb5","file_name":"2023_CellReports_Lombardi.pdf","date_created":"2024-01-30T14:07:08Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":5599007,"file_id":"14914","success":1,"date_updated":"2024-01-30T14:07:08Z"}],"year":"2023","article_processing_charge":"Yes","publication_status":"published","date_published":"2023-10-31T00:00:00Z","article_number":"113162","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"type":"journal_article","ec_funded":1,"isi":1,"issue":"10","publication":"Cell Reports","corr_author":"1","status":"public","ddc":["570"],"month":"10","publisher":"Elsevier","date_created":"2023-10-08T22:01:15Z","abstract":[{"lang":"eng","text":"Alpha oscillations are a distinctive feature of the awake resting state of the human brain. However, their functional role in resting-state neuronal dynamics remains poorly understood. Here we show that, during resting wakefulness, alpha oscillations drive an alternation of attenuation and amplification bouts in neural activity. Our analysis indicates that inhibition is activated in pulses that last for a single alpha cycle and gradually suppress neural activity, while excitation is successively enhanced over a few alpha cycles to amplify neural activity. Furthermore, we show that long-term alpha amplitude fluctuations—the “waxing and waning” phenomenon—are an attenuation-amplification mechanism described by a power-law decay of the activity rate in the “waning” phase. Importantly, we do not observe such dynamics during non-rapid eye movement (NREM) sleep with marginal alpha oscillations. The results suggest that alpha oscillations modulate neural activity not only through pulses of inhibition (pulsed inhibition hypothesis) but also by timely enhancement of excitation (or disinhibition)."}],"has_accepted_license":"1","pmid":1,"intvolume":"        42","language":[{"iso":"eng"}],"author":[{"full_name":"Lombardi, Fabrizio","id":"A057D288-3E88-11E9-986D-0CF4E5697425","last_name":"Lombardi","orcid":"0000-0003-2623-5249","first_name":"Fabrizio"},{"first_name":"Hans J.","last_name":"Herrmann","full_name":"Herrmann, Hans J."},{"first_name":"Liborio","last_name":"Parrino","full_name":"Parrino, Liborio"},{"full_name":"Plenz, Dietmar","first_name":"Dietmar","last_name":"Plenz"},{"first_name":"Silvia","last_name":"Scarpetta","full_name":"Scarpetta, Silvia"},{"first_name":"Anna Elisabetta","last_name":"Vaudano","full_name":"Vaudano, Anna Elisabetta"},{"last_name":"De Arcangelis","first_name":"Lucilla","full_name":"De Arcangelis, Lucilla"},{"full_name":"Shriki, Oren","last_name":"Shriki","first_name":"Oren"}],"date_updated":"2026-07-06T12:48:55Z","title":"Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state","acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) (grant PT1013M03318 to F.L.). For the purpose of open access, the author has applied a CC BY public copyright license 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 754411 to F.L.) and in part by the NextGenerationEU through the grant TAlent in ReSearch@University of Padua – STARS@UNIPD (to F.L.) (project BRAINCIP [brain criticality and information processing]). L.d.A. acknowledges support from the Italian MIUR project PRIN2017WZFTZP and partial support from NEXTGENERATIONEU (NGEU) funded by the Ministry of University and Research (MUR), National Recovery and Resilience Plan (NRRP), and project MNESYS (PE0000006)—a multiscale integrated approach to the study of the nervous system in health and disease (DN. 1553 11.10.2022). O.S. acknowledges support from the Israel Science Foundation, grant 504/17. The work was supported in part by DIRP ZIAMH02797 (to D.P.).","related_material":{"record":[{"status":"public","id":"10821","relation":"earlier_version"}]},"file_date_updated":"2024-01-30T14:07:08Z","article_type":"original","publication_identifier":{"eissn":["2211-1247"]},"day":"31","external_id":{"pmid":["37777965"],"isi":["001086695500001"]},"quality_controlled":"1","oa_version":"Published Version","_id":"14402","volume":42,"department":[{"_id":"GaTk"}],"scopus_import":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"ama":"Lombardi F, Herrmann HJ, Parrino L, et al. Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state. <i>Cell Reports</i>. 2023;42(10). doi:<a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">10.1016/j.celrep.2023.113162</a>","apa":"Lombardi, F., Herrmann, H. J., Parrino, L., Plenz, D., Scarpetta, S., Vaudano, A. E., … Shriki, O. (2023). Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state. <i>Cell Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">https://doi.org/10.1016/j.celrep.2023.113162</a>","ista":"Lombardi F, Herrmann HJ, Parrino L, Plenz D, Scarpetta S, Vaudano AE, De Arcangelis L, Shriki O. 2023. Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state. Cell Reports. 42(10), 113162.","mla":"Lombardi, Fabrizio, et al. “Beyond Pulsed Inhibition: Alpha Oscillations Modulate Attenuation and Amplification of Neural Activity in the Awake Resting State.” <i>Cell Reports</i>, vol. 42, no. 10, 113162, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">10.1016/j.celrep.2023.113162</a>.","ieee":"F. Lombardi <i>et al.</i>, “Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification of neural activity in the awake resting state,” <i>Cell Reports</i>, vol. 42, no. 10. Elsevier, 2023.","short":"F. Lombardi, H.J. Herrmann, L. Parrino, D. Plenz, S. Scarpetta, A.E. Vaudano, L. De Arcangelis, O. Shriki, Cell Reports 42 (2023).","chicago":"Lombardi, Fabrizio, Hans J. Herrmann, Liborio Parrino, Dietmar Plenz, Silvia Scarpetta, Anna Elisabetta Vaudano, Lucilla De Arcangelis, and Oren Shriki. “Beyond Pulsed Inhibition: Alpha Oscillations Modulate Attenuation and Amplification of Neural Activity in the Awake Resting State.” <i>Cell Reports</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.celrep.2023.113162\">https://doi.org/10.1016/j.celrep.2023.113162</a>."},"doi":"10.1016/j.celrep.2023.113162","project":[{"grant_number":"M03318","name":"Functional Advantages of Critical Brain Dynamics","_id":"eb943429-77a9-11ec-83b8-9f471cdf5c67"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}]},{"title":"Dense 4D nanoscale reconstruction of living brain tissue","date_updated":"2026-07-06T12:49:46Z","author":[{"last_name":"Velicky","orcid":"0000-0002-2340-7431","first_name":"Philipp","full_name":"Velicky, Philipp","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87"},{"id":"3FB91342-F248-11E8-B48F-1D18A9856A87","full_name":"Miguel Villalba, Eder","first_name":"Eder","orcid":"0000-0001-5665-0430","last_name":"Miguel Villalba"},{"first_name":"Julia M","last_name":"Michalska","orcid":"0000-0003-3862-1235","full_name":"Michalska, Julia M","id":"443DB6DE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lyudchik","first_name":"Julia","id":"46E28B80-F248-11E8-B48F-1D18A9856A87","full_name":"Lyudchik, Julia"},{"full_name":"Wei, Donglai","first_name":"Donglai","last_name":"Wei"},{"full_name":"Lin, Zudi","first_name":"Zudi","last_name":"Lin"},{"full_name":"Watson, Jake","id":"63836096-4690-11EA-BD4E-32803DDC885E","first_name":"Jake","last_name":"Watson","orcid":"0000-0002-8698-3823"},{"first_name":"Jakob","last_name":"Troidl","full_name":"Troidl, Jakob"},{"first_name":"Johanna","last_name":"Beyer","full_name":"Beyer, Johanna"},{"last_name":"Ben Simon","first_name":"Yoav","full_name":"Ben Simon, Yoav","id":"43DF3136-F248-11E8-B48F-1D18A9856A87"},{"id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","full_name":"Sommer, Christoph M","orcid":"0000-0003-1216-9105","last_name":"Sommer","first_name":"Christoph M"},{"full_name":"Jahr, Wiebke","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87","last_name":"Jahr","orcid":"0000-0003-0201-2315","first_name":"Wiebke"},{"last_name":"Cenameri","first_name":"Alban","full_name":"Cenameri, Alban","id":"9ac8f577-2357-11eb-997a-e566c5550886"},{"last_name":"Broichhagen","first_name":"Johannes","full_name":"Broichhagen, Johannes"},{"full_name":"Grant, Seth G.N.","first_name":"Seth G.N.","last_name":"Grant"},{"orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M"},{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","full_name":"Novarino, Gaia","first_name":"Gaia","orcid":"0000-0002-7673-7178","last_name":"Novarino"},{"first_name":"Hanspeter","last_name":"Pfister","full_name":"Pfister, Hanspeter"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"},{"id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","full_name":"Danzl, Johann G","orcid":"0000-0001-8559-3973","last_name":"Danzl","first_name":"Johann G"}],"OA_place":"publisher","external_id":{"isi":["001025621500001"],"pmid":["37429995"]},"day":"01","file_date_updated":"2025-02-26T08:01:57Z","acknowledgement":"We thank J. Vorlaufer, N. Agudelo and A. Wartak for microscope maintenance and troubleshooting, C. Kreuzinger and A. Freeman for technical assistance, M. Šuplata for hardware control support and M. Cunha dos Santos for initial exploration of software. We\r\nthank P. Henderson for advice on deep-learning training and M. Sixt, S. Boyd and T. Weiss for discussions and critical reading of the manuscript. L. Lavis (Janelia Research Campus) generously provided the JF585-HaloTag ligand. We acknowledge expert support by IST\r\nAustria’s scientific computing, imaging and optics, preclinical, library and laboratory support facilities and by the Miba machine shop. We gratefully acknowledge funding by the following sources: Austrian Science Fund (F.W.F.) grant no. I3600-B27 (J.G.D.), grant no. DK W1232\r\n(J.G.D. and J.M.M.) and grant no. Z 312-B27, Wittgenstein award (P.J.); the Gesellschaft für Forschungsförderung NÖ grant no. LSC18-022 (J.G.D.); an ISTA Interdisciplinary project grant (J.G.D. and B.B.); the European Union’s Horizon 2020 research and innovation programme,\r\nMarie-Skłodowska Curie grant 665385 (J.M.M. and J.L.); the European Union’s Horizon 2020 research and innovation programme, European Research Council grant no. 715767, MATERIALIZABLE (B.B.); grant no. 715508, REVERSEAUTISM (G.N.); grant no. 695568, SYNNOVATE (S.G.N.G.); and grant no. 692692, GIANTSYN (P.J.); the Simons\r\nFoundation Autism Research Initiative grant no. 529085 (S.G.N.G.); the Wellcome Trust Technology Development grant no. 202932 (S.G.N.G.); the Marie Skłodowska-Curie Actions Individual Fellowship no. 101026635 under the EU Horizon 2020 program (J.F.W.);\r\nthe Human Frontier Science Program postdoctoral fellowship LT000557/2018 (W.J.); and the National Science Foundation grant no. IIS-1835231 (H.P.) and NCS-FO-2124179 (H.P.).","article_type":"original","related_material":{"record":[{"status":"public","relation":"research_data","id":"12817"},{"relation":"shorter_version","id":"14770","status":"public"},{"id":"18674","relation":"dissertation_contains","status":"public"},{"status":"public","id":"11943","relation":"earlier_version"}],"link":[{"relation":"software","url":"https://github.com/danzllab/LIONESS"}]},"publication_identifier":{"eissn":["1548-7105"],"issn":["1548-7091"]},"_id":"13267","quality_controlled":"1","oa_version":"Published Version","project":[{"grant_number":"I03600","name":"Optical control of synaptic function via adhesion molecules","_id":"265CB4D0-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2548AE96-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"W1232","name":"Molecular Drug Targets"},{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00312","name":"Synaptic communication in neuronal microcircuits"},{"grant_number":"LS18-022","name":"High content imaging to decode human immune cell interactions in health and allergic disease","_id":"23889792-32DE-11EA-91FC-C7463DDC885E"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"},{"grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"25444568-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715508","name":"Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo and in vitro Models"},{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"692692","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse"},{"call_identifier":"H2020","_id":"fc2be41b-9c52-11eb-aca3-faa90aa144e9","name":"Synaptic computations of the hippocampal CA3 circuitry","grant_number":"101026635"},{"grant_number":"LT00057","name":"High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration","_id":"2668BFA0-B435-11E9-9278-68D0E5697425"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1038/s41592-023-01936-6","citation":{"chicago":"Velicky, Philipp, Eder Miguel Villalba, Julia M Michalska, Julia Lyudchik, Donglai Wei, Zudi Lin, Jake Watson, et al. “Dense 4D Nanoscale Reconstruction of Living Brain Tissue.” <i>Nature Methods</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s41592-023-01936-6\">https://doi.org/10.1038/s41592-023-01936-6</a>.","short":"P. Velicky, E. Miguel Villalba, J.M. Michalska, J. Lyudchik, D. Wei, Z. Lin, J. Watson, J. Troidl, J. Beyer, Y. Ben Simon, C.M. Sommer, W. Jahr, A. Cenameri, J. Broichhagen, S.G.N. Grant, P.M. Jonas, G. Novarino, H. Pfister, B. Bickel, J.G. Danzl, Nature Methods 20 (2023) 1256–1265.","ieee":"P. Velicky <i>et al.</i>, “Dense 4D nanoscale reconstruction of living brain tissue,” <i>Nature Methods</i>, vol. 20. Springer Nature, pp. 1256–1265, 2023.","mla":"Velicky, Philipp, et al. “Dense 4D Nanoscale Reconstruction of Living Brain Tissue.” <i>Nature Methods</i>, vol. 20, Springer Nature, 2023, pp. 1256–65, doi:<a href=\"https://doi.org/10.1038/s41592-023-01936-6\">10.1038/s41592-023-01936-6</a>.","apa":"Velicky, P., Miguel Villalba, E., Michalska, J. M., Lyudchik, J., Wei, D., Lin, Z., … Danzl, J. G. (2023). Dense 4D nanoscale reconstruction of living brain tissue. <i>Nature Methods</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41592-023-01936-6\">https://doi.org/10.1038/s41592-023-01936-6</a>","ista":"Velicky P, Miguel Villalba E, Michalska JM, Lyudchik J, Wei D, Lin Z, Watson J, Troidl J, Beyer J, Ben Simon Y, Sommer CM, Jahr W, Cenameri A, Broichhagen J, Grant SGN, Jonas PM, Novarino G, Pfister H, Bickel B, Danzl JG. 2023. Dense 4D nanoscale reconstruction of living brain tissue. Nature Methods. 20, 1256–1265.","ama":"Velicky P, Miguel Villalba E, Michalska JM, et al. Dense 4D nanoscale reconstruction of living brain tissue. <i>Nature Methods</i>. 2023;20:1256-1265. doi:<a href=\"https://doi.org/10.1038/s41592-023-01936-6\">10.1038/s41592-023-01936-6</a>"},"scopus_import":"1","department":[{"_id":"PeJo"},{"_id":"GaNo"},{"_id":"BeBi"},{"_id":"JoDa"},{"_id":"Bio"}],"volume":20,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-08-01T00:00:00Z","publication_status":"published","article_processing_charge":"Yes (in subscription journal)","year":"2023","file":[{"date_updated":"2025-02-26T08:01:57Z","file_id":"19088","success":1,"file_size":14103039,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2025-02-26T08:01:57Z","file_name":"2023_NatureMethods_Velicky.pdf","creator":"dernst","checksum":"a68e845780a82ea36d0d4d3212a87c10"}],"isi":1,"ec_funded":1,"type":"journal_article","oa":1,"page":"1256-1265","month":"08","ddc":["570"],"status":"public","corr_author":"1","publication":"Nature Methods","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"Bio"},{"_id":"PreCl"},{"_id":"E-Lib"},{"_id":"LifeSc"},{"_id":"M-Shop"}],"language":[{"iso":"eng"}],"OA_type":"hybrid","intvolume":"        20","date_created":"2023-07-23T22:01:13Z","has_accepted_license":"1","pmid":1,"abstract":[{"lang":"eng","text":"Three-dimensional (3D) reconstruction of living brain tissue down to an individual synapse level would create opportunities for decoding the dynamics and structure–function relationships of the brain’s complex and dense information processing network; however, this has been hindered by insufficient 3D resolution, inadequate signal-to-noise ratio and prohibitive light burden in optical imaging, whereas electron microscopy is inherently static. Here we solved these challenges by developing an integrated optical/machine-learning technology, LIONESS (live information-optimized nanoscopy enabling saturated segmentation). This leverages optical modifications to stimulated emission depletion microscopy in comprehensively, extracellularly labeled tissue and previous information on sample structure via machine learning to simultaneously achieve isotropic super-resolution, high signal-to-noise ratio and compatibility with living tissue. This allows dense deep-learning-based instance segmentation and 3D reconstruction at a synapse level, incorporating molecular, activity and morphodynamic information. LIONESS opens up avenues for studying the dynamic functional (nano-)architecture of living brain tissue."}],"publisher":"Springer Nature"},{"project":[{"_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","grant_number":"P33367","name":"Structure and isoform diversity of the Arp2/3 complex"}],"citation":{"apa":"Dimchev, G. A., Amiri, B., Fäßler, F., Falcke, M., &#38; Schur, F. K. (2023). Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:14502\">https://doi.org/10.15479/AT:ISTA:14502</a>","ista":"Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. 2023. Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:14502\">10.15479/AT:ISTA:14502</a>.","ama":"Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data. 2023. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14502\">10.15479/AT:ISTA:14502</a>","ieee":"G. A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, and F. K. Schur, “Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data.” Institute of Science and Technology Austria, 2023.","mla":"Dimchev, Georgi A., et al. <i>Computational Toolbox for Ultrastructural Quantitative Analysis of Filament Networks in Cryo-ET Data</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14502\">10.15479/AT:ISTA:14502</a>.","short":"G.A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, F.K. Schur, (2023).","chicago":"Dimchev, Georgi A, Behnam Amiri, Florian Fäßler, Martin Falcke, and Florian KM Schur. “Computational Toolbox for Ultrastructural Quantitative Analysis of Filament Networks in Cryo-ET Data.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/AT:ISTA:14502\">https://doi.org/10.15479/AT:ISTA:14502</a>."},"tmp":{"short":"GNU AGPLv3  ","name":"GNU Affero General Public License v3.0","legal_code_url":"https://www.gnu.org/licenses/agpl-3.0.html"},"doi":"10.15479/AT:ISTA:14502","has_accepted_license":"1","abstract":[{"lang":"eng","text":"A precise quantitative description of the ultrastructural characteristics underlying biological mechanisms is often key to their understanding. This is particularly true for dynamic extra- and intracellular filamentous assemblies, playing a role in cell motility, cell integrity, cytokinesis, tissue formation and maintenance. For example, genetic manipulation or modulation of actin regulatory proteins frequently manifests in changes of the morphology, dynamics, and ultrastructural architecture of actin filament-rich cell peripheral structures, such as lamellipodia or filopodia. However, the observed ultrastructural effects often remain subtle and require sufficiently large datasets for appropriate quantitative analysis. The acquisition of such large datasets has been enabled by recent advances in high-throughput cryo-electron tomography (cryo-ET) methods. This also necessitates the development of complementary approaches to maximize the extraction of relevant biological information. We have developed a computational toolbox for the semi-automatic quantification of segmented and vectorized fila- mentous networks from pre-processed cryo-electron tomograms, facilitating the analysis and cross-comparison of multiple experimental conditions. GUI-based components simplify the processing of data and allow users to obtain a large number of ultrastructural parameters describing filamentous assemblies. We demonstrate the feasibility of this workflow by analyzing cryo-ET data of untreated and chemically perturbed branched actin filament networks and that of parallel actin filament arrays. In principle, the computational toolbox presented here is applicable for data analysis comprising any type of filaments in regular (i.e. parallel) or random arrangement. We show that it can ease the identification of key differences between experimental groups and facilitate the in-depth analysis of ultrastructural data in a time-efficient manner."}],"department":[{"_id":"FlSc"}],"date_created":"2023-11-08T19:40:54Z","publisher":"Institute of Science and Technology Austria","_id":"14502","status":"public","month":"11","corr_author":"1","ddc":["570"],"license":"https://choosealicense.com/licenses/agpl-3.0/","type":"software","oa":1,"related_material":{"record":[{"id":"10290","relation":"used_for_analysis_in","status":"public"}]},"file_date_updated":"2023-11-21T08:20:23Z","day":"21","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-11-21T00:00:00Z","date_updated":"2026-07-06T12:57:43Z","title":"Computational toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET data","year":"2023","keyword":["cryo-electron tomography","actin cytoskeleton","toolbox"],"file":[{"checksum":"a8b9adeb53a4109dea4d5e39fa1acccf","creator":"fschur","file_name":"Computational_Toolbox_v1.2.zip","date_created":"2023-11-08T20:23:07Z","relation":"main_file","access_level":"open_access","content_type":"application/zip","file_size":347641117,"file_id":"14503","success":1,"date_updated":"2023-11-08T20:23:07Z"},{"file_id":"14586","success":1,"date_updated":"2023-11-21T08:20:23Z","checksum":"14db2addbfca61a085ba301ed6f2900b","creator":"dernst","file_name":"Readme.txt","date_created":"2023-11-21T08:20:23Z","relation":"main_file","access_level":"open_access","content_type":"text/plain","file_size":1522}],"author":[{"last_name":"Dimchev","orcid":"0000-0001-8370-6161","first_name":"Georgi A","full_name":"Dimchev, Georgi A","id":"38C393BE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Behnam","last_name":"Amiri","full_name":"Amiri, Behnam"},{"full_name":"Fäßler, Florian","id":"404F5528-F248-11E8-B48F-1D18A9856A87","last_name":"Fäßler","orcid":"0000-0001-7149-769X","first_name":"Florian"},{"last_name":"Falcke","first_name":"Martin","full_name":"Falcke, Martin"},{"full_name":"Schur, Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","orcid":"0000-0003-4790-8078","first_name":"Florian KM"}]},{"department":[{"_id":"JiFr"}],"scopus_import":"1","volume":16,"project":[{"call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","grant_number":"742985"}],"doi":"10.1016/j.molp.2023.06.007","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"citation":{"short":"H. Chen, L. Li, M. Zou, L. Qi, J. Friml, Molecular Plant 16 (2023) 1117–1119.","chicago":"Chen, Huihuang, Lanxin Li, Minxia Zou, Linlin Qi, and Jiří Friml. “Distinct Functions of TIR1 and AFB1 Receptors in Auxin Signalling.” <i>Molecular Plant</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.molp.2023.06.007\">https://doi.org/10.1016/j.molp.2023.06.007</a>.","ama":"Chen H, Li L, Zou M, Qi L, Friml J. Distinct functions of TIR1 and AFB1 receptors in auxin signalling. <i>Molecular Plant</i>. 2023;16(7):1117-1119. doi:<a href=\"https://doi.org/10.1016/j.molp.2023.06.007\">10.1016/j.molp.2023.06.007</a>","apa":"Chen, H., Li, L., Zou, M., Qi, L., &#38; Friml, J. (2023). Distinct functions of TIR1 and AFB1 receptors in auxin signalling. <i>Molecular Plant</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.molp.2023.06.007\">https://doi.org/10.1016/j.molp.2023.06.007</a>","ista":"Chen H, Li L, Zou M, Qi L, Friml J. 2023. Distinct functions of TIR1 and AFB1 receptors in auxin signalling. Molecular Plant. 16(7), 1117–1119.","mla":"Chen, Huihuang, et al. “Distinct Functions of TIR1 and AFB1 Receptors in Auxin Signalling.” <i>Molecular Plant</i>, vol. 16, no. 7, Elsevier, 2023, pp. 1117–19, doi:<a href=\"https://doi.org/10.1016/j.molp.2023.06.007\">10.1016/j.molp.2023.06.007</a>.","ieee":"H. Chen, L. Li, M. Zou, L. Qi, and J. Friml, “Distinct functions of TIR1 and AFB1 receptors in auxin signalling.,” <i>Molecular Plant</i>, vol. 16, no. 7. Elsevier, pp. 1117–1119, 2023."},"_id":"13212","oa_version":"Published Version","quality_controlled":"1","publication_identifier":{"eissn":["1674-2052"],"issn":["1752-9867"]},"article_type":"letter_note","file_date_updated":"2024-01-29T10:37:05Z","related_material":{"record":[{"status":"public","id":"19478","relation":"dissertation_contains"}]},"acknowledgement":"We thank all the authors for sharing the published materials. This research was supported by the Lab Support Facility and the Imaging and Optics Facility of ISTA. We thank Lukáš Fiedler (ISTA) for critical reading of the manuscript. This project was funded by the European Research Council Advanced Grant (ETAP-742985).","day":"01","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","external_id":{"pmid":["37393433"],"isi":["001044410900001"]},"author":[{"full_name":"Chen, Huihuang","id":"83c96512-15b2-11ec-abd3-b7eede36184f","last_name":"Chen","first_name":"Huihuang"},{"full_name":"Li, Lanxin","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","last_name":"Li","orcid":"0000-0002-5607-272X","first_name":"Lanxin"},{"full_name":"Zou, Minxia","id":"5c243f41-03f3-11ec-841c-96faf48a7ef9","last_name":"Zou","first_name":"Minxia"},{"first_name":"Linlin","last_name":"Qi","orcid":"0000-0001-5187-8401","full_name":"Qi, Linlin","id":"44B04502-A9ED-11E9-B6FC-583AE6697425"},{"first_name":"Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří"}],"date_updated":"2026-07-06T12:58:58Z","title":"Distinct functions of TIR1 and AFB1 receptors in auxin signalling.","abstract":[{"lang":"eng","text":"Auxin is the major plant hormone regulating growth and development (Friml, 2022). Forward genetic approaches in the model plant Arabidopsis thaliana have identified major components of auxin signalling and established the canonical mechanism mediating transcriptional and thus developmental reprogramming. In this textbook view, TRANSPORT INHIBITOR RESPONSE 1 (TIR1)/AUXIN-SIGNALING F-BOX (AFBs) are auxin receptors, which act as F-box subunits determining the substrate specificity of the Skp1-Cullin1-F box protein (SCF) type E3 ubiquitin ligase complex. Auxin acts as a “molecular glue” increasing the affinity between TIR1/AFBs and the Aux/IAA repressors. Subsequently, Aux/IAAs are ubiquitinated and degraded, thus releasing auxin transcription factors from their repression making them free to mediate transcription of auxin response genes (Yu et al., 2022). Nonetheless, accumulating evidence suggests existence of rapid, non-transcriptional responses downstream of TIR1/AFBs such as auxin-induced cytosolic calcium (Ca2+) transients, plasma membrane depolarization and apoplast alkalinisation, all converging on the process of root growth inhibition and root gravitropism (Li et al., 2022). Particularly, these rapid responses are mostly contributed by predominantly cytosolic AFB1, while the long-term growth responses are mediated by mainly nuclear TIR1 and AFB2-AFB5 (Li et al., 2021; Prigge et al., 2020; Serre et al., 2021). How AFB1 conducts auxin-triggered rapid responses and how it is different from TIR1 and AFB2-AFB5 remains elusive. Here, we compare the roles of TIR1 and AFB1 in transcriptional and rapid responses by modulating their subcellular localization in Arabidopsis and by testing their ability to mediate transcriptional responses when part of the minimal auxin circuit reconstituted in yeast."}],"date_created":"2023-07-12T07:32:46Z","pmid":1,"has_accepted_license":"1","publisher":"Elsevier","language":[{"iso":"eng"}],"intvolume":"        16","issue":"7","das_tickbox":"1","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"month":"07","ddc":["580"],"status":"public","publication":"Molecular Plant","corr_author":"1","page":"1117-1119","isi":1,"type":"journal_article","ec_funded":1,"oa":1,"article_processing_charge":"Yes (via OA deal)","year":"2023","publication_status":"published","file":[{"success":1,"file_id":"14894","date_updated":"2024-01-29T10:37:05Z","checksum":"6012b7e4a2f680ee6c1f84001e2b945f","creator":"dernst","file_name":"2023_MolecularPlant_Chen.pdf","date_created":"2024-01-29T10:37:05Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":1000871}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-07-01T00:00:00Z"},{"date_updated":"2026-07-06T12:59:25Z","title":"Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen","author":[{"first_name":"Jing","last_name":"Xia","full_name":"Xia, Jing"},{"full_name":"Kong, Mengjuan","first_name":"Mengjuan","last_name":"Kong"},{"first_name":"Zhisen","last_name":"Yang","full_name":"Yang, Zhisen"},{"first_name":"Lianghanxiao","last_name":"Sun","full_name":"Sun, Lianghanxiao"},{"last_name":"Peng","first_name":"Yakun","full_name":"Peng, Yakun"},{"full_name":"Mao, Yanbo","first_name":"Yanbo","last_name":"Mao"},{"first_name":"Hong","last_name":"Wei","full_name":"Wei, Hong"},{"last_name":"Ying","first_name":"Wei","full_name":"Ying, Wei"},{"last_name":"Gao","first_name":"Yongxiao","full_name":"Gao, Yongxiao"},{"full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596"},{"full_name":"Weng, Jianping","first_name":"Jianping","last_name":"Weng"},{"full_name":"Liu, Xin","last_name":"Liu","first_name":"Xin"},{"full_name":"Sun, Linfeng","first_name":"Linfeng","last_name":"Sun"},{"full_name":"Tan, Shutang","last_name":"Tan","first_name":"Shutang"}],"external_id":{"pmid":["37254481"],"isi":["001113003000001"]},"acknowledgement":"This work was supported by the Strategic Priority Research Program of the Chinese Academy of Sciences (XDB37020103 to Linfeng Sun); research funds from the Center for Advanced Interdisciplinary Science\r\nand Biomedicine of IHM, Division of Life Sciences and Medicine, University of Science and Technology of China (QYPY20220012 to S.T.); start-up funding from the University of Science and Technology of China and the\r\nChinese Academy of Sciences (GG9100007007, KY9100000026,KY9100000051, and KJ2070000079 to S.T.); the National Natural Science Foundation of China (31900885 to X.L. and 31870732 to Linfeng Sun); the Natural Science Foundation of Anhui Province (2008085MC90 to X.L. and 2008085J15 to Linfeng Sun); the Fundamental Research Funds for the Central Universities (WK9100000021 to S.T. and WK9100000031 to Linfeng Sun); and the USTC Research Funds of the Double First-Class Initiative (YD9100002016 to S.T. and YD9100002004 to Linfeng Sun). Linfeng Sun is supported by an Outstanding Young Scholar Award from the Qiu Shi Science and Technologies Foundation and a Young Scholar Award from the Cyrus Tang Foundation.We thank Dr. Yang Zhao for sharing published materials (Center for Excellence in Molecular Plant Sciences, Chinese Academy of Sciences) and the Cryo-EM Center of the University of Science and Technology of China for the EM facility support. We are grateful to Y. Gao and all other staff members for their technical support on cryo-EM data collection. ","publication_identifier":{"eissn":["2590-3462"]},"article_type":"original","file_date_updated":"2024-01-30T10:54:40Z","day":"13","oa_version":"Published Version","quality_controlled":"1","_id":"13209","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"citation":{"ama":"Xia J, Kong M, Yang Z, et al. Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen. <i>Plant Communications</i>. 2023;4(6). doi:<a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">10.1016/j.xplc.2023.100632</a>","ista":"Xia J, Kong M, Yang Z, Sun L, Peng Y, Mao Y, Wei H, Ying W, Gao Y, Friml J, Weng J, Liu X, Sun L, Tan S. 2023. Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen. Plant Communications. 4(6), 100632.","apa":"Xia, J., Kong, M., Yang, Z., Sun, L., Peng, Y., Mao, Y., … Tan, S. (2023). Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen. <i>Plant Communications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">https://doi.org/10.1016/j.xplc.2023.100632</a>","mla":"Xia, Jing, et al. “Chemical Inhibition of Arabidopsis PIN-FORMED Auxin Transporters by the Anti-Inflammatory Drug Naproxen.” <i>Plant Communications</i>, vol. 4, no. 6, 100632, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">10.1016/j.xplc.2023.100632</a>.","ieee":"J. Xia <i>et al.</i>, “Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory drug naproxen,” <i>Plant Communications</i>, vol. 4, no. 6. Elsevier, 2023.","short":"J. Xia, M. Kong, Z. Yang, L. Sun, Y. Peng, Y. Mao, H. Wei, W. Ying, Y. Gao, J. Friml, J. Weng, X. Liu, L. Sun, S. Tan, Plant Communications 4 (2023).","chicago":"Xia, Jing, Mengjuan Kong, Zhisen Yang, Lianghanxiao Sun, Yakun Peng, Yanbo Mao, Hong Wei, et al. “Chemical Inhibition of Arabidopsis PIN-FORMED Auxin Transporters by the Anti-Inflammatory Drug Naproxen.” <i>Plant Communications</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.xplc.2023.100632\">https://doi.org/10.1016/j.xplc.2023.100632</a>."},"doi":"10.1016/j.xplc.2023.100632","volume":4,"scopus_import":"1","department":[{"_id":"JiFr"}],"date_published":"2023-11-13T00:00:00Z","article_number":"100632","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","content_type":"application/pdf","file_size":1434862,"file_name":"2023_PlantCommunications_Xia.pdf","checksum":"f8ef92af6096834f91ce38587fb1db9f","creator":"dernst","date_created":"2024-01-30T10:54:40Z","relation":"main_file","date_updated":"2024-01-30T10:54:40Z","success":1,"file_id":"14900"}],"year":"2023","article_processing_charge":"Yes","publication_status":"published","oa":1,"isi":1,"type":"journal_article","status":"public","publication":"Plant Communications","ddc":["580"],"month":"11","das_tickbox":"1","issue":"6","intvolume":"         4","language":[{"iso":"eng"}],"publisher":"Elsevier","date_created":"2023-07-12T07:32:00Z","pmid":1,"abstract":[{"text":"The phytohormone auxin plays central roles in many growth and developmental processes in plants. Development of chemical tools targeting the auxin pathway is useful for both plant biology and agriculture. Here we reveal that naproxen, a synthetic compound with anti-inflammatory activity in humans, acts as an auxin transport inhibitor targeting PIN-FORMED (PIN) transporters in plants. Physiological experiments indicate that exogenous naproxen treatment affects pleiotropic auxin-regulated developmental processes. Additional cellular and biochemical evidence indicates that naproxen suppresses auxin transport, specifically PIN-mediated auxin efflux. Moreover, biochemical and structural analyses confirm that naproxen binds directly to PIN1 protein via the same binding cavity as the indole-3-acetic acid substrate. Thus, by combining cellular, biochemical, and structural approaches, this study clearly establishes that naproxen is a PIN inhibitor and elucidates the underlying mechanisms. Further use of this compound may advance our understanding of the molecular mechanisms of PIN-mediated auxin transport and expand our toolkit in auxin biology and agriculture.","lang":"eng"}],"has_accepted_license":"1"},{"publisher":"EuroCC Austria","has_accepted_license":"1","date_created":"2023-06-23T11:03:18Z","language":[{"iso":"eng"}],"month":"07","ddc":["000"],"publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","corr_author":"1","status":"public","page":"42-42","oa":1,"type":"conference_abstract","file":[{"file_name":"2023_ASHPC_Elefante.pdf","creator":"dernst","checksum":"0ab6173cd5c5634ed773cd37ff012681","relation":"main_file","date_created":"2023-07-18T09:28:30Z","content_type":"application/pdf","access_level":"open_access","file_size":380354,"file_id":"13250","success":1,"date_updated":"2023-07-18T09:28:30Z"}],"publication_status":"published","year":"2023","article_processing_charge":"No","date_published":"2023-07-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ScienComp"}],"citation":{"chicago":"Elefante, Stefano, Stephan Stadlbauer, Michael F Alexander, and Alois Schlögl. “Cryo-EM Software Packages: A Sys-Admins Point of View.” In <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, 42–42. EuroCC Austria, 2023.","short":"S. Elefante, S. Stadlbauer, M.F. Alexander, A. Schlögl, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC Austria, 2023, pp. 42–42.","ieee":"S. Elefante, S. Stadlbauer, M. F. Alexander, and A. Schlögl, “Cryo-EM software packages: A sys-admins point of view,” in <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, Maribor, Slovenia, 2023, pp. 42–42.","mla":"Elefante, Stefano, et al. “Cryo-EM Software Packages: A Sys-Admins Point of View.” <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, EuroCC Austria, 2023, pp. 42–42.","ista":"Elefante S, Stadlbauer S, Alexander MF, Schlögl A. 2023. Cryo-EM software packages: A sys-admins point of view. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 42–42.","apa":"Elefante, S., Stadlbauer, S., Alexander, M. F., &#38; Schlögl, A. (2023). Cryo-EM software packages: A sys-admins point of view. In <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i> (pp. 42–42). Maribor, Slovenia: EuroCC Austria.","ama":"Elefante S, Stadlbauer S, Alexander MF, Schlögl A. Cryo-EM software packages: A sys-admins point of view. In: <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>. EuroCC Austria; 2023:42-42."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Submitted Version","quality_controlled":"1","_id":"13162","day":"01","file_date_updated":"2023-07-18T09:28:30Z","conference":{"start_date":"2023-06-12","location":"Maribor, Slovenia","name":"ASHPC: Austrian-Slovenian HPC Meeting","end_date":"2023-06-15"},"author":[{"id":"490F40CE-F248-11E8-B48F-1D18A9856A87","full_name":"Elefante, Stefano","last_name":"Elefante","first_name":"Stefano"},{"last_name":"Stadlbauer","first_name":"Stephan","full_name":"Stadlbauer, Stephan","id":"4D0BC184-F248-11E8-B48F-1D18A9856A87"},{"id":"3A02A8FA-F248-11E8-B48F-1D18A9856A87","full_name":"Alexander, Michael F","first_name":"Michael F","last_name":"Alexander"},{"id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","full_name":"Schlögl, Alois","first_name":"Alois","orcid":"0000-0002-5621-8100","last_name":"Schlögl"}],"title":"Cryo-EM software packages: A sys-admins point of view","date_updated":"2026-07-06T13:01:58Z"},{"date_created":"2023-06-23T11:01:23Z","has_accepted_license":"1","publisher":"EuroCC Austria","language":[{"iso":"eng"}],"publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","corr_author":"1","status":"public","month":"07","ddc":["000"],"page":"59-59","type":"conference_abstract","oa":1,"year":"2023","article_processing_charge":"No","publication_status":"published","file":[{"file_id":"13249","success":1,"date_updated":"2023-07-18T09:18:55Z","relation":"main_file","date_created":"2023-07-18T09:18:55Z","checksum":"ec8e4295d54171032cdd1b01423eb4a6","file_name":"2023_ASHPC_Schloegl.pdf","creator":"dernst","file_size":316959,"content_type":"application/pdf","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-07-01T00:00:00Z","department":[{"_id":"ScienComp"},{"_id":"EM-Fac"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"short":"A. Schlögl, S. Elefante, V.-V. Hodirnau, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC Austria, 2023, pp. 59–59.","chicago":"Schlögl, Alois, Stefano Elefante, and Victor-Valentin Hodirnau. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” In <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, 59–59. EuroCC Austria, 2023.","apa":"Schlögl, A., Elefante, S., &#38; Hodirnau, V.-V. (2023). Running Windows-applications on a Linux HPC cluster using WINE. In <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i> (pp. 59–59). Maribor, Slovenia: EuroCC Austria.","ama":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. In: <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>. EuroCC Austria; 2023:59-59.","ista":"Schlögl A, Elefante S, Hodirnau V-V. 2023. Running Windows-applications on a Linux HPC cluster using WINE. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 59–59.","ieee":"A. Schlögl, S. Elefante, and V.-V. Hodirnau, “Running Windows-applications on a Linux HPC cluster using WINE,” in <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, Maribor, Slovenia, 2023, pp. 59–59.","mla":"Schlögl, Alois, et al. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” <i>ASHPC23 - Austrian-Slovenian HPC Meeting 2023</i>, EuroCC Austria, 2023, pp. 59–59."},"_id":"13161","oa_version":"Submitted Version","quality_controlled":"1","file_date_updated":"2023-07-18T09:18:55Z","acknowledgement":"Thanks to Jesse Hansen for his suggestions on improving the abstract.","day":"01","conference":{"end_date":"2023-06-15","name":"ASHPC: Austrian-Slovenian HPC Meeting","location":"Maribor, Slovenia","start_date":"2023-06-13"},"author":[{"full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","orcid":"0000-0002-5621-8100","first_name":"Alois"},{"id":"490F40CE-F248-11E8-B48F-1D18A9856A87","full_name":"Elefante, Stefano","last_name":"Elefante","first_name":"Stefano"},{"orcid":"0000-0003-3904-947X","last_name":"Hodirnau","first_name":"Victor-Valentin","id":"3661B498-F248-11E8-B48F-1D18A9856A87","full_name":"Hodirnau, Victor-Valentin"}],"date_updated":"2026-07-06T13:01:46Z","title":"Running Windows-applications on a Linux HPC cluster using WINE"},{"date_published":"2023-06-21T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","article_processing_charge":"No","publication_status":"published","oa":1,"ec_funded":1,"isi":1,"type":"journal_article","page":"125-141","status":"public","month":"06","publication":"Mathematical Research Letters","corr_author":"1","das_tickbox":"1","issue":"1","intvolume":"        30","language":[{"iso":"eng"}],"publisher":"International Press of Boston","date_created":"2023-07-23T22:01:14Z","abstract":[{"lang":"eng","text":"We give a simple argument to prove Nagai’s conjecture for type II degenerations of compact hyperkähler manifolds and cohomology classes of middle degree. Under an additional assumption, the techniques yield the conjecture in arbitrary degree. This would complete the proof of Nagai’s conjecture in general, as it was proved already for type I degenerations by Kollár, Laza, Saccà, and Voisin [10] and independently by Soldatenkov [18], while it is immediate for type III degenerations. Our arguments are close in spirit to a recent paper by Harder [8] proving similar results for the restrictive class of good degenerations."}],"date_updated":"2026-07-06T13:37:53Z","title":"On type II degenerations of hyperkähler manifolds","author":[{"first_name":"D.","last_name":"Huybrechts","full_name":"Huybrechts, D."},{"last_name":"Mauri","first_name":"Mirko","full_name":"Mauri, Mirko","id":"2cf70c34-09c1-11ed-bd8d-c34fac206130"}],"external_id":{"isi":["001027656000006"],"arxiv":["2108.01587"]},"arxiv":1,"article_type":"original","publication_identifier":{"issn":["1073-2780"],"eissn":["1945-001X"]},"acknowledgement":"The first author is supported by the ERC Synergy Grant HyperK. The second author is supported by the Max Planck Institute for Mathematics and the Institute of Science and Technology Austria. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413.","day":"21","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2108.01587"}],"oa_version":"Preprint","quality_controlled":"1","_id":"13268","doi":"10.4310/mrl.2023.v30.n1.a6","citation":{"ieee":"D. Huybrechts and M. Mauri, “On type II degenerations of hyperkähler manifolds,” <i>Mathematical Research Letters</i>, vol. 30, no. 1. International Press of Boston, pp. 125–141, 2023.","mla":"Huybrechts, D., and Mirko Mauri. “On Type II Degenerations of Hyperkähler Manifolds.” <i>Mathematical Research Letters</i>, vol. 30, no. 1, International Press of Boston, 2023, pp. 125–41, doi:<a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">10.4310/mrl.2023.v30.n1.a6</a>.","ama":"Huybrechts D, Mauri M. On type II degenerations of hyperkähler manifolds. <i>Mathematical Research Letters</i>. 2023;30(1):125-141. doi:<a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">10.4310/mrl.2023.v30.n1.a6</a>","apa":"Huybrechts, D., &#38; Mauri, M. (2023). On type II degenerations of hyperkähler manifolds. <i>Mathematical Research Letters</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">https://doi.org/10.4310/mrl.2023.v30.n1.a6</a>","ista":"Huybrechts D, Mauri M. 2023. On type II degenerations of hyperkähler manifolds. Mathematical Research Letters. 30(1), 125–141.","chicago":"Huybrechts, D., and Mirko Mauri. “On Type II Degenerations of Hyperkähler Manifolds.” <i>Mathematical Research Letters</i>. International Press of Boston, 2023. <a href=\"https://doi.org/10.4310/mrl.2023.v30.n1.a6\">https://doi.org/10.4310/mrl.2023.v30.n1.a6</a>.","short":"D. Huybrechts, M. Mauri, Mathematical Research Letters 30 (2023) 125–141."},"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"}],"volume":30,"department":[{"_id":"TaHa"}],"scopus_import":"1"},{"main_file_link":[{"url":"https://eprint.iacr.org/2022/1389","open_access":"1"}],"quality_controlled":"1","oa_version":"Published Version","_id":"14609","volume":8,"department":[{"_id":"ElKo"}],"scopus_import":"1","citation":{"chicago":"Das, Sourav, Zhuolun Xiang, Eleftherios Kokoris Kogias, and Ling Ren. “Practical Asynchronous High-Threshold Distributed Key Generation and Distributed Polynomial Sampling.” In <i>32nd USENIX Security Symposium</i>, 8:5359–76. Usenix Association, 2023.","short":"S. Das, Z. Xiang, E. Kokoris Kogias, L. Ren, in:, 32nd USENIX Security Symposium, Usenix Association, 2023, pp. 5359–5376.","ieee":"S. Das, Z. Xiang, E. Kokoris Kogias, and L. Ren, “Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling,” in <i>32nd USENIX Security Symposium</i>, Anaheim, CA, United States, 2023, vol. 8, pp. 5359–5376.","mla":"Das, Sourav, et al. “Practical Asynchronous High-Threshold Distributed Key Generation and Distributed Polynomial Sampling.” <i>32nd USENIX Security Symposium</i>, vol. 8, Usenix Association, 2023, pp. 5359–76.","apa":"Das, S., Xiang, Z., Kokoris Kogias, E., &#38; Ren, L. (2023). Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. In <i>32nd USENIX Security Symposium</i> (Vol. 8, pp. 5359–5376). Anaheim, CA, United States: Usenix Association.","ama":"Das S, Xiang Z, Kokoris Kogias E, Ren L. Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. In: <i>32nd USENIX Security Symposium</i>. Vol 8. Usenix Association; 2023:5359-5376.","ista":"Das S, Xiang Z, Kokoris Kogias E, Ren L. 2023. Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. 32nd USENIX Security Symposium. USENIX Security Symposium vol. 8, 5359–5376."},"project":[{"_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f","grant_number":"F8512","name":"Security and Privacy by Design for Complex Systems"}],"author":[{"first_name":"Sourav","last_name":"Das","full_name":"Das, Sourav"},{"last_name":"Xiang","first_name":"Zhuolun","full_name":"Xiang, Zhuolun"},{"full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias","orcid":"0000-0002-8827-3382"},{"full_name":"Ren, Ling","first_name":"Ling","last_name":"Ren"}],"date_updated":"2026-07-07T06:02:32Z","title":"Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling","publication_identifier":{"isbn":["9781713879497"]},"acknowledgement":"The authors would like to thank Amit Agarwal, Andrew Miller, and Tom Yurek for the helpful discussions related to the paper. This work is funded in part by a VMware early career faculty grant, a Chainlink Labs Ph.D. fellowship, the National Science Foundation, and the Austrian Science Fund (FWF) F8512-N.","file_date_updated":"2023-11-28T09:14:34Z","day":"15","external_id":{"cryptoeprintid":["2022/1389"]},"conference":{"start_date":"2023-08-09","location":"Anaheim, CA, United States","name":"USENIX Security Symposium","end_date":"2023-08-11"},"cryptoeprintid":1,"publication":"32nd USENIX Security Symposium","ddc":["000"],"month":"08","status":"public","corr_author":"1","das_tickbox":"1","publisher":"Usenix Association","date_created":"2023-11-26T23:00:55Z","has_accepted_license":"1","abstract":[{"text":"Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted party. DKG is an essential building block to many decentralized protocols such as randomness beacons, threshold signatures, Byzantine consensus, and multiparty computation. While significant progress has been made recently, existing asynchronous DKG constructions are inefficient when the reconstruction threshold is larger than one-third of the total nodes. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol among n = 3t + 1 nodes that can tolerate up to t malicious nodes and support any reconstruction threshold ℓ ≥ t. Our protocol has an expected O(κn3) communication cost, where κ is the security parameter, and only assumes the hardness of the Discrete Logarithm. The\r\ncore ingredient of our ADKG protocol is an asynchronous protocol to secret share a random polynomial of degree ℓ ≥ t, which has other applications, such as asynchronous proactive secret sharing and asynchronous multiparty computation. We implement our high-threshold ADKG protocol and evaluate it using a network of up to 128 geographically distributed nodes. Our evaluation shows that our high-threshold ADKG protocol reduces the running time by 90% and bandwidth usage by 80% over the state-of-the-art.","lang":"eng"}],"intvolume":"         8","language":[{"iso":"eng"}],"file":[{"file_id":"14621","success":1,"date_updated":"2023-11-28T09:14:34Z","relation":"main_file","date_created":"2023-11-28T09:14:34Z","creator":"dernst","checksum":"1a730765930138e23c6efd2575872641","file_name":"2023_USENIX_Das.pdf","file_size":704331,"content_type":"application/pdf","access_level":"open_access"}],"article_processing_charge":"No","year":"2023","publication_status":"published","date_published":"2023-08-15T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"5359-5376","oa":1,"type":"conference"},{"external_id":{"isi":["001504402400020"]},"conference":{"start_date":"2023-10-25","name":"FMCAD: Formal Methods in Computer-Aided Design","location":"Ames, IA, United States","end_date":"2023-10-27"},"file_date_updated":"2024-01-02T08:14:23Z","publication_identifier":{"isbn":["9783854480600"]},"acknowledgement":"This work was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413 and the\r\n“VAMOS” grant ERC-2020-AdG 101020093.","day":"01","date_updated":"2026-07-07T05:58:51Z","title":"Binary decision diagrams on modern hardware","author":[{"full_name":"Pastva, Samuel","id":"07c5ea74-f61c-11ec-a664-aa7c5d957b2b","first_name":"Samuel","last_name":"Pastva","orcid":"0000-0003-1993-0331"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"mla":"Pastva, Samuel, and Thomas A. Henzinger. “Binary Decision Diagrams on Modern Hardware.” <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, TU Wien Academic Press, 2023, pp. 122–31, doi:<a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">10.34727/2023/isbn.978-3-85448-060-0_20</a>.","ieee":"S. Pastva and T. A. Henzinger, “Binary decision diagrams on modern hardware,” in <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, Ames, IA, United States, 2023, pp. 122–131.","ista":"Pastva S, Henzinger TA. 2023. Binary decision diagrams on modern hardware. Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 122–131.","ama":"Pastva S, Henzinger TA. Binary decision diagrams on modern hardware. In: <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>. TU Wien Academic Press; 2023:122-131. doi:<a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">10.34727/2023/isbn.978-3-85448-060-0_20</a>","apa":"Pastva, S., &#38; Henzinger, T. A. (2023). Binary decision diagrams on modern hardware. In <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i> (pp. 122–131). Ames, IA, United States: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20</a>","chicago":"Pastva, Samuel, and Thomas A Henzinger. “Binary Decision Diagrams on Modern Hardware.” In <i>Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design</i>, 122–31. TU Wien Academic Press, 2023. <a href=\"https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20\">https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20</a>.","short":"S. Pastva, T.A. Henzinger, in:, Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2023, pp. 122–131."},"doi":"10.34727/2023/isbn.978-3-85448-060-0_20","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"},{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"department":[{"_id":"ToHe"}],"scopus_import":"1","oa_version":"Published Version","quality_controlled":"1","_id":"14718","oa":1,"isi":1,"ec_funded":1,"type":"conference","page":"122-131","date_published":"2023-10-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2024-01-02T08:14:23Z","relation":"main_file","checksum":"818d6e13dd508f3a04f0941081022e5d","creator":"dernst","file_name":"2023_FMCAD_Pastva.pdf","file_size":524321,"access_level":"open_access","content_type":"application/pdf","file_id":"14721","success":1,"date_updated":"2024-01-02T08:14:23Z"}],"year":"2023","article_processing_charge":"No","publication_status":"published","language":[{"iso":"eng"}],"publisher":"TU Wien Academic Press","date_created":"2023-12-31T23:01:03Z","has_accepted_license":"1","abstract":[{"text":"Binary decision diagrams (BDDs) are one of the fundamental data structures in formal methods and computer science in general. However, the performance of BDD-based algorithms greatly depends on memory latency due to the reliance on large hash tables and thus, by extension, on the speed of random memory access. This hinders the full utilisation of resources available on modern CPUs, since the absolute memory latency has not improved significantly for at least a decade. In this paper, we explore several implementation techniques that improve the performance of BDD manipulation either through enhanced memory locality or by partially eliminating random memory access. On a benchmark suite of 600+ BDDs derived from real-world applications, we demonstrate runtime that is comparable or better than parallelising the same operations on eight CPU cores. ","lang":"eng"}],"status":"public","ddc":["000"],"month":"10","publication":"Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design","corr_author":"1","das_tickbox":"1"},{"author":[{"last_name":"Pauw","first_name":"Brian R.","full_name":"Pauw, Brian R."},{"full_name":"Smales, Glen J.","last_name":"Smales","first_name":"Glen J."},{"full_name":"Anker, Andy S.","last_name":"Anker","first_name":"Andy S."},{"full_name":"Annadurai, Venkatasamy","first_name":"Venkatasamy","last_name":"Annadurai"},{"last_name":"Balazs","orcid":"0000-0001-7597-043X","first_name":"Daniel","full_name":"Balazs, Daniel","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E"},{"full_name":"Bienert, Ralf","first_name":"Ralf","last_name":"Bienert"},{"full_name":"Bouwman, Wim G.","last_name":"Bouwman","first_name":"Wim G."},{"first_name":"Ingo","last_name":"Breßler","full_name":"Breßler, Ingo"},{"first_name":"Joachim","last_name":"Breternitz","full_name":"Breternitz, Joachim"},{"last_name":"Brok","first_name":"Erik S.","full_name":"Brok, Erik S."},{"last_name":"Bryant","first_name":"Gary","full_name":"Bryant, Gary"},{"last_name":"Clulow","first_name":"Andrew J.","full_name":"Clulow, Andrew J."},{"full_name":"Crater, Erin R.","first_name":"Erin R.","last_name":"Crater"},{"full_name":"De Geuser, Frédéric","first_name":"Frédéric","last_name":"De Geuser"},{"full_name":"Giudice, Alessandra Del","first_name":"Alessandra Del","last_name":"Giudice"},{"first_name":"Jérôme","last_name":"Deumer","full_name":"Deumer, Jérôme"},{"last_name":"Disch","first_name":"Sabrina","full_name":"Disch, Sabrina"},{"full_name":"Dutt, Shankar","last_name":"Dutt","first_name":"Shankar"},{"full_name":"Frank, Kilian","first_name":"Kilian","last_name":"Frank"},{"full_name":"Fratini, Emiliano","last_name":"Fratini","first_name":"Emiliano"},{"full_name":"Garcia, Paulo R.A.F.","last_name":"Garcia","first_name":"Paulo R.A.F."},{"full_name":"Gilbert, Elliot P.","last_name":"Gilbert","first_name":"Elliot P."},{"full_name":"Hahn, Marc B.","first_name":"Marc B.","last_name":"Hahn"},{"full_name":"Hallett, James","first_name":"James","last_name":"Hallett"},{"full_name":"Hohenschutz, Max","last_name":"Hohenschutz","first_name":"Max"},{"last_name":"Hollamby","first_name":"Martin","full_name":"Hollamby, Martin"},{"first_name":"Steven","last_name":"Huband","full_name":"Huband, Steven"},{"full_name":"Ilavsky, Jan","last_name":"Ilavsky","first_name":"Jan"},{"first_name":"Johanna K.","last_name":"Jochum","full_name":"Jochum, Johanna K."},{"last_name":"Juelsholt","first_name":"Mikkel","full_name":"Juelsholt, Mikkel"},{"full_name":"Mansel, Bradley W.","first_name":"Bradley W.","last_name":"Mansel"},{"first_name":"Paavo","last_name":"Penttilä","full_name":"Penttilä, Paavo"},{"full_name":"Pittkowski, Rebecca K.","last_name":"Pittkowski","first_name":"Rebecca K."},{"full_name":"Portale, Giuseppe","last_name":"Portale","first_name":"Giuseppe"},{"first_name":"Lilo D.","last_name":"Pozzo","full_name":"Pozzo, Lilo D."},{"full_name":"Rochels, Leonhard","first_name":"Leonhard","last_name":"Rochels"},{"first_name":"Julian M.","last_name":"Rosalie","full_name":"Rosalie, Julian M."},{"last_name":"Saloga","first_name":"Patrick E.J.","full_name":"Saloga, Patrick E.J."},{"first_name":"Susanne","last_name":"Seibt","full_name":"Seibt, Susanne"},{"full_name":"Smith, Andrew J.","last_name":"Smith","first_name":"Andrew J."},{"full_name":"Smith, Gregory N.","first_name":"Gregory N.","last_name":"Smith"},{"full_name":"Spiering, Glenn A.","last_name":"Spiering","first_name":"Glenn A."},{"full_name":"Stawski, Tomasz M.","last_name":"Stawski","first_name":"Tomasz M."},{"first_name":"Olivier","last_name":"Taché","full_name":"Taché, Olivier"},{"full_name":"Thünemann, Andreas F.","last_name":"Thünemann","first_name":"Andreas F."},{"full_name":"Toth, Kristof","first_name":"Kristof","last_name":"Toth"},{"last_name":"Whitten","first_name":"Andrew E.","full_name":"Whitten, Andrew E."},{"first_name":"Joachim","last_name":"Wuttke","full_name":"Wuttke, Joachim"}],"date_updated":"2026-07-07T06:18:55Z","title":"The human factor: Results of a small-angle scattering data analysis round robin","file_date_updated":"2024-01-17T07:47:35Z","article_type":"original","publication_identifier":{"eissn":["1600-5767"],"issn":["0021-8898"]},"acknowledgement":"KT acknowledges the NIST–NRC postdoctoral fellowship program for support. This work was partially funded through the European Metrology Programme for Innovation and Research (EMPIR) project No. 17NRM04.\r\nCertain commercial equipment, instruments, materials or software are identified in this article in order to specify the experimental procedure adequately. Such identification is not intended to imply recommendation or endorsement by NIST, nor is it intended to imply that the materials or equipment identified are necessarily the best available for the purpose. Open access funding enabled and organized by Projekt DEAL.","day":"01","arxiv":1,"external_id":{"isi":["001120776200002"],"arxiv":["2303.03772"]},"_id":"14799","oa_version":"Published Version","quality_controlled":"1","department":[{"_id":"LifeSc"}],"scopus_import":"1","volume":56,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1107/S1600576723008324","citation":{"ieee":"B. R. Pauw <i>et al.</i>, “The human factor: Results of a small-angle scattering data analysis round robin,” <i>Journal of Applied Crystallography</i>, vol. 56, no. 6. International Union of Crystallography, pp. 1618–1629, 2023.","mla":"Pauw, Brian R., et al. “The Human Factor: Results of a Small-Angle Scattering Data Analysis Round Robin.” <i>Journal of Applied Crystallography</i>, vol. 56, no. 6, International Union of Crystallography, 2023, pp. 1618–29, doi:<a href=\"https://doi.org/10.1107/S1600576723008324\">10.1107/S1600576723008324</a>.","ama":"Pauw BR, Smales GJ, Anker AS, et al. The human factor: Results of a small-angle scattering data analysis round robin. <i>Journal of Applied Crystallography</i>. 2023;56(6):1618-1629. doi:<a href=\"https://doi.org/10.1107/S1600576723008324\">10.1107/S1600576723008324</a>","ista":"Pauw BR, Smales GJ, Anker AS, Annadurai V, Balazs D, Bienert R, Bouwman WG, Breßler I, Breternitz J, Brok ES, Bryant G, Clulow AJ, Crater ER, De Geuser F, Giudice AD, Deumer J, Disch S, Dutt S, Frank K, Fratini E, Garcia PRAF, Gilbert EP, Hahn MB, Hallett J, Hohenschutz M, Hollamby M, Huband S, Ilavsky J, Jochum JK, Juelsholt M, Mansel BW, Penttilä P, Pittkowski RK, Portale G, Pozzo LD, Rochels L, Rosalie JM, Saloga PEJ, Seibt S, Smith AJ, Smith GN, Spiering GA, Stawski TM, Taché O, Thünemann AF, Toth K, Whitten AE, Wuttke J. 2023. The human factor: Results of a small-angle scattering data analysis round robin. Journal of Applied Crystallography. 56(6), 1618–1629.","apa":"Pauw, B. R., Smales, G. J., Anker, A. S., Annadurai, V., Balazs, D., Bienert, R., … Wuttke, J. (2023). The human factor: Results of a small-angle scattering data analysis round robin. <i>Journal of Applied Crystallography</i>. International Union of Crystallography. <a href=\"https://doi.org/10.1107/S1600576723008324\">https://doi.org/10.1107/S1600576723008324</a>","chicago":"Pauw, Brian R., Glen J. Smales, Andy S. Anker, Venkatasamy Annadurai, Daniel Balazs, Ralf Bienert, Wim G. Bouwman, et al. “The Human Factor: Results of a Small-Angle Scattering Data Analysis Round Robin.” <i>Journal of Applied Crystallography</i>. International Union of Crystallography, 2023. <a href=\"https://doi.org/10.1107/S1600576723008324\">https://doi.org/10.1107/S1600576723008324</a>.","short":"B.R. Pauw, G.J. Smales, A.S. Anker, V. Annadurai, D. Balazs, R. Bienert, W.G. Bouwman, I. Breßler, J. Breternitz, E.S. Brok, G. Bryant, A.J. Clulow, E.R. Crater, F. De Geuser, A.D. Giudice, J. Deumer, S. Disch, S. Dutt, K. Frank, E. Fratini, P.R.A.F. Garcia, E.P. Gilbert, M.B. Hahn, J. Hallett, M. Hohenschutz, M. Hollamby, S. Huband, J. Ilavsky, J.K. Jochum, M. Juelsholt, B.W. Mansel, P. Penttilä, R.K. Pittkowski, G. Portale, L.D. Pozzo, L. Rochels, J.M. Rosalie, P.E.J. Saloga, S. Seibt, A.J. Smith, G.N. Smith, G.A. Spiering, T.M. Stawski, O. Taché, A.F. Thünemann, K. Toth, A.E. Whitten, J. Wuttke, Journal of Applied Crystallography 56 (2023) 1618–1629."},"year":"2023","article_processing_charge":"Yes (via OA deal)","publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":2165864,"creator":"dernst","checksum":"dab30d4556360f2cecf99f4b7efb0ee9","file_name":"2023_JourApplCrystallography_Pauw.pdf","relation":"main_file","date_created":"2024-01-17T07:47:35Z","date_updated":"2024-01-17T07:47:35Z","file_id":"14822","success":1}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-12-01T00:00:00Z","page":"1618-1629","isi":1,"type":"journal_article","oa":1,"issue":"6","das_tickbox":"1","ddc":["540"],"month":"12","publication":"Journal of Applied Crystallography","status":"public","has_accepted_license":"1","date_created":"2024-01-14T23:00:57Z","abstract":[{"text":"A round-robin study has been carried out to estimate the impact of the human element in small-angle scattering data analysis. Four corrected datasets were provided to participants ready for analysis. All datasets were measured on samples containing spherical scatterers, with two datasets in dilute dispersions and two from powders. Most of the 46 participants correctly identified the number of populations in the dilute dispersions, with half of the population\r\nmean entries within 1.5% and half of the population width entries within 40%. Due to the added complexity of the structure factor, far fewer people submitted answers on the powder datasets. For those that did, half of the entries for the means and widths were within 44 and 86%, respectively. This round-robin experiment highlights several causes for the discrepancies, for which solutions are proposed.","lang":"eng"}],"publisher":"International Union of Crystallography","language":[{"iso":"eng"}],"intvolume":"        56"},{"issue":"5","ddc":["000"],"publication":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","month":"06","status":"public","das_tickbox":"1","publisher":"AAAI Press","date_created":"2023-08-27T22:01:18Z","abstract":[{"lang":"eng","text":"Two-player zero-sum \"graph games\" are central in logic, verification, and multi-agent systems. The game proceeds by placing a token on a vertex of a graph, and allowing the players to move it to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In \"bidding games\", however, the players have budgets and in each turn, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as full-information games. In this work we initiate the study of partial-information bidding games: we study bidding games in which a player's initial budget is drawn from a known probability distribution. We show that while for some bidding mechanisms and objectives, it is straightforward to adapt the results from the full-information setting to the partial-information setting, for others, the analysis is significantly more challenging, requires new techniques, and gives rise to interesting results. Specifically, we study games with \"mean-payoff\" objectives in combination with \"poorman\" bidding. We construct optimal strategies for a partially-informed player who plays against a fully-informed adversary. We show that, somewhat surprisingly, the \"value\" under pure strategies does not necessarily exist in such games."}],"intvolume":"        37","language":[{"iso":"eng"}],"publication_status":"published","year":"2023","article_processing_charge":"No","date_published":"2023-06-27T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"5464-5471","oa":1,"type":"conference","ec_funded":1,"quality_controlled":"1","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1609/aaai.v37i5.25679"}],"_id":"14243","volume":37,"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"scopus_import":"1","citation":{"short":"G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI Press, 2023, pp. 5464–5471.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Bidding Graph Games with Partially-Observable Budgets.” In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, 37:5464–71. AAAI Press, 2023. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>.","ama":"Avni G, Jecker IR, Zikelic D. Bidding graph games with partially-observable budgets. In: <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>. Vol 37. AAAI Press; 2023:5464-5471. doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>","ista":"Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 37, 5464–5471.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (Vol. 37, pp. 5464–5471). Washington, DC, United States: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">https://doi.org/10.1609/aaai.v37i5.25679</a>","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.","mla":"Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.” <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i>, vol. 37, no. 5, AAAI Press, 2023, pp. 5464–71, doi:<a href=\"https://doi.org/10.1609/aaai.v37i5.25679\">10.1609/aaai.v37i5.25679</a>."},"doi":"10.1609/aaai.v37i5.25679","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"author":[{"first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R"},{"first_name":"Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"title":"Bidding graph games with partially-observable budgets","date_updated":"2026-07-07T06:24:15Z","arxiv":1,"day":"27","acknowledgement":"This research was supported in part by ISF grant no.1679/21, by the ERC CoG 863818 (ForM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publication_identifier":{"isbn":["9781577358800"]},"external_id":{"arxiv":["2211.13626"]},"conference":{"start_date":"2023-02-07","location":"Washington, DC, United States","name":"AAAI: Conference on Artificial Intelligence","end_date":"2023-02-14"}},{"quality_controlled":"1","oa_version":"Published Version","_id":"15364","volume":36,"department":[{"_id":"MoHe"}],"scopus_import":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"ista":"Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. 2023. Simple, scalable and effective clustering via one-dimensional projections. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 36.","apa":"Charikar, M., Hu, L., Henzinger, M., Vötsch, M., &#38; Waingarten, E. (2023). Simple, scalable and effective clustering via one-dimensional projections. In <i>37th Conference on Neural Information Processing Systems</i> (Vol. 36). New Orleans, LA, United States: Neural Information Processing Systems Foundation.","ama":"Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. Simple, scalable and effective clustering via one-dimensional projections. In: <i>37th Conference on Neural Information Processing Systems</i>. Vol 36. Neural Information Processing Systems Foundation; 2023.","ieee":"M. Charikar, L. Hu, M. Henzinger, M. Vötsch, and E. Waingarten, “Simple, scalable and effective clustering via one-dimensional projections,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2023, vol. 36.","mla":"Charikar, Moses, et al. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” <i>37th Conference on Neural Information Processing Systems</i>, vol. 36, Neural Information Processing Systems Foundation, 2023.","short":"M. Charikar, L. Hu, M. Henzinger, M. Vötsch, E. Waingarten, in:, 37th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2023.","chicago":"Charikar, Moses, Lunjia Hu, Monika Henzinger, Maximilian Vötsch, and Erik Waingarten. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” In <i>37th Conference on Neural Information Processing Systems</i>, Vol. 36. Neural Information Processing Systems Foundation, 2023."},"project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"author":[{"last_name":"Charikar","first_name":"Moses","full_name":"Charikar, Moses"},{"full_name":"Hu, Lunjia","first_name":"Lunjia","last_name":"Hu"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"full_name":"Vötsch, Maximilian","last_name":"Vötsch","first_name":"Maximilian"},{"full_name":"Waingarten, Erik","last_name":"Waingarten","first_name":"Erik"}],"title":"Simple, scalable and effective clustering via one-dimensional projections","date_updated":"2026-07-07T06:37:54Z","arxiv":1,"day":"15","file_date_updated":"2024-05-22T07:34:00Z","publication_identifier":{"issn":["1049-5258"]},"acknowledgement":"Moses Charikar was supported by a Simons Investigator award. Lunjia Hu was supported by Moses Charikar’s and Omer Reingold’s Simons Investigators awards, Omer Reingold’s NSF Award IIS-1908774, and the Simons Foundation Collaboration on the Theory of Algorithmic Fairness. Part of this work was done while Erik Waingarten was a postdoc at Stanford University, supported by an NSF postdoctoral fellowship and by Moses Charikar’s Simons\r\nInvestigator Award. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme\r\n(Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data\r\nStructures (MoDynStruct)” and the Austrian Science Fund (FWF) project Z 422-N, project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","external_id":{"arxiv":["2310.16752"]},"conference":{"end_date":"2023-12-16","start_date":"2023-12-10","location":"New Orleans, LA, United States","name":"NeurIPS: Neural Information Processing Systems"},"ddc":["000"],"status":"public","publication":"37th Conference on Neural Information Processing Systems","month":"12","das_tickbox":"1","publisher":"Neural Information Processing Systems Foundation","abstract":[{"text":"Clustering is a fundamental problem in unsupervised machine learning with many applications in data analysis. Popular clustering algorithms such as Lloyd's algorithm and k-means++ can make Ω(ndk) time when clustering n points in a d-dimensional space (represented by an n×d matrix X) into k clusters. On massive datasets with moderate to large k, the multiplicative \r\nk factor can become very expensive. We introduce a simple randomized clustering algorithm that provably runs in expected time O(nnz(X)+nlogn) for arbitrary k. Here nnz(X) is the total number of non-zero entries in the input dataset X, which is upper bounded by nd and can be significantly smaller for sparse datasets. We prove that our algorithm achieves approximation ratio ˜O(k4) on any input dataset for the k-means objective, and our experiments show that the quality of the clusters found by our algorithm is usually much better than this worst-case bound. We use our algorithm for k-means clustering and for coreset construction; our experiments show that it gives a new tradeoff between running time and cluster quality compared to previous state-of-the-art methods for these tasks. Our theoretical analysis is based on novel results of independent interest. We show that the approximation ratio achieved after a random one-dimensional projection can be lifted to the original points and that k-means++ seeding can be implemented in expected time O(nlogn) in one dimension.","lang":"eng"}],"has_accepted_license":"1","date_created":"2024-05-05T22:01:05Z","alternative_title":["Advances in Neural Information Processing Systems"],"intvolume":"        36","language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"15416","date_updated":"2024-05-22T07:34:00Z","checksum":"d169a147a2adf55878e0a99e36a9d468","file_name":"2023_Neurips_Charikar.pdf","creator":"dernst","relation":"main_file","date_created":"2024-05-22T07:34:00Z","content_type":"application/pdf","access_level":"open_access","file_size":1445159}],"publication_status":"published","year":"2023","article_processing_charge":"Yes","date_published":"2023-12-15T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"type":"conference","ec_funded":1},{"_id":"15363","oa_version":"Published Version","quality_controlled":"1","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"short":"M. Safaryan, A. Krumes, D.-A. Alistarh, in:, 36th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2023.","chicago":"Safaryan, Mher, Alexandra Krumes, and Dan-Adrian Alistarh. “Knowledge Distillation Performs Partial Variance Reduction.” In <i>36th Conference on Neural Information Processing Systems</i>, Vol. 36. Neural Information Processing Systems Foundation, 2023.","ama":"Safaryan M, Krumes A, Alistarh D-A. Knowledge distillation performs partial variance reduction. In: <i>36th Conference on Neural Information Processing Systems</i>. Vol 36. Neural Information Processing Systems Foundation; 2023.","apa":"Safaryan, M., Krumes, A., &#38; Alistarh, D.-A. (2023). Knowledge distillation performs partial variance reduction. In <i>36th Conference on Neural Information Processing Systems</i> (Vol. 36). New Orleans, LA, United States: Neural Information Processing Systems Foundation.","ista":"Safaryan M, Krumes A, Alistarh D-A. 2023. Knowledge distillation performs partial variance reduction. 36th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 36.","mla":"Safaryan, Mher, et al. “Knowledge Distillation Performs Partial Variance Reduction.” <i>36th Conference on Neural Information Processing Systems</i>, vol. 36, Neural Information Processing Systems Foundation, 2023.","ieee":"M. Safaryan, A. Krumes, and D.-A. Alistarh, “Knowledge distillation performs partial variance reduction,” in <i>36th Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2023, vol. 36."},"scopus_import":"1","department":[{"_id":"DaAl"}],"volume":36,"date_updated":"2026-07-07T06:37:28Z","title":"Knowledge distillation performs partial variance reduction","author":[{"last_name":"Safaryan","first_name":"Mher","id":"dd546b39-0804-11ed-9c55-ef075c39778d","full_name":"Safaryan, Mher"},{"first_name":"Elena-Alexandra","last_name":"Peste","id":"32D78294-F248-11E8-B48F-1D18A9856A87","full_name":"Peste, Elena-Alexandra"},{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"conference":{"location":"New Orleans, LA, United States","name":"NeurIPS: Neural Information Processing Systems","start_date":"2023-12-10","end_date":"2023-12-16"},"external_id":{"arxiv":["2305.17581"]},"publication_identifier":{"issn":["1049-5258"]},"file_date_updated":"2024-05-22T08:08:08Z","acknowledgement":"MS has received funding from the European Union’s Horizon 2020 research and innovation programme\r\nunder the Marie Skłodowska-Curie grant agreement No 101034413.","day":"15","arxiv":1,"das_tickbox":"1","month":"12","ddc":["000"],"publication":"36th Conference on Neural Information Processing Systems","status":"public","corr_author":"1","language":[{"iso":"eng"}],"intvolume":"        36","alternative_title":["Advances in Neural Information Processing Systems"],"has_accepted_license":"1","abstract":[{"lang":"eng","text":"Knowledge distillation is a popular approach for enhancing the performance of \"student\" models, with lower representational capacity, by taking advantage of more powerful \"teacher\" models. Despite its apparent simplicity, the underlying mechanics behind knowledge distillation (KD) are not yet fully understood. In this work, we shed new light on the inner workings of this method, by examining it from an optimization perspective. Specifically, we show that, in the context of linear and deep linear models, KD can be interpreted as a novel type of stochastic variance reduction mechanism. We provide a detailed convergence analysis of the resulting dynamics, which hold under standard assumptions for both strongly-convex and non-convex losses, showing that KD acts as a form of \\emph{partial variance reduction}, which can reduce the stochastic gradient noise, but may not eliminate it completely, depending on the properties of the teacher'' model. Our analysis puts further emphasis on the need for careful parametrization of KD, in particular w.r.t. the weighting of the distillation loss, and is validated empirically on both linear models and deep neural networks."}],"date_created":"2024-05-05T22:01:04Z","publisher":"Neural Information Processing Systems Foundation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-12-15T00:00:00Z","year":"2023","article_processing_charge":"Yes","publication_status":"published","file":[{"file_size":672571,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2024-05-22T08:08:08Z","checksum":"288c5148a85abf24ad5e22a6b1183655","creator":"dernst","file_name":"2023_Neurips_Safaryan.pdf","date_updated":"2024-05-22T08:08:08Z","file_id":"15417","success":1}],"type":"conference","ec_funded":1,"oa":1},{"oa":1,"ec_funded":1,"type":"conference","file":[{"date_updated":"2024-07-22T11:45:17Z","success":1,"file_id":"17309","access_level":"open_access","content_type":"application/pdf","file_size":562008,"creator":"dernst","file_name":"2023_NeurIPS_Zikelic.pdf","checksum":"739c6d72506b778302d4e708723bf12c","date_created":"2024-07-22T11:45:17Z","relation":"main_file"}],"year":"2023","article_processing_charge":"No","publication_status":"published","date_published":"2023-12-15T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Neural Information Processing Systems Foundation","alternative_title":["Advances in Neural Information Processing Systems"],"abstract":[{"text":"Reinforcement learning has shown promising results in learning neural network policies for complicated control tasks. However, the lack of formal guarantees about the behavior of such policies remains an impediment to their deployment. We propose a novel method for learning a composition of neural network policies in stochastic environments, along with a formal certificate which guarantees that a specification over the policy's behavior is satisfied with the desired probability. Unlike prior work on verifiable RL, our approach leverages the compositional nature of logical specifications provided in SpectRL, to learn over graphs of probabilistic reach-avoid specifications. The formal guarantees are provided by learning neural network policies together with reach-avoid supermartingales (RASM) for the graph’s sub-tasks and then composing them into a global policy. We also derive a tighter lower bound compared to previous work on the probability of reach-avoidance implied by a RASM, which is required to find a compositional policy with an acceptable probabilistic threshold for complex tasks with multiple edge policies. We implement a prototype of our approach and evaluate it on a Stochastic Nine Rooms environment.","lang":"eng"}],"date_created":"2024-02-25T09:23:24Z","has_accepted_license":"1","language":[{"iso":"eng"}],"corr_author":"1","status":"public","ddc":["000"],"publication":"37th Conference on Neural Information Processing Systems","month":"12","das_tickbox":"1","arxiv":1,"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","publication_identifier":{"eissn":["1049-5258"]},"file_date_updated":"2024-07-22T11:45:17Z","day":"15","external_id":{"arxiv":["2312.01456"]},"conference":{"end_date":"2023-12-16","name":"NeurIPS: Neural Information Processing Systems","location":"New Orleans, LO, United States","start_date":"2023-12-10"},"author":[{"first_name":"Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Abhinav","last_name":"Verma","full_name":"Verma, Abhinav","id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"date_updated":"2026-07-07T06:36:54Z","title":"Compositional policy learning in stochastic control systems with formal guarantees","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"citation":{"mla":"Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” <i>37th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2023.","ieee":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LO, United States, 2023.","ista":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional policy learning in stochastic control systems with formal guarantees. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, .","apa":"Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &#38; Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In <i>37th Conference on Neural Information Processing Systems</i>. New Orleans, LO, United States: Neural Information Processing Systems Foundation.","ama":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. Compositional policy learning in stochastic control systems with formal guarantees. In: <i>37th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2023.","chicago":"Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In <i>37th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2023.","short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2023."},"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"oa_version":"Published Version","quality_controlled":"1","_id":"15023"},{"date_updated":"2026-07-07T06:35:57Z","title":"Deep neural collapse is provably optimal for the deep unconstrained features model","author":[{"last_name":"Súkeník","first_name":"Peter","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","full_name":"Súkeník, Peter"},{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph"}],"conference":{"start_date":"2023-12-10","name":"NeurIPS: Neural Information Processing Systems","location":"New Orleans, LA, United States","end_date":"2023-12-16"},"external_id":{"arxiv":["2305.13165"]},"acknowledgement":"M. M. is partially supported by the 2019 Lopez-Loreta Prize. The authors would like to thank Eugenia Iofinova, Bernd Prach and Simone Bombari for valuable feedback on the manuscript.","publication_identifier":{"eissn":["1049-5258"]},"day":"15","arxiv":1,"_id":"14921","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2305.13165","open_access":"1"}],"oa_version":"Preprint","quality_controlled":"1","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"citation":{"ama":"Súkeník P, Mondelli M, Lampert C. Deep neural collapse is provably optimal for the deep unconstrained features model. In: <i>37th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2023.","apa":"Súkeník, P., Mondelli, M., &#38; Lampert, C. (2023). Deep neural collapse is provably optimal for the deep unconstrained features model. In <i>37th Conference on Neural Information Processing Systems</i>. New Orleans, LA, United States: Neural Information Processing Systems Foundation.","ista":"Súkeník P, Mondelli M, Lampert C. 2023. Deep neural collapse is provably optimal for the deep unconstrained features model. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, .","mla":"Súkeník, Peter, et al. “Deep Neural Collapse Is Provably Optimal for the Deep Unconstrained Features Model.” <i>37th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2023.","ieee":"P. Súkeník, M. Mondelli, and C. Lampert, “Deep neural collapse is provably optimal for the deep unconstrained features model,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LA, United States, 2023.","short":"P. Súkeník, M. Mondelli, C. Lampert, in:, 37th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2023.","chicago":"Súkeník, Peter, Marco Mondelli, and Christoph Lampert. “Deep Neural Collapse Is Provably Optimal for the Deep Unconstrained Features Model.” In <i>37th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2023."},"department":[{"_id":"MaMo"},{"_id":"ChLa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-12-15T00:00:00Z","year":"2023","article_processing_charge":"No","publication_status":"published","type":"conference","oa":1,"das_tickbox":"1","publication":"37th Conference on Neural Information Processing Systems","month":"12","corr_author":"1","status":"public","language":[{"iso":"eng"}],"alternative_title":["Advances in Neural Information Processing Systems"],"abstract":[{"text":"Neural collapse (NC) refers to the surprising structure of the last layer of deep neural networks in the terminal phase of gradient descent training. Recently, an increasing amount of experimental evidence has pointed to the propagation of NC to earlier layers of neural networks. However, while the NC in the last layer is well studied theoretically, much less is known about its multi-layered counterpart - deep neural collapse (DNC). In particular, existing work focuses either on linear layers or only on the last two layers at the price of an extra assumption. Our paper fills this gap by generalizing the established analytical framework for NC - the unconstrained features model - to multiple non-linear layers. Our key technical contribution is to show that, in a deep unconstrained features model, the unique global optimum for binary classification exhibits all the properties typical of DNC. This explains the existing experimental evidence of DNC. We also empirically show that (i) by optimizing deep unconstrained features models via gradient descent, the resulting solution agrees well with our theory, and (ii) trained networks recover the unconstrained features suitable for the occurrence of DNC, thus supporting the validity of this modeling principle.","lang":"eng"}],"date_created":"2024-02-02T11:17:41Z","publisher":"Neural Information Processing Systems Foundation"},{"_id":"14260","oa_version":"Published Version","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"ama":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. In: <i>35th International Conference on Computer Aided Verification</i>. Vol 13964. Springer Nature; 2023:156-169. doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">10.1007/978-3-031-37706-8_8</a>","ista":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck: A practical framework for testing concurrent data structures on JVM. 35th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13964, 156–169.","apa":"Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., &#38; Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. In <i>35th International Conference on Computer Aided Verification</i> (Vol. 13964, pp. 156–169). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">https://doi.org/10.1007/978-3-031-37706-8_8</a>","mla":"Koval, Nikita, et al. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” <i>35th International Conference on Computer Aided Verification</i>, vol. 13964, Springer Nature, 2023, pp. 156–69, doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">10.1007/978-3-031-37706-8_8</a>.","ieee":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck: A practical framework for testing concurrent data structures on JVM,” in <i>35th International Conference on Computer Aided Verification</i>, Paris, France, 2023, vol. 13964, pp. 156–169.","short":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, in:, 35th International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 156–169.","chicago":"Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” In <i>35th International Conference on Computer Aided Verification</i>, 13964:156–69. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">https://doi.org/10.1007/978-3-031-37706-8_8</a>."},"doi":"10.1007/978-3-031-37706-8_8","scopus_import":"1","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"volume":13964,"date_updated":"2026-07-07T13:39:36Z","title":"Lincheck: A practical framework for testing concurrent data structures on JVM","author":[{"id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","full_name":"Koval, Nikita","last_name":"Koval","first_name":"Nikita"},{"id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","full_name":"Fedorov, Alexander","first_name":"Alexander","last_name":"Fedorov"},{"full_name":"Sokolova, Maria","first_name":"Maria","last_name":"Sokolova"},{"full_name":"Tsitelov, Dmitry","first_name":"Dmitry","last_name":"Tsitelov"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian"}],"conference":{"end_date":"2023-07-22","name":"CAV: Computer Aided Verification","location":"Paris, France","start_date":"2023-07-17"},"external_id":{"isi":["001310786500008"]},"related_material":{"record":[{"relation":"research_data","id":"14995","status":"public"}]},"publication_identifier":{"isbn":["9783031377051"],"issn":["0302-9743"],"eissn":["1611-3349"]},"file_date_updated":"2023-09-06T08:16:25Z","day":"17","das_tickbox":"1","status":"public","publication":"35th International Conference on Computer Aided Verification","month":"07","ddc":["000"],"language":[{"iso":"eng"}],"intvolume":"     13964","alternative_title":["LNCS"],"abstract":[{"text":"This paper presents Lincheck, a new practical and user-friendly framework for testing concurrent algorithms on the Java Virtual Machine (JVM). Lincheck provides a simple and declarative way to write concurrent tests: instead of describing how to perform the test, users specify what to test by declaring all the operations to examine; the framework automatically handles the rest. As a result, tests written with Lincheck are concise and easy to understand. The framework automatically generates a set of concurrent scenarios, examines them using stress-testing or bounded model checking, and verifies that the results of each invocation are correct. Notably, if an error is detected via model checking, Lincheck provides an easy-to-follow trace to reproduce it, significantly simplifying the bug investigation.\r\n\r\nTo the best of our knowledge, Lincheck is the first production-ready tool on the JVM that offers such a simple way of writing concurrent tests, without requiring special skills or expertise. We successfully integrated Lincheck in the development process of several large projects, such as Kotlin Coroutines, and identified new bugs in popular concurrency libraries, such as a race in Java’s standard ConcurrentLinkedDeque and a liveliness bug in Java’s AbstractQueuedSynchronizer framework, which is used in most of the synchronization primitives. We believe that Lincheck can significantly improve the quality and productivity of concurrent algorithms research and development and become the state-of-the-art tool for checking their correctness.","lang":"eng"}],"date_created":"2023-09-03T22:01:16Z","has_accepted_license":"1","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-07-17T00:00:00Z","year":"2023","article_processing_charge":"Yes (in subscription journal)","publication_status":"published","file":[{"file_name":"2023_LNCS_Koval.pdf","creator":"dernst","checksum":"c346016393123a0a2338ad4d976f61bc","relation":"main_file","date_created":"2023-09-06T08:16:25Z","content_type":"application/pdf","access_level":"open_access","file_size":421408,"file_id":"14275","success":1,"date_updated":"2023-09-06T08:16:25Z"}],"type":"conference","isi":1,"oa":1,"page":"156-169"}]