[{"publication_status":"epub_ahead","oa":1,"fulldoi":"https://doi.org/10.7554/elife.87462","year":"2023","publisher":"eLife Sciences Publications","main_file_link":[{"url":"https://doi.org/10.7554/eLife.87462.1","open_access":"1"}],"day":"23","type":"journal_article","article_type":"original","oa_version":"Submitted Version","date_created":"2024-01-22T12:21:56Z","acknowledgement":"This work was supported by M.H.’s NIH R01 grants (NS096786, GM126829) and Salk Cancer Center Support Grant P30 CA014195. M.H. also received financial support from the W.M. Keck Foundation and the NOMIS Foundation. Further, M.H. received support from the AHA-Allen Initiative in Brain Health and Cognitive Impairment award made jointly through the American Heart Association and The Paul G. Allen Frontiers Group (19PABH134610000).\r\n\r\nS.T. and J.C. were supported by Salk’s Women & Science Awards. S.T. also received financial support from the Hewitt Foundation fellowship, and J.C. is a Paul F. Glenn Biology of Aging fellow. J.H. was supported by the National Natural Science Foundation of China (31871317 and 32070635).\r\n\r\nWe thank Roberta Schulte for assistance with in vitro transport assays, for comments that greatly improved the manuscript, and for helping refine the figures presented in this work. We thank Shefali Krishna for creating the diagram for the NPC-DamID method, for her input on super-resolution microscopy analysis, and her insightful comments on this manuscript. We thank all members of the Hetzer lab for helpful discussions of these research ideas and their thoughtful comments on this manuscript. We are also grateful to Salk’s core facilities for their assistance. Specifically, we thank the Next Generation Sequencing Core (NGS) for sequencing our DamID and RNA NGS libraries, the Advanced Biophotonics Core for assistance with super-resolution microscopy, and the Razavi Newman Integrative Genomics and Bioinformatics Core (IGC) for their input on analysis methods for DamID experiments.","abstract":[{"text":"The role of nuclear pore complexes (NPCs) in genome organization remains poorly characterized due to technical limitations in probing genome-wide protein-DNA interactions specific to the nuclear periphery. Here, we developed a new sensitive method, NPC-DamID, which combines in vitro reconstitution of nuclear import and DamID technology. The fixation-free method identifies chromatin interactions at the NPCs in intact nuclei from cells and tissues. We found that NPCs are preferentially associated with common and hierarchically arranged super-enhancers (SEs) across multiple cell types. We also uncovered phase-separated condensates at NPCs that compartmentalize and concentrate transcriptional coactivators and structural proteins at SE-regulated genes. Our results support NPCs as anchoring sites for SE regulatory hubs and cell-type-specific transcriptional control.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.7554/elife.87462","title":"High-precision mapping of nuclear pore-chromatin interactions reveals new principles of genome organization at the nuclear envelope","status":"public","date_updated":"2024-07-31T11:56:25Z","citation":{"short":"S. Tyagi, J.S. Capitanio, J. Xu, F. Chen, R. Sharma, J. Huang, M. Hetzer, ELife (2023).","ieee":"S. Tyagi <i>et al.</i>, “High-precision mapping of nuclear pore-chromatin interactions reveals new principles of genome organization at the nuclear envelope,” <i>eLife</i>. eLife Sciences Publications, 2023.","ista":"Tyagi S, Capitanio JS, Xu J, Chen F, Sharma R, Huang J, Hetzer M. 2023. High-precision mapping of nuclear pore-chromatin interactions reveals new principles of genome organization at the nuclear envelope. eLife.","chicago":"Tyagi, Swati, Juliana S. Capitanio, Jiawei Xu, Fei Chen, Rahul Sharma, Jialiang Huang, and Martin Hetzer. “High-Precision Mapping of Nuclear Pore-Chromatin Interactions Reveals New Principles of Genome Organization at the Nuclear Envelope.” <i>ELife</i>. eLife Sciences Publications, 2023. <a href=\"https://doi.org/10.7554/elife.87462\">https://doi.org/10.7554/elife.87462</a>.","mla":"Tyagi, Swati, et al. “High-Precision Mapping of Nuclear Pore-Chromatin Interactions Reveals New Principles of Genome Organization at the Nuclear Envelope.” <i>ELife</i>, eLife Sciences Publications, 2023, doi:<a href=\"https://doi.org/10.7554/elife.87462\">10.7554/elife.87462</a>.","ama":"Tyagi S, Capitanio JS, Xu J, et al. High-precision mapping of nuclear pore-chromatin interactions reveals new principles of genome organization at the nuclear envelope. <i>eLife</i>. 2023. doi:<a href=\"https://doi.org/10.7554/elife.87462\">10.7554/elife.87462</a>","apa":"Tyagi, S., Capitanio, J. S., Xu, J., Chen, F., Sharma, R., Huang, J., &#38; Hetzer, M. (2023). High-precision mapping of nuclear pore-chromatin interactions reveals new principles of genome organization at the nuclear envelope. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.87462\">https://doi.org/10.7554/elife.87462</a>"},"corr_author":"1","article_processing_charge":"Yes","date_published":"2023-06-23T00:00:00Z","month":"06","publication":"eLife","language":[{"iso":"eng"}],"_id":"14868","department":[{"_id":"MaHe"}],"author":[{"first_name":"Swati","last_name":"Tyagi","full_name":"Tyagi, Swati"},{"last_name":"Capitanio","first_name":"Juliana S.","full_name":"Capitanio, Juliana S."},{"full_name":"Xu, Jiawei","last_name":"Xu","first_name":"Jiawei"},{"first_name":"Fei","last_name":"Chen","full_name":"Chen, Fei"},{"last_name":"Sharma","first_name":"Rahul","full_name":"Sharma, Rahul"},{"full_name":"Huang, Jialiang","last_name":"Huang","first_name":"Jialiang"},{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","first_name":"Martin W","last_name":"HETZER"}]},{"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"author":[{"full_name":"Banerjee, Tamajit","last_name":"Banerjee","first_name":"Tamajit"},{"last_name":"Majumdar","first_name":"Rupak","full_name":"Majumdar, Rupak"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","first_name":"Kaushik","last_name":"Mallik"},{"last_name":"Schmuck","first_name":"Anne-Kathrin","full_name":"Schmuck, Anne-Kathrin"},{"full_name":"Soudjani, Sadegh","last_name":"Soudjani","first_name":"Sadegh"}],"volume":2,"date_published":"2023-02-24T00:00:00Z","article_processing_charge":"Yes","month":"02","publication":"TheoretiCS","article_number":"4","ec_funded":1,"title":"Fast symbolic algorithms for mega-regular games under strong transition fairness","status":"public","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"acknowledgement":"A previous version of this paper has appeared in TACAS 2022. Authors ordered alphabetically. T. Banerjee was interning with MPI-SWS when this research was conducted. R. Majumdar and A.-K. Schmuck are partially supported by DFG project 389792660 TRR 248–CPEC. A.-K. Schmuck is additionally funded through DFG project (SCHM 3541/1-1). K. Mallik is supported by the ERC project ERC-2020-AdG 101020093.","abstract":[{"text":"We consider fixpoint algorithms for two-player games on graphs with $\\omega$-regular winning conditions, where the environment is constrained by a strong transition fairness assumption. Strong transition fairness is a widely occurring special case of strong fairness, which requires that any execution is strongly fair with respect to a specified set of live edges: whenever the\r\nsource vertex of a live edge is visited infinitely often along a play, the edge itself is traversed infinitely often along the play as well. We show that, surprisingly, strong transition fairness retains the algorithmic characteristics of the fixpoint algorithms for $\\omega$-regular games -- the new algorithms have the same alternation depth as the classical algorithms but invoke a new type of predecessor operator. For Rabin games with $k$ pairs, the complexity of the new algorithm is $O(n^{k+2}k!)$ symbolic steps, which is independent of the number of live edges in the strong transition fairness assumption. Further, we show that GR(1) specifications with strong transition fairness assumptions can be solved with a 3-nested fixpoint algorithm, same as the usual algorithm. In contrast, strong fairness necessarily requires increasing the alternation depth depending on the number of fairness assumptions. We get symbolic algorithms for (generalized) Rabin, parity and GR(1) objectives under strong transition fairness assumptions as well as a direct symbolic algorithm for qualitative winning in stochastic\r\n$\\omega$-regular games that runs in $O(n^{k+2}k!)$ symbolic steps, improving the state of the art. Finally, we have implemented a BDD-based synthesis engine based on our algorithm. We show on a set of synthetic and real benchmarks that our algorithm is scalable, parallelizable, and outperforms previous algorithms by orders of magnitude.","lang":"eng"}],"article_type":"original","ddc":["000"],"publication_status":"published","external_id":{"arxiv":["2202.07480"]},"publication_identifier":{"issn":["2751-4838"]},"year":"2023","oa":1,"quality_controlled":"1","_id":"14920","department":[{"_id":"ToHe"}],"corr_author":"1","file":[{"date_created":"2024-02-05T10:19:35Z","access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"14940","checksum":"2972d531122a6f15727b396110fb3f5c","date_updated":"2024-02-05T10:19:35Z","file_size":917076,"file_name":"2023_TheoretiCS_Banerjee.pdf","content_type":"application/pdf","success":1}],"has_accepted_license":"1","date_updated":"2025-04-14T07:55:57Z","citation":{"ista":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. 2023. Fast symbolic algorithms for mega-regular games under strong transition fairness. TheoretiCS. 2, 4.","ieee":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “Fast symbolic algorithms for mega-regular games under strong transition fairness,” <i>TheoretiCS</i>, vol. 2. EPI Sciences, 2023.","short":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, S. Soudjani, TheoretiCS 2 (2023).","apa":"Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., &#38; Soudjani, S. (2023). Fast symbolic algorithms for mega-regular games under strong transition fairness. <i>TheoretiCS</i>. EPI Sciences. <a href=\"https://doi.org/10.46298/theoretics.23.4\">https://doi.org/10.46298/theoretics.23.4</a>","ama":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. Fast symbolic algorithms for mega-regular games under strong transition fairness. <i>TheoretiCS</i>. 2023;2. doi:<a href=\"https://doi.org/10.46298/theoretics.23.4\">10.46298/theoretics.23.4</a>","mla":"Banerjee, Tamajit, et al. “Fast Symbolic Algorithms for Mega-Regular Games under Strong Transition Fairness.” <i>TheoretiCS</i>, vol. 2, 4, EPI Sciences, 2023, doi:<a href=\"https://doi.org/10.46298/theoretics.23.4\">10.46298/theoretics.23.4</a>.","chicago":"Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. “Fast Symbolic Algorithms for Mega-Regular Games under Strong Transition Fairness.” <i>TheoretiCS</i>. EPI Sciences, 2023. <a href=\"https://doi.org/10.46298/theoretics.23.4\">https://doi.org/10.46298/theoretics.23.4</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.46298/theoretics.23.4","arxiv":1,"file_date_updated":"2024-02-05T10:19:35Z","intvolume":"         2","oa_version":"Published Version","date_created":"2024-01-31T13:40:49Z","publisher":"EPI Sciences","fulldoi":"https://doi.org/10.46298/theoretics.23.4","type":"journal_article","day":"24"},{"arxiv":1,"doi":"10.1109/isit54713.2023.10206671","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2024-02-02T11:20:39Z","oa_version":"Preprint","conference":{"location":"Taipei, Taiwan","name":"ISIT: International Symposium on Information Theory","end_date":"2023-06-30","start_date":"2023-06-25"},"day":"30","scopus_import":"1","type":"conference","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.03306","open_access":"1"}],"publisher":"IEEE","fulldoi":"https://doi.org/10.1109/isit54713.2023.10206671","quality_controlled":"1","department":[{"_id":"MaMo"}],"_id":"14923","corr_author":"1","citation":{"mla":"Fu, Teng, et al. “Mismatched Estimation of Non-Symmetric Rank-One Matrices Corrupted by Structured Noise.” <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>, IEEE, 2023, pp. 1178–83, doi:<a href=\"https://doi.org/10.1109/isit54713.2023.10206671\">10.1109/isit54713.2023.10206671</a>.","apa":"Fu, T., Liu, Y., Barbier, J., Mondelli, M., Liang, S., &#38; Hou, T. (2023). Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise. In <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i> (pp. 1178–1183). Taipei, Taiwan: IEEE. <a href=\"https://doi.org/10.1109/isit54713.2023.10206671\">https://doi.org/10.1109/isit54713.2023.10206671</a>","ama":"Fu T, Liu Y, Barbier J, Mondelli M, Liang S, Hou T. Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise. In: <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>. IEEE; 2023:1178-1183. doi:<a href=\"https://doi.org/10.1109/isit54713.2023.10206671\">10.1109/isit54713.2023.10206671</a>","chicago":"Fu, Teng, YuHao Liu, Jean Barbier, Marco Mondelli, ShanSuo Liang, and TianQi Hou. “Mismatched Estimation of Non-Symmetric Rank-One Matrices Corrupted by Structured Noise.” In <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>, 1178–83. IEEE, 2023. <a href=\"https://doi.org/10.1109/isit54713.2023.10206671\">https://doi.org/10.1109/isit54713.2023.10206671</a>.","ieee":"T. Fu, Y. Liu, J. Barbier, M. Mondelli, S. Liang, and T. Hou, “Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise,” in <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>, Taipei, Taiwan, 2023, pp. 1178–1183.","ista":"Fu T, Liu Y, Barbier J, Mondelli M, Liang S, Hou T. 2023. Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise. Proceedings of 2023 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 1178–1183.","short":"T. Fu, Y. Liu, J. Barbier, M. Mondelli, S. Liang, T. Hou, in:, Proceedings of 2023 IEEE International Symposium on Information Theory, IEEE, 2023, pp. 1178–1183."},"date_updated":"2025-07-10T11:51:04Z","status":"public","title":"Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise","abstract":[{"lang":"eng","text":"We study the performance of a Bayesian statistician who estimates a rank-one signal corrupted by non-symmetric rotationally invariant noise with a generic distribution of singular values. As the signal-to-noise ratio and the noise structure are unknown, a Gaussian setup is incorrectly assumed. We derive the exact analytic expression for the error of the mismatched Bayes estimator and also provide the analysis of an approximate message passing (AMP) algorithm. The first result exploits the asymptotic behavior of spherical integrals for rectangular matrices and of low-rank matrix perturbations; the second one relies on the design and analysis of an auxiliary AMP. The numerical experiments show that there is a performance gap between the AMP and Bayes estimators, which is due to the incorrect estimation of the signal norm."}],"page":"1178-1183","oa":1,"publication_identifier":{"eissn":["2157-8117"],"isbn":["9781665475549"]},"year":"2023","external_id":{"arxiv":["2302.03306"]},"publication_status":"published","author":[{"full_name":"Fu, Teng","first_name":"Teng","last_name":"Fu"},{"first_name":"YuHao","last_name":"Liu","full_name":"Liu, YuHao"},{"last_name":"Barbier","first_name":"Jean","full_name":"Barbier, Jean"},{"orcid":"0000-0002-3242-7020","first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco"},{"full_name":"Liang, ShanSuo","last_name":"Liang","first_name":"ShanSuo"},{"full_name":"Hou, TianQi","last_name":"Hou","first_name":"TianQi"}],"language":[{"iso":"eng"}],"publication":"Proceedings of 2023 IEEE International Symposium on Information Theory","month":"06","article_processing_charge":"No","date_published":"2023-06-30T00:00:00Z"},{"date_published":"2023-02-28T00:00:00Z","article_processing_charge":"No","month":"02","publication":"Transactions on Machine Learning Research","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"author":[{"first_name":"Diyuan","last_name":"Wu","id":"1a5914c2-896a-11ed-bdf8-fb80621a0635","full_name":"Wu, Diyuan"},{"last_name":"Kungurtsev","first_name":"Vyacheslav","full_name":"Kungurtsev, Vyacheslav"},{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco"}],"ddc":["000"],"publication_status":"published","external_id":{"arxiv":["2210.06819"]},"year":"2023","oa":1,"status":"public","title":"Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"abstract":[{"lang":"eng","text":"The stochastic heavy ball method (SHB), also known as stochastic gradient descent (SGD) with Polyak's momentum, is widely used in training neural networks. However, despite the remarkable success of such algorithm in practice, its theoretical characterization remains limited. In this paper, we focus on neural networks with two and three layers and provide a rigorous understanding of the properties of the solutions found by SHB: \\emph{(i)} stability after dropping out part of the neurons, \\emph{(ii)} connectivity along a low-loss path, and \\emph{(iii)} convergence to the global optimum.\r\nTo achieve this goal, we take a mean-field view and relate the SHB dynamics to a certain partial differential equation in the limit of large network widths. This mean-field perspective has inspired a recent line of work focusing on SGD while, in contrast, our paper considers an algorithm with momentum. More specifically, after proving existence and uniqueness of the limit differential equations, we show convergence to the global optimum and give a quantitative bound between the mean-field limit and the SHB dynamics of a finite-width network. Armed with this last bound, we are able to establish the dropout-stability and connectivity of SHB solutions."}],"acknowledgement":"D. Wu and M. Mondelli are partially supported by the 2019 Lopez-Loreta Prize. V. Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16_019/0000765 \"Research Center for Informatics\".","corr_author":"1","has_accepted_license":"1","date_updated":"2026-06-18T17:41:36Z","citation":{"chicago":"Wu, Diyuan, Vyacheslav Kungurtsev, and Marco Mondelli. “Mean-Field Analysis for Heavy Ball Methods: Dropout-Stability, Connectivity, and Global Convergence.” In <i>Transactions on Machine Learning Research</i>. ML Research Press, 2023.","apa":"Wu, D., Kungurtsev, V., &#38; Mondelli, M. (2023). Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence. In <i>Transactions on Machine Learning Research</i>. ML Research Press.","ama":"Wu D, Kungurtsev V, Mondelli M. Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence. In: <i>Transactions on Machine Learning Research</i>. ML Research Press; 2023.","mla":"Wu, Diyuan, et al. “Mean-Field Analysis for Heavy Ball Methods: Dropout-Stability, Connectivity, and Global Convergence.” <i>Transactions on Machine Learning Research</i>, ML Research Press, 2023.","short":"D. Wu, V. Kungurtsev, M. Mondelli, in:, Transactions on Machine Learning Research, ML Research Press, 2023.","ista":"Wu D, Kungurtsev V, Mondelli M. 2023. Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence. Transactions on Machine Learning Research. , TMLR, .","ieee":"D. Wu, V. Kungurtsev, and M. Mondelli, “Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence,” in <i>Transactions on Machine Learning Research</i>, 2023."},"quality_controlled":"1","alternative_title":["TMLR"],"_id":"14924","department":[{"_id":"MaMo"}],"oa_version":"Published Version","date_created":"2024-02-02T11:21:56Z","publisher":"ML Research Press","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2210.06819","open_access":"1"}],"day":"28","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1},{"ddc":["000"],"article_type":"original","publication_status":"published","year":"2023","oa":1,"publication_identifier":{"eissn":["2835-8856"]},"title":"Image retrieval outperforms diffusion models on data augmentation","status":"public","acknowledgement":"The authors would like to thank Varad Gunjal and Vishaal Udandarao. MFB thanks the International Max Planck Research School for Intelligent Systems (IMPRS-IS).","abstract":[{"lang":"eng","text":"Many approaches have been proposed to use diffusion models to augment training datasets for downstream tasks, such as classification. However, diffusion models are themselves trained on large datasets, often with noisy annotations, and it remains an open question to which extent these models contribute to downstream classification performance. In particular, it remains unclear if they generalize enough to improve over directly using the additional data of their pre-training process for augmentation. We systematically evaluate a range of existing methods to generate images from diffusion models and study new extensions to assess their benefit for data augmentation. Personalizing diffusion models towards the target data outperforms simpler prompting strategies. However, using the pre-training data of the diffusion model alone, via a simple nearest-neighbor retrieval procedure, leads to even stronger downstream performance. Our study explores the potential of diffusion models in generating new training data, and surprisingly finds that these sophisticated models are not yet able to beat a simple and strong image retrieval baseline on simple downstream vision tasks."}],"month":"12","publication":"Journal of Machine Learning Research","article_processing_charge":"No","date_published":"2023-12-10T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"author":[{"last_name":"Burg","first_name":"Max","full_name":"Burg, Max"},{"full_name":"Wenzel, Florian","first_name":"Florian","last_name":"Wenzel"},{"first_name":"Dominik","last_name":"Zietlow","full_name":"Zietlow, Dominik"},{"first_name":"Max","last_name":"Horn","full_name":"Horn, Max"},{"first_name":"Osama","last_name":"Makansi","full_name":"Makansi, Osama"},{"full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","last_name":"Locatello","first_name":"Francesco"},{"last_name":"Russell","first_name":"Chris","full_name":"Russell, Chris"}],"language":[{"iso":"eng"}],"date_created":"2024-02-07T14:57:39Z","oa_version":"Published Version","main_file_link":[{"url":"https://openreview.net/forum?id=xflYdGZMpv","open_access":"1"}],"day":"10","type":"journal_article","publisher":"ML Research Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2024-02-07T14:57:32Z","has_accepted_license":"1","file":[{"creator":"ptazenko","access_level":"open_access","relation":"main_file","date_created":"2024-02-07T14:57:32Z","date_updated":"2024-02-07T14:57:32Z","checksum":"af87ddea7908923426365347b9c87ba7","file_id":"14950","file_name":"Burg_et_al_2023_Image_retrieval_outperforms.pdf","file_size":27325153,"content_type":"application/pdf"}],"date_updated":"2024-02-12T08:30:21Z","citation":{"chicago":"Burg, Max, Florian Wenzel, Dominik Zietlow, Max Horn, Osama Makansi, Francesco Locatello, and Chris Russell. “Image Retrieval Outperforms Diffusion Models on Data Augmentation.” <i>Journal of Machine Learning Research</i>. ML Research Press, 2023.","ama":"Burg M, Wenzel F, Zietlow D, et al. Image retrieval outperforms diffusion models on data augmentation. <i>Journal of Machine Learning Research</i>. 2023.","apa":"Burg, M., Wenzel, F., Zietlow, D., Horn, M., Makansi, O., Locatello, F., &#38; Russell, C. (2023). Image retrieval outperforms diffusion models on data augmentation. <i>Journal of Machine Learning Research</i>. ML Research Press.","mla":"Burg, Max, et al. “Image Retrieval Outperforms Diffusion Models on Data Augmentation.” <i>Journal of Machine Learning Research</i>, ML Research Press, 2023.","short":"M. Burg, F. Wenzel, D. Zietlow, M. Horn, O. Makansi, F. Locatello, C. Russell, Journal of Machine Learning Research (2023).","ista":"Burg M, Wenzel F, Zietlow D, Horn M, Makansi O, Locatello F, Russell C. 2023. Image retrieval outperforms diffusion models on data augmentation. Journal of Machine Learning Research.","ieee":"M. Burg <i>et al.</i>, “Image retrieval outperforms diffusion models on data augmentation,” <i>Journal of Machine Learning Research</i>. ML Research Press, 2023."},"quality_controlled":"1","alternative_title":["TMLR"],"_id":"14949","department":[{"_id":"FrLo"}]},{"month":"12","publication":"Causal Representation Learning Workshop at NeurIPS 2023","date_published":"2023-12-05T00:00:00Z","article_processing_charge":"No","article_number":"54","OA_type":"green","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"author":[{"full_name":"Xu, Danru","first_name":"Danru","last_name":"Xu"},{"full_name":"Yao, Dingling","id":"d3e02e50-48a8-11ee-8f62-c108061797fa","last_name":"Yao","first_name":"Dingling"},{"first_name":"Sebastien","last_name":"Lachapelle","full_name":"Lachapelle, Sebastien"},{"full_name":"Taslakian, Perouz","first_name":"Perouz","last_name":"Taslakian"},{"last_name":"von Kügelgen","first_name":"Julius","full_name":"von Kügelgen, Julius"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello"},{"last_name":"Magliacane","first_name":"Sara","full_name":"Magliacane, Sara"}],"language":[{"iso":"eng"}],"ddc":["000"],"publication_status":"published","oa":1,"year":"2023","OA_place":"repository","title":"A sparsity principle for partially observable causal representation learning","status":"public","abstract":[{"text":"Causal representation learning (CRL) aims at identifying high-level causal variables from low-level data, e.g. images. Current methods usually assume that all causal variables are captured in the high-dimensional observations. In this work, we focus on learning causal representations from data under partial observability, i.e., when some of the causal variables are not observed in the measurements, and the set of masked variables changes across the different samples. We introduce some initial theoretical results for identifying causal variables under partial observability by exploiting a sparsity regularizer, focusing in particular on the linear and piecewise linear mixing function case. We provide a theorem that allows us to identify the causal variables up to permutation and element-wise linear transformations in the linear case and a lemma that allows us to identify causal variables up to linear transformation in the piecewise case. Finally, we provide a conjecture that would allow us to identify the causal variables up to permutation and element-wise linear transformations also in the piecewise linear case. We test the theorem and conjecture on simulated data, showing the effectiveness of our method.","lang":"eng"}],"acknowledgement":"This work was initiated at the Second Bellairs Workshop on Causality held at the Bellairs Research Institute, January 6–13, 2022; we thank all workshop participants for providing a stimulating research environment. The research of DX and SM was supported by the Air Force Office of Scientific Research under award number FA8655-22-1-7155. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the United States Air Force. We also thank SURF for the support in using the Dutch National Supercomputer Snellius. DY was supported by an Amazon fellowship and the International Max Planck Research School for Intelligent Systems (IMPRS-IS). Work done outside of Amazon. SL was supported by an IVADO excellence PhD scholarship and by Samsung Electronics Co., Ldt. JvK acknowledges support from the German Federal Ministry of Education and Research (BMBF)\r\nthrough the Tübingen AI Center (FKZ: 01IS18039B).\r\n","has_accepted_license":"1","file":[{"date_updated":"2024-02-13T08:50:53Z","checksum":"484efc27bda75ed6666044989695d9b6","file_id":"14982","creator":"dernst","relation":"main_file","access_level":"open_access","date_created":"2024-02-13T08:50:53Z","success":1,"content_type":"application/pdf","file_name":"2023_CRL_Xu.pdf","file_size":552357}],"date_updated":"2025-02-04T12:37:34Z","citation":{"ista":"Xu D, Yao D, Lachapelle S, Taslakian P, von Kügelgen J, Locatello F, Magliacane S. 2023. A sparsity principle for partially observable causal representation learning. Causal Representation Learning Workshop at NeurIPS 2023. CRL: Causal Representation Learning Workshop at NeurIPS, 54.","ieee":"D. Xu <i>et al.</i>, “A sparsity principle for partially observable causal representation learning,” in <i>Causal Representation Learning Workshop at NeurIPS 2023</i>, New Orleans, LA, United States, 2023.","short":"D. Xu, D. Yao, S. Lachapelle, P. Taslakian, J. von Kügelgen, F. Locatello, S. Magliacane, in:, Causal Representation Learning Workshop at NeurIPS 2023, OpenReview, 2023.","apa":"Xu, D., Yao, D., Lachapelle, S., Taslakian, P., von Kügelgen, J., Locatello, F., &#38; Magliacane, S. (2023). A sparsity principle for partially observable causal representation learning. In <i>Causal Representation Learning Workshop at NeurIPS 2023</i>. New Orleans, LA, United States: OpenReview.","ama":"Xu D, Yao D, Lachapelle S, et al. A sparsity principle for partially observable causal representation learning. In: <i>Causal Representation Learning Workshop at NeurIPS 2023</i>. OpenReview; 2023.","mla":"Xu, Danru, et al. “A Sparsity Principle for Partially Observable Causal Representation Learning.” <i>Causal Representation Learning Workshop at NeurIPS 2023</i>, 54, OpenReview, 2023.","chicago":"Xu, Danru, Dingling Yao, Sebastien Lachapelle, Perouz Taslakian, Julius von Kügelgen, Francesco Locatello, and Sara Magliacane. “A Sparsity Principle for Partially Observable Causal Representation Learning.” In <i>Causal Representation Learning Workshop at NeurIPS 2023</i>. OpenReview, 2023."},"quality_controlled":"1","department":[{"_id":"FrLo"}],"_id":"14958","date_created":"2024-02-07T15:17:51Z","conference":{"location":"New Orleans, LA, United States","name":"CRL: Causal Representation Learning Workshop at NeurIPS","end_date":"2023-12-15","start_date":"2023-12-15"},"oa_version":"Published Version","main_file_link":[{"url":"https://openreview.net/forum?id=Whr6uobelR","open_access":"1"}],"day":"05","type":"conference","publisher":"OpenReview","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2024-02-13T08:50:53Z"},{"author":[{"first_name":"Francesco","last_name":"Montagna","full_name":"Montagna, Francesco"},{"full_name":"Noceti, Nicoletta","first_name":"Nicoletta","last_name":"Noceti"},{"full_name":"Rosasco, Lorenzo","first_name":"Lorenzo","last_name":"Rosasco"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello"}],"department":[{"_id":"FrLo"}],"_id":"14961","language":[{"iso":"eng"}],"publication":"arXiv","month":"10","date_published":"2023-10-22T00:00:00Z","article_processing_charge":"No","corr_author":"1","citation":{"chicago":"Montagna, Francesco, Nicoletta Noceti, Lorenzo Rosasco, and Francesco Locatello. “Shortcuts for Causal Discovery of Nonlinear Models by Score Matching.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2310.14246\">https://doi.org/10.48550/arXiv.2310.14246</a>.","apa":"Montagna, F., Noceti, N., Rosasco, L., &#38; Locatello, F. (n.d.). Shortcuts for causal discovery of nonlinear models by score matching. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2310.14246\">https://doi.org/10.48550/arXiv.2310.14246</a>","ama":"Montagna F, Noceti N, Rosasco L, Locatello F. Shortcuts for causal discovery of nonlinear models by score matching. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2310.14246\">10.48550/arXiv.2310.14246</a>","mla":"Montagna, Francesco, et al. “Shortcuts for Causal Discovery of Nonlinear Models by Score Matching.” <i>ArXiv</i>, 2310.14246, doi:<a href=\"https://doi.org/10.48550/arXiv.2310.14246\">10.48550/arXiv.2310.14246</a>.","short":"F. Montagna, N. Noceti, L. Rosasco, F. Locatello, ArXiv (n.d.).","ista":"Montagna F, Noceti N, Rosasco L, Locatello F. Shortcuts for causal discovery of nonlinear models by score matching. arXiv, 2310.14246.","ieee":"F. Montagna, N. Noceti, L. Rosasco, and F. Locatello, “Shortcuts for causal discovery of nonlinear models by score matching,” <i>arXiv</i>. ."},"date_updated":"2024-10-09T21:08:10Z","article_number":"2310.14246","arxiv":1,"title":"Shortcuts for causal discovery of nonlinear models by score matching","status":"public","doi":"10.48550/arXiv.2310.14246","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The use of simulated data in the field of causal discovery is ubiquitous due to the scarcity of annotated real data. Recently, Reisach et al., 2021 highlighted the emergence of patterns in simulated linear data, which displays increasing marginal variance in the casual direction. As an ablation in their experiments, Montagna et al., 2023 found that similar patterns may emerge in\r\nnonlinear models for the variance of the score vector $\\nabla \\log p_{\\mathbf{X}}$, and introduced the ScoreSort algorithm. In this work, we formally define and characterize this score-sortability pattern of nonlinear additive noise models. We find that it defines a class of identifiable (bivariate) causal models overlapping with nonlinear additive noise models. We\r\ntheoretically demonstrate the advantages of ScoreSort in terms of statistical efficiency compared to prior state-of-the-art score matching-based methods and empirically show the score-sortability of the most common synthetic benchmarks in the literature. Our findings remark (1) the lack of diversity in the data as an important limitation in the evaluation of nonlinear causal discovery approaches, (2) the importance of thoroughly testing different settings within a problem class, and (3) the importance of analyzing statistical properties in\r\ncausal discovery, where research is often limited to defining identifiability conditions of the model. "}],"date_created":"2024-02-08T15:31:46Z","oa_version":"Preprint","type":"preprint","day":"22","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.14246"}],"fulldoi":"https://doi.org/10.48550/arXiv.2310.14246","external_id":{"arxiv":["2310.14246"]},"year":"2023","oa":1,"publication_status":"submitted"},{"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Unsupervised open-vocabulary object localization in videos","doi":"10.48550/arXiv.2309.09858","abstract":[{"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.","lang":"eng"}],"date_created":"2024-02-08T15:33:39Z","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2309.09858"}],"type":"preprint","day":"18","publication_status":"submitted","extern":"1","fulldoi":"https://doi.org/10.48550/arXiv.2309.09858","year":"2023","external_id":{"arxiv":["2309.09858"]},"oa":1,"department":[{"_id":"FrLo"}],"_id":"14962","author":[{"full_name":"Fan, Ke","first_name":"Ke","last_name":"Fan"},{"first_name":"Zechen","last_name":"Bai","full_name":"Bai, Zechen"},{"first_name":"Tianjun","last_name":"Xiao","full_name":"Xiao, Tianjun"},{"full_name":"Zietlow, Dominik","last_name":"Zietlow","first_name":"Dominik"},{"last_name":"Horn","first_name":"Max","full_name":"Horn, Max"},{"last_name":"Zhao","first_name":"Zixu","full_name":"Zhao, Zixu"},{"full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel","last_name":"Carl-Johann Simon-Gabriel","first_name":"Carl-Johann Simon-Gabriel"},{"last_name":"Shou","first_name":"Mike Zheng","full_name":"Shou, Mike Zheng"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","last_name":"Locatello","orcid":"0000-0002-4850-0683","first_name":"Francesco"},{"first_name":"Bernt","last_name":"Schiele","full_name":"Schiele, Bernt"},{"last_name":"Brox","first_name":"Thomas","full_name":"Brox, Thomas"},{"full_name":"Zhang, Zheng","first_name":"Zheng","last_name":"Zhang"},{"first_name":"Yanwei","last_name":"Fu","full_name":"Fu, Yanwei"},{"full_name":"He, Tong","first_name":"Tong","last_name":"He"}],"language":[{"iso":"eng"}],"month":"09","publication":"arXiv","article_processing_charge":"No","date_published":"2023-09-18T00:00:00Z","article_number":"2309.09858","date_updated":"2024-02-12T10:12:22Z","citation":{"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.","ieee":"K. Fan <i>et al.</i>, “Unsupervised open-vocabulary object localization in videos,” <i>arXiv</i>. .","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.).","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>","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>.","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>."}},{"_id":"14963","department":[{"_id":"FrLo"}],"author":[{"last_name":"Zhao","first_name":"Zixu","full_name":"Zhao, Zixu"},{"full_name":"Wang, Jiaze","first_name":"Jiaze","last_name":"Wang"},{"last_name":"Horn","first_name":"Max","full_name":"Horn, Max"},{"last_name":"Ding","first_name":"Yizhuo","full_name":"Ding, Yizhuo"},{"last_name":"He","first_name":"Tong","full_name":"He, Tong"},{"first_name":"Zechen","last_name":"Bai","full_name":"Bai, Zechen"},{"full_name":"Zietlow, Dominik","last_name":"Zietlow","first_name":"Dominik"},{"first_name":"Carl-Johann Simon-Gabriel","last_name":"Carl-Johann Simon-Gabriel","full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel"},{"full_name":"Shuai, Bing","first_name":"Bing","last_name":"Shuai"},{"first_name":"Zhuowen","last_name":"Tu","full_name":"Tu, Zhuowen"},{"last_name":"Brox","first_name":"Thomas","full_name":"Brox, Thomas"},{"first_name":"Bernt","last_name":"Schiele","full_name":"Schiele, Bernt"},{"full_name":"Fu, Yanwei","last_name":"Fu","first_name":"Yanwei"},{"last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"last_name":"Zhang","first_name":"Zheng","full_name":"Zhang, Zheng"},{"last_name":"Xiao","first_name":"Tianjun","full_name":"Xiao, Tianjun"}],"language":[{"iso":"eng"}],"article_number":"2309.00233","date_updated":"2024-02-12T10:16:21Z","citation":{"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>.","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>","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>","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>.","ieee":"Z. Zhao <i>et al.</i>, “Object-centric multiple object tracking,” <i>arXiv</i>. .","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.","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.)."},"month":"09","publication":"arXiv","article_processing_charge":"No","date_published":"2023-09-01T00:00:00Z","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."}],"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","doi":"10.48550/arXiv.2309.00233","title":"Object-centric multiple object tracking","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2309.00233","open_access":"1"}],"day":"01","type":"preprint","publication_status":"submitted","extern":"1","fulldoi":"https://doi.org/10.48550/arXiv.2309.00233","year":"2023","oa":1,"external_id":{"arxiv":["2309.00233"]},"date_created":"2024-02-08T15:34:43Z","oa_version":"Preprint"},{"department":[{"_id":"FrLo"}],"_id":"14965","date_updated":"2025-01-29T10:53:48Z","citation":{"chicago":"Ficek, Joanna, Kjong-Van Lehmann, Francesco Locatello, Gunnar  Raetsch, and Stefan 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.","mla":"Ficek, Joanna, et al. <i>Methods of Determining Correspondences between Biological Properties of Cells</i>. 2023.","short":"J. Ficek, K.-V. Lehmann, F. Locatello, G. Raetsch, S. Stark, (2023).","ista":"Ficek J, Lehmann K-V, Locatello F, Raetsch G, Stark S. 2023. Methods of determining correspondences between biological properties of cells.","ieee":"J. Ficek, K.-V. Lehmann, F. Locatello, G. Raetsch, and S. Stark, “Methods of determining correspondences between biological properties of cells.” 2023."},"has_accepted_license":"1","file":[{"date_updated":"2024-02-08T15:41:51Z","checksum":"55ed444b176b48e4fb4d609ea895de36","file_id":"14966","creator":"ptazenko","relation":"main_file","access_level":"open_access","date_created":"2024-02-08T15:41:51Z","success":1,"content_type":"application/pdf","file_size":2893462,"file_name":"Patent_FrLo_US20230162818A1.pdf"}],"file_date_updated":"2024-02-08T15:41:51Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_date":"2023-05-25","day":"25","type":"patent","ipc":"C12Q1/68 ; G06V10/82 ; G06V20/69 ; G16B40/30","date_created":"2024-02-08T15:52:21Z","oa_version":"Published Version","author":[{"last_name":"Ficek","first_name":"Joanna","full_name":"Ficek, Joanna"},{"first_name":"Kjong-Van","last_name":"Lehmann","full_name":"Lehmann, Kjong-Van"},{"orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"last_name":"Raetsch","first_name":"Gunnar ","full_name":"Raetsch, Gunnar "},{"full_name":"Stark, Stefan","last_name":"Stark","first_name":"Stefan"}],"applicant":["ETH Zürich"],"month":"05","article_processing_charge":"No","date_published":"2023-05-25T00:00:00Z","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"}],"application_number":"PCT/EP2021/060318","OA_place":"repository","application_date":"2021-04-21","status":"public","title":"Methods of determining correspondences between biological properties of cells","page":"9","ipn":"US20230162818A1","extern":"1","oa":1,"year":"2023","ddc":["540"]},{"date_updated":"2025-08-05T11:19:37Z","citation":{"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.","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.","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.","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.","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>.","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>."},"file":[{"date_created":"2024-02-08T16:03:08Z","relation":"main_file","access_level":"open_access","creator":"ptazenko","file_id":"14975","checksum":"105ff58e55de866ce76967f3a95e82f7","date_updated":"2024-02-08T16:03:08Z","file_size":215629,"file_name":"CLeaR23_roundtable_discussion.pdf","content_type":"application/pdf"}],"article_processing_charge":"No","date_published":"2023-05-01T00:00:00Z","month":"05","has_accepted_license":"1","publication":"2nd Conference on Causal Learning and Reasoning","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"_id":"14974","author":[{"first_name":"Cheng","last_name":"Zhang","full_name":"Zhang, Cheng"},{"full_name":"Janzing, Dominik","first_name":"Dominik","last_name":"Janzing"},{"full_name":"van der Schaar, Mihaela ","last_name":"van der Schaar","first_name":"Mihaela "},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello"},{"last_name":"Spirtes","first_name":"Peter","full_name":"Spirtes, Peter"},{"full_name":"Zhang, Kun","last_name":"Zhang","first_name":"Kun"},{"full_name":"Schölkopf, Bernhard","first_name":"Bernhard","last_name":"Schölkopf"},{"first_name":"Caroline","orcid":"0000-0002-7008-0216","last_name":"Uhler","full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","publication_status":"submitted","extern":"1","year":"2023","oa":1,"day":"01","type":"conference","conference":{"location":"Tübingen, Germany","name":"CLeaR: Conference on Causal Learning and Reasoning","end_date":"2023-04-14","start_date":"2023-04-11"},"oa_version":"Submitted Version","date_created":"2024-02-08T16:03:18Z","ddc":["000"],"file_date_updated":"2024-02-08T16:03:08Z","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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Causality in the time of LLMs: Round table discussion results of CLeaR 2023","status":"public"},{"abstract":[{"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.","lang":"eng"}],"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.","issue":"1","title":"Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS","status":"public","page":"161-170","oa":1,"publication_identifier":{"eissn":["2767-441X"]},"year":"2023","publication_status":"published","ddc":["540"],"article_type":"original","author":[{"last_name":"Liu","first_name":"Zhengtao","full_name":"Liu, Zhengtao"},{"full_name":"Hong, Tao","first_name":"Tao","last_name":"Hong"},{"full_name":"Xu, Liqing","last_name":"Xu","first_name":"Liqing"},{"full_name":"Wang, Sining","last_name":"Wang","first_name":"Sining"},{"full_name":"Gao, Xiang","last_name":"Gao","first_name":"Xiang"},{"id":"9E331C2E-9F27-11E9-AE48-5033E6697425","full_name":"Chang, Cheng","orcid":"0000-0002-9515-4277","first_name":"Cheng","last_name":"Chang"},{"full_name":"Ding, Xiangdong","first_name":"Xiangdong","last_name":"Ding"},{"first_name":"Yu","last_name":"Xiao","full_name":"Xiao, Yu"},{"full_name":"Zhao, Li‐Dong","last_name":"Zhao","first_name":"Li‐Dong"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"publication":"Interdisciplinary Materials","month":"01","date_published":"2023-01-01T00:00:00Z","article_processing_charge":"Yes","volume":2,"file_date_updated":"2024-02-19T09:58:32Z","doi":"10.1002/idm2.12056","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","type":"journal_article","fulldoi":"https://doi.org/10.1002/idm2.12056","publisher":"Wiley","date_created":"2024-02-14T12:12:17Z","oa_version":"Published Version","intvolume":"         2","_id":"14985","department":[{"_id":"MaIb"}],"quality_controlled":"1","citation":{"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.","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.","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>","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>.","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>."},"date_updated":"2024-02-19T10:01:26Z","has_accepted_license":"1","file":[{"file_name":"2023_InterdiscMaterials_Liu.pdf","file_size":4675941,"content_type":"application/pdf","success":1,"date_created":"2024-02-19T09:58:32Z","access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"15015","checksum":"7b5e8210ef1434feb173022c6dbbee0c","date_updated":"2024-02-19T09:58:32Z"}]},{"publication_status":"published","year":"2023","publication_identifier":{"isbn":["1891562835"]},"oa":1,"ddc":["000"],"acknowledgement":"This work is supported by the Novi team at Meta and funded in part by IC3 industry partners and NSF grant 1943499.","abstract":[{"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.","lang":"eng"}],"title":"Parakeet: Practical key transparency for end-to-end eEncrypted messaging","status":"public","date_published":"2023-03-01T00:00:00Z","article_processing_charge":"No","month":"03","publication":"Proceedings of the 2023 Network and Distributed System Security Symposium","language":[{"iso":"eng"}],"author":[{"full_name":"Malvai, Harjasleen","last_name":"Malvai","first_name":"Harjasleen"},{"last_name":"Kokoris Kogias","orcid":"0000-0002-8827-3382","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"last_name":"Sonnino","first_name":"Alberto","full_name":"Sonnino, Alberto"},{"last_name":"Ghosh","first_name":"Esha","full_name":"Ghosh, Esha"},{"last_name":"Oztürk","first_name":"Ercan","full_name":"Oztürk, Ercan"},{"first_name":"Kevin","last_name":"Lewi","full_name":"Lewi, Kevin"},{"first_name":"Sean","last_name":"Lawlor","full_name":"Lawlor, Sean"}],"publisher":"Internet Society","fulldoi":"https://doi.org/10.14722/ndss.2023.24545","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2023/081"}],"type":"conference","day":"01","scopus_import":"1","conference":{"end_date":"2023-03-03","start_date":"2023-02-27","location":"San Diego, CA, United States","name":"NDSS: Network and Distributed Systems Security"},"oa_version":"Published Version","date_created":"2024-02-14T14:20:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.14722/ndss.2023.24545","date_updated":"2026-06-18T17:41:59Z","citation":{"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>","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>","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>.","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>.","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.","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.","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."},"_id":"14989","department":[{"_id":"ElKo"}],"quality_controlled":"1"},{"date_updated":"2025-09-09T12:28:12Z","citation":{"short":"T. Meggendorfer, (2023).","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>.","ieee":"T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.","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>.","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>","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>."},"month":"01","has_accepted_license":"1","corr_author":"1","date_published":"2023-01-18T00:00:00Z","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"_id":"14990","department":[{"_id":"KrCh"}],"author":[{"orcid":"0000-0002-1712-2165","first_name":"Tobias","last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias"}],"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7548214","open_access":"1"}],"day":"18","type":"research_data_reference","year":"2023","fulldoi":"https://doi.org/10.5281/ZENODO.7548214","oa":1,"publisher":"Zenodo","ddc":["000"],"date_created":"2024-02-14T14:27:06Z","oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"13139","relation":"used_in_publication"}]},"abstract":[{"text":"The software artefact to evaluate the approximation of stationary distributions implementation.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Artefact for: Correct Approximation of Stationary Distributions","doi":"10.5281/ZENODO.7548214"},{"fulldoi":"https://doi.org/10.5281/ZENODO.7757041","oa":1,"publisher":"Zenodo","year":"2023","type":"research_data_reference","day":"23","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7757041"}],"oa_version":"Published Version","ddc":["550"],"date_created":"2024-02-14T14:37:57Z","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)."}],"project":[{"name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"related_material":{"record":[{"id":"14654","relation":"used_in_publication","status":"public"}]},"title":"Data-assessing memory in convection schemes using idealized tests","status":"public","doi":"10.5281/ZENODO.7757041","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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>","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>.","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>.","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.","short":"Y.-L. Hwong, M. Colin, P. Aglas, C.J. Muller, S.C. Sherwood, (2023)."},"date_updated":"2025-09-09T13:35:40Z","ec_funded":1,"article_processing_charge":"No","date_published":"2023-06-23T00:00:00Z","corr_author":"1","month":"06","has_accepted_license":"1","author":[{"last_name":"Hwong","first_name":"Yi-Ling","orcid":"0000-0001-9281-3479","id":"1217aa61-4dd1-11ec-9ac3-f2ba3f17ee22","full_name":"Hwong, Yi-Ling"},{"first_name":"Maxime","last_name":"Colin","full_name":"Colin, Maxime"},{"first_name":"Philipp","last_name":"Aglas","full_name":"Aglas, Philipp","id":"02eace56-97fc-11ee-b81a-f0939ca85a77"},{"id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","full_name":"Muller, Caroline J","first_name":"Caroline J","orcid":"0000-0001-5836-5350","last_name":"Muller"},{"full_name":"Sherwood, Steven C.","last_name":"Sherwood","first_name":"Steven C."}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"department":[{"_id":"CaMu"}],"_id":"14991"},{"status":"public","title":"Universal Functionals in Density Functional Theory","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"}],"external_id":{"arxiv":["1912.10424"]},"publication_identifier":{"issn":["3005-0286"],"eisbn":["9783031223402"],"isbn":["9783031223396"]},"year":"2023","oa":1,"publication_status":"published","page":"115-182","language":[{"iso":"eng"}],"author":[{"first_name":"Mathieu","last_name":"Lewin","full_name":"Lewin, Mathieu"},{"full_name":"Lieb, Elliott H.","first_name":"Elliott H.","last_name":"Lieb"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"article_processing_charge":"No","date_published":"2023-07-19T00:00:00Z","publication":"Density Functional Theory","month":"07","doi":"10.1007/978-3-031-22340-2_3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"edition":"1","oa_version":"Preprint","editor":[{"last_name":"Cances","first_name":"Eric","full_name":"Cances, Eric"},{"full_name":"Friesecke, Gero","first_name":"Gero","last_name":"Friesecke"}],"date_created":"2024-02-14T14:44:33Z","fulldoi":"https://doi.org/10.1007/978-3-031-22340-2_3","publisher":"Springer","day":"19","type":"book_chapter","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1912.10424","open_access":"1"}],"quality_controlled":"1","series_title":"MAMOMO","_id":"14992","alternative_title":["Mathematics and Molecular Modeling"],"department":[{"_id":"RoSe"}],"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.","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.","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>.","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>.","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>","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>"},"date_updated":"2024-02-20T08:33:06Z"},{"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.","abstract":[{"lang":"eng","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A framework for grassroots research collaboration in machine learning and global health","status":"public","publication_status":"published","year":"2023","publisher":"OpenReview","oa":1,"main_file_link":[{"url":"https://openreview.net/forum?id=jHY_G91R880","open_access":"1"}],"type":"conference","day":"02","conference":{"location":"Kigali, Rwanda","name":"ICLR: International Conference on Learning Representations","end_date":"2023-05-05","start_date":"2023-05-05"},"oa_version":"Published Version","ddc":["000"],"date_created":"2024-02-14T15:11:48Z","language":[{"iso":"eng"}],"department":[{"_id":"TiVo"}],"_id":"14993","author":[{"orcid":"0000-0002-4809-5059","first_name":"Christopher","last_name":"Currin","full_name":"Currin, Christopher","id":"e8321fc5-3091-11eb-8a53-83f309a11ac9"},{"last_name":"Asiedu ","first_name":"Mercy Nyamewaa","full_name":"Asiedu , Mercy Nyamewaa"},{"full_name":"Fourie, Chris","first_name":"Chris","last_name":"Fourie"},{"full_name":"Rosman, Benjamin","first_name":"Benjamin","last_name":"Rosman"},{"full_name":"Turki, Houcemeddine","first_name":"Houcemeddine","last_name":"Turki"},{"full_name":"Lambebo Tonja, Atnafu","last_name":"Lambebo Tonja","first_name":"Atnafu"},{"full_name":"Abbott, Jade","first_name":"Jade","last_name":"Abbott"},{"first_name":"Marvellous","last_name":"Ajala","full_name":"Ajala, Marvellous"},{"full_name":"Adedayo, Sadiq Adewale","first_name":"Sadiq Adewale","last_name":"Adedayo"},{"last_name":"Emezue","first_name":"Chris Chinenye","full_name":"Emezue, Chris Chinenye"},{"first_name":"Daphne","last_name":"Machangara","full_name":"Machangara, Daphne"}],"quality_controlled":"1","date_updated":"2026-06-18T17:42:25Z","citation":{"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.","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.","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.","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.","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.","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."},"article_processing_charge":"No","date_published":"2023-03-02T00:00:00Z","month":"03","publication":"1st Workshop on Machine Learning & Global Health"},{"related_material":{"record":[{"id":"14758","relation":"used_in_publication","status":"public"}]},"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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.5281/ZENODO.7877790","title":"A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7877790"}],"type":"research_data_reference","day":"28","fulldoi":"https://doi.org/10.5281/ZENODO.7877790","oa":1,"publisher":"Zenodo","year":"2023","date_created":"2024-02-14T15:13:00Z","ddc":["000"],"oa_version":"Published Version","department":[{"_id":"ToHe"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"_id":"14994","author":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"last_name":"Mallik","orcid":"0000-0001-9864-7475","first_name":"Kaushik","full_name":"Mallik, Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"full_name":"Rychlicki, Mateusz","last_name":"Rychlicki","first_name":"Mateusz"},{"first_name":"Anne-Kathrin","last_name":"Schmuck","full_name":"Schmuck, Anne-Kathrin"},{"first_name":"Sadegh","last_name":"Soudjani","full_name":"Soudjani, Sadegh"}],"date_updated":"2025-09-09T14:16:48Z","citation":{"short":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, S. Soudjani, (2023).","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.","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>.","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>.","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>.","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>","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>"},"month":"04","has_accepted_license":"1","corr_author":"1","article_processing_charge":"No","date_published":"2023-04-28T00:00:00Z"},{"author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","full_name":"Chalupa, Marek","last_name":"Chalupa","first_name":"Marek"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"_id":"15035","department":[{"_id":"ToHe"}],"month":"07","has_accepted_license":"1","date_published":"2023-07-28T00:00:00Z","article_processing_charge":"No","corr_author":"1","ec_funded":1,"citation":{"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>.","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>","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>","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).","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>.","ieee":"M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers.” Zenodo, 2023."},"date_updated":"2025-04-14T09:42:55Z","title":"Monitoring hyperproperties with prefix transducers","status":"public","doi":"10.5281/ZENODO.8191723","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"14076","relation":"used_in_publication","status":"public"}]},"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."}],"project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"ddc":["000"],"date_created":"2024-02-28T07:34:34Z","oa_version":"Published Version","day":"28","type":"research_data_reference","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.8191722","open_access":"1"}],"oa":1,"fulldoi":"https://doi.org/10.5281/ZENODO.8191723","year":"2023","publisher":"Zenodo"},{"author":[{"full_name":"Drout, M. R.","last_name":"Drout","first_name":"M. R."},{"last_name":"Götberg","first_name":"Ylva Louise Linsdotter","orcid":"0000-0002-6960-6911","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","full_name":"Götberg, Ylva Louise Linsdotter"},{"full_name":"Ludwig, B. A.","last_name":"Ludwig","first_name":"B. A."},{"first_name":"J. H.","last_name":"Groh","full_name":"Groh, J. H."},{"full_name":"de Mink, S. E.","last_name":"de Mink","first_name":"S. E."},{"first_name":"A. J. G.","last_name":"O’Grady","full_name":"O’Grady, A. J. G."},{"last_name":"Smith","first_name":"N.","full_name":"Smith, N."}],"language":[{"iso":"eng"}],"publication":"Science","month":"12","date_published":"2023-12-14T00:00:00Z","article_processing_charge":"No","volume":382,"status":"public","title":"An observed population of intermediate-mass helium stars that have been stripped in binaries","issue":"6676","abstract":[{"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.","lang":"eng"}],"keyword":["Stellar Astrophysics"],"article_type":"original","page":"1287-1291","year":"2023","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"external_id":{"pmid":["38096420"],"arxiv":["2307.00061"]},"oa":1,"publication_status":"published","extern":"1","quality_controlled":"1","_id":"15085","pmid":1,"citation":{"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.","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.","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>.","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>.","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>","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>"},"date_updated":"2024-10-14T12:32:01Z","arxiv":1,"doi":"10.1126/science.ade4970","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"url":"https://ista.ac.at/en/news/reaching-for-the-invisible-stars/","description":"News on ISTA Website","relation":"press_release"}]},"date_created":"2024-03-05T09:40:28Z","oa_version":"None","intvolume":"       382","day":"14","type":"journal_article","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2307.00061"}],"fulldoi":"https://doi.org/10.1126/science.ade4970","publisher":"American Association for the Advancement of Science"}]
