[{"isi":1,"scopus_import":"1","day":"01","abstract":[{"lang":"eng","text":"We consider symmetric partial exclusion and inclusion processes in a general graph in contact with reservoirs, where we allow both for edge disorder and well-chosen site disorder. We extend the classical dualities to this context and then we derive new orthogonal polynomial dualities. From the classical dualities, we derive the uniqueness of the non-equilibrium steady state and obtain correlation inequalities. Starting from the orthogonal polynomial dualities, we show universal properties of n-point correlation functions in the non-equilibrium steady state for systems with at most two different reservoir parameters, such as a chain with reservoirs at left and right ends."},{"lang":"fre","text":"Nous considérons des processus d’exclusion partielle, et des processus d’inclusion sur un graphe général en contact avec des réservoirs. Nous autorisons la présence de inhomogenéités sur les arrêts ainsi que sur les sommets du graph. Nous généralisons les “dualités classiques” dans ce contexte et nous démontrons des nouvelles dualités orthogonales. À partir des dualités classiques, nous démontrons l’unicité de l’état stationnaire non-équilibre, ainsi que des inégalités de corrélation. À partir des dualités orthogonales nous démontrons des propriétés universelles des fonctions de corrélation à n points dans l’état stationnaire non-équilibre pour des systèmes avec deux paramètres de réservoirs inégaux, comme par exemple une chaîne avec des réservoirs à droite et à gauche."}],"date_created":"2022-02-27T23:01:50Z","volume":58,"title":"Orthogonal polynomial duality of boundary driven particle systems and non-equilibrium correlations","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.08272"}],"arxiv":1,"intvolume":" 58","acknowledgement":"The authors would like to thank Gioia Carinci and Cristian Giardinà for useful discussions. F.R. and S.F. thank Jean-René Chazottes for a stay at CPHT (Institut Polytechnique de Paris), in the realm of Chaire d’Alembert (Paris-Saclay University), where part of this work was performed. S.F. acknowledges Simona Villa for her support in creating the picture. S.F. acknowledges financial support from NWO via the grant TOP1.17.019. F.S. acknowledges financial support from the European Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie grant agreement No. 754411.","citation":{"apa":"Floreani, S., Redig, F., & Sau, F. (2022). Orthogonal polynomial duality of boundary driven particle systems and non-equilibrium correlations. Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/21-AIHP1163","ama":"Floreani S, Redig F, Sau F. Orthogonal polynomial duality of boundary driven particle systems and non-equilibrium correlations. Annales de l’institut Henri Poincare (B) Probability and Statistics. 2022;58(1):220-247. doi:10.1214/21-AIHP1163","ieee":"S. Floreani, F. Redig, and F. Sau, “Orthogonal polynomial duality of boundary driven particle systems and non-equilibrium correlations,” Annales de l’institut Henri Poincare (B) Probability and Statistics, vol. 58, no. 1. Institute of Mathematical Statistics, pp. 220–247, 2022.","mla":"Floreani, Simone, et al. “Orthogonal Polynomial Duality of Boundary Driven Particle Systems and Non-Equilibrium Correlations.” Annales de l’institut Henri Poincare (B) Probability and Statistics, vol. 58, no. 1, Institute of Mathematical Statistics, 2022, pp. 220–47, doi:10.1214/21-AIHP1163.","chicago":"Floreani, Simone, Frank Redig, and Federico Sau. “Orthogonal Polynomial Duality of Boundary Driven Particle Systems and Non-Equilibrium Correlations.” Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute of Mathematical Statistics, 2022. https://doi.org/10.1214/21-AIHP1163.","short":"S. Floreani, F. Redig, F. Sau, Annales de l’institut Henri Poincare (B) Probability and Statistics 58 (2022) 220–247.","ista":"Floreani S, Redig F, Sau F. 2022. Orthogonal polynomial duality of boundary driven particle systems and non-equilibrium correlations. Annales de l’institut Henri Poincare (B) Probability and Statistics. 58(1), 220–247."},"external_id":{"arxiv":["2007.08272"],"isi":["000752489300010"]},"type":"journal_article","publication":"Annales de l'institut Henri Poincare (B) Probability and Statistics","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"doi":"10.1214/21-AIHP1163","_id":"10797","page":"220-247","author":[{"last_name":"Floreani","first_name":"Simone","full_name":"Floreani, Simone"},{"last_name":"Redig","first_name":"Frank","full_name":"Redig, Frank"},{"last_name":"Sau","id":"E1836206-9F16-11E9-8814-AEFDE5697425","first_name":"Federico","full_name":"Sau, Federico"}],"quality_controlled":"1","ec_funded":1,"publisher":"Institute of Mathematical Statistics","month":"02","article_type":"original","date_published":"2022-02-01T00:00:00Z","publication_status":"published","date_updated":"2025-04-14T07:43:48Z","department":[{"_id":"JaMa"}],"article_processing_charge":"No","oa":1,"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0246-0203"]},"status":"public","issue":"1","year":"2022"},{"file_date_updated":"2022-03-10T12:11:48Z","keyword":["robustness","fairness","machine learning","PAC learning","adversarial learning"],"title":"Robustness and fairness in machine learning","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"10802","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"10803"},{"relation":"part_of_dissertation","id":"6590","status":"public"},{"id":"8724","relation":"part_of_dissertation","status":"public"}]},"day":"08","abstract":[{"text":"Because of the increasing popularity of machine learning methods, it is becoming important to understand the impact of learned components on automated decision-making systems and to guarantee that their consequences are beneficial to society. In other words, it is necessary to ensure that machine learning is sufficiently trustworthy to be used in real-world applications. This thesis studies two properties of machine learning models that are highly desirable for the\r\nsake of reliability: robustness and fairness. In the first part of the thesis we study the robustness of learning algorithms to training data corruption. Previous work has shown that machine learning models are vulnerable to a range\r\nof training set issues, varying from label noise through systematic biases to worst-case data manipulations. This is an especially relevant problem from a present perspective, since modern machine learning methods are particularly data hungry and therefore practitioners often have to rely on data collected from various external sources, e.g. from the Internet, from app users or via crowdsourcing. Naturally, such sources vary greatly in the quality and reliability of the\r\ndata they provide. With these considerations in mind, we study the problem of designing machine learning algorithms that are robust to corruptions in data coming from multiple sources. We show that, in contrast to the case of a single dataset with outliers, successful learning within this model is possible both theoretically and practically, even under worst-case data corruptions. The second part of this thesis deals with fairness-aware machine learning. There are multiple areas where machine learning models have shown promising results, but where careful considerations are required, in order to avoid discrimanative decisions taken by such learned components. Ensuring fairness can be particularly challenging, because real-world training datasets are expected to contain various forms of historical bias that may affect the learning process. In this thesis we show that data corruption can indeed render the problem of achieving fairness impossible, by tightly characterizing the theoretical limits of fair learning under worst-case data manipulations. However, assuming access to clean data, we also show how fairness-aware learning can be made practical in contexts beyond binary classification, in particular in the challenging learning to rank setting.","lang":"eng"}],"date_created":"2022-02-28T13:03:49Z","supervisor":[{"orcid":"0000-0001-8622-7887","last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"author":[{"orcid":"0009-0009-5204-7621","last_name":"Konstantinov","first_name":"Nikola H","full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87"}],"page":"176","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"doi":"10.15479/at:ista:10799","_id":"10799","type":"dissertation","citation":{"ieee":"N. H. Konstantinov, “Robustness and fairness in machine learning,” Institute of Science and Technology Austria, 2022.","mla":"Konstantinov, Nikola H. Robustness and Fairness in Machine Learning. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:10799.","ama":"Konstantinov NH. Robustness and fairness in machine learning. 2022. doi:10.15479/at:ista:10799","apa":"Konstantinov, N. H. (2022). Robustness and fairness in machine learning. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10799","ista":"Konstantinov NH. 2022. Robustness and fairness in machine learning. Institute of Science and Technology Austria.","short":"N.H. Konstantinov, Robustness and Fairness in Machine Learning, Institute of Science and Technology Austria, 2022.","chicago":"Konstantinov, Nikola H. “Robustness and Fairness in Machine Learning.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:10799."},"ddc":["000"],"oa":1,"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"article_processing_charge":"No","date_published":"2022-03-08T00:00:00Z","month":"03","date_updated":"2026-04-07T14:19:48Z","publication_status":"published","ec_funded":1,"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","year":"2022","status":"public","corr_author":"1","has_accepted_license":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","OA_place":"publisher","publication_identifier":{"isbn":["978-3-99078-015-2"],"issn":["2663-337X"]},"alternative_title":["ISTA Thesis"],"file":[{"file_id":"10823","relation":"main_file","date_created":"2022-03-06T11:42:54Z","file_name":"thesis.pdf","date_updated":"2022-03-06T11:42:54Z","success":1,"file_size":4204905,"checksum":"626bc523ae8822d20e635d0e2d95182e","access_level":"open_access","content_type":"application/pdf","creator":"nkonstan"},{"file_id":"10824","relation":"source_file","date_created":"2022-03-06T11:42:57Z","file_name":"thesis.zip","date_updated":"2022-03-10T12:11:48Z","content_type":"application/x-zip-compressed","checksum":"e2ca2b88350ac8ea1515b948885cbcb1","file_size":22841103,"access_level":"closed","creator":"nkonstan"}],"oa_version":"Published Version"},{"day":"01","abstract":[{"text":"Addressing fairness concerns about machine learning models is a crucial step towards their long-term adoption in real-world automated systems. While many approaches have been developed for training fair models from data, little is known about the robustness of these methods to data corruption. In this work we consider fairness-aware learning under worst-case data manipulations. We show that an adversary can in some situations force any learner to return an overly biased classifier, regardless of the sample size and with or without degrading\r\naccuracy, and that the strength of the excess bias increases for learning problems with underrepresented protected groups in the data. We also prove that our hardness results are tight up to constant factors. To this end, we study two natural learning algorithms that optimize for both accuracy and fairness and show that these algorithms enjoy guarantees that are order-optimal in terms of the corruption ratio and the protected groups frequencies in the large data\r\nlimit.","lang":"eng"}],"date_created":"2022-02-28T14:05:42Z","license":"https://creativecommons.org/licenses/by/4.0/","title":"Fairness-aware PAC learning from corrupted data","related_material":{"record":[{"status":"public","relation":"shorter_version","id":"13241"},{"relation":"dissertation_contains","id":"10799","status":"public"}]},"language":[{"iso":"eng"}],"file_date_updated":"2022-07-12T15:08:28Z","keyword":["Fairness","robustness","data poisoning","trustworthy machine learning","PAC learning"],"volume":23,"scopus_import":"1","_id":"10802","quality_controlled":"1","author":[{"id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","full_name":"Konstantinov, Nikola H","first_name":"Nikola H","last_name":"Konstantinov","orcid":"0009-0009-5204-7621"},{"full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Lampert"}],"page":"1-60","acknowledgement":"The authors thank Eugenia Iofinova and Bernd Prach for providing feedback on early versions of this paper. This publication was made possible by an ETH AI Center postdoctoral fellowship to Nikola Konstantinov.","citation":{"chicago":"Konstantinov, Nikola H, and Christoph Lampert. “Fairness-Aware PAC Learning from Corrupted Data.” Journal of Machine Learning Research. ML Research Press, 2022.","short":"N.H. Konstantinov, C. Lampert, Journal of Machine Learning Research 23 (2022) 1–60.","ista":"Konstantinov NH, Lampert C. 2022. Fairness-aware PAC learning from corrupted data. Journal of Machine Learning Research. 23, 1–60.","apa":"Konstantinov, N. H., & Lampert, C. (2022). Fairness-aware PAC learning from corrupted data. Journal of Machine Learning Research. ML Research Press.","ama":"Konstantinov NH, Lampert C. Fairness-aware PAC learning from corrupted data. Journal of Machine Learning Research. 2022;23:1-60.","ieee":"N. H. Konstantinov and C. Lampert, “Fairness-aware PAC learning from corrupted data,” Journal of Machine Learning Research, vol. 23. ML Research Press, pp. 1–60, 2022.","mla":"Konstantinov, Nikola H., and Christoph Lampert. “Fairness-Aware PAC Learning from Corrupted Data.” Journal of Machine Learning Research, vol. 23, ML Research Press, 2022, pp. 1–60."},"ddc":["004"],"external_id":{"arxiv":["2102.06004"]},"arxiv":1,"intvolume":" 23","publication":"Journal of Machine Learning Research","type":"journal_article","article_processing_charge":"No","department":[{"_id":"ChLa"}],"oa":1,"publisher":"ML Research Press","date_published":"2022-05-01T00:00:00Z","month":"05","article_type":"original","publication_status":"published","date_updated":"2026-04-07T14:19:48Z","corr_author":"1","has_accepted_license":"1","status":"public","year":"2022","file":[{"date_updated":"2022-07-12T15:08:28Z","creator":"kschuh","content_type":"application/pdf","file_size":551862,"checksum":"9cac897b54a0ddf3a553a2c33e88cfda","access_level":"open_access","success":1,"file_id":"11570","file_name":"2022_JournalMachineLearningResearch_Konstantinov.pdf","date_created":"2022-07-12T15:08:28Z","relation":"main_file"}],"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publication_identifier":{"issn":["1532-4435"],"eissn":["1533-7928"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"pmid":1,"scopus_import":"1","isi":1,"date_created":"2022-03-04T04:33:49Z","abstract":[{"lang":"eng","text":"Several promising strategies based on combining or cycling different antibiotics have been proposed to increase efficacy and counteract resistance evolution, but we still lack a deep understanding of the physiological responses and genetic mechanisms that underlie antibiotic interactions and the clinical applicability of these strategies. In antibiotic-exposed bacteria, the combined effects of physiological stress responses and emerging resistance mutations (occurring at different time scales) generate complex and often unpredictable dynamics. In this Review, we present our current understanding of bacterial cell physiology and genetics of responses to antibiotics. We emphasize recently discovered mechanisms of synergistic and antagonistic drug interactions, hysteresis in temporal interactions between antibiotics that arise from microbial physiology and interactions between antibiotics and resistance mutations that can cause collateral sensitivity or cross-resistance. We discuss possible connections between the different phenomena and indicate relevant research directions. A better and more unified understanding of drug and genetic interactions is likely to advance antibiotic therapy."}],"day":"01","language":[{"iso":"eng"}],"title":"The physiology and genetics of bacterial responses to antibiotic combinations","keyword":["General Immunology and Microbiology","Microbiology","Infectious Diseases"],"volume":20,"external_id":{"isi":["000763891900001"],"pmid":["35241807"]},"citation":{"ista":"Römhild R, Bollenbach MT, Andersson DI. 2022. The physiology and genetics of bacterial responses to antibiotic combinations. Nature Reviews Microbiology. 20, 478–490.","chicago":"Römhild, Roderich, Mark Tobias Bollenbach, and Dan I. Andersson. “The Physiology and Genetics of Bacterial Responses to Antibiotic Combinations.” Nature Reviews Microbiology. Springer Nature, 2022. https://doi.org/10.1038/s41579-022-00700-5.","short":"R. Römhild, M.T. Bollenbach, D.I. Andersson, Nature Reviews Microbiology 20 (2022) 478–490.","ieee":"R. Römhild, M. T. Bollenbach, and D. I. Andersson, “The physiology and genetics of bacterial responses to antibiotic combinations,” Nature Reviews Microbiology, vol. 20. Springer Nature, pp. 478–490, 2022.","mla":"Römhild, Roderich, et al. “The Physiology and Genetics of Bacterial Responses to Antibiotic Combinations.” Nature Reviews Microbiology, vol. 20, Springer Nature, 2022, pp. 478–90, doi:10.1038/s41579-022-00700-5.","apa":"Römhild, R., Bollenbach, M. T., & Andersson, D. I. (2022). The physiology and genetics of bacterial responses to antibiotic combinations. Nature Reviews Microbiology. Springer Nature. https://doi.org/10.1038/s41579-022-00700-5","ama":"Römhild R, Bollenbach MT, Andersson DI. The physiology and genetics of bacterial responses to antibiotic combinations. Nature Reviews Microbiology. 2022;20:478-490. doi:10.1038/s41579-022-00700-5"},"acknowledgement":"The authors thank B. Kavčič and H. Schulenburg for constructive feedback on the manuscript.","intvolume":" 20","publication":"Nature Reviews Microbiology","type":"journal_article","_id":"10812","doi":"10.1038/s41579-022-00700-5","quality_controlled":"1","author":[{"id":"68E56E44-62B0-11EA-B963-444F3DDC885E","first_name":"Roderich","full_name":"Römhild, Roderich","last_name":"Römhild","orcid":"0000-0001-9480-5261"},{"id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","full_name":"Bollenbach, Mark Tobias","first_name":"Mark Tobias","last_name":"Bollenbach","orcid":"0000-0003-4398-476X"},{"first_name":"Dan I.","full_name":"Andersson, Dan I.","last_name":"Andersson"}],"page":"478-490","publisher":"Springer Nature","date_updated":"2023-08-02T14:41:44Z","publication_status":"published","article_type":"review","month":"08","date_published":"2022-08-01T00:00:00Z","article_processing_charge":"No","department":[{"_id":"CaGu"}],"oa_version":"None","publication_identifier":{"eissn":["1740-1534"],"issn":["1740-1526"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","year":"2022","status":"public"},{"year":"2022","status":"public","corr_author":"1","publication_identifier":{"issn":["2520-1158"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","oa":1,"article_processing_charge":"No","department":[{"_id":"StFr"}],"publication_status":"published","date_updated":"2024-10-09T21:01:46Z","date_published":"2022-03-03T00:00:00Z","month":"03","article_type":"original","publisher":"Springer Nature","quality_controlled":"1","author":[{"first_name":"Deqing","full_name":"Cao, Deqing","last_name":"Cao"},{"last_name":"Shen","full_name":"Shen, Xiaoxiao","first_name":"Xiaoxiao"},{"full_name":"Wang, Aiping","first_name":"Aiping","last_name":"Wang"},{"last_name":"Yu","first_name":"Fengjiao","full_name":"Yu, Fengjiao"},{"last_name":"Wu","first_name":"Yuping","full_name":"Wu, Yuping"},{"first_name":"Siqi","full_name":"Shi, Siqi","last_name":"Shi"},{"first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","last_name":"Freunberger"},{"first_name":"Yuhui","full_name":"Chen, Yuhui","last_name":"Chen"}],"page":"193-201","_id":"10813","doi":"10.1038/s41929-022-00752-z","publication":"Nature Catalysis","type":"journal_article","external_id":{"isi":["000763879400001"]},"acknowledgement":"This work was financially supported by the National Natural Science Foundation of China (grant nos. 51773092, 21975124, 11874254, 51802187 and U2030206). It was further supported by Fujian science & technology innovation laboratory for energy devices of China (21C-LAB), Key Research Project of Zhejiang Laboratory (grant no. 2021PE0AC02) and the Cultivation Program for the Excellent Doctoral Dissertation of Nanjing Tech University. S.A.F. is indebted to IST Austria for support.","citation":{"ama":"Cao D, Shen X, Wang A, et al. Threshold potentials for fast kinetics during mediated redox catalysis of insulators in Li–O2 and Li–S batteries. Nature Catalysis. 2022;5:193-201. doi:10.1038/s41929-022-00752-z","apa":"Cao, D., Shen, X., Wang, A., Yu, F., Wu, Y., Shi, S., … Chen, Y. (2022). Threshold potentials for fast kinetics during mediated redox catalysis of insulators in Li–O2 and Li–S batteries. Nature Catalysis. Springer Nature. https://doi.org/10.1038/s41929-022-00752-z","mla":"Cao, Deqing, et al. “Threshold Potentials for Fast Kinetics during Mediated Redox Catalysis of Insulators in Li–O2 and Li–S Batteries.” Nature Catalysis, vol. 5, Springer Nature, 2022, pp. 193–201, doi:10.1038/s41929-022-00752-z.","ieee":"D. Cao et al., “Threshold potentials for fast kinetics during mediated redox catalysis of insulators in Li–O2 and Li–S batteries,” Nature Catalysis, vol. 5. Springer Nature, pp. 193–201, 2022.","short":"D. Cao, X. Shen, A. Wang, F. Yu, Y. Wu, S. Shi, S.A. Freunberger, Y. Chen, Nature Catalysis 5 (2022) 193–201.","chicago":"Cao, Deqing, Xiaoxiao Shen, Aiping Wang, Fengjiao Yu, Yuping Wu, Siqi Shi, Stefan Alexander Freunberger, and Yuhui Chen. “Threshold Potentials for Fast Kinetics during Mediated Redox Catalysis of Insulators in Li–O2 and Li–S Batteries.” Nature Catalysis. Springer Nature, 2022. https://doi.org/10.1038/s41929-022-00752-z.","ista":"Cao D, Shen X, Wang A, Yu F, Wu Y, Shi S, Freunberger SA, Chen Y. 2022. Threshold potentials for fast kinetics during mediated redox catalysis of insulators in Li–O2 and Li–S batteries. Nature Catalysis. 5, 193–201."},"intvolume":" 5","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.21203/rs.3.rs-750965/v1","open_access":"1"}],"related_material":{"record":[{"id":"9978","relation":"earlier_version","status":"public"}]},"title":"Threshold potentials for fast kinetics during mediated redox catalysis of insulators in Li–O2 and Li–S batteries","volume":5,"keyword":["Process Chemistry and Technology","Biochemistry","Bioengineering","Catalysis"],"date_created":"2022-03-04T07:50:10Z","abstract":[{"lang":"eng","text":"Redox mediators could catalyse otherwise slow and energy-inefficient cycling of Li–S and Li–O2 batteries by shuttling electrons or holes between the electrode and the solid insulating storage materials. For mediators to work efficiently they need to oxidize the solid with fast kinetics but with the lowest possible overpotential. However, the dependence of kinetics and overpotential is unclear, which hinders informed improvement. Here, we find that when the redox potentials of mediators are tuned via, for example, Li+ concentration in the electrolyte, they exhibit distinct threshold potentials, where the kinetics accelerate several-fold within a range as small as 10 mV. This phenomenon is independent of types of mediator and electrolyte. The acceleration originates from the overpotentials required to activate fast Li+/e− extraction and the following chemical step at specific abundant surface facets. Efficient redox catalysis at insulating solids therefore requires careful consideration of the surface conditions of the storage materials and electrolyte-dependent redox potentials, which may be tuned by salt concentrations or solvents."}],"day":"03","scopus_import":"1","isi":1},{"publisher":"Association for Computing Machinery","publication_status":"published","date_updated":"2024-08-12T09:40:49Z","scopus_import":"1","extern":"1","month":"07","date_published":"2022-07-22T00:00:00Z","article_type":"original","date_created":"2024-08-05T06:30:07Z","article_processing_charge":"No","abstract":[{"text":"We present a computational inverse design framework for a new class of volumetric deployable structures that have compact rest states and deploy into bending-active 3D target surfaces. Umbrella meshes consist of elastic beams, rigid plates, and hinge joints that can be directly printed or assembled in a zero-energy fabrication state. During deployment, as the elastic beams of varying heights rotate from vertical to horizontal configurations, the entire structure transforms from a compact block into a target curved surface. Umbrella Meshes encode both intrinsic and extrinsic curvature of the target surface and in principle are free from the area expansion ratio bounds of past auxetic material systems.\r\nWe build a reduced physics-based simulation framework to accurately and efficiently model the complex interaction between the elastically deforming components. To determine the mesh topology and optimal shape parameters for approximating a given target surface, we propose an inverse design optimization algorithm initialized with conformal flattening. Our algorithm minimizes the structure's strain energy in its deployed state and optimizes actuation forces so that the final deployed structure is in stable equilibrium close to the desired surface with few or no external constraints. We validate our approach by fabricating a series of physical models at various scales using different manufacturing techniques.","lang":"eng"}],"day":"22","language":[{"iso":"eng"}],"title":"Umbrella meshes: Elastic mechanisms for freeform shape deployment","volume":41,"oa_version":"None","citation":{"ama":"Ren Y, Kusupati U, Panetta J, et al. Umbrella meshes: Elastic mechanisms for freeform shape deployment. ACM Transactions on Graphics. 2022;41(4):1-15. doi:10.1145/3528223.3530089","apa":"Ren, Y., Kusupati, U., Panetta, J., Isvoranu, F., Pellis, D., Chen, T., & Pauly, M. (2022). Umbrella meshes: Elastic mechanisms for freeform shape deployment. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3528223.3530089","ieee":"Y. Ren et al., “Umbrella meshes: Elastic mechanisms for freeform shape deployment,” ACM Transactions on Graphics, vol. 41, no. 4. Association for Computing Machinery, pp. 1–15, 2022.","mla":"Ren, Yingying, et al. “Umbrella Meshes: Elastic Mechanisms for Freeform Shape Deployment.” ACM Transactions on Graphics, vol. 41, no. 4, Association for Computing Machinery, 2022, pp. 1–15, doi:10.1145/3528223.3530089.","short":"Y. Ren, U. Kusupati, J. Panetta, F. Isvoranu, D. Pellis, T. Chen, M. Pauly, ACM Transactions on Graphics 41 (2022) 1–15.","chicago":"Ren, Yingying, Uday Kusupati, Julian Panetta, Florin Isvoranu, Davide Pellis, Tian Chen, and Mark Pauly. “Umbrella Meshes: Elastic Mechanisms for Freeform Shape Deployment.” ACM Transactions on Graphics. Association for Computing Machinery, 2022. https://doi.org/10.1145/3528223.3530089.","ista":"Ren Y, Kusupati U, Panetta J, Isvoranu F, Pellis D, Chen T, Pauly M. 2022. Umbrella meshes: Elastic mechanisms for freeform shape deployment. ACM Transactions on Graphics. 41(4), 1–15."},"intvolume":" 41","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"type":"journal_article","publication":"ACM Transactions on Graphics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"17383","doi":"10.1145/3528223.3530089","quality_controlled":"1","page":"1-15","year":"2022","status":"public","issue":"4","author":[{"last_name":"Ren","full_name":"Ren, Yingying","first_name":"Yingying","id":"93d68d10-3540-11ef-a265-f748a50dba3d"},{"last_name":"Kusupati","full_name":"Kusupati, Uday","first_name":"Uday"},{"full_name":"Panetta, Julian","first_name":"Julian","last_name":"Panetta"},{"first_name":"Florin","full_name":"Isvoranu, Florin","last_name":"Isvoranu"},{"last_name":"Pellis","first_name":"Davide","full_name":"Pellis, Davide"},{"full_name":"Chen, Tian","first_name":"Tian","last_name":"Chen"},{"last_name":"Pauly","full_name":"Pauly, Mark","first_name":"Mark"}]},{"extern":"1","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1145/3563345","open_access":"1"}],"language":[{"iso":"eng"}],"title":"BFF: Foundational and automated verification of bitfield-manipulating programs","volume":6,"date_created":"2024-09-05T08:27:17Z","abstract":[{"text":"Low-level systems code often needs to interact with data, such as page table entries or network packet headers, in which multiple pieces of information are packaged together as bitfield components of a single machine integer and accessed via bitfield manipulations (e.g., shifts and masking). Most existing approaches to verifying such code employ SMT solvers, instantiated with theories for bit vector reasoning: these provide a powerful hammer, but also significantly increase the trusted computing base of the verification toolchain.\r\nIn this work, we propose an alternative approach to the verification of bitfield-manipulating systems code, which we call BFF. Building on the RefinedC framework, BFF is not only highly automated (as SMT-based approaches are) but also foundational---i.e., it produces a machine-checked proof of program correctness against a formal semantics for C programs, fully mechanized in Coq. Unlike SMT-based approaches, we do not try to solve the general problem of arbitrary bit vector reasoning, but rather observe that real systems code typically accesses bitfields using simple, well-understood programming patterns: the layout of a bit vector is known up front, and its bitfields are accessed in predictable ways through a handful of bitwise operations involving bit masks. Correspondingly, we center our approach around the concept of a structured bit vector---i.e., a bit vector with a known bitfield layout---which we use to drive simple and predictable automation. We validate the BFF approach by verifying a range of bitfield-manipulating C functions drawn from real systems code, including page table manipulation code from the Linux kernel and the pKVM hypervisor.","lang":"eng"}],"day":"31","publication":"Proceedings of the ACM on Programming Languages","type":"journal_article","citation":{"mla":"Zhu, Fengmin, et al. “BFF: Foundational and Automated Verification of Bitfield-Manipulating Programs.” Proceedings of the ACM on Programming Languages, vol. 6, no. OOPSLA2, Association for Computing Machinery, 2022, pp. 1613–38, doi:10.1145/3563345.","ieee":"F. Zhu, M. J. Sammler, R. Lepigre, D. Dreyer, and D. Garg, “BFF: Foundational and automated verification of bitfield-manipulating programs,” Proceedings of the ACM on Programming Languages, vol. 6, no. OOPSLA2. Association for Computing Machinery, pp. 1613–1638, 2022.","apa":"Zhu, F., Sammler, M. J., Lepigre, R., Dreyer, D., & Garg, D. (2022). BFF: Foundational and automated verification of bitfield-manipulating programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3563345","ama":"Zhu F, Sammler MJ, Lepigre R, Dreyer D, Garg D. BFF: Foundational and automated verification of bitfield-manipulating programs. Proceedings of the ACM on Programming Languages. 2022;6(OOPSLA2):1613-1638. doi:10.1145/3563345","ista":"Zhu F, Sammler MJ, Lepigre R, Dreyer D, Garg D. 2022. BFF: Foundational and automated verification of bitfield-manipulating programs. Proceedings of the ACM on Programming Languages. 6(OOPSLA2), 1613–1638.","chicago":"Zhu, Fengmin, Michael Joachim Sammler, Rodolphe Lepigre, Derek Dreyer, and Deepak Garg. “BFF: Foundational and Automated Verification of Bitfield-Manipulating Programs.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2022. https://doi.org/10.1145/3563345.","short":"F. Zhu, M.J. Sammler, R. Lepigre, D. Dreyer, D. Garg, Proceedings of the ACM on Programming Languages 6 (2022) 1613–1638."},"intvolume":" 6","quality_controlled":"1","author":[{"last_name":"Zhu","first_name":"Fengmin","full_name":"Zhu, Fengmin"},{"last_name":"Sammler","full_name":"Sammler, Michael Joachim","first_name":"Michael Joachim","id":"510d3901-2a03-11ee-914d-d9ae9011f0a7"},{"first_name":"Rodolphe","full_name":"Lepigre, Rodolphe","last_name":"Lepigre"},{"first_name":"Derek","full_name":"Dreyer, Derek","last_name":"Dreyer"},{"last_name":"Garg","first_name":"Deepak","full_name":"Garg, Deepak"}],"page":"1613-1638","_id":"17501","doi":"10.1145/3563345","date_updated":"2024-09-10T09:49:18Z","publication_status":"published","article_type":"original","date_published":"2022-10-31T00:00:00Z","month":"10","publisher":"Association for Computing Machinery","oa":1,"article_processing_charge":"No","publication_identifier":{"issn":["2475-1421"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","issue":"OOPSLA2","year":"2022","status":"public"},{"title":"Islaris: Verification of machine code against authoritative ISA semantics","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3519939.3523434"}],"oa":1,"conference":{"name":"PLDI: Conference on Programming Language Design and Implementation","start_date":"2022-06-13","location":"San Diego, CA, United States","end_date":"2022-06-17"},"abstract":[{"text":"Recent years have seen great advances towards verifying large-scale systems code. However, these verifications are usually based on hand-written assembly or machine-code semantics for the underlying architecture that only cover a small part of the instruction set architecture (ISA). In contrast, other recent work has used Sail to establish formal models for large real-world architectures, including Armv8-A and RISC-V, that are comprehensive (complete enough to boot an operating system or hypervisor) and authoritative (automatically derived from the Arm internal model and validated against the Arm validation suite, and adopted as the official formal specification by RISC-V International, respectively). But the scale and complexity of these models makes them challenging to use as a basis for verification.\r\nIn this paper, we propose Islaris, the first system to support verification of machine code above these complete and authoritative real-world ISA specifications. Islaris uses a novel combination of SMT-solver-based symbolic execution (the Isla symbolic executor) and automated reasoning in a foundational program logic (a new separation logic we derive using Iris in Coq). We show that this approach can handle Armv8-A and RISC-V machine code exercising a wide range of systems features, including installing and calling exception vectors, code parametric on a relocation address offset (from the production pKVM hypervisor); unaligned access faults; memory-mapped IO; and compiled C code using inline assembly and function pointers.","lang":"eng"}],"article_processing_charge":"No","day":"09","date_created":"2024-09-05T08:29:08Z","date_published":"2022-06-09T00:00:00Z","month":"06","publication_status":"published","extern":"1","date_updated":"2024-09-10T11:08:03Z","scopus_import":"1","publisher":"Association for Computing Machinery","author":[{"id":"510d3901-2a03-11ee-914d-d9ae9011f0a7","first_name":"Michael Joachim","full_name":"Sammler, Michael Joachim","last_name":"Sammler"},{"full_name":"Hammond, Angus","first_name":"Angus","last_name":"Hammond"},{"last_name":"Lepigre","first_name":"Rodolphe","full_name":"Lepigre, Rodolphe"},{"first_name":"Brian","full_name":"Campbell, Brian","last_name":"Campbell"},{"full_name":"Pichon-Pharabod, Jean","first_name":"Jean","last_name":"Pichon-Pharabod"},{"last_name":"Dreyer","full_name":"Dreyer, Derek","first_name":"Derek"},{"full_name":"Garg, Deepak","first_name":"Deepak","last_name":"Garg"},{"first_name":"Peter","full_name":"Sewell, Peter","last_name":"Sewell"}],"year":"2022","status":"public","page":"825-840","quality_controlled":"1","doi":"10.1145/3519939.3523434","_id":"17502","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation","type":"conference","citation":{"ama":"Sammler MJ, Hammond A, Lepigre R, et al. Islaris: Verification of machine code against authoritative ISA semantics. In: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2022:825-840. doi:10.1145/3519939.3523434","apa":"Sammler, M. J., Hammond, A., Lepigre, R., Campbell, B., Pichon-Pharabod, J., Dreyer, D., … Sewell, P. (2022). Islaris: Verification of machine code against authoritative ISA semantics. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 825–840). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3519939.3523434","ieee":"M. J. Sammler et al., “Islaris: Verification of machine code against authoritative ISA semantics,” in Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, United States, 2022, pp. 825–840.","mla":"Sammler, Michael Joachim, et al. “Islaris: Verification of Machine Code against Authoritative ISA Semantics.” Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 825–40, doi:10.1145/3519939.3523434.","short":"M.J. Sammler, A. Hammond, R. Lepigre, B. Campbell, J. Pichon-Pharabod, D. Dreyer, D. Garg, P. Sewell, in:, Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 825–840.","chicago":"Sammler, Michael Joachim, Angus Hammond, Rodolphe Lepigre, Brian Campbell, Jean Pichon-Pharabod, Derek Dreyer, Deepak Garg, and Peter Sewell. “Islaris: Verification of Machine Code against Authoritative ISA Semantics.” In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 825–40. Association for Computing Machinery, 2022. https://doi.org/10.1145/3519939.3523434.","ista":"Sammler MJ, Hammond A, Lepigre R, Campbell B, Pichon-Pharabod J, Dreyer D, Garg D, Sewell P. 2022. Islaris: Verification of machine code against authoritative ISA semantics. Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 825–840."},"oa_version":"Published Version"},{"article_processing_charge":"No","oa":1,"publisher":"Association for Computing Machinery","date_published":"2022-01-12T00:00:00Z","article_type":"original","month":"01","date_updated":"2024-09-10T09:48:57Z","publication_status":"published","year":"2022","issue":"POPL","status":"public","oa_version":"Published Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["2475-1421"]},"abstract":[{"text":"Systems code often requires fine-grained control over memory layout and pointers, expressed using low-level (e.g., bitwise) operations on pointer values. Since these operations go beyond what basic pointer arithmetic in C allows, they are performed with the help of integer-pointer casts. Prior work has explored increasingly realistic memory object models for C that account for the desired semantics of integer-pointer casts while also being sound w.r.t. compiler optimisations, culminating in PNVI, the preferred memory object model in ongoing discussions within the ISO WG14 C standards committee. However, its complexity makes it an unappealing target for verification, and no tools currently exist to verify C programs under PNVI.\r\nIn this paper, we introduce VIP, a new memory object model aimed at supporting C verification. VIP sidesteps the complexities of PNVI with a simple but effective idea: a new construct that lets programmers express the intended provenances of integer-pointer casts explicitly. At the same time, we prove VIP compatible with PNVI, thus enabling verification on top of VIP to benefit from PNVI’s validation with respect to practice. In particular, we build a verification tool, RefinedC-VIP, for verifying programs under VIP semantics. As the name suggests, RefinedC-VIP extends the recently developed RefinedC tool, which is automated yet also produces foundational proofs in Coq. We evaluate RefinedC-VIP on a range of systems-code idioms, and validate VIP’s expressiveness via an implementation in the Cerberus C semantics.","lang":"eng"}],"day":"12","date_created":"2024-09-05T08:31:09Z","volume":6,"title":"VIP: Verifying real-world C idioms with integer-pointer casts","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1145/3498681","open_access":"1"}],"extern":"1","scopus_import":"1","doi":"10.1145/3498681","_id":"17503","author":[{"last_name":"Lepigre","first_name":"Rodolphe","full_name":"Lepigre, Rodolphe"},{"last_name":"Sammler","id":"510d3901-2a03-11ee-914d-d9ae9011f0a7","full_name":"Sammler, Michael Joachim","first_name":"Michael Joachim"},{"last_name":"Memarian","first_name":"Kayvan","full_name":"Memarian, Kayvan"},{"last_name":"Krebbers","first_name":"Robbert","full_name":"Krebbers, Robbert"},{"last_name":"Dreyer","full_name":"Dreyer, Derek","first_name":"Derek"},{"last_name":"Sewell","full_name":"Sewell, Peter","first_name":"Peter"}],"page":"1-32","quality_controlled":"1","intvolume":" 6","citation":{"chicago":"Lepigre, Rodolphe, Michael Joachim Sammler, Kayvan Memarian, Robbert Krebbers, Derek Dreyer, and Peter Sewell. “VIP: Verifying Real-World C Idioms with Integer-Pointer Casts.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2022. https://doi.org/10.1145/3498681.","short":"R. Lepigre, M.J. Sammler, K. Memarian, R. Krebbers, D. Dreyer, P. Sewell, Proceedings of the ACM on Programming Languages 6 (2022) 1–32.","ista":"Lepigre R, Sammler MJ, Memarian K, Krebbers R, Dreyer D, Sewell P. 2022. VIP: Verifying real-world C idioms with integer-pointer casts. Proceedings of the ACM on Programming Languages. 6(POPL), 1–32.","apa":"Lepigre, R., Sammler, M. J., Memarian, K., Krebbers, R., Dreyer, D., & Sewell, P. (2022). VIP: Verifying real-world C idioms with integer-pointer casts. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3498681","ama":"Lepigre R, Sammler MJ, Memarian K, Krebbers R, Dreyer D, Sewell P. VIP: Verifying real-world C idioms with integer-pointer casts. Proceedings of the ACM on Programming Languages. 2022;6(POPL):1-32. doi:10.1145/3498681","ieee":"R. Lepigre, M. J. Sammler, K. Memarian, R. Krebbers, D. Dreyer, and P. Sewell, “VIP: Verifying real-world C idioms with integer-pointer casts,” Proceedings of the ACM on Programming Languages, vol. 6, no. POPL. Association for Computing Machinery, pp. 1–32, 2022.","mla":"Lepigre, Rodolphe, et al. “VIP: Verifying Real-World C Idioms with Integer-Pointer Casts.” Proceedings of the ACM on Programming Languages, vol. 6, no. POPL, Association for Computing Machinery, 2022, pp. 1–32, doi:10.1145/3498681."},"type":"journal_article","publication":"Proceedings of the ACM on Programming Languages"},{"publication_identifier":{"issn":["2475-1421"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","status":"public","issue":"POPL","year":"2022","month":"01","article_type":"original","date_published":"2022-01-12T00:00:00Z","date_updated":"2024-09-10T09:48:37Z","publication_status":"published","publisher":"Association for Computing Machinery","oa":1,"article_processing_charge":"No","publication":"Proceedings of the ACM on Programming Languages","type":"journal_article","citation":{"apa":"Gäher, L., Sammler, M. J., Spies, S., Jung, R., Dang, H.-H., Krebbers, R., … Dreyer, D. (2022). Simuliris: A separation logic framework for verifying concurrent program optimizations. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3498689","ama":"Gäher L, Sammler MJ, Spies S, et al. Simuliris: A separation logic framework for verifying concurrent program optimizations. Proceedings of the ACM on Programming Languages. 2022;6(POPL):1-31. doi:10.1145/3498689","mla":"Gäher, Lennard, et al. “Simuliris: A Separation Logic Framework for Verifying Concurrent Program Optimizations.” Proceedings of the ACM on Programming Languages, vol. 6, no. POPL, Association for Computing Machinery, 2022, pp. 1–31, doi:10.1145/3498689.","ieee":"L. Gäher et al., “Simuliris: A separation logic framework for verifying concurrent program optimizations,” Proceedings of the ACM on Programming Languages, vol. 6, no. POPL. Association for Computing Machinery, pp. 1–31, 2022.","chicago":"Gäher, Lennard, Michael Joachim Sammler, Simon Spies, Ralf Jung, Hoang-Hai Dang, Robbert Krebbers, Jeehoon Kang, and Derek Dreyer. “Simuliris: A Separation Logic Framework for Verifying Concurrent Program Optimizations.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2022. https://doi.org/10.1145/3498689.","short":"L. Gäher, M.J. Sammler, S. Spies, R. Jung, H.-H. Dang, R. Krebbers, J. Kang, D. Dreyer, Proceedings of the ACM on Programming Languages 6 (2022) 1–31.","ista":"Gäher L, Sammler MJ, Spies S, Jung R, Dang H-H, Krebbers R, Kang J, Dreyer D. 2022. Simuliris: A separation logic framework for verifying concurrent program optimizations. Proceedings of the ACM on Programming Languages. 6(POPL), 1–31."},"intvolume":" 6","quality_controlled":"1","page":"1-31","author":[{"first_name":"Lennard","full_name":"Gäher, Lennard","last_name":"Gäher"},{"id":"510d3901-2a03-11ee-914d-d9ae9011f0a7","first_name":"Michael Joachim","full_name":"Sammler, Michael Joachim","last_name":"Sammler"},{"full_name":"Spies, Simon","first_name":"Simon","last_name":"Spies"},{"full_name":"Jung, Ralf","first_name":"Ralf","last_name":"Jung"},{"full_name":"Dang, Hoang-Hai","first_name":"Hoang-Hai","last_name":"Dang"},{"first_name":"Robbert","full_name":"Krebbers, Robbert","last_name":"Krebbers"},{"full_name":"Kang, Jeehoon","first_name":"Jeehoon","last_name":"Kang"},{"last_name":"Dreyer","first_name":"Derek","full_name":"Dreyer, Derek"}],"doi":"10.1145/3498689","_id":"17504","extern":"1","scopus_import":"1","title":"Simuliris: A separation logic framework for verifying concurrent program optimizations","main_file_link":[{"url":"https://doi.org/10.1145/3498689","open_access":"1"}],"language":[{"iso":"eng"}],"volume":6,"abstract":[{"lang":"eng","text":"Today’s compilers employ a variety of non-trivial optimizations to achieve good performance. One key trick compilers use to justify transformations of concurrent programs is to assume that the source program has no data races: if it does, they cause the program to have undefined behavior (UB) and give the compiler free rein. However, verifying correctness of optimizations that exploit this assumption is a non-trivial problem. In particular, prior work either has not proven that such optimizations preserve program termination (particularly non-obvious when considering optimizations that move instructions out of loop bodies), or has treated all synchronization operations as external functions (losing the ability to reorder instructions around them).\r\nIn this work we present Simuliris, the first simulation technique to establish termination preservation (under a fair scheduler) for a range of concurrent program transformations that exploit UB in the source language. Simuliris is based on the idea of using ownership to reason modularly about the assumptions the compiler makes about programs with well-defined behavior. This brings the benefits of concurrent separation logics to the space of verifying program transformations: we can combine powerful reasoning techniques such as framing and coinduction to perform thread-local proofs of non-trivial concurrent program optimizations. Simuliris is built on a (non-step-indexed) variant of the Coq-based Iris framework, and is thus not tied to a particular language. In addition to demonstrating the effectiveness of Simuliris on standard compiler optimizations involving data race UB, we also instantiate it with Jung et al.’s Stacked Borrows semantics for Rust and generalize their proofs of interesting type-based aliasing optimizations to account for concurrency."}],"day":"12","date_created":"2024-09-05T08:32:16Z"},{"intvolume":" 105","citation":{"ista":"Davelaar J, Haiman Z. 2022. Self-lensing flares from black hole binaries: General-relativistic ray tracing of black hole binaries. Physical Review D. 105(10), 103010.","chicago":"Davelaar, Jordy, and Zoltán Haiman. “Self-Lensing Flares from Black Hole Binaries: General-Relativistic Ray Tracing of Black Hole Binaries.” Physical Review D. American Physical Society (APS), 2022. https://doi.org/10.1103/physrevd.105.103010.","short":"J. Davelaar, Z. Haiman, Physical Review D 105 (2022).","ieee":"J. Davelaar and Z. Haiman, “Self-lensing flares from black hole binaries: General-relativistic ray tracing of black hole binaries,” Physical Review D, vol. 105, no. 10. American Physical Society (APS), 2022.","mla":"Davelaar, Jordy, and Zoltán Haiman. “Self-Lensing Flares from Black Hole Binaries: General-Relativistic Ray Tracing of Black Hole Binaries.” Physical Review D, vol. 105, no. 10, 103010, American Physical Society (APS), 2022, doi:10.1103/physrevd.105.103010.","apa":"Davelaar, J., & Haiman, Z. (2022). Self-lensing flares from black hole binaries: General-relativistic ray tracing of black hole binaries. Physical Review D. American Physical Society (APS). https://doi.org/10.1103/physrevd.105.103010","ama":"Davelaar J, Haiman Z. Self-lensing flares from black hole binaries: General-relativistic ray tracing of black hole binaries. Physical Review D. 2022;105(10). doi:10.1103/physrevd.105.103010"},"type":"journal_article","publication":"Physical Review D","doi":"10.1103/physrevd.105.103010","_id":"17526","author":[{"last_name":"Davelaar","full_name":"Davelaar, Jordy","first_name":"Jordy"},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","first_name":"Zoltán","last_name":"Haiman"}],"quality_controlled":"1","scopus_import":"1","extern":"1","abstract":[{"text":"The self-lensing of a massive black hole binary (MBHB), which occurs when the two BHs are aligned close to the line of sight, is expected to produce periodic, short-duration flares. Here we study the shapes of self-lensing flares (SLFs) via general-relativistic ray tracing in a superimposed binary BH metric, in which the emission is generated by geometrically thin accretion flows around each component. The suite of models covers eccentric binary orbits, black hole spins, unequal mass binaries, and different emission model geometries. We explore the above parameter space and report how the light curves change as a function of, e.g., binary separation, inclination, and eccentricity. We also compare our light curves to those in the microlensing approximation, and show how strong deflections, as well as time-delay effects, change the size and shape of the SLF. If gravitational waves (GWs) from the inspiraling MBHB are observed by LISA, SLFs can help securely identify the source and localizing it on the sky, and to constrain the graviton mass by comparing the phasing of the SLFs and the GWs. Additionally, when these systems are viewed edge-on the SLF shows a distinct dip that can be directly correlated with the BH shadow size. This opens a new way to measure BH shadow sizes in systems that are unresolvable by current VLBI facilities.","lang":"eng"}],"day":"09","date_created":"2024-09-05T09:29:24Z","volume":105,"title":"Self-lensing flares from black hole binaries: General-relativistic ray tracing of black hole binaries","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1103/physrevd.105.103010","open_access":"1"}],"oa_version":"Published Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["2470-0010","2470-0029"]},"issue":"10","year":"2022","status":"public","publisher":"American Physical Society (APS)","month":"05","article_type":"original","date_published":"2022-05-09T00:00:00Z","publication_status":"published","date_updated":"2024-09-11T08:41:55Z","article_number":"103010","article_processing_charge":"No","oa":1},{"arxiv":1,"intvolume":" 603","citation":{"mla":"Samsing, J., et al. “AGN as Potential Factories for Eccentric Black Hole Mergers.” Nature, vol. 603, no. 7900, Springer Science and Business Media LLC, 2022, pp. 237–40, doi:10.1038/s41586-021-04333-1.","ieee":"J. Samsing et al., “AGN as potential factories for eccentric black hole mergers,” Nature, vol. 603, no. 7900. Springer Science and Business Media LLC, pp. 237–240, 2022.","apa":"Samsing, J., Bartos, I., D’Orazio, D. J., Haiman, Z., Kocsis, B., Leigh, N. W. C., … Tagawa, H. (2022). AGN as potential factories for eccentric black hole mergers. Nature. Springer Science and Business Media LLC. https://doi.org/10.1038/s41586-021-04333-1","ama":"Samsing J, Bartos I, D’Orazio DJ, et al. AGN as potential factories for eccentric black hole mergers. Nature. 2022;603(7900):237-240. doi:10.1038/s41586-021-04333-1","ista":"Samsing J, Bartos I, D’Orazio DJ, Haiman Z, Kocsis B, Leigh NWC, Liu B, Pessah ME, Tagawa H. 2022. AGN as potential factories for eccentric black hole mergers. Nature. 603(7900), 237–240.","chicago":"Samsing, J., I. Bartos, D. J. D’Orazio, Zoltán Haiman, B. Kocsis, N. W. C. Leigh, B. Liu, M. E. Pessah, and H. Tagawa. “AGN as Potential Factories for Eccentric Black Hole Mergers.” Nature. Springer Science and Business Media LLC, 2022. https://doi.org/10.1038/s41586-021-04333-1.","short":"J. Samsing, I. Bartos, D.J. D’Orazio, Z. Haiman, B. Kocsis, N.W.C. Leigh, B. Liu, M.E. Pessah, H. Tagawa, Nature 603 (2022) 237–240."},"external_id":{"arxiv":["2010.09765"]},"publication":"Nature","type":"journal_article","doi":"10.1038/s41586-021-04333-1","_id":"17536","author":[{"last_name":"Samsing","first_name":"J.","full_name":"Samsing, J."},{"last_name":"Bartos","full_name":"Bartos, I.","first_name":"I."},{"last_name":"D’Orazio","first_name":"D. J.","full_name":"D’Orazio, D. J."},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","first_name":"Zoltán","last_name":"Haiman"},{"last_name":"Kocsis","full_name":"Kocsis, B.","first_name":"B."},{"last_name":"Leigh","first_name":"N. W. C.","full_name":"Leigh, N. W. C."},{"full_name":"Liu, B.","first_name":"B.","last_name":"Liu"},{"last_name":"Pessah","full_name":"Pessah, M. E.","first_name":"M. E."},{"first_name":"H.","full_name":"Tagawa, H.","last_name":"Tagawa"}],"page":"237-240","quality_controlled":"1","extern":"1","scopus_import":"1","abstract":[{"lang":"eng","text":"There is some weak evidence that the black hole merger named GW190521 had a non-zero eccentricity. In addition, the component black holes' masses exceeded the limit predicted by stellar evolution. The large masses can be explained by successive mergers, which may be efficient in gas disks surrounding active galactic nuclei (AGN), but it is difficult to maintain an eccentric orbit all the way to the merger, as basic physics would argue for circularization. Here we show that AGN-disk environments can lead to an excess of eccentric mergers, if the interactions between single and binary black holes are frequent, and occur with mutual inclinations of less than a few degrees. We further illustrate that this eccentric population has a different distribution of the inclination between the spin vectors of the black holes and their orbital angular momentum at merger, referred to as the spin-orbit tilt, compared to the remaining circular mergers."}],"day":"09","date_created":"2024-09-05T09:45:31Z","volume":603,"title":"AGN as potential factories for eccentric black hole mergers","language":[{"iso":"eng"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2010.09765","open_access":"1"}],"oa_version":"Preprint","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["0028-0836","1476-4687"]},"issue":"7900","year":"2022","status":"public","publisher":"Springer Science and Business Media LLC","article_type":"original","month":"05","date_published":"2022-05-09T00:00:00Z","date_updated":"2024-09-12T09:24:50Z","publication_status":"published","article_processing_charge":"No","oa":1},{"extern":"1","scopus_import":"1","abstract":[{"lang":"eng","text":"Supermassive black hole (BH) binaries are thought to produce self-lensing flares (SLFs) when the two BHs are aligned with the line of sight. If the binary orbit is observed nearly edge-on, we find a distinct feature in the light curve imprinted by the relativistic shadow around the background (“source”) BH. We study this feature by ray tracing in a binary model and predict that 1% of the current binary candidates could show this feature. Our BH tomography method proposed here could make it possible to extract BH shadows that are spatially unresolvable by high-resolution very long base line interferometry (VLBI)."}],"day":"09","date_created":"2024-09-05T10:07:30Z","title":"Self-Lensing flares from black hole binaries: Observing black hole shadows via light curve tomography","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2112.05829"}],"volume":128,"citation":{"short":"J. Davelaar, Z. Haiman, Physical Review Letters 128 (2022).","chicago":"Davelaar, Jordy, and Zoltán Haiman. “Self-Lensing Flares from Black Hole Binaries: Observing Black Hole Shadows via Light Curve Tomography.” Physical Review Letters. American Physical Society, 2022. https://doi.org/10.1103/physrevlett.128.191101.","ista":"Davelaar J, Haiman Z. 2022. Self-Lensing flares from black hole binaries: Observing black hole shadows via light curve tomography. Physical Review Letters. 128(19), 191101.","ama":"Davelaar J, Haiman Z. Self-Lensing flares from black hole binaries: Observing black hole shadows via light curve tomography. Physical Review Letters. 2022;128(19). doi:10.1103/physrevlett.128.191101","apa":"Davelaar, J., & Haiman, Z. (2022). Self-Lensing flares from black hole binaries: Observing black hole shadows via light curve tomography. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.128.191101","ieee":"J. Davelaar and Z. Haiman, “Self-Lensing flares from black hole binaries: Observing black hole shadows via light curve tomography,” Physical Review Letters, vol. 128, no. 19. American Physical Society, 2022.","mla":"Davelaar, Jordy, and Zoltán Haiman. “Self-Lensing Flares from Black Hole Binaries: Observing Black Hole Shadows via Light Curve Tomography.” Physical Review Letters, vol. 128, no. 19, 191101, American Physical Society, 2022, doi:10.1103/physrevlett.128.191101."},"external_id":{"arxiv":["2112.05829"]},"arxiv":1,"intvolume":" 128","type":"journal_article","publication":"Physical Review Letters","doi":"10.1103/physrevlett.128.191101","_id":"17547","quality_controlled":"1","author":[{"first_name":"Jordy","full_name":"Davelaar, Jordy","last_name":"Davelaar"},{"last_name":"Haiman","first_name":"Zoltán","full_name":"Haiman, Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"}],"publisher":"American Physical Society","date_published":"2022-05-09T00:00:00Z","article_type":"original","month":"05","date_updated":"2024-09-18T09:24:54Z","publication_status":"published","article_processing_charge":"No","article_number":"191101","oa":1,"oa_version":"Preprint","publication_identifier":{"issn":["0031-9007","1079-7114"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"19","status":"public","year":"2022"},{"publisher":"American Astronomical Society","date_updated":"2024-09-18T10:18:01Z","publication_status":"published","date_published":"2022-06-13T00:00:00Z","article_type":"original","month":"06","article_processing_charge":"No","article_number":"24","oa":1,"oa_version":"Published Version","publication_identifier":{"issn":["0004-637X","1538-4357"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","year":"2022","issue":"1","scopus_import":"1","extern":"1","date_created":"2024-09-05T10:17:13Z","abstract":[{"text":"Linear analysis of gas flows around orbiting binaries suggests that a centrifugal barrier ought to clear a low-density cavity around the binary and inhibit mass transfer onto it. Modern hydrodynamics simulations have confirmed the low-density cavity, but show that any mass flowing from large scales into the circumbinary disk is eventually transferred onto the binary components. Even though many numerical studies confirm this picture, it is still not understood precisely how gas parcels overcome the centrifugal barrier and ultimately accrete. We present a detailed analysis of the binary accretion process, using an accurate prescription for evolving grid-based hydrodynamics with Lagrangian tracer particles that track the trajectories of individual gas parcels. We find that binary accretion can be described in four phases: (1) gas is viscously transported through the circumbinary disk up to the centrifugal barrier at the cavity wall, (2) the cavity wall is tidally distorted into accretion streams consisting of near-ballistic gas parcels on eccentric orbits, (3) the portion of each stream moving inwards of an ``accretion horizon'' radius r¯≃a -- the radius beyond which no material is returned to the cavity wall -- becomes bound to a minidisk orbiting an individual binary component, and (4) the minidisk gas accretes onto the binary component through the combined effect of viscous and tidal stresses.","lang":"eng"}],"day":"13","main_file_link":[{"open_access":"1","url":"https://doi.org/10.3847/1538-4357/ac6c2b"}],"language":[{"iso":"eng"}],"title":"How binaries accrete: Hydrodynamic simulations with passive tracer particles","volume":932,"citation":{"mla":"Tiede, Christopher, et al. “How Binaries Accrete: Hydrodynamic Simulations with Passive Tracer Particles.” The Astrophysical Journal, vol. 932, no. 1, 24, American Astronomical Society, 2022, doi:10.3847/1538-4357/ac6c2b.","ieee":"C. Tiede, J. Zrake, A. MacFadyen, and Z. Haiman, “How binaries accrete: Hydrodynamic simulations with passive tracer particles,” The Astrophysical Journal, vol. 932, no. 1. American Astronomical Society, 2022.","apa":"Tiede, C., Zrake, J., MacFadyen, A., & Haiman, Z. (2022). How binaries accrete: Hydrodynamic simulations with passive tracer particles. The Astrophysical Journal. American Astronomical Society. https://doi.org/10.3847/1538-4357/ac6c2b","ama":"Tiede C, Zrake J, MacFadyen A, Haiman Z. How binaries accrete: Hydrodynamic simulations with passive tracer particles. The Astrophysical Journal. 2022;932(1). doi:10.3847/1538-4357/ac6c2b","ista":"Tiede C, Zrake J, MacFadyen A, Haiman Z. 2022. How binaries accrete: Hydrodynamic simulations with passive tracer particles. The Astrophysical Journal. 932(1), 24.","chicago":"Tiede, Christopher, Jonathan Zrake, Andrew MacFadyen, and Zoltán Haiman. “How Binaries Accrete: Hydrodynamic Simulations with Passive Tracer Particles.” The Astrophysical Journal. American Astronomical Society, 2022. https://doi.org/10.3847/1538-4357/ac6c2b.","short":"C. Tiede, J. Zrake, A. MacFadyen, Z. Haiman, The Astrophysical Journal 932 (2022)."},"intvolume":" 932","type":"journal_article","publication":"The Astrophysical Journal","_id":"17553","doi":"10.3847/1538-4357/ac6c2b","quality_controlled":"1","author":[{"last_name":"Tiede","first_name":"Christopher","full_name":"Tiede, Christopher"},{"full_name":"Zrake, Jonathan","first_name":"Jonathan","last_name":"Zrake"},{"full_name":"MacFadyen, Andrew","first_name":"Andrew","last_name":"MacFadyen"},{"last_name":"Haiman","full_name":"Haiman, Zoltán","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"}]},{"author":[{"full_name":"Hu, Haojie","first_name":"Haojie","last_name":"Hu"},{"first_name":"Kohei","full_name":"Inayoshi, Kohei","last_name":"Inayoshi"},{"full_name":"Haiman, Zoltán","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","last_name":"Haiman"},{"last_name":"Li","full_name":"Li, Wenxiu","first_name":"Wenxiu"},{"full_name":"Quataert, Eliot","first_name":"Eliot","last_name":"Quataert"},{"first_name":"Rolf","full_name":"Kuiper, Rolf","last_name":"Kuiper"}],"quality_controlled":"1","doi":"10.3847/1538-4357/ac7daa","_id":"17560","type":"journal_article","publication":"The Astrophysical Journal","intvolume":" 935","citation":{"ista":"Hu H, Inayoshi K, Haiman Z, Li W, Quataert E, Kuiper R. 2022. Supercritical growth pathway to overmassive black holes at cosmic dawn: Coevolution with massive quasar hosts. The Astrophysical Journal. 935(2), 140.","chicago":"Hu, Haojie, Kohei Inayoshi, Zoltán Haiman, Wenxiu Li, Eliot Quataert, and Rolf Kuiper. “Supercritical Growth Pathway to Overmassive Black Holes at Cosmic Dawn: Coevolution with Massive Quasar Hosts.” The Astrophysical Journal. American Astronomical Society, 2022. https://doi.org/10.3847/1538-4357/ac7daa.","short":"H. Hu, K. Inayoshi, Z. Haiman, W. Li, E. Quataert, R. Kuiper, The Astrophysical Journal 935 (2022).","mla":"Hu, Haojie, et al. “Supercritical Growth Pathway to Overmassive Black Holes at Cosmic Dawn: Coevolution with Massive Quasar Hosts.” The Astrophysical Journal, vol. 935, no. 2, 140, American Astronomical Society, 2022, doi:10.3847/1538-4357/ac7daa.","ieee":"H. Hu, K. Inayoshi, Z. Haiman, W. Li, E. Quataert, and R. Kuiper, “Supercritical growth pathway to overmassive black holes at cosmic dawn: Coevolution with massive quasar hosts,” The Astrophysical Journal, vol. 935, no. 2. American Astronomical Society, 2022.","apa":"Hu, H., Inayoshi, K., Haiman, Z., Li, W., Quataert, E., & Kuiper, R. (2022). Supercritical growth pathway to overmassive black holes at cosmic dawn: Coevolution with massive quasar hosts. The Astrophysical Journal. American Astronomical Society. https://doi.org/10.3847/1538-4357/ac7daa","ama":"Hu H, Inayoshi K, Haiman Z, Li W, Quataert E, Kuiper R. Supercritical growth pathway to overmassive black holes at cosmic dawn: Coevolution with massive quasar hosts. The Astrophysical Journal. 2022;935(2). doi:10.3847/1538-4357/ac7daa"},"volume":935,"title":"Supercritical growth pathway to overmassive black holes at cosmic dawn: Coevolution with massive quasar hosts","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.3847/1538-4357/ac7daa"}],"abstract":[{"text":"Observations of the most luminous quasars at high redshifts (z>6) have revealed that the largest supermassive black holes (SMBHs) at those epochs tend to be substantially overmassive relative to their host galaxies compared to the local relations, suggesting they experienced rapid early growth phases. We propose an assembly model for the SMBHs that end up in rare massive ∼1012 M⊙ host halos at z∼6−7, applying a kinetic feedback prescription for BHs accreting above the Eddington rate, provided by radiation hydrodynamic simulations for the long-term evolution of the accretion-flow structure. The large inflow rates into these halos during their assembly enable the formation of >109 M⊙ SMBHs by z∼6, even starting from stellar-mass seeds at z∼30, and even in the presence of outflows that reduce the BH feeding rate, especially at early times. This mechanism also naturally yields a high BH-to-galaxy mass ratio of >0.01 before the SMBH mass reaches MBH>109 M⊙ by z∼6. These fast-growing SMBH progenitors are bright enough to be detected by upcoming observations with the James Webb Space Telescope over a wide range of redshift (7The Astrophysical Journal Letters. American Astronomical Society, 2022. https://doi.org/10.3847/2041-8213/ac7c0b.","ista":"Yang Y, Bartos I, Fragione G, Haiman Z, Kowalski M, Márka S, Perna R, Tagawa H. 2022. Tidal disruption on stellar-mass black holes in active galactic nuclei. The Astrophysical Journal Letters. 933(2), L28.","ama":"Yang Y, Bartos I, Fragione G, et al. Tidal disruption on stellar-mass black holes in active galactic nuclei. The Astrophysical Journal Letters. 2022;933(2). doi:10.3847/2041-8213/ac7c0b","apa":"Yang, Y., Bartos, I., Fragione, G., Haiman, Z., Kowalski, M., Márka, S., … Tagawa, H. (2022). Tidal disruption on stellar-mass black holes in active galactic nuclei. The Astrophysical Journal Letters. American Astronomical Society. https://doi.org/10.3847/2041-8213/ac7c0b","ieee":"Y. Yang et al., “Tidal disruption on stellar-mass black holes in active galactic nuclei,” The Astrophysical Journal Letters, vol. 933, no. 2. American Astronomical Society, 2022.","mla":"Yang, Y., et al. “Tidal Disruption on Stellar-Mass Black Holes in Active Galactic Nuclei.” The Astrophysical Journal Letters, vol. 933, no. 2, L28, American Astronomical Society, 2022, doi:10.3847/2041-8213/ac7c0b."},"intvolume":" 933","publication":"The Astrophysical Journal Letters","type":"journal_article","_id":"17561","doi":"10.3847/2041-8213/ac7c0b","quality_controlled":"1","author":[{"last_name":"Yang","first_name":"Y.","full_name":"Yang, Y."},{"last_name":"Bartos","first_name":"I.","full_name":"Bartos, I."},{"last_name":"Fragione","first_name":"G.","full_name":"Fragione, G."},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","first_name":"Zoltán","last_name":"Haiman"},{"last_name":"Kowalski","first_name":"M.","full_name":"Kowalski, M."},{"full_name":"Márka, S.","first_name":"S.","last_name":"Márka"},{"first_name":"R.","full_name":"Perna, R.","last_name":"Perna"},{"last_name":"Tagawa","full_name":"Tagawa, H.","first_name":"H."}],"publisher":"American Astronomical Society","publication_status":"published","date_updated":"2024-09-18T12:38:14Z","date_published":"2022-07-07T00:00:00Z","article_type":"original","month":"07","article_processing_charge":"No","article_number":"L28","oa":1,"oa_version":"Published Version","publication_identifier":{"issn":["2041-8205","2041-8213"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"2","year":"2022","status":"public"},{"extern":"1","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1093/mnras/stac161","open_access":"1"}],"language":[{"iso":"eng"}],"title":"Simultaneously constraining cosmology and baryonic physics via deep learning from weak lensing","volume":511,"date_created":"2024-09-05T12:02:56Z","abstract":[{"text":"Ongoing and planned weak lensing (WL) surveys are becoming deep enough to contain information on angular scales down to a few arcmin. To fully extract information from these small scales, we must capture non-Gaussian features in the cosmological WL signal while accurately accounting for baryonic effects. In this work, we account for baryonic physics via a baryonic correction model that modifies the matter distribution in dark matter-only N-body simulations, mimicking the effects of galaxy formation and feedback. We implement this model in a large suite of ray-tracing simulations, spanning a grid of cosmological models in Ωm−σ8 space. We then develop a convolutional neural network (CNN) architecture to learn and constrain cosmological and baryonic parameters simultaneously from the simulated WL convergence maps. We find that in a Hyper-Suprime Cam-like survey, our CNN achieves a 1.7× tighter constraint in Ωm−σ8 space (1σ area) than the power spectrum and 2.1× tighter than the peak counts, showing that the CNN can efficiently extract non-Gaussian cosmological information even while marginalizing over baryonic effects. When we combine our CNN with the power spectrum, the baryonic effects degrade the constraint in Ωm−σ8 space by a factor of 2.4, compared to the much worse degradation by a factor of 4.7 or 3.7 from either method alone.","lang":"eng"}],"day":"28","type":"journal_article","publication":"Monthly Notices of the Royal Astronomical Society","citation":{"ieee":"T. Lu, Z. Haiman, and J. M. Zorrilla Matilla, “Simultaneously constraining cosmology and baryonic physics via deep learning from weak lensing,” Monthly Notices of the Royal Astronomical Society, vol. 511, no. 1. Oxford University Press, pp. 1518–1528, 2022.","mla":"Lu, Tianhuan, et al. “Simultaneously Constraining Cosmology and Baryonic Physics via Deep Learning from Weak Lensing.” Monthly Notices of the Royal Astronomical Society, vol. 511, no. 1, Oxford University Press, 2022, pp. 1518–28, doi:10.1093/mnras/stac161.","apa":"Lu, T., Haiman, Z., & Zorrilla Matilla, J. M. (2022). Simultaneously constraining cosmology and baryonic physics via deep learning from weak lensing. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stac161","ama":"Lu T, Haiman Z, Zorrilla Matilla JM. Simultaneously constraining cosmology and baryonic physics via deep learning from weak lensing. Monthly Notices of the Royal Astronomical Society. 2022;511(1):1518-1528. doi:10.1093/mnras/stac161","ista":"Lu T, Haiman Z, Zorrilla Matilla JM. 2022. Simultaneously constraining cosmology and baryonic physics via deep learning from weak lensing. Monthly Notices of the Royal Astronomical Society. 511(1), 1518–1528.","chicago":"Lu, Tianhuan, Zoltán Haiman, and José Manuel Zorrilla Matilla. “Simultaneously Constraining Cosmology and Baryonic Physics via Deep Learning from Weak Lensing.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2022. https://doi.org/10.1093/mnras/stac161.","short":"T. Lu, Z. Haiman, J.M. Zorrilla Matilla, Monthly Notices of the Royal Astronomical Society 511 (2022) 1518–1528."},"intvolume":" 511","quality_controlled":"1","author":[{"first_name":"Tianhuan","full_name":"Lu, Tianhuan","last_name":"Lu"},{"last_name":"Haiman","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","first_name":"Zoltán"},{"last_name":"Zorrilla Matilla","first_name":"José Manuel","full_name":"Zorrilla Matilla, José Manuel"}],"page":"1518-1528","_id":"17562","doi":"10.1093/mnras/stac161","publication_status":"published","date_updated":"2024-09-18T12:41:52Z","date_published":"2022-01-28T00:00:00Z","article_type":"original","month":"01","publisher":"Oxford University Press","oa":1,"article_processing_charge":"No","publication_identifier":{"issn":["0035-8711","1365-2966"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","issue":"1","status":"public","year":"2022"},{"intvolume":" 105","citation":{"ama":"Sabyr A, Haiman Z, Matilla JMZ, Lu T. Cosmological constraints from weak lensing peaks: Can halo models accurately predict peak counts? Physical Review D. 2022;105(2). doi:10.1103/physrevd.105.023505","apa":"Sabyr, A., Haiman, Z., Matilla, J. M. Z., & Lu, T. (2022). Cosmological constraints from weak lensing peaks: Can halo models accurately predict peak counts? Physical Review D. American Physical Society. https://doi.org/10.1103/physrevd.105.023505","mla":"Sabyr, Alina, et al. “Cosmological Constraints from Weak Lensing Peaks: Can Halo Models Accurately Predict Peak Counts?” Physical Review D, vol. 105, no. 2, 023505, American Physical Society, 2022, doi:10.1103/physrevd.105.023505.","ieee":"A. Sabyr, Z. Haiman, J. M. Z. Matilla, and T. Lu, “Cosmological constraints from weak lensing peaks: Can halo models accurately predict peak counts?,” Physical Review D, vol. 105, no. 2. American Physical Society, 2022.","short":"A. Sabyr, Z. Haiman, J.M.Z. Matilla, T. Lu, Physical Review D 105 (2022).","chicago":"Sabyr, Alina, Zoltán Haiman, José Manuel Zorrilla Matilla, and Tianhuan Lu. “Cosmological Constraints from Weak Lensing Peaks: Can Halo Models Accurately Predict Peak Counts?” Physical Review D. American Physical Society, 2022. https://doi.org/10.1103/physrevd.105.023505.","ista":"Sabyr A, Haiman Z, Matilla JMZ, Lu T. 2022. Cosmological constraints from weak lensing peaks: Can halo models accurately predict peak counts? Physical Review D. 105(2), 023505."},"publication":"Physical Review D","type":"journal_article","doi":"10.1103/physrevd.105.023505","_id":"17563","author":[{"last_name":"Sabyr","full_name":"Sabyr, Alina","first_name":"Alina"},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","first_name":"Zoltán","last_name":"Haiman"},{"first_name":"José Manuel Zorrilla","full_name":"Matilla, José Manuel Zorrilla","last_name":"Matilla"},{"last_name":"Lu","first_name":"Tianhuan","full_name":"Lu, Tianhuan"}],"quality_controlled":"1","scopus_import":"1","extern":"1","day":"07","abstract":[{"lang":"eng","text":"In order to extract full cosmological information from next-generation large and high-precision weak lensing (WL) surveys (e.g., Euclid, Roman, and LSST), higher-order statistics that probe the small-scale, nonlinear regime of large-scale structure (LSS) need to be utilized. WL peak counts, which trace overdensities in the cosmic web, are one promising and simple statistic for constraining cosmological parameters. The physical origin of WL peaks have previously been linked to dark matter halos along the line of sight, and this peak-halo connection has been used to develop various semianalytic halo-based models for predicting peak counts. Here, we study the origin of WL peaks and the effectiveness of halo-based models for WL peak counts using a suite of ray-tracing N-body simulations. We compare WL peaks in convergence maps from the full simulations to those in maps created from only particles associated with halos—the latter playing the role of a “perfect” halo model. We find that, while halo-only contributions are able to replicate peak counts qualitatively well, halos do not explain all WL peaks. Halos particularly underpredict negative peaks, which are associated with local overdensities in large-scale underdense regions along the line of sight. In addition, neglecting nonhalo contributions to peaks counts leads to a significant bias on the parameters (Ωm, 𝜎8) for surveys larger than ⪆100 deg2. We conclude that other elements of the cosmic web, outside and far away from dark matter halos, need to be incorporated into models of WL peaks in order to infer unbiased cosmological constraints."}],"date_created":"2024-09-05T12:03:46Z","volume":105,"title":"Cosmological constraints from weak lensing peaks: Can halo models accurately predict peak counts?","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1103/PhysRevD.105.023505"}],"language":[{"iso":"eng"}],"oa_version":"Published Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["2470-0010","2470-0029"]},"status":"public","year":"2022","issue":"2","publisher":"American Physical Society","month":"01","date_published":"2022-01-07T00:00:00Z","article_type":"original","date_updated":"2024-09-18T12:52:58Z","publication_status":"published","article_number":"023505","article_processing_charge":"No","oa":1},{"oa":1,"article_number":"41","article_processing_charge":"No","article_type":"original","month":"03","date_published":"2022-03-03T00:00:00Z","publication_status":"published","date_updated":"2024-09-18T14:57:06Z","publisher":"American Astronomical Society","year":"2022","status":"public","issue":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["0004-637X","1538-4357"]},"oa_version":"Published Version","volume":927,"title":"Can stellar-mass black hole growth disrupt disks of active galactic nuclei? The role of mechanical feedback","main_file_link":[{"url":"https://doi.org/10.3847/1538-4357/ac45f8","open_access":"1"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Stellar-mass BHs (sBHs) are predicted to be embedded in active galactic nuclei (AGN) disks due to gravitational drag and in-situ star formation. However, we find that due to a high gas density in an AGN disk environment, compact objects may rapidly grow to intermediate-mass BHs and deplete matter from the AGN disk unless accretion is suppressed by some feedback process(es). These consequences are inconsistent with AGN observations and the dynamics of the Galactic center. Here we consider mechanical feedback mechanisms for the reduction of gas accretion. Rapidly accreting sBHs launch winds and/or jets via the Blandford-Znajek mechanism, which produce high-pressure shocks and cocoons. Such a shock and cocoon can spread laterally in the plane of the disk, eject the outer regions of a circum-sBH disk (CsBD) and puncture a hole in the AGN disk with horizontal size comparable to the disk scale-height. Since the depletion timescale of the bound CsBD is much shorter than the resupply timescale of gas to the sBH, the time-averaged accretion rate onto sBHs is reduced by this process by a factor of ∼10--100. This feedback mechanism can therefore help alleviate the sBH over-growth and AGN-disk depletion problems. On the other hand, we find that cocoons of jets can unbind a large fraction of the gas accreting in the disks of less massive SMBHs, which may help explain the dearth of high-Eddington ratio AGNs with SMBH mass ≲105M⊙."}],"day":"03","date_created":"2024-09-05T12:13:22Z","scopus_import":"1","extern":"1","author":[{"first_name":"Hiromichi","full_name":"Tagawa, Hiromichi","last_name":"Tagawa"},{"last_name":"Kimura","full_name":"Kimura, Shigeo S.","first_name":"Shigeo S."},{"first_name":"Zoltán","full_name":"Haiman, Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","last_name":"Haiman"},{"last_name":"Perna","full_name":"Perna, Rosalba","first_name":"Rosalba"},{"last_name":"Tanaka","first_name":"Hidekazu","full_name":"Tanaka, Hidekazu"},{"last_name":"Bartos","first_name":"Imre","full_name":"Bartos, Imre"}],"quality_controlled":"1","doi":"10.3847/1538-4357/ac45f8","_id":"17568","publication":"The Astrophysical Journal","type":"journal_article","intvolume":" 927","citation":{"chicago":"Tagawa, Hiromichi, Shigeo S. Kimura, Zoltán Haiman, Rosalba Perna, Hidekazu Tanaka, and Imre Bartos. “Can Stellar-Mass Black Hole Growth Disrupt Disks of Active Galactic Nuclei? The Role of Mechanical Feedback.” The Astrophysical Journal. American Astronomical Society, 2022. https://doi.org/10.3847/1538-4357/ac45f8.","short":"H. Tagawa, S.S. Kimura, Z. Haiman, R. Perna, H. Tanaka, I. Bartos, The Astrophysical Journal 927 (2022).","ista":"Tagawa H, Kimura SS, Haiman Z, Perna R, Tanaka H, Bartos I. 2022. Can stellar-mass black hole growth disrupt disks of active galactic nuclei? The role of mechanical feedback. The Astrophysical Journal. 927(1), 41.","apa":"Tagawa, H., Kimura, S. S., Haiman, Z., Perna, R., Tanaka, H., & Bartos, I. (2022). Can stellar-mass black hole growth disrupt disks of active galactic nuclei? The role of mechanical feedback. The Astrophysical Journal. American Astronomical Society. https://doi.org/10.3847/1538-4357/ac45f8","ama":"Tagawa H, Kimura SS, Haiman Z, Perna R, Tanaka H, Bartos I. Can stellar-mass black hole growth disrupt disks of active galactic nuclei? The role of mechanical feedback. The Astrophysical Journal. 2022;927(1). doi:10.3847/1538-4357/ac45f8","mla":"Tagawa, Hiromichi, et al. “Can Stellar-Mass Black Hole Growth Disrupt Disks of Active Galactic Nuclei? The Role of Mechanical Feedback.” The Astrophysical Journal, vol. 927, no. 1, 41, American Astronomical Society, 2022, doi:10.3847/1538-4357/ac45f8.","ieee":"H. Tagawa, S. S. Kimura, Z. Haiman, R. Perna, H. Tanaka, and I. Bartos, “Can stellar-mass black hole growth disrupt disks of active galactic nuclei? The role of mechanical feedback,” The Astrophysical Journal, vol. 927, no. 1. American Astronomical Society, 2022."}},{"status":"public","year":"2022","issue":"2","oa_version":"Published Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["0035-8711","1365-2966"]},"article_processing_charge":"No","oa":1,"publisher":"Oxford University Press","month":"12","date_published":"2022-12-20T00:00:00Z","article_type":"original","publication_status":"published","date_updated":"2024-09-19T07:18:22Z","doi":"10.1093/mnras/stac3715","_id":"17571","author":[{"first_name":"Matthew T","full_name":"Scoggins, Matthew T","last_name":"Scoggins"},{"first_name":"Zoltán","full_name":"Haiman, Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","last_name":"Haiman"},{"first_name":"John H","full_name":"Wise, John H","last_name":"Wise"}],"page":"2155-2168","quality_controlled":"1","intvolume":" 519","citation":{"ama":"Scoggins MT, Haiman Z, Wise JH. How long do high redshift massive black hole seeds remain outliers in black hole versus host galaxy relations? Monthly Notices of the Royal Astronomical Society. 2022;519(2):2155-2168. doi:10.1093/mnras/stac3715","apa":"Scoggins, M. T., Haiman, Z., & Wise, J. H. (2022). How long do high redshift massive black hole seeds remain outliers in black hole versus host galaxy relations? Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stac3715","ieee":"M. T. Scoggins, Z. Haiman, and J. H. Wise, “How long do high redshift massive black hole seeds remain outliers in black hole versus host galaxy relations?,” Monthly Notices of the Royal Astronomical Society, vol. 519, no. 2. Oxford University Press, pp. 2155–2168, 2022.","mla":"Scoggins, Matthew T., et al. “How Long Do High Redshift Massive Black Hole Seeds Remain Outliers in Black Hole versus Host Galaxy Relations?” Monthly Notices of the Royal Astronomical Society, vol. 519, no. 2, Oxford University Press, 2022, pp. 2155–68, doi:10.1093/mnras/stac3715.","short":"M.T. Scoggins, Z. Haiman, J.H. Wise, Monthly Notices of the Royal Astronomical Society 519 (2022) 2155–2168.","chicago":"Scoggins, Matthew T, Zoltán Haiman, and John H Wise. “How Long Do High Redshift Massive Black Hole Seeds Remain Outliers in Black Hole versus Host Galaxy Relations?” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2022. https://doi.org/10.1093/mnras/stac3715.","ista":"Scoggins MT, Haiman Z, Wise JH. 2022. How long do high redshift massive black hole seeds remain outliers in black hole versus host galaxy relations? Monthly Notices of the Royal Astronomical Society. 519(2), 2155–2168."},"publication":"Monthly Notices of the Royal Astronomical Society","type":"journal_article","abstract":[{"text":"The existence of 109 M⊙ supermassive black holes (SMBHs) within the first billion years of the Universe remains a puzzle in our conventional understanding of black hole formation and growth. Several suggested formation pathways for these SMBHs lead to a heavy seed, with an initial black hole mass of 104–106 M⊙. This can lead to an overly massive BH galaxy (OMBG), whose nuclear black hole’s mass is comparable to or even greater than the surrounding stellar mass: the black hole to stellar mass ratio is Mbh/M* ≫ 10−3, well in excess of the typical values at lower redshift. We investigate how long these newborn BHs remain outliers in the Mbh − M* relation, by exploring the subsequent evolution of two OMBGs previously identified in the Renaissance simulations. We find that both OMBGs have Mbh/M* > 1 during their entire life, from their birth at z ≈ 15 until they merge with much more massive haloes at z ≈ 8. We find that the OMBGs are spatially resolvable from their more massive, 1011 M⊙, neighbouring haloes until their mergers are complete at z ≈ 8. This affords a window for future observations with JWST and sensitive X-ray telescopes to diagnose the heavy-seed scenario, by detecting similar OMBGs and establishing their uniquely high black hole-to-stellar mass ratio.","lang":"eng"}],"day":"20","date_created":"2024-09-05T12:14:22Z","volume":519,"title":"How long do high redshift massive black hole seeds remain outliers in black hole versus host galaxy relations?","main_file_link":[{"url":"https://doi.org/10.1093/mnras/stac3715","open_access":"1"}],"language":[{"iso":"eng"}],"scopus_import":"1","extern":"1"}]