[{"corr_author":"1","status":"public","ec_funded":1,"arxiv":1,"alternative_title":["Technical Tracks"],"citation":{"ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:3787-3795.","ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.","apa":"Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2021). Scalable verification of quantized neural networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.","ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795.","chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:3787–95. AAAI Press, 2021.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.","mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95."},"date_published":"2021-05-28T00:00:00Z","intvolume":"        35","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"AAAI Press","file_date_updated":"2022-01-26T07:41:16Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"month":"05","_id":"10665","oa_version":"Published Version","volume":35,"date_created":"2022-01-25T15:15:02Z","date_updated":"2026-04-07T14:21:58Z","quality_controlled":"1","scopus_import":"1","project":[{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"},{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"related_material":{"record":[{"status":"public","id":"11362","relation":"dissertation_contains"}]},"conference":{"location":"Virtual","name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","start_date":"2021-02-02"},"has_accepted_license":"1","type":"conference","year":"2021","external_id":{"arxiv":["2012.08185"]},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-57735-866-4"],"issn":["2159-5399"],"eissn":["2374-3468"]},"file":[{"checksum":"2bc8155b2526a70fba5b7301bc89dbd1","relation":"main_file","file_id":"10684","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","access_level":"open_access","content_type":"application/pdf","date_updated":"2022-01-26T07:41:16Z","date_created":"2022-01-26T07:41:16Z","file_size":137235,"success":1,"creator":"mlechner"}],"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","publication_status":"published","page":"3787-3795","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","abstract":[{"lang":"eng","text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches."}],"title":"Scalable verification of quantized neural networks","issue":"5A","author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias"},{"full_name":"Zikelic, Dorde","first_name":"Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic"}],"ddc":["000"],"day":"28","oa":1,"article_processing_charge":"No"},{"author":[{"last_name":"Babaiee","first_name":"Zahra","full_name":"Babaiee, Zahra"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"ddc":["000"],"day":"01","oa":1,"article_processing_charge":"No","publication_status":"published","page":"478-489","acknowledgement":"Z.B. is supported by the Doctoral College Resilient Embedded Systems, which is run jointly by the TU Wien’s Faculty of Informatics and the UAS Technikum Wien. R.G. is partially supported by the Horizon 2020 Era-Permed project Persorad, and ECSEL Project grant no. 783163 (iDev40). R.H and D.R were partially supported by Boeing and MIT. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","abstract":[{"text":"Robustness to variations in lighting conditions is a key objective for any deep vision system. To this end, our paper extends the receptive field of convolutional neural networks with two residual components, ubiquitous in the visual processing system of vertebrates: On-center and off-center pathways, with an excitatory center and inhibitory surround; OOCS for short. The On-center pathway is excited by the presence of a light stimulus in its center, but not in its surround, whereas the Off-center pathway is excited by the absence of a light stimulus in its center, but not in its surround. We design OOCS pathways via a difference of Gaussians, with their variance computed analytically from the size of the receptive fields. OOCS pathways complement each other in their response to light stimuli, ensuring this way a strong edge-detection capability, and as a result an accurate and robust inference under challenging lighting conditions. We provide extensive empirical evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness from the novel edge representation, compared to other baselines.","lang":"eng"}],"title":"On-off center-surround receptive fields for accurate and robust image classification","publication_identifier":{"issn":["2640-3498"]},"file":[{"success":1,"creator":"mlechner","file_size":4246561,"date_created":"2022-01-26T07:38:32Z","date_updated":"2022-01-26T07:38:32Z","access_level":"open_access","content_type":"application/pdf","file_name":"babaiee21a.pdf","relation":"main_file","file_id":"10681","checksum":"d30eae62561bb517d9f978437d7677db"}],"publication":"Proceedings of the 38th International Conference on Machine Learning","year":"2021","external_id":{"arxiv":["2106.07091"]},"language":[{"iso":"eng"}],"conference":{"start_date":"2021-07-18","location":"Virtual","name":"ML: Machine Learning","end_date":"2021-07-24"},"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"has_accepted_license":"1","type":"conference","main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v139/babaiee21a"}],"month":"07","_id":"10668","oa_version":"Published Version","date_updated":"2025-05-19T11:28:08Z","quality_controlled":"1","volume":139,"date_created":"2022-01-25T15:46:33Z","project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"publisher":"ML Research Press","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","file_date_updated":"2022-01-26T07:38:32Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"status":"public","arxiv":1,"alternative_title":["PMLR"],"citation":{"ista":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. 2021. On-off center-surround receptive fields for accurate and robust image classification. Proceedings of the 38th International Conference on Machine Learning. ML: Machine Learning, PMLR, vol. 139, 478–489.","short":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, R. Grosu, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 478–489.","chicago":"Babaiee, Zahra, Ramin Hasani, Mathias Lechner, Daniela Rus, and Radu Grosu. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” In <i>Proceedings of the 38th International Conference on Machine Learning</i>, 139:478–89. ML Research Press, 2021.","mla":"Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” <i>Proceedings of the 38th International Conference on Machine Learning</i>, vol. 139, ML Research Press, 2021, pp. 478–89.","ama":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. On-off center-surround receptive fields for accurate and robust image classification. In: <i>Proceedings of the 38th International Conference on Machine Learning</i>. Vol 139. ML Research Press; 2021:478-489.","ieee":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, and R. Grosu, “On-off center-surround receptive fields for accurate and robust image classification,” in <i>Proceedings of the 38th International Conference on Machine Learning</i>, Virtual, 2021, vol. 139, pp. 478–489.","apa":"Babaiee, Z., Hasani, R., Lechner, M., Rus, D., &#38; Grosu, R. (2021). On-off center-surround receptive fields for accurate and robust image classification. In <i>Proceedings of the 38th International Conference on Machine Learning</i> (Vol. 139, pp. 478–489). Virtual: ML Research Press."},"date_published":"2021-07-01T00:00:00Z","intvolume":"       139","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"oa":1,"article_processing_charge":"No","issue":"13","ddc":["000"],"day":"28","author":[{"first_name":"Sophie","full_name":"Grunbacher, Sophie","last_name":"Grunbacher"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias"},{"full_name":"Cyranka, Jacek","first_name":"Jacek","last_name":"Cyranka"},{"last_name":"Smolka","full_name":"Smolka, Scott A","first_name":"Scott A"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"abstract":[{"text":"We show that Neural ODEs, an emerging class of timecontinuous neural networks, can be verified by solving a set of global-optimization problems. For this purpose, we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based technique for constructing a tight Reachtube (an over-approximation of the set of reachable states\r\nover a given time-horizon), and provide stochastic guarantees in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids the infamous wrapping effect (accumulation of over-approximation errors) by performing local optimization steps to expand safe regions instead of repeatedly forward-propagating them as is done by deterministic reachability methods. To enable fast local optimizations, we introduce a novel forward-mode adjoint sensitivity method to compute gradients without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic convergence rates for SLR.","lang":"eng"}],"title":"On the verification of neural ODEs with stochastic guarantees","page":"11525-11535","publication_status":"published","acknowledgement":"The authors would like to thank the reviewers for their insightful comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832.\r\n","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","publication_identifier":{"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"],"issn":["2159-5399"]},"file":[{"creator":"mlechner","success":1,"date_updated":"2022-01-26T07:38:08Z","file_size":286906,"date_created":"2022-01-26T07:38:08Z","access_level":"open_access","content_type":"application/pdf","file_name":"17372-Article Text-20866-1-2-20210518.pdf","relation":"main_file","file_id":"10680","checksum":"468d07041e282a1d46ffdae92f709630"}],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2012.08863"]},"year":"2021","has_accepted_license":"1","conference":{"start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence","location":"Virtual","end_date":"2021-02-09"},"type":"conference","date_created":"2022-01-25T15:47:20Z","date_updated":"2025-04-15T06:25:56Z","quality_controlled":"1","volume":35,"_id":"10669","oa_version":"Published Version","month":"05","project":[{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"file_date_updated":"2022-01-26T07:38:08Z","publisher":"AAAI Press","citation":{"ista":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On the verification of neural ODEs with stochastic guarantees. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535.","short":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 11525–11535.","chicago":"Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic Guarantees.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:11525–35. AAAI Press, 2021.","mla":"Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic Guarantees.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35.","ama":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification of neural ODEs with stochastic guarantees. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:11525-11535.","ieee":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu, “On the verification of neural ODEs with stochastic guarantees,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 13, pp. 11525–11535.","apa":"Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &#38; Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 11525–11535). Virtual: AAAI Press."},"date_published":"2021-05-28T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        35","corr_author":"1","status":"public","alternative_title":["Technical Tracks"],"arxiv":1},{"arxiv":1,"alternative_title":["Technical Tracks"],"status":"public","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        35","citation":{"ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 7657–7666.","mla":"Hasani, Ramin, et al. “Liquid Time-Constant Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 9, AAAI Press, 2021, pp. 7657–66.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “Liquid Time-Constant Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:7657–66. AAAI Press, 2021.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:7657-7666.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., &#38; Grosu, R. (2021). Liquid time-constant networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 7657–7666). Virtual: AAAI Press.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 9, pp. 7657–7666."},"date_published":"2021-05-28T00:00:00Z","publisher":"AAAI Press","file_date_updated":"2022-01-26T07:36:03Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936"}],"project":[{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"_id":"10671","oa_version":"Published Version","month":"05","volume":35,"date_updated":"2025-04-15T06:25:56Z","quality_controlled":"1","date_created":"2022-01-25T15:48:36Z","type":"conference","conference":{"start_date":"2021-02-02","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence","location":"Virtual"},"has_accepted_license":"1","year":"2021","external_id":{"arxiv":["2006.04439"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","content_type":"application/pdf","success":1,"creator":"mlechner","file_size":4302669,"date_created":"2022-01-26T07:36:03Z","date_updated":"2022-01-26T07:36:03Z","checksum":"0f06995fba06dbcfa7ed965fc66027ff","file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","relation":"main_file","file_id":"10678"}],"publication_identifier":{"eissn":["2374-3468"],"issn":["2159-5399"],"isbn":["978-1-57735-866-4"]},"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","acknowledgement":"R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40). M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. This research work is partially drawn from the PhD dissertation of R.H.","publication_status":"published","page":"7657-7666","title":"Liquid time-constant networks","abstract":[{"lang":"eng","text":"We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system’s dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems modulated via nonlinear interlinked gates. The resulting models represent dynamical systems with varying (i.e., liquid) time-constants coupled to their hidden state, with outputs being computed by numerical differential equation solvers. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations, and give rise to improved performance on time-series prediction tasks. To demonstrate these properties, we first take a theoretical approach to find bounds over their dynamics, and compute their expressive power by the trajectory length measure in a latent trajectory space. We then conduct a series of time-series prediction experiments to manifest the approximation capability of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs."}],"author":[{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"day":"28","ddc":["000"],"issue":"9","article_processing_charge":"No","oa":1},{"language":[{"iso":"eng"}],"year":"2021","publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","editor":[{"last_name":"Ruzica","full_name":"Ruzica, Piskac","first_name":"Piskac"},{"last_name":"Whalen","full_name":"Whalen, Michael W.","first_name":"Michael W."}],"publication_identifier":{"isbn":["978-3-85448-046-4"]},"file":[{"creator":"cchlebak","success":1,"date_created":"2022-01-26T08:04:29Z","date_updated":"2022-01-26T08:04:29Z","file_size":390555,"access_level":"open_access","content_type":"application/pdf","file_name":"2021_FCAD2021_Kragl.pdf","relation":"main_file","file_id":"10689","checksum":"35438ac9f9750340b7f8ae4ae3220d9f"}],"abstract":[{"text":"Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement,\r\nwhich views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier.","lang":"eng"}],"title":"The Civl verifier","publication_status":"published","page":"143–152","acknowledgement":"This research was performed while Bernhard Kragl was at IST Austria, supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","oa":1,"article_processing_charge":"No","author":[{"full_name":"Kragl, Bernhard","first_name":"Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"}],"ddc":["000"],"day":"01","citation":{"mla":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>.","short":"B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2021, pp. 143–152.","chicago":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>.","ista":"Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.","apa":"Kragl, B., &#38; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &#38; M. W. Whalen (Eds.), <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i> (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>","ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, Virtual, 2021, vol. 2, pp. 143–152.","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>. Vol 2. TU Wien Academic Press; 2021:143–152. doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>"},"date_published":"2021-10-01T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":"         2","corr_author":"1","status":"public","alternative_title":["Conference Series"],"file_date_updated":"2022-01-26T08:04:29Z","department":[{"_id":"ToHe"}],"publisher":"TU Wien Academic Press","month":"10","_id":"10688","oa_version":"Published Version","quality_controlled":"1","date_updated":"2025-04-15T06:25:56Z","volume":2,"date_created":"2022-01-26T08:01:30Z","scopus_import":"1","project":[{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"doi":"10.34727/2021/isbn.978-3-85448-046-4_23","conference":{"start_date":"2021-10-20","location":"Virtual","name":"FMCAD: Formal Methods in Computer-Aided Design","end_date":"2021-10-22"},"has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"type":"conference"},{"publication":"APS March Meeting 2021","publisher":"American Physical Society","publication_identifier":{"issn":["0003-0503"]},"intvolume":"        66","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"citation":{"ama":"Polshyn H, Zhu J, Kumar M, et al. Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order. In: <i>APS March Meeting 2021</i>. Vol 66. American Physical Society; 2021.","ieee":"H. Polshyn <i>et al.</i>, “Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order,” in <i>APS March Meeting 2021</i>, Virtual, 2021, vol. 66, no. 1.","apa":"Polshyn, H., Zhu, J., Kumar, M., Zhang, Y., Yang, F., Tschirhart, C., … Young, A. (2021). Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order. In <i>APS March Meeting 2021</i> (Vol. 66). Virtual: American Physical Society.","ista":"Polshyn H, Zhu J, Kumar M, Zhang Y, Yang F, Tschirhart C, Serlin M, Watanabe K, Tanaguchi T, MacDonald A, Young A. 2021. Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order. APS March Meeting 2021. APS: American Physical Society, Bulletin of the American Physical Society, vol. 66, E42.00010.","chicago":"Polshyn, Hryhoriy, Jihang Zhu, Manish Kumar, Yuxuan Zhang, Fangyuan Yang, Charles Tschirhart, Marec Serlin, et al. “Orbital Chern Insulator States in Twisted Monolayer-Bilayer Graphene and Electrical Switching of Topological and Magnetic Order.” In <i>APS March Meeting 2021</i>, Vol. 66. American Physical Society, 2021.","short":"H. Polshyn, J. Zhu, M. Kumar, Y. Zhang, F. Yang, C. Tschirhart, M. Serlin, K. Watanabe, T. Tanaguchi, A. MacDonald, A. Young, in:, APS March Meeting 2021, American Physical Society, 2021.","mla":"Polshyn, Hryhoriy, et al. “Orbital Chern Insulator States in Twisted Monolayer-Bilayer Graphene and Electrical Switching of Topological and Magnetic Order.” <i>APS March Meeting 2021</i>, vol. 66, no. 1, E42.00010, American Physical Society, 2021."},"date_published":"2021-03-01T00:00:00Z","year":"2021","article_number":"E42.00010","alternative_title":["Bulletin of the American Physical Society"],"status":"public","type":"conference","article_processing_charge":"No","conference":{"start_date":"2021-03-15","location":"Virtual","name":"APS: American Physical Society","end_date":"2021-03-19"},"oa":1,"author":[{"full_name":"Polshyn, Hryhoriy","first_name":"Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","last_name":"Polshyn","orcid":"0000-0001-8223-8896"},{"full_name":"Zhu, Jihang","first_name":"Jihang","last_name":"Zhu"},{"first_name":"Manish","full_name":"Kumar, Manish","last_name":"Kumar"},{"full_name":"Zhang, Yuxuan","first_name":"Yuxuan","last_name":"Zhang"},{"last_name":"Yang","first_name":"Fangyuan","full_name":"Yang, Fangyuan"},{"last_name":"Tschirhart","full_name":"Tschirhart, Charles","first_name":"Charles"},{"first_name":"Marec","full_name":"Serlin, Marec","last_name":"Serlin"},{"full_name":"Watanabe, Kenji","first_name":"Kenji","last_name":"Watanabe"},{"last_name":"Tanaguchi","first_name":"Takashi","full_name":"Tanaguchi, Takashi"},{"last_name":"MacDonald","first_name":"Allan","full_name":"MacDonald, Allan"},{"last_name":"Young","full_name":"Young, Andrea","first_name":"Andrea"}],"day":"01","issue":"1","extern":"1","title":"Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order","_id":"10692","month":"03","oa_version":"Published Version","date_created":"2022-01-27T09:49:48Z","date_updated":"2022-01-27T10:46:23Z","abstract":[{"text":"We experimentally investigate narrow and topologically nontrivial moiré minibands hosted by van der Waals heterostructures consisting of a graphene monolayer rotationally faulted with respect to a Bernal-stacked bilayer. At fillings ν= 1 and 3 electrons per moiré unit cell within these bands, we observe quantized anomalous Hall effects with Rxy≈h/2e2, indicative of spontaneous polarization of the system into a single valley-projected band with Chern number C= 2. Remarkably, we also observe the evidence of symmetry broken Chern insulator states at ν= 1.5 and 3.5. At ν= 3 we find that the sign of the quantum anomalous Hall effect can be reversed via field-effect control of the chemical potential. This curious effect arises from the magnetization contribution due to topological edge states, which drive a reversal of the total magnetization and thus a switch of the favored magnetic state. Remarkably, we find that this switch is hysteretic, which we use to demonstrate non-volatile electric-field-induced reversal of the magnetic state. Voltage control of magnetic states can be used to electrically pattern nonvolatile magnetic domain structures hosting chiral edge states, with applications ranging from reconfigurable microwave circuit elements to ultra-low-power magnetic memory.","lang":"eng"}],"quality_controlled":"1","volume":66,"main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR21/Session/E42.10"}]},{"year":"2021","external_id":{"arxiv":["2005.06636"]},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-61197-646-5"]},"publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","editor":[{"last_name":"Marx","first_name":"Dániel","full_name":"Marx, Dániel"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publication_status":"published","page":"617-636","title":"Infinite-duration all-pay bidding games","abstract":[{"lang":"eng","text":"In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding."}],"author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy"},{"first_name":"Ismael R","full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker"},{"last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","first_name":"Dorde"}],"day":"01","article_processing_charge":"No","oa":1,"arxiv":1,"status":"public","corr_author":"1","ec_funded":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>","ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:617-636. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>.","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>.","ista":"Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636."},"date_published":"2021-01-01T00:00:00Z","publisher":"Society for Industrial and Applied Mathematics","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"doi":"10.1137/1.9781611976465.38","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.06636"}],"scopus_import":"1","project":[{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"},{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"month":"01","_id":"10694","oa_version":"Preprint","date_updated":"2025-04-15T06:26:15Z","quality_controlled":"1","date_created":"2022-01-27T12:11:23Z","type":"conference","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Virtual","end_date":"2021-01-13","start_date":"2021-01-10"}},{"department":[{"_id":"TiBr"}],"publisher":"Cambridge University Press","citation":{"ista":"Autissier P, Bonolis D, Lamzouri Y. 2021. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. Compositio Mathematica. 157(7), 1610–1651.","mla":"Autissier, Pascal, et al. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>, vol. 157, no. 7, Cambridge University Press, 2021, pp. 1610–51, doi:<a href=\"https://doi.org/10.1112/s0010437x21007351\">10.1112/s0010437x21007351</a>.","chicago":"Autissier, Pascal, Dante Bonolis, and Youness Lamzouri. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>.","short":"P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021) 1610–1651.","ama":"Autissier P, Bonolis D, Lamzouri Y. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. <i>Compositio Mathematica</i>. 2021;157(7):1610-1651. doi:<a href=\"https://doi.org/10.1112/s0010437x21007351\">10.1112/s0010437x21007351</a>","apa":"Autissier, P., Bonolis, D., &#38; Lamzouri, Y. (2021). The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>","ieee":"P. Autissier, D. Bonolis, and Y. Lamzouri, “The distribution of the maximum of partial sums of Kloosterman sums and other trace functions,” <i>Compositio Mathematica</i>, vol. 157, no. 7. Cambridge University Press, pp. 1610–1651, 2021."},"date_published":"2021-06-28T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":"       157","corr_author":"1","status":"public","arxiv":1,"type":"journal_article","keyword":["Algebra and Number Theory"],"date_updated":"2024-10-21T06:02:06Z","volume":157,"quality_controlled":"1","date_created":"2022-02-01T08:10:43Z","month":"06","_id":"10711","oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1909.03266","open_access":"1"}],"doi":"10.1112/s0010437x21007351","publication":"Compositio Mathematica","publication_identifier":{"issn":["0010-437X"],"eissn":["1570-5846"]},"isi":1,"language":[{"iso":"eng"}],"external_id":{"isi":["000667289300001"],"arxiv":["1909.03266"]},"article_type":"original","year":"2021","oa":1,"article_processing_charge":"No","issue":"7","day":"28","author":[{"full_name":"Autissier, Pascal","first_name":"Pascal","last_name":"Autissier"},{"first_name":"Dante","full_name":"Bonolis, Dante","last_name":"Bonolis","id":"6A459894-5FDD-11E9-AF35-BB24E6697425"},{"last_name":"Lamzouri","first_name":"Youness","full_name":"Lamzouri, Youness"}],"abstract":[{"text":"In this paper, we investigate the distribution of the maximum of partial sums of families of  m -periodic complex-valued functions satisfying certain conditions. We obtain precise uniform estimates for the distribution function of this maximum in a near-optimal range. Our results apply to partial sums of Kloosterman sums and other families of  ℓ -adic trace functions, and are as strong as those obtained by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular, we improve on the recent work of the third author for Birch sums. However, unlike character sums, we are able to construct families of  m -periodic complex-valued functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality is sharp.","lang":"eng"}],"title":"The distribution of the maximum of partial sums of Kloosterman sums and other trace functions","page":"1610-1651","publication_status":"published","acknowledgement":"We would like to thank the anonymous referees for carefully reading the paper and for their remarks and suggestions."},{"project":[{"call_identifier":"H2020","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems"}],"scopus_import":"1","volume":14,"date_created":"2022-02-06T23:01:33Z","date_updated":"2025-04-14T07:26:53Z","quality_controlled":"1","month":"11","_id":"10738","oa_version":"Preprint","doi":"10.2140/APDE.2021.14.2079","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.12532"}],"type":"journal_article","intvolume":"        14","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Leopold, Nikolai K., et al. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.” <i>Analysis and PDE</i>, vol. 14, no. 7, Mathematical Sciences Publishers, 2021, pp. 2079–100, doi:<a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">10.2140/APDE.2021.14.2079</a>.","chicago":"Leopold, Nikolai K, Simone Anna Elvira Rademacher, Benjamin Schlein, and Robert Seiringer. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.” <i>Analysis and PDE</i>. Mathematical Sciences Publishers, 2021. <a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">https://doi.org/10.2140/APDE.2021.14.2079</a>.","short":"N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE 14 (2021) 2079–2100.","ista":"Leopold NK, Rademacher SAE, Schlein B, Seiringer R. 2021.  The Landau–Pekar equations: Adiabatic theorem and accuracy. Analysis and PDE. 14(7), 2079–2100.","apa":"Leopold, N. K., Rademacher, S. A. E., Schlein, B., &#38; Seiringer, R. (2021).  The Landau–Pekar equations: Adiabatic theorem and accuracy. <i>Analysis and PDE</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">https://doi.org/10.2140/APDE.2021.14.2079</a>","ieee":"N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “ The Landau–Pekar equations: Adiabatic theorem and accuracy,” <i>Analysis and PDE</i>, vol. 14, no. 7. Mathematical Sciences Publishers, pp. 2079–2100, 2021.","ama":"Leopold NK, Rademacher SAE, Schlein B, Seiringer R.  The Landau–Pekar equations: Adiabatic theorem and accuracy. <i>Analysis and PDE</i>. 2021;14(7):2079-2100. doi:<a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">10.2140/APDE.2021.14.2079</a>"},"date_published":"2021-11-10T00:00:00Z","arxiv":1,"ec_funded":1,"status":"public","corr_author":"1","department":[{"_id":"RoSe"}],"publisher":"Mathematical Sciences Publishers","title":" The Landau–Pekar equations: Adiabatic theorem and accuracy","abstract":[{"text":"We prove an adiabatic theorem for the Landau–Pekar equations. This allows us to derive new results on the accuracy of their use as effective equations for the time evolution generated by the Fröhlich Hamiltonian with large coupling constant α. In particular, we show that the time evolution of Pekar product states with coherent phonon field and the electron being trapped by the phonons is well approximated by the Landau–Pekar equations until times short compared to α2.","lang":"eng"}],"acknowledgement":"N. L. and R. S. gratefully acknowledge financial support by the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (grant\r\nagreement No 694227). B. S. acknowledges support from the Swiss National Science Foundation (grant 200020_172623) and from the NCCR SwissMAP. N. L. would like to thank\r\nAndreas Deuchert and David Mitrouskas for interesting discussions. B. S. and R. S. would\r\nlike to thank Rupert Frank for stimulating discussions about the time-evolution of a polaron.\r\n","page":"2079-2100","publication_status":"published","article_processing_charge":"No","oa":1,"day":"10","author":[{"orcid":"0000-0002-0495-6822","last_name":"Leopold","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","full_name":"Leopold, Nikolai K","first_name":"Nikolai K"},{"full_name":"Rademacher, Simone Anna Elvira","first_name":"Simone Anna Elvira","last_name":"Rademacher","id":"856966FE-A408-11E9-977E-802DE6697425","orcid":"0000-0001-5059-4466"},{"last_name":"Schlein","full_name":"Schlein, Benjamin","first_name":"Benjamin"},{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","full_name":"Seiringer, Robert"}],"issue":"7","language":[{"iso":"eng"}],"external_id":{"arxiv":["1904.12532"],"isi":["000733976600004"]},"article_type":"original","year":"2021","publication":"Analysis and PDE","isi":1,"publication_identifier":{"eissn":["1948-206X"],"issn":["2157-5045"]}},{"year":"2021","language":[{"iso":"eng"}],"external_id":{"arxiv":["2105.15193"]},"publication":"arXiv","acknowledgement":"We acknowledge fruitful discussions with Giacomo Bighin, Giammarco Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy of Sciences and has received funding from the EU Horizon 2020 programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences, FOM and STW.","page":"2105.15193","publication_status":"draft","title":"Artificial neural network states for non-additive systems","abstract":[{"text":"Methods inspired from machine learning have recently attracted great interest in the computational study of quantum many-particle systems. So far, however, it has proven challenging to deal with microscopic models in which the total number of particles is not conserved. To address this issue, we propose a new variant of neural network states, which we term neural coherent states. Taking the Fröhlich impurity model as a case study, we show that neural coherent states can learn the ground state of non-additive systems very well. In particular, we observe substantial improvement over the standard coherent state estimates in the most challenging intermediate coupling regime. Our approach is generic and does not assume specific details of the system, suggesting wide applications.","lang":"eng"}],"day":"31","author":[{"id":"48C55298-F248-11E8-B48F-1D18A9856A87","last_name":"Rzadkowski","orcid":"0000-0002-1106-4419","full_name":"Rzadkowski, Wojciech","first_name":"Wojciech"},{"first_name":"Mikhail","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko"},{"full_name":"Mentink, Johan H.","first_name":"Johan H.","last_name":"Mentink"}],"article_processing_charge":"No","oa":1,"arxiv":1,"ec_funded":1,"status":"public","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2021-05-31T00:00:00Z","citation":{"ieee":"W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network states for non-additive systems,” <i>arXiv</i>. .","apa":"Rzadkowski, W., Lemeshko, M., &#38; Mentink, J. H. (n.d.). Artificial neural network states for non-additive systems. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>","ama":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>","chicago":"Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>.","short":"W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).","mla":"Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>.","ista":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>."},"department":[{"_id":"MiLe"}],"doi":"10.48550/arXiv.2105.15193","main_file_link":[{"url":"https://arxiv.org/abs/2105.15193","open_access":"1"}],"project":[{"call_identifier":"H2020","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"date_updated":"2026-04-07T14:20:12Z","date_created":"2022-02-17T11:18:57Z","oa_version":"Preprint","_id":"10762","month":"05","related_material":{"record":[{"relation":"dissertation_contains","id":"10759","status":"public"}]},"type":"preprint"},{"publication_status":"draft","main_file_link":[{"url":"https://arxiv.org/abs/2102.05996","open_access":"1"}],"doi":"10.48550/arXiv.2102.05996","oa_version":"Preprint","_id":"10803","month":"06","date_created":"2022-02-28T14:13:59Z","abstract":[{"text":"Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality.","lang":"eng"}],"date_updated":"2026-04-07T14:19:48Z","title":"Fairness through regularization for learning to rank","author":[{"orcid":"0009-0009-5204-7621","last_name":"Konstantinov","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","first_name":"Nikola H","full_name":"Konstantinov, Nikola H"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Lampert, Christoph","first_name":"Christoph"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"10799","status":"public"}]},"day":"07","oa":1,"type":"preprint","article_processing_charge":"No","corr_author":"1","status":"public","arxiv":1,"year":"2021","article_number":"2102.05996","citation":{"ista":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996.","short":"N.H. Konstantinov, C. Lampert, ArXiv (n.d.).","chicago":"Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>.","mla":"Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, 2102.05996, doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>.","ama":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>","ieee":"N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” <i>arXiv</i>. .","apa":"Konstantinov, N. H., &#38; Lampert, C. (n.d.). Fairness through regularization for learning to rank. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>"},"date_published":"2021-06-07T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2102.05996"]},"language":[{"iso":"eng"}],"publication":"arXiv","department":[{"_id":"ChLa"}]},{"ec_funded":1,"corr_author":"1","status":"public","citation":{"ista":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, Pokratath R, Llorca J, De Roo J, Ibáñez M. 2021. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. JACS Au. 1(11), 1898–1903.","mla":"Calcabrini, Mariano, et al. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>, vol. 1, no. 11, American Chemical Society, 2021, pp. 1898–903, doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>.","chicago":"Calcabrini, Mariano, Dietger Van den Eynden, Sergi Sanchez Ribot, Rohan Pokratath, Jordi Llorca, Jonathan De Roo, and Maria Ibáñez. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>.","short":"M. Calcabrini, D. Van den Eynden, S. Sanchez Ribot, R. Pokratath, J. Llorca, J. De Roo, M. Ibáñez, JACS Au 1 (2021) 1898–1903.","ama":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, et al. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. 2021;1(11):1898-1903. doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>","apa":"Calcabrini, M., Van den Eynden, D., Sanchez Ribot, S., Pokratath, R., Llorca, J., De Roo, J., &#38; Ibáñez, M. (2021). Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>","ieee":"M. Calcabrini <i>et al.</i>, “Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate,” <i>JACS Au</i>, vol. 1, no. 11. American Chemical Society, pp. 1898–1903, 2021."},"date_published":"2021-11-22T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":"         1","publisher":"American Chemical Society","department":[{"_id":"MaIb"}],"file_date_updated":"2022-03-02T15:33:18Z","doi":"10.1021/jacsau.1c00349","quality_controlled":"1","date_updated":"2026-04-07T13:26:13Z","date_created":"2022-03-02T15:24:16Z","volume":1,"oa_version":"Published Version","_id":"10806","month":"11","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"},{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"scopus_import":"1","related_material":{"link":[{"url":"https://doi.org/10.26434/chemrxiv-2021-cn2fr","relation":"earlier_version"}],"record":[{"id":"12885","relation":"dissertation_contains","status":"public"}]},"keyword":["general medicine"],"has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"type":"journal_article","article_type":"original","year":"2021","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2691-3704"],"eissn":["2691-3704"]},"file":[{"access_level":"open_access","content_type":"application/pdf","file_size":1257973,"date_updated":"2022-03-02T15:33:18Z","date_created":"2022-03-02T15:33:18Z","creator":"cchlebak","success":1,"checksum":"1c66a35369e911312a359111420318a9","relation":"main_file","file_id":"10807","file_name":"2021_JACSAu_Calcabrini.pdf"}],"publication":"JACS Au","page":"1898-1903","publication_status":"published","acknowledgement":"This work was financially supported by IST Austria and the Werner Siemens Foundation. M.C. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. The work was also financially supported by University of Basel, SNSF NCCR Molecular Systems Engineering (project number: 182895) and SNSF R’equip (project number: 189622). J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia program and MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128 projects.","abstract":[{"lang":"eng","text":"Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’ chemical reactivity and electronic structure. Surface chemistry is thus crucial to understand nanocrystal properties and functionality. Here, we investigate the synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals are capped exclusively with a fatty acid instead of oleylamine. Analysis of the reaction mixtures with nuclear magnetic resonance spectroscopy revealed several reaction byproducts and intermediates that are common to the decomposition of Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive surface chemistry."}],"title":"Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate","issue":"11","ddc":["540"],"day":"22","author":[{"full_name":"Calcabrini, Mariano","first_name":"Mariano","orcid":"0000-0003-4566-5877","last_name":"Calcabrini","id":"45D7531A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Van den Eynden","full_name":"Van den Eynden, Dietger","first_name":"Dietger"},{"id":"ddae5a59-f6e0-11ea-865d-d9dc61e77a2a","last_name":"Sanchez Ribot","first_name":"Sergi","full_name":"Sanchez Ribot, Sergi"},{"last_name":"Pokratath","full_name":"Pokratath, Rohan","first_name":"Rohan"},{"full_name":"Llorca, Jordi","first_name":"Jordi","last_name":"Llorca"},{"first_name":"Jonathan","full_name":"De Roo, Jonathan","last_name":"De Roo"},{"last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","first_name":"Maria"}],"oa":1,"article_processing_charge":"Yes (via OA deal)"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":"       371","citation":{"ama":"Liu Y, Ibáñez M. Tidying up the mess. <i>Science</i>. 2021;371(6530):678-679. doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>","apa":"Liu, Y., &#38; Ibáñez, M. (2021). Tidying up the mess. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>","ieee":"Y. Liu and M. Ibáñez, “Tidying up the mess,” <i>Science</i>, vol. 371, no. 6530. American Association for the Advancement of Science, pp. 678–679, 2021.","ista":"Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679.","mla":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>, vol. 371, no. 6530, American Association for the Advancement of Science, 2021, pp. 678–79, doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>.","short":"Y. Liu, M. Ibáñez, Science 371 (2021) 678–679.","chicago":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>. American Association for the Advancement of Science, 2021. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>."},"date_published":"2021-02-12T00:00:00Z","corr_author":"1","status":"public","department":[{"_id":"MaIb"}],"publisher":"American Association for the Advancement of Science","scopus_import":"1","quality_controlled":"1","date_updated":"2024-10-09T21:01:45Z","date_created":"2022-03-03T09:51:48Z","volume":371,"oa_version":"None","_id":"10809","month":"02","doi":"10.1126/science.abg0886","type":"journal_article","keyword":["multidisciplinary"],"language":[{"iso":"eng"}],"external_id":{"isi":["000617551600027"],"pmid":["33574201"]},"pmid":1,"article_type":"letter_note","year":"2021","publication":"Science","isi":1,"publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"title":"Tidying up the mess","abstract":[{"lang":"eng","text":"Thermoelectric materials are engines that convert heat into an electrical current. Intuitively, the efficiency of this process depends on how many electrons (charge carriers) can move and how easily they do so, how much energy those moving electrons transport, and how easily the temperature gradient is maintained. In terms of material properties, an excellent thermoelectric material requires a high electrical conductivity σ, a high Seebeck coefficient S (a measure of the induced thermoelectric voltage as a function of temperature gradient), and a low thermal conductivity κ. The challenge is that these three properties are strongly interrelated in a conflicting manner (1). On page 722 of this issue, Roychowdhury et al. (2) have found a way to partially break these ties in silver antimony telluride (AgSbTe2) with the addition of cadmium (Cd) cations, which increase the ordering in this inherently disordered thermoelectric material."}],"page":"678-679","publication_status":"published","article_processing_charge":"No","day":"12","author":[{"full_name":"Liu, Yu","first_name":"Yu","orcid":"0000-0001-7313-6740","last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","first_name":"Maria"}],"issue":"6530"},{"status":"public","article_type":"original","year":"2021","citation":{"mla":"Ren, Yingying, et al. “3D Weaving with Curved Ribbons.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, Association for Computing Machinery, 2021, pp. 1–15, doi:<a href=\"https://doi.org/10.1145/3450626.3459788\">10.1145/3450626.3459788</a>.","chicago":"Ren, Yingying, Julian Panetta, Tian Chen, Florin Isvoranu, Samuel Poincloux, Christopher Brandt, Alison Martin, and Mark Pauly. “3D Weaving with Curved Ribbons.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450626.3459788\">https://doi.org/10.1145/3450626.3459788</a>.","short":"Y. Ren, J. Panetta, T. Chen, F. Isvoranu, S. Poincloux, C. Brandt, A. Martin, M. Pauly, ACM Transactions on Graphics 40 (2021) 1–15.","ista":"Ren Y, Panetta J, Chen T, Isvoranu F, Poincloux S, Brandt C, Martin A, Pauly M. 2021. 3D weaving with curved ribbons. ACM Transactions on Graphics. 40(4), 1–15.","apa":"Ren, Y., Panetta, J., Chen, T., Isvoranu, F., Poincloux, S., Brandt, C., … Pauly, M. (2021). 3D weaving with curved ribbons. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450626.3459788\">https://doi.org/10.1145/3450626.3459788</a>","ieee":"Y. Ren <i>et al.</i>, “3D weaving with curved ribbons,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for Computing Machinery, pp. 1–15, 2021.","ama":"Ren Y, Panetta J, Chen T, et al. 3D weaving with curved ribbons. <i>ACM Transactions on Graphics</i>. 2021;40(4):1-15. doi:<a href=\"https://doi.org/10.1145/3450626.3459788\">10.1145/3450626.3459788</a>"},"date_published":"2021-08-01T00:00:00Z","language":[{"iso":"eng"}],"intvolume":"        40","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"publisher":"Association for Computing Machinery","publication":"ACM Transactions on Graphics","page":"1-15","publication_status":"published","doi":"10.1145/3450626.3459788","date_created":"2024-08-05T06:30:27Z","volume":40,"date_updated":"2024-08-12T09:38:19Z","quality_controlled":"1","abstract":[{"text":"Basket weaving is a traditional craft for creating curved surfaces as an interwoven array of thin, flexible, and initially straight ribbons. The three-dimensional shape of a woven structure emerges through a complex interplay of the elastic bending behavior of the ribbons and the contact forces at their crossings. Curvature can be injected by carefully placing topological singularities in the otherwise regular weaving pattern. However, shape control through topology is highly non-trivial and inherently discrete, which severely limits the range of attainable woven geometries. Here, we demonstrate how to construct arbitrary smooth free-form surface geometries by weaving carefully optimized curved ribbons. We present an optimization-based approach to solving the inverse design problem for such woven structures. Our algorithm computes the ribbons' planar geometry such that their interwoven assembly closely approximates a given target design surface in equilibrium. We systematically validate our approach through a series of physical prototypes to show a broad range of new woven geometries that is not achievable by existing methods. We anticipate our computational approach to significantly enhance the capabilities for the design of new woven structures. Facilitated by modern digital fabrication technology, we see potential applications in material science, bio- and mechanical engineering, art, design, and architecture.","lang":"eng"}],"month":"08","_id":"17384","oa_version":"None","title":"3D weaving with curved ribbons","scopus_import":"1","extern":"1","issue":"4","day":"01","author":[{"first_name":"Yingying","full_name":"Ren, Yingying","last_name":"Ren","id":"93d68d10-3540-11ef-a265-f748a50dba3d"},{"last_name":"Panetta","first_name":"Julian","full_name":"Panetta, Julian"},{"full_name":"Chen, Tian","first_name":"Tian","last_name":"Chen"},{"last_name":"Isvoranu","full_name":"Isvoranu, Florin","first_name":"Florin"},{"last_name":"Poincloux","full_name":"Poincloux, Samuel","first_name":"Samuel"},{"last_name":"Brandt","full_name":"Brandt, Christopher","first_name":"Christopher"},{"first_name":"Alison","full_name":"Martin, Alison","last_name":"Martin"},{"full_name":"Pauly, Mark","first_name":"Mark","last_name":"Pauly"}],"article_processing_charge":"No","type":"journal_article"},{"doi":"10.1177/0278364921992788","main_file_link":[{"url":"https://doi.org/10.1177/0278364921992788","open_access":"1"}],"scopus_import":"1","date_created":"2024-08-12T10:01:27Z","volume":40,"quality_controlled":"1","date_updated":"2024-08-12T10:15:14Z","oa_version":"Published Version","_id":"17422","month":"09","type":"journal_article","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        40","date_published":"2021-09-01T00:00:00Z","citation":{"ama":"Nilles AQ, Ren Y, Becerra I, LaValle SM. A visibility-based approach to computing non-deterministic bouncing strategies. <i>The International Journal of Robotics Research</i>. 2021;40(10-11):1196-1211. doi:<a href=\"https://doi.org/10.1177/0278364921992788\">10.1177/0278364921992788</a>","ieee":"A. Q. Nilles, Y. Ren, I. Becerra, and S. M. LaValle, “A visibility-based approach to computing non-deterministic bouncing strategies,” <i>The International Journal of Robotics Research</i>, vol. 40, no. 10–11. SAGE Publications, pp. 1196–1211, 2021.","apa":"Nilles, A. Q., Ren, Y., Becerra, I., &#38; LaValle, S. M. (2021). A visibility-based approach to computing non-deterministic bouncing strategies. <i>The International Journal of Robotics Research</i>. SAGE Publications. <a href=\"https://doi.org/10.1177/0278364921992788\">https://doi.org/10.1177/0278364921992788</a>","ista":"Nilles AQ, Ren Y, Becerra I, LaValle SM. 2021. A visibility-based approach to computing non-deterministic bouncing strategies. The International Journal of Robotics Research. 40(10–11), 1196–1211.","chicago":"Nilles, Alexandra Q, Yingying Ren, Israel Becerra, and Steven M LaValle. “A Visibility-Based Approach to Computing Non-Deterministic Bouncing Strategies.” <i>The International Journal of Robotics Research</i>. SAGE Publications, 2021. <a href=\"https://doi.org/10.1177/0278364921992788\">https://doi.org/10.1177/0278364921992788</a>.","short":"A.Q. Nilles, Y. Ren, I. Becerra, S.M. LaValle, The International Journal of Robotics Research 40 (2021) 1196–1211.","mla":"Nilles, Alexandra Q., et al. “A Visibility-Based Approach to Computing Non-Deterministic Bouncing Strategies.” <i>The International Journal of Robotics Research</i>, vol. 40, no. 10–11, SAGE Publications, 2021, pp. 1196–211, doi:<a href=\"https://doi.org/10.1177/0278364921992788\">10.1177/0278364921992788</a>."},"publisher":"SAGE Publications","page":"1196-1211","publication_status":"published","title":"A visibility-based approach to computing non-deterministic bouncing strategies","extern":"1","abstract":[{"text":"Inspired by motion patterns of some commercially available mobile robots, we investigate the power of robots that move forward in straight lines until colliding with an environment boundary, at which point they can rotate in place and move forward again; we visualize this as the robot “bouncing” off boundaries. We define bounce rules governing how the robot should reorient after reaching a boundary, such as reorienting relative to its heading prior to collision, or relative to the normal of the boundary. We then generate plans as sequences of rules, using the bounce visibility graph generated from a polygonal environment definition, while assuming we have unavoidable non-determinism in our actuation. Our planner can be queried to determine the feasibility of tasks such as reaching goal sets and patrolling (repeatedly visiting a sequence of goals). If the task is found feasible, the planner provides a sequence of non-deterministic interaction rules, which also provide information on how precisely the robot must execute the plan to succeed. We also show how to compute stable cyclic trajectories and use these to limit uncertainty in the robot’s position. </jats:p>","lang":"eng"}],"day":"01","author":[{"first_name":"Alexandra Q","full_name":"Nilles, Alexandra Q","last_name":"Nilles"},{"first_name":"Yingying","full_name":"Ren, Yingying","id":"93d68d10-3540-11ef-a265-f748a50dba3d","last_name":"Ren"},{"last_name":"Becerra","first_name":"Israel","full_name":"Becerra, Israel"},{"full_name":"LaValle, Steven M","first_name":"Steven M","last_name":"LaValle"}],"issue":"10-11","article_processing_charge":"No","oa":1,"article_type":"original","year":"2021","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1741-3176"],"issn":["0278-3649"]},"publication":"The International Journal of Robotics Research"},{"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2021-06-18T00:00:00Z","citation":{"ista":"Sammler MJ, Lepigre R, Krebbers R, Memarian K, Dreyer D, Garg D. 2021. RefinedC: Automating the foundational verification of C code with refined ownership types. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 158–174.","mla":"Sammler, Michael Joachim, et al. “RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types.” <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2021, pp. 158–74, doi:<a href=\"https://doi.org/10.1145/3453483.3454036\">10.1145/3453483.3454036</a>.","short":"M.J. Sammler, R. Lepigre, R. Krebbers, K. Memarian, D. Dreyer, D. Garg, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 158–174.","chicago":"Sammler, Michael Joachim, Rodolphe Lepigre, Robbert Krebbers, Kayvan Memarian, Derek Dreyer, and Deepak Garg. “RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types.” In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, 158–74. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3453483.3454036\">https://doi.org/10.1145/3453483.3454036</a>.","ama":"Sammler MJ, Lepigre R, Krebbers R, Memarian K, Dreyer D, Garg D. RefinedC: Automating the foundational verification of C code with refined ownership types. In: <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2021:158-174. doi:<a href=\"https://doi.org/10.1145/3453483.3454036\">10.1145/3453483.3454036</a>","apa":"Sammler, M. J., Lepigre, R., Krebbers, R., Memarian, K., Dreyer, D., &#38; Garg, D. (2021). RefinedC: Automating the foundational verification of C code with refined ownership types. In <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i> (pp. 158–174). virtual: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3453483.3454036\">https://doi.org/10.1145/3453483.3454036</a>","ieee":"M. J. Sammler, R. Lepigre, R. Krebbers, K. Memarian, D. Dreyer, and D. Garg, “RefinedC: Automating the foundational verification of C code with refined ownership types,” in <i>Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation</i>, virtual, 2021, pp. 158–174."},"year":"2021","status":"public","publication":"Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation","publisher":"Association for Computing Machinery","title":"RefinedC: Automating the foundational verification of C code with refined ownership types","scopus_import":"1","extern":"1","date_created":"2024-09-05T08:34:50Z","abstract":[{"lang":"eng","text":"Given the central role that C continues to play in systems software, and the difficulty of writing safe and correct C code, it remains a grand challenge to develop effective formal methods for verifying C programs. In this paper, we propose a new approach to this problem: a type system we call RefinedC, which combines ownership types (for modular reasoning about shared state and concurrency) with refinement types (for encoding precise invariants on C data types and Hoare-style specifications for C functions).\r\nRefinedC is both automated (requiring minimal user intervention) and foundational (producing a proof of program correctness in Coq), while at the same time handling a range of low-level programming idioms such as pointer arithmetic. In particular, following the approach of RustBelt, the soundness of the RefinedC type system is justified semantically by interpretation into the Coq-based Iris framework for higher-order concurrent separation logic. However, the typing rules of RefinedC are also designed to be encodable in a new “separation logic programming” language we call Lithium. By restricting to a carefully chosen (yet expressive) fragment of separation logic, Lithium supports predictable, automatic, goal-directed proof search without backtracking. We demonstrate the effectiveness of RefinedC on a range of representative examples of C code."}],"date_updated":"2024-09-10T11:54:22Z","quality_controlled":"1","_id":"17505","oa_version":"Published Version","month":"06","doi":"10.1145/3453483.3454036","page":"158-174","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3453483.3454036"}],"article_processing_charge":"No","type":"conference","oa":1,"conference":{"start_date":"2021-06-20","name":"PLDI: Conference on Programming Language Design and Implementation","location":"virtual","end_date":"2021-06-25"},"day":"18","author":[{"last_name":"Sammler","id":"510d3901-2a03-11ee-914d-d9ae9011f0a7","first_name":"Michael Joachim","full_name":"Sammler, Michael Joachim"},{"last_name":"Lepigre","full_name":"Lepigre, Rodolphe","first_name":"Rodolphe"},{"full_name":"Krebbers, Robbert","first_name":"Robbert","last_name":"Krebbers"},{"last_name":"Memarian","full_name":"Memarian, Kayvan","first_name":"Kayvan"},{"full_name":"Dreyer, Derek","first_name":"Derek","last_name":"Dreyer"},{"last_name":"Garg","full_name":"Garg, Deepak","first_name":"Deepak"}]},{"alternative_title":["An ESA Voyage 2050 White Paper"],"status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"        51","date_published":"2021-05-27T00:00:00Z","citation":{"ista":"Gurvits LI, Paragi Z, Casasola V, Conway J, Davelaar J, Falcke H, Fender R, Frey S, Fromm CM, Miró CG, Garrett MA, Giroletti M, Goddi C, Gómez J-L, van der Gucht J, Guirado JC, Haiman Z, Helmich F, Humphreys E, Impellizzeri V, Kramer M, Lindqvist M, Linz H, Liuzzo E, Lobanov AP, Mizuno Y, Rezzolla L, Roelofs F, Ros E, Rygl KLJ, Savolainen T, Schuster K, Venturi T, Wiedner MC, Zensus JA. 2021. THEZA: TeraHertz exploration and zooming-in for astrophysics. Experimental Astronomy. 51(3), 559–594.","short":"L.I. Gurvits, Z. Paragi, V. Casasola, J. Conway, J. Davelaar, H. Falcke, R. Fender, S. Frey, C.M. Fromm, C.G. Miró, M.A. Garrett, M. Giroletti, C. Goddi, J.-L. Gómez, J. van der Gucht, J.C. Guirado, Z. Haiman, F. Helmich, E. Humphreys, V. Impellizzeri, M. Kramer, M. Lindqvist, H. Linz, E. Liuzzo, A.P. Lobanov, Y. Mizuno, L. Rezzolla, F. Roelofs, E. Ros, K.L.J. Rygl, T. Savolainen, K. Schuster, T. Venturi, M.C. Wiedner, J.A. Zensus, Experimental Astronomy 51 (2021) 559–594.","chicago":"Gurvits, Leonid I., Zsolt Paragi, Viviana Casasola, John Conway, Jordy Davelaar, Heino Falcke, Rob Fender, et al. “THEZA: TeraHertz Exploration and Zooming-in for Astrophysics.” <i>Experimental Astronomy</i>. Springer Science and Business Media LLC, 2021. <a href=\"https://doi.org/10.1007/s10686-021-09714-y\">https://doi.org/10.1007/s10686-021-09714-y</a>.","mla":"Gurvits, Leonid I., et al. “THEZA: TeraHertz Exploration and Zooming-in for Astrophysics.” <i>Experimental Astronomy</i>, vol. 51, no. 3, Springer Science and Business Media LLC, 2021, pp. 559–94, doi:<a href=\"https://doi.org/10.1007/s10686-021-09714-y\">10.1007/s10686-021-09714-y</a>.","ama":"Gurvits LI, Paragi Z, Casasola V, et al. THEZA: TeraHertz exploration and zooming-in for astrophysics. <i>Experimental Astronomy</i>. 2021;51(3):559-594. doi:<a href=\"https://doi.org/10.1007/s10686-021-09714-y\">10.1007/s10686-021-09714-y</a>","ieee":"L. I. Gurvits <i>et al.</i>, “THEZA: TeraHertz exploration and zooming-in for astrophysics,” <i>Experimental Astronomy</i>, vol. 51, no. 3. Springer Science and Business Media LLC, pp. 559–594, 2021.","apa":"Gurvits, L. I., Paragi, Z., Casasola, V., Conway, J., Davelaar, J., Falcke, H., … Zensus, J. A. (2021). THEZA: TeraHertz exploration and zooming-in for astrophysics. <i>Experimental Astronomy</i>. Springer Science and Business Media LLC. <a href=\"https://doi.org/10.1007/s10686-021-09714-y\">https://doi.org/10.1007/s10686-021-09714-y</a>"},"publisher":"Springer Science and Business Media LLC","doi":"10.1007/s10686-021-09714-y","main_file_link":[{"url":"https://doi.org/10.1007/s10686-021-09714-y","open_access":"1"}],"scopus_import":"1","oa_version":"Published Version","_id":"17508","month":"05","date_updated":"2024-09-10T12:15:42Z","volume":51,"quality_controlled":"1","date_created":"2024-09-05T08:46:17Z","type":"journal_article","year":"2021","article_type":"original","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0922-6435","1572-9508"]},"publication":"Experimental Astronomy","publication_status":"published","page":"559-594","extern":"1","title":"THEZA: TeraHertz exploration and zooming-in for astrophysics","abstract":[{"lang":"eng","text":"This paper presents the ESA Voyage 2050 White Paper for a concept of TeraHertz Exploration and Zooming-in for Astrophysics (THEZA). It addresses the science case and some implementation issues of a space-borne radio interferometric system for ultra-sharp imaging of celestial radio sources at the level of angular resolution down to (sub-) microarcseconds. THEZA focuses at millimetre and sub-millimetre wavelengths (frequencies above \r\n300 GHz), but allows for science operations at longer wavelengths too. The THEZA concept science rationale is focused on the physics of spacetime in the vicinity of supermassive black holes as the leading science driver. The main aim of the concept is to facilitate a major leap by providing researchers with orders of magnitude improvements in the resolution and dynamic range in direct imaging studies of the most exotic objects in the Universe, black holes. The concept will open up a sizeable range of hitherto unreachable parameters of observational astrophysics. It unifies two major lines of development of space-borne radio astronomy of the past decades: Space VLBI (Very Long Baseline Interferometry) and mm- and sub-mm astrophysical studies with “single dish” instruments. It also builds upon the recent success of the Earth-based Event Horizon Telescope (EHT) – the first-ever direct image of a shadow of the super-massive black hole in the centre of the galaxy M87. As an amalgam of these three major areas of modern observational astrophysics, THEZA aims at facilitating a breakthrough in high-resolution high image quality studies in the millimetre and sub-millimetre domain of the electromagnetic spectrum."}],"author":[{"last_name":"Gurvits","first_name":"Leonid I.","full_name":"Gurvits, Leonid I."},{"first_name":"Zsolt","full_name":"Paragi, Zsolt","last_name":"Paragi"},{"full_name":"Casasola, Viviana","first_name":"Viviana","last_name":"Casasola"},{"first_name":"John","full_name":"Conway, John","last_name":"Conway"},{"full_name":"Davelaar, Jordy","first_name":"Jordy","last_name":"Davelaar"},{"last_name":"Falcke","full_name":"Falcke, Heino","first_name":"Heino"},{"full_name":"Fender, Rob","first_name":"Rob","last_name":"Fender"},{"full_name":"Frey, Sándor","first_name":"Sándor","last_name":"Frey"},{"full_name":"Fromm, Christian M.","first_name":"Christian M.","last_name":"Fromm"},{"first_name":"Cristina García","full_name":"Miró, Cristina García","last_name":"Miró"},{"full_name":"Garrett, Michael A.","first_name":"Michael A.","last_name":"Garrett"},{"last_name":"Giroletti","first_name":"Marcello","full_name":"Giroletti, Marcello"},{"first_name":"Ciriaco","full_name":"Goddi, Ciriaco","last_name":"Goddi"},{"last_name":"Gómez","first_name":"José-Luis","full_name":"Gómez, José-Luis"},{"last_name":"van der Gucht","full_name":"van der Gucht, Jeffrey","first_name":"Jeffrey"},{"full_name":"Guirado, José Carlos","first_name":"José Carlos","last_name":"Guirado"},{"full_name":"Haiman, Zoltán","first_name":"Zoltán","last_name":"Haiman","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"},{"last_name":"Helmich","full_name":"Helmich, Frank","first_name":"Frank"},{"full_name":"Humphreys, Elizabeth","first_name":"Elizabeth","last_name":"Humphreys"},{"first_name":"Violette","full_name":"Impellizzeri, Violette","last_name":"Impellizzeri"},{"last_name":"Kramer","full_name":"Kramer, Michael","first_name":"Michael"},{"first_name":"Michael","full_name":"Lindqvist, Michael","last_name":"Lindqvist"},{"full_name":"Linz, Hendrik","first_name":"Hendrik","last_name":"Linz"},{"full_name":"Liuzzo, Elisabetta","first_name":"Elisabetta","last_name":"Liuzzo"},{"first_name":"Andrei P.","full_name":"Lobanov, Andrei P.","last_name":"Lobanov"},{"last_name":"Mizuno","first_name":"Yosuke","full_name":"Mizuno, Yosuke"},{"last_name":"Rezzolla","full_name":"Rezzolla, Luciano","first_name":"Luciano"},{"last_name":"Roelofs","full_name":"Roelofs, Freek","first_name":"Freek"},{"full_name":"Ros, Eduardo","first_name":"Eduardo","last_name":"Ros"},{"full_name":"Rygl, Kazi L.J.","first_name":"Kazi L.J.","last_name":"Rygl"},{"first_name":"Tuomas","full_name":"Savolainen, Tuomas","last_name":"Savolainen"},{"first_name":"Karl","full_name":"Schuster, Karl","last_name":"Schuster"},{"full_name":"Venturi, Tiziana","first_name":"Tiziana","last_name":"Venturi"},{"full_name":"Wiedner, Martina C.","first_name":"Martina C.","last_name":"Wiedner"},{"full_name":"Zensus, J. Anton","first_name":"J. Anton","last_name":"Zensus"}],"day":"27","issue":"3","article_processing_charge":"No","oa":1},{"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.3847/1538-4357/abd555"}],"doi":"10.3847/1538-4357/abd555","date_created":"2024-09-05T08:47:46Z","volume":908,"quality_controlled":"1","date_updated":"2024-09-10T12:36:17Z","_id":"17509","month":"02","oa_version":"Published Version","scopus_import":"1","publisher":"American Astronomical Society","status":"public","article_number":"194","citation":{"apa":"Tagawa, H., Kocsis, B., Haiman, Z., Bartos, I., Omukai, K., &#38; Samsing, J. (2021). Mass-gap mergers in active galactic nuclei. <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.3847/1538-4357/abd555\">https://doi.org/10.3847/1538-4357/abd555</a>","ieee":"H. Tagawa, B. Kocsis, Z. Haiman, I. Bartos, K. Omukai, and J. Samsing, “Mass-gap mergers in active galactic nuclei,” <i>The Astrophysical Journal</i>, vol. 908, no. 2. American Astronomical Society, 2021.","ama":"Tagawa H, Kocsis B, Haiman Z, Bartos I, Omukai K, Samsing J. Mass-gap mergers in active galactic nuclei. <i>The Astrophysical Journal</i>. 2021;908(2). doi:<a href=\"https://doi.org/10.3847/1538-4357/abd555\">10.3847/1538-4357/abd555</a>","mla":"Tagawa, Hiromichi, et al. “Mass-Gap Mergers in Active Galactic Nuclei.” <i>The Astrophysical Journal</i>, vol. 908, no. 2, 194, American Astronomical Society, 2021, doi:<a href=\"https://doi.org/10.3847/1538-4357/abd555\">10.3847/1538-4357/abd555</a>.","chicago":"Tagawa, Hiromichi, Bence Kocsis, Zoltán Haiman, Imre Bartos, Kazuyuki Omukai, and Johan Samsing. “Mass-Gap Mergers in Active Galactic Nuclei.” <i>The Astrophysical Journal</i>. American Astronomical Society, 2021. <a href=\"https://doi.org/10.3847/1538-4357/abd555\">https://doi.org/10.3847/1538-4357/abd555</a>.","short":"H. Tagawa, B. Kocsis, Z. Haiman, I. Bartos, K. Omukai, J. Samsing, The Astrophysical Journal 908 (2021).","ista":"Tagawa H, Kocsis B, Haiman Z, Bartos I, Omukai K, Samsing J. 2021. Mass-gap mergers in active galactic nuclei. The Astrophysical Journal. 908(2), 194."},"date_published":"2021-02-24T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"       908","issue":"2","day":"24","author":[{"full_name":"Tagawa, Hiromichi","first_name":"Hiromichi","last_name":"Tagawa"},{"last_name":"Kocsis","first_name":"Bence","full_name":"Kocsis, Bence"},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","last_name":"Haiman","first_name":"Zoltán","full_name":"Haiman, Zoltán"},{"last_name":"Bartos","full_name":"Bartos, Imre","first_name":"Imre"},{"last_name":"Omukai","first_name":"Kazuyuki","full_name":"Omukai, Kazuyuki"},{"last_name":"Samsing","first_name":"Johan","full_name":"Samsing, Johan"}],"oa":1,"article_processing_charge":"No","publication_status":"published","abstract":[{"lang":"eng","text":"The recently discovered gravitational wave sources GW190521 and GW190814 have shown evidence of BH mergers with masses and spins outside of the range expected from isolated stellar evolution. These merging objects could have undergone previous mergers. Such hierarchical mergers are predicted to be frequent in active galactic nuclei (AGNs) disks, where binaries form and evolve efficiently by dynamical interactions and gaseous dissipation. Here we compare the properties of these observed events to the theoretical models of mergers in AGN disks, which are obtained by performing one-dimensional N-body simulations combined with semi-analytical prescriptions. The high BH masses in GW190521 are consistent with mergers of high-generation (high-g) BHs where the initial progenitor stars had high metallicity, 2g BHs if the original progenitors were metal-poor, or 1g BHs that had gained mass via super-Eddington accretion. Other measured properties related to spin parameters in GW190521 are also consistent with mergers in AGN disks. Furthermore, mergers in the lower mass gap or those with low mass ratio as found in GW190814 and GW190412 are also reproduced by mergers of 2g–1g or 1g–1g objects with significant accretion in AGN disks. Finally, due to gas accretion, the massive neutron star merger reported in GW190425 can be produced in an AGN disk."}],"title":"Mass-gap mergers in active galactic nuclei","extern":"1","publication_identifier":{"issn":["0004-637X","1538-4357"]},"publication":"The Astrophysical Journal","article_type":"original","year":"2021","language":[{"iso":"eng"}]},{"date_updated":"2024-09-10T13:47:31Z","date_created":"2024-09-05T08:55:06Z","volume":915,"quality_controlled":"1","_id":"17515","month":"06","oa_version":"Published Version","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.3847/1538-4357/abfdb4","open_access":"1"}],"doi":"10.3847/1538-4357/abfdb4","type":"journal_article","citation":{"ama":"Perna R, Tagawa H, Haiman Z, Bartos I. Accretion-induced collapse of neutron stars in the disks of active galactic nuclei. <i>The Astrophysical Journal</i>. 2021;915(1). doi:<a href=\"https://doi.org/10.3847/1538-4357/abfdb4\">10.3847/1538-4357/abfdb4</a>","ieee":"R. Perna, H. Tagawa, Z. Haiman, and I. Bartos, “Accretion-induced collapse of neutron stars in the disks of active galactic nuclei,” <i>The Astrophysical Journal</i>, vol. 915, no. 1. American Astronomical Society, 2021.","apa":"Perna, R., Tagawa, H., Haiman, Z., &#38; Bartos, I. (2021). Accretion-induced collapse of neutron stars in the disks of active galactic nuclei. <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.3847/1538-4357/abfdb4\">https://doi.org/10.3847/1538-4357/abfdb4</a>","ista":"Perna R, Tagawa H, Haiman Z, Bartos I. 2021. Accretion-induced collapse of neutron stars in the disks of active galactic nuclei. The Astrophysical Journal. 915(1), 10.","short":"R. Perna, H. Tagawa, Z. Haiman, I. Bartos, The Astrophysical Journal 915 (2021).","chicago":"Perna, Rosalba, Hiromichi Tagawa, Zoltán Haiman, and Imre Bartos. “Accretion-Induced Collapse of Neutron Stars in the Disks of Active Galactic Nuclei.” <i>The Astrophysical Journal</i>. American Astronomical Society, 2021. <a href=\"https://doi.org/10.3847/1538-4357/abfdb4\">https://doi.org/10.3847/1538-4357/abfdb4</a>.","mla":"Perna, Rosalba, et al. “Accretion-Induced Collapse of Neutron Stars in the Disks of Active Galactic Nuclei.” <i>The Astrophysical Journal</i>, vol. 915, no. 1, 10, American Astronomical Society, 2021, doi:<a href=\"https://doi.org/10.3847/1538-4357/abfdb4\">10.3847/1538-4357/abfdb4</a>."},"date_published":"2021-06-28T00:00:00Z","intvolume":"       915","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","article_number":"10","publisher":"American Astronomical Society","abstract":[{"lang":"eng","text":"The disks of active galactic nuclei (AGNs) have emerged as a rich environment for the evolution of stars and their compact remnants. The very dense medium favors rapid accretion, while torques and migration traps enhance binary formation and mergers. Both long and short gamma-ray bursts are hence expected. We show that AGN disks constitute an ideal environment for another interesting phenomenon: the accretion-induced collapse (AIC) of neutron stars (NSs) to black holes (BHs). Rapid accretion in the dense disks can cause NSs to grow to the point of exceeding the maximum mass allowed by their equation of state. General relativistic magnetohydrodynamical simulations have shown that electromagnetic signatures are expected if the NS is surrounded by a minidisk prior to collapse, which then rapidly accretes onto the BH, and/or if the NS is highly magnetized, from reconnection of the magnetosphere during collapse. Here we compute the rates of AICs and their locations within the disks for both isolated NSs and for (initially stable) NSs formed from NS-NS mergers. We find that the global AIC rates are ∼0.07–20 Gpc−3 yr−1, and we discuss their observable prospects and signatures as they emerge from the dense disk environments."}],"title":"Accretion-induced collapse of neutron stars in the disks of active galactic nuclei","extern":"1","publication_status":"published","oa":1,"article_processing_charge":"No","issue":"1","day":"28","author":[{"last_name":"Perna","full_name":"Perna, Rosalba","first_name":"Rosalba"},{"first_name":"Hiromichi","full_name":"Tagawa, Hiromichi","last_name":"Tagawa"},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","last_name":"Haiman","full_name":"Haiman, Zoltán","first_name":"Zoltán"},{"last_name":"Bartos","full_name":"Bartos, Imre","first_name":"Imre"}],"language":[{"iso":"eng"}],"article_type":"original","year":"2021","publication":"The Astrophysical Journal","publication_identifier":{"issn":["0004-637X","1538-4357"]}},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/mnras/stab395"}],"doi":"10.1093/mnras/stab395","quality_controlled":"1","date_updated":"2024-09-10T13:53:06Z","volume":502,"date_created":"2024-09-05T08:56:14Z","_id":"17516","oa_version":"Published Version","month":"02","scopus_import":"1","type":"journal_article","status":"public","citation":{"ama":"Osato K, Liu J, Haiman Z. κTNG: effect of baryonic processes on weak lensing with IllustrisTNG simulations. <i>Monthly Notices of the Royal Astronomical Society</i>. 2021;502(4):5593-5602. doi:<a href=\"https://doi.org/10.1093/mnras/stab395\">10.1093/mnras/stab395</a>","ieee":"K. Osato, J. Liu, and Z. Haiman, “κTNG: effect of baryonic processes on weak lensing with IllustrisTNG simulations,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 502, no. 4. Oxford University Press, pp. 5593–5602, 2021.","apa":"Osato, K., Liu, J., &#38; Haiman, Z. (2021). κTNG: effect of baryonic processes on weak lensing with IllustrisTNG simulations. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stab395\">https://doi.org/10.1093/mnras/stab395</a>","ista":"Osato K, Liu J, Haiman Z. 2021. κTNG: effect of baryonic processes on weak lensing with IllustrisTNG simulations. Monthly Notices of the Royal Astronomical Society. 502(4), 5593–5602.","chicago":"Osato, Ken, Jia Liu, and Zoltán Haiman. “ΚTNG: Effect of Baryonic Processes on Weak Lensing with IllustrisTNG Simulations.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2021. <a href=\"https://doi.org/10.1093/mnras/stab395\">https://doi.org/10.1093/mnras/stab395</a>.","short":"K. Osato, J. Liu, Z. Haiman, Monthly Notices of the Royal Astronomical Society 502 (2021) 5593–5602.","mla":"Osato, Ken, et al. “ΚTNG: Effect of Baryonic Processes on Weak Lensing with IllustrisTNG Simulations.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 502, no. 4, Oxford University Press, 2021, pp. 5593–602, doi:<a href=\"https://doi.org/10.1093/mnras/stab395\">10.1093/mnras/stab395</a>."},"date_published":"2021-02-11T00:00:00Z","intvolume":"       502","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Oxford University Press","page":"5593-5602","publication_status":"published","abstract":[{"lang":"eng","text":"We study the effect of baryonic processes on weak lensing (WL) observables with a suite of mock WL maps, the κTNG, based on the cosmological hydrodynamic simulations IllustrisTNG. We quantify the baryonic effects on the WL angular power spectrum, one-point probability distribution function (PDF), and number counts of peaks and minima. We also show the redshift evolution of the effects, which is a key to distinguish the effect of baryons from fundamental physics such as dark energy, dark matter, and massive neutrinos. We find that baryonic processes reduce the small-scale power, suppress the tails of the PDF, peak and minimum counts, and change the total number of peaks and minima. We compare our results to existing semi-analytical models and hydrodynamic simulations, and discuss the source of discrepancies. The κTNG suite includes 10 000 realizations of $5 \\times 5 \\, \\mathrm{deg}^2$ maps for 40 source redshifts up to zs = 2.6, well covering the range of interest for existing and upcoming WL surveys. We also produce the κTNG-Dark suite of maps, generated based on the corresponding dark matter-only IllustrisTNG simulations. Our mock maps are not only suitable for developing analytical models that incorporate the effect of baryons, but also particularly useful for studies that rely on mass maps, such as non-Gaussian statistics and machine learning with convolutional neural networks. The suite of mock maps is publicly available at Columbia Lensing (http://columbialensing.org)."}],"title":"κTNG: effect of baryonic processes on weak lensing with IllustrisTNG simulations","extern":"1","issue":"4","day":"11","author":[{"full_name":"Osato, Ken","first_name":"Ken","last_name":"Osato"},{"last_name":"Liu","first_name":"Jia","full_name":"Liu, Jia"},{"last_name":"Haiman","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","first_name":"Zoltán"}],"oa":1,"article_processing_charge":"No","article_type":"original","year":"2021","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0035-8711","1365-2966"]},"publication":"Monthly Notices of the Royal Astronomical Society"}]