[{"status":"public","quality_controlled":"1","file":[{"file_size":552357,"access_level":"open_access","content_type":"application/pdf","file_id":"14982","success":1,"file_name":"2023_CRL_Xu.pdf","date_updated":"2024-02-13T08:50:53Z","relation":"main_file","date_created":"2024-02-13T08:50:53Z","creator":"dernst","checksum":"484efc27bda75ed6666044989695d9b6"}],"abstract":[{"lang":"eng","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."}],"ddc":["000"],"date_published":"2023-12-05T00:00:00Z","article_processing_charge":"No","month":"12","author":[{"first_name":"Danru","last_name":"Xu","full_name":"Xu, Danru"},{"id":"d3e02e50-48a8-11ee-8f62-c108061797fa","first_name":"Dingling","full_name":"Yao, Dingling","last_name":"Yao"},{"full_name":"Lachapelle, Sebastien","last_name":"Lachapelle","first_name":"Sebastien"},{"first_name":"Perouz","full_name":"Taslakian, Perouz","last_name":"Taslakian"},{"first_name":"Julius","last_name":"von Kügelgen","full_name":"von Kügelgen, Julius"},{"first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","full_name":"Locatello, Francesco"},{"first_name":"Sara","last_name":"Magliacane","full_name":"Magliacane, Sara"}],"has_accepted_license":"1","article_number":"54","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication":"Causal Representation Learning Workshop at NeurIPS 2023","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publisher":"OpenReview","title":"A sparsity principle for partially observable causal representation learning","day":"05","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","year":"2023","date_updated":"2024-02-13T08:59:27Z","_id":"14958","file_date_updated":"2024-02-13T08:50:53Z","conference":{"location":"New Orleans, LA, United States","start_date":"2023-12-15","end_date":"2023-12-15","name":"CRL: Causal Representation Learning Workshop at NeurIPS"},"department":[{"_id":"FrLo"}],"citation":{"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.","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.","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.","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.","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.","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.","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."},"main_file_link":[{"url":"https://openreview.net/forum?id=Whr6uobelR","open_access":"1"}],"publication_status":"published","date_created":"2024-02-07T15:17:51Z"},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2310.14246","open_access":"1"}],"publication_status":"submitted","date_created":"2024-02-08T15:31:46Z","oa":1,"type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-02-12T10:03:33Z","_id":"14961","doi":"10.48550/arXiv.2310.14246","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"citation":{"ieee":"F. Montagna, N. Noceti, L. Rosasco, and F. Locatello, “Shortcuts for causal discovery of nonlinear models by score matching,” <i>arXiv</i>. .","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>","ista":"Montagna F, Noceti N, Rosasco L, Locatello F. Shortcuts for causal discovery of nonlinear models by score matching. arXiv, 2310.14246.","short":"F. Montagna, N. Noceti, L. Rosasco, F. Locatello, ArXiv (n.d.).","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>.","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>","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>."},"publication":"arXiv","oa_version":"Preprint","arxiv":1,"month":"10","author":[{"full_name":"Montagna, Francesco","last_name":"Montagna","first_name":"Francesco"},{"full_name":"Noceti, Nicoletta","last_name":"Noceti","first_name":"Nicoletta"},{"first_name":"Lorenzo","full_name":"Rosasco, Lorenzo","last_name":"Rosasco"},{"first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","full_name":"Locatello, Francesco"}],"article_processing_charge":"No","article_number":"2310.14246","year":"2023","title":"Shortcuts for causal discovery of nonlinear models by score matching","day":"22","status":"public","external_id":{"arxiv":["2310.14246"]},"abstract":[{"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. ","lang":"eng"}],"date_published":"2023-10-22T00:00:00Z"},{"date_created":"2024-02-08T15:33:39Z","oa":1,"publication_status":"submitted","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2309.09858"}],"extern":"1","department":[{"_id":"FrLo"}],"language":[{"iso":"eng"}],"citation":{"ieee":"K. Fan <i>et al.</i>, “Unsupervised open-vocabulary object localization in videos,” <i>arXiv</i>. .","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.","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>","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.).","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>.","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>","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>."},"arxiv":1,"publication":"arXiv","oa_version":"Preprint","date_updated":"2024-02-12T10:12:22Z","_id":"14962","doi":"10.48550/arXiv.2309.09858","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","article_number":"2309.09858","article_processing_charge":"No","month":"09","author":[{"last_name":"Fan","full_name":"Fan, Ke","first_name":"Ke"},{"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"},{"full_name":"Horn, Max","last_name":"Horn","first_name":"Max"},{"full_name":"Zhao, Zixu","last_name":"Zhao","first_name":"Zixu"},{"full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel","last_name":"Carl-Johann Simon-Gabriel","first_name":"Carl-Johann Simon-Gabriel"},{"first_name":"Mike Zheng","last_name":"Shou","full_name":"Shou, Mike Zheng"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco","full_name":"Locatello, Francesco","last_name":"Locatello"},{"first_name":"Bernt","last_name":"Schiele","full_name":"Schiele, Bernt"},{"first_name":"Thomas","full_name":"Brox, Thomas","last_name":"Brox"},{"full_name":"Zhang, Zheng","last_name":"Zhang","first_name":"Zheng"},{"full_name":"Fu, Yanwei","last_name":"Fu","first_name":"Yanwei"},{"first_name":"Tong","last_name":"He","full_name":"He, Tong"}],"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_published":"2023-09-18T00:00:00Z","external_id":{"arxiv":["2309.09858"]},"status":"public","title":"Unsupervised open-vocabulary object localization in videos","day":"18"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","_id":"14963","doi":"10.48550/arXiv.2309.00233","date_updated":"2024-02-12T10:16:21Z","oa_version":"Preprint","publication":"arXiv","citation":{"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.","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>","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.).","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>","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>.","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>."},"arxiv":1,"department":[{"_id":"FrLo"}],"language":[{"iso":"eng"}],"extern":"1","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2309.00233"}],"publication_status":"submitted","date_created":"2024-02-08T15:34:43Z","oa":1,"day":"01","title":"Object-centric multiple object tracking","external_id":{"arxiv":["2309.00233"]},"status":"public","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."}],"author":[{"last_name":"Zhao","full_name":"Zhao, Zixu","first_name":"Zixu"},{"full_name":"Wang, Jiaze","last_name":"Wang","first_name":"Jiaze"},{"last_name":"Horn","full_name":"Horn, Max","first_name":"Max"},{"first_name":"Yizhuo","full_name":"Ding, Yizhuo","last_name":"Ding"},{"full_name":"He, Tong","last_name":"He","first_name":"Tong"},{"last_name":"Bai","full_name":"Bai, Zechen","first_name":"Zechen"},{"full_name":"Zietlow, Dominik","last_name":"Zietlow","first_name":"Dominik"},{"full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel","last_name":"Carl-Johann Simon-Gabriel","first_name":"Carl-Johann Simon-Gabriel"},{"last_name":"Shuai","full_name":"Shuai, Bing","first_name":"Bing"},{"last_name":"Tu","full_name":"Tu, Zhuowen","first_name":"Zhuowen"},{"full_name":"Brox, Thomas","last_name":"Brox","first_name":"Thomas"},{"last_name":"Schiele","full_name":"Schiele, Bernt","first_name":"Bernt"},{"last_name":"Fu","full_name":"Fu, Yanwei","first_name":"Yanwei"},{"last_name":"Locatello","full_name":"Locatello, Francesco","first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"last_name":"Zhang","full_name":"Zhang, Zheng","first_name":"Zheng"},{"first_name":"Tianjun","last_name":"Xiao","full_name":"Xiao, Tianjun"}],"month":"09","article_processing_charge":"No","article_number":"2309.00233","year":"2023"},{"title":"Lattice expansion enables interstitial doping to achieve a high average ZT in n‐type PbS","day":"01","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.","volume":2,"year":"2023","issue":"1","file_date_updated":"2024-02-19T09:58:32Z","date_updated":"2024-02-19T10:01:26Z","_id":"14985","department":[{"_id":"MaIb"}],"citation":{"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.","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>.","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>","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.","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>","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."},"publication_status":"published","date_created":"2024-02-14T12:12:17Z","quality_controlled":"1","status":"public","article_type":"original","ddc":["540"],"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"}],"date_published":"2023-01-01T00:00:00Z","file":[{"file_id":"15015","content_type":"application/pdf","access_level":"open_access","file_size":4675941,"date_updated":"2024-02-19T09:58:32Z","file_name":"2023_InterdiscMaterials_Liu.pdf","success":1,"date_created":"2024-02-19T09:58:32Z","relation":"main_file","checksum":"7b5e8210ef1434feb173022c6dbbee0c","creator":"dernst"}],"month":"01","author":[{"first_name":"Zhengtao","last_name":"Liu","full_name":"Liu, Zhengtao"},{"last_name":"Hong","full_name":"Hong, Tao","first_name":"Tao"},{"first_name":"Liqing","full_name":"Xu, Liqing","last_name":"Xu"},{"first_name":"Sining","last_name":"Wang","full_name":"Wang, Sining"},{"last_name":"Gao","full_name":"Gao, Xiang","first_name":"Xiang"},{"last_name":"Chang","full_name":"Chang, Cheng","first_name":"Cheng","orcid":"0000-0002-9515-4277","id":"9E331C2E-9F27-11E9-AE48-5033E6697425"},{"first_name":"Xiangdong","full_name":"Ding, Xiangdong","last_name":"Ding"},{"full_name":"Xiao, Yu","last_name":"Xiao","first_name":"Yu"},{"full_name":"Zhao, Li‐Dong","last_name":"Zhao","first_name":"Li‐Dong"}],"article_processing_charge":"Yes","has_accepted_license":"1","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2767-441X"]},"doi":"10.1002/idm2.12056","page":"161-170","language":[{"iso":"eng"}],"publication":"Interdisciplinary Materials","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"intvolume":"         2","oa":1,"publisher":"Wiley"},{"article_processing_charge":"No","author":[{"first_name":"Harjasleen","last_name":"Malvai","full_name":"Malvai, Harjasleen"},{"last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"last_name":"Sonnino","full_name":"Sonnino, Alberto","first_name":"Alberto"},{"last_name":"Ghosh","full_name":"Ghosh, Esha","first_name":"Esha"},{"full_name":"Oztürk, Ercan","last_name":"Oztürk","first_name":"Ercan"},{"full_name":"Lewi, Kevin","last_name":"Lewi","first_name":"Kevin"},{"first_name":"Sean","last_name":"Lawlor","full_name":"Lawlor, Sean"}],"month":"03","year":"2023","status":"public","day":"01","quality_controlled":"1","title":"Parakeet: Practical key transparency for end-to-end eEncrypted messaging","acknowledgement":"This work is supported by the Novi team at Meta and funded in part by IC3 industry partners and NSF grant 1943499.","date_published":"2023-03-01T00:00:00Z","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"}],"main_file_link":[{"url":"https://eprint.iacr.org/2023/081","open_access":"1"}],"publication_status":"published","publisher":"Internet Society","oa":1,"date_created":"2024-02-14T14:20:40Z","_id":"14989","doi":"10.14722/ndss.2023.24545","date_updated":"2024-02-19T12:11:15Z","conference":{"end_date":"2023-03-03","name":"NDSS: Network and Distributed Systems Security","location":"San Diego, CA, United States","start_date":"2023-02-27"},"publication_identifier":{"isbn":["1891562835"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","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.","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>.","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>","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.","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>","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."},"publication":"Proceedings of the 2023 Network and Distributed System Security Symposium","oa_version":"Published Version","language":[{"iso":"eng"}],"department":[{"_id":"ElKo"}]},{"oa_version":"Published Version","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>.","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>","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>.","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>","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).","ieee":"T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023."},"department":[{"_id":"KrCh"}],"related_material":{"record":[{"id":"13139","relation":"used_in_publication","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"research_data_reference","doi":"10.5281/ZENODO.7548214","_id":"14990","date_updated":"2024-02-27T07:19:32Z","date_created":"2024-02-14T14:27:06Z","publisher":"Zenodo","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7548214"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_published":"2023-01-18T00:00:00Z","abstract":[{"text":"The software artefact to evaluate the approximation of stationary distributions implementation.","lang":"eng"}],"ddc":["000"],"day":"18","title":"Artefact for: Correct Approximation of Stationary Distributions","status":"public","has_accepted_license":"1","year":"2023","author":[{"first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias"}],"month":"01","article_processing_charge":"No"},{"title":"Data-assessing memory in convection schemes using idealized tests","day":"23","status":"public","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)."}],"ddc":["550"],"date_published":"2023-06-23T00:00:00Z","month":"06","author":[{"last_name":"Hwong","full_name":"Hwong, Yi-Ling","first_name":"Yi-Ling","id":"1217aa61-4dd1-11ec-9ac3-f2ba3f17ee22","orcid":"0000-0001-9281-3479"},{"first_name":"Maxime","last_name":"Colin","full_name":"Colin, Maxime"},{"first_name":"Philipp","id":"02eace56-97fc-11ee-b81a-f0939ca85a77","last_name":"Aglas","full_name":"Aglas, Philipp"},{"first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","orcid":"0000-0001-5836-5350","last_name":"Muller","full_name":"Muller, Caroline J"},{"last_name":"Sherwood","full_name":"Sherwood, Steven C.","first_name":"Steven C."}],"article_processing_charge":"No","has_accepted_license":"1","year":"2023","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-02-27T07:26:31Z","doi":"10.5281/ZENODO.7757041","_id":"14991","ec_funded":1,"department":[{"_id":"CaMu"}],"oa_version":"Published Version","citation":{"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.","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>.","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>.","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>","short":"Y.-L. Hwong, M. Colin, P. Aglas, C.J. Muller, S.C. Sherwood, (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>","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>."},"related_material":{"record":[{"id":"14654","relation":"used_in_publication","status":"public"}]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.7757041"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publisher":"Zenodo","date_created":"2024-02-14T14:37:57Z","oa":1},{"date_published":"2023-07-19T00:00:00Z","abstract":[{"lang":"eng","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."}],"status":"public","quality_controlled":"1","series_title":"MAMOMO","editor":[{"last_name":"Cances","full_name":"Cances, Eric","first_name":"Eric"},{"last_name":"Friesecke","full_name":"Friesecke, Gero","first_name":"Gero"}],"article_processing_charge":"No","author":[{"first_name":"Mathieu","last_name":"Lewin","full_name":"Lewin, Mathieu"},{"full_name":"Lieb, Elliott H.","last_name":"Lieb","first_name":"Elliott H."},{"full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert"}],"month":"07","publication":"Density Functional Theory","arxiv":1,"oa_version":"Preprint","language":[{"iso":"eng"}],"page":"115-182","doi":"10.1007/978-3-031-22340-2_3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["9783031223396"],"issn":["3005-0286"],"eisbn":["9783031223402"]},"type":"book_chapter","publisher":"Springer","oa":1,"edition":"1","external_id":{"arxiv":["1912.10424"]},"day":"19","title":"Universal Functionals in Density Functional Theory","year":"2023","citation":{"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.","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>","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>.","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>.","ista":"Lewin M, Lieb EH, Seiringer R. 2023.Universal Functionals in Density Functional Theory. In: Density Functional Theory. Mathematics and Molecular Modeling, , 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>","short":"M. Lewin, E.H. Lieb, R. Seiringer, in:, E. Cances, G. Friesecke (Eds.), Density Functional Theory, 1st ed., Springer, 2023, pp. 115–182."},"department":[{"_id":"RoSe"}],"_id":"14992","date_updated":"2024-02-20T08:33:06Z","date_created":"2024-02-14T14:44:33Z","alternative_title":["Mathematics and Molecular Modeling"],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1912.10424"}]},{"month":"03","author":[{"first_name":"Christopher","id":"e8321fc5-3091-11eb-8a53-83f309a11ac9","orcid":"0000-0002-4809-5059","last_name":"Currin","full_name":"Currin, Christopher"},{"first_name":"Mercy Nyamewaa","full_name":"Asiedu , Mercy Nyamewaa","last_name":"Asiedu "},{"first_name":"Chris","full_name":"Fourie, Chris","last_name":"Fourie"},{"first_name":"Benjamin","last_name":"Rosman","full_name":"Rosman, Benjamin"},{"first_name":"Houcemeddine","last_name":"Turki","full_name":"Turki, Houcemeddine"},{"first_name":"Atnafu","full_name":"Lambebo Tonja, Atnafu","last_name":"Lambebo Tonja"},{"first_name":"Jade","full_name":"Abbott, Jade","last_name":"Abbott"},{"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","last_name":"Emezue","full_name":"Emezue, Chris Chinenye"},{"full_name":"Machangara, Daphne","last_name":"Machangara","first_name":"Daphne"}],"article_processing_charge":"No","year":"2023","title":"A framework for grassroots research collaboration in machine learning and global health","quality_controlled":"1","day":"02","status":"public","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."}],"date_published":"2023-03-02T00:00:00Z","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.","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=jHY_G91R880"}],"publisher":"OpenReview","date_created":"2024-02-14T15:11:48Z","oa":1,"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2023-05-05","location":"Kigali, Rwanda","name":"ICLR: International Conference on Learning Representations","end_date":"2023-05-05"},"date_updated":"2024-02-28T12:12:00Z","_id":"14993","department":[{"_id":"TiVo"}],"language":[{"iso":"eng"}],"publication":"1st Workshop on Machine Learning & Global Health","citation":{"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.","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.","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.","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.","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.","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."},"oa_version":"Published Version"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7877790","open_access":"1"}],"publisher":"Zenodo","date_created":"2024-02-14T15:13:00Z","oa":1,"type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-02-27T07:39:51Z","_id":"14994","doi":"10.5281/ZENODO.7877790","department":[{"_id":"ToHe"}],"citation":{"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>","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>.","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>","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>.","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."},"oa_version":"Published Version","related_material":{"record":[{"id":"14758","relation":"used_in_publication","status":"public"}]},"month":"04","author":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"last_name":"Mallik","full_name":"Mallik, Kaushik","first_name":"Kaushik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"first_name":"Mateusz","full_name":"Rychlicki, Mateusz","last_name":"Rychlicki"},{"last_name":"Schmuck","full_name":"Schmuck, Anne-Kathrin","first_name":"Anne-Kathrin"},{"full_name":"Soudjani, Sadegh","last_name":"Soudjani","first_name":"Sadegh"}],"article_processing_charge":"No","has_accepted_license":"1","year":"2023","title":"A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties","day":"28","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."}],"ddc":["000"],"date_published":"2023-04-28T00:00:00Z"},{"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.7877757","open_access":"1"}],"oa":1,"date_created":"2024-02-14T15:14:13Z","publisher":"Zenodo","_id":"14995","doi":"10.5281/ZENODO.7877757","date_updated":"2024-02-27T07:46:52Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"research_data_reference","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"14260"}]},"citation":{"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>.","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>","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>.","short":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, (2023).","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>.","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>","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."},"oa_version":"Published Version","department":[{"_id":"DaAl"}],"article_processing_charge":"No","author":[{"id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","first_name":"Nikita","full_name":"Koval, Nikita","last_name":"Koval"},{"full_name":"Fedorov, Alexander","last_name":"Fedorov","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","first_name":"Alexander"},{"last_name":"Sokolova","full_name":"Sokolova, Maria","first_name":"Maria"},{"first_name":"Dmitry","last_name":"Tsitelov","full_name":"Tsitelov, Dmitry"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"}],"month":"04","year":"2023","status":"public","day":"28","title":"Lincheck: A practical framework for testing concurrent data structures on JVM","date_published":"2023-04-28T00:00:00Z","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"}],"ddc":["000"]},{"ec_funded":1,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"oa_version":"Preprint","arxiv":1,"publication":"37th Conference on Neural Information Processing Systems","citation":{"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.","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.","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.","short":"D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, 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.","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.","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."},"project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2023-12-16","start_date":"2023-12-10","location":"New Orleans, LO, United States"},"date_updated":"2025-07-14T09:10:04Z","_id":"15023","oa":1,"date_created":"2024-02-25T09:23:24Z","publication_status":"epub_ahead","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2312.01456"}],"abstract":[{"lang":"eng","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."}],"date_published":"2023-12-15T00:00:00Z","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS) and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt).","title":"Compositional policy learning in stochastic control systems with formal guarantees","quality_controlled":"1","day":"15","external_id":{"arxiv":["2312.01456"]},"status":"public","year":"2023","month":"12","author":[{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","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"},{"last_name":"Verma","full_name":"Verma, Abhinav","first_name":"Abhinav","id":"a235593c-d7fa-11eb-a0c5-b22ca3c66ee6"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"article_processing_charge":"No"},{"date_created":"2024-02-26T08:37:57Z","publisher":"Figshare","oa":1,"license":"https://creativecommons.org/publicdomain/zero/1.0/","tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"main_file_link":[{"url":"https://figshare.com/s/85798bba4ebc68d822ed","open_access":"1"}],"related_material":{"record":[{"relation":"used_in_publication","id":"15001","status":"public"}]},"department":[{"_id":"AnSa"}],"oa_version":"Published Version","citation":{"chicago":"Curk, Samo. “Aggregation_data.” Figshare, 2023.","ama":"Curk S. aggregation_data. 2023.","mla":"Curk, Samo. <i>Aggregation_data</i>. Figshare, 2023.","short":"S. Curk, (2023).","apa":"Curk, S. (2023). aggregation_data. Figshare.","ista":"Curk S. 2023. aggregation_data, Figshare.","ieee":"S. Curk, “aggregation_data.” Figshare, 2023."},"date_updated":"2024-02-26T08:45:55Z","_id":"15027","type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","has_accepted_license":"1","article_processing_charge":"No","month":"12","author":[{"full_name":"Curk, Samo","last_name":"Curk","orcid":"0000-0001-6160-9766","id":"031eff0d-d481-11ee-8508-cd12a7a86e5b","first_name":"Samo"}],"ddc":["570"],"abstract":[{"text":"This data repository underpins the paper, published in PNAS (doi pending) and bioarxiv (doi: https://doi.org/10.1101/2023.07.05.547777).","lang":"eng"}],"date_published":"2023-12-13T00:00:00Z","status":"public","title":"aggregation_data","day":"13"},{"status":"public","title":"Monitoring hyperproperties with prefix transducers","day":"28","abstract":[{"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.","lang":"eng"}],"ddc":["000"],"date_published":"2023-07-28T00:00:00Z","article_processing_charge":"No","month":"07","author":[{"last_name":"Chalupa","full_name":"Chalupa, Marek","first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"year":"2023","has_accepted_license":"1","date_updated":"2024-02-28T12:33:09Z","_id":"15035","doi":"10.5281/ZENODO.8191723","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"14076","relation":"used_in_publication"}]},"ec_funded":1,"department":[{"_id":"ToHe"}],"oa_version":"Published Version","citation":{"ieee":"M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers.” Zenodo, 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>.","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>","short":"M. Chalupa, T.A. Henzinger, (2023).","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>","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>.","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>."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.8191722"}],"oa":1,"publisher":"Zenodo","date_created":"2024-02-28T07:34:34Z"},{"title":"1-Lipschitz neural networks are more expressive with N-activations","day":"10","external_id":{"arxiv":["2311.06103"]},"status":"public","abstract":[{"lang":"eng","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."}],"date_published":"2023-11-10T00:00:00Z","month":"11","author":[{"id":"2D561D42-C427-11E9-89B4-9C1AE6697425","first_name":"Bernd","full_name":"Prach, Bernd","last_name":"Prach"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph","last_name":"Lampert"}],"article_processing_charge":"No","article_number":"2311.06103","year":"2023","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-03-04T07:02:39Z","_id":"15039","doi":"10.48550/ARXIV.2311.06103","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"language":[{"iso":"eng"}],"arxiv":1,"oa_version":"Preprint","citation":{"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>","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.","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>","short":"B. Prach, C. Lampert, ArXiv (n.d.).","ieee":"B. Prach and C. Lampert, “1-Lipschitz neural networks are more expressive with N-activations,” <i>arXiv</i>. ."},"publication":"arXiv","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.06103"}],"publication_status":"submitted","date_created":"2024-02-28T17:59:32Z","oa":1},{"article_type":"original","status":"public","quality_controlled":"1","date_published":"2023-05-01T00:00:00Z","abstract":[{"text":"It is known that the Brauer--Manin obstruction to the Hasse principle is vacuous for smooth Fano hypersurfaces of dimension at least 3 over any number field. Moreover, for such varieties it follows from a general conjecture of Colliot-Thélène that the Brauer--Manin obstruction to the Hasse principle should be the only one, so that the Hasse principle is expected to hold. Working over the field of rational numbers and ordering Fano hypersurfaces of fixed degree and dimension by height, we prove that almost every such hypersurface satisfies the Hasse principle provided that the dimension is at least 3. This proves a conjecture of Poonen and Voloch in every case except for cubic surfaces.","lang":"eng"}],"article_processing_charge":"No","author":[{"last_name":"Browning","full_name":"Browning, Timothy D","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"},{"first_name":"Pierre Le","full_name":"Boudec, Pierre Le","last_name":"Boudec"},{"full_name":"Sawin, Will","last_name":"Sawin","first_name":"Will"}],"month":"05","page":"1115-1203","doi":"10.4007/annals.2023.197.3.3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0003-486X"]},"type":"journal_article","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/when-is-necessary-sufficient/"}]},"arxiv":1,"publication":"Annals of Mathematics","oa_version":"Preprint","language":[{"iso":"eng"}],"oa":1,"publisher":"Princeton University","isi":1,"intvolume":"       197","external_id":{"oaworkID":["w3033938593"],"isi":["000966611000003"],"arxiv":["2006.02356"]},"day":"01","title":"The Hasse principle for random Fano hypersurfaces","volume":197,"issue":"3","year":"2023","_id":"8682","date_updated":"2025-08-11T11:59:49Z","citation":{"short":"T.D. Browning, P.L. Boudec, W. Sawin, Annals of Mathematics 197 (2023) 1115–1203.","ista":"Browning TD, Boudec PL, Sawin W. 2023. The Hasse principle for random Fano hypersurfaces. Annals of Mathematics. 197(3), 1115–1203.","apa":"Browning, T. D., Boudec, P. L., &#38; Sawin, W. (2023). The Hasse principle for random Fano hypersurfaces. <i>Annals of Mathematics</i>. Princeton University. <a href=\"https://doi.org/10.4007/annals.2023.197.3.3\">https://doi.org/10.4007/annals.2023.197.3.3</a>","chicago":"Browning, Timothy D, Pierre Le Boudec, and Will Sawin. “The Hasse Principle for Random Fano Hypersurfaces.” <i>Annals of Mathematics</i>. Princeton University, 2023. <a href=\"https://doi.org/10.4007/annals.2023.197.3.3\">https://doi.org/10.4007/annals.2023.197.3.3</a>.","ama":"Browning TD, Boudec PL, Sawin W. The Hasse principle for random Fano hypersurfaces. <i>Annals of Mathematics</i>. 2023;197(3):1115-1203. doi:<a href=\"https://doi.org/10.4007/annals.2023.197.3.3\">10.4007/annals.2023.197.3.3</a>","mla":"Browning, Timothy D., et al. “The Hasse Principle for Random Fano Hypersurfaces.” <i>Annals of Mathematics</i>, vol. 197, no. 3, Princeton University, 2023, pp. 1115–203, doi:<a href=\"https://doi.org/10.4007/annals.2023.197.3.3\">10.4007/annals.2023.197.3.3</a>.","ieee":"T. D. Browning, P. L. Boudec, and W. Sawin, “The Hasse principle for random Fano hypersurfaces,” <i>Annals of Mathematics</i>, vol. 197, no. 3. Princeton University, pp. 1115–1203, 2023."},"department":[{"_id":"TiBr"}],"main_file_link":[{"url":"https://arxiv.org/abs/2006.02356","open_access":"1"}],"publication_status":"published","date_created":"2020-10-19T14:28:50Z"},{"oa_version":"Preprint","publication":"International Mathematics Research Notices","arxiv":1,"language":[{"iso":"eng"}],"page":"6780-6808","doi":"10.1093/imrn/rnac048","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"type":"journal_article","oa":1,"publisher":"Oxford Academic","isi":1,"intvolume":"      2023","date_published":"2023-04-01T00:00:00Z","abstract":[{"text":"We determine an asymptotic formula for the number of integral points of bounded height on a blow-up of P3 outside certain planes using universal torsors.","lang":"eng"}],"article_type":"original","status":"public","quality_controlled":"1","article_processing_charge":"No","author":[{"full_name":"Wilsch, Florian Alexander","last_name":"Wilsch","id":"560601DA-8D36-11E9-A136-7AC1E5697425","orcid":"0000-0001-7302-8256","first_name":"Florian Alexander"}],"month":"04","citation":{"apa":"Wilsch, F. A. (2023). Integral points of bounded height on a log Fano threefold. <i>International Mathematics Research Notices</i>. Oxford Academic. <a href=\"https://doi.org/10.1093/imrn/rnac048\">https://doi.org/10.1093/imrn/rnac048</a>","ista":"Wilsch FA. 2023. Integral points of bounded height on a log Fano threefold. International Mathematics Research Notices. 2023(8), 6780–6808.","short":"F.A. Wilsch, International Mathematics Research Notices 2023 (2023) 6780–6808.","ama":"Wilsch FA. Integral points of bounded height on a log Fano threefold. <i>International Mathematics Research Notices</i>. 2023;2023(8):6780-6808. doi:<a href=\"https://doi.org/10.1093/imrn/rnac048\">10.1093/imrn/rnac048</a>","mla":"Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log Fano Threefold.” <i>International Mathematics Research Notices</i>, vol. 2023, no. 8, Oxford Academic, 2023, pp. 6780–808, doi:<a href=\"https://doi.org/10.1093/imrn/rnac048\">10.1093/imrn/rnac048</a>.","chicago":"Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log Fano Threefold.” <i>International Mathematics Research Notices</i>. Oxford Academic, 2023. <a href=\"https://doi.org/10.1093/imrn/rnac048\">https://doi.org/10.1093/imrn/rnac048</a>.","ieee":"F. A. Wilsch, “Integral points of bounded height on a log Fano threefold,” <i>International Mathematics Research Notices</i>, vol. 2023, no. 8. Oxford Academic, pp. 6780–6808, 2023."},"department":[{"_id":"TiBr"}],"_id":"9034","date_updated":"2023-08-01T12:23:55Z","date_created":"2021-01-22T09:31:09Z","publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/1901.08503","open_access":"1"}],"volume":2023,"acknowledgement":"This work was supported by the German Academic Exchange Service. Parts of this article were prepared at the Institut de Mathémathiques de Jussieu—Paris Rive Gauche. I wish to thank Antoine Chambert-Loir for his remarks and the institute for its hospitality, as well as the anonymous referee for several useful remarks and suggestions for improvements.","external_id":{"arxiv":["1901.08503"],"isi":["000773116000001"]},"day":"01","title":"Integral points of bounded height on a log Fano threefold","issue":"8","year":"2023"},{"year":"2023","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). This work was started while both authors were employed at the University of Innsbruck and enjoyed the full support of Austrian Science Fund (FWF): P 30902-N35. It was continued when the first named author was employed at University of Leipzig and the second named author was employed at Institute of Science and Technology of Austria, where he was supported by an IST Fellowship.","external_id":{"arxiv":["2102.13046"],"isi":["001105681500001"]},"day":"17","title":"Divergence of separated nets with respect to displacement equivalence","date_created":"2021-07-14T07:01:27Z","publication_status":"epub_ahead","main_file_link":[{"url":"https://doi.org/10.1007/s10711-023-00862-3","open_access":"1"}],"citation":{"ieee":"M. Dymond and V. Kaluza, “Divergence of separated nets with respect to displacement equivalence,” <i>Geometriae Dedicata</i>. Springer Nature, 2023.","chicago":"Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect to Displacement Equivalence.” <i>Geometriae Dedicata</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s10711-023-00862-3\">https://doi.org/10.1007/s10711-023-00862-3</a>.","ama":"Dymond M, Kaluza V. Divergence of separated nets with respect to displacement equivalence. <i>Geometriae Dedicata</i>. 2023. doi:<a href=\"https://doi.org/10.1007/s10711-023-00862-3\">10.1007/s10711-023-00862-3</a>","mla":"Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect to Displacement Equivalence.” <i>Geometriae Dedicata</i>, 15, Springer Nature, 2023, doi:<a href=\"https://doi.org/10.1007/s10711-023-00862-3\">10.1007/s10711-023-00862-3</a>.","short":"M. Dymond, V. Kaluza, Geometriae Dedicata (2023).","apa":"Dymond, M., &#38; Kaluza, V. (2023). Divergence of separated nets with respect to displacement equivalence. <i>Geometriae Dedicata</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10711-023-00862-3\">https://doi.org/10.1007/s10711-023-00862-3</a>","ista":"Dymond M, Kaluza V. 2023. Divergence of separated nets with respect to displacement equivalence. Geometriae Dedicata., 15."},"department":[{"_id":"UlWa"}],"_id":"9651","date_updated":"2024-01-11T13:06:32Z","article_number":"15","scopus_import":"1","article_processing_charge":"Yes (via OA deal)","author":[{"first_name":"Michael","full_name":"Dymond, Michael","last_name":"Dymond"},{"id":"21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E","orcid":"0000-0002-2512-8698","first_name":"Vojtech","full_name":"Kaluza, Vojtech","last_name":"Kaluza"}],"month":"11","date_published":"2023-11-17T00:00:00Z","abstract":[{"lang":"eng","text":"We introduce a hierachy of equivalence relations on the set of separated nets of a given Euclidean space, indexed by concave increasing functions ϕ:(0,∞)→(0,∞). Two separated nets are called ϕ-displacement equivalent if, roughly speaking, there is a bijection between them which, for large radii R, displaces points of norm at most R by something of order at most ϕ(R). We show that the spectrum of ϕ-displacement equivalence spans from the established notion of bounded displacement equivalence, which corresponds to bounded ϕ, to the indiscrete equivalence relation, coresponding to ϕ(R)∈Ω(R), in which all separated nets are equivalent. In between the two ends of this spectrum, the notions of ϕ-displacement equivalence are shown to be pairwise distinct with respect to the asymptotic classes of ϕ(R) for R→∞. We further undertake a comparison of our notion of ϕ-displacement equivalence with previously studied relations on separated nets. Particular attention is given to the interaction of the notions of ϕ-displacement equivalence with that of bilipschitz equivalence."}],"article_type":"original","status":"public","quality_controlled":"1","oa":1,"publisher":"Springer Nature","isi":1,"arxiv":1,"publication":"Geometriae Dedicata","oa_version":"Published Version","language":[{"iso":"eng"}],"doi":"10.1007/s10711-023-00862-3","publication_identifier":{"eissn":["1572-9168"],"issn":["0046-5755"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"journal_article"},{"doi":"10.1007/s11856-022-2448-6","page":"501-554","type":"journal_article","keyword":["Lipschitz","bilipschitz","bounded displacement","modulus of continuity","separated net","non-realisable density","Burago--Kleiner construction"],"publication_identifier":{"eissn":["1565-8511"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication":"Israel Journal of Mathematics","oa_version":"Submitted Version","arxiv":1,"publisher":"Springer Nature","oa":1,"intvolume":"       253","isi":1,"status":"public","article_type":"original","quality_controlled":"1","file":[{"creator":"vkaluza","checksum":"6fa0a3207dd1d6467c309fd1bcc867d1","relation":"main_file","date_created":"2021-07-14T07:41:50Z","file_name":"separated_nets.pdf","date_updated":"2021-07-14T07:41:50Z","file_size":900422,"access_level":"open_access","content_type":"application/pdf","file_id":"9653"}],"abstract":[{"lang":"eng","text":"In 1998 Burago and Kleiner and (independently) McMullen gave examples of separated nets in Euclidean space which are non-bilipschitz equivalent to the integer lattice. We study weaker notions of equivalence of separated nets and demonstrate that such notions also give rise to distinct equivalence classes. Put differently, we find occurrences of particularly strong divergence of separated nets from the integer lattice. Our approach generalises that of Burago and Kleiner and McMullen which takes place largely in a continuous setting. Existence of irregular separated nets is verified via the existence of non-realisable density functions ρ:[0,1]d→(0,∞). In the present work we obtain stronger types of non-realisable densities."}],"ddc":["515","516"],"date_published":"2023-03-01T00:00:00Z","article_processing_charge":"No","scopus_import":"1","month":"03","author":[{"last_name":"Dymond","full_name":"Dymond, Michael","first_name":"Michael"},{"first_name":"Vojtech","id":"21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E","orcid":"0000-0002-2512-8698","last_name":"Kaluza","full_name":"Kaluza, Vojtech"}],"has_accepted_license":"1","date_updated":"2023-08-14T11:26:34Z","_id":"9652","file_date_updated":"2021-07-14T07:41:50Z","department":[{"_id":"UlWa"}],"citation":{"ama":"Dymond M, Kaluza V. Highly irregular separated nets. <i>Israel Journal of Mathematics</i>. 2023;253:501-554. doi:<a href=\"https://doi.org/10.1007/s11856-022-2448-6\">10.1007/s11856-022-2448-6</a>","mla":"Dymond, Michael, and Vojtech Kaluza. “Highly Irregular Separated Nets.” <i>Israel Journal of Mathematics</i>, vol. 253, Springer Nature, 2023, pp. 501–54, doi:<a href=\"https://doi.org/10.1007/s11856-022-2448-6\">10.1007/s11856-022-2448-6</a>.","chicago":"Dymond, Michael, and Vojtech Kaluza. “Highly Irregular Separated Nets.” <i>Israel Journal of Mathematics</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s11856-022-2448-6\">https://doi.org/10.1007/s11856-022-2448-6</a>.","apa":"Dymond, M., &#38; Kaluza, V. (2023). Highly irregular separated nets. <i>Israel Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11856-022-2448-6\">https://doi.org/10.1007/s11856-022-2448-6</a>","ista":"Dymond M, Kaluza V. 2023. Highly irregular separated nets. Israel Journal of Mathematics. 253, 501–554.","short":"M. Dymond, V. Kaluza, Israel Journal of Mathematics 253 (2023) 501–554.","ieee":"M. Dymond and V. Kaluza, “Highly irregular separated nets,” <i>Israel Journal of Mathematics</i>, vol. 253. Springer Nature, pp. 501–554, 2023."},"publication_status":"published","date_created":"2021-07-14T07:01:28Z","external_id":{"isi":["000904950300003"],"arxiv":["1903.05923"]},"title":"Highly irregular separated nets","day":"01","acknowledgement":"This work was done while both authors were employed at the University of Innsbruck and enjoyed the full support of Austrian Science Fund (FWF): P 30902-N35.","volume":253,"year":"2023"}]