[{"file_date_updated":"2020-07-30T13:04:55Z","oa":1,"date_updated":"2026-07-06T12:43:42Z","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"publisher":"Institute of Science and Technology Austria","date_published":"2020-07-24T00:00:00Z","language":[{"iso":"eng"}],"month":"07","acknowledgement":"For the duration of his PhD, Rok was a recipient of a DOC fellowship of the Austrian Academy of Sciences.","type":"dissertation","oa_version":"Published Version","_id":"8155","project":[{"name":"Biophysically realistic genotype-phenotype maps for regulatory networks","_id":"267C84F4-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Grah, Rok. Gene Regulation across Scales – How Biophysical Constraints Shape Evolution. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8155.","apa":"Grah, R. (2020). Gene regulation across scales – how biophysical constraints shape evolution. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8155","chicago":"Grah, Rok. “Gene Regulation across Scales – How Biophysical Constraints Shape Evolution.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8155.","ama":"Grah R. Gene regulation across scales – how biophysical constraints shape evolution. 2020. doi:10.15479/AT:ISTA:8155","ista":"Grah R. 2020. Gene regulation across scales – how biophysical constraints shape evolution. Institute of Science and Technology Austria.","ieee":"R. Grah, “Gene regulation across scales – how biophysical constraints shape evolution,” Institute of Science and Technology Austria, 2020.","short":"R. Grah, Gene Regulation across Scales – How Biophysical Constraints Shape Evolution, Institute of Science and Technology Austria, 2020."},"status":"public","day":"24","alternative_title":["ISTA Thesis"],"publication_status":"published","abstract":[{"text":"In the thesis we focus on the interplay of the biophysics and evolution of gene regulation. We start by addressing how the type of prokaryotic gene regulation – activation and repression – affects spurious binding to DNA, also known as\r\ntranscriptional crosstalk. We propose that regulatory interference caused by excess regulatory proteins in the dense cellular medium – global crosstalk – could be a factor in determining which type of gene regulatory network is evolutionarily preferred. Next,we use a normative approach in eukaryotic gene regulation to describe minimal\r\nnon-equilibrium enhancer models that optimize so-called regulatory phenotypes. We find a class of models that differ from standard thermodynamic equilibrium models by a single parameter that notably increases the regulatory performance. Next chapter addresses the question of genotype-phenotype-fitness maps of higher dimensional phenotypes. We show that our biophysically realistic approach allows us to understand how the mechanisms of promoter function constrain genotypephenotype maps, and how they affect the evolutionary trajectories of promoters.\r\nIn the last chapter we ask whether the intrinsic instability of gene duplication and amplification provides a generic alternative to canonical gene regulation. Using mathematical modeling, we show that amplifications can tune gene expression in many environments, including those where transcription factor-based schemes are\r\nhard to evolve or maintain. ","lang":"eng"}],"article_processing_charge":"No","page":"310","supervisor":[{"full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","last_name":"Guet","first_name":"Calin C"},{"full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper","last_name":"Tkačik"}],"title":"Gene regulation across scales – how biophysical constraints shape evolution","degree_awarded":"PhD","OA_place":"publisher","author":[{"full_name":"Grah, Rok","orcid":"0000-0003-2539-3560","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","last_name":"Grah","first_name":"Rok"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"status":"public","id":"7569","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"7652","status":"public"},{"id":"7675","relation":"part_of_dissertation","status":"public"}]},"file":[{"file_id":"8176","file_size":16638998,"date_updated":"2020-07-27T12:00:07Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"Thesis_RokGrah_200727_convertedNew.pdf","date_created":"2020-07-27T12:00:07Z","success":1,"creator":"rgrah"},{"file_size":347459978,"date_updated":"2020-07-30T13:04:55Z","relation":"main_file","access_level":"closed","file_id":"8177","creator":"rgrah","content_type":"application/zip","file_name":"Thesis_new.zip","date_created":"2020-07-27T12:02:23Z"}],"corr_author":"1","ddc":["530","570"],"has_accepted_license":"1","date_created":"2020-07-23T09:51:28Z","year":"2020","doi":"10.15479/AT:ISTA:8155","publication_identifier":{"issn":["2663-337X"]}},{"article_processing_charge":"No","publication_status":"published","external_id":{"biorxivid":["10.1101/2020.04.08.029405"]},"oa":1,"abstract":[{"text":"In prokaryotes, thermodynamic models of gene regulation provide a highly quantitative mapping from promoter sequences to gene expression levels that is compatible with in vivo and in vitro bio-physical measurements. Such concordance has not been achieved for models of enhancer function in eukaryotes. In equilibrium models, it is difficult to reconcile the reported short transcription factor (TF) residence times on the DNA with the high specificity of regulation. In non-equilibrium models, progress is difficult due to an explosion in the number of parameters. Here, we navigate this complexity by looking for minimal non-equilibrium enhancer models that yield desired regulatory phenotypes: low TF residence time, high specificity and tunable cooperativity. We find that a single extra parameter, interpretable as the “linking rate” by which bound TFs interact with Mediator components, enables our models to escape equilibrium bounds and access optimal regulatory phenotypes, while remaining consistent with the reported phenomenology and simple enough to be inferred from upcoming experiments. We further find that high specificity in non-equilibrium models is in a tradeoff with gene expression noise, predicting bursty dynamics — an experimentally-observed hallmark of eukaryotic transcription. By drastically reducing the vast parameter space to a much smaller subspace that optimally realizes biological function prior to inference from data, our normative approach holds promise for mathematical models in systems biology.","lang":"eng"}],"date_published":"2020-04-09T00:00:00Z","language":[{"iso":"eng"}],"title":"Normative models of enhancer function","month":"04","date_updated":"2026-07-06T12:43:43Z","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"author":[{"orcid":"0000-0003-2539-3560","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","full_name":"Grah, Rok","first_name":"Rok","last_name":"Grah"},{"first_name":"Benjamin","last_name":"Zoller","full_name":"Zoller, Benjamin"},{"last_name":"Tkačik","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"preprint","biorxivid":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"8155","status":"public"}]},"_id":"7675","citation":{"short":"R. Grah, B. Zoller, G. Tkačik, BioRxiv (2020).","ieee":"R. Grah, B. Zoller, and G. Tkačik, “Normative models of enhancer function,” bioRxiv. 2020.","ista":"Grah R, Zoller B, Tkačik G. 2020. Normative models of enhancer function. bioRxiv, 10.1101/2020.04.08.029405.","ama":"Grah R, Zoller B, Tkačik G. Normative models of enhancer function. bioRxiv. 2020. doi:10.1101/2020.04.08.029405","chicago":"Grah, Rok, Benjamin Zoller, and Gašper Tkačik. “Normative Models of Enhancer Function.” BioRxiv, 2020. https://doi.org/10.1101/2020.04.08.029405.","apa":"Grah, R., Zoller, B., & Tkačik, G. (2020). Normative models of enhancer function. bioRxiv. https://doi.org/10.1101/2020.04.08.029405","mla":"Grah, Rok, et al. “Normative Models of Enhancer Function.” BioRxiv, 2020, doi:10.1101/2020.04.08.029405."},"corr_author":"1","project":[{"grant_number":"RGP0034/2018","_id":"2665AAFE-B435-11E9-9278-68D0E5697425","name":"Can evolution minimize spurious signaling crosstalk to reach optimal performance?"},{"name":"Biophysically realistic genotype-phenotype maps for regulatory networks","_id":"267C84F4-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://doi.org/10.1101/2020.04.08.029405 ","open_access":"1"}],"date_created":"2020-04-23T10:12:51Z","year":"2020","doi":"10.1101/2020.04.08.029405","das_tickbox":"1","status":"public","publication":"bioRxiv","day":"09"},{"das_tickbox":"1","day":"05","status":"public","publication":"bioRxiv","doi":"10.1101/2020.11.03.366948","date_created":"2020-11-26T07:17:19Z","year":"2020","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.11.03.366948"}],"citation":{"chicago":"Santini, Laura, Florian Halbritter, Fabian Titz-Teixeira, Toru Suzuki, Maki Asami, Julia Ramesmayer, Xiaoyan Ma, et al. “Novel Imprints in Mouse Blastocysts Are Predominantly DNA Methylation Independent.” BioRxiv, n.d. https://doi.org/10.1101/2020.11.03.366948.","apa":"Santini, L., Halbritter, F., Titz-Teixeira, F., Suzuki, T., Asami, M., Ramesmayer, J., … Leeb, M. (n.d.). Novel imprints in mouse blastocysts are predominantly DNA methylation independent. bioRxiv. https://doi.org/10.1101/2020.11.03.366948","mla":"Santini, Laura, et al. “Novel Imprints in Mouse Blastocysts Are Predominantly DNA Methylation Independent.” BioRxiv, doi:10.1101/2020.11.03.366948.","short":"L. Santini, F. Halbritter, F. Titz-Teixeira, T. Suzuki, M. Asami, J. Ramesmayer, X. Ma, A. Lackner, N. Warr, F. Pauler, S. Hippenmeyer, E. Laue, M. Farlik, C. Bock, A. Beyer, A.C.F. Perry, M. Leeb, BioRxiv (n.d.).","ieee":"L. Santini et al., “Novel imprints in mouse blastocysts are predominantly DNA methylation independent,” bioRxiv. .","ama":"Santini L, Halbritter F, Titz-Teixeira F, et al. Novel imprints in mouse blastocysts are predominantly DNA methylation independent. bioRxiv. doi:10.1101/2020.11.03.366948","ista":"Santini L, Halbritter F, Titz-Teixeira F, Suzuki T, Asami M, Ramesmayer J, Ma X, Lackner A, Warr N, Pauler F, Hippenmeyer S, Laue E, Farlik M, Bock C, Beyer A, Perry ACF, Leeb M. Novel imprints in mouse blastocysts are predominantly DNA methylation independent. bioRxiv, 10.1101/2020.11.03.366948."},"pmid":1,"_id":"8813","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Santini, Laura","last_name":"Santini","first_name":"Laura"},{"first_name":"Florian","last_name":"Halbritter","full_name":"Halbritter, Florian"},{"full_name":"Titz-Teixeira, Fabian","first_name":"Fabian","last_name":"Titz-Teixeira"},{"full_name":"Suzuki, Toru","first_name":"Toru","last_name":"Suzuki"},{"first_name":"Maki","last_name":"Asami","full_name":"Asami, Maki"},{"full_name":"Ramesmayer, Julia","first_name":"Julia","last_name":"Ramesmayer"},{"full_name":"Ma, Xiaoyan","first_name":"Xiaoyan","last_name":"Ma"},{"first_name":"Andreas","last_name":"Lackner","full_name":"Lackner, Andreas"},{"full_name":"Warr, Nick","last_name":"Warr","first_name":"Nick"},{"first_name":"Florian","last_name":"Pauler","orcid":"0000-0002-7462-0048","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","full_name":"Pauler, Florian"},{"last_name":"Hippenmeyer","first_name":"Simon","full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061"},{"last_name":"Laue","first_name":"Ernest","full_name":"Laue, Ernest"},{"last_name":"Farlik","first_name":"Matthias","full_name":"Farlik, Matthias"},{"first_name":"Christoph","last_name":"Bock","full_name":"Bock, Christoph"},{"full_name":"Beyer, Andreas","first_name":"Andreas","last_name":"Beyer"},{"last_name":"Perry","first_name":"Anthony C. F.","full_name":"Perry, Anthony C. F."},{"last_name":"Leeb","first_name":"Martin","full_name":"Leeb, Martin"}],"oa_version":"Preprint","date_updated":"2026-07-06T12:45:07Z","department":[{"_id":"SiHi"}],"date_published":"2020-11-05T00:00:00Z","month":"11","language":[{"iso":"eng"}],"title":"Novel imprints in mouse blastocysts are predominantly DNA methylation independent","external_id":{"pmid":["PPR234457 "]},"publication_status":"submitted","abstract":[{"lang":"eng","text":"In mammals, chromatin marks at imprinted genes are asymmetrically inherited to control parentally-biased gene expression. This control is thought predominantly to involve parent-specific differentially methylated regions (DMR) in genomic DNA. However, neither parent-of-origin-specific transcription nor DMRs have been comprehensively mapped. We here address this by integrating transcriptomic and epigenomic approaches in mouse preimplantation embryos (blastocysts). Transcriptome-analysis identified 71 genes expressed with previously unknown parent-of-origin-specific expression in blastocysts (nBiX: novel blastocyst-imprinted expression). Uniparental expression of nBiX genes disappeared soon after implantation. Micro-whole-genome bisulfite sequencing (μWGBS) of individual uniparental blastocysts detected 859 DMRs. Only 18% of nBiXs were associated with a DMR, whereas 60% were associated with parentally-biased H3K27me3. This suggests a major role for Polycomb-mediated imprinting in blastocysts. Five nBiX-clusters contained at least one known imprinted gene, and five novel clusters contained exclusively nBiX-genes. These data suggest a complex program of stage-specific imprinting involving different tiers of regulation."}],"oa":1,"article_processing_charge":"No"},{"date_created":"2020-03-21T16:34:42Z","year":"2020","das_tickbox":"1","day":"19","publication":"bioRxiv","status":"public","doi":"10.1101/791137","citation":{"mla":"Wei, Zhuang, et al. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv, 2020, doi:10.1101/791137.","apa":"Wei, Z., Tan, S., Liu, T., Wu, Y., Lei, J.-G., Chen, Z., … Liao, K. (2020). Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. https://doi.org/10.1101/791137","chicago":"Wei, Zhuang, Shutang Tan, Tao Liu, Yuan Wu, Ji-Gang Lei, ZhengJun Chen, Jiří Friml, Hong-Wei Xue, and Kan Liao. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv, 2020. https://doi.org/10.1101/791137.","ama":"Wei Z, Tan S, Liu T, et al. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. 2020. doi:10.1101/791137","ista":"Wei Z, Tan S, Liu T, Wu Y, Lei J-G, Chen Z, Friml J, Xue H-W, Liao K. 2020. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv, 10.1101/791137.","short":"Z. Wei, S. Tan, T. Liu, Y. Wu, J.-G. Lei, Z. Chen, J. Friml, H.-W. Xue, K. Liao, BioRxiv (2020).","ieee":"Z. Wei et al., “Plasmodesmata-like intercellular connections by plant remorin in animal cells,” bioRxiv. 2020."},"main_file_link":[{"url":"https://doi.org/10.1101/791137","open_access":"1"}],"type":"preprint","author":[{"full_name":"Wei, Zhuang","first_name":"Zhuang","last_name":"Wei"},{"id":"2DE75584-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0471-8285","full_name":"Tan, Shutang","last_name":"Tan","first_name":"Shutang"},{"first_name":"Tao","last_name":"Liu","full_name":"Liu, Tao"},{"full_name":"Wu, Yuan","first_name":"Yuan","last_name":"Wu"},{"last_name":"Lei","first_name":"Ji-Gang","full_name":"Lei, Ji-Gang"},{"last_name":"Chen","first_name":"ZhengJun","full_name":"Chen, ZhengJun"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","first_name":"Jiří","last_name":"Friml"},{"first_name":"Hong-Wei","last_name":"Xue","full_name":"Xue, Hong-Wei"},{"last_name":"Liao","first_name":"Kan","full_name":"Liao, Kan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","_id":"7601","publication_status":"published","abstract":[{"text":"Plasmodesmata (PD) are crucial structures for intercellular communication in multicellular plants with remorins being their crucial plant-specific structural and functional constituents. The PD biogenesis is an intriguing but poorly understood process. By expressing an Arabidopsis remorin protein in mammalian cells, we have reconstituted a PD-like filamentous structure, termed remorin filament (RF), connecting neighboring cells physically and physiologically. Notably, RFs are capable of transporting macromolecules intercellularly, in a way similar to plant PD. With further super-resolution microscopic analysis and biochemical characterization, we found that RFs are also composed of actin filaments, forming the core skeleton structure, aligned with the remorin protein. This unique heterologous filamentous structure might explain the molecular mechanism for remorin function as well as PD construction. Furthermore, remorin protein exhibits a specific distribution manner in the plasma membrane in mammalian cells, representing a lipid nanodomain, depending on its lipid modification status. Our studies not only provide crucial insights into the mechanism of PD biogenesis, but also uncovers unsuspected fundamental mechanistic and evolutionary links between intercellular communication systems of plants and animals.","lang":"eng"}],"oa":1,"article_processing_charge":"No","page":"22","date_updated":"2026-07-06T12:53:37Z","department":[{"_id":"JiFr"}],"date_published":"2020-02-19T00:00:00Z","language":[{"iso":"eng"}],"month":"02","title":"Plasmodesmata-like intercellular connections by plant remorin in animal cells"},{"doi":"10.24033/asens.2431","publication_identifier":{"issn":["0012-9593"]},"issue":"3","das_tickbox":"1","publication":"Annales Scientifiques de l'Ecole Normale Superieure","date_created":"2020-09-20T22:01:38Z","year":"2020","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.08013"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Su, C.","first_name":"C.","last_name":"Su"},{"full_name":"Zhao, Gufang","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7361-2882","last_name":"Zhao","first_name":"Gufang"},{"full_name":"Zhong, C.","first_name":"C.","last_name":"Zhong"}],"volume":53,"title":"On the K-theory stable bases of the springer resolution","article_processing_charge":"No","page":"663-671","external_id":{"arxiv":["1708.08013"],"isi":["000592182600004"]},"publication_status":"published","abstract":[{"text":"Cohomological and K-theoretic stable bases originated from the study of quantum cohomology and quantum K-theory. Restriction formula for cohomological stable bases played an important role in computing the quantum connection of cotangent bundle of partial flag varieties. In this paper we study the K-theoretic stable bases of cotangent bundles of flag varieties. We describe these bases in terms of the action of the affine Hecke algebra and the twisted group algebra of KostantKumar. Using this algebraic description and the method of root polynomials, we give a restriction formula of the stable bases. We apply it to obtain the restriction formula for partial flag varieties. We also build a relation between the stable basis and the Casselman basis in the principal series representations of the Langlands dual group. As an application, we give a closed formula for the transition matrix between Casselman basis and the characteristic functions.","lang":"eng"},{"lang":"fre","text":"Les bases stables cohomologiques et K-théoriques proviennent de l’étude de la cohomologie quantique et de la K-théorie quantique. La formule de restriction pour les bases stables cohomologiques a joué un rôle important dans le calcul de la connexion quantique du fibré cotangent de variétés de drapeaux partielles. Dans cet article, nous étudions les bases stables K-théoriques de fibré cotangents des variétés de drapeaux. Nous décrivons ces bases en fonction de l’action de l’algèbre de Hecke affine et de l’algèbre de Kostant-Kumar. En utilisant cette description algébrique et la méthode des polynômes de racine, nous donnons une formule de restriction des bases stables. Nous l’appliquons\r\npour obtenir la formule de restriction pour les variétés de drapeaux partielles. Nous construisons également une relation entre la base stable et la base de Casselman dans les représentations de la série principale du groupe dual de Langlands p-adique. Comme une application, nous donnons une formule close pour la matrice de transition entre la base de Casselman et les fonctions caractéristiques. "}],"day":"01","status":"public","citation":{"apa":"Su, C., Zhao, G., & Zhong, C. (2020). On the K-theory stable bases of the springer resolution. Annales Scientifiques de l’Ecole Normale Superieure. Societe Mathematique de France. https://doi.org/10.24033/asens.2431","chicago":"Su, C., Gufang Zhao, and C. Zhong. “On the K-Theory Stable Bases of the Springer Resolution.” Annales Scientifiques de l’Ecole Normale Superieure. Societe Mathematique de France, 2020. https://doi.org/10.24033/asens.2431.","mla":"Su, C., et al. “On the K-Theory Stable Bases of the Springer Resolution.” Annales Scientifiques de l’Ecole Normale Superieure, vol. 53, no. 3, Societe Mathematique de France, 2020, pp. 663–71, doi:10.24033/asens.2431.","ieee":"C. Su, G. Zhao, and C. Zhong, “On the K-theory stable bases of the springer resolution,” Annales Scientifiques de l’Ecole Normale Superieure, vol. 53, no. 3. Societe Mathematique de France, pp. 663–671, 2020.","short":"C. Su, G. Zhao, C. Zhong, Annales Scientifiques de l’Ecole Normale Superieure 53 (2020) 663–671.","ista":"Su C, Zhao G, Zhong C. 2020. On the K-theory stable bases of the springer resolution. Annales Scientifiques de l’Ecole Normale Superieure. 53(3), 663–671.","ama":"Su C, Zhao G, Zhong C. On the K-theory stable bases of the springer resolution. Annales Scientifiques de l’Ecole Normale Superieure. 2020;53(3):663-671. doi:10.24033/asens.2431"},"scopus_import":"1","_id":"8539","intvolume":" 53","oa_version":"Preprint","article_type":"original","type":"journal_article","date_published":"2020-06-01T00:00:00Z","language":[{"iso":"eng"}],"month":"06","date_updated":"2026-07-06T13:57:35Z","publisher":"Societe Mathematique de France","arxiv":1,"department":[{"_id":"TaHa"}],"isi":1,"oa":1},{"doi":"10.1137/19m126284x","publication_identifier":{"issn":["0036-1410"],"eissn":["1095-7154"]},"issue":"1","das_tickbox":"1","publication":"SIAM Journal on Mathematical Analysis","date_created":"2021-08-06T07:34:16Z","year":"2020","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.08647"}],"has_accepted_license":"1","ddc":["510"],"corr_author":"1","quality_controlled":"1","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"9733"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Feliciangeli","first_name":"Dario","full_name":"Feliciangeli, Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert"}],"volume":52,"keyword":["Applied Mathematics","Computational Mathematics","Analysis"],"title":"Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","article_processing_charge":"No","page":"605-622","external_id":{"arxiv":["1904.08647 "],"isi":["000546967700022"]},"publication_status":"published","abstract":[{"text":"We consider the Pekar functional on a ball in ℝ3. We prove uniqueness of minimizers, and a quadratic lower bound in terms of the distance to the minimizer. The latter follows from nondegeneracy of the Hessian at the minimum.","lang":"eng"}],"status":"public","day":"12","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"ec_funded":1,"citation":{"ista":"Feliciangeli D, Seiringer R. 2020. Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. 52(1), 605–622.","ama":"Feliciangeli D, Seiringer R. Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. 2020;52(1):605-622. doi:10.1137/19m126284x","short":"D. Feliciangeli, R. Seiringer, SIAM Journal on Mathematical Analysis 52 (2020) 605–622.","ieee":"D. Feliciangeli and R. Seiringer, “Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball,” SIAM Journal on Mathematical Analysis, vol. 52, no. 1. Society for Industrial and Applied Mathematics, pp. 605–622, 2020.","mla":"Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy of Minimizers of the Pekar Functional on a Ball.” SIAM Journal on Mathematical Analysis, vol. 52, no. 1, Society for Industrial and Applied Mathematics, 2020, pp. 605–22, doi:10.1137/19m126284x.","chicago":"Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy of Minimizers of the Pekar Functional on a Ball.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics, 2020. https://doi.org/10.1137/19m126284x.","apa":"Feliciangeli, D., & Seiringer, R. (2020). Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/19m126284x"},"project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"}],"scopus_import":"1","_id":"9781","oa_version":"Preprint","intvolume":" 52","article_type":"original","acknowledgement":"We are grateful for the hospitality at the Mittag-Leffler Institute, where part of this work has been done. The work of the authors was supported by the European Research Council (ERC)under the European Union's Horizon 2020 research and innovation programme grant 694227.","type":"journal_article","date_published":"2020-02-12T00:00:00Z","month":"02","language":[{"iso":"eng"}],"date_updated":"2026-07-06T14:02:25Z","department":[{"_id":"RoSe"}],"arxiv":1,"publisher":"Society for Industrial and Applied Mathematics","isi":1,"oa":1},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"id":"4B7E523C-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Xiang","last_name":"Li","first_name":"Xiang"}],"OA_place":"publisher","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"8587"},{"status":"public","relation":"part_of_dissertation","id":"1120"},{"relation":"part_of_dissertation","id":"5886","status":"public"}]},"article_processing_charge":"No","page":"125","publication_status":"published","abstract":[{"text":"The oft-quoted dictum by Arthur Schawlow: ``A diatomic molecule has one atom too many'' has been disavowed. Inspired by the possibility to experimentally manipulate and enhance chemical reactivity in helium nanodroplets, we investigate the rotation of coupled cold molecules in the presence of a many-body environment.\r\nIn this thesis, we introduce new variational approaches to quantum impurities and apply them to the Fröhlich polaron - a quasiparticle formed out of an electron (or other point-like impurity) in a polar medium, and to the angulon - a quasiparticle formed out of a rotating molecule in a bosonic bath.\r\nWith this theoretical toolbox, we reveal the self-localization transition for the angulon quasiparticle. We show that, unlike for polarons, self-localization of angulons occurs at finite impurity-bath coupling already at the mean-field level. The transition is accompanied by the spherical-symmetry breaking of the angulon ground state and a discontinuity in the first derivative of the ground-state energy. Moreover, the type of symmetry breaking is dictated by the symmetry of the microscopic impurity-bath interaction, which leads to a number of distinct self-localized states. \r\nFor the system containing multiple impurities, by analogy with the bipolaron, we introduce the biangulon quasiparticle describing two rotating molecules that align with respect to each other due to the effective attractive interaction mediated by the excitations of the bath. We study this system from the strong-coupling regime to the weak molecule-bath interaction regime. We show that the molecules tend to have a strong alignment in the ground state, the biangulon shows shifted angulon instabilities and an additional spectral instability, where resonant angular momentum transfer between the molecules and the bath takes place. Finally, we introduce a diagonalization scheme that allows us to describe the transition from two separated angulons to a biangulon as a function of the distance between the two molecules.","lang":"eng"}],"supervisor":[{"full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","last_name":"Lemeshko"}],"degree_awarded":"PhD","title":"Rotation of coupled cold molecules in the presence of a many-body environment","date_created":"2020-12-21T09:44:30Z","year":"2020","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:8958","corr_author":"1","file":[{"file_id":"8967","access_level":"open_access","relation":"main_file","checksum":"3994c54a1241451d561db1d4f43bad30","date_updated":"2020-12-22T10:55:56Z","file_size":3622305,"date_created":"2020-12-22T10:55:56Z","file_name":"THESIS_Xiang_Li.pdf","content_type":"application/pdf","success":1,"creator":"xli"},{"file_id":"8968","relation":"source_file","checksum":"0954ecfc5554c05615c14de803341f00","access_level":"closed","file_size":4018859,"date_updated":"2020-12-30T07:18:03Z","date_created":"2020-12-22T10:56:03Z","file_name":"THESIS_Xiang_Li.zip","content_type":"application/x-zip-compressed","creator":"xli"}],"has_accepted_license":"1","ddc":["539"],"oa_version":"Published Version","type":"dissertation","_id":"8958","file_date_updated":"2020-12-30T07:18:03Z","oa":1,"date_published":"2020-12-21T00:00:00Z","month":"12","language":[{"iso":"eng"}],"date_updated":"2026-07-07T05:31:09Z","publisher":"Institute of Science and Technology Austria","department":[{"_id":"MiLe"}],"ec_funded":1,"alternative_title":["ISTA Thesis"],"day":"21","status":"public","citation":{"ista":"Li X. 2020. Rotation of coupled cold molecules in the presence of a many-body environment. Institute of Science and Technology Austria.","ama":"Li X. Rotation of coupled cold molecules in the presence of a many-body environment. 2020. doi:10.15479/AT:ISTA:8958","short":"X. Li, Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment, Institute of Science and Technology Austria, 2020.","ieee":"X. Li, “Rotation of coupled cold molecules in the presence of a many-body environment,” Institute of Science and Technology Austria, 2020.","mla":"Li, Xiang. Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8958.","chicago":"Li, Xiang. “Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8958.","apa":"Li, X. (2020). Rotation of coupled cold molecules in the presence of a many-body environment. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8958"},"project":[{"call_identifier":"FWF","name":"Quantum rotations in the presence of a many-body environment","_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902"},{"grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020"}]},{"scopus_import":"1","_id":"15074","type":"conference","intvolume":" 179","oa_version":"Published Version","date_updated":"2026-07-07T06:21:32Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","arxiv":1,"department":[{"_id":"DaAl"}],"date_published":"2020-10-07T00:00:00Z","month":"10","language":[{"iso":"eng"}],"file_date_updated":"2024-03-05T07:08:27Z","oa":1,"status":"public","day":"07","alternative_title":["LIPIcs"],"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"citation":{"apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., & Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In 34th International Symposium on Distributed Computing (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.40","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” In 34th International Symposium on Distributed Computing, Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.40.","mla":"Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” 34th International Symposium on Distributed Computing, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.DISC.2020.40.","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in 34th International Symposium on Distributed Computing, Virtual, 2020, vol. 179.","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Brief announcement: Efficient load-balancing through distributed token dropping. In: 34th International Symposium on Distributed Computing. Vol 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.DISC.2020.40","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement: Efficient load-balancing through distributed token dropping. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 179, 40."},"related_material":{"record":[{"id":"9678","relation":"later_version","status":"public"}]},"volume":179,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Sebastian","last_name":"Brandt","full_name":"Brandt, Sebastian"},{"full_name":"Keller, Barbara","last_name":"Keller","first_name":"Barbara"},{"last_name":"Rybicki","first_name":"Joel","full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646"},{"last_name":"Suomela","first_name":"Jukka","full_name":"Suomela, Jukka"},{"full_name":"Uitto, Jara","first_name":"Jara","last_name":"Uitto"}],"title":"Brief announcement: Efficient load-balancing through distributed token dropping","external_id":{"arxiv":["2005.07761"]},"publication_status":"published","abstract":[{"lang":"eng","text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for the stable orientation problem, which is a special case of the more general locally optimal semi-matching problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies an algorithm with the same runtime for stable orientations. We improve the runtime to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds."}],"article_processing_charge":"No","license":"https://creativecommons.org/licenses/by/3.0/","publication":"34th International Symposium on Distributed Computing","doi":"10.4230/LIPIcs.DISC.2020.40","article_number":"40","date_created":"2024-03-05T07:09:12Z","year":"2020","conference":{"name":"DISC: Symposium on Distributed Computing","start_date":"2020-10-12","location":"Virtual","end_date":"2020-10-16"},"ddc":["000"],"has_accepted_license":"1","quality_controlled":"1","file":[{"access_level":"open_access","checksum":"23e2d9321aef53092dc1e24a8ab82d72","relation":"main_file","file_size":303529,"date_updated":"2024-03-05T07:08:27Z","file_id":"15075","success":1,"creator":"dernst","date_created":"2024-03-05T07:08:27Z","content_type":"application/pdf","file_name":"2020_LIPIcs_Brandt.pdf"}],"corr_author":"1"},{"status":"public","day":"12","citation":{"chicago":"Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” In 37th International Conference on Machine Learning, 119:5533–43, 2020.","apa":"Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M., … Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural network inference. In 37th International Conference on Machine Learning (Vol. 119, pp. 5533–5543). Online.","mla":"Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” 37th International Conference on Machine Learning, vol. 119, 2020, pp. 5533–43.","short":"M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson, S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference on Machine Learning, 2020, pp. 5533–5543.","ieee":"M. Kurtz et al., “Inducing and exploiting activation sparsity for fast neural network inference,” in 37th International Conference on Machine Learning, Online, 2020, vol. 119, pp. 5533–5543.","ista":"Kurtz M, Kopinsky J, Gelashvili R, Matveev A, Carr J, Goin M, Leiserson W, Moore S, Nell B, Shavit N, Alistarh D-A. 2020. Inducing and exploiting activation sparsity for fast neural network inference. 37th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 119, 5533–5543.","ama":"Kurtz M, Kopinsky J, Gelashvili R, et al. Inducing and exploiting activation sparsity for fast neural network inference. In: 37th International Conference on Machine Learning. Vol 119. ; 2020:5533-5543."},"oa_version":"Published Version","intvolume":" 119","type":"conference","_id":"9415","scopus_import":"1","oa":1,"file_date_updated":"2021-05-25T09:51:36Z","month":"07","language":[{"iso":"eng"}],"date_published":"2020-07-12T00:00:00Z","department":[{"_id":"DaAl"}],"date_updated":"2026-07-07T13:42:32Z","year":"2020","date_created":"2021-05-23T22:01:45Z","publication_identifier":{"issn":["2640-3498"]},"publication":"37th International Conference on Machine Learning","das_tickbox":"1","quality_controlled":"1","file":[{"date_created":"2021-05-25T09:51:36Z","content_type":"application/pdf","file_name":"2020_PMLR_Kurtz.pdf","success":1,"creator":"kschuh","file_id":"9421","access_level":"open_access","relation":"main_file","checksum":"2aaaa7d7226e49161311d91627cf783b","file_size":741899,"date_updated":"2021-05-25T09:51:36Z"}],"has_accepted_license":"1","ddc":["000"],"conference":{"end_date":"2020-07-18","location":"Online","name":"ICML: International Conference on Machine Learning","start_date":"2020-07-12"},"author":[{"full_name":"Kurtz, Mark","first_name":"Mark","last_name":"Kurtz"},{"last_name":"Kopinsky","first_name":"Justin","full_name":"Kopinsky, Justin"},{"full_name":"Gelashvili, Rati","first_name":"Rati","last_name":"Gelashvili"},{"last_name":"Matveev","first_name":"Alexander","full_name":"Matveev, Alexander"},{"full_name":"Carr, John","last_name":"Carr","first_name":"John"},{"full_name":"Goin, Michael","first_name":"Michael","last_name":"Goin"},{"full_name":"Leiserson, William","first_name":"William","last_name":"Leiserson"},{"full_name":"Moore, Sage","first_name":"Sage","last_name":"Moore"},{"full_name":"Nell, Bill","last_name":"Nell","first_name":"Bill"},{"full_name":"Shavit, Nir","last_name":"Shavit","first_name":"Nir"},{"last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":119,"page":"5533-5543","article_processing_charge":"No","abstract":[{"text":"Optimizing convolutional neural networks for fast inference has recently become an extremely active area of research. One of the go-to solutions in this context is weight pruning, which aims to reduce computational and memory footprint by removing large subsets of the connections in a neural network. Surprisingly, much less attention has been given to exploiting sparsity in the activation maps, which tend to be naturally sparse in many settings thanks to the structure of rectified linear (ReLU) activation functions. In this paper, we present an in-depth analysis of methods for maximizing the sparsity of the activations in a trained neural network, and show that, when coupled with an efficient sparse-input convolution algorithm, we can leverage this sparsity for significant performance gains. To induce highly sparse activation maps without accuracy loss, we introduce a new regularization technique, coupled with a new threshold-based sparsification method based on a parameterized activation function called Forced-Activation-Threshold Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular image classification models, showing that most architectures can adapt to significantly sparser activation maps without any accuracy loss. Our second contribution is showing that these these compression gains can be translated into inference speedups: we provide a new algorithm to enable fast convolution operations over networks with sparse activations, and show that it can enable significant speedups for end-to-end inference on a range of popular models on the large-scale ImageNet image classification task on modern Intel CPUs, with little or no retraining cost. ","lang":"eng"}],"title":"Inducing and exploiting activation sparsity for fast neural network inference"},{"researchdata_availability":"no","article_number":"043202","year":"2020","date_created":"2020-08-24T06:24:04Z","publication":"Physical Review Letters","das_tickbox":"0","issue":"4","doi":"10.1103/PhysRevLett.125.043202","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"quality_controlled":"1","supplementarymaterial":"yes","main_file_link":[{"url":"https://arxiv.org/abs/1912.10218","open_access":"1"}],"volume":125,"author":[{"first_name":"Benjamin K.","last_name":"Malia","full_name":"Malia, Benjamin K."},{"full_name":"Martínez-Rincón, Julián","first_name":"Julián","last_name":"Martínez-Rincón"},{"first_name":"Yunfan","last_name":"Wu","full_name":"Wu, Yunfan"},{"last_name":"Hosten","first_name":"Onur","orcid":"0000-0002-2031-204X","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","full_name":"Hosten, Onur"},{"full_name":"Kasevich, Mark A.","first_name":"Mark A.","last_name":"Kasevich"}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","pmid":1,"abstract":[{"lang":"eng","text":"We demonstrate the utility of optical cavity generated spin-squeezed states in free space atomic fountain clocks in ensembles of 390 000 87Rb atoms. Fluorescence imaging, correlated to an initial quantum nondemolition measurement, is used for population spectroscopy after the atoms are released from a confining lattice. For a free fall time of 4 milliseconds, we resolve a single-shot phase sensitivity of 814(61) microradians, which is 5.8(0.6) decibels (dB) below the quantum projection limit. We observe that this squeezing is preserved as the cloud expands to a roughly 200 μm radius and falls roughly 300 μm in free space. Ramsey spectroscopy with 240 000 atoms at a 3.6 ms Ramsey time results in a single-shot fractional frequency stability of 8.4(0.2)×10−12, 3.8(0.2) dB below the quantum projection limit. The sensitivity and stability are limited by the technical noise in the fluorescence detection protocol and the microwave system, respectively."}],"publication_status":"published","external_id":{"isi":["000552227400008"],"arxiv":["1912.10218"],"pmid":["32794788"]},"article_processing_charge":"No","title":"Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit","day":"24","status":"public","citation":{"ieee":"B. K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, and M. A. Kasevich, “Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit,” Physical Review Letters, vol. 125, no. 4. American Physical Society, 2020.","short":"B.K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, M.A. Kasevich, Physical Review Letters 125 (2020).","ama":"Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. 2020;125(4). doi:10.1103/PhysRevLett.125.043202","ista":"Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. 2020. Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. 125(4), 043202.","chicago":"Malia, Benjamin K., Julián Martínez-Rincón, Yunfan Wu, Onur Hosten, and Mark A. Kasevich. “Free Space Ramsey Spectroscopy in Rubidium with Noise below the Quantum Projection Limit.” Physical Review Letters. American Physical Society, 2020. https://doi.org/10.1103/PhysRevLett.125.043202.","apa":"Malia, B. K., Martínez-Rincón, J., Wu, Y., Hosten, O., & Kasevich, M. A. (2020). Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.125.043202","mla":"Malia, Benjamin K., et al. “Free Space Ramsey Spectroscopy in Rubidium with Noise below the Quantum Projection Limit.” Physical Review Letters, vol. 125, no. 4, 043202, American Physical Society, 2020, doi:10.1103/PhysRevLett.125.043202."},"type":"journal_article","acknowledgement":"This work is supported by the Office of Naval Research (N00014-16-1-2927- A00003), Vannevar Bush Faculty Fellowship (N00014-16-1-2812- P00005), Department of Energy (DE-SC0019174- 0001), and Defense Threat Reduction Agency (HDTRA1-15-1-0017- P00005).","article_type":"original","intvolume":" 125","oa_version":"Preprint","_id":"8285","scopus_import":"1","oa":1,"isi":1,"department":[{"_id":"OnHo"}],"publisher":"American Physical Society","arxiv":1,"date_updated":"2026-07-08T08:56:44Z","month":"07","language":[{"iso":"eng"}],"date_published":"2020-07-24T00:00:00Z"},{"citation":{"short":"Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B.K. Malia, O. Hosten, M.A. Kasevich, Physical Review A 102 (2020).","ieee":"Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B. K. Malia, O. Hosten, and M. A. Kasevich, “Retrieval of cavity-generated atomic spin squeezing after free-space release,” Physical Review A, vol. 102, no. 1. American Physical Society, 2020.","ista":"Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. 2020. Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. 102(1), 012224.","ama":"Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. 2020;102(1). doi:10.1103/PhysRevA.102.012224","apa":"Wu, Y., Krishnakumar, R., Martínez-Rincón, J., Malia, B. K., Hosten, O., & Kasevich, M. A. (2020). Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.102.012224","chicago":"Wu, Yunfan, Rajiv Krishnakumar, Julián Martínez-Rincón, Benjamin K. Malia, Onur Hosten, and Mark A. Kasevich. “Retrieval of Cavity-Generated Atomic Spin Squeezing after Free-Space Release.” Physical Review A. American Physical Society, 2020. https://doi.org/10.1103/PhysRevA.102.012224.","mla":"Wu, Yunfan, et al. “Retrieval of Cavity-Generated Atomic Spin Squeezing after Free-Space Release.” Physical Review A, vol. 102, no. 1, 012224, American Physical Society, 2020, doi:10.1103/PhysRevA.102.012224."},"day":"30","status":"public","oa":1,"isi":1,"date_updated":"2026-07-08T08:59:02Z","arxiv":1,"publisher":"American Physical Society","department":[{"_id":"OnHo"}],"date_published":"2020-07-30T00:00:00Z","language":[{"iso":"eng"}],"month":"07","acknowledgement":"We thank N. Engelsen for comments on the manuscript. This work was supported by the Office of Naval Research, Vannevar Bush Faculty Fellowship, Department of Energy, and Defense Threat Reduction Agency. R.K. was partly supported by the AQT/INQNET program at Caltech.","type":"journal_article","oa_version":"Preprint","intvolume":" 102","article_type":"original","scopus_import":"1","_id":"8319","quality_controlled":"1","supplementarymaterial":"no","main_file_link":[{"url":"https://arxiv.org/abs/1912.08334","open_access":"1"}],"article_number":"012224","researchdata_availability":"no","date_created":"2020-08-30T22:01:10Z","year":"2020","das_tickbox":"0","publication":"Physical Review A","publication_identifier":{"issn":["2469-9926"],"eissn":["2469-9934"]},"doi":"10.1103/PhysRevA.102.012224","issue":"1","external_id":{"isi":["000555104200011"],"arxiv":["1912.08334"]},"publication_status":"published","abstract":[{"lang":"eng","text":"We demonstrate that releasing atoms into free space from an optical lattice does not deteriorate cavity-generated spin squeezing for metrological purposes. In this work, an ensemble of 500000 spin-squeezed atoms in a high-finesse optical cavity with near-uniform atom-cavity coupling is prepared, released into free space, recaptured in the cavity, and probed. Up to ∼10 dB of metrologically relevant squeezing is retrieved for 700μs free-fall times, and decaying levels of squeezing are realized for up to 3 ms free-fall times. The degradation of squeezing results from loss of atom-cavity coupling homogeneity between the initial squeezed state generation and final collective state readout. A theoretical model is developed to quantify this degradation and this model is experimentally validated."}],"article_processing_charge":"No","title":"Retrieval of cavity-generated atomic spin squeezing after free-space release","volume":102,"author":[{"full_name":"Wu, Yunfan","last_name":"Wu","first_name":"Yunfan"},{"last_name":"Krishnakumar","first_name":"Rajiv","full_name":"Krishnakumar, Rajiv"},{"full_name":"Martínez-Rincón, Julián","first_name":"Julián","last_name":"Martínez-Rincón"},{"full_name":"Malia, Benjamin K.","last_name":"Malia","first_name":"Benjamin K."},{"first_name":"Onur","last_name":"Hosten","full_name":"Hosten, Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X"},{"first_name":"Mark A.","last_name":"Kasevich","full_name":"Kasevich, Mark A."}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d"},{"publication_identifier":{"eissn":["2050-084X"]},"doi":"10.7554/eLife.56261","das_tickbox":"1","publication":"eLife","date_created":"2020-07-16T12:26:04Z","year":"2020","article_number":"e56261","has_accepted_license":"1","ddc":["570"],"file":[{"date_created":"2020-10-27T11:37:32Z","file_name":"2020_eLife_Gonçalves.pdf","content_type":"application/pdf","success":1,"creator":"cziletti","file_id":"8709","access_level":"open_access","checksum":"c4300ddcd93ed03fc9c6cdf1f77890be","relation":"main_file","date_updated":"2020-10-27T11:37:32Z","file_size":17355867}],"quality_controlled":"1","pmid":1,"author":[{"orcid":"0000-0002-6987-4836","full_name":"Gonçalves, Pedro J.","first_name":"Pedro J.","last_name":"Gonçalves"},{"orcid":"0000-0003-4320-4663","full_name":"Lueckmann, Jan-Matthis","last_name":"Lueckmann","first_name":"Jan-Matthis"},{"first_name":"Michael","last_name":"Deistler","full_name":"Deistler, Michael","orcid":"0000-0002-3573-0404"},{"orcid":"0000-0001-6044-6627","full_name":"Nonnenmacher, Marcel","first_name":"Marcel","last_name":"Nonnenmacher"},{"first_name":"Kaan","last_name":"Öcal","orcid":"0000-0002-8528-6858","full_name":"Öcal, Kaan"},{"full_name":"Bassetto, Giacomo","last_name":"Bassetto","first_name":"Giacomo"},{"orcid":"0000-0003-4252-1608","id":"BA06AFEE-A4BA-11EA-AE5C-14673DDC885E","full_name":"Chintaluri, Chaitanya","last_name":"Chintaluri","first_name":"Chaitanya"},{"first_name":"William F.","last_name":"Podlaski","orcid":"0000-0001-6619-7502","full_name":"Podlaski, William F."},{"orcid":"0000-0003-0807-0823","full_name":"Haddad, Sara A.","last_name":"Haddad","first_name":"Sara A."},{"first_name":"Tim P","last_name":"Vogels","full_name":"Vogels, Tim P","orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425"},{"full_name":"Greenberg, David S.","last_name":"Greenberg","first_name":"David S."},{"orcid":"0000-0001-5154-8912","full_name":"Macke, Jakob H.","first_name":"Jakob H.","last_name":"Macke"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":9,"title":"Training deep neural density estimators to identify mechanistic models of neural dynamics","article_processing_charge":"No","external_id":{"pmid":["32940606"],"isi":["000584989400001"]},"publication_status":"published","abstract":[{"text":"Mechanistic modeling in neuroscience aims to explain observed phenomena in terms of underlying causes. However, determining which model parameters agree with complex and stochastic neural data presents a significant challenge. We address this challenge with a machine learning tool which uses deep neural density estimators—trained using model simulations—to carry out Bayesian inference and retrieve the full space of parameters compatible with raw data or selected data features. Our method is scalable in parameters and data features and can rapidly analyze new data after initial training. We demonstrate the power and flexibility of our approach on receptive fields, ion channels, and Hodgkin–Huxley models. We also characterize the space of circuit configurations giving rise to rhythmic activity in the crustacean stomatogastric ganglion, and use these results to derive hypotheses for underlying compensation mechanisms. Our approach will help close the gap between data-driven and theory-driven models of neural dynamics.","lang":"eng"}],"day":"17","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"citation":{"mla":"Gonçalves, Pedro J., et al. “Training Deep Neural Density Estimators to Identify Mechanistic Models of Neural Dynamics.” ELife, vol. 9, e56261, eLife Sciences Publications, 2020, doi:10.7554/eLife.56261.","chicago":"Gonçalves, Pedro J., Jan-Matthis Lueckmann, Michael Deistler, Marcel Nonnenmacher, Kaan Öcal, Giacomo Bassetto, Chaitanya Chintaluri, et al. “Training Deep Neural Density Estimators to Identify Mechanistic Models of Neural Dynamics.” ELife. eLife Sciences Publications, 2020. https://doi.org/10.7554/eLife.56261.","apa":"Gonçalves, P. J., Lueckmann, J.-M., Deistler, M., Nonnenmacher, M., Öcal, K., Bassetto, G., … Macke, J. H. (2020). Training deep neural density estimators to identify mechanistic models of neural dynamics. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.56261","ista":"Gonçalves PJ, Lueckmann J-M, Deistler M, Nonnenmacher M, Öcal K, Bassetto G, Chintaluri C, Podlaski WF, Haddad SA, Vogels TP, Greenberg DS, Macke JH. 2020. Training deep neural density estimators to identify mechanistic models of neural dynamics. eLife. 9, e56261.","ama":"Gonçalves PJ, Lueckmann J-M, Deistler M, et al. Training deep neural density estimators to identify mechanistic models of neural dynamics. eLife. 2020;9. doi:10.7554/eLife.56261","ieee":"P. J. Gonçalves et al., “Training deep neural density estimators to identify mechanistic models of neural dynamics,” eLife, vol. 9. eLife Sciences Publications, 2020.","short":"P.J. Gonçalves, J.-M. Lueckmann, M. Deistler, M. Nonnenmacher, K. Öcal, G. Bassetto, C. Chintaluri, W.F. Podlaski, S.A. Haddad, T.P. Vogels, D.S. Greenberg, J.H. Macke, ELife 9 (2020)."},"project":[{"grant_number":"819603","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","call_identifier":"H2020"}],"scopus_import":"1","_id":"8127","oa_version":"Published Version","intvolume":" 9","article_type":"original","type":"journal_article","acknowledgement":"We thank Mahmood S Hoseini and Michael Stryker for sharing their data for Figure 2, and Philipp Berens, Sean Bittner, Jan Boelts, John Cunningham, Richard Gao, Scott Linderman, Eve Marder, Iain Murray, George Papamakarios, Astrid Prinz, Auguste Schulz and Srinivas Turaga for discussions and/or comments on the manuscript. This work was supported by the German Research Foundation (DFG) through SFB 1233 ‘Robust Vision’, (276693517), SFB 1089 ‘Synaptic Microcircuits’, SPP 2041 ‘Computational Connectomics’ and Germany's Excellence Strategy – EXC-Number 2064/1 – Project number 390727645 and the German Federal Ministry of Education and Research (BMBF, project ‘ADIMEM’, FKZ 01IS18052 A-D) to JHM, a Sir Henry Dale Fellowship by the Wellcome Trust and the Royal Society (WT100000; WFP and TPV), a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z; TPV), a ERC Consolidator Grant (SYNAPSEEK; WPF and CC), and a UK Research and Innovation, Biotechnology and Biological Sciences Research Council (CC, UKRI-BBSRC BB/N019512/1). We gratefully acknowledge the Leibniz Supercomputing Centre for funding this project by providing computing time on its Linux-Cluster.","date_published":"2020-09-17T00:00:00Z","month":"09","language":[{"iso":"eng"}],"date_updated":"2026-07-13T12:31:21Z","publisher":"eLife Sciences Publications","department":[{"_id":"TiVo"}],"isi":1,"file_date_updated":"2020-10-27T11:37:32Z","oa":1},{"year":"2020","date_created":"2026-06-29T10:54:10Z","issue":"4","publication_identifier":{"eissn":["1098-2418"],"issn":["1042-9832"]},"doi":"10.1002/rsa.20950","publication":"Random Structures & Algorithms","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1906.01092"}],"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Jacob","last_name":"Fox","full_name":"Fox, Jacob"},{"first_name":"Xiaoyu","last_name":"He","full_name":"He, Xiaoyu"},{"full_name":"Wigderson, Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","last_name":"Wigderson","first_name":"Yuval"}],"volume":57,"OA_place":"repository","page":"1157-1173","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We introduce a graph Ramsey game called Ramsey, Paper,Scissors. This game has two players, Proposer and Decider.Starting from an empty graph on n vertices, on each turnProposer proposes a potential edge and Decider simultane-ously decides (without knowing Proposer’s choice) whether toadd it to the graph. Proposer cannot propose an edge whichwould create a triangle in the graph. The game ends whenProposer has no legal moves remaining, and Proposer wins ifthe final graph has independence number at least s. We provea threshold phenomenon exists for this game by exhibitingrandomized strategies for both players that are optimal up toconstants. Namely, there exist constants 0 < A < B such that(under optimal play) Proposer wins with high probability ifs < A√n log n, while Decider wins with high probability ifs > B√n log n. This is a factor of Θ(√log n)) larger than thelower bound coming from the off-diagonal Ramsey numberr(3, s)."}],"external_id":{"arxiv":["1906.01092"]},"publication_status":"published","title":"Ramsey, Paper, Scissors","OA_type":"green","status":"public","day":"01","citation":{"mla":"Fox, Jacob, et al. “Ramsey, Paper, Scissors.” Random Structures & Algorithms, vol. 57, no. 4, Wiley, 2020, pp. 1157–73, doi:10.1002/rsa.20950.","chicago":"Fox, Jacob, Xiaoyu He, and Yuval Wigderson. “Ramsey, Paper, Scissors.” Random Structures & Algorithms. Wiley, 2020. https://doi.org/10.1002/rsa.20950.","apa":"Fox, J., He, X., & Wigderson, Y. (2020). Ramsey, Paper, Scissors. Random Structures & Algorithms. Wiley. https://doi.org/10.1002/rsa.20950","ama":"Fox J, He X, Wigderson Y. Ramsey, Paper, Scissors. Random Structures & Algorithms. 2020;57(4):1157-1173. doi:10.1002/rsa.20950","ista":"Fox J, He X, Wigderson Y. 2020. Ramsey, Paper, Scissors. Random Structures & Algorithms. 57(4), 1157–1173.","ieee":"J. Fox, X. He, and Y. Wigderson, “Ramsey, Paper, Scissors,” Random Structures & Algorithms, vol. 57, no. 4. Wiley, pp. 1157–1173, 2020.","short":"J. Fox, X. He, Y. Wigderson, Random Structures & Algorithms 57 (2020) 1157–1173."},"article_type":"original","oa_version":"Preprint","intvolume":" 57","type":"journal_article","_id":"22166","scopus_import":"1","oa":1,"language":[{"iso":"eng"}],"month":"12","date_published":"2020-12-01T00:00:00Z","arxiv":1,"publisher":"Wiley","date_updated":"2026-07-14T08:31:05Z"},{"author":[{"first_name":"Jacob","last_name":"Fox","full_name":"Fox, Jacob"},{"first_name":"Yuval","last_name":"Wigderson","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval"},{"full_name":"Zhao, Yufei","last_name":"Zhao","first_name":"Yufei"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","OA_place":"repository","volume":358,"mathsc":["05D10","11B30"],"article_processing_charge":"No","page":"957-959","external_id":{"arxiv":["2005.04135"]},"publication_status":"published","abstract":[{"lang":"eng","text":"We present a short new proof of the canonical polynomial van der Waerden theorem, recently established by Girão."}],"title":"A short proof of the canonical polynomial van der Waerden theorem","date_created":"2026-06-29T11:00:09Z","year":"2020","publication_identifier":{"issn":["1631-073X"],"eissn":["1778-3569"]},"doi":"10.5802/crmath.101","issue":"8","publication":"Comptes Rendus Mathématique","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2005.04135","open_access":"1"}],"oa_version":"Preprint","intvolume":" 358","article_type":"original","type":"journal_article","scopus_import":"1","_id":"22182","oa":1,"date_published":"2020-12-03T00:00:00Z","month":"12","language":[{"iso":"eng"}],"date_updated":"2026-07-14T09:19:20Z","publisher":"Académie des Sciences","arxiv":1,"OA_type":"green","day":"03","status":"public","citation":{"chicago":"Fox, Jacob, Yuval Wigderson, and Yufei Zhao. “A Short Proof of the Canonical Polynomial van Der Waerden Theorem.” Comptes Rendus Mathématique. Académie des Sciences, 2020. https://doi.org/10.5802/crmath.101.","apa":"Fox, J., Wigderson, Y., & Zhao, Y. (2020). A short proof of the canonical polynomial van der Waerden theorem. Comptes Rendus Mathématique. Académie des Sciences. https://doi.org/10.5802/crmath.101","mla":"Fox, Jacob, et al. “A Short Proof of the Canonical Polynomial van Der Waerden Theorem.” Comptes Rendus Mathématique, vol. 358, no. 8, Académie des Sciences, 2020, pp. 957–59, doi:10.5802/crmath.101.","short":"J. Fox, Y. Wigderson, Y. Zhao, Comptes Rendus Mathématique 358 (2020) 957–959.","ieee":"J. Fox, Y. Wigderson, and Y. Zhao, “A short proof of the canonical polynomial van der Waerden theorem,” Comptes Rendus Mathématique, vol. 358, no. 8. Académie des Sciences, pp. 957–959, 2020.","ista":"Fox J, Wigderson Y, Zhao Y. 2020. A short proof of the canonical polynomial van der Waerden theorem. Comptes Rendus Mathématique. 358(8), 957–959.","ama":"Fox J, Wigderson Y, Zhao Y. A short proof of the canonical polynomial van der Waerden theorem. Comptes Rendus Mathématique. 2020;358(8):957-959. doi:10.5802/crmath.101"}},{"article_processing_charge":"No","abstract":[{"text":"A weakly optimal Ks-free (n,d,λ)-graph is ad-regular Ks-free graph on n vertices with d= Θ(n1−α) and spectral expansion λ= Θ(n1−(s−1)α), for some fixed α >0. Such a graph is called optimal if additionally α=12s−3. We prove that if s1,...,sk>3 are fixed positive integers and weakly optimal Ksi-free pseudorandom graphs exist for each 1The Electronic Journal of Combinatorics, vol. 27, no. 1. The Electronic Journal of Combinatorics, 2020.","ama":"He X, Wigderson Y. Multicolor Ramsey numbers via pseudorandom graphs. The Electronic Journal of Combinatorics. 2020;27(1). doi:10.37236/9071","ista":"He X, Wigderson Y. 2020. Multicolor Ramsey numbers via pseudorandom graphs. The Electronic Journal of Combinatorics. 27(1), P1.32.","apa":"He, X., & Wigderson, Y. (2020). Multicolor Ramsey numbers via pseudorandom graphs. The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics. https://doi.org/10.37236/9071","chicago":"He, Xiaoyu, and Yuval Wigderson. “Multicolor Ramsey Numbers via Pseudorandom Graphs.” The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics, 2020. https://doi.org/10.37236/9071.","mla":"He, Xiaoyu, and Yuval Wigderson. “Multicolor Ramsey Numbers via Pseudorandom Graphs.” The Electronic Journal of Combinatorics, vol. 27, no. 1, P1.32, The Electronic Journal of Combinatorics, 2020, doi:10.37236/9071."},"OA_type":"green","day":"01","status":"public"},{"issue":"1","doi":"10.37236/9071","publication_identifier":{"issn":["1077-8926"]},"publication":"The Electronic Journal of Combinatorics","das_tickbox":"1","year":"2020","date_created":"2026-06-29T10:47:47Z","article_number":"P1.32","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1910.06287","open_access":"1"}],"quality_controlled":"1","extern":"1","author":[{"full_name":"He, Xiaoyu","last_name":"He","first_name":"Xiaoyu"},{"last_name":"Wigderson","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","volume":27,"title":"Multicolor Ramsey numbers via pseudorandom graphs","article_processing_charge":"No","abstract":[{"text":"A weakly optimal Ks-free (n,d,λ)-graph is a d-regular Ks-free graph on n vertices with d=Θ(n1−α) and spectral expansion λ=Θ(n1−(s−1)α), for some fixed α>0. Such a graph is called optimal if additionally α=12s−3. We prove that if s1,…,sk≥3 are fixed positive integers and weakly optimal Ksi-free pseudorandom graphs exist for each 1≤i≤k, then the multicolor Ramsey numbers satisfy\r\nΩ(tS+1log2St)≤r(s1,…,sk,t)≤O(tS+1logSt),\r\nas t→∞, where S=∑ki=1(si−2). This generalizes previous results of Mubayi and Verstraëte, who proved the case k=1, and Alon and Rödl, who proved the case s1=⋯=sk=3. Both previous results used the existence of optimal rather than weakly optimal Ksi-free graphs.","lang":"eng"}],"external_id":{"arxiv":["1910.06287"]},"publication_status":"published","day":"07","status":"public","OA_type":"green","citation":{"ista":"He X, Wigderson Y. 2020. Multicolor Ramsey numbers via pseudorandom graphs. The Electronic Journal of Combinatorics. 27(1), P1.32.","ama":"He X, Wigderson Y. Multicolor Ramsey numbers via pseudorandom graphs. The Electronic Journal of Combinatorics. 2020;27(1). doi:10.37236/9071","short":"X. He, Y. Wigderson, The Electronic Journal of Combinatorics 27 (2020).","ieee":"X. He and Y. Wigderson, “Multicolor Ramsey numbers via pseudorandom graphs,” The Electronic Journal of Combinatorics, vol. 27, no. 1. The Electronic Journal of Combinatorics, 2020.","mla":"He, Xiaoyu, and Yuval Wigderson. “Multicolor Ramsey Numbers via Pseudorandom Graphs.” The Electronic Journal of Combinatorics, vol. 27, no. 1, P1.32, The Electronic Journal of Combinatorics, 2020, doi:10.37236/9071.","chicago":"He, Xiaoyu, and Yuval Wigderson. “Multicolor Ramsey Numbers via Pseudorandom Graphs.” The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics, 2020. https://doi.org/10.37236/9071.","apa":"He, X., & Wigderson, Y. (2020). Multicolor Ramsey numbers via pseudorandom graphs. The Electronic Journal of Combinatorics. The Electronic Journal of Combinatorics. https://doi.org/10.37236/9071"},"_id":"22153","scopus_import":"1","article_type":"original","intvolume":" 27","oa_version":"Preprint","type":"journal_article","month":"02","language":[{"iso":"eng"}],"date_published":"2020-02-07T00:00:00Z","publisher":"The Electronic Journal of Combinatorics","arxiv":1,"date_updated":"2026-07-14T09:55:01Z","oa":1},{"year":"2020","date_created":"2020-02-09T23:00:52Z","publication":"ACS Applied Energy Materials","issue":"3","publication_identifier":{"eissn":["2574-0962"]},"doi":"10.1021/acsaem.9b02137","quality_controlled":"1","file":[{"file_id":"11942","relation":"main_file","checksum":"f23be731a766a480c77c962c1380315c","access_level":"open_access","file_size":6423548,"date_updated":"2022-08-23T08:34:17Z","date_created":"2022-08-23T08:34:17Z","file_name":"2020_ACSAppliedEnergyMat_Cadavid.pdf","content_type":"application/pdf","creator":"dernst","success":1}],"ddc":["540"],"has_accepted_license":"1","volume":3,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Cadavid, Doris","last_name":"Cadavid","first_name":"Doris"},{"full_name":"Ortega, Silvia","first_name":"Silvia","last_name":"Ortega"},{"full_name":"Illera, Sergio","first_name":"Sergio","last_name":"Illera"},{"full_name":"Liu, Yu","orcid":"0000-0001-7313-6740","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu","last_name":"Liu"},{"first_name":"Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria"},{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"full_name":"Zhang, Yu","last_name":"Zhang","first_name":"Yu"},{"first_name":"Mengyao","last_name":"Li","full_name":"Li, Mengyao"},{"last_name":"López","first_name":"Antonio M.","full_name":"López, Antonio M."},{"full_name":"Noriega, Germán","last_name":"Noriega","first_name":"Germán"},{"full_name":"Durá, Oscar Juan","first_name":"Oscar Juan","last_name":"Durá"},{"full_name":"López De La Torre, M. A.","last_name":"López De La Torre","first_name":"M. A."},{"full_name":"Prades, Joan Daniel","last_name":"Prades","first_name":"Joan Daniel"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"abstract":[{"text":"Nanomaterials produced from the bottom-up assembly of nanocrystals may incorporate ∼1020–1021 cm–3 not fully coordinated surface atoms, i.e., ∼1020–1021 cm–3 potential donor or acceptor states that can strongly affect transport properties. Therefore, to exploit the full potential of nanocrystal building blocks to produce functional nanomaterials and thin films, a proper control of their surface chemistry is required. Here, we analyze how the ligand stripping procedure influences the charge and heat transport properties of sintered PbSe nanomaterials produced from the bottom-up assembly of colloidal PbSe nanocrystals. First, we show that the removal of the native organic ligands by thermal decomposition in an inert atmosphere leaves relatively large amounts of carbon at the crystal interfaces. This carbon blocks crystal growth during consolidation and at the same time hampers charge and heat transport through the final nanomaterial. Second, we demonstrate that, by stripping ligands from the nanocrystal surface before consolidation, nanomaterials with larger crystal domains, lower porosity, and higher charge carrier concentrations are obtained, thus resulting in nanomaterials with higher electrical and thermal conductivities. In addition, the ligand displacement leaves the nanocrystal surface unprotected, facilitating oxidation and chalcogen evaporation. The influence of the ligand displacement on the nanomaterial charge transport properties is rationalized here using a two-band model based on the standard Boltzmann transport equation with the relaxation time approximation. Finally, we present an application of the produced functional nanomaterials by modeling, fabricating, and testing a simple PbSe-based thermoelectric device with a ring geometry.","lang":"eng"}],"publication_status":"published","external_id":{"isi":["000526598300012"]},"page":"2120-2129","article_processing_charge":"No","title":"Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials","ec_funded":1,"OA_type":"green","status":"public","day":"01","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"citation":{"ieee":"D. Cadavid et al., “Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials,” ACS Applied Energy Materials, vol. 3, no. 3. American Chemical Society, pp. 2120–2129, 2020.","short":"D. Cadavid, S. Ortega, S. Illera, Y. Liu, M. Ibáñez, A. Shavel, Y. Zhang, M. Li, A.M. López, G. Noriega, O.J. Durá, M.A. López De La Torre, J.D. Prades, A. Cabot, ACS Applied Energy Materials 3 (2020) 2120–2129.","ista":"Cadavid D, Ortega S, Illera S, Liu Y, Ibáñez M, Shavel A, Zhang Y, Li M, López AM, Noriega G, Durá OJ, López De La Torre MA, Prades JD, Cabot A. 2020. Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials. ACS Applied Energy Materials. 3(3), 2120–2129.","ama":"Cadavid D, Ortega S, Illera S, et al. Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials. ACS Applied Energy Materials. 2020;3(3):2120-2129. doi:10.1021/acsaem.9b02137","apa":"Cadavid, D., Ortega, S., Illera, S., Liu, Y., Ibáñez, M., Shavel, A., … Cabot, A. (2020). Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials. ACS Applied Energy Materials. American Chemical Society. https://doi.org/10.1021/acsaem.9b02137","chicago":"Cadavid, Doris, Silvia Ortega, Sergio Illera, Yu Liu, Maria Ibáñez, Alexey Shavel, Yu Zhang, et al. “Influence of the Ligand Stripping on the Transport Properties of Nanoparticle-Based PbSe Nanomaterials.” ACS Applied Energy Materials. American Chemical Society, 2020. https://doi.org/10.1021/acsaem.9b02137.","mla":"Cadavid, Doris, et al. “Influence of the Ligand Stripping on the Transport Properties of Nanoparticle-Based PbSe Nanomaterials.” ACS Applied Energy Materials, vol. 3, no. 3, American Chemical Society, 2020, pp. 2120–29, doi:10.1021/acsaem.9b02137."},"acknowledgement":"This work was supported by the Spanish Ministerio de Economía y Competitividad through the project SEHTOP (ENE2016-77798-C4-3-R) and the Generalitat de Catalunya through the project 2017SGR1246. D.C. acknowledges support from Universidad Nacional de Colombia. Y.L. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement no. 754411. M.I. acknowledges financial support from IST Austria.","type":"journal_article","article_type":"original","oa_version":"Accepted Version","intvolume":" 3","_id":"7467","scopus_import":"1","oa":1,"file_date_updated":"2022-08-23T08:34:17Z","isi":1,"department":[{"_id":"MaIb"}],"publisher":"American Chemical Society","date_updated":"2026-07-28T12:54:00Z","month":"03","language":[{"iso":"eng"}],"date_published":"2020-03-01T00:00:00Z"},{"citation":{"apa":"Han, H. (2020). Novel insights into PIN polarity regulation during Arabidopsis development. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8589","chicago":"Han, Huibin. “Novel Insights into PIN Polarity Regulation during Arabidopsis Development.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8589.","mla":"Han, Huibin. Novel Insights into PIN Polarity Regulation during Arabidopsis Development. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8589.","short":"H. Han, Novel Insights into PIN Polarity Regulation during Arabidopsis Development, Institute of Science and Technology Austria, 2020.","ieee":"H. Han, “Novel insights into PIN polarity regulation during Arabidopsis development,” Institute of Science and Technology Austria, 2020.","ista":"Han H. 2020. Novel insights into PIN polarity regulation during Arabidopsis development. Institute of Science and Technology Austria.","ama":"Han H. Novel insights into PIN polarity regulation during Arabidopsis development. 2020. doi:10.15479/AT:ISTA:8589"},"day":"30","status":"public","alternative_title":["ISTA Thesis"],"oa":1,"file_date_updated":"2021-10-01T13:33:02Z","department":[{"_id":"JiFr"}],"publisher":"Institute of Science and Technology Austria","date_updated":"2026-07-28T12:51:58Z","language":[{"iso":"eng"}],"month":"09","date_published":"2020-09-30T00:00:00Z","acknowledgement":"I also want to thank the China Scholarship Council for supporting my study during the year from 2015 to 2019. I also want to thank IST facilities – the Bioimaging facility, the media kitchen, the plant facility and all of the campus services, for their support.","type":"dissertation","oa_version":"Published Version","_id":"8589","file":[{"creator":"dernst","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"2020_Han_Thesis.docx","date_created":"2020-09-30T14:50:20Z","file_size":49198118,"date_updated":"2020-09-30T14:50:20Z","checksum":"c4bda1947d4c09c428ac9ce667b02327","relation":"source_file","access_level":"closed","file_id":"8590"},{"creator":"dernst","file_name":"2020_Han_Thesis.pdf","content_type":"application/pdf","date_created":"2020-09-30T14:49:59Z","file_size":15513963,"date_updated":"2021-10-01T13:33:02Z","checksum":"3f4f5d1718c2230adf30639ecaf8a00b","relation":"main_file","access_level":"open_access","file_id":"8591"}],"corr_author":"1","ddc":["580"],"has_accepted_license":"1","year":"2020","date_created":"2020-09-30T14:50:51Z","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:8589","abstract":[{"lang":"eng","text":"The plant hormone auxin plays indispensable roles in plant growth and development. An essential level of regulation in auxin action is the directional auxin transport within cells. The establishment of auxin gradient in plant tissue has been attributed to local auxin biosynthesis and directional intercellular auxin transport, which both are controlled by various environmental and developmental signals. It is well established that asymmetric auxin distribution in cells is achieved by polarly localized PIN-FORMED (PIN) auxin efflux transporters. Despite the initial insights into cellular mechanisms of PIN polarization obtained from the last decades, the molecular mechanism and specific regulators mediating PIN polarization remains elusive. In this thesis, we aim to find novel players in PIN subcellular polarity regulation during Arabidopsis development. We first characterize the physiological effect of piperonylic acid (PA) on Arabidopsis hypocotyl gravitropic bending and PIN polarization. Secondly, we reveal the importance of SCFTIR1/AFB auxin signaling pathway in shoot gravitropism bending termination. In addition, we also explore the role of myosin XI complex, and actin cytoskeleton in auxin feedback regulation on PIN polarity. In Chapter 1, we give an overview of the current knowledge about PIN-mediated auxin fluxes in various plant tropic responses. In Chapter 2, we study the physiological effect of PA on shoot gravitropic bending. Our results show that PA treatment inhibits auxin-mediated PIN3 repolarization by interfering with PINOID and PIN3 phosphorylation status, ultimately leading to hyperbending hypocotyls. In Chapter 3, we provide evidence to show that the SCFTIR1/AFB nuclear auxin signaling pathway is crucial and required for auxin-mediated PIN3 repolarization and shoot gravitropic bending termination. In Chapter 4, we perform a phosphoproteomics approach and identify the motor protein Myosin XI and its binding protein, the MadB2 family, as an essential regulator of PIN polarity for auxin-canalization related developmental processes. In Chapter 5, we demonstrate the vital role of actin cytoskeleton in auxin feedback on PIN polarity by regulating PIN subcellular trafficking. Overall, the data presented in this PhD thesis brings novel insights into the PIN polar localization regulation that resulted in the (re)establishment of the polar auxin flow and gradient in response to environmental stimuli during plant development."}],"publication_status":"published","page":"164","article_processing_charge":"No","degree_awarded":"PhD","title":"Novel insights into PIN polarity regulation during Arabidopsis development","supervisor":[{"first_name":"Jiří","last_name":"Friml","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"first_name":"Huibin","last_name":"Han","full_name":"Han, Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"7643","relation":"part_of_dissertation","status":"public"}]},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}]},{"oa":1,"isi":1,"department":[{"_id":"KrPi"}],"publisher":"Springer Nature","date_updated":"2026-07-28T12:45:44Z","language":[{"iso":"eng"}],"month":"08","date_published":"2020-08-10T00:00:00Z","type":"conference","acknowledgement":"We would like to thank the anonymous reviewers for their helpful comments and suggestions. The work was initiated while the first author was in IIT Madras, India. Part of this work was done while the author was visiting the University of Warsaw. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT) and from the Foundation for Polish Science under grant TEAM/2016-1/4 founded within the UE 2014–2020 Smart Growth Operational Program. The last author was supported by the Independent Research Fund Denmark project BETHE and the Concordium Blockchain Research Center, Aarhus University, Denmark.","oa_version":"Preprint","intvolume":" 12171","_id":"8322","scopus_import":"1","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Chakraborty, Suvradip, et al. “Reverse Firewalls for Actively Secure MPCs.” Advances in Cryptology – CRYPTO 2020, vol. 12171, Springer Nature, 2020, pp. 732–62, doi:10.1007/978-3-030-56880-1_26.","chicago":"Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.” In Advances in Cryptology – CRYPTO 2020, 12171:732–62. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-56880-1_26.","apa":"Chakraborty, S., Dziembowski, S., & Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In Advances in Cryptology – CRYPTO 2020 (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-030-56880-1_26","ama":"Chakraborty S, Dziembowski S, Nielsen JB. Reverse firewalls for actively secure MPCs. In: Advances in Cryptology – CRYPTO 2020. Vol 12171. Springer Nature; 2020:732-762. doi:10.1007/978-3-030-56880-1_26","ista":"Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171, 732–762.","ieee":"S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,” in Advances in Cryptology – CRYPTO 2020, Santa Barbara, CA, United States, 2020, vol. 12171, pp. 732–762.","short":"S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762."},"ec_funded":1,"OA_type":"green","status":"public","day":"10","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz, as a method for protecting cryptographic protocols against attacks on the devices of the honest parties. In a nutshell: a reverse firewall is placed outside of a device and its goal is to “sanitize” the messages sent by it, in such a way that a malicious device cannot leak its secrets to the outside world. It is typically assumed that the cryptographic devices are attacked in a “functionality-preserving way” (i.e. informally speaking, the functionality of the protocol remains unchanged under this attacks). In their paper, Mironov and Stephens-Davidowitz construct a protocol for passively-secure two-party computations with firewalls, leaving extension of this result to stronger models as an open question.\r\nIn this paper, we address this problem by constructing a protocol for secure computation with firewalls that has two main advantages over the original protocol from Eurocrypt 2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary number n of the parties, and not just for 2). Secondly, it is secure in much stronger corruption settings, namely in the active corruption model. More precisely: we consider an adversary that can fully corrupt up to 𝑛−1 parties, while the remaining parties are corrupt in a functionality-preserving way.\r\nOur core techniques are: malleable commitments and malleable non-interactive zero-knowledge, which in particular allow us to create a novel protocol for multiparty augmented coin-tossing into the well with reverse firewalls (that is based on a protocol of Lindell from Crypto 2001)."}],"external_id":{"isi":["001415325700026"],"cryptoeprintid":["2019/1317"]},"publication_status":"published","page":"732-762","article_processing_charge":"No","cryptoeprintid":1,"title":"Reverse firewalls for actively secure MPCs","OA_place":"repository","volume":12171,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chakraborty","first_name":"Suvradip","full_name":"Chakraborty, Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425"},{"full_name":"Dziembowski, Stefan","last_name":"Dziembowski","first_name":"Stefan"},{"full_name":"Nielsen, Jesper Buus","first_name":"Jesper Buus","last_name":"Nielsen"}],"quality_controlled":"1","conference":{"start_date":"2020-08-17","name":"CRYPTO: Annual International Cryptology Conference","end_date":"2020-08-21","location":"Santa Barbara, CA, United States"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/1317"}],"year":"2020","date_created":"2020-08-30T22:01:12Z","publication":"Advances in Cryptology – CRYPTO 2020","doi":"10.1007/978-3-030-56880-1_26","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030568795"],"issn":["0302-9743"]}},{"publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","publication_identifier":{"isbn":["9781450368186"]},"doi":"10.1145/3332466.3374542","year":"2020","date_created":"2020-04-05T22:00:49Z","conference":{"start_date":"2020-02-22","name":"PPOPP: Principles and Practice of Parallel Programming","end_date":"2020-02-26","location":"San Diego, CA, United States"},"ddc":["000"],"main_file_link":[{"url":"https://doi.org/10.1145/3332466.3374542","open_access":"1"}],"quality_controlled":"1","OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Brown","first_name":"Trevor A","full_name":"Brown, Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Prokopec","first_name":"Aleksandar","full_name":"Prokopec, Aleksandar"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian"}],"title":"Non-blocking interpolation search trees with doubly-logarithmic running time","abstract":[{"lang":"eng","text":"Balanced search trees typically use key comparisons to guide their operations, and achieve logarithmic running time. By relying on numerical properties of the keys, interpolation search achieves lower search complexity and better performance. Although interpolation-based data structures were investigated in the past, their non-blocking concurrent variants have received very little attention so far.\r\nIn this paper, we propose the first non-blocking implementation of the classic interpolation search tree (IST) data structure. For arbitrary key distributions, the data structure ensures worst-case O(log n + p) amortized time for search, insertion and deletion traversals. When the input key distributions are smooth, lookups run in expected O(log log n + p) time, and insertion and deletion run in expected amortized O(log log n + p) time, where p is a bound on the number of threads. To improve the scalability of concurrent insertion and deletion, we propose a novel parallel rebuilding technique, which should be of independent interest.\r\nWe evaluate whether the theoretical improvements translate to practice by implementing the concurrent interpolation search tree, and benchmarking it on uniform and nonuniform key distributions, for dataset sizes in the millions to billions of keys. Relative to the state-of-the-art concurrent data structures, the concurrent interpolation search tree achieves performance improvements of up to 15% under high update rates, and of up to 50% under moderate update rates. Further, ISTs exhibit up to 2X less cache-misses, and consume 1.2 -- 2.6X less memory compared to the next best alternative on typical dataset sizes. We find that the results are surprisingly robust to distributional skew, which suggests that our data structure can be a promising alternative to classic concurrent search structures."}],"publication_status":"published","external_id":{"isi":["000564476500020"]},"page":"276-291","article_processing_charge":"No","day":"19","status":"public","OA_type":"free access","ec_funded":1,"project":[{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"citation":{"ieee":"T. A. Brown, A. Prokopec, and D.-A. Alistarh, “Non-blocking interpolation search trees with doubly-logarithmic running time,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, United States, 2020, pp. 276–291.","short":"T.A. Brown, A. Prokopec, D.-A. Alistarh, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–291.","ista":"Brown TA, Prokopec A, Alistarh D-A. 2020. Non-blocking interpolation search trees with doubly-logarithmic running time. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPOPP: Principles and Practice of Parallel Programming, 276–291.","ama":"Brown TA, Prokopec A, Alistarh D-A. Non-blocking interpolation search trees with doubly-logarithmic running time. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2020:276-291. doi:10.1145/3332466.3374542","apa":"Brown, T. A., Prokopec, A., & Alistarh, D.-A. (2020). Non-blocking interpolation search trees with doubly-logarithmic running time. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 276–291). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3332466.3374542","chicago":"Brown, Trevor A, Aleksandar Prokopec, and Dan-Adrian Alistarh. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 276–91. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374542.","mla":"Brown, Trevor A., et al. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–91, doi:10.1145/3332466.3374542."},"_id":"7636","scopus_import":"1","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union Horizon 2020 research and innovation program, grant agreement No 805223, ERC Starting Grant ScaleML. We acknowledge the support of the Natural Sciences and\r\nEngineering Research Council of Canada (NSERC). ","type":"conference","oa_version":"Published Version","publisher":"Association for Computing Machinery","department":[{"_id":"DaAl"}],"date_updated":"2026-07-28T12:49:59Z","language":[{"iso":"eng"}],"month":"02","date_published":"2020-02-19T00:00:00Z","oa":1,"isi":1}]