[{"date_published":"2021-06-02T00:00:00Z","alternative_title":["LIPIcs"],"ddc":["004","516"],"author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","last_name":"Heiss","full_name":"Heiss, Teresa","first_name":"Teresa","orcid":"0000-0002-1780-2689"},{"full_name":" Kurlin , Vitaliy","last_name":" Kurlin ","first_name":"Vitaliy"},{"last_name":"Smith","full_name":"Smith, Philip","first_name":"Philip"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","first_name":"Mathijs","orcid":"0000-0002-7472-2220"}],"project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"grant_number":"I4887","name":"Persistent Homology, Algorithms and Stochastic Geometry","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316"},{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Synaptic communication in neuronal microcircuits","grant_number":"Z00312"},{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"date_updated":"2026-04-07T12:54:09Z","language":[{"iso":"eng"}],"conference":{"location":"Virtual","name":"SoCG: Symposium on Computational Geometry","end_date":"2021-06-11","start_date":"2021-06-07"},"month":"06","scopus_import":"1","oa_version":"Published Version","has_accepted_license":"1","doi":"10.4230/LIPIcs.SoCG.2021.32","publication_identifier":{"issn":["1868-8969"]},"acknowledgement":"The authors thank Janos Pach for insightful discussions on the topic of thispaper, Morteza Saghafian for finding the one-dimensional counterexample mentioned in Section 5,and Larry Andrews for generously sharing his crystallographic perspective.","license":"https://creativecommons.org/licenses/by/4.0/","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"HeEd"}],"publication_status":"published","file":[{"date_created":"2021-04-22T08:08:14Z","file_name":"df_socg_final_version.pdf","content_type":"application/pdf","relation":"main_file","date_updated":"2021-04-22T08:08:14Z","success":1,"creator":"mwintrae","file_size":3117435,"checksum":"1787baef1523d6d93753b90d0c109a6d","access_level":"open_access","file_id":"9346"}],"_id":"9345","intvolume":"       189","abstract":[{"lang":"eng","text":"Modeling a crystal as a periodic point set, we present a fingerprint consisting of density functionsthat facilitates the efficient search for new materials and material properties. We prove invarianceunder isometries, continuity, and completeness in the generic case, which are necessary featuresfor the reliable comparison of crystals. The proof of continuity integrates methods from discretegeometry and lattice theory, while the proof of generic completeness combines techniques fromgeometry with analysis. The fingerprint has a fast algorithm based on Brillouin zones and relatedinclusion-exclusion formulae. We have implemented the algorithm and describe its application tocrystal structure prediction."}],"status":"public","publication":"37th International Symposium on Computational Geometry (SoCG 2021)","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"No","type":"conference","volume":189,"page":"32:1-32:16","day":"02","date_created":"2021-04-22T08:09:58Z","year":"2021","quality_controlled":"1","oa":1,"citation":{"mla":"Edelsbrunner, Herbert, et al. “The Density Fingerprint of a Periodic Point Set.” <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>, vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 32:1-32:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.32\">10.4230/LIPIcs.SoCG.2021.32</a>.","ieee":"H. Edelsbrunner, T. Heiss, V.  Kurlin , P. Smith, and M. Wintraecken, “The density fingerprint of a periodic point set,” in <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>, Virtual, 2021, vol. 189, p. 32:1-32:16.","short":"H. Edelsbrunner, T. Heiss, V.  Kurlin , P. Smith, M. Wintraecken, in:, 37th International Symposium on Computational Geometry (SoCG 2021), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 32:1-32:16.","chicago":"Edelsbrunner, Herbert, Teresa Heiss, Vitaliy  Kurlin , Philip Smith, and Mathijs Wintraecken. “The Density Fingerprint of a Periodic Point Set.” In <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>, 189:32:1-32:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.32\">https://doi.org/10.4230/LIPIcs.SoCG.2021.32</a>.","apa":"Edelsbrunner, H., Heiss, T.,  Kurlin , V., Smith, P., &#38; Wintraecken, M. (2021). The density fingerprint of a periodic point set. In <i>37th International Symposium on Computational Geometry (SoCG 2021)</i> (Vol. 189, p. 32:1-32:16). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.32\">https://doi.org/10.4230/LIPIcs.SoCG.2021.32</a>","ista":"Edelsbrunner H, Heiss T,  Kurlin  V, Smith P, Wintraecken M. 2021. The density fingerprint of a periodic point set. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 189, 32:1-32:16.","ama":"Edelsbrunner H, Heiss T,  Kurlin  V, Smith P, Wintraecken M. The density fingerprint of a periodic point set. In: <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:32:1-32:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.32\">10.4230/LIPIcs.SoCG.2021.32</a>"},"file_date_updated":"2021-04-22T08:08:14Z","ec_funded":1,"title":"The density fingerprint of a periodic point set","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"18667"}]},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425"},{"month":"04","scopus_import":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"external_id":{"isi":["000637809600006"],"pmid":["33592180"]},"date_updated":"2026-04-07T12:59:24Z","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"date_published":"2021-04-07T00:00:00Z","author":[{"id":"358A453A-F248-11E8-B48F-1D18A9856A87","last_name":"Mlynarski","full_name":"Mlynarski, Wiktor F","first_name":"Wiktor F"},{"last_name":"Hledik","id":"4171253A-F248-11E8-B48F-1D18A9856A87","full_name":"Hledik, Michal","first_name":"Michal"},{"orcid":"0000-0002-1287-3779","first_name":"Thomas R","last_name":"Sokolowski","id":"3E999752-F248-11E8-B48F-1D18A9856A87","full_name":"Sokolowski, Thomas R"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper","last_name":"Tkačik","first_name":"Gašper","orcid":"0000-0002-6699-1455"}],"isi":1,"department":[{"_id":"GaTk"}],"acknowledgement":"The authors thank Dario Ringach for providing the V1 receptive fields and Olivier Marre for providing the retinal receptive fields. W.M. was funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 754411. M.H. was funded in part by Human Frontiers Science grant no. HFSP RGP0032/2018.","doi":"10.1016/j.neuron.2021.01.020","type":"journal_article","day":"07","page":"1227-1241.e5","volume":109,"publisher":"Cell Press","issue":"7","publication":"Neuron","article_processing_charge":"No","status":"public","abstract":[{"text":"Normative theories and statistical inference provide complementary approaches for the study of biological systems. A normative theory postulates that organisms have adapted to efficiently solve essential tasks, and proceeds to mathematically work out testable consequences of such optimality; parameters that maximize the hypothesized organismal function can be derived ab initio, without reference to experimental data. In contrast, statistical inference focuses on efficient utilization of data to learn model parameters, without reference to any a priori notion of biological function, utility, or fitness. Traditionally, these two approaches were developed independently and applied separately. Here we unify them in a coherent Bayesian framework that embeds a normative theory into a family of maximum-entropy “optimization priors.” This family defines a smooth interpolation between a data-rich inference regime (characteristic of “bottom-up” statistical models), and a data-limited ab inito prediction regime (characteristic of “top-down” normative theory). We demonstrate the applicability of our framework using data from the visual cortex, and argue that the flexibility it affords is essential to address a number of fundamental challenges relating to inference and prediction in complex, high-dimensional biological problems.","lang":"eng"}],"_id":"7553","pmid":1,"intvolume":"       109","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/848374"}],"publication_status":"published","ec_funded":1,"title":"Statistical analysis and optimality of neural systems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"15020","relation":"dissertation_contains","status":"public"}],"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/can-evolution-be-predicted/","description":"News on IST Homepage"}]},"oa":1,"citation":{"mla":"Mlynarski, Wiktor F., et al. “Statistical Analysis and Optimality of Neural Systems.” <i>Neuron</i>, vol. 109, no. 7, Cell Press, 2021, p. 1227–1241.e5, doi:<a href=\"https://doi.org/10.1016/j.neuron.2021.01.020\">10.1016/j.neuron.2021.01.020</a>.","ieee":"W. F. Mlynarski, M. Hledik, T. R. Sokolowski, and G. Tkačik, “Statistical analysis and optimality of neural systems,” <i>Neuron</i>, vol. 109, no. 7. Cell Press, p. 1227–1241.e5, 2021.","short":"W.F. Mlynarski, M. Hledik, T.R. Sokolowski, G. Tkačik, Neuron 109 (2021) 1227–1241.e5.","ama":"Mlynarski WF, Hledik M, Sokolowski TR, Tkačik G. Statistical analysis and optimality of neural systems. <i>Neuron</i>. 2021;109(7):1227-1241.e5. doi:<a href=\"https://doi.org/10.1016/j.neuron.2021.01.020\">10.1016/j.neuron.2021.01.020</a>","ista":"Mlynarski WF, Hledik M, Sokolowski TR, Tkačik G. 2021. Statistical analysis and optimality of neural systems. Neuron. 109(7), 1227–1241.e5.","apa":"Mlynarski, W. F., Hledik, M., Sokolowski, T. R., &#38; Tkačik, G. (2021). Statistical analysis and optimality of neural systems. <i>Neuron</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.neuron.2021.01.020\">https://doi.org/10.1016/j.neuron.2021.01.020</a>","chicago":"Mlynarski, Wiktor F, Michal Hledik, Thomas R Sokolowski, and Gašper Tkačik. “Statistical Analysis and Optimality of Neural Systems.” <i>Neuron</i>. Cell Press, 2021. <a href=\"https://doi.org/10.1016/j.neuron.2021.01.020\">https://doi.org/10.1016/j.neuron.2021.01.020</a>."},"year":"2021","date_created":"2020-02-28T11:00:12Z","quality_controlled":"1","corr_author":"1"},{"project":[{"name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}],"date_updated":"2026-04-07T13:01:26Z","date_published":"2021-11-04T00:00:00Z","alternative_title":["LNCS"],"author":[{"first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Benedikt","orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","full_name":"Auerbach, Benedikt","last_name":"Auerbach"},{"first_name":"Mirza Ahad","full_name":"Baig, Mirza Ahad","last_name":"Baig","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425"},{"full_name":"Cueto Noval, Miguel","last_name":"Cueto Noval","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","first_name":"Miguel","orcid":"0000-0002-2505-4246"},{"last_name":"Klein","full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen"},{"orcid":"0000-0001-8630-415X","first_name":"Guillermo","full_name":"Pascual Perez, Guillermo","last_name":"Pascual Perez","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"},{"last_name":"Walter","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","full_name":"Walter, Michael","first_name":"Michael","orcid":"0000-0003-3186-2482"}],"month":"11","scopus_import":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"conference":{"start_date":"2021-11-08","end_date":"2021-11-11","name":"TCC: Theory of Cryptography","location":"Raleigh, NC, United States"},"external_id":{"isi":["000728363700008"]},"publication_identifier":{"isbn":["9-783-0309-0455-5"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["978-3-030-90456-2"]},"acknowledgement":"B. Auerbach, M.A. Baig and K. Pietrzak—received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT); Karen Klein was supported in part by ERC CoG grant 724307 and conducted part of this work at IST Austria, funded by the ERC under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT); Guillermo Pascual-Perez was funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385; Michael Walter conducted part of this work at IST Austria, funded by the ERC under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).","doi":"10.1007/978-3-030-90456-2_8","department":[{"_id":"KrPi"}],"isi":1,"_id":"10408","intvolume":"     13044","abstract":[{"lang":"eng","text":"Key trees are often the best solution in terms of transmission cost and storage requirements for managing keys in a setting where a group needs to share a secret key, while being able to efficiently rotate the key material of users (in order to recover from a potential compromise, or to add or remove users). Applications include multicast encryption protocols like LKH (Logical Key Hierarchies) or group messaging like the current IETF proposal TreeKEM. A key tree is a (typically balanced) binary tree, where each node is identified with a key: leaf nodes hold users’ secret keys while the root is the shared group key. For a group of size N, each user just holds   log(N)  keys (the keys on the path from its leaf to the root) and its entire key material can be rotated by broadcasting   2log(N)  ciphertexts (encrypting each fresh key on the path under the keys of its parents). In this work we consider the natural setting where we have many groups with partially overlapping sets of users, and ask if we can find solutions where the cost of rotating a key is better than in the trivial one where we have a separate key tree for each group. We show that in an asymptotic setting (where the number m of groups is fixed while the number N of users grows) there exist more general key graphs whose cost converges to the cost of a single group, thus saving a factor linear in the number of groups over the trivial solution. As our asymptotic “solution” converges very slowly and performs poorly on concrete examples, we propose an algorithm that uses a natural heuristic to compute a key graph for any given group structure. Our algorithm combines two greedy algorithms, and is thus very efficient: it first converts the group structure into a “lattice graph”, which is then turned into a key graph by repeatedly applying the algorithm for constructing a Huffman code. To better understand how far our proposal is from an optimal solution, we prove lower bounds on the update cost of continuous group-key agreement and multicast encryption in a symbolic model admitting (asymmetric) encryption, pseudorandom generators, and secret sharing as building blocks."}],"status":"public","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/1158"}],"publication_status":"published","type":"conference","volume":13044,"page":"222-253","day":"04","publication":"19th International Conference","publisher":"Springer Nature","article_processing_charge":"No","oa":1,"citation":{"ieee":"J. F. Alwen <i>et al.</i>, “Grafting key trees: Efficient key management for overlapping groups,” in <i>19th International Conference</i>, Raleigh, NC, United States, 2021, vol. 13044, pp. 222–253.","short":"J.F. Alwen, B. Auerbach, M.A. Baig, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 222–253.","mla":"Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.” <i>19th International Conference</i>, vol. 13044, Springer Nature, 2021, pp. 222–53, doi:<a href=\"https://doi.org/10.1007/978-3-030-90456-2_8\">10.1007/978-3-030-90456-2_8</a>.","chicago":"Alwen, Joel F, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, and Michael Walter. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.” In <i>19th International Conference</i>, 13044:222–53. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-90456-2_8\">https://doi.org/10.1007/978-3-030-90456-2_8</a>.","apa":"Alwen, J. F., Auerbach, B., Baig, M. A., Cueto Noval, M., Klein, K., Pascual Perez, G., … Walter, M. (2021). Grafting key trees: Efficient key management for overlapping groups. In <i>19th International Conference</i> (Vol. 13044, pp. 222–253). Raleigh, NC, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-90456-2_8\">https://doi.org/10.1007/978-3-030-90456-2_8</a>","ista":"Alwen JF, Auerbach B, Baig MA, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ, Walter M. 2021. Grafting key trees: Efficient key management for overlapping groups. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13044, 222–253.","ama":"Alwen JF, Auerbach B, Baig MA, et al. Grafting key trees: Efficient key management for overlapping groups. In: <i>19th International Conference</i>. Vol 13044. Springer Nature; 2021:222-253. doi:<a href=\"https://doi.org/10.1007/978-3-030-90456-2_8\">10.1007/978-3-030-90456-2_8</a>"},"date_created":"2021-12-05T23:01:42Z","year":"2021","quality_controlled":"1","title":"Grafting key trees: Efficient key management for overlapping groups","ec_funded":1,"related_material":{"record":[{"status":"public","id":"18088","relation":"dissertation_contains"}]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"keyword":["mechanical engineering","mechanics of materials","general materials science"],"day":"29","volume":33,"type":"journal_article","article_processing_charge":"Yes (via OA deal)","publisher":"Wiley","issue":"52","publication":"Advanced Materials","status":"public","_id":"10123","abstract":[{"lang":"eng","text":"Solution synthesis of particles emerged as an alternative to prepare thermoelectric materials with less demanding processing conditions than conventional solid-state synthetic methods. However, solution synthesis generally involves the presence of additional molecules or ions belonging to the precursors or added to enable solubility and/or regulate nucleation and growth. These molecules or ions can end up in the particles as surface adsorbates and interfere in the material properties. This work demonstrates that ionic adsorbates, in particular Na⁺ ions, are electrostatically adsorbed in SnSe particles synthesized in water and play a crucial role not only in directing the material nano/microstructure but also in determining the transport properties of the consolidated material. In dense pellets prepared by sintering SnSe particles, Na remains within the crystal lattice as dopant, in dislocations, precipitates, and forming grain boundary complexions. These results highlight the importance of considering all the possible unintentional impurities to establish proper structure-property relationships and control material properties in solution-processed thermoelectric materials."}],"pmid":1,"intvolume":"        33","file":[{"access_level":"open_access","file_id":"10720","checksum":"990bccc527c64d85cf1c97885110b5f4","file_size":5595666,"date_updated":"2022-02-03T13:16:14Z","success":1,"creator":"cchlebak","date_created":"2022-02-03T13:16:14Z","file_name":"2021_AdvancedMaterials_Liu.pdf","content_type":"application/pdf","relation":"main_file"}],"publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"id":"17062","relation":"later_version","status":"public"},{"id":"12885","relation":"dissertation_contains","status":"public"}]},"title":"The importance of surface adsorbates in solution‐processed thermoelectric materials: The case of SnSe","ec_funded":1,"file_date_updated":"2022-02-03T13:16:14Z","citation":{"ista":"Liu Y, Calcabrini M, Yu Y, Genç A, Chang C, Costanzo T, Kleinhanns T, Lee S, Llorca J, Cojocaru‐Mirédin O, Ibáñez M. 2021. The importance of surface adsorbates in solution‐processed thermoelectric materials: The case of SnSe. Advanced Materials. 33(52), 2106858.","ama":"Liu Y, Calcabrini M, Yu Y, et al. The importance of surface adsorbates in solution‐processed thermoelectric materials: The case of SnSe. <i>Advanced Materials</i>. 2021;33(52). doi:<a href=\"https://doi.org/10.1002/adma.202106858\">10.1002/adma.202106858</a>","chicago":"Liu, Yu, Mariano Calcabrini, Yuan Yu, Aziz Genç, Cheng Chang, Tommaso Costanzo, Tobias Kleinhanns, et al. “The Importance of Surface Adsorbates in Solution‐processed Thermoelectric Materials: The Case of SnSe.” <i>Advanced Materials</i>. Wiley, 2021. <a href=\"https://doi.org/10.1002/adma.202106858\">https://doi.org/10.1002/adma.202106858</a>.","apa":"Liu, Y., Calcabrini, M., Yu, Y., Genç, A., Chang, C., Costanzo, T., … Ibáñez, M. (2021). The importance of surface adsorbates in solution‐processed thermoelectric materials: The case of SnSe. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.202106858\">https://doi.org/10.1002/adma.202106858</a>","mla":"Liu, Yu, et al. “The Importance of Surface Adsorbates in Solution‐processed Thermoelectric Materials: The Case of SnSe.” <i>Advanced Materials</i>, vol. 33, no. 52, 2106858, Wiley, 2021, doi:<a href=\"https://doi.org/10.1002/adma.202106858\">10.1002/adma.202106858</a>.","ieee":"Y. Liu <i>et al.</i>, “The importance of surface adsorbates in solution‐processed thermoelectric materials: The case of SnSe,” <i>Advanced Materials</i>, vol. 33, no. 52. Wiley, 2021.","short":"Y. Liu, M. Calcabrini, Y. Yu, A. Genç, C. Chang, T. Costanzo, T. Kleinhanns, S. Lee, J. Llorca, O. Cojocaru‐Mirédin, M. Ibáñez, Advanced Materials 33 (2021)."},"oa":1,"article_type":"original","corr_author":"1","quality_controlled":"1","year":"2021","date_created":"2021-10-11T20:07:24Z","has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","month":"12","external_id":{"isi":["000709899300001"],"pmid":["34626034"]},"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"language":[{"iso":"eng"}],"date_updated":"2026-04-07T13:26:13Z","project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"grant_number":"M02889","name":"Bottom-up Engineering for Thermoelectric Applications","_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A"},{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"author":[{"orcid":"0000-0001-7313-6740","first_name":"Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","full_name":"Liu, Yu","last_name":"Liu"},{"first_name":"Mariano","orcid":"0000-0003-4566-5877","last_name":"Calcabrini","full_name":"Calcabrini, Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Yu","full_name":"Yu, Yuan","first_name":"Yuan"},{"first_name":"Aziz","full_name":"Genç, Aziz","last_name":"Genç"},{"last_name":"Chang","full_name":"Chang, Cheng","id":"9E331C2E-9F27-11E9-AE48-5033E6697425","orcid":"0000-0002-9515-4277","first_name":"Cheng"},{"id":"D93824F4-D9BA-11E9-BB12-F207E6697425","last_name":"Costanzo","full_name":"Costanzo, Tommaso","orcid":"0000-0001-9732-3815","first_name":"Tommaso"},{"last_name":"Kleinhanns","id":"8BD9DE16-AB3C-11E9-9C8C-2A03E6697425","full_name":"Kleinhanns, Tobias","orcid":"0000-0003-1537-7436","first_name":"Tobias"},{"full_name":"Lee, Seungho","last_name":"Lee","id":"BB243B88-D767-11E9-B658-BC13E6697425","orcid":"0000-0002-6962-8598","first_name":"Seungho"},{"full_name":"Llorca, Jordi","last_name":"Llorca","first_name":"Jordi"},{"first_name":"Oana","last_name":"Cojocaru‐Mirédin","full_name":"Cojocaru‐Mirédin, Oana"},{"full_name":"Ibáñez, Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria"}],"ddc":["620"],"date_published":"2021-12-29T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"department":[{"_id":"EM-Fac"},{"_id":"MaIb"}],"article_number":"2106858","acknowledgement":"Y.L. and M.C. contributed equally to this work. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Electron Microscopy Facility (EMF) and the Nanofabrication Facility (NNF). This work was financially supported by IST Austria and the Werner Siemens Foundation. Y.L. acknowledges funding from the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 754411. M.C. has received funding from the European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 665385. Y.Y. and O.C.-M. acknowledge the financial support from DFG within the project SFB 917: Nanoswitches. J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia program. C.C. acknowledges funding from the FWF “Lise Meitner Fellowship” grant agreement M 2889-N.","publication_identifier":{"eissn":["1521-4095"],"issn":["0935-9648"]},"doi":"10.1002/adma.202106858"},{"file_date_updated":"2022-03-02T15:33:18Z","title":"Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate","ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"12885","status":"public"}],"link":[{"url":"https://doi.org/10.26434/chemrxiv-2021-cn2fr","relation":"earlier_version"}]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2022-03-02T15:24:16Z","year":"2021","corr_author":"1","quality_controlled":"1","article_type":"original","oa":1,"citation":{"chicago":"Calcabrini, Mariano, Dietger Van den Eynden, Sergi Sanchez Ribot, Rohan Pokratath, Jordi Llorca, Jonathan De Roo, and Maria Ibáñez. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>.","apa":"Calcabrini, M., Van den Eynden, D., Sanchez Ribot, S., Pokratath, R., Llorca, J., De Roo, J., &#38; Ibáñez, M. (2021). Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>","ista":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, Pokratath R, Llorca J, De Roo J, Ibáñez M. 2021. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. JACS Au. 1(11), 1898–1903.","ama":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, et al. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. 2021;1(11):1898-1903. doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>","short":"M. Calcabrini, D. Van den Eynden, S. Sanchez Ribot, R. Pokratath, J. Llorca, J. De Roo, M. Ibáñez, JACS Au 1 (2021) 1898–1903.","ieee":"M. Calcabrini <i>et al.</i>, “Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate,” <i>JACS Au</i>, vol. 1, no. 11. American Chemical Society, pp. 1898–1903, 2021.","mla":"Calcabrini, Mariano, et al. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>, vol. 1, no. 11, American Chemical Society, 2021, pp. 1898–903, doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>."},"issue":"11","publication":"JACS Au","publisher":"American Chemical Society","article_processing_charge":"Yes (via OA deal)","type":"journal_article","volume":1,"keyword":["general medicine"],"page":"1898-1903","day":"22","publication_status":"published","file":[{"access_level":"open_access","file_id":"10807","checksum":"1c66a35369e911312a359111420318a9","file_size":1257973,"date_updated":"2022-03-02T15:33:18Z","creator":"cchlebak","success":1,"file_name":"2021_JACSAu_Calcabrini.pdf","date_created":"2022-03-02T15:33:18Z","content_type":"application/pdf","relation":"main_file"}],"_id":"10806","intvolume":"         1","abstract":[{"text":"Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’ chemical reactivity and electronic structure. Surface chemistry is thus crucial to understand nanocrystal properties and functionality. Here, we investigate the synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals are capped exclusively with a fatty acid instead of oleylamine. Analysis of the reaction mixtures with nuclear magnetic resonance spectroscopy revealed several reaction byproducts and intermediates that are common to the decomposition of Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive surface chemistry.","lang":"eng"}],"status":"public","department":[{"_id":"MaIb"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"doi":"10.1021/jacsau.1c00349","publication_identifier":{"issn":["2691-3704"],"eissn":["2691-3704"]},"acknowledgement":"This work was financially supported by IST Austria and the Werner Siemens Foundation. M.C. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. The work was also financially supported by University of Basel, SNSF NCCR Molecular Systems Engineering (project number: 182895) and SNSF R’equip (project number: 189622). J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia program and MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128 projects.","language":[{"iso":"eng"}],"month":"11","oa_version":"Published Version","scopus_import":"1","has_accepted_license":"1","date_published":"2021-11-22T00:00:00Z","ddc":["540"],"author":[{"orcid":"0000-0003-4566-5877","first_name":"Mariano","last_name":"Calcabrini","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","full_name":"Calcabrini, Mariano"},{"last_name":"Van den Eynden","full_name":"Van den Eynden, Dietger","first_name":"Dietger"},{"first_name":"Sergi","id":"ddae5a59-f6e0-11ea-865d-d9dc61e77a2a","last_name":"Sanchez Ribot","full_name":"Sanchez Ribot, Sergi"},{"full_name":"Pokratath, Rohan","last_name":"Pokratath","first_name":"Rohan"},{"first_name":"Jordi","full_name":"Llorca, Jordi","last_name":"Llorca"},{"last_name":"De Roo","full_name":"De Roo, Jonathan","first_name":"Jonathan"},{"last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","first_name":"Maria"}],"project":[{"grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"},{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"date_updated":"2026-04-07T13:26:13Z"},{"acknowledgement":"M.C. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. ICN2\r\nacknowledges funding from Generalitat de Catalunya 2017 SGR 327. ICN2 is supported by the Severo Ochoa program from Spanish MINECO (Grant No. SEV-2017-0706) and is funded by the CERCA Programme/Generalitat de Catalunya. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 823717 − ESTEEM3. M.V.K. acknowledges the support by the European Research Council under the Horizon 2020 Framework Program (ERC Consolidator Grant SCALEHALO\r\nGrant Agreement No. 819740) and by FET-OPEN project no. 862656 (DROP-IT).","publication_identifier":{"eissn":["2380-8195"]},"doi":"10.1021/acsenergylett.0c02448","department":[{"_id":"MaIb"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"date_updated":"2026-04-07T13:26:13Z","project":[{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"author":[{"orcid":"0000-0003-4566-5877","first_name":"Mariano","full_name":"Calcabrini, Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","last_name":"Calcabrini"},{"full_name":"Genc, Aziz","last_name":"Genc","first_name":"Aziz"},{"first_name":"Yu","orcid":"0000-0001-7313-6740","last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","full_name":"Liu, Yu"},{"full_name":"Kleinhanns, Tobias","id":"8BD9DE16-AB3C-11E9-9C8C-2A03E6697425","last_name":"Kleinhanns","first_name":"Tobias","orcid":"0000-0003-1537-7436"},{"first_name":"Seungho","orcid":"0000-0002-6962-8598","full_name":"Lee, Seungho","id":"BB243B88-D767-11E9-B658-BC13E6697425","last_name":"Lee"},{"full_name":"Dirin, Dmitry N.","last_name":"Dirin","first_name":"Dmitry N."},{"last_name":"Akkerman","full_name":"Akkerman, Quinten A.","first_name":"Quinten A."},{"first_name":"Maksym V.","last_name":"Kovalenko","full_name":"Kovalenko, Maksym V."},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"}],"ddc":["540"],"date_published":"2021-01-20T00:00:00Z","has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","month":"01","external_id":{"pmid":["33614964"],"isi":["000619803400036"]},"language":[{"iso":"eng"}],"citation":{"short":"M. Calcabrini, A. Genc, Y. Liu, T. Kleinhanns, S. Lee, D.N. Dirin, Q.A. Akkerman, M.V. Kovalenko, J. Arbiol, M. Ibáñez, ACS Energy Letters 6 (2021) 581–587.","ieee":"M. Calcabrini <i>et al.</i>, “Exploiting the lability of metal halide perovskites for doping semiconductor nanocomposites,” <i>ACS Energy Letters</i>, vol. 6, no. 2. American Chemical Society, pp. 581–587, 2021.","mla":"Calcabrini, Mariano, et al. “Exploiting the Lability of Metal Halide Perovskites for Doping Semiconductor Nanocomposites.” <i>ACS Energy Letters</i>, vol. 6, no. 2, American Chemical Society, 2021, pp. 581–87, doi:<a href=\"https://doi.org/10.1021/acsenergylett.0c02448\">10.1021/acsenergylett.0c02448</a>.","ama":"Calcabrini M, Genc A, Liu Y, et al. Exploiting the lability of metal halide perovskites for doping semiconductor nanocomposites. <i>ACS Energy Letters</i>. 2021;6(2):581-587. doi:<a href=\"https://doi.org/10.1021/acsenergylett.0c02448\">10.1021/acsenergylett.0c02448</a>","ista":"Calcabrini M, Genc A, Liu Y, Kleinhanns T, Lee S, Dirin DN, Akkerman QA, Kovalenko MV, Arbiol J, Ibáñez M. 2021. Exploiting the lability of metal halide perovskites for doping semiconductor nanocomposites. ACS Energy Letters. 6(2), 581–587.","apa":"Calcabrini, M., Genc, A., Liu, Y., Kleinhanns, T., Lee, S., Dirin, D. N., … Ibáñez, M. (2021). Exploiting the lability of metal halide perovskites for doping semiconductor nanocomposites. <i>ACS Energy Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsenergylett.0c02448\">https://doi.org/10.1021/acsenergylett.0c02448</a>","chicago":"Calcabrini, Mariano, Aziz Genc, Yu Liu, Tobias Kleinhanns, Seungho Lee, Dmitry N. Dirin, Quinten A. Akkerman, Maksym V. Kovalenko, Jordi Arbiol, and Maria Ibáñez. “Exploiting the Lability of Metal Halide Perovskites for Doping Semiconductor Nanocomposites.” <i>ACS Energy Letters</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/acsenergylett.0c02448\">https://doi.org/10.1021/acsenergylett.0c02448</a>."},"oa":1,"article_type":"original","quality_controlled":"1","year":"2021","date_created":"2021-02-14T23:01:14Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"12885","relation":"dissertation_contains","status":"public"}]},"ec_funded":1,"title":"Exploiting the lability of metal halide perovskites for doping semiconductor nanocomposites","file_date_updated":"2021-02-17T07:36:52Z","status":"public","pmid":1,"_id":"9118","abstract":[{"text":"Cesium lead halides have intrinsically unstable crystal lattices and easily transform within perovskite and nonperovskite structures. In this work, we explore the conversion of the perovskite CsPbBr3 into Cs4PbBr6 in the presence of PbS at 450 °C to produce doped nanocrystal-based composites with embedded Cs4PbBr6 nanoprecipitates. We show that PbBr2 is extracted from CsPbBr3 and diffuses into the PbS lattice with a consequent increase in the concentration of free charge carriers. This new doping strategy enables the adjustment of the density of charge carriers between 1019 and 1020 cm–3, and it may serve as a general strategy for doping other nanocrystal-based semiconductors.","lang":"eng"}],"intvolume":"         6","file":[{"file_name":"2021_ACSEnergyLetters_Calcabrini.pdf","date_created":"2021-02-17T07:36:52Z","content_type":"application/pdf","relation":"main_file","date_updated":"2021-02-17T07:36:52Z","creator":"dernst","success":1,"checksum":"6fa7374bf8b95fdfe6e6c595322a6689","file_size":5071201,"access_level":"open_access","file_id":"9155"}],"publication_status":"published","page":"581-587","day":"20","volume":6,"type":"journal_article","article_processing_charge":"Yes (via OA deal)","publisher":"American Chemical Society","issue":"2","publication":"ACS Energy Letters"},{"date_published":"2021-07-02T00:00:00Z","author":[{"last_name":"Valentini","id":"C0BB2FAC-D767-11E9-B658-BC13E6697425","full_name":"Valentini, Marco","first_name":"Marco"},{"full_name":"Peñaranda, Fernando","last_name":"Peñaranda","first_name":"Fernando"},{"full_name":"Hofmann, Andrea C","id":"340F461A-F248-11E8-B48F-1D18A9856A87","last_name":"Hofmann","first_name":"Andrea C"},{"full_name":"Brauns, Matthias","last_name":"Brauns","id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias"},{"last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","first_name":"Robert"},{"first_name":"Peter","last_name":"Krogstrup","full_name":"Krogstrup, Peter"},{"first_name":"Pablo","last_name":"San-Jose","full_name":"San-Jose, Pablo"},{"first_name":"Elsa","last_name":"Prada","full_name":"Prada, Elsa"},{"full_name":"Aguado, Ramón","last_name":"Aguado","first_name":"Ramón"},{"last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","first_name":"Georgios"}],"date_updated":"2026-04-07T13:27:22Z","project":[{"_id":"262116AA-B435-11E9-9278-68D0E5697425","name":"Hybrid Semiconductor - Superconductor Quantum Devices"},{"grant_number":"844511","name":"Majorana bound states in Ge/SiGe heterostructures","_id":"26A151DA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2008.02348"],"pmid":["34210881"],"isi":["000677843100034"]},"month":"07","scopus_import":"1","oa_version":"Submitted Version","doi":"10.1126/science.abf1513","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"acknowledgement":"The authors thank A. Higginbotham, E. J. H. Lee and F. R. Martins for helpful discussions. This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility; the NOMIS Foundation and Microsoft; the European Union’s Horizon 2020 research and innovation program under the Marie SklodowskaCurie grant agreement No 844511; the FETOPEN Grant Agreement No. 828948; the European Research Commission through the grant agreement HEMs-DAM No 716655; the Spanish Ministry of Science and Innovation through Grants PGC2018-097018-B-I00, PCI2018-093026, FIS2016-80434-P (AEI/FEDER, EU), RYC2011-09345 (Ram´on y Cajal Programme), and the Mar´ıa de Maeztu Programme for Units of Excellence in R&D (CEX2018-000805-M); the CSIC Research Platform on Quantum Technologies PTI-001.","article_number":"82-88","isi":1,"department":[{"_id":"GeKa"},{"_id":"Bio"}],"arxiv":1,"publication_status":"published","status":"public","intvolume":"       373","_id":"8910","abstract":[{"lang":"eng","text":"A semiconducting nanowire fully wrapped by a superconducting shell has been proposed as a platform for obtaining Majorana modes at small magnetic fields. In this study, we demonstrate that the appearance of subgap states in such structures is actually governed by the junction region in tunneling spectroscopy measurements and not the full-shell nanowire itself. Short tunneling regions never show subgap states, whereas longer junctions always do. This can be understood in terms of quantum dots forming in the junction and hosting Andreev levels in the Yu-Shiba-Rusinov regime. The intricate magnetic field dependence of the Andreev levels, through both the Zeeman and Little-Parks effects, may result in robust zero-bias peaks—features that could be easily misinterpreted as originating from Majorana zero modes but are unrelated to topological superconductivity."}],"pmid":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2008.02348"}],"publisher":"American Association for the Advancement of Science","issue":"6550","publication":"Science","article_processing_charge":"No","type":"journal_article","day":"02","volume":373,"year":"2021","date_created":"2020-12-02T10:51:52Z","article_type":"original","quality_controlled":"1","oa":1,"citation":{"short":"M. Valentini, F. Peñaranda, A.C. Hofmann, M. Brauns, R. Hauschild, P. Krogstrup, P. San-Jose, E. Prada, R. Aguado, G. Katsaros, Science 373 (2021).","ieee":"M. Valentini <i>et al.</i>, “Nontopological zero-bias peaks in full-shell nanowires induced by flux-tunable Andreev states,” <i>Science</i>, vol. 373, no. 6550. American Association for the Advancement of Science, 2021.","mla":"Valentini, Marco, et al. “Nontopological Zero-Bias Peaks in Full-Shell Nanowires Induced by Flux-Tunable Andreev States.” <i>Science</i>, vol. 373, no. 6550, 82–88, American Association for the Advancement of Science, 2021, doi:<a href=\"https://doi.org/10.1126/science.abf1513\">10.1126/science.abf1513</a>.","chicago":"Valentini, Marco, Fernando Peñaranda, Andrea C Hofmann, Matthias Brauns, Robert Hauschild, Peter Krogstrup, Pablo San-Jose, Elsa Prada, Ramón Aguado, and Georgios Katsaros. “Nontopological Zero-Bias Peaks in Full-Shell Nanowires Induced by Flux-Tunable Andreev States.” <i>Science</i>. American Association for the Advancement of Science, 2021. <a href=\"https://doi.org/10.1126/science.abf1513\">https://doi.org/10.1126/science.abf1513</a>.","apa":"Valentini, M., Peñaranda, F., Hofmann, A. C., Brauns, M., Hauschild, R., Krogstrup, P., … Katsaros, G. (2021). Nontopological zero-bias peaks in full-shell nanowires induced by flux-tunable Andreev states. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abf1513\">https://doi.org/10.1126/science.abf1513</a>","ista":"Valentini M, Peñaranda F, Hofmann AC, Brauns M, Hauschild R, Krogstrup P, San-Jose P, Prada E, Aguado R, Katsaros G. 2021. Nontopological zero-bias peaks in full-shell nanowires induced by flux-tunable Andreev states. Science. 373(6550), 82–88.","ama":"Valentini M, Peñaranda F, Hofmann AC, et al. Nontopological zero-bias peaks in full-shell nanowires induced by flux-tunable Andreev states. <i>Science</i>. 2021;373(6550). doi:<a href=\"https://doi.org/10.1126/science.abf1513\">10.1126/science.abf1513</a>"},"title":"Nontopological zero-bias peaks in full-shell nanowires induced by flux-tunable Andreev states","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"9389","relation":"research_data","status":"public"},{"id":"13286","relation":"dissertation_contains","status":"public"}],"link":[{"url":"https://ist.ac.at/en/news/unfinding-a-split-electron/","relation":"press_release","description":"News on IST Homepage"}]}},{"date_published":"2021-11-10T00:00:00Z","alternative_title":["LNCS"],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Ehsan","orcid":"0000-0002-8595-0587","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","last_name":"Kafshdar Goharshadi","full_name":"Kafshdar Goharshadi, Ehsan"},{"first_name":"Petr","last_name":"Novotný","full_name":"Novotný, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jiří","last_name":"Zárevúcky","full_name":"Zárevúcky, Jiří"},{"full_name":"Zikelic, Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","first_name":"Dorde"}],"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"date_updated":"2026-04-07T13:27:55Z","language":[{"iso":"eng"}],"conference":{"location":"Virtual","name":"FM: Formal Methods","end_date":"2021-11-26","start_date":"2021-11-20"},"external_id":{"isi":["000758218600033"],"arxiv":["2108.02188"]},"month":"11","oa_version":"Preprint","scopus_import":"1","doi":"10.1007/978-3-030-90870-6_33","publication_identifier":{"eissn":["1611-3349"],"isbn":["9-783-0309-0869-0"],"eisbn":["978-3-030-90870-6"],"issn":["0302-9743"]},"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt), the Czech Science Foundation grant No. GJ19-15134Y, and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","isi":1,"department":[{"_id":"KrCh"}],"arxiv":1,"publication_status":"published","_id":"10414","intvolume":"     13047","abstract":[{"text":"We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in LexRSM not existing even for simple terminating programs. Our contributions are twofold: First, we introduce a generalization of LexRSMs which allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs.","lang":"eng"}],"status":"public","main_file_link":[{"url":"https://arxiv.org/abs/2108.02188","open_access":"1"}],"publication":"24th International Symposium on Formal Methods","publisher":"Springer Nature","article_processing_charge":"No","type":"conference","volume":13047,"day":"10","page":"619-639","date_created":"2021-12-05T23:01:45Z","year":"2021","quality_controlled":"1","oa":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” <i>24th International Symposium on Formal Methods</i>, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:<a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">10.1007/978-3-030-90870-6_33</a>.","ieee":"K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in <i>24th International Symposium on Formal Methods</i>, Virtual, 2021, vol. 13047, pp. 619–639.","short":"K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:, 24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” In <i>24th International Symposium on Formal Methods</i>, 13047:619–39. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">https://doi.org/10.1007/978-3-030-90870-6_33</a>.","apa":"Chatterjee, K., Goharshady, E., Novotný, P., Zárevúcky, J., &#38; Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In <i>24th International Symposium on Formal Methods</i> (Vol. 13047, pp. 619–639). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">https://doi.org/10.1007/978-3-030-90870-6_33</a>","ista":"Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. 2021. On lexicographic proof rules for probabilistic termination. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.","ama":"Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. In: <i>24th International Symposium on Formal Methods</i>. Vol 13047. Springer Nature; 2021:619-639. doi:<a href=\"https://doi.org/10.1007/978-3-030-90870-6_33\">10.1007/978-3-030-90870-6_33</a>"},"title":"On lexicographic proof rules for probabilistic termination","ec_funded":1,"related_material":{"record":[{"relation":"later_version","id":"14778","status":"public"},{"status":"public","relation":"dissertation_contains","id":"14539"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"type":"conference","day":"01","page":"1033-1048","publisher":"Association for Computing Machinery","publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","article_processing_charge":"No","status":"public","abstract":[{"text":"We present a new approach to proving non-termination of non-deterministic integer programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal of the program's transition system followed by a constraint-based invariant synthesis with constraints coming from both the original and the reversed transition system. The latter task is performed by a simple call to an off-the-shelf SMT-solver, which allows us to leverage the latest advances in SMT-solving. Moreover, our method offers a combination of features not present (as a whole) in previous approaches: it handles programs with non-determinism, provides relative completeness guarantees and supports programs with polynomial arithmetic. The experiments performed with our prototype tool RevTerm show that our approach, despite its simplicity and stronger theoretical guarantees, is at least on par with the state-of-the-art tools, often achieving a non-trivial improvement under a proper configuration of its parameters.","lang":"eng"}],"_id":"9644","main_file_link":[{"url":"https://arxiv.org/abs/2104.01189","open_access":"1"}],"arxiv":1,"publication_status":"published","ec_funded":1,"title":"Proving non-termination by program reversal","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"status":"public","id":"15284","relation":"research_data"},{"relation":"dissertation_contains","id":"14539","status":"public"}]},"oa":1,"citation":{"apa":"Chatterjee, K., Goharshady, E. K., Novotný, P., &#38; Zikelic, D. (2021). Proving non-termination by program reversal. In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i> (pp. 1033–1048). Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3453483.3454093\">https://doi.org/10.1145/3453483.3454093</a>","chicago":"Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “Proving Non-Termination by Program Reversal.” In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, 1033–48. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3453483.3454093\">https://doi.org/10.1145/3453483.3454093</a>.","ama":"Chatterjee K, Goharshady EK, Novotný P, Zikelic D. Proving non-termination by program reversal. In: <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2021:1033-1048. doi:<a href=\"https://doi.org/10.1145/3453483.3454093\">10.1145/3453483.3454093</a>","ista":"Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. Proving non-termination by program reversal. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 1033–1048.","ieee":"K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination by program reversal,” in <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Online, 2021, pp. 1033–1048.","mla":"Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.” <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2021, pp. 1033–48, doi:<a href=\"https://doi.org/10.1145/3453483.3454093\">10.1145/3453483.3454093</a>.","short":"K. Chatterjee, E.K. Goharshady, P. Novotný, D. Zikelic, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–1048."},"year":"2021","date_created":"2021-07-11T22:01:17Z","quality_controlled":"1","month":"06","oa_version":"Preprint","scopus_import":"1","conference":{"start_date":"2021-06-20","end_date":"2021-06-26","name":"PLDI: Programming Language Design and Implementation","location":"Online"},"language":[{"iso":"eng"}],"external_id":{"isi":["000723661700067"],"arxiv":["2104.01189"]},"project":[{"grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"date_updated":"2026-04-07T13:27:55Z","date_published":"2021-06-01T00:00:00Z","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar","first_name":"Ehsan Kafshdar"},{"first_name":"Petr","full_name":"Novotný, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný"},{"first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde"}],"isi":1,"department":[{"_id":"KrCh"}],"publication_identifier":{"isbn":["9781450383912"]},"acknowledgement":"We thank the anonymous reviewers for their helpful comments. This research was partially supported by the ERCCoG 863818 (ForM-SMArt) and the Czech Science Foundation grant No. GJ19-15134Y.","doi":"10.1145/3453483.3454093"},{"year":"2021","date_created":"2022-06-20T12:11:53Z","quality_controlled":"1","corr_author":"1","oa":1,"citation":{"apa":"Krumes, A., Iofinova, E. B., Vladu, A., &#38; Alistarh, D.-A. (2021). AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 34, pp. 8557–8570). Virtual, Online: Neural Information Processing Systems Foundation.","chicago":"Krumes, Alexandra, Eugenia B Iofinova, Adrian Vladu, and Dan-Adrian Alistarh. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 34:8557–70. Neural Information Processing Systems Foundation, 2021.","ama":"Krumes A, Iofinova EB, Vladu A, Alistarh D-A. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 34. Neural Information Processing Systems Foundation; 2021:8557-8570.","ista":"Krumes A, Iofinova EB, Vladu A, Alistarh D-A. 2021. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 34, 8557–8570.","ieee":"A. Krumes, E. B. Iofinova, A. Vladu, and D.-A. Alistarh, “AC/DC: Alternating Compressed/DeCompressed training of deep neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 34, pp. 8557–8570.","mla":"Krumes, Alexandra, et al. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 34, Neural Information Processing Systems Foundation, 2021, pp. 8557–70.","short":"A. Krumes, E.B. Iofinova, A. Vladu, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 8557–8570."},"title":"AC/DC: Alternating Compressed/DeCompressed training of deep neural networks","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"13074","relation":"dissertation_contains"}]},"arxiv":1,"publication_status":"published","status":"public","abstract":[{"text":"The increasing computational requirements of deep neural networks (DNNs) have led to significant interest in obtaining DNN models that are sparse, yet accurate. Recent work has investigated the even harder case of sparse training, where the DNN weights are, for as much as possible, already sparse to reduce computational costs during training. Existing sparse training methods are often empirical and can have lower accuracy relative to the dense baseline. In this paper, we present a general approach called Alternating Compressed/DeCompressed (AC/DC) training of DNNs, demonstrate convergence for a variant of the algorithm, and show that AC/DC outperforms existing sparse training methods in accuracy at similar computational budgets; at high sparsity levels, AC/DC even outperforms existing methods that rely on accurate pre-trained dense models. An important property of AC/DC is that it allows co-training of dense and sparse models, yielding accurate sparse–dense model pairs at the end of the training process. This is useful in practice, where compressed variants may be desirable for deployment in resource-constrained settings without re-doing the entire training flow, and also provides us with insights into the accuracy gap between dense and compressed models. The code is available at: https://github.com/IST-DASLab/ACDC.","lang":"eng"}],"_id":"11458","intvolume":"        34","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/file/48000647b315f6f00f913caa757a70b3-Paper.pdf","open_access":"1"}],"publisher":"Neural Information Processing Systems Foundation","publication":"35th Conference on Neural Information Processing Systems","article_processing_charge":"No","type":"conference","day":"06","page":"8557-8570","volume":34,"publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), and a CNRS PEPS grant. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). We would also like to thank Christoph Lampert for his feedback on an earlier version of this work, as well as for providing hardware for the Transformer-XL experiments.","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"alternative_title":["Advances in Neural Information Processing Systems"],"date_published":"2021-12-06T00:00:00Z","author":[{"full_name":"Peste, Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87","last_name":"Peste","first_name":"Elena-Alexandra"},{"first_name":"Eugenia B","orcid":"0000-0002-7778-3221","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","last_name":"Iofinova","full_name":"Iofinova, Eugenia B"},{"full_name":"Vladu, Adrian","last_name":"Vladu","first_name":"Adrian"},{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"project":[{"grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"}],"date_updated":"2026-04-07T13:30:19Z","conference":{"location":"Virtual, Online","name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-14","start_date":"2021-12-06"},"acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2106.12379"]},"month":"12","oa_version":"Published Version","scopus_import":"1"},{"external_id":{"arxiv":["2104.04293"],"isi":["000853016800008"]},"conference":{"location":"Espoo and Helsinki, Finland","name":"2021 IFIP Networking Conference (IFIP Networking)","end_date":"2021-06-24","start_date":"2021-06-21"},"language":[{"iso":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","month":"06","author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"},{"first_name":"Iosif","last_name":"Salem","full_name":"Salem, Iosif"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"orcid":"0009-0001-3676-4809","first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","full_name":"Yeo, Michelle X"}],"date_published":"2021-06-21T00:00:00Z","date_updated":"2026-04-07T13:29:44Z","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"department":[{"_id":"KrPi"}],"isi":1,"doi":"10.23919/IFIPNetworking52078.2021.9472205","publication_identifier":{"isbn":["978-1-6654-4501-6"],"eissn":["1861-2288"],"eisbn":["978-3-9031-7639-3"]},"article_processing_charge":"No","publisher":"IEEE","day":"21","type":"conference","publication_status":"published","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2104.04293","open_access":"1"}],"status":"public","abstract":[{"text":"Payment channel networks are a promising approach to improve the scalability of cryptocurrencies: they allow to perform transactions in a peer-to-peer fashion, along multihop routes in the network, without requiring consensus on the blockchain. However, during the discovery of cost-efficient routes for the transaction, critical information may be revealed about the transacting entities. This paper initiates the study of privacy-preserving route discovery mechanisms for payment channel networks. In particular, we present LightPIR, an approach which allows a client to learn the shortest (or cheapest in terms of fees) path between two nodes without revealing any information about the endpoints of the transaction to the servers. The two main observations which allow for an efficient solution in LightPIR are that: (1) surprisingly, hub labelling algorithms – which were developed to preprocess “street network like” graphs so one can later efficiently compute shortest paths – also perform well for the graphs underlying payment channel networks, and that (2) hub labelling algorithms can be conveniently combined with private information retrieval. LightPIR relies on a simple hub labeling heuristic on top of existing hub labeling algorithms which leverages the specific topological features of cryptocurrency networks to further minimize storage and bandwidth overheads. In a case study considering the Lightning network, we show that our approach is an order of magnitude more efficient compared to a privacy-preserving baseline based on using private information retrieval on a database that stores all pairs shortest paths.","lang":"eng"}],"_id":"9969","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"relation":"dissertation_contains","id":"14506","status":"public"}]},"title":"LightPIR: Privacy-preserving route discovery for payment channel networks","ec_funded":1,"quality_controlled":"1","year":"2021","date_created":"2021-08-29T22:01:16Z","citation":{"ama":"Pietrzak KZ, Salem I, Schmid S, Yeo MX. LightPIR: Privacy-preserving route discovery for payment channel networks. In: IEEE; 2021. doi:<a href=\"https://doi.org/10.23919/IFIPNetworking52078.2021.9472205\">10.23919/IFIPNetworking52078.2021.9472205</a>","ista":"Pietrzak KZ, Salem I, Schmid S, Yeo MX. 2021. LightPIR: Privacy-preserving route discovery for payment channel networks. 2021 IFIP Networking Conference (IFIP Networking).","apa":"Pietrzak, K. Z., Salem, I., Schmid, S., &#38; Yeo, M. X. (2021). LightPIR: Privacy-preserving route discovery for payment channel networks. Presented at the 2021 IFIP Networking Conference (IFIP Networking), Espoo and Helsinki, Finland: IEEE. <a href=\"https://doi.org/10.23919/IFIPNetworking52078.2021.9472205\">https://doi.org/10.23919/IFIPNetworking52078.2021.9472205</a>","chicago":"Pietrzak, Krzysztof Z, Iosif Salem, Stefan Schmid, and Michelle X Yeo. “LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks.” IEEE, 2021. <a href=\"https://doi.org/10.23919/IFIPNetworking52078.2021.9472205\">https://doi.org/10.23919/IFIPNetworking52078.2021.9472205</a>.","mla":"Pietrzak, Krzysztof Z., et al. <i>LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks</i>. IEEE, 2021, doi:<a href=\"https://doi.org/10.23919/IFIPNetworking52078.2021.9472205\">10.23919/IFIPNetworking52078.2021.9472205</a>.","ieee":"K. Z. Pietrzak, I. Salem, S. Schmid, and M. X. Yeo, “LightPIR: Privacy-preserving route discovery for payment channel networks,” presented at the 2021 IFIP Networking Conference (IFIP Networking), Espoo and Helsinki, Finland, 2021.","short":"K.Z. Pietrzak, I. Salem, S. Schmid, M.X. Yeo, in:, IEEE, 2021."},"oa":1},{"ddc":["570"],"date_published":"2021-05-07T00:00:00Z","author":[{"first_name":"Eva L.","full_name":"Koch, Eva L.","last_name":"Koch"},{"first_name":"Hernán E.","last_name":"Morales","full_name":"Morales, Hernán E."},{"last_name":"Larsson","full_name":"Larsson, Jenny","first_name":"Jenny"},{"orcid":"0000-0003-1050-4969","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","full_name":"Westram, Anja M"},{"last_name":"Faria","full_name":"Faria, Rui","first_name":"Rui"},{"first_name":"Alan R.","full_name":"Lemmon, Alan R.","last_name":"Lemmon"},{"full_name":"Lemmon, E. Moriarty","last_name":"Lemmon","first_name":"E. Moriarty"},{"full_name":"Johannesson, Kerstin","last_name":"Johannesson","first_name":"Kerstin"},{"first_name":"Roger K.","full_name":"Butlin, Roger K.","last_name":"Butlin"}],"project":[{"grant_number":"797747","name":"Theoretical and empirical approaches to understanding Parallel Adaptation","_id":"265B41B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"date_updated":"2026-04-07T14:01:29Z","language":[{"iso":"eng"}],"external_id":{"isi":["000647846200001"]},"month":"05","has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","doi":"10.1002/evl3.227","publication_identifier":{"eissn":["2056-3744"]},"acknowledgement":"We are very grateful to Irena Senčić for technical assistance and to Michelle Kortyna and Sean Holland at the Center for Anchored Phylogenomics for assistance with data collection. RKB was funded by the Natural Environment Research Council and by the European Research Council. KJ was funded by the Swedish Research Councils VR and Formas (Linnaeus Grant: 217‐2008‐1719). JL was funded by a studentship from the Leverhulme Centre for Advanced Biological Modelling. AMW was funded by the European Union's Horizon 2020 research and innovation program under Marie Skłodowska‐Curie Grant agreement no. 797747. RF was funded by the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska‐Curie Grant agreement No. 706376 and by FEDER Funds through the Operational Competitiveness Factors Program—COMPETE and by National Funds through FCT—Foundation for Science and Technology within the scope of the project “Hybrabbid” (PTDC/BIA‐EVL/30628/2017‐ POCI‐01‐0145‐FEDER‐030628). We are grateful to other members of the Littorina research group for helpful discussions. We thank Claire Mérot and an anonymous referee for insightful comments on an earlier version. ","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"department":[{"_id":"NiBa"}],"file":[{"access_level":"open_access","file_id":"10142","checksum":"023b1608e311f0fda30593ba3d0a4e0b","file_size":3021108,"date_updated":"2021-10-15T08:26:02Z","success":1,"creator":"cchlebak","file_name":"2021_EvolutionLetters_Koch.pdf","date_created":"2021-10-15T08:26:02Z","content_type":"application/pdf","relation":"main_file"}],"publication_status":"published","status":"public","_id":"9394","abstract":[{"text":"Chromosomal inversions have long been recognized for their role in local adaptation. By suppressing recombination in heterozygous individuals, they can maintain coadapted gene complexes and protect them from homogenizing effects of gene flow. However, to fully understand their importance for local adaptation we need to know their influence on phenotypes under divergent selection. For this, the marine snail Littorina saxatilis provides an ideal study system. Divergent ecotypes adapted to wave action and crab predation occur in close proximity on intertidal shores with gene flow between them. Here, we used F2 individuals obtained from crosses between the ecotypes to test for associations between genomic regions and traits distinguishing the Crab‐/Wave‐adapted ecotypes including size, shape, shell thickness, and behavior. We show that most of these traits are influenced by two previously detected inversion regions that are divergent between ecotypes. We thus gain a better understanding of one important underlying mechanism responsible for the rapid and repeated formation of ecotypes: divergent selection acting on inversions. We also found that some inversions contributed to more than one trait suggesting that they may contain several loci involved in adaptation, consistent with the hypothesis that suppression of recombination within inversions facilitates differentiation in the presence of gene flow.","lang":"eng"}],"intvolume":"         5","publisher":"Wiley","issue":"3","publication":"Evolution Letters","article_processing_charge":"No","type":"journal_article","page":"196-213","day":"07","volume":5,"year":"2021","date_created":"2021-05-16T22:01:47Z","article_type":"original","quality_controlled":"1","oa":1,"citation":{"apa":"Koch, E. L., Morales, H. E., Larsson, J., Westram, A. M., Faria, R., Lemmon, A. R., … Butlin, R. K. (2021). Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. <i>Evolution Letters</i>. Wiley. <a href=\"https://doi.org/10.1002/evl3.227\">https://doi.org/10.1002/evl3.227</a>","chicago":"Koch, Eva L., Hernán E. Morales, Jenny Larsson, Anja M Westram, Rui Faria, Alan R. Lemmon, E. Moriarty Lemmon, Kerstin Johannesson, and Roger K. Butlin. “Genetic Variation for Adaptive Traits Is Associated with Polymorphic Inversions in Littorina Saxatilis.” <i>Evolution Letters</i>. Wiley, 2021. <a href=\"https://doi.org/10.1002/evl3.227\">https://doi.org/10.1002/evl3.227</a>.","ama":"Koch EL, Morales HE, Larsson J, et al. Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. <i>Evolution Letters</i>. 2021;5(3):196-213. doi:<a href=\"https://doi.org/10.1002/evl3.227\">10.1002/evl3.227</a>","ista":"Koch EL, Morales HE, Larsson J, Westram AM, Faria R, Lemmon AR, Lemmon EM, Johannesson K, Butlin RK. 2021. Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. Evolution Letters. 5(3), 196–213.","ieee":"E. L. Koch <i>et al.</i>, “Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis,” <i>Evolution Letters</i>, vol. 5, no. 3. Wiley, pp. 196–213, 2021.","mla":"Koch, Eva L., et al. “Genetic Variation for Adaptive Traits Is Associated with Polymorphic Inversions in Littorina Saxatilis.” <i>Evolution Letters</i>, vol. 5, no. 3, Wiley, 2021, pp. 196–213, doi:<a href=\"https://doi.org/10.1002/evl3.227\">10.1002/evl3.227</a>.","short":"E.L. Koch, H.E. Morales, J. Larsson, A.M. Westram, R. Faria, A.R. Lemmon, E.M. Lemmon, K. Johannesson, R.K. Butlin, Evolution Letters 5 (2021) 196–213."},"ec_funded":1,"title":"Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis","file_date_updated":"2021-10-15T08:26:02Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"status":"public","relation":"research_data","id":"12987"}]}},{"ddc":["570"],"date_published":"2021-04-10T00:00:00Z","author":[{"first_name":"Eva","last_name":"Koch","full_name":"Koch, Eva"},{"first_name":"Hernán E.","full_name":"Morales, Hernán E.","last_name":"Morales"},{"last_name":"Larsson","full_name":"Larsson, Jenny","first_name":"Jenny"},{"first_name":"Anja M","orcid":"0000-0003-1050-4969","last_name":"Westram","id":"3C147470-F248-11E8-B48F-1D18A9856A87","full_name":"Westram, Anja M"},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"},{"first_name":"Alan R.","last_name":"Lemmon","full_name":"Lemmon, Alan R."},{"last_name":"Lemmon","full_name":"Lemmon, E. Moriarty","first_name":"E. Moriarty"},{"first_name":"Kerstin","last_name":"Johannesson","full_name":"Johannesson, Kerstin"},{"full_name":"Butlin, Roger K.","last_name":"Butlin","first_name":"Roger K."}],"status":"public","date_updated":"2026-04-07T14:01:30Z","OA_place":"publisher","_id":"12987","abstract":[{"text":"Chromosomal inversion polymorphisms, segments of chromosomes that are flipped in orientation and occur in reversed order in some individuals, have long been recognized to play an important role in local adaptation. They can reduce recombination in heterozygous individuals and thus help to maintain sets of locally adapted alleles. In a wide range of organisms, populations adapted to different habitats differ in frequency of inversion arrangements. However, getting a full understanding of the importance of inversions for adaptation requires confirmation of their influence on traits under divergent selection. Here, we studied a marine snail, Littorina saxatilis, that has evolved ecotypes adapted to wave exposure or crab predation. These two types occur in close proximity on different parts of the shore. Gene flow between them exists in contact zones. However, they exhibit strong phenotypic divergence in several traits under habitat-specific selection, including size, shape and behaviour. We used crosses between these ecotypes to identify genomic regions that explain variation in these traits by using QTL analysis and variance partitioning across linkage groups. We could show that previously detected inversion regions contribute to adaptive divergence. Some inversions influenced multiple traits suggesting that they contain sets of locally adaptive alleles. Our study also identified regions without known inversions that are important for phenotypic divergence. Thus, we provide a more complete overview of the importance of inversions in relation to the remaining genome.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.5061/dryad.zgmsbccb4","open_access":"1"}],"publisher":"Dryad","article_processing_charge":"No","type":"research_data_reference","month":"04","day":"10","has_accepted_license":"1","oa_version":"Published Version","year":"2021","doi":"10.5061/DRYAD.ZGMSBCCB4","date_created":"2023-05-16T12:34:09Z","oa":1,"license":"https://creativecommons.org/publicdomain/zero/1.0/","citation":{"apa":"Koch, E., Morales, H. E., Larsson, J., Westram, A. M., Faria, R., Lemmon, A. R., … Butlin, R. K. (2021). Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">https://doi.org/10.5061/DRYAD.ZGMSBCCB4</a>","chicago":"Koch, Eva, Hernán E. Morales, Jenny Larsson, Anja M Westram, Rui Faria, Alan R. Lemmon, E. Moriarty Lemmon, Kerstin Johannesson, and Roger K. Butlin. “Data from: Genetic Variation for Adaptive Traits Is Associated with Polymorphic Inversions in Littorina Saxatilis.” Dryad, 2021. <a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">https://doi.org/10.5061/DRYAD.ZGMSBCCB4</a>.","ama":"Koch E, Morales HE, Larsson J, et al. Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. 2021. doi:<a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">10.5061/DRYAD.ZGMSBCCB4</a>","ista":"Koch E, Morales HE, Larsson J, Westram AM, Faria R, Lemmon AR, Lemmon EM, Johannesson K, Butlin RK. 2021. Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">10.5061/DRYAD.ZGMSBCCB4</a>.","short":"E. Koch, H.E. Morales, J. Larsson, A.M. Westram, R. Faria, A.R. Lemmon, E.M. Lemmon, K. Johannesson, R.K. Butlin, (2021).","ieee":"E. Koch <i>et al.</i>, “Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis.” Dryad, 2021.","mla":"Koch, Eva, et al. <i>Data from: Genetic Variation for Adaptive Traits Is Associated with Polymorphic Inversions in Littorina Saxatilis</i>. Dryad, 2021, doi:<a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">10.5061/DRYAD.ZGMSBCCB4</a>."},"title":"Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","tmp":{"short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"department":[{"_id":"NiBa"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"9394"}]}},{"citation":{"short":"F.N. Arslan, J. Eckert, T. Schmidt, C.-P.J. Heisenberg, Biophysical Journal 120 (2021) 4182–4192.","ieee":"F. N. Arslan, J. Eckert, T. Schmidt, and C.-P. J. Heisenberg, “Holding it together: when cadherin meets cadherin,” <i>Biophysical Journal</i>, vol. 120. Biophysical Society, pp. 4182–4192, 2021.","mla":"Arslan, Feyza N., et al. “Holding It Together: When Cadherin Meets Cadherin.” <i>Biophysical Journal</i>, vol. 120, Biophysical Society, 2021, pp. 4182–92, doi:<a href=\"https://doi.org/10.1016/j.bpj.2021.03.025\">10.1016/j.bpj.2021.03.025</a>.","chicago":"Arslan, Feyza N, Julia Eckert, Thomas Schmidt, and Carl-Philipp J Heisenberg. “Holding It Together: When Cadherin Meets Cadherin.” <i>Biophysical Journal</i>. Biophysical Society, 2021. <a href=\"https://doi.org/10.1016/j.bpj.2021.03.025\">https://doi.org/10.1016/j.bpj.2021.03.025</a>.","apa":"Arslan, F. N., Eckert, J., Schmidt, T., &#38; Heisenberg, C.-P. J. (2021). Holding it together: when cadherin meets cadherin. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1016/j.bpj.2021.03.025\">https://doi.org/10.1016/j.bpj.2021.03.025</a>","ista":"Arslan FN, Eckert J, Schmidt T, Heisenberg C-PJ. 2021. Holding it together: when cadherin meets cadherin. Biophysical Journal. 120, 4182–4192.","ama":"Arslan FN, Eckert J, Schmidt T, Heisenberg C-PJ. Holding it together: when cadherin meets cadherin. <i>Biophysical Journal</i>. 2021;120:4182-4192. doi:<a href=\"https://doi.org/10.1016/j.bpj.2021.03.025\">10.1016/j.bpj.2021.03.025</a>"},"oa":1,"quality_controlled":"1","corr_author":"1","article_type":"original","date_created":"2021-04-25T22:01:30Z","year":"2021","related_material":{"record":[{"id":"12368","relation":"dissertation_contains","status":"public"}]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Holding it together: when cadherin meets cadherin","main_file_link":[{"url":"https://scholarlypublications.universiteitleiden.nl/access/item%3A3251048/view","open_access":"1"}],"pmid":1,"_id":"9350","abstract":[{"lang":"eng","text":"Intercellular adhesion is the key to multicellularity, and its malfunction plays an important role in various developmental and disease-related processes. Although it has been intensively studied by both biologists and physicists, a commonly accepted definition of cell-cell adhesion is still being debated. Cell-cell adhesion has been described at the molecular scale as a function of adhesion receptors controlling binding affinity, at the cellular scale as resistance to detachment forces or modulation of surface tension, and at the tissue scale as a regulator of cellular rearrangements and morphogenesis. In this review, we aim to summarize and discuss recent advances in the molecular, cellular, and theoretical description of cell-cell adhesion, ranging from biomimetic models to the complexity of cells and tissues in an organismal context. In particular, we will focus on cadherin-mediated cell-cell adhesion and the role of adhesion signaling and mechanosensation therein, two processes central for understanding the biological and physical basis of cell-cell adhesion."}],"intvolume":"       120","status":"public","publication_status":"published","volume":120,"day":"05","page":"4182-4192","type":"journal_article","article_processing_charge":"No","publication":"Biophysical Journal","publisher":"Biophysical Society","acknowledgement":"T.S. acknowledges funding by the research program “The Active Matter Physics of Collective Metastasis,” which is financed by the Dutch Research Council (NWO).","publication_identifier":{"eissn":["1542-0086"],"issn":["0006-3495"]},"doi":"10.1016/j.bpj.2021.03.025","department":[{"_id":"CaHe"}],"isi":1,"date_updated":"2026-04-07T14:13:19Z","author":[{"last_name":"Arslan","id":"49DA7910-F248-11E8-B48F-1D18A9856A87","full_name":"Arslan, Feyza N","first_name":"Feyza N","orcid":"0000-0001-5809-9566"},{"first_name":"Julia","last_name":"Eckert","full_name":"Eckert, Julia"},{"last_name":"Schmidt","full_name":"Schmidt, Thomas","first_name":"Thomas"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"date_published":"2021-10-05T00:00:00Z","scopus_import":"1","oa_version":"Published Version","month":"10","external_id":{"pmid":["33794149"],"isi":["000704646900006"]},"language":[{"iso":"eng"}]},{"abstract":[{"text":"We compare the Manin-type conjecture for Campana points recently formulated\r\nby Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado with an alternative\r\nprediction of Browning and Van Valckenborgh in the special case of the orbifold\r\n$(\\mathbb{P}^1,D)$, where $D =\\frac{1}{2}[0]+\\frac{1}{2}[1]+\\frac{1}{2}[\\infty]$. We find that the two predicted leading constants do not agree, and we discuss whether thin sets\r\ncould explain this discrepancy. Motivated by this, we provide a counterexample\r\nto the Manin-type conjecture for Campana points, by considering orbifolds\r\ncorresponding to squareful values of binary quadratic forms.","lang":"eng"}],"_id":"12077","date_updated":"2026-04-07T14:13:35Z","status":"public","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2104.14946","open_access":"1"}],"date_published":"2021-04-30T00:00:00Z","arxiv":1,"publication_status":"draft","author":[{"full_name":"Shute, Alec L","id":"440EB050-F248-11E8-B48F-1D18A9856A87","last_name":"Shute","first_name":"Alec L","orcid":"0000-0002-1812-2810"}],"month":"04","type":"preprint","oa_version":"Preprint","day":"30","publication":"arXiv","language":[{"iso":"eng"}],"article_processing_charge":"No","external_id":{"arxiv":["2104.14946"]},"oa":1,"citation":{"mla":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>ArXiv</i>, 2104.14946, doi:<a href=\"https://doi.org/10.48550/arXiv.2104.14946\">10.48550/arXiv.2104.14946</a>.","ieee":"A. L. Shute, “On the leading constant in the Manin-type conjecture for Campana points,” <i>arXiv</i>. .","short":"A.L. Shute, ArXiv (n.d.).","ama":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2104.14946\">10.48550/arXiv.2104.14946</a>","ista":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. arXiv, 2104.14946.","apa":"Shute, A. L. (n.d.). On the leading constant in the Manin-type conjecture for Campana points. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2104.14946\">https://doi.org/10.48550/arXiv.2104.14946</a>","chicago":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2104.14946\">https://doi.org/10.48550/arXiv.2104.14946</a>."},"acknowledgement":"The author would like to thank Damaris Schindler and Florian Wilsch for their helpful comments on the heights and Tamagawa measures used in Section 3, together with Marta Pieropan, Sho Tanimoto and Sam Streeter for providing valuable feedback on an earlier version of this paper, and Tim Browning for many useful comments and discussions during the development of this work. The author is also grateful to the anonymous referee for providing many valuable comments and suggestions that improved the quality of the paper.","doi":"10.48550/arXiv.2104.14946","date_created":"2022-09-09T10:43:17Z","year":"2021","corr_author":"1","title":"On the leading constant in the Manin-type conjecture for Campana points","related_material":{"record":[{"relation":"later_version","id":"17058","status":"public"},{"status":"public","id":"12072","relation":"dissertation_contains"}]},"department":[{"_id":"TiBr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"2104.14946"},{"day":"15","oa_version":"Preprint","type":"preprint","month":"04","article_processing_charge":"No","external_id":{"arxiv":["2104.06966"]},"publication":"arXiv","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2104.06966"}],"status":"public","date_updated":"2026-04-07T14:13:35Z","_id":"12076","abstract":[{"lang":"eng","text":"We find an asymptotic formula for the number of primitive vectors $(z_1,\\ldots,z_4)\\in (\\mathbb{Z}_{\\neq 0})^4$ such that $z_1,\\ldots, z_4$ are all squareful and bounded by $B$, and $z_1+\\cdots + z_4 = 0$. Our result agrees in the power of $B$ and $\\log B$ with the Campana-Manin conjecture of Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado."}],"author":[{"orcid":"0000-0002-1812-2810","first_name":"Alec L","id":"440EB050-F248-11E8-B48F-1D18A9856A87","last_name":"Shute","full_name":"Shute, Alec L"}],"publication_status":"draft","arxiv":1,"date_published":"2021-04-15T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"12072","relation":"dissertation_contains"}]},"department":[{"_id":"TiBr"}],"title":"Sums of four squareful numbers","article_number":"2104.06966","citation":{"apa":"Shute, A. L. (n.d.). Sums of four squareful numbers. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2104.06966\">https://doi.org/10.48550/arXiv.2104.06966</a>","chicago":"Shute, Alec L. “Sums of Four Squareful Numbers.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2104.06966\">https://doi.org/10.48550/arXiv.2104.06966</a>.","ama":"Shute AL. Sums of four squareful numbers. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2104.06966\">10.48550/arXiv.2104.06966</a>","ista":"Shute AL. Sums of four squareful numbers. arXiv, 2104.06966.","ieee":"A. L. Shute, “Sums of four squareful numbers,” <i>arXiv</i>. .","short":"A.L. Shute, ArXiv (n.d.).","mla":"Shute, Alec L. “Sums of Four Squareful Numbers.” <i>ArXiv</i>, 2104.06966, doi:<a href=\"https://doi.org/10.48550/arXiv.2104.06966\">10.48550/arXiv.2104.06966</a>."},"oa":1,"corr_author":"1","year":"2021","date_created":"2022-09-09T10:42:51Z","doi":"10.48550/arXiv.2104.06966"},{"department":[{"_id":"ChLa"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10799"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Fairness through regularization for learning to rank","article_number":"2102.05996","citation":{"ieee":"N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” <i>arXiv</i>. .","short":"N.H. Konstantinov, C. Lampert, ArXiv (n.d.).","mla":"Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, 2102.05996, doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>.","ama":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>","ista":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996.","apa":"Konstantinov, N. H., &#38; Lampert, C. (n.d.). Fairness through regularization for learning to rank. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>","chicago":"Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>."},"oa":1,"corr_author":"1","date_created":"2022-02-28T14:13:59Z","doi":"10.48550/arXiv.2102.05996","year":"2021","oa_version":"Preprint","day":"07","month":"06","type":"preprint","external_id":{"arxiv":["2102.05996"]},"article_processing_charge":"No","publication":"arXiv","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2102.05996","open_access":"1"}],"_id":"10803","abstract":[{"text":"Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality.","lang":"eng"}],"status":"public","date_updated":"2026-04-07T14:19:48Z","publication_status":"draft","author":[{"first_name":"Nikola H","orcid":"0009-0009-5204-7621","full_name":"Konstantinov, Nikola H","last_name":"Konstantinov","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Christoph"}],"date_published":"2021-06-07T00:00:00Z","arxiv":1},{"doi":"10.48550/arXiv.2105.15193","acknowledgement":"We acknowledge fruitful discussions with Giacomo Bighin, Giammarco Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy of Sciences and has received funding from the EU Horizon 2020 programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences, FOM and STW.","department":[{"_id":"MiLe"}],"date_published":"2021-05-31T00:00:00Z","author":[{"full_name":"Rzadkowski, Wojciech","last_name":"Rzadkowski","id":"48C55298-F248-11E8-B48F-1D18A9856A87","first_name":"Wojciech","orcid":"0000-0002-1106-4419"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","orcid":"0000-0002-6990-7802"},{"last_name":"Mentink","full_name":"Mentink, Johan H.","first_name":"Johan H."}],"date_updated":"2026-04-07T14:20:12Z","project":[{"call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770"},{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2105.15193"]},"month":"05","oa_version":"Preprint","date_created":"2022-02-17T11:18:57Z","year":"2021","corr_author":"1","oa":1,"citation":{"mla":"Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>.","short":"W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).","ieee":"W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network states for non-additive systems,” <i>arXiv</i>. .","ama":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>","ista":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>.","apa":"Rzadkowski, W., Lemeshko, M., &#38; Mentink, J. H. (n.d.). Artificial neural network states for non-additive systems. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>","chicago":"Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>."},"title":"Artificial neural network states for non-additive systems","ec_funded":1,"related_material":{"record":[{"id":"10759","relation":"dissertation_contains","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication_status":"draft","_id":"10762","abstract":[{"text":"Methods inspired from machine learning have recently attracted great interest in the computational study of quantum many-particle systems. So far, however, it has proven challenging to deal with microscopic models in which the total number of particles is not conserved. To address this issue, we propose a new variant of neural network states, which we term neural coherent states. Taking the Fröhlich impurity model as a case study, we show that neural coherent states can learn the ground state of non-additive systems very well. In particular, we observe substantial improvement over the standard coherent state estimates in the most challenging intermediate coupling regime. Our approach is generic and does not assume specific details of the system, suggesting wide applications.","lang":"eng"}],"status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2105.15193"}],"publication":"arXiv","article_processing_charge":"No","type":"preprint","day":"31","page":"2105.15193"},{"publication_status":"published","file":[{"access_level":"open_access","file_id":"10684","checksum":"2bc8155b2526a70fba5b7301bc89dbd1","file_size":137235,"date_updated":"2022-01-26T07:41:16Z","creator":"mlechner","success":1,"date_created":"2022-01-26T07:41:16Z","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","content_type":"application/pdf","relation":"main_file"}],"arxiv":1,"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"_id":"10665","abstract":[{"lang":"eng","text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches."}],"intvolume":"        35","status":"public","article_processing_charge":"No","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","issue":"5A","publisher":"AAAI Press","volume":35,"day":"28","page":"3787-3795","type":"conference","quality_controlled":"1","corr_author":"1","date_created":"2022-01-25T15:15:02Z","year":"2021","citation":{"mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.","ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.","apa":"Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2021). Scalable verification of quantized neural networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.","chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:3787–95. AAAI Press, 2021.","ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:3787-3795.","ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795."},"oa":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11362"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2022-01-26T07:41:16Z","title":"Scalable verification of quantized neural networks","ec_funded":1,"author":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724"},{"first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2021-05-28T00:00:00Z","alternative_title":["Technical Tracks"],"ddc":["000"],"date_updated":"2026-04-07T14:21:58Z","project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"external_id":{"arxiv":["2012.08185"]},"language":[{"iso":"eng"}],"conference":{"location":"Virtual","name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","start_date":"2021-02-02"},"scopus_import":"1","oa_version":"Published Version","has_accepted_license":"1","month":"05","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","publication_identifier":{"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"],"issn":["2159-5399"]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}]},{"_id":"10667","abstract":[{"text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications.","lang":"eng"}],"status":"public","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html"}],"arxiv":1,"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","file_name":"infinite_time_horizon_safety_o.pdf","date_created":"2022-01-26T07:39:59Z","success":1,"creator":"mlechner","date_updated":"2022-01-26T07:39:59Z","file_size":452492,"checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","file_id":"10682","access_level":"open_access"}],"type":"conference","day":"01","publication":"35th Conference on Neural Information Processing Systems","article_processing_charge":"No","oa":1,"citation":{"mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, ."},"date_created":"2022-01-25T15:45:58Z","year":"2021","quality_controlled":"1","corr_author":"1","file_date_updated":"2022-01-26T07:39:59Z","ec_funded":1,"title":"Infinite time horizon safety of Bayesian neural networks","related_material":{"record":[{"status":"public","id":"11362","relation":"dissertation_contains"}]},"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-04-07T14:21:58Z","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"date_published":"2021-12-01T00:00:00Z","ddc":["000"],"alternative_title":[" Advances in Neural Information Processing Systems"],"author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"first_name":"Ðorđe","full_name":"Žikelić, Ðorđe","last_name":"Žikelić"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724"}],"month":"12","oa_version":"Published Version","has_accepted_license":"1","language":[{"iso":"eng"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"Virtual","start_date":"2021-12-06","end_date":"2021-12-10"},"external_id":{"arxiv":["2111.03165"]},"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","doi":"10.48550/arXiv.2111.03165","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png"},"department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}]}]