[{"publication":"arXiv","year":"2023","external_id":{"arxiv":["2309.09858"]},"article_processing_charge":"No","extern":"1","date_published":"2023-09-18T00:00:00Z","doi":"10.48550/arXiv.2309.09858","language":[{"iso":"eng"}],"status":"public","oa":1,"date_created":"2024-02-08T15:33:39Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2309.09858"}],"type":"preprint","abstract":[{"lang":"eng","text":"In this paper, we show that recent advances in video representation learning\r\nand pre-trained vision-language models allow for substantial improvements in\r\nself-supervised video object localization. We propose a method that first\r\nlocalizes objects in videos via a slot attention approach and then assigns text\r\nto the obtained slots. The latter is achieved by an unsupervised way to read\r\nlocalized semantic information from the pre-trained CLIP model. The resulting\r\nvideo object localization is entirely unsupervised apart from the implicit\r\nannotation contained in CLIP, and it is effectively the first unsupervised\r\napproach that yields good results on regular video benchmarks."}],"date_updated":"2024-02-12T10:12:22Z","citation":{"chicago":"Fan, Ke, Zechen Bai, Tianjun Xiao, Dominik Zietlow, Max Horn, Zixu Zhao, Carl-Johann Simon-Gabriel Carl-Johann Simon-Gabriel, et al. “Unsupervised Open-Vocabulary Object Localization in Videos.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2309.09858\">https://doi.org/10.48550/arXiv.2309.09858</a>.","mla":"Fan, Ke, et al. “Unsupervised Open-Vocabulary Object Localization in Videos.” <i>ArXiv</i>, 2309.09858, doi:<a href=\"https://doi.org/10.48550/arXiv.2309.09858\">10.48550/arXiv.2309.09858</a>.","ista":"Fan K, Bai Z, Xiao T, Zietlow D, Horn M, Zhao Z, Carl-Johann Simon-Gabriel C-JS-G, Shou MZ, Locatello F, Schiele B, Brox T, Zhang Z, Fu Y, He T. Unsupervised open-vocabulary object localization in videos. arXiv, 2309.09858.","short":"K. Fan, Z. Bai, T. Xiao, D. Zietlow, M. Horn, Z. Zhao, C.-J.S.-G. Carl-Johann Simon-Gabriel, M.Z. Shou, F. Locatello, B. Schiele, T. Brox, Z. Zhang, Y. Fu, T. He, ArXiv (n.d.).","ieee":"K. Fan <i>et al.</i>, “Unsupervised open-vocabulary object localization in videos,” <i>arXiv</i>. .","apa":"Fan, K., Bai, Z., Xiao, T., Zietlow, D., Horn, M., Zhao, Z., … He, T. (n.d.). Unsupervised open-vocabulary object localization in videos. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2309.09858\">https://doi.org/10.48550/arXiv.2309.09858</a>","ama":"Fan K, Bai Z, Xiao T, et al. Unsupervised open-vocabulary object localization in videos. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2309.09858\">10.48550/arXiv.2309.09858</a>"},"publication_status":"submitted","oa_version":"Preprint","article_number":"2309.09858","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Ke","last_name":"Fan","full_name":"Fan, Ke"},{"first_name":"Zechen","last_name":"Bai","full_name":"Bai, Zechen"},{"full_name":"Xiao, Tianjun","last_name":"Xiao","first_name":"Tianjun"},{"first_name":"Dominik","full_name":"Zietlow, Dominik","last_name":"Zietlow"},{"full_name":"Horn, Max","last_name":"Horn","first_name":"Max"},{"first_name":"Zixu","full_name":"Zhao, Zixu","last_name":"Zhao"},{"first_name":"Carl-Johann Simon-Gabriel","full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel","last_name":"Carl-Johann Simon-Gabriel"},{"last_name":"Shou","full_name":"Shou, Mike Zheng","first_name":"Mike Zheng"},{"last_name":"Locatello","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683"},{"first_name":"Bernt","last_name":"Schiele","full_name":"Schiele, Bernt"},{"last_name":"Brox","full_name":"Brox, Thomas","first_name":"Thomas"},{"last_name":"Zhang","full_name":"Zhang, Zheng","first_name":"Zheng"},{"last_name":"Fu","full_name":"Fu, Yanwei","first_name":"Yanwei"},{"full_name":"He, Tong","last_name":"He","first_name":"Tong"}],"department":[{"_id":"FrLo"}],"_id":"14962","day":"18","month":"09","arxiv":1,"title":"Unsupervised open-vocabulary object localization in videos"},{"external_id":{"arxiv":["2309.00233"]},"year":"2023","publication":"arXiv","oa":1,"status":"public","date_created":"2024-02-08T15:34:43Z","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2309.00233","open_access":"1"}],"doi":"10.48550/arXiv.2309.00233","language":[{"iso":"eng"}],"date_published":"2023-09-01T00:00:00Z","extern":"1","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Zhao, Zixu","last_name":"Zhao","first_name":"Zixu"},{"first_name":"Jiaze","full_name":"Wang, Jiaze","last_name":"Wang"},{"first_name":"Max","last_name":"Horn","full_name":"Horn, Max"},{"full_name":"Ding, Yizhuo","last_name":"Ding","first_name":"Yizhuo"},{"first_name":"Tong","last_name":"He","full_name":"He, Tong"},{"first_name":"Zechen","full_name":"Bai, Zechen","last_name":"Bai"},{"first_name":"Dominik","last_name":"Zietlow","full_name":"Zietlow, Dominik"},{"full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel","last_name":"Carl-Johann Simon-Gabriel","first_name":"Carl-Johann Simon-Gabriel"},{"first_name":"Bing","full_name":"Shuai, Bing","last_name":"Shuai"},{"first_name":"Zhuowen","last_name":"Tu","full_name":"Tu, Zhuowen"},{"full_name":"Brox, Thomas","last_name":"Brox","first_name":"Thomas"},{"last_name":"Schiele","full_name":"Schiele, Bernt","first_name":"Bernt"},{"full_name":"Fu, Yanwei","last_name":"Fu","first_name":"Yanwei"},{"last_name":"Locatello","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683"},{"last_name":"Zhang","full_name":"Zhang, Zheng","first_name":"Zheng"},{"first_name":"Tianjun","full_name":"Xiao, Tianjun","last_name":"Xiao"}],"citation":{"ista":"Zhao Z, Wang J, Horn M, Ding Y, He T, Bai Z, Zietlow D, Carl-Johann Simon-Gabriel C-JS-G, Shuai B, Tu Z, Brox T, Schiele B, Fu Y, Locatello F, Zhang Z, Xiao T. Object-centric multiple object tracking. arXiv, 2309.00233.","chicago":"Zhao, Zixu, Jiaze Wang, Max Horn, Yizhuo Ding, Tong He, Zechen Bai, Dominik Zietlow, et al. “Object-Centric Multiple Object Tracking.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2309.00233\">https://doi.org/10.48550/arXiv.2309.00233</a>.","mla":"Zhao, Zixu, et al. “Object-Centric Multiple Object Tracking.” <i>ArXiv</i>, 2309.00233, doi:<a href=\"https://doi.org/10.48550/arXiv.2309.00233\">10.48550/arXiv.2309.00233</a>.","short":"Z. Zhao, J. Wang, M. Horn, Y. Ding, T. He, Z. Bai, D. Zietlow, C.-J.S.-G. Carl-Johann Simon-Gabriel, B. Shuai, Z. Tu, T. Brox, B. Schiele, Y. Fu, F. Locatello, Z. Zhang, T. Xiao, ArXiv (n.d.).","apa":"Zhao, Z., Wang, J., Horn, M., Ding, Y., He, T., Bai, Z., … Xiao, T. (n.d.). Object-centric multiple object tracking. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2309.00233\">https://doi.org/10.48550/arXiv.2309.00233</a>","ama":"Zhao Z, Wang J, Horn M, et al. Object-centric multiple object tracking. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2309.00233\">10.48550/arXiv.2309.00233</a>","ieee":"Z. Zhao <i>et al.</i>, “Object-centric multiple object tracking,” <i>arXiv</i>. ."},"date_updated":"2024-02-12T10:16:21Z","oa_version":"Preprint","article_number":"2309.00233","publication_status":"submitted","abstract":[{"lang":"eng","text":"Unsupervised object-centric learning methods allow the partitioning of scenes\r\ninto entities without additional localization information and are excellent\r\ncandidates for reducing the annotation burden of multiple-object tracking (MOT)\r\npipelines. Unfortunately, they lack two key properties: objects are often split\r\ninto parts and are not consistently tracked over time. In fact,\r\nstate-of-the-art models achieve pixel-level accuracy and temporal consistency\r\nby relying on supervised object detection with additional ID labels for the\r\nassociation through time. This paper proposes a video object-centric model for\r\nMOT. It consists of an index-merge module that adapts the object-centric slots\r\ninto detection outputs and an object memory module that builds complete object\r\nprototypes to handle occlusions. Benefited from object-centric learning, we\r\nonly require sparse detection labels (0%-6.25%) for object localization and\r\nfeature binding. Relying on our self-supervised\r\nExpectation-Maximization-inspired loss for object association, our approach\r\nrequires no ID labels. Our experiments significantly narrow the gap between the\r\nexisting object-centric model and the fully supervised state-of-the-art and\r\noutperform several unsupervised trackers."}],"type":"preprint","arxiv":1,"title":"Object-centric multiple object tracking","month":"09","day":"01","_id":"14963","department":[{"_id":"FrLo"}]},{"page":"9","year":"2023","oa":1,"file":[{"relation":"main_file","creator":"ptazenko","success":1,"date_created":"2024-02-08T15:41:51Z","date_updated":"2024-02-08T15:41:51Z","content_type":"application/pdf","file_size":2893462,"file_id":"14966","access_level":"open_access","checksum":"55ed444b176b48e4fb4d609ea895de36","file_name":"Patent_FrLo_US20230162818A1.pdf"}],"date_published":"2023-05-25T00:00:00Z","extern":"1","OA_place":"repository","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"mla":"Ficek, Joanna, et al. <i>Methods of Determining Correspondences between Biological Properties of Cells</i>. 2023.","chicago":"Ficek, Joanna, Kjong-Van Lehmann, Francesco Locatello, Gunnar  Raetsch, and Stefan Stark. “Methods of Determining Correspondences between Biological Properties of Cells,” 2023.","ista":"Ficek J, Lehmann K-V, Locatello F, Raetsch G, Stark S. 2023. Methods of determining correspondences between biological properties of cells.","short":"J. Ficek, K.-V. Lehmann, F. Locatello, G. Raetsch, S. Stark, (2023).","ieee":"J. Ficek, K.-V. Lehmann, F. Locatello, G. Raetsch, and S. Stark, “Methods of determining correspondences between biological properties of cells.” 2023.","ama":"Ficek J, Lehmann K-V, Locatello F, Raetsch G, Stark S. Methods of determining correspondences between biological properties of cells. 2023.","apa":"Ficek, J., Lehmann, K.-V., Locatello, F., Raetsch, G., &#38; Stark, S. (2023). Methods of determining correspondences between biological properties of cells."},"type":"patent","publication_date":"2023-05-25","month":"05","ipn":"US20230162818A1","_id":"14965","file_date_updated":"2024-02-08T15:41:51Z","status":"public","date_created":"2024-02-08T15:52:21Z","applicant":["ETH Zürich"],"ipc":"C12Q1/68 ; G06V10/82 ; G06V20/69 ; G16B40/30","article_processing_charge":"No","author":[{"first_name":"Joanna","full_name":"Ficek, Joanna","last_name":"Ficek"},{"first_name":"Kjong-Van","full_name":"Lehmann, Kjong-Van","last_name":"Lehmann"},{"orcid":"0000-0002-4850-0683","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","last_name":"Locatello"},{"full_name":"Raetsch, Gunnar ","last_name":"Raetsch","first_name":"Gunnar "},{"first_name":"Stefan","last_name":"Stark","full_name":"Stark, Stefan"}],"date_updated":"2025-01-29T10:53:48Z","application_date":"2021-04-21","oa_version":"Published Version","abstract":[{"text":"A method of determining a correspondence between a first biological property of a cell and one or more further biological properties of cells is provided. The first biological property and the further biological properties are determined by different analysis techniques and each are contained in a respective one of a plurality of sets of biological properties. The method includes the steps of: converting the plurality of sets of biological properties into corresponding representations in a representation format which is invariant to the technologies used to derive the biological properties; determining, in said representation format, a representation from each of the converted sets of further biological properties which most closely matches the first representation of the first biological property; and re-converting the determined representations from the representation format back to the biological properties associated with the determined representations and thereby determining a correspondence between the first biological property and each of the further biological properties.","lang":"eng"}],"title":"Methods of determining correspondences between biological properties of cells","day":"25","ddc":["540"],"application_number":"PCT/EP2021/060318","has_accepted_license":"1","department":[{"_id":"FrLo"}]},{"year":"2023","quality_controlled":"1","publication":"2nd Conference on Causal Learning and Reasoning","conference":{"location":"Tübingen, Germany","start_date":"2023-04-11","end_date":"2023-04-14","name":"CLeaR: Conference on Causal Learning and Reasoning"},"extern":"1","article_processing_charge":"No","status":"public","oa":1,"file_date_updated":"2024-02-08T16:03:08Z","date_created":"2024-02-08T16:03:18Z","file":[{"relation":"main_file","creator":"ptazenko","date_created":"2024-02-08T16:03:08Z","date_updated":"2024-02-08T16:03:08Z","content_type":"application/pdf","file_size":215629,"file_id":"14975","checksum":"105ff58e55de866ce76967f3a95e82f7","access_level":"open_access","file_name":"CLeaR23_roundtable_discussion.pdf"}],"language":[{"iso":"eng"}],"date_published":"2023-05-01T00:00:00Z","citation":{"ista":"Zhang C, Janzing D, van der Schaar M, Locatello F, Spirtes P, Zhang K, Schölkopf B, Uhler C. Causality in the time of LLMs: Round table discussion results of CLeaR 2023. 2nd Conference on Causal Learning and Reasoning. CLeaR: Conference on Causal Learning and Reasoning.","chicago":"Zhang, Cheng, Dominik Janzing, Mihaela  van der Schaar, Francesco Locatello, Peter Spirtes, Kun Zhang, Bernhard Schölkopf, and Caroline Uhler. “Causality in the Time of LLMs: Round Table Discussion Results of CLeaR 2023.” In <i>2nd Conference on Causal Learning and Reasoning</i>, n.d.","mla":"Zhang, Cheng, et al. “Causality in the Time of LLMs: Round Table Discussion Results of CLeaR 2023.” <i>2nd Conference on Causal Learning and Reasoning</i>.","short":"C. Zhang, D. Janzing, M. van der Schaar, F. Locatello, P. Spirtes, K. Zhang, B. Schölkopf, C. Uhler, in:, 2nd Conference on Causal Learning and Reasoning, n.d.","apa":"Zhang, C., Janzing, D., van der Schaar, M., Locatello, F., Spirtes, P., Zhang, K., … Uhler, C. (n.d.). Causality in the time of LLMs: Round table discussion results of CLeaR 2023. In <i>2nd Conference on Causal Learning and Reasoning</i>. Tübingen, Germany.","ama":"Zhang C, Janzing D, van der Schaar M, et al. Causality in the time of LLMs: Round table discussion results of CLeaR 2023. In: <i>2nd Conference on Causal Learning and Reasoning</i>.","ieee":"C. Zhang <i>et al.</i>, “Causality in the time of LLMs: Round table discussion results of CLeaR 2023,” in <i>2nd Conference on Causal Learning and Reasoning</i>, Tübingen, Germany."},"date_updated":"2025-08-05T11:19:37Z","publication_status":"submitted","oa_version":"Submitted Version","abstract":[{"text":"The field of machine learning and AI has witnessed remarkable breakthroughs with the emergence of LLMs, which have also sparked a lively debate in the causal community. As researchers in this field, we are interested in exploring how LLMs relate to causality research, and how we can leverage the technology to advance it. In the second conference of Causal Learning and Reasoning (CLeaR), 2023, we held a round table discussion to gather and integrate the diverse perspectives of the CLeaR community on this topic.\r\nThere is a general consensus that LLMs are not yet capable of causal reasoning at the current\r\nstage but has a lot of potential with public available information by CLeaR 2023. Enhancing causal machine learning is vital not only for its own sake but also to help LLMs improve their performance, especially regarding trustworthiness. In this document, we present both the summary and the raw outcome of the round table discussion. We acknowledge that with the progress of both fields, the opportunities and impact may rapidly change. We will repeat the same exercise in CLeaR 2024 to document the evolution.","lang":"eng"}],"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Zhang","full_name":"Zhang, Cheng","first_name":"Cheng"},{"first_name":"Dominik","last_name":"Janzing","full_name":"Janzing, Dominik"},{"last_name":"van der Schaar","full_name":"van der Schaar, Mihaela ","first_name":"Mihaela "},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","full_name":"Locatello, Francesco"},{"full_name":"Spirtes, Peter","last_name":"Spirtes","first_name":"Peter"},{"full_name":"Zhang, Kun","last_name":"Zhang","first_name":"Kun"},{"first_name":"Bernhard","full_name":"Schölkopf, Bernhard","last_name":"Schölkopf"},{"last_name":"Uhler","full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","orcid":"0000-0002-7008-0216"}],"_id":"14974","has_accepted_license":"1","department":[{"_id":"FrLo"}],"title":"Causality in the time of LLMs: Round table discussion results of CLeaR 2023","month":"05","day":"01","ddc":["000"]},{"page":"161-170","year":"2023","quality_controlled":"1","oa":1,"file":[{"date_created":"2024-02-19T09:58:32Z","relation":"main_file","creator":"dernst","success":1,"file_id":"15015","checksum":"7b5e8210ef1434feb173022c6dbbee0c","access_level":"open_access","file_name":"2023_InterdiscMaterials_Liu.pdf","date_updated":"2024-02-19T09:58:32Z","content_type":"application/pdf","file_size":4675941}],"issue":"1","language":[{"iso":"eng"}],"doi":"10.1002/idm2.12056","date_published":"2023-01-01T00:00:00Z","publisher":"Wiley","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Liu Z, Hong T, Xu L, et al. Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS. <i>Interdisciplinary Materials</i>. 2023;2(1):161-170. doi:<a href=\"https://doi.org/10.1002/idm2.12056\">10.1002/idm2.12056</a>","apa":"Liu, Z., Hong, T., Xu, L., Wang, S., Gao, X., Chang, C., … Zhao, L. (2023). Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS. <i>Interdisciplinary Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/idm2.12056\">https://doi.org/10.1002/idm2.12056</a>","ieee":"Z. Liu <i>et al.</i>, “Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS,” <i>Interdisciplinary Materials</i>, vol. 2, no. 1. Wiley, pp. 161–170, 2023.","short":"Z. Liu, T. Hong, L. Xu, S. Wang, X. Gao, C. Chang, X. Ding, Y. Xiao, L. Zhao, Interdisciplinary Materials 2 (2023) 161–170.","ista":"Liu Z, Hong T, Xu L, Wang S, Gao X, Chang C, Ding X, Xiao Y, Zhao L. 2023. Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS. Interdisciplinary Materials. 2(1), 161–170.","chicago":"Liu, Zhengtao, Tao Hong, Liqing Xu, Sining Wang, Xiang Gao, Cheng Chang, Xiangdong Ding, Yu Xiao, and Li‐Dong Zhao. “Lattice Expansion Enables Interstitial Doping to Achieve a High Average ZT in N‐type PbS.” <i>Interdisciplinary Materials</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/idm2.12056\">https://doi.org/10.1002/idm2.12056</a>.","mla":"Liu, Zhengtao, et al. “Lattice Expansion Enables Interstitial Doping to Achieve a High Average ZT in N‐type PbS.” <i>Interdisciplinary Materials</i>, vol. 2, no. 1, Wiley, 2023, pp. 161–70, doi:<a href=\"https://doi.org/10.1002/idm2.12056\">10.1002/idm2.12056</a>."},"publication_status":"published","type":"journal_article","volume":2,"month":"01","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"14985","publication_identifier":{"eissn":["2767-441X"]},"publication":"Interdisciplinary Materials","status":"public","file_date_updated":"2024-02-19T09:58:32Z","date_created":"2024-02-14T12:12:17Z","acknowledgement":"The authors would like to acknowledge the strong supportof microstructure observation from Center for HighPressure Science and Technology Advanced Research(HPSTAR). We acknowledge the financial support fromthe  National  Natural  Science  Foundation  of  China:52172236, the Fundamental Research Funds for theCentral Universities: xtr042021007, Top Young TalentsProgramme of Xi'an Jiaotong University and NationalScience Fund for Distinguished Young Scholars: 51925101.","article_processing_charge":"Yes","license":"https://creativecommons.org/licenses/by/4.0/","author":[{"first_name":"Zhengtao","full_name":"Liu, Zhengtao","last_name":"Liu"},{"first_name":"Tao","full_name":"Hong, Tao","last_name":"Hong"},{"first_name":"Liqing","last_name":"Xu","full_name":"Xu, Liqing"},{"full_name":"Wang, Sining","last_name":"Wang","first_name":"Sining"},{"full_name":"Gao, Xiang","last_name":"Gao","first_name":"Xiang"},{"full_name":"Chang, Cheng","last_name":"Chang","orcid":"0000-0002-9515-4277","id":"9E331C2E-9F27-11E9-AE48-5033E6697425","first_name":"Cheng"},{"full_name":"Ding, Xiangdong","last_name":"Ding","first_name":"Xiangdong"},{"full_name":"Xiao, Yu","last_name":"Xiao","first_name":"Yu"},{"last_name":"Zhao","full_name":"Zhao, Li‐Dong","first_name":"Li‐Dong"}],"intvolume":"         2","date_updated":"2024-02-19T10:01:26Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Lead sulfide (PbS) presents large potential in thermoelectric application due to its earth-abundant S element. However, its inferior average ZT (ZTave) value makes PbS less competitive with its analogs PbTe and PbSe. To promote its thermoelectric performance, this study implements strategies of continuous Se alloying and Cu interstitial doping to synergistically tune thermal and electrical transport properties in n-type PbS. First, the lattice parameter of 5.93 Å in PbS is linearly expanded to 6.03 Å in PbS0.5Se0.5 with increasing Se alloying content. This expanded lattice in Se-alloyed PbS not only intensifies phonon scattering but also facilitates the formation of Cu interstitials. Based on the PbS0.6Se0.4 content with the minimal lattice thermal conductivity, Cu interstitials are introduced to improve the electron density, thus boosting the peak power factor, from 3.88 μW cm−1 K−2 in PbS0.6Se0.4 to 20.58 μW cm−1 K−2 in PbS0.6Se0.4−1%Cu. Meanwhile, the lattice thermal conductivity in PbS0.6Se0.4−x%Cu (x = 0–2) is further suppressed due to the strong strain field caused by Cu interstitials. Finally, with the lowered thermal conductivity and high electrical transport properties, a peak ZT ~1.1 and ZTave ~0.82 can be achieved in PbS0.6Se0.4 − 1%Cu at 300–773K, which outperforms previously reported n-type PbS."}],"title":"Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS","day":"01","ddc":["540"],"has_accepted_license":"1","department":[{"_id":"MaIb"}]},{"publication_identifier":{"isbn":["1891562835"]},"conference":{"start_date":"2023-02-27","location":"San Diego, CA, United States","end_date":"2023-03-03","name":"NDSS: Network and Distributed Systems Security"},"publication":"Proceedings of the 2023 Network and Distributed System Security Symposium","quality_controlled":"1","year":"2023","date_published":"2023-03-01T00:00:00Z","language":[{"iso":"eng"}],"publisher":"Internet Society","doi":"10.14722/ndss.2023.24545","acknowledgement":"This work is supported by the Novi team at Meta and funded in part by IC3 industry partners and NSF grant 1943499.","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2023/081"}],"date_created":"2024-02-14T14:20:40Z","oa":1,"status":"public","article_processing_charge":"No","author":[{"last_name":"Malvai","full_name":"Malvai, Harjasleen","first_name":"Harjasleen"},{"first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","orcid":"0000-0002-8827-3382","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios"},{"first_name":"Alberto","full_name":"Sonnino, Alberto","last_name":"Sonnino"},{"full_name":"Ghosh, Esha","last_name":"Ghosh","first_name":"Esha"},{"first_name":"Ercan","last_name":"Oztürk","full_name":"Oztürk, Ercan"},{"full_name":"Lewi, Kevin","last_name":"Lewi","first_name":"Kevin"},{"first_name":"Sean","last_name":"Lawlor","full_name":"Lawlor, Sean"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Encryption alone is not enough for secure end-to end encrypted messaging: a server must also honestly serve public keys to users. Key transparency has been presented as an efficient\r\nsolution for detecting (and hence deterring) a server that attempts to dishonestly serve keys. Key transparency involves two major components: (1) a username to public key mapping, stored and cryptographically committed to by the server, and, (2) an outof-band consistency protocol for serving short commitments to users. In the setting of real-world deployments and supporting production scale, new challenges must be considered for both of these components. We enumerate these challenges and provide solutions to address them. In particular, we design and implement a memory-optimized and privacy-preserving verifiable data structure for committing to the username to public key store.\r\nTo make this implementation viable for production, we also integrate support for persistent and distributed storage. We also propose a future-facing solution, termed “compaction”, as\r\na mechanism for mitigating practical issues that arise from dealing with infinitely growing server data structures. Finally, we implement a consensusless solution that achieves the minimum requirements for a service that consistently distributes commitments for a transparency application, providing a much more efficient protocol for distributing small and consistent\r\ncommitments to users. This culminates in our production-grade implementation of a key transparency system (Parakeet) which we have open-sourced, along with a demonstration of feasibility through our benchmarks."}],"type":"conference","publication_status":"published","oa_version":"Published Version","date_updated":"2026-06-18T17:41:59Z","citation":{"ieee":"H. Malvai <i>et al.</i>, “Parakeet: Practical key transparency for end-to-end eEncrypted messaging,” in <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>, San Diego, CA, United States, 2023.","ama":"Malvai H, Kokoris Kogias E, Sonnino A, et al. Parakeet: Practical key transparency for end-to-end eEncrypted messaging. In: <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. Internet Society; 2023. doi:<a href=\"https://doi.org/10.14722/ndss.2023.24545\">10.14722/ndss.2023.24545</a>","apa":"Malvai, H., Kokoris Kogias, E., Sonnino, A., Ghosh, E., Oztürk, E., Lewi, K., &#38; Lawlor, S. (2023). Parakeet: Practical key transparency for end-to-end eEncrypted messaging. In <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. San Diego, CA, United States: Internet Society. <a href=\"https://doi.org/10.14722/ndss.2023.24545\">https://doi.org/10.14722/ndss.2023.24545</a>","short":"H. Malvai, E. Kokoris Kogias, A. Sonnino, E. Ghosh, E. Oztürk, K. Lewi, S. Lawlor, in:, Proceedings of the 2023 Network and Distributed System Security Symposium, Internet Society, 2023.","ista":"Malvai H, Kokoris Kogias E, Sonnino A, Ghosh E, Oztürk E, Lewi K, Lawlor S. 2023. Parakeet: Practical key transparency for end-to-end eEncrypted messaging. Proceedings of the 2023 Network and Distributed System Security Symposium. NDSS: Network and Distributed Systems Security.","chicago":"Malvai, Harjasleen, Eleftherios Kokoris Kogias, Alberto Sonnino, Esha Ghosh, Ercan Oztürk, Kevin Lewi, and Sean Lawlor. “Parakeet: Practical Key Transparency for End-to-End EEncrypted Messaging.” In <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>. Internet Society, 2023. <a href=\"https://doi.org/10.14722/ndss.2023.24545\">https://doi.org/10.14722/ndss.2023.24545</a>.","mla":"Malvai, Harjasleen, et al. “Parakeet: Practical Key Transparency for End-to-End EEncrypted Messaging.” <i>Proceedings of the 2023 Network and Distributed System Security Symposium</i>, Internet Society, 2023, doi:<a href=\"https://doi.org/10.14722/ndss.2023.24545\">10.14722/ndss.2023.24545</a>."},"ddc":["000"],"month":"03","day":"01","scopus_import":"1","title":"Parakeet: Practical key transparency for end-to-end eEncrypted messaging","department":[{"_id":"ElKo"}],"_id":"14989"},{"day":"18","month":"01","ddc":["000"],"title":"Artefact for: Correct Approximation of Stationary Distributions","department":[{"_id":"KrCh"}],"_id":"14990","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"}],"abstract":[{"lang":"eng","text":"The software artefact to evaluate the approximation of stationary distributions implementation."}],"corr_author":"1","type":"research_data_reference","date_updated":"2025-09-09T12:28:12Z","citation":{"mla":"Meggendorfer, Tobias. <i>Artefact for: Correct Approximation of Stationary Distributions</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>.","chicago":"Meggendorfer, Tobias. “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7548214\">https://doi.org/10.5281/ZENODO.7548214</a>.","ista":"Meggendorfer T. 2023. Artefact for: Correct Approximation of Stationary Distributions, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>.","short":"T. Meggendorfer, (2023).","ama":"Meggendorfer T. Artefact for: Correct Approximation of Stationary Distributions. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7548214\">10.5281/ZENODO.7548214</a>","apa":"Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7548214\">https://doi.org/10.5281/ZENODO.7548214</a>","ieee":"T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023."},"oa_version":"Published Version","doi":"10.5281/ZENODO.7548214","publisher":"Zenodo","date_published":"2023-01-18T00:00:00Z","oa":1,"status":"public","date_created":"2024-02-14T14:27:06Z","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7548214","open_access":"1"}],"article_processing_charge":"No","related_material":{"record":[{"status":"public","id":"13139","relation":"used_in_publication"}]},"year":"2023"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Hwong, Yi-Ling","last_name":"Hwong","orcid":"0000-0001-9281-3479","id":"1217aa61-4dd1-11ec-9ac3-f2ba3f17ee22","first_name":"Yi-Ling"},{"last_name":"Colin","full_name":"Colin, Maxime","first_name":"Maxime"},{"id":"02eace56-97fc-11ee-b81a-f0939ca85a77","first_name":"Philipp","full_name":"Aglas, Philipp","last_name":"Aglas"},{"last_name":"Muller","full_name":"Muller, Caroline J","first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","orcid":"0000-0001-5836-5350"},{"last_name":"Sherwood","full_name":"Sherwood, Steven C.","first_name":"Steven C."}],"date_updated":"2025-09-09T13:35:40Z","citation":{"ista":"Hwong Y-L, Colin M, Aglas P, Muller CJ, Sherwood SC. 2023. Data-assessing memory in convection schemes using idealized tests, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7757041\">10.5281/ZENODO.7757041</a>.","mla":"Hwong, Yi-Ling, et al. <i>Data-Assessing Memory in Convection Schemes Using Idealized Tests</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7757041\">10.5281/ZENODO.7757041</a>.","chicago":"Hwong, Yi-Ling, Maxime Colin, Philipp Aglas, Caroline J Muller, and Steven C. Sherwood. “Data-Assessing Memory in Convection Schemes Using Idealized Tests.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7757041\">https://doi.org/10.5281/ZENODO.7757041</a>.","short":"Y.-L. Hwong, M. Colin, P. Aglas, C.J. Muller, S.C. Sherwood, (2023).","ieee":"Y.-L. Hwong, M. Colin, P. Aglas, C. J. Muller, and S. C. Sherwood, “Data-assessing memory in convection schemes using idealized tests.” Zenodo, 2023.","apa":"Hwong, Y.-L., Colin, M., Aglas, P., Muller, C. J., &#38; Sherwood, S. C. (2023). Data-assessing memory in convection schemes using idealized tests. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7757041\">https://doi.org/10.5281/ZENODO.7757041</a>","ama":"Hwong Y-L, Colin M, Aglas P, Muller CJ, Sherwood SC. Data-assessing memory in convection schemes using idealized tests. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7757041\">10.5281/ZENODO.7757041</a>"},"oa_version":"Published Version","abstract":[{"lang":"eng","text":"This repository contains the data, scripts, WRF codes and files required to reproduce the results of the manuscript \"Assessing Memory in Convection Schemes Using Idealized Tests\" submitted to the Journal of Advances in Modeling Earth Systems (JAMES)."}],"type":"research_data_reference","corr_author":"1","title":"Data-assessing memory in convection schemes using idealized tests","day":"23","month":"06","ddc":["550"],"_id":"14991","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","grant_number":"101034413"}],"department":[{"_id":"CaMu"}],"ec_funded":1,"year":"2023","related_material":{"record":[{"relation":"used_in_publication","id":"14654","status":"public"}]},"status":"public","oa":1,"date_created":"2024-02-14T14:37:57Z","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7757041","open_access":"1"}],"publisher":"Zenodo","doi":"10.5281/ZENODO.7757041","date_published":"2023-06-23T00:00:00Z","article_processing_charge":"No"},{"edition":"1","type":"book_chapter","citation":{"short":"M. Lewin, E.H. Lieb, R. Seiringer, in:, E. Cances, G. Friesecke (Eds.), Density Functional Theory, 1st ed., Springer, 2023, pp. 115–182.","mla":"Lewin, Mathieu, et al. “Universal Functionals in Density Functional Theory.” <i>Density Functional Theory</i>, edited by Eric Cances and Gero Friesecke, 1st ed., Springer, 2023, pp. 115–82, doi:<a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">10.1007/978-3-031-22340-2_3</a>.","ista":"Lewin M, Lieb EH, Seiringer R. 2023.Universal Functionals in Density Functional Theory. In: Density Functional Theory. Mathematics and Molecular Modeling, , 115–182.","chicago":"Lewin, Mathieu, Elliott H. Lieb, and Robert Seiringer. “Universal Functionals in Density Functional Theory.” In <i>Density Functional Theory</i>, edited by Eric Cances and Gero Friesecke, 1st ed., 115–82. MAMOMO. Springer, 2023. <a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">https://doi.org/10.1007/978-3-031-22340-2_3</a>.","ieee":"M. Lewin, E. H. Lieb, and R. Seiringer, “Universal Functionals in Density Functional Theory,” in <i>Density Functional Theory</i>, 1st ed., E. Cances and G. Friesecke, Eds. Springer, 2023, pp. 115–182.","apa":"Lewin, M., Lieb, E. H., &#38; Seiringer, R. (2023). Universal Functionals in Density Functional Theory. In E. Cances &#38; G. Friesecke (Eds.), <i>Density Functional Theory</i> (1st ed., pp. 115–182). Springer. <a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">https://doi.org/10.1007/978-3-031-22340-2_3</a>","ama":"Lewin M, Lieb EH, Seiringer R. Universal Functionals in Density Functional Theory. In: Cances E, Friesecke G, eds. <i>Density Functional Theory</i>. 1st ed. MAMOMO. Springer; 2023:115-182. doi:<a href=\"https://doi.org/10.1007/978-3-031-22340-2_3\">10.1007/978-3-031-22340-2_3</a>"},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","editor":[{"last_name":"Cances","full_name":"Cances, Eric","first_name":"Eric"},{"first_name":"Gero","full_name":"Friesecke, Gero","last_name":"Friesecke"}],"series_title":"MAMOMO","_id":"14992","month":"07","arxiv":1,"year":"2023","quality_controlled":"1","page":"115-182","external_id":{"arxiv":["1912.10424"]},"date_published":"2023-07-19T00:00:00Z","publisher":"Springer","doi":"10.1007/978-3-031-22340-2_3","language":[{"iso":"eng"}],"oa":1,"abstract":[{"text":"In this chapter we first review the Levy–Lieb functional, which gives the lowest kinetic and interaction energy that can be reached with all possible quantum states having a given density. We discuss two possible convex generalizations of this functional, corresponding to using mixed canonical and grand-canonical states, respectively. We present some recent works about the local density approximation, in which the functionals get replaced by purely local functionals constructed using the uniform electron gas energy per unit volume. We then review the known upper and lower bounds on the Levy–Lieb functionals. We start with the kinetic energy alone, then turn to the classical interaction alone, before we are able to put everything together. A later section is devoted to the Hohenberg–Kohn theorem and the role of many-body unique continuation in its proof.","lang":"eng"}],"date_updated":"2024-02-20T08:33:06Z","oa_version":"Preprint","author":[{"last_name":"Lewin","full_name":"Lewin, Mathieu","first_name":"Mathieu"},{"first_name":"Elliott H.","last_name":"Lieb","full_name":"Lieb, Elliott H."},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","last_name":"Seiringer","full_name":"Seiringer, Robert"}],"department":[{"_id":"RoSe"}],"alternative_title":["Mathematics and Molecular Modeling"],"day":"19","title":"Universal Functionals in Density Functional Theory","publication":"Density Functional Theory","publication_identifier":{"eisbn":["9783031223402"],"issn":["3005-0286"],"isbn":["9783031223396"]},"article_processing_charge":"No","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1912.10424"}],"date_created":"2024-02-14T14:44:33Z"},{"article_processing_charge":"No","acknowledgement":"Houcemeddine Turki’s contributions to this final output have been funded through the Adapting\r\nWikidata to support clinical practice using Data Science, Semantic Web and Machine Learning\r\nproject, which is part of the Wikimedia Research Fund maintained by the Wikimedia Foundation in San Francisco, California, United States of America.","date_published":"2023-03-02T00:00:00Z","publisher":"OpenReview","language":[{"iso":"eng"}],"oa":1,"status":"public","date_created":"2024-02-14T15:11:48Z","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=jHY_G91R880"}],"publication":"1st Workshop on Machine Learning & Global Health","year":"2023","quality_controlled":"1","conference":{"location":"Kigali, Rwanda","start_date":"2023-05-05","end_date":"2023-05-05","name":"ICLR: International Conference on Learning Representations"},"department":[{"_id":"TiVo"}],"_id":"14993","day":"02","month":"03","ddc":["000"],"title":"A framework for grassroots research collaboration in machine learning and global health","abstract":[{"text":"Traditional top-down approaches for global health have historically failed to achieve social progress (Hoffman et al., 2015; Hoffman & Røttingen, 2015). Recently, however, a more holistic, multi-level approach termed One Health (OH) (Osterhaus et al., 2020) is being adopted. Several sets of challenges have been identified for the implementation of OH (dos S. Ribeiro et al., 2019), including policy and funding, education and training, and multi-actor, multi-domain, and multi-level collaborations. These exist despite the increasing accessibility to\r\nknowledge and digital collaborative research tools through the internet. To address some of these challenges, we propose a general framework for grassroots community-based means of participatory research. Additionally, we present a specific roadmap to create a Machine Learning for Global Health community in Africa. The proposed framework aims to enable any small group of individuals with scarce resources to build and sustain an online community within approximately two years. We provide a discussion on the potential impact of the proposed framework for global health research collaborations.","lang":"eng"}],"type":"conference","citation":{"ista":"Currin C, Asiedu  MN, Fourie C, Rosman B, Turki H, Lambebo Tonja A, Abbott J, Ajala M, Adedayo SA, Emezue CC, Machangara D. 2023. A framework for grassroots research collaboration in machine learning and global health. 1st Workshop on Machine Learning &#38; Global Health. ICLR: International Conference on Learning Representations.","mla":"Currin, Christopher, et al. “A Framework for Grassroots Research Collaboration in Machine Learning and Global Health.” <i>1st Workshop on Machine Learning &#38; Global Health</i>, OpenReview, 2023.","chicago":"Currin, Christopher, Mercy Nyamewaa Asiedu , Chris Fourie, Benjamin Rosman, Houcemeddine Turki, Atnafu Lambebo Tonja, Jade Abbott, et al. “A Framework for Grassroots Research Collaboration in Machine Learning and Global Health.” In <i>1st Workshop on Machine Learning &#38; Global Health</i>. OpenReview, 2023.","short":"C. Currin, M.N. Asiedu , C. Fourie, B. Rosman, H. Turki, A. Lambebo Tonja, J. Abbott, M. Ajala, S.A. Adedayo, C.C. Emezue, D. Machangara, in:, 1st Workshop on Machine Learning &#38; Global Health, OpenReview, 2023.","apa":"Currin, C., Asiedu , M. N., Fourie, C., Rosman, B., Turki, H., Lambebo Tonja, A., … Machangara, D. (2023). A framework for grassroots research collaboration in machine learning and global health. In <i>1st Workshop on Machine Learning &#38; Global Health</i>. Kigali, Rwanda: OpenReview.","ama":"Currin C, Asiedu  MN, Fourie C, et al. A framework for grassroots research collaboration in machine learning and global health. In: <i>1st Workshop on Machine Learning &#38; Global Health</i>. OpenReview; 2023.","ieee":"C. Currin <i>et al.</i>, “A framework for grassroots research collaboration in machine learning and global health,” in <i>1st Workshop on Machine Learning &#38; Global Health</i>, Kigali, Rwanda, 2023."},"date_updated":"2026-06-18T17:42:25Z","oa_version":"Published Version","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Currin, Christopher","last_name":"Currin","orcid":"0000-0002-4809-5059","id":"e8321fc5-3091-11eb-8a53-83f309a11ac9","first_name":"Christopher"},{"full_name":"Asiedu , Mercy Nyamewaa","last_name":"Asiedu ","first_name":"Mercy Nyamewaa"},{"first_name":"Chris","full_name":"Fourie, Chris","last_name":"Fourie"},{"first_name":"Benjamin","last_name":"Rosman","full_name":"Rosman, Benjamin"},{"first_name":"Houcemeddine","full_name":"Turki, Houcemeddine","last_name":"Turki"},{"first_name":"Atnafu","full_name":"Lambebo Tonja, Atnafu","last_name":"Lambebo Tonja"},{"last_name":"Abbott","full_name":"Abbott, Jade","first_name":"Jade"},{"first_name":"Marvellous","last_name":"Ajala","full_name":"Ajala, Marvellous"},{"last_name":"Adedayo","full_name":"Adedayo, Sadiq Adewale","first_name":"Sadiq Adewale"},{"first_name":"Chris Chinenye","full_name":"Emezue, Chris Chinenye","last_name":"Emezue"},{"first_name":"Daphne","full_name":"Machangara, Daphne","last_name":"Machangara"}]},{"department":[{"_id":"ToHe"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"14994","has_accepted_license":"1","day":"28","month":"04","ddc":["000"],"title":"A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties","corr_author":"1","type":"research_data_reference","abstract":[{"lang":"eng","text":"This resource contains the artifacts for reproducing the experimental results presented in the paper titled \"A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties\" that has been submitted in CAV 2023."}],"citation":{"ieee":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, and S. Soudjani, “A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties.” Zenodo, 2023.","apa":"Majumdar, R., Mallik, K., Rychlicki, M., Schmuck, A.-K., &#38; Soudjani, S. (2023). A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7877790\">https://doi.org/10.5281/ZENODO.7877790</a>","ama":"Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7877790\">10.5281/ZENODO.7877790</a>","short":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, S. Soudjani, (2023).","chicago":"Majumdar, Rupak, Kaushik Mallik, Mateusz Rychlicki, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7877790\">https://doi.org/10.5281/ZENODO.7877790</a>.","ista":"Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. 2023. A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7877790\">10.5281/ZENODO.7877790</a>.","mla":"Majumdar, Rupak, et al. <i>A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7877790\">10.5281/ZENODO.7877790</a>."},"date_updated":"2025-09-09T14:16:48Z","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Majumdar","full_name":"Majumdar, Rupak","first_name":"Rupak"},{"last_name":"Mallik","full_name":"Mallik, Kaushik","first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475"},{"last_name":"Rychlicki","full_name":"Rychlicki, Mateusz","first_name":"Mateusz"},{"first_name":"Anne-Kathrin","last_name":"Schmuck","full_name":"Schmuck, Anne-Kathrin"},{"last_name":"Soudjani","full_name":"Soudjani, Sadegh","first_name":"Sadegh"}],"article_processing_charge":"No","doi":"10.5281/ZENODO.7877790","publisher":"Zenodo","date_published":"2023-04-28T00:00:00Z","status":"public","oa":1,"date_created":"2024-02-14T15:13:00Z","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7877790","open_access":"1"}],"related_material":{"record":[{"id":"14758","relation":"used_in_publication","status":"public"}]},"year":"2023"},{"department":[{"_id":"DaAl"}],"_id":"14995","ddc":["000"],"day":"28","month":"04","title":"Lincheck: A practical framework for testing concurrent data structures on JVM","type":"research_data_reference","abstract":[{"text":"Lincheck is a new practical and user-friendly framework for testing concurrent data structures on the Java Virtual Machine (JVM). It provides a simple and declarative way to write concurrent tests. Instead of describing how to perform the test, users specify what to test by declaring all the operations to examine; the framework automatically handles the rest. As a result, tests written with Lincheck are concise and easy to understand. \r\nThe artifact presents a collection of Lincheck tests that discover new bugs in popular libraries and implementations from the concurrency literature -- they are listed in Table 1, Section 3. To evaluate the performance of Lincheck analysis, the collection of tests also includes those which check correct data structures and, thus, always succeed. Similarly to Table 2, Section 3, the experiments demonstrate the reasonable time to perform a test. Finally, Lincheck provides user-friendly output with an easy-to-follow trace to reproduce a detected error, significantly simplifying further investigation.","lang":"eng"}],"oa_version":"Published Version","citation":{"mla":"Koval, Nikita, et al. <i>Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.7877757\">10.5281/ZENODO.7877757</a>.","ista":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck: A practical framework for testing concurrent data structures on JVM, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.7877757\">10.5281/ZENODO.7877757</a>.","chicago":"Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.7877757\">https://doi.org/10.5281/ZENODO.7877757</a>.","short":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, (2023).","apa":"Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., &#38; Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.7877757\">https://doi.org/10.5281/ZENODO.7877757</a>","ama":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.7877757\">10.5281/ZENODO.7877757</a>","ieee":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck: A practical framework for testing concurrent data structures on JVM.” Zenodo, 2023."},"date_updated":"2025-09-09T12:51:51Z","author":[{"full_name":"Koval, Nikita","last_name":"Koval","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","first_name":"Nikita"},{"id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","first_name":"Alexander","full_name":"Fedorov, Alexander","last_name":"Fedorov"},{"full_name":"Sokolova, Maria","last_name":"Sokolova","first_name":"Maria"},{"first_name":"Dmitry","full_name":"Tsitelov, Dmitry","last_name":"Tsitelov"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publisher":"Zenodo","date_published":"2023-04-28T00:00:00Z","doi":"10.5281/ZENODO.7877757","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7877757"}],"date_created":"2024-02-14T15:14:13Z","oa":1,"status":"public","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"14260"}]},"year":"2023"},{"day":"15","alternative_title":["NeurIPS"],"ddc":["000"],"title":"Compositional policy learning in stochastic control systems with formal guarantees","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"},{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"has_accepted_license":"1","author":[{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","full_name":"Zikelic, Dorde"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner"},{"first_name":"Abhinav","id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6","last_name":"Verma","full_name":"Verma, Abhinav"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"Reinforcement learning has shown promising results in learning neural network policies for complicated control tasks. However, the lack of formal guarantees about the behavior of such policies remains an impediment to their deployment. We propose a novel method for learning a composition of neural network policies in stochastic environments, along with a formal certificate which guarantees that a specification over the policy's behavior is satisfied with the desired probability. Unlike prior work on verifiable RL, our approach leverages the compositional nature of logical specifications provided in SpectRL, to learn over graphs of probabilistic reach-avoid specifications. The formal guarantees are provided by learning neural network policies together with reach-avoid supermartingales (RASM) for the graph’s sub-tasks and then composing them into a global policy. We also derive a tighter lower bound compared to previous work on the probability of reach-avoidance implied by a RASM, which is required to find a compositional policy with an acceptable probabilistic threshold for complex tasks with multiple edge policies. We implement a prototype of our approach and evaluate it on a Stochastic Nine Rooms environment.","lang":"eng"}],"date_updated":"2025-04-14T07:52:48Z","oa_version":"Published Version","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","status":"public","file_date_updated":"2024-07-22T11:45:17Z","date_created":"2024-02-25T09:23:24Z","article_processing_charge":"No","conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2023-12-16","location":"New Orleans, LO, United States","start_date":"2023-12-10"},"ec_funded":1,"publication":"37th Conference on Neural Information Processing Systems","month":"12","arxiv":1,"_id":"15023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","type":"conference","citation":{"mla":"Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” <i>37th Conference on Neural Information Processing Systems</i>, 2023.","chicago":"Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In <i>37th Conference on Neural Information Processing Systems</i>, 2023.","ista":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional policy learning in stochastic control systems with formal guarantees. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, NeurIPS, .","short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, 2023.","ieee":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in <i>37th Conference on Neural Information Processing Systems</i>, New Orleans, LO, United States, 2023.","apa":"Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &#38; Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In <i>37th Conference on Neural Information Processing Systems</i>. New Orleans, LO, United States.","ama":"Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. Compositional policy learning in stochastic control systems with formal guarantees. In: <i>37th Conference on Neural Information Processing Systems</i>. ; 2023."},"publication_status":"published","language":[{"iso":"eng"}],"date_published":"2023-12-15T00:00:00Z","oa":1,"file":[{"date_created":"2024-07-22T11:45:17Z","success":1,"relation":"main_file","creator":"dernst","access_level":"open_access","checksum":"739c6d72506b778302d4e708723bf12c","file_name":"2023_NeurIPS_Zikelic.pdf","file_id":"17309","file_size":562008,"date_updated":"2024-07-22T11:45:17Z","content_type":"application/pdf"}],"external_id":{"arxiv":["2312.01456"]},"year":"2023","quality_controlled":"1"},{"article_processing_charge":"No","publisher":"Figshare","date_published":"2023-12-13T00:00:00Z","oa":1,"status":"public","date_created":"2024-02-26T08:37:57Z","main_file_link":[{"url":"https://figshare.com/s/85798bba4ebc68d822ed","open_access":"1"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"15001"}]},"year":"2023","department":[{"_id":"AnSa"}],"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"},"_id":"15027","OA_type":"gold","has_accepted_license":"1","month":"12","day":"13","ddc":["570"],"title":"aggregation_data","corr_author":"1","abstract":[{"lang":"eng","text":"This data repository underpins the paper, published in PNAS (doi pending) and bioarxiv (doi: https://doi.org/10.1101/2023.07.05.547777)."}],"type":"research_data_reference","citation":{"ieee":"S. Curk, “aggregation_data.” Figshare, 2023.","ama":"Curk S. aggregation_data. 2023.","apa":"Curk, S. (2023). aggregation_data. Figshare.","mla":"Curk, Samo. <i>Aggregation_data</i>. Figshare, 2023.","chicago":"Curk, Samo. “Aggregation_data.” Figshare, 2023.","ista":"Curk S. 2023. aggregation_data, Figshare.","short":"S. Curk, (2023)."},"date_updated":"2025-09-04T12:03:11Z","oa_version":"Published Version","license":"https://creativecommons.org/publicdomain/zero/1.0/","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Curk, Samo","last_name":"Curk","orcid":"0000-0001-6160-9766","first_name":"Samo","id":"031eff0d-d481-11ee-8508-cd12a7a86e5b"}],"OA_place":"publisher"},{"doi":"10.5281/ZENODO.8191723","date_published":"2023-07-28T00:00:00Z","publisher":"Zenodo","status":"public","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.8191722"}],"date_created":"2024-02-28T07:34:34Z","article_processing_charge":"No","ec_funded":1,"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"14076"}]},"year":"2023","month":"07","day":"28","ddc":["000"],"title":"Monitoring hyperproperties with prefix transducers","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"}],"department":[{"_id":"ToHe"}],"_id":"15035","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"abstract":[{"lang":"eng","text":"This artifact aims to reproduce experiments from the paper Monitoring Hyperproperties With Prefix Transducers accepted at RV'23, and give further pointers to implementation of prefix transducers.\r\nIt has two parts: a pre-compiled docker image and sources that one can use to compile (locally or in docker) the software and run the experiments."}],"type":"research_data_reference","corr_author":"1","date_updated":"2025-04-14T09:42:55Z","citation":{"ista":"Chalupa M, Henzinger TA. 2023. Monitoring hyperproperties with prefix transducers, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>.","chicago":"Chalupa, Marek, and Thomas A Henzinger. “Monitoring Hyperproperties with Prefix Transducers.” Zenodo, 2023. <a href=\"https://doi.org/10.5281/ZENODO.8191723\">https://doi.org/10.5281/ZENODO.8191723</a>.","mla":"Chalupa, Marek, and Thomas A. Henzinger. <i>Monitoring Hyperproperties with Prefix Transducers</i>. Zenodo, 2023, doi:<a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>.","short":"M. Chalupa, T.A. Henzinger, (2023).","apa":"Chalupa, M., &#38; Henzinger, T. A. (2023). Monitoring hyperproperties with prefix transducers. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.8191723\">https://doi.org/10.5281/ZENODO.8191723</a>","ama":"Chalupa M, Henzinger TA. Monitoring hyperproperties with prefix transducers. 2023. doi:<a href=\"https://doi.org/10.5281/ZENODO.8191723\">10.5281/ZENODO.8191723</a>","ieee":"M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers.” Zenodo, 2023."},"oa_version":"Published Version"},{"publication":"arXiv","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19759"}]},"year":"2023","external_id":{"arxiv":["2311.06103"]},"article_processing_charge":"No","date_published":"2023-11-10T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.48550/ARXIV.2311.06103","date_created":"2024-02-28T17:59:32Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.06103","open_access":"1"}],"status":"public","oa":1,"abstract":[{"text":"A crucial property for achieving secure, trustworthy and interpretable deep learning systems is their robustness: small changes to a system's inputs should not result in large changes to its outputs. Mathematically, this means one strives for networks with a small Lipschitz constant. Several recent works have focused on how to construct such Lipschitz networks, typically by imposing constraints on the weight matrices. In this work, we study an orthogonal aspect, namely the role of the activation function. We show that commonly used activation functions, such as MaxMin, as well as all piece-wise linear ones with two segments unnecessarily restrict the class of representable functions, even in the simplest one-dimensional setting. We furthermore introduce the new N-activation function that is provably more expressive than currently popular activation functions. We provide code at this https URL.","lang":"eng"}],"type":"preprint","corr_author":"1","oa_version":"Preprint","article_number":"2311.06103","publication_status":"draft","date_updated":"2026-04-07T11:49:51Z","citation":{"apa":"Prach, B., &#38; Lampert, C. (n.d.). 1-Lipschitz neural networks are more expressive with N-activations. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">https://doi.org/10.48550/ARXIV.2311.06103</a>","ama":"Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">10.48550/ARXIV.2311.06103</a>","ieee":"B. Prach and C. Lampert, “1-Lipschitz neural networks are more expressive with N-activations,” <i>arXiv</i>. .","short":"B. Prach, C. Lampert, ArXiv (n.d.).","mla":"Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More Expressive with N-Activations.” <i>ArXiv</i>, 2311.06103, doi:<a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">10.48550/ARXIV.2311.06103</a>.","chicago":"Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More Expressive with N-Activations.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">https://doi.org/10.48550/ARXIV.2311.06103</a>.","ista":"Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations. arXiv, 2311.06103."},"author":[{"first_name":"Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","last_name":"Prach","full_name":"Prach, Bernd"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","full_name":"Lampert, Christoph"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","OA_place":"repository","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"_id":"15039","month":"11","day":"10","title":"1-Lipschitz neural networks are more expressive with N-activations","arxiv":1},{"abstract":[{"lang":"eng","text":"The hydrogen-rich outer layers of massive stars can be removed by interactions with a binary companion. Theoretical models predict that this stripping produces a population of hot helium stars of ~2 to 8 solar masses (M☉), however, only one such system has been identified thus far. We used ultraviolet photometry to identify potential stripped helium stars then investigated 25 of them using optical spectroscopy. We identified stars with high temperatures (~60,000 to 100,000 kelvin), high surface gravities, and hydrogen-depleted surfaces; 16 stars also showed binary motion. These properties match expectations for stars with initial masses of 8 to 25 M☉ that were stripped by binary interaction. Their masses fall in the gap between subdwarf helium stars and Wolf-Rayet stars. We propose that these stars could be progenitors of stripped-envelope supernovae."}],"oa_version":"None","date_updated":"2024-10-14T12:32:01Z","intvolume":"       382","author":[{"last_name":"Drout","full_name":"Drout, M. R.","first_name":"M. R."},{"orcid":"0000-0002-6960-6911","first_name":"Ylva Louise Linsdotter","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","full_name":"Götberg, Ylva Louise Linsdotter","last_name":"Götberg"},{"first_name":"B. A.","last_name":"Ludwig","full_name":"Ludwig, B. A."},{"full_name":"Groh, J. H.","last_name":"Groh","first_name":"J. H."},{"first_name":"S. E.","full_name":"de Mink, S. E.","last_name":"de Mink"},{"full_name":"O’Grady, A. J. G.","last_name":"O’Grady","first_name":"A. J. G."},{"last_name":"Smith","full_name":"Smith, N.","first_name":"N."}],"day":"14","title":"An observed population of intermediate-mass helium stars that have been stripped in binaries","related_material":{"link":[{"url":"https://ista.ac.at/en/news/reaching-for-the-invisible-stars/","description":"News on ISTA Website","relation":"press_release"}]},"publication":"Science","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2307.00061"}],"date_created":"2024-03-05T09:40:28Z","status":"public","volume":382,"type":"journal_article","publication_status":"published","citation":{"chicago":"Drout, M. R., Ylva Louise Linsdotter Götberg, B. A. Ludwig, J. H. Groh, S. E. de Mink, A. J. G. O’Grady, and N. Smith. “An Observed Population of Intermediate-Mass Helium Stars That Have Been Stripped in Binaries.” <i>Science</i>. American Association for the Advancement of Science, 2023. <a href=\"https://doi.org/10.1126/science.ade4970\">https://doi.org/10.1126/science.ade4970</a>.","ista":"Drout MR, Götberg YLL, Ludwig BA, Groh JH, de Mink SE, O’Grady AJG, Smith N. 2023. An observed population of intermediate-mass helium stars that have been stripped in binaries. Science. 382(6676), 1287–1291.","mla":"Drout, M. R., et al. “An Observed Population of Intermediate-Mass Helium Stars That Have Been Stripped in Binaries.” <i>Science</i>, vol. 382, no. 6676, American Association for the Advancement of Science, 2023, pp. 1287–91, doi:<a href=\"https://doi.org/10.1126/science.ade4970\">10.1126/science.ade4970</a>.","short":"M.R. Drout, Y.L.L. Götberg, B.A. Ludwig, J.H. Groh, S.E. de Mink, A.J.G. O’Grady, N. Smith, Science 382 (2023) 1287–1291.","ieee":"M. R. Drout <i>et al.</i>, “An observed population of intermediate-mass helium stars that have been stripped in binaries,” <i>Science</i>, vol. 382, no. 6676. American Association for the Advancement of Science, pp. 1287–1291, 2023.","apa":"Drout, M. R., Götberg, Y. L. L., Ludwig, B. A., Groh, J. H., de Mink, S. E., O’Grady, A. J. G., &#38; Smith, N. (2023). An observed population of intermediate-mass helium stars that have been stripped in binaries. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.ade4970\">https://doi.org/10.1126/science.ade4970</a>","ama":"Drout MR, Götberg YLL, Ludwig BA, et al. An observed population of intermediate-mass helium stars that have been stripped in binaries. <i>Science</i>. 2023;382(6676):1287-1291. doi:<a href=\"https://doi.org/10.1126/science.ade4970\">10.1126/science.ade4970</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15085","pmid":1,"month":"12","scopus_import":"1","arxiv":1,"quality_controlled":"1","year":"2023","page":"1287-1291","external_id":{"pmid":["38096420"],"arxiv":["2307.00061"]},"keyword":["Stellar Astrophysics"],"article_type":"original","extern":"1","language":[{"iso":"eng"}],"date_published":"2023-12-14T00:00:00Z","publisher":"American Association for the Advancement of Science","doi":"10.1126/science.ade4970","issue":"6676","oa":1},{"article_processing_charge":"Yes (in subscription journal)","date_created":"2024-03-20T10:40:56Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.molcel.2023.01.024"}],"status":"public","publication":"Molecular Cell","publication_identifier":{"issn":["1097-2765"]},"day":"02","title":"Structural snapshots of R-loop formation by a type I-C CRISPR Cascade","abstract":[{"text":"Type I CRISPR-Cas systems employ multi-subunit Cascade effector complexes to target foreign nucleic acids for destruction. Here, we present structures of D. vulgaris type I-C Cascade at various stages of double-stranded (ds)DNA target capture, revealing mechanisms that underpin PAM recognition and Cascade allosteric activation. We uncover an interesting mechanism of non-target strand (NTS) DNA stabilization via stacking interactions with the “belly” subunits, securing the NTS in place. This “molecular seatbelt” mechanism facilitates efficient R-loop formation and prevents dsDNA reannealing. Additionally, we provide structural insights into how two anti-CRISPR (Acr) proteins utilize distinct strategies to achieve a shared mechanism of type I-C Cascade inhibition by blocking PAM scanning. These observations form a structural basis for directional R-loop formation and reveal how different Acr proteins have converged upon common molecular mechanisms to efficiently shut down CRISPR immunity.","lang":"eng"}],"oa_version":"Published Version","intvolume":"        83","date_updated":"2024-06-04T06:33:54Z","author":[{"first_name":"Roisin E.","full_name":"O’Brien, Roisin E.","last_name":"O’Brien"},{"last_name":"Bravo","full_name":"Bravo, Jack Peter Kelly","first_name":"Jack Peter Kelly","id":"96aecfa5-8931-11ee-af30-aa6a5d6eee0e","orcid":"0000-0003-0456-0753"},{"first_name":"Delisa","full_name":"Ramos, Delisa","last_name":"Ramos"},{"first_name":"Grace N.","full_name":"Hibshman, Grace N.","last_name":"Hibshman"},{"last_name":"Wright","full_name":"Wright, Jacquelyn T.","first_name":"Jacquelyn T."},{"last_name":"Taylor","full_name":"Taylor, David W.","first_name":"David W."}],"keyword":["Cell Biology","Molecular Biology"],"article_type":"original","extern":"1","language":[{"iso":"eng"}],"publisher":"Elsevier","date_published":"2023-03-02T00:00:00Z","doi":"10.1016/j.molcel.2023.01.024","issue":"5","oa":1,"quality_controlled":"1","year":"2023","page":"746-758.e5","external_id":{"pmid":["36805026"]},"_id":"15129","pmid":1,"month":"03","scopus_import":"1","volume":83,"type":"journal_article","publication_status":"published","citation":{"ieee":"R. E. O’Brien, J. P. K. Bravo, D. Ramos, G. N. Hibshman, J. T. Wright, and D. W. Taylor, “Structural snapshots of R-loop formation by a type I-C CRISPR Cascade,” <i>Molecular Cell</i>, vol. 83, no. 5. Elsevier, p. 746–758.e5, 2023.","ama":"O’Brien RE, Bravo JPK, Ramos D, Hibshman GN, Wright JT, Taylor DW. Structural snapshots of R-loop formation by a type I-C CRISPR Cascade. <i>Molecular Cell</i>. 2023;83(5):746-758.e5. doi:<a href=\"https://doi.org/10.1016/j.molcel.2023.01.024\">10.1016/j.molcel.2023.01.024</a>","apa":"O’Brien, R. E., Bravo, J. P. K., Ramos, D., Hibshman, G. N., Wright, J. T., &#38; Taylor, D. W. (2023). Structural snapshots of R-loop formation by a type I-C CRISPR Cascade. <i>Molecular Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.molcel.2023.01.024\">https://doi.org/10.1016/j.molcel.2023.01.024</a>","mla":"O’Brien, Roisin E., et al. “Structural Snapshots of R-Loop Formation by a Type I-C CRISPR Cascade.” <i>Molecular Cell</i>, vol. 83, no. 5, Elsevier, 2023, p. 746–758.e5, doi:<a href=\"https://doi.org/10.1016/j.molcel.2023.01.024\">10.1016/j.molcel.2023.01.024</a>.","chicago":"O’Brien, Roisin E., Jack Peter Kelly Bravo, Delisa Ramos, Grace N. Hibshman, Jacquelyn T. Wright, and David W. Taylor. “Structural Snapshots of R-Loop Formation by a Type I-C CRISPR Cascade.” <i>Molecular Cell</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.molcel.2023.01.024\">https://doi.org/10.1016/j.molcel.2023.01.024</a>.","ista":"O’Brien RE, Bravo JPK, Ramos D, Hibshman GN, Wright JT, Taylor DW. 2023. Structural snapshots of R-loop formation by a type I-C CRISPR Cascade. Molecular Cell. 83(5), 746–758.e5.","short":"R.E. O’Brien, J.P.K. Bravo, D. Ramos, G.N. Hibshman, J.T. Wright, D.W. Taylor, Molecular Cell 83 (2023) 746–758.e5."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"publication":"Nature","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41586-022-05560-w"}],"date_created":"2024-03-20T10:41:36Z","status":"public","article_processing_charge":"Yes (in subscription journal)","author":[{"orcid":"0000-0003-0456-0753","first_name":"Jack Peter Kelly","id":"96aecfa5-8931-11ee-af30-aa6a5d6eee0e","full_name":"Bravo, Jack Peter Kelly","last_name":"Bravo"},{"last_name":"Hallmark","full_name":"Hallmark, Thomson","first_name":"Thomson"},{"full_name":"Naegle, Bronson","last_name":"Naegle","first_name":"Bronson"},{"first_name":"Chase L.","last_name":"Beisel","full_name":"Beisel, Chase L."},{"first_name":"Ryan N.","last_name":"Jackson","full_name":"Jackson, Ryan N."},{"last_name":"Taylor","full_name":"Taylor, David W.","first_name":"David W."}],"oa_version":"Published Version","date_updated":"2024-06-04T06:30:59Z","intvolume":"       613","abstract":[{"text":"Cas12a2 is a CRISPR-associated nuclease that performs RNA-guided, sequence-nonspecific degradation of single-stranded RNA, single-stranded DNA and double-stranded DNA following recognition of a complementary RNA target, culminating in abortive infection<jats:sup>1</jats:sup>. Here we report structures of Cas12a2 in binary, ternary and quaternary complexes to reveal a complete activation pathway. Our structures reveal that Cas12a2 is autoinhibited until binding a cognate RNA target, which exposes the RuvC active site within a large, positively charged cleft. Double-stranded DNA substrates are captured through duplex distortion and local melting, stabilized by pairs of ‘aromatic clamp’ residues that are crucial for double-stranded DNA degradation and in vivo immune system function. Our work provides a structural basis for this mechanism of abortive infection to achieve population-level immunity, which can be leveraged to create rational mutants that degrade a spectrum of collateral substrates.","lang":"eng"}],"title":"RNA targeting unleashes indiscriminate nuclease activity of CRISPR–Cas12a2","day":"04","external_id":{"pmid":["36599980"]},"page":"582-587","quality_controlled":"1","year":"2023","oa":1,"doi":"10.1038/s41586-022-05560-w","publisher":"Springer Nature","date_published":"2023-01-04T00:00:00Z","language":[{"iso":"eng"}],"issue":"7944","article_type":"original","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"short":"J.P.K. Bravo, T. Hallmark, B. Naegle, C.L. Beisel, R.N. Jackson, D.W. Taylor, Nature 613 (2023) 582–587.","ista":"Bravo JPK, Hallmark T, Naegle B, Beisel CL, Jackson RN, Taylor DW. 2023. RNA targeting unleashes indiscriminate nuclease activity of CRISPR–Cas12a2. Nature. 613(7944), 582–587.","mla":"Bravo, Jack Peter Kelly, et al. “RNA Targeting Unleashes Indiscriminate Nuclease Activity of CRISPR–Cas12a2.” <i>Nature</i>, vol. 613, no. 7944, Springer Nature, 2023, pp. 582–87, doi:<a href=\"https://doi.org/10.1038/s41586-022-05560-w\">10.1038/s41586-022-05560-w</a>.","chicago":"Bravo, Jack Peter Kelly, Thomson Hallmark, Bronson Naegle, Chase L. Beisel, Ryan N. Jackson, and David W. Taylor. “RNA Targeting Unleashes Indiscriminate Nuclease Activity of CRISPR–Cas12a2.” <i>Nature</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s41586-022-05560-w\">https://doi.org/10.1038/s41586-022-05560-w</a>.","apa":"Bravo, J. P. K., Hallmark, T., Naegle, B., Beisel, C. L., Jackson, R. N., &#38; Taylor, D. W. (2023). RNA targeting unleashes indiscriminate nuclease activity of CRISPR–Cas12a2. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-022-05560-w\">https://doi.org/10.1038/s41586-022-05560-w</a>","ama":"Bravo JPK, Hallmark T, Naegle B, Beisel CL, Jackson RN, Taylor DW. RNA targeting unleashes indiscriminate nuclease activity of CRISPR–Cas12a2. <i>Nature</i>. 2023;613(7944):582-587. doi:<a href=\"https://doi.org/10.1038/s41586-022-05560-w\">10.1038/s41586-022-05560-w</a>","ieee":"J. P. K. Bravo, T. Hallmark, B. Naegle, C. L. Beisel, R. N. Jackson, and D. W. Taylor, “RNA targeting unleashes indiscriminate nuclease activity of CRISPR–Cas12a2,” <i>Nature</i>, vol. 613, no. 7944. Springer Nature, pp. 582–587, 2023."},"type":"journal_article","volume":613,"pmid":1,"month":"01","scopus_import":"1","_id":"15130"},{"article_type":"original","extern":"1","oa":1,"language":[{"iso":"eng"}],"publisher":"Springer Nature","doi":"10.1038/s41586-023-06282-3","date_published":"2023-07-05T00:00:00Z","issue":"7969","quality_controlled":"1","year":"2023","page":"385-393","_id":"15148","month":"07","scopus_import":"1","publication_status":"published","citation":{"mla":"Michael, Alicia K., et al. “Cooperation between BHLH Transcription Factors and Histones for DNA Access.” <i>Nature</i>, vol. 619, no. 7969, Springer Nature, 2023, pp. 385–93, doi:<a href=\"https://doi.org/10.1038/s41586-023-06282-3\">10.1038/s41586-023-06282-3</a>.","chicago":"Michael, Alicia K., Lisa Stoos, Priya Crosby, Nikolas Eggers, Xinyu Y. Nie, Kristina Makasheva, Martina Minnich, et al. “Cooperation between BHLH Transcription Factors and Histones for DNA Access.” <i>Nature</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s41586-023-06282-3\">https://doi.org/10.1038/s41586-023-06282-3</a>.","ista":"Michael AK, Stoos L, Crosby P, Eggers N, Nie XY, Makasheva K, Minnich M, Healy KL, Weiss J, Kempf G, Cavadini S, Kater L, Seebacher J, Vecchia L, Chakraborty D, Isbel L, Grand RS, Andersch F, Fribourgh JL, Schübeler D, Zuber J, Liu AC, Becker PB, Fierz B, Partch CL, Menet JS, Thomä NH. 2023. Cooperation between bHLH transcription factors and histones for DNA access. Nature. 619(7969), 385–393.","short":"A.K. Michael, L. Stoos, P. Crosby, N. Eggers, X.Y. Nie, K. Makasheva, M. Minnich, K.L. Healy, J. Weiss, G. Kempf, S. Cavadini, L. Kater, J. Seebacher, L. Vecchia, D. Chakraborty, L. Isbel, R.S. Grand, F. Andersch, J.L. Fribourgh, D. Schübeler, J. Zuber, A.C. Liu, P.B. Becker, B. Fierz, C.L. Partch, J.S. Menet, N.H. Thomä, Nature 619 (2023) 385–393.","apa":"Michael, A. K., Stoos, L., Crosby, P., Eggers, N., Nie, X. Y., Makasheva, K., … Thomä, N. H. (2023). Cooperation between bHLH transcription factors and histones for DNA access. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-023-06282-3\">https://doi.org/10.1038/s41586-023-06282-3</a>","ama":"Michael AK, Stoos L, Crosby P, et al. Cooperation between bHLH transcription factors and histones for DNA access. <i>Nature</i>. 2023;619(7969):385-393. doi:<a href=\"https://doi.org/10.1038/s41586-023-06282-3\">10.1038/s41586-023-06282-3</a>","ieee":"A. K. Michael <i>et al.</i>, “Cooperation between bHLH transcription factors and histones for DNA access,” <i>Nature</i>, vol. 619, no. 7969. Springer Nature, pp. 385–393, 2023."},"type":"journal_article","volume":619,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41586-023-06282-3"}],"date_created":"2024-03-21T07:52:44Z","status":"public","publication":"Nature","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"title":"Cooperation between bHLH transcription factors and histones for DNA access","day":"05","oa_version":"Published Version","intvolume":"       619","date_updated":"2024-03-25T12:42:29Z","abstract":[{"text":"The basic helix–loop–helix (bHLH) family of transcription factors recognizes DNA motifs known as E-boxes (CANNTG) and includes 108 members<jats:sup>1</jats:sup>. Here we investigate how chromatinized E-boxes are engaged by two structurally diverse bHLH proteins: the proto-oncogene MYC-MAX and the circadian transcription factor CLOCK-BMAL1 (refs. <jats:sup>2,3</jats:sup>). Both transcription factors bind to E-boxes preferentially near the nucleosomal entry–exit sites. Structural studies with engineered or native nucleosome sequences show that MYC-MAX or CLOCK-BMAL1 triggers the release of DNA from histones to gain access. Atop the H2A–H2B acidic patch<jats:sup>4</jats:sup>, the CLOCK-BMAL1 Per-Arnt-Sim (PAS) dimerization domains engage the histone octamer disc. Binding of tandem E-boxes<jats:sup>5–7</jats:sup> at endogenous DNA sequences occurs through direct interactions between two CLOCK-BMAL1 protomers and histones and is important for circadian cycling. At internal E-boxes, the MYC-MAX leucine zipper can also interact with histones H2B and H3, and its binding is indirectly enhanced by OCT4 elsewhere on the nucleosome. The nucleosomal E-box position and the type of bHLH dimerization domain jointly determine the histone contact, the affinity and the degree of competition and cooperativity with other nucleosome-bound factors.","lang":"eng"}],"author":[{"first_name":"Alicia","id":"6437c950-2a03-11ee-914d-d6476dd7b75c","orcid":"0000-0002-6080-839X","last_name":"Michael","full_name":"Michael, Alicia"},{"first_name":"Lisa","full_name":"Stoos, Lisa","last_name":"Stoos"},{"last_name":"Crosby","full_name":"Crosby, Priya","first_name":"Priya"},{"first_name":"Nikolas","full_name":"Eggers, Nikolas","last_name":"Eggers"},{"last_name":"Nie","full_name":"Nie, Xinyu Y.","first_name":"Xinyu Y."},{"first_name":"Kristina","last_name":"Makasheva","full_name":"Makasheva, Kristina"},{"last_name":"Minnich","full_name":"Minnich, Martina","first_name":"Martina"},{"full_name":"Healy, Kelly L.","last_name":"Healy","first_name":"Kelly L."},{"full_name":"Weiss, Joscha","last_name":"Weiss","first_name":"Joscha"},{"first_name":"Georg","full_name":"Kempf, Georg","last_name":"Kempf"},{"first_name":"Simone","last_name":"Cavadini","full_name":"Cavadini, Simone"},{"last_name":"Kater","full_name":"Kater, Lukas","first_name":"Lukas"},{"full_name":"Seebacher, Jan","last_name":"Seebacher","first_name":"Jan"},{"full_name":"Vecchia, Luca","last_name":"Vecchia","first_name":"Luca"},{"last_name":"Chakraborty","full_name":"Chakraborty, Deyasini","first_name":"Deyasini"},{"first_name":"Luke","full_name":"Isbel, Luke","last_name":"Isbel"},{"last_name":"Grand","full_name":"Grand, Ralph S.","first_name":"Ralph S."},{"last_name":"Andersch","full_name":"Andersch, Florian","first_name":"Florian"},{"full_name":"Fribourgh, Jennifer L.","last_name":"Fribourgh","first_name":"Jennifer L."},{"first_name":"Dirk","full_name":"Schübeler, Dirk","last_name":"Schübeler"},{"first_name":"Johannes","full_name":"Zuber, Johannes","last_name":"Zuber"},{"last_name":"Liu","full_name":"Liu, Andrew C.","first_name":"Andrew C."},{"full_name":"Becker, Peter B.","last_name":"Becker","first_name":"Peter B."},{"last_name":"Fierz","full_name":"Fierz, Beat","first_name":"Beat"},{"last_name":"Partch","full_name":"Partch, Carrie L.","first_name":"Carrie L."},{"first_name":"Jerome S.","last_name":"Menet","full_name":"Menet, Jerome S."},{"first_name":"Nicolas H.","full_name":"Thomä, Nicolas H.","last_name":"Thomä"}]}]