[{"license":"https://creativecommons.org/licenses/by/4.0/","file":[{"relation":"main_file","checksum":"362fc994e5df66caf3025b7dc437b647","date_created":"2025-01-09T13:46:05Z","access_level":"open_access","creator":"dernst","file_size":1068464,"content_type":"application/pdf","date_updated":"2025-01-09T13:46:05Z","file_name":"2024_TrendsParasitology_Cremer.pdf","file_id":"18816","success":1}],"year":"2024","day":"01","date_updated":"2025-09-08T09:01:42Z","article_type":"original","publisher":"Elsevier","status":"public","pmid":1,"publication_status":"published","has_accepted_license":"1","intvolume":"        40","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"author":[{"orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","last_name":"Cremer"},{"orcid":"0000-0003-1122-3982","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","full_name":"Pull, Christopher","last_name":"Pull","first_name":"Christopher"}],"corr_author":"1","OA_type":"hybrid","date_published":"2024-09-01T00:00:00Z","ddc":["570"],"oa":1,"oa_version":"Published Version","department":[{"_id":"SyCr"}],"OA_place":"publisher","issue":"9","language":[{"iso":"eng"}],"quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"09","type":"journal_article","scopus_import":"1","citation":{"apa":"Cremer, S., &#38; Pull, C. (2024). Unconditional versus condition-dependent social immunity. <i>Trends in Parasitology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.pt.2024.07.014\">https://doi.org/10.1016/j.pt.2024.07.014</a>","ista":"Cremer S, Pull C. 2024. Unconditional versus condition-dependent social immunity. Trends in Parasitology. 40(9), 780–787.","ama":"Cremer S, Pull C. Unconditional versus condition-dependent social immunity. <i>Trends in Parasitology</i>. 2024;40(9):780-787. doi:<a href=\"https://doi.org/10.1016/j.pt.2024.07.014\">10.1016/j.pt.2024.07.014</a>","chicago":"Cremer, Sylvia, and Christopher Pull. “Unconditional versus Condition-Dependent Social Immunity.” <i>Trends in Parasitology</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.pt.2024.07.014\">https://doi.org/10.1016/j.pt.2024.07.014</a>.","short":"S. Cremer, C. Pull, Trends in Parasitology 40 (2024) 780–787.","mla":"Cremer, Sylvia, and Christopher Pull. “Unconditional versus Condition-Dependent Social Immunity.” <i>Trends in Parasitology</i>, vol. 40, no. 9, Elsevier, 2024, pp. 780–87, doi:<a href=\"https://doi.org/10.1016/j.pt.2024.07.014\">10.1016/j.pt.2024.07.014</a>.","ieee":"S. Cremer and C. Pull, “Unconditional versus condition-dependent social immunity,” <i>Trends in Parasitology</i>, vol. 40, no. 9. Elsevier, pp. 780–787, 2024."},"acknowledgement":"We thank Koos Boomsma and two anonymous reviewers for their constructive comments on the manuscript.","doi":"10.1016/j.pt.2024.07.014","date_created":"2024-08-25T22:01:08Z","publication_identifier":{"issn":["1471-4922"],"eissn":["1471-5007"]},"_id":"17461","article_processing_charge":"Yes (via OA deal)","page":"780-787","external_id":{"pmid":["39152078"],"isi":["001307815700001"]},"title":"Unconditional versus condition-dependent social immunity","publication":"Trends in Parasitology","abstract":[{"text":"Socially living animals can counteract disease through cooperative defences, leading to social immunity that collectively exceeds the sum of individual defences. In superorganismal colonies of social insects with permanent caste separation between reproductive queen(s) and nonreproducing workers, workers are obligate altruists and thus engage in unconditional social immunity, including highly specialised and self-sacrificial hygiene behaviours. Contrastingly, cooperation is facultative in cooperatively breeding families, where all members are reproductively totipotent but offspring transiently forgo reproduction to help their parents rear more siblings. Here, helpers should either express condition-dependent social immunity or disperse to pursue independent reproduction. We advocate inclusive fitness theory as a framework to predict when and how indirect fitness gains may outweigh direct fitness costs, thus favouring conditional social immunity.","lang":"eng"}],"volume":40,"file_date_updated":"2025-01-09T13:46:05Z"},{"publication":"Multiscale Modeling and Simulation","abstract":[{"text":"We are interested in numerical algorithms for computing the electrical field generated by a charge distribution localized on scale l in an infinite heterogeneous correlated random medium, in a situation where the medium is only known in a box of diameter L >>l around the support of the charge. We show that the algorithm in [J. Lu, F. Otto, and L. Wang, Optimal Artificial Boundary Conditions Based on Second-Order Correctors for Three Dimensional Random Ellilptic Media, preprint, arXiv:2109.01616, 2021], suggesting optimal Dirichlet boundary conditions motivated by the multipole expansion [P. Bella, A. Giunti, and F. Otto, Comm. Partial Differential Equations, 45 (2020), pp. 561–640], still performs well in correlated media. With overwhelming probability, we obtain a convergence rate in terms of l, L, and the size of the correlations for which optimality is supported with numerical simulations. These estimates are provided for ensembles which satisfy a multiscale logarithmic Sobolev inequality, where our main tool is an extension of the semigroup estimates in [N. Clozeau, Stoch. Partial Differ. Equ. Anal. Comput., 11 (2023), pp. 1254–1378]. As part of our strategy, we construct sublinear second-order correctors in this correlated setting, which is of independent interest.","lang":"eng"}],"ec_funded":1,"volume":22,"title":"Artificial boundary conditions for random elliptic systems with correlated coefficient field","arxiv":1,"article_processing_charge":"No","external_id":{"arxiv":["2309.06798"],"isi":["001285416500001"]},"page":"973-1029","project":[{"name":"Bridging Scales in Random Materials","call_identifier":"H2020","grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d"}],"acknowledgement":"We would like to thank our affiliations, Institute of Science and Technology Austria and Max Planck Institute for Mathematics in the Sciences, for supporting the authors’ visits to each other, which greatly facilitated this work. We would like to thank Marc Josien and Quinn Winters for assistance in numerical implementation.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2309.06798"}],"date_created":"2024-08-25T22:01:08Z","doi":"10.1137/23M1603819","publication_identifier":{"issn":["1540-3459"],"eissn":["1540-3467"]},"_id":"17462","month":"09","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","scopus_import":"1","citation":{"chicago":"Clozeau, Nicolas, and Lihan Wang. “Artificial Boundary Conditions for Random Elliptic Systems with Correlated Coefficient Field.” <i>Multiscale Modeling and Simulation</i>. Society for Industrial and Applied Mathematics, 2024. <a href=\"https://doi.org/10.1137/23M1603819\">https://doi.org/10.1137/23M1603819</a>.","ama":"Clozeau N, Wang L. Artificial boundary conditions for random elliptic systems with correlated coefficient field. <i>Multiscale Modeling and Simulation</i>. 2024;22(3):973-1029. doi:<a href=\"https://doi.org/10.1137/23M1603819\">10.1137/23M1603819</a>","ieee":"N. Clozeau and L. Wang, “Artificial boundary conditions for random elliptic systems with correlated coefficient field,” <i>Multiscale Modeling and Simulation</i>, vol. 22, no. 3. Society for Industrial and Applied Mathematics, pp. 973–1029, 2024.","mla":"Clozeau, Nicolas, and Lihan Wang. “Artificial Boundary Conditions for Random Elliptic Systems with Correlated Coefficient Field.” <i>Multiscale Modeling and Simulation</i>, vol. 22, no. 3, Society for Industrial and Applied Mathematics, 2024, pp. 973–1029, doi:<a href=\"https://doi.org/10.1137/23M1603819\">10.1137/23M1603819</a>.","short":"N. Clozeau, L. Wang, Multiscale Modeling and Simulation 22 (2024) 973–1029.","apa":"Clozeau, N., &#38; Wang, L. (2024). Artificial boundary conditions for random elliptic systems with correlated coefficient field. <i>Multiscale Modeling and Simulation</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/23M1603819\">https://doi.org/10.1137/23M1603819</a>","ista":"Clozeau N, Wang L. 2024. Artificial boundary conditions for random elliptic systems with correlated coefficient field. Multiscale Modeling and Simulation. 22(3), 973–1029."},"OA_place":"repository","issue":"3","language":[{"iso":"eng"}],"quality_controlled":"1","oa":1,"oa_version":"Preprint","department":[{"_id":"JuFi"}],"OA_type":"green","corr_author":"1","date_published":"2024-09-01T00:00:00Z","author":[{"id":"fea1b376-906f-11eb-847d-b2c0cf46455b","full_name":"Clozeau, Nicolas","last_name":"Clozeau","first_name":"Nicolas"},{"last_name":"Wang","first_name":"Lihan","full_name":"Wang, Lihan"}],"intvolume":"        22","isi":1,"status":"public","publication_status":"published","date_updated":"2025-09-08T09:01:00Z","publisher":"Society for Industrial and Applied Mathematics","article_type":"original","year":"2024","day":"01"},{"department":[{"_id":"FlPr"}],"oa_version":"Published Version","oa":1,"language":[{"iso":"eng"}],"quality_controlled":"1","citation":{"ista":"Pillai A, Idris A, Philomin A, Weidle C, Skotheim R, Leung PJY, Broerman A, Demakis C, Borst AJ, Praetorius FM, Baker D. 2024. De novo design of allosterically switchable protein assemblies. Nature. 632, 911–920.","apa":"Pillai, A., Idris, A., Philomin, A., Weidle, C., Skotheim, R., Leung, P. J. Y., … Baker, D. (2024). De novo design of allosterically switchable protein assemblies. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-024-07813-2\">https://doi.org/10.1038/s41586-024-07813-2</a>","ieee":"A. Pillai <i>et al.</i>, “De novo design of allosterically switchable protein assemblies,” <i>Nature</i>, vol. 632. Springer Nature, pp. 911–920, 2024.","mla":"Pillai, Arvind, et al. “De Novo Design of Allosterically Switchable Protein Assemblies.” <i>Nature</i>, vol. 632, Springer Nature, 2024, pp. 911–920, doi:<a href=\"https://doi.org/10.1038/s41586-024-07813-2\">10.1038/s41586-024-07813-2</a>.","short":"A. Pillai, A. Idris, A. Philomin, C. Weidle, R. Skotheim, P.J.Y. Leung, A. Broerman, C. Demakis, A.J. Borst, F.M. Praetorius, D. Baker, Nature 632 (2024) 911–920.","chicago":"Pillai, Arvind, Abbas Idris, Annika Philomin, Connor Weidle, Rebecca Skotheim, Philip J.Y. Leung, Adam Broerman, et al. “De Novo Design of Allosterically Switchable Protein Assemblies.” <i>Nature</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41586-024-07813-2\">https://doi.org/10.1038/s41586-024-07813-2</a>.","ama":"Pillai A, Idris A, Philomin A, et al. De novo design of allosterically switchable protein assemblies. <i>Nature</i>. 2024;632:911–920. doi:<a href=\"https://doi.org/10.1038/s41586-024-07813-2\">10.1038/s41586-024-07813-2</a>"},"scopus_import":"1","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"08","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"_id":"17463","doi":"10.1038/s41586-024-07813-2","date_created":"2024-08-25T22:01:08Z","acknowledgement":"We thank D. D. Sahtoe, R. D. Kiber, Y. Hsia, N. Bethel and A. Favor for helpful discussions and K. VanWormer and L. Goldschmidt for technical support. We also thank X. Li and M. Lamb for mass spectrometry support. This work was supported by the Washington Research Foundation Postdoctoral Fellowship (grant no. GR027504, A. Pillai), a National Science Foundation Graduate Research Fellowship (grant no. DGE-2140004, A.I.), a Human Frontier Science Program Long Term Fellowship (grant no. LT000880/2019, F.P.), the Audacious Project at the Institute for Protein Design (A.B., A. Pillai, A. Philomin, A.I. and D.B.), a National Energy Research Scientific Computing Centre award (grant no. BER-ERCAP0022018), the Howard Hughes Medical Institute (D.B.), the Open Philanthropy Project Improving Protein Design Fund (P.J.Y.L., C.D. and D.B.) a gift from Microsoft (D.B.) and a grant from DARPA supporting the Harnessing Enzymatic Activity for Lifesaving Remedies programme (grant no. HR001120S0052, contract no. HR0011-21-2-0012, D.B.).","article_processing_charge":"Yes (in subscription journal)","external_id":{"pmid":["39143214"],"isi":["001300534300019"]},"page":"911–920 ","title":"De novo design of allosterically switchable protein assemblies","file_date_updated":"2024-09-09T12:01:14Z","volume":632,"publication":"Nature","abstract":[{"text":"Allosteric modulation of protein function, wherein the binding of an effector to a protein triggers conformational changes at distant functional sites, plays a central part in the control of metabolism and cell signalling1,2,3. There has been considerable interest in designing allosteric systems, both to gain insight into the mechanisms underlying such ‘action at a distance’ modulation and to create synthetic proteins whose functions can be regulated by effectors4,5,6,7. However, emulating the subtle conformational changes distributed across many residues, characteristic of natural allosteric proteins, is a significant challenge8,9. Here, inspired by the classic Monod–Wyman–Changeux model of cooperativity10, we investigate the de novo design of allostery through rigid-body coupling of peptide-switchable hinge modules11 to protein interfaces12 that direct the formation of alternative oligomeric states. We find that this approach can be used to generate a wide variety of allosterically switchable systems, including cyclic rings that incorporate or eject subunits in response to peptide binding and dihedral cages that undergo effector-induced disassembly. Size-exclusion chromatography, mass photometry13 and electron microscopy reveal that these designed allosteric protein assemblies closely resemble the design models in both the presence and absence of peptide effectors and can have ligand-binding cooperativity comparable to classic natural systems such as haemoglobin14. Our results indicate that allostery can arise from global coupling of the energetics of protein substructures without optimized side-chain–side-chain allosteric communication pathways and provide a roadmap for generating allosterically triggerable delivery systems, protein nanomachines and cellular feedback control circuitry.","lang":"eng"}],"file":[{"success":1,"file_id":"18005","file_name":"2024_Nature_Pillai.pdf","file_size":16572040,"content_type":"application/pdf","date_updated":"2024-09-09T12:01:14Z","creator":"dernst","access_level":"open_access","checksum":"39127601621a360ec0edc538627eb211","date_created":"2024-09-09T12:01:14Z","relation":"main_file"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","day":"22","year":"2024","article_type":"original","publisher":"Springer Nature","date_updated":"2025-09-08T09:00:16Z","publication_status":"published","pmid":1,"status":"public","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"isi":1,"intvolume":"       632","author":[{"full_name":"Pillai, Arvind","first_name":"Arvind","last_name":"Pillai"},{"full_name":"Idris, Abbas","first_name":"Abbas","last_name":"Idris"},{"full_name":"Philomin, Annika","first_name":"Annika","last_name":"Philomin"},{"full_name":"Weidle, Connor","last_name":"Weidle","first_name":"Connor"},{"last_name":"Skotheim","first_name":"Rebecca","full_name":"Skotheim, Rebecca"},{"first_name":"Philip J.Y.","last_name":"Leung","full_name":"Leung, Philip J.Y."},{"full_name":"Broerman, Adam","last_name":"Broerman","first_name":"Adam"},{"full_name":"Demakis, Cullen","last_name":"Demakis","first_name":"Cullen"},{"full_name":"Borst, Andrew J.","last_name":"Borst","first_name":"Andrew J."},{"last_name":"Praetorius","first_name":"Florian M","id":"dfec9381-4341-11ee-8fd8-faa02bba7d62","full_name":"Praetorius, Florian M"},{"last_name":"Baker","first_name":"David","full_name":"Baker, David"}],"date_published":"2024-08-22T00:00:00Z","ddc":["570"],"corr_author":"1"},{"article_processing_charge":"No","project":[{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"}],"abstract":[{"text":"Mechanisms for suppressing thermalization in disorder-free many-body systems, such as Hilbert space fragmentation and quantum many-body scars, have recently attracted much interest in foundations of quantum statistical physics and potential quantum information processing applications. However,  their sensitivity to realistic effects such as finite temperature remains largely unexplored. Here, we have utilized IBM's Kolkata quantum processor to demonstrate an unexpected robustness of quantum many-body scars at finite temperatures when the system is prepared in a thermal Gibbs ensemble. We identify such robustness in the PXP model, which describes quantum many-body scars in experimental systems of Rydberg atom arrays and ultracold atoms in tilted Bose--Hubbard optical lattices. By contrast, other theoretical models which host exact quantum many-body scars are found to lack such robustness, and their scarring properties quickly decay with temperature. Our study sheds light on the important differences between scarred models in terms of their algebraic structures, which impacts their resilience to finite temperature.","lang":"eng"}],"ec_funded":1,"file_date_updated":"2024-08-30T13:19:57Z","title":"Data for \"Enhanced many-body quantum scars from the non-Hermitian Fock skin effect\"","oa":1,"oa_version":"Published Version","department":[{"_id":"MaSe"}],"date_created":"2024-08-30T12:59:43Z","doi":"10.15479/AT:ISTA:17471","_id":"17471","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"18627"}]},"month":"08","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","type":"research_data","citation":{"apa":"Desaules, J.-Y. M. (2024). Data for “Enhanced many-body quantum scars from the non-Hermitian Fock skin effect.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:17471\">https://doi.org/10.15479/AT:ISTA:17471</a>","ista":"Desaules J-YM. 2024. Data for ‘Enhanced many-body quantum scars from the non-Hermitian Fock skin effect’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:17471\">10.15479/AT:ISTA:17471</a>.","ama":"Desaules J-YM. Data for “Enhanced many-body quantum scars from the non-Hermitian Fock skin effect.” 2024. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:17471\">10.15479/AT:ISTA:17471</a>","chicago":"Desaules, Jean-Yves Marc. “Data for ‘Enhanced Many-Body Quantum Scars from the Non-Hermitian Fock Skin Effect.’” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/AT:ISTA:17471\">https://doi.org/10.15479/AT:ISTA:17471</a>.","short":"J.-Y.M. Desaules, (2024).","mla":"Desaules, Jean-Yves Marc. <i>Data for “Enhanced Many-Body Quantum Scars from the Non-Hermitian Fock Skin Effect.”</i> Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:17471\">10.15479/AT:ISTA:17471</a>.","ieee":"J.-Y. M. Desaules, “Data for ‘Enhanced many-body quantum scars from the non-Hermitian Fock skin effect.’” Institute of Science and Technology Austria, 2024."},"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"keyword":["quantum many-body scars","non-equilibrium physics","non-Hermitian physics"],"contributor":[{"first_name":"Ruizhe","last_name":"Shen","contributor_type":"researcher"},{"first_name":"Fang","last_name":"Qin","contributor_type":"researcher"},{"contributor_type":"researcher","id":"6c292945-a610-11ed-9eec-c3be1ad62a80","orcid":"0000-0002-3749-6375","last_name":"Desaules","first_name":"Jean-Yves Marc"},{"first_name":"Zlatko","last_name":"Papić","contributor_type":"researcher"},{"contributor_type":"researcher","first_name":"Ching Hua","last_name":"Lee"}],"has_accepted_license":"1","ddc":["530"],"date_published":"2024-08-30T00:00:00Z","author":[{"orcid":"0000-0002-3749-6375","id":"6c292945-a610-11ed-9eec-c3be1ad62a80","full_name":"Desaules, Jean-Yves Marc","last_name":"Desaules","first_name":"Jean-Yves Marc"}],"year":"2024","day":"30","file":[{"content_type":"application/zip","date_updated":"2024-08-30T12:55:37Z","file_size":322400,"creator":"jdesaule","access_level":"open_access","date_created":"2024-08-30T12:55:37Z","relation":"main_file","checksum":"2bd49ce5a63f1951c1ed3d89cce4fe27","success":1,"file_id":"17472","file_name":"FiguresData.zip"},{"access_level":"open_access","date_created":"2024-08-30T13:19:57Z","relation":"main_file","checksum":"c2ba113a241e98c394cc3ca21f3fa126","content_type":"text/plain","date_updated":"2024-08-30T13:19:57Z","file_size":1368,"creator":"jdesaule","file_id":"17473","file_name":"readme.txt","success":1}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","status":"public","date_updated":"2026-06-10T07:52:53Z","publisher":"Institute of Science and Technology Austria"},{"has_accepted_license":"1","intvolume":"       301","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"author":[{"first_name":"Christel","last_name":"Baier","full_name":"Baier, Christel"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Meggendorfer","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165"},{"last_name":"Piribauer","first_name":"Jakob","full_name":"Piribauer, Jakob"}],"OA_type":"hybrid","corr_author":"1","date_published":"2024-12-01T00:00:00Z","ddc":["000"],"file":[{"file_name":"2024_InformationComputation_Baier.pdf","file_id":"18817","success":1,"checksum":"f68e0c2f46f9b9c86815406bcf2ee2d4","date_created":"2025-01-09T13:49:03Z","relation":"main_file","access_level":"open_access","creator":"dernst","date_updated":"2025-01-09T13:49:03Z","content_type":"application/pdf","file_size":724703}],"year":"2024","day":"01","date_updated":"2025-09-08T09:10:06Z","article_type":"original","publisher":"Elsevier","status":"public","publication_status":"published","external_id":{"isi":["001301143400001"],"arxiv":["2307.06611"]},"article_processing_charge":"Yes (in subscription journal)","arxiv":1,"title":"Entropic risk for turn-based stochastic games","article_number":"105214","publication":"Information and Computation","abstract":[{"lang":"eng","text":"Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective. This gives rise to an objective function that demands the control of systems in a risk-averse manner. We show that the resulting games are determined and, in particular, admit optimal memoryless deterministic strategies. This contrasts risk measures that previously have been considered in the special case of Markov decision processes and that require randomization and/or memory. We provide several results on the decidability and the computational complexity of the threshold problem, i.e. whether the optimal value of ERisk exceeds a given threshold. Furthermore, an approximation algorithm for the optimal value of ERisk is provided."}],"volume":301,"file_date_updated":"2025-01-09T13:49:03Z","oa_version":"Published Version","oa":1,"department":[{"_id":"KrCh"}],"OA_place":"publisher","language":[{"iso":"eng"}],"quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"12","type":"journal_article","scopus_import":"1","citation":{"ieee":"C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” <i>Information and Computation</i>, vol. 301. Elsevier, 2024.","mla":"Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.” <i>Information and Computation</i>, vol. 301, 105214, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.ic.2024.105214\">10.1016/j.ic.2024.105214</a>.","short":"C. Baier, K. Chatterjee, T. Meggendorfer, J. Piribauer, Information and Computation 301 (2024).","chicago":"Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” <i>Information and Computation</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.ic.2024.105214\">https://doi.org/10.1016/j.ic.2024.105214</a>.","ama":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Entropic risk for turn-based stochastic games. <i>Information and Computation</i>. 2024;301. doi:<a href=\"https://doi.org/10.1016/j.ic.2024.105214\">10.1016/j.ic.2024.105214</a>","ista":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. 2024. Entropic risk for turn-based stochastic games. Information and Computation. 301, 105214.","apa":"Baier, C., Chatterjee, K., Meggendorfer, T., &#38; Piribauer, J. (2024). Entropic risk for turn-based stochastic games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2024.105214\">https://doi.org/10.1016/j.ic.2024.105214</a>"},"acknowledgement":"Krishnendu Chatterjee reports financial support was provided by European Research Council.","date_created":"2024-09-01T22:01:07Z","doi":"10.1016/j.ic.2024.105214","related_material":{"record":[{"id":"14417","relation":"earlier_version","status":"public"}]},"_id":"17474","publication_identifier":{"issn":["0890-5401"],"eissn":["1090-2651"]}},{"isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"intvolume":"        75","has_accepted_license":"1","ddc":["500"],"date_published":"2024-06-19T00:00:00Z","corr_author":"1","author":[{"last_name":"Koval","first_name":"Illya","id":"2eed1f3b-896a-11ed-bdf8-93c7c4bf159e","full_name":"Koval, Illya"},{"last_name":"Kwan","first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567"}],"day":"19","year":"2024","file":[{"success":1,"file_id":"17851","file_name":"2024_QuJofMath_Koval.pdf","date_updated":"2024-09-06T12:23:57Z","content_type":"application/pdf","file_size":946411,"creator":"cchlebak","access_level":"open_access","date_created":"2024-09-06T12:23:57Z","checksum":"abf200d37ad69e6f2c0750a30296ad97","relation":"main_file"}],"publication_status":"published","status":"public","publisher":"Oxford University Press","article_type":"original","date_updated":"2025-09-08T09:09:41Z","arxiv":1,"project":[{"name":"Randomness and structure in combinatorics","grant_number":"101076777","_id":"bd95085b-d553-11ed-ba76-e55d3349be45"}],"external_id":{"arxiv":["2309.09788"],"isi":["001249741500001"]},"page":"869-899","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2024-09-06T12:23:57Z","volume":75,"publication":"Quarterly Journal of Mathematics","abstract":[{"text":"As a discrete analogue of Kac’s celebrated question on ‘hearing the shape of a drum’ and towards a practical\r\ngraph isomorphism test, it is of interest to understand which graphs are determined up to isomorphism by\r\ntheir spectrum (of their adjacency matrix). A striking conjecture in this area, due to van Dam and Haemers,\r\nis that ‘almost all graphs are determined by their spectrum’, meaning that the fraction of unlabelled n-vertex\r\ngraphs which are determined by their spectrum converges to 1 as n → ∞.\r\nIn this paper, we make a step towards this conjecture, showing that there are exponentially many n-vertex\r\ngraphs which are determined by their spectrum. This improves on previous bounds (of shape e\r\nc\r\n√\r\nn\r\n). We also\r\npropose a number of further directions of research.\r\n","lang":"eng"}],"title":"Exponentially many graphs are determined by their spectrum","quality_controlled":"1","language":[{"iso":"eng"}],"issue":"3","department":[{"_id":"MaKw"},{"_id":"VaKa"}],"oa":1,"oa_version":"Published Version","publication_identifier":{"eissn":["1464-3847"],"issn":["0033-5606"]},"_id":"17475","date_created":"2024-09-01T22:01:07Z","doi":"10.1093/qmath/haae030","acknowledgement":"Matthew Kwan was supported by ERC Starting Grant ‘RANDSTRUCT’ No. 101076777.","citation":{"ama":"Koval I, Kwan MA. Exponentially many graphs are determined by their spectrum. <i>Quarterly Journal of Mathematics</i>. 2024;75(3):869-899. doi:<a href=\"https://doi.org/10.1093/qmath/haae030\">10.1093/qmath/haae030</a>","chicago":"Koval, Illya, and Matthew Alan Kwan. “Exponentially Many Graphs Are Determined by Their Spectrum.” <i>Quarterly Journal of Mathematics</i>. Oxford University Press, 2024. <a href=\"https://doi.org/10.1093/qmath/haae030\">https://doi.org/10.1093/qmath/haae030</a>.","short":"I. Koval, M.A. Kwan, Quarterly Journal of Mathematics 75 (2024) 869–899.","mla":"Koval, Illya, and Matthew Alan Kwan. “Exponentially Many Graphs Are Determined by Their Spectrum.” <i>Quarterly Journal of Mathematics</i>, vol. 75, no. 3, Oxford University Press, 2024, pp. 869–99, doi:<a href=\"https://doi.org/10.1093/qmath/haae030\">10.1093/qmath/haae030</a>.","ieee":"I. Koval and M. A. Kwan, “Exponentially many graphs are determined by their spectrum,” <i>Quarterly Journal of Mathematics</i>, vol. 75, no. 3. Oxford University Press, pp. 869–899, 2024.","apa":"Koval, I., &#38; Kwan, M. A. (2024). Exponentially many graphs are determined by their spectrum. <i>Quarterly Journal of Mathematics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/qmath/haae030\">https://doi.org/10.1093/qmath/haae030</a>","ista":"Koval I, Kwan MA. 2024. Exponentially many graphs are determined by their spectrum. Quarterly Journal of Mathematics. 75(3), 869–899."},"scopus_import":"1","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"06"},{"external_id":{"isi":["001299497800001"]},"article_processing_charge":"No","article_number":"085403","title":"No extraordinary χ(3) in lead-halide perovskites: Placing an upper bound on Kerr nonlinearity by means of time-resolved interferometry","abstract":[{"text":"Lead halide perovskites have recently been reported to demonstrate an exceptionally high nonlinear (Kerr) refractive index n2 of up to 10−8cm2/W in CH3⁢NH3⁢PbBr3. Other researchers, however, observe different, substantially more conservative numbers. In order to resolve this disagreement, the nonlinear Kerr index of a bulk sample of lead halide perovskite was measured directly by means of an interferometer. This approach has many advantages as compared to the more standard z-scan technique. In particular, this method allows studying the induced changes to the refractive index in a time-resolved manner, thus enabling to separate the different contributions to 𝑛2. The extracted 𝑛2 values for CsPbBr3 and MAPbBr3 at 𝜆≈1µ⁢m are 𝑛2=+2.1×10−14cm2/W and 𝑛2=+6×10−15cm2/W, respectively. Hence, these values are substantially lower than what has been indicated in most of the previous reports, implying the latter one should be regarded with great care.","lang":"eng"}],"publication":"Physical Review Materials","volume":8,"oa_version":"None","department":[{"_id":"ZhAl"}],"issue":"8","language":[{"iso":"eng"}],"quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"08","type":"journal_article","scopus_import":"1","citation":{"apa":"Lorenc, D., Zhumekenov, A., Bakr, O. M., &#38; Alpichshev, Z. (2024). No extraordinary χ(3) in lead-halide perovskites: Placing an upper bound on Kerr nonlinearity by means of time-resolved interferometry. <i>Physical Review Materials</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevMaterials.8.085403\">https://doi.org/10.1103/PhysRevMaterials.8.085403</a>","ista":"Lorenc D, Zhumekenov A, Bakr OM, Alpichshev Z. 2024. No extraordinary χ(3) in lead-halide perovskites: Placing an upper bound on Kerr nonlinearity by means of time-resolved interferometry. Physical Review Materials. 8(8), 085403.","ama":"Lorenc D, Zhumekenov A, Bakr OM, Alpichshev Z. No extraordinary χ(3) in lead-halide perovskites: Placing an upper bound on Kerr nonlinearity by means of time-resolved interferometry. <i>Physical Review Materials</i>. 2024;8(8). doi:<a href=\"https://doi.org/10.1103/PhysRevMaterials.8.085403\">10.1103/PhysRevMaterials.8.085403</a>","chicago":"Lorenc, Dusan, Ayan Zhumekenov, Osman M. Bakr, and Zhanybek Alpichshev. “No Extraordinary χ(3) in Lead-Halide Perovskites: Placing an Upper Bound on Kerr Nonlinearity by Means of Time-Resolved Interferometry.” <i>Physical Review Materials</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PhysRevMaterials.8.085403\">https://doi.org/10.1103/PhysRevMaterials.8.085403</a>.","short":"D. Lorenc, A. Zhumekenov, O.M. Bakr, Z. Alpichshev, Physical Review Materials 8 (2024).","ieee":"D. Lorenc, A. Zhumekenov, O. M. Bakr, and Z. Alpichshev, “No extraordinary χ(3) in lead-halide perovskites: Placing an upper bound on Kerr nonlinearity by means of time-resolved interferometry,” <i>Physical Review Materials</i>, vol. 8, no. 8. American Physical Society, 2024.","mla":"Lorenc, Dusan, et al. “No Extraordinary χ(3) in Lead-Halide Perovskites: Placing an Upper Bound on Kerr Nonlinearity by Means of Time-Resolved Interferometry.” <i>Physical Review Materials</i>, vol. 8, no. 8, 085403, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PhysRevMaterials.8.085403\">10.1103/PhysRevMaterials.8.085403</a>."},"acknowledgement":"We gratefully acknowledge the assistance of Prof. John\r\nDudley.","date_created":"2024-09-01T22:01:08Z","doi":"10.1103/PhysRevMaterials.8.085403","_id":"17476","publication_identifier":{"eissn":["2475-9953"]},"intvolume":"         8","isi":1,"author":[{"first_name":"Dusan","last_name":"Lorenc","full_name":"Lorenc, Dusan","id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ayan","last_name":"Zhumekenov","full_name":"Zhumekenov, Ayan"},{"full_name":"Bakr, Osman M.","first_name":"Osman M.","last_name":"Bakr"},{"first_name":"Zhanybek","last_name":"Alpichshev","orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87"}],"corr_author":"1","date_published":"2024-08-23T00:00:00Z","year":"2024","day":"23","date_updated":"2025-09-08T09:06:34Z","article_type":"original","publisher":"American Physical Society","status":"public","publication_status":"published"},{"year":"2024","day":"16","file":[{"file_id":"17757","file_name":"2024_PhysRevX_Hawaldar.pdf","success":1,"access_level":"open_access","date_created":"2024-09-06T09:43:53Z","relation":"main_file","checksum":"5d39b7dda67fd7b9a960235f6f38e280","file_size":3909653,"date_updated":"2024-09-06T09:43:53Z","content_type":"application/pdf","creator":"cchlebak"}],"publication_status":"published","status":"public","date_updated":"2025-09-08T09:07:29Z","publisher":"American Physical Society","article_type":"original","intvolume":"        14","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"has_accepted_license":"1","corr_author":"1","date_published":"2024-08-16T00:00:00Z","ddc":["530"],"author":[{"orcid":"0000-0002-1965-4309","id":"221708e1-1ff6-11ee-9fa6-85146607433e","full_name":"Hawaldar, Samarth","last_name":"Hawaldar","first_name":"Samarth"},{"full_name":"Shahi, Prakriti","last_name":"Shahi","first_name":"Prakriti"},{"last_name":"Carter","first_name":"Allison L.","full_name":"Carter, Allison L."},{"full_name":"Rey, Ana Maria","first_name":"Ana Maria","last_name":"Rey"},{"full_name":"Bollinger, John J.","last_name":"Bollinger","first_name":"John J."},{"first_name":"Athreya","last_name":"Shankar","full_name":"Shankar, Athreya"}],"language":[{"iso":"eng"}],"quality_controlled":"1","issue":"3","oa_version":"Published Version","oa":1,"DOAJ_listed":"1","department":[{"_id":"JoFi"}],"acknowledgement":"We thank M. Miskeen Khan, Jennifer Lilieholm, and Wes Johnson for a careful reading and feedback on the manuscript. We acknowledge discussions with Dan Dubin, John Zaris, and Scott Parker. S. H. acknowledges the support of Kishore Vaigyanik Protsahan Yojana, Department of Science and Technology, Government of India. A. S. acknowledges the support of a C. V. Raman post-doctoral fellowship. A. L. C., A. M. R., and J. J. B. acknowledge funding from the U.S. Department of Energy, Office of Science, NQI Science Research Centers, Quantum Systems Accelerator (QSA), a collaboration between the U.S. Department of Energy, Office of Science and other agencies. A. M. R. acknowledges additional support from VBFF, ARO Grant No. W911NF-24-1-0128, by the NSF Grants No. JILA-PFC PHY-2317149 and No. QLCI-OMA-2016244, and by NIST. J. J. B. acknowledges additional support from the DARPA ONISQ program and AFOSR Grant No. FA9550-201-0019.","_id":"17477","publication_identifier":{"eissn":["2160-3308"]},"doi":"10.1103/PhysRevX.14.031030","date_created":"2024-09-01T22:01:08Z","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"08","citation":{"chicago":"Hawaldar, Samarth, Prakriti Shahi, Allison L. Carter, Ana Maria Rey, John J. Bollinger, and Athreya Shankar. “Bilayer Crystals of Trapped Ions for Quantum Information Processing.” <i>Physical Review X</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PhysRevX.14.031030\">https://doi.org/10.1103/PhysRevX.14.031030</a>.","ama":"Hawaldar S, Shahi P, Carter AL, Rey AM, Bollinger JJ, Shankar A. Bilayer crystals of trapped ions for quantum information processing. <i>Physical Review X</i>. 2024;14(3). doi:<a href=\"https://doi.org/10.1103/PhysRevX.14.031030\">10.1103/PhysRevX.14.031030</a>","ieee":"S. Hawaldar, P. Shahi, A. L. Carter, A. M. Rey, J. J. Bollinger, and A. Shankar, “Bilayer crystals of trapped ions for quantum information processing,” <i>Physical Review X</i>, vol. 14, no. 3. American Physical Society, 2024.","mla":"Hawaldar, Samarth, et al. “Bilayer Crystals of Trapped Ions for Quantum Information Processing.” <i>Physical Review X</i>, vol. 14, no. 3, 031030, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PhysRevX.14.031030\">10.1103/PhysRevX.14.031030</a>.","short":"S. Hawaldar, P. Shahi, A.L. Carter, A.M. Rey, J.J. Bollinger, A. Shankar, Physical Review X 14 (2024).","apa":"Hawaldar, S., Shahi, P., Carter, A. L., Rey, A. M., Bollinger, J. J., &#38; Shankar, A. (2024). Bilayer crystals of trapped ions for quantum information processing. <i>Physical Review X</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevX.14.031030\">https://doi.org/10.1103/PhysRevX.14.031030</a>","ista":"Hawaldar S, Shahi P, Carter AL, Rey AM, Bollinger JJ, Shankar A. 2024. Bilayer crystals of trapped ions for quantum information processing. Physical Review X. 14(3), 031030."},"scopus_import":"1","arxiv":1,"external_id":{"arxiv":["2312.10681"],"isi":["001293977800002"]},"article_processing_charge":"Yes","volume":14,"publication":"Physical Review X","abstract":[{"lang":"eng","text":"Trapped-ion systems are a leading platform for quantum information processing, but they are currently limited to 1D and 2D arrays, which imposes restrictions on both their scalability and their range of applications. Here, we propose a path to overcome this limitation by demonstrating that Penning traps can be used to realize remarkably clean bilayer crystals, wherein hundreds of ions self-organize into two well-defined layers. These bilayer crystals are made possible by the inclusion of an anharmonic trapping potential, which is readily implementable with current technology. We study the normal modes of this system and discover salient differences compared to the modes of single-plane crystals. The bilayer geometry and the unique properties of the normal modes open new opportunities—in particular, in quantum sensing and quantum simulation—that are not straightforward in single-plane crystals. Furthermore, we illustrate that it may be possible to extend the ideas presented here to realize multilayer crystals with more than two layers. Our work increases the dimensionality of trapped-ion systems by efficiently utilizing all three spatial dimensions, and it lays the foundation for a new generation of quantum information processing experiments with multilayer 3D crystals of trapped ions."}],"file_date_updated":"2024-09-06T09:43:53Z","article_number":"031030","title":"Bilayer crystals of trapped ions for quantum information processing"},{"file":[{"file_name":"2024_PublicMathIHES_Brooks.pdf","file_id":"18824","success":1,"checksum":"af3becc50f7534c9409d3ff8b5c47ed6","relation":"main_file","date_created":"2025-01-13T08:13:42Z","access_level":"open_access","creator":"dernst","file_size":924342,"date_updated":"2025-01-13T08:13:42Z","content_type":"application/pdf"}],"year":"2024","day":"01","date_updated":"2025-09-08T09:08:36Z","publisher":"Springer Nature","article_type":"original","status":"public","publication_status":"published","has_accepted_license":"1","intvolume":"       140","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"author":[{"orcid":"0000-0002-6249-0928","full_name":"Brooks, Morris","id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425","first_name":"Morris","last_name":"Brooks"},{"first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521"}],"OA_type":"hybrid","corr_author":"1","ddc":["510"],"date_published":"2024-12-01T00:00:00Z","oa_version":"Published Version","oa":1,"department":[{"_id":"RoSe"}],"OA_place":"publisher","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"12","type":"journal_article","scopus_import":"1","citation":{"apa":"Brooks, M., &#38; Seiringer, R. (2024). The Fröhlich polaron at strong coupling: Part II — Energy-momentum relation and effective mass. <i>Publications Mathematiques de l’Institut Des Hautes Etudes Scientifiques</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10240-024-00150-0\">https://doi.org/10.1007/s10240-024-00150-0</a>","ista":"Brooks M, Seiringer R. 2024. The Fröhlich polaron at strong coupling: Part II — Energy-momentum relation and effective mass. Publications Mathematiques de l’Institut des Hautes Etudes Scientifiques. 140, 271–309.","chicago":"Brooks, Morris, and Robert Seiringer. “The Fröhlich Polaron at Strong Coupling: Part II — Energy-Momentum Relation and Effective Mass.” <i>Publications Mathematiques de l’Institut Des Hautes Etudes Scientifiques</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s10240-024-00150-0\">https://doi.org/10.1007/s10240-024-00150-0</a>.","ama":"Brooks M, Seiringer R. The Fröhlich polaron at strong coupling: Part II — Energy-momentum relation and effective mass. <i>Publications Mathematiques de l’Institut des Hautes Etudes Scientifiques</i>. 2024;140:271-309. doi:<a href=\"https://doi.org/10.1007/s10240-024-00150-0\">10.1007/s10240-024-00150-0</a>","ieee":"M. Brooks and R. Seiringer, “The Fröhlich polaron at strong coupling: Part II — Energy-momentum relation and effective mass,” <i>Publications Mathematiques de l’Institut des Hautes Etudes Scientifiques</i>, vol. 140. Springer Nature, pp. 271–309, 2024.","mla":"Brooks, Morris, and Robert Seiringer. “The Fröhlich Polaron at Strong Coupling: Part II — Energy-Momentum Relation and Effective Mass.” <i>Publications Mathematiques de l’Institut Des Hautes Etudes Scientifiques</i>, vol. 140, Springer Nature, 2024, pp. 271–309, doi:<a href=\"https://doi.org/10.1007/s10240-024-00150-0\">10.1007/s10240-024-00150-0</a>.","short":"M. Brooks, R. Seiringer, Publications Mathematiques de l’Institut Des Hautes Etudes Scientifiques 140 (2024) 271–309."},"doi":"10.1007/s10240-024-00150-0","date_created":"2024-09-01T22:01:08Z","publication_identifier":{"eissn":["1618-1913"],"issn":["0073-8301"]},"_id":"17478","article_processing_charge":"Yes (in subscription journal)","external_id":{"isi":["001297785000001"],"arxiv":["2211.03353"]},"page":"271-309","arxiv":1,"title":"The Fröhlich polaron at strong coupling: Part II — Energy-momentum relation and effective mass","publication":"Publications Mathematiques de l'Institut des Hautes Etudes Scientifiques","abstract":[{"lang":"eng","text":"We study the Fröhlich polaron model in R3, and prove a lower bound on its ground state energy as a function of the total momentum. The bound is asymptotically sharp at large coupling. In combination with a corresponding upper bound proved earlier (Mitrouskas et al. in Forum Math. Sigma 11:1–52, 2023), it shows that the energy is approximately parabolic below the continuum threshold, and that the polaron’s effective mass (defined as the semi-latus rectum of the\r\nparabola) is given by the celebrated Landau–Pekar formula. In particular, it diverges as α4 for large coupling constant α."}],"volume":140,"file_date_updated":"2025-01-13T08:13:42Z"},{"acknowledgement":"Funding Sources ─ A.I.F.T.-M. and G.Á.-P. acknowledge support through the Severo Ochoa program from the Government of the Principality of Asturias (references PA-21-PF-BP20-117 and PA20-PF-BP19-053, respectively). A.B.K. and J.T.-G. acknowledge support from the Swiss National Science Foundation (grant # 200020_201096). J.M.-S. acknowledges financial support from the Ramón y Cajal Program of the Government of Spain and FSE (RYC2018-026196-I), the Spanish Ministry of Science and Innovation (State Plan for Scientific and Technical Research and Innovation grant number PID2019-110308GA-I00/AEI/10.13039/501100011033) and project PCI2022-132953 funded by MCIN/AEI/10.13039/501100011033 and the EU “NextGenerationEU”/PRTR”. P.A.-G. acknowledges support from the European Research Council under starting grant no. 715496, 2DNANOPTICA and the Spanish Ministry of Science and Innovation (State Plan for Scientific and Technical Research and Innovation grant number PID2019-111156GB-I00). A.Y.N. acknowledges the Spanish Ministry of Science and Innovation (grant PID2020-115221GB-C42) and the Basque Department of Education (grant PIBA-2023-1-0007). M.V. and J.I.M. acknowledge support by Spanish MCIN/AEI/10.13039/501100011033/FEDER, UE under grant PID2022-136784NB and by Asturias FICYT under grant AYUD/2021/51185 with the support of FEDER funds. I.E. acknowledges funding from the Spanish Ministry of Science and Innovation (Grant No. PID2022-142861NA-I00) and the Department of Education, Universities, and Research of the Eusko Jaurlaritza and the University of the Basque Country UPV/EHU (Grant No. IT1527-22). J. Duan acknowledges the support from the Beijing Natural Science Foundation (Grant No. Z240005), and National Natural Science Foundation of China.","publication_identifier":{"eissn":["2330-4022"]},"_id":"17479","date_created":"2024-09-01T22:01:09Z","doi":"10.1021/acsphotonics.4c00485","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"09","citation":{"apa":"Taboada-Gutiérrez, J., Zhou, Y., Tresguerres-Mata, A. I. F., Lanza, C., Martínez-Suárez, A., Álvarez-Pérez, G., … Alonso-González, P. (2024). Unveiling the mechanism of phonon-polariton damping in α‑MoO3. <i>ACS Photonics</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsphotonics.4c00485\">https://doi.org/10.1021/acsphotonics.4c00485</a>","ista":"Taboada-Gutiérrez J, Zhou Y, Tresguerres-Mata AIF, Lanza C, Martínez-Suárez A, Álvarez-Pérez G, Duan J, Martín JI, Vélez M, Prieto Gonzalez I, Bercher A, Teyssier J, Errea I, Nikitin AY, Martín-Sánchez J, Kuzmenko AB, Alonso-González P. 2024. Unveiling the mechanism of phonon-polariton damping in α‑MoO3. ACS Photonics. 11(9), 3570–3577.","chicago":"Taboada-Gutiérrez, Javier, Yixi Zhou, Ana I.F. Tresguerres-Mata, Christian Lanza, Abel Martínez-Suárez, Gonzalo Álvarez-Pérez, Jiahua Duan, et al. “Unveiling the Mechanism of Phonon-Polariton Damping in Α‑MoO3.” <i>ACS Photonics</i>. American Chemical Society, 2024. <a href=\"https://doi.org/10.1021/acsphotonics.4c00485\">https://doi.org/10.1021/acsphotonics.4c00485</a>.","ama":"Taboada-Gutiérrez J, Zhou Y, Tresguerres-Mata AIF, et al. Unveiling the mechanism of phonon-polariton damping in α‑MoO3. <i>ACS Photonics</i>. 2024;11(9):3570-3577. doi:<a href=\"https://doi.org/10.1021/acsphotonics.4c00485\">10.1021/acsphotonics.4c00485</a>","ieee":"J. Taboada-Gutiérrez <i>et al.</i>, “Unveiling the mechanism of phonon-polariton damping in α‑MoO3,” <i>ACS Photonics</i>, vol. 11, no. 9. American Chemical Society, pp. 3570–3577, 2024.","mla":"Taboada-Gutiérrez, Javier, et al. “Unveiling the Mechanism of Phonon-Polariton Damping in Α‑MoO3.” <i>ACS Photonics</i>, vol. 11, no. 9, American Chemical Society, 2024, pp. 3570–77, doi:<a href=\"https://doi.org/10.1021/acsphotonics.4c00485\">10.1021/acsphotonics.4c00485</a>.","short":"J. Taboada-Gutiérrez, Y. Zhou, A.I.F. Tresguerres-Mata, C. Lanza, A. Martínez-Suárez, G. Álvarez-Pérez, J. Duan, J.I. Martín, M. Vélez, I. Prieto Gonzalez, A. Bercher, J. Teyssier, I. Errea, A.Y. Nikitin, J. Martín-Sánchez, A.B. Kuzmenko, P. Alonso-González, ACS Photonics 11 (2024) 3570–3577."},"scopus_import":"1","OA_place":"publisher","quality_controlled":"1","language":[{"iso":"eng"}],"issue":"9","oa_version":"Published Version","oa":1,"department":[{"_id":"NanoFab"}],"volume":11,"publication":"ACS Photonics","abstract":[{"lang":"eng","text":"Phonon polaritons (PhPs), light coupled to lattice vibrations, in the highly anisotropic polar layered material molybdenum trioxide (α-MoO3) are currently the focus of intense research efforts due to their extreme subwavelength field confinement, directional propagation, and unprecedented low losses. Nevertheless, prior research has primarily concentrated on exploiting the squeezing and steering capabilities of α-MoO3 PhPs, without inquiring much into the dominant microscopic mechanism that determines their long lifetimes, which is key for their implementation in nanophotonic applications. This study delves into the fundamental processes that govern PhP damping in α-MoO3 by combining ab initio calculations with scattering-type scanning near-field optical microscopy (s-SNOM) and Fourier transform infrared (FTIR) spectroscopy measurements across a broad temperature range (8–300 K). The remarkable agreement between our theoretical predictions and experimental observations allows us to identify third-order anharmonic phonon–phonon scattering as the main damping mechanism of α-MoO3 PhPs. These findings shed light on the fundamental limits of low-loss PhPs, which is a crucial factor for assessing their implementation into nanophotonic devices."}],"file_date_updated":"2025-01-09T14:01:06Z","title":"Unveiling the mechanism of phonon-polariton damping in α‑MoO3","arxiv":1,"external_id":{"isi":["001298164600001"],"pmid":["39310295"],"arxiv":["2408.09811"]},"article_processing_charge":"No","page":"3570-3577","pmid":1,"publication_status":"published","status":"public","date_updated":"2025-09-08T09:05:01Z","article_type":"original","publisher":"American Chemical Society","year":"2024","day":"01","file":[{"success":1,"file_name":"2024_ACSPhotonics_TaboadaGutierrez_.pdf","file_id":"18819","creator":"dernst","content_type":"application/pdf","date_updated":"2025-01-09T14:01:06Z","file_size":2664512,"date_created":"2025-01-09T14:01:06Z","relation":"main_file","checksum":"bd7e6a138c406e93eaf0a6268fc42bfe","access_level":"open_access"}],"OA_type":"hybrid","date_published":"2024-09-01T00:00:00Z","ddc":["530"],"author":[{"full_name":"Taboada-Gutiérrez, Javier","last_name":"Taboada-Gutiérrez","first_name":"Javier"},{"full_name":"Zhou, Yixi","last_name":"Zhou","first_name":"Yixi"},{"full_name":"Tresguerres-Mata, Ana I.F.","last_name":"Tresguerres-Mata","first_name":"Ana I.F."},{"last_name":"Lanza","first_name":"Christian","full_name":"Lanza, Christian"},{"first_name":"Abel","last_name":"Martínez-Suárez","full_name":"Martínez-Suárez, Abel"},{"full_name":"Álvarez-Pérez, Gonzalo","first_name":"Gonzalo","last_name":"Álvarez-Pérez"},{"full_name":"Duan, Jiahua","last_name":"Duan","first_name":"Jiahua"},{"full_name":"Martín, José Ignacio","last_name":"Martín","first_name":"José Ignacio"},{"last_name":"Vélez","first_name":"María","full_name":"Vélez, María"},{"orcid":"0000-0002-7370-5357","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","full_name":"Prieto Gonzalez, Ivan","last_name":"Prieto Gonzalez","first_name":"Ivan"},{"full_name":"Bercher, Adrien","first_name":"Adrien","last_name":"Bercher"},{"full_name":"Teyssier, Jérémie","first_name":"Jérémie","last_name":"Teyssier"},{"full_name":"Errea, Ion","first_name":"Ion","last_name":"Errea"},{"full_name":"Nikitin, Alexey Y.","first_name":"Alexey Y.","last_name":"Nikitin"},{"first_name":"Javier","last_name":"Martín-Sánchez","full_name":"Martín-Sánchez, Javier"},{"first_name":"Alexey B.","last_name":"Kuzmenko","full_name":"Kuzmenko, Alexey B."},{"full_name":"Alonso-González, Pablo","first_name":"Pablo","last_name":"Alonso-González"}],"intvolume":"        11","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1"},{"author":[{"last_name":"Karimi","first_name":"Bayan","full_name":"Karimi, Bayan"},{"full_name":"Steffensen, Gorm Ole","first_name":"Gorm Ole","last_name":"Steffensen"},{"orcid":"0000-0003-2607-2363","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","full_name":"Higginbotham, Andrew P","last_name":"Higginbotham","first_name":"Andrew P"},{"last_name":"Marcus","first_name":"Charles M.","full_name":"Marcus, Charles M."},{"last_name":"Levy Yeyati","first_name":"Alfredo","full_name":"Levy Yeyati, Alfredo"},{"first_name":"Jukka P.","last_name":"Pekola","full_name":"Pekola, Jukka P."}],"OA_type":"hybrid","date_published":"2024-11-01T00:00:00Z","ddc":["530"],"has_accepted_license":"1","intvolume":"        19","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"date_updated":"2026-06-03T07:16:01Z","article_type":"original","publisher":"Springer Nature","publication_status":"published","status":"public","file":[{"access_level":"open_access","checksum":"8b067ef217ddef63c539ecdfe705ab95","date_created":"2025-01-09T13:51:12Z","relation":"main_file","content_type":"application/pdf","date_updated":"2025-01-09T13:51:12Z","file_size":3047567,"creator":"dernst","file_id":"18818","file_name":"2024_NatureNanotechnology_Karimi.pdf","success":1}],"year":"2024","day":"01","title":"Bolometric detection of Josephson radiation","volume":19,"publication":"Nature Nanotechnology","abstract":[{"text":"One of the most promising approaches towards large-scale quantum computation uses devices based on many Josephson junctions. Yet, even today, open questions regarding the single junction remain unsolved, such as the detailed understanding of the quantum phase transitions, the coupling of the Josephson junction to the environment or how to improve the coherence of a superconducting qubit. Here we design and build an engineered on-chip reservoir connected to a Josephson junction that acts as an efficient bolometer for detecting the Josephson radiation under non-equilibrium, that is, biased conditions. The bolometer converts the a.c. Josephson current at microwave frequencies up to about 100 GHz into a temperature rise measured by d.c. thermometry. A circuit model based on realistic parameter values captures both the current–voltage characteristics and the measured power quantitatively. The present experiment demonstrates an efficient, wide-band, thermal detection scheme of microwave photons and provides a sensitive detector of Josephson dynamics beyond the standard conductance measurements.","lang":"eng"}],"file_date_updated":"2025-01-09T13:51:12Z","external_id":{"isi":["001296522000002"],"arxiv":["2402.09314"]},"article_processing_charge":"No","page":"1613-1618","project":[{"name":"Protected states of quantum matter","_id":"eb9b30ac-77a9-11ec-83b8-871f581d53d2"}],"arxiv":1,"type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"11","citation":{"apa":"Karimi, B., Steffensen, G. O., Higginbotham, A. P., Marcus, C. M., Levy Yeyati, A., &#38; Pekola, J. P. (2024). Bolometric detection of Josephson radiation. <i>Nature Nanotechnology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41565-024-01770-7\">https://doi.org/10.1038/s41565-024-01770-7</a>","ista":"Karimi B, Steffensen GO, Higginbotham AP, Marcus CM, Levy Yeyati A, Pekola JP. 2024. Bolometric detection of Josephson radiation. Nature Nanotechnology. 19, 1613–1618.","chicago":"Karimi, Bayan, Gorm Ole Steffensen, Andrew P Higginbotham, Charles M. Marcus, Alfredo Levy Yeyati, and Jukka P. Pekola. “Bolometric Detection of Josephson Radiation.” <i>Nature Nanotechnology</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41565-024-01770-7\">https://doi.org/10.1038/s41565-024-01770-7</a>.","ama":"Karimi B, Steffensen GO, Higginbotham AP, Marcus CM, Levy Yeyati A, Pekola JP. Bolometric detection of Josephson radiation. <i>Nature Nanotechnology</i>. 2024;19:1613-1618. doi:<a href=\"https://doi.org/10.1038/s41565-024-01770-7\">10.1038/s41565-024-01770-7</a>","mla":"Karimi, Bayan, et al. “Bolometric Detection of Josephson Radiation.” <i>Nature Nanotechnology</i>, vol. 19, Springer Nature, 2024, pp. 1613–18, doi:<a href=\"https://doi.org/10.1038/s41565-024-01770-7\">10.1038/s41565-024-01770-7</a>.","ieee":"B. Karimi, G. O. Steffensen, A. P. Higginbotham, C. M. Marcus, A. Levy Yeyati, and J. P. Pekola, “Bolometric detection of Josephson radiation,” <i>Nature Nanotechnology</i>, vol. 19. Springer Nature, pp. 1613–1618, 2024.","short":"B. Karimi, G.O. Steffensen, A.P. Higginbotham, C.M. Marcus, A. Levy Yeyati, J.P. Pekola, Nature Nanotechnology 19 (2024) 1613–1618."},"scopus_import":"1","acknowledgement":"We thank M. Möttönen, D. Subero, V. Vadimov, A. Alizadeh, C. Strunk, N. Roch, S. Kafanov, S. Kubatkin, A. Kerman and J. Peltonen for scientific discussions and Z.-Y. Chen for technical assistance. B.K. and J.P.P. acknowledge funding from the Research Council of Finland Centre of Excellence programme grant 336810 and grant 349601 (THEPOW), G.O.S. and A.L.Y. financial support from the Spanish Ministry of Science through grant TED2021-130292B-C43 funded by MCIN/AEI/10.13039/501100011033, ‘ERDF A way of making Europe’ and the EU through FET-Open project AndQC, A.P.H. support from the NOMIS Foundation, and C.M.M. support from the Danish National Research Foundation and a research grant (Project 43951) from VILLUM FONDEN. We thank the facilities and technical support of Otaniemi Research Infrastructure for Micro and Nanotechnologies (OtaNano). The funders had no role in study design, data collection and analysis, decision to publish or preparation of the paper.","_id":"17480","publication_identifier":{"issn":["1748-3387"],"eissn":["1748-3395"]},"doi":"10.1038/s41565-024-01770-7","date_created":"2024-09-01T22:01:09Z","oa_version":"Published Version","oa":1,"department":[{"_id":"AnHi"}],"OA_place":"publisher","language":[{"iso":"eng"}],"quality_controlled":"1"},{"file":[{"creator":"dernst","file_size":1348896,"date_updated":"2024-09-09T07:46:42Z","content_type":"application/pdf","relation":"main_file","date_created":"2024-09-09T07:46:42Z","checksum":"b5ad02d9abd5b4701269cd1ad0a1cc8f","access_level":"open_access","success":1,"file_name":"2024_AnnInstHPoincare_Fischer.pdf","file_id":"17923"}],"day":"24","year":"2024","article_type":"original","publisher":"EMS Press","date_updated":"2025-09-08T09:11:01Z","publication_status":"published","status":"public","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"intvolume":"        41","author":[{"last_name":"Fischer","first_name":"Julian L","orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","full_name":"Fischer, Julian L"},{"id":"25647992-AA84-11E9-9D75-8427E6697425","full_name":"Marveggio, Alice","last_name":"Marveggio","first_name":"Alice"}],"ddc":["510"],"date_published":"2024-01-24T00:00:00Z","corr_author":"1","department":[{"_id":"JuFi"}],"oa":1,"oa_version":"Published Version","quality_controlled":"1","language":[{"iso":"eng"}],"issue":"5","citation":{"ista":"Fischer JL, Marveggio A. 2024. Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase mean curvature flow. Annales de l’Institut Henri Poincare C. 41(5), 1117–1178.","apa":"Fischer, J. L., &#38; Marveggio, A. (2024). Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase mean curvature flow. <i>Annales de l’Institut Henri Poincare C</i>. EMS Press. <a href=\"https://doi.org/10.4171/AIHPC/109\">https://doi.org/10.4171/AIHPC/109</a>","mla":"Fischer, Julian L., and Alice Marveggio. “Quantitative Convergence of the Vectorial Allen–Cahn Equation towards Multiphase Mean Curvature Flow.” <i>Annales de l’Institut Henri Poincare C</i>, vol. 41, no. 5, EMS Press, 2024, pp. 1117–78, doi:<a href=\"https://doi.org/10.4171/AIHPC/109\">10.4171/AIHPC/109</a>.","ieee":"J. L. Fischer and A. Marveggio, “Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase mean curvature flow,” <i>Annales de l’Institut Henri Poincare C</i>, vol. 41, no. 5. EMS Press, pp. 1117–1178, 2024.","short":"J.L. Fischer, A. Marveggio, Annales de l’Institut Henri Poincare C 41 (2024) 1117–1178.","chicago":"Fischer, Julian L, and Alice Marveggio. “Quantitative Convergence of the Vectorial Allen–Cahn Equation towards Multiphase Mean Curvature Flow.” <i>Annales de l’Institut Henri Poincare C</i>. EMS Press, 2024. <a href=\"https://doi.org/10.4171/AIHPC/109\">https://doi.org/10.4171/AIHPC/109</a>.","ama":"Fischer JL, Marveggio A. Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase mean curvature flow. <i>Annales de l’Institut Henri Poincare C</i>. 2024;41(5):1117-1178. doi:<a href=\"https://doi.org/10.4171/AIHPC/109\">10.4171/AIHPC/109</a>"},"scopus_import":"1","type":"journal_article","month":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"eissn":["1873-1430"],"issn":["0294-1449"]},"_id":"17481","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"14597"}]},"doi":"10.4171/AIHPC/109","date_created":"2024-09-01T22:01:09Z","acknowledgement":"The authors thank Sebastian Hensel for useful and helpful commentson the first draft of this work.\r\nThis project has received funding from the European Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation programme (grant\r\nagreement no. 948819.","project":[{"grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020","name":"Bridging Scales in Random Materials"}],"article_processing_charge":"Yes","page":"1117-1178","external_id":{"isi":["001293853900003"]},"title":"Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase mean curvature flow","file_date_updated":"2024-09-09T07:46:42Z","ec_funded":1,"volume":41,"publication":"Annales de l'Institut Henri Poincare C","abstract":[{"lang":"eng","text":"Phase-field models such as the Allen–Cahn equation may give rise to the formation and evolution of geometric shapes, a phenomenon that may be analyzed rigorously in suitable scaling regimes. In its sharp-interface limit, the vectorial Allen–Cahn equation with a potential with N≥3 distinct minima has been conjectured to describe the evolution of branched interfaces by multiphase mean curvature flow. In the present work, we give a rigorous proof for this statement in two and three ambient dimensions and for a suitable class of potentials: as long as a strong solution to multiphase mean curvature flow exists, solutions to the vectorial Allen–Cahn equation with well-prepared initial data converge towards multiphase mean curvature flow in the limit of vanishing interface width parameter ε↘0. We even establish the rate of convergence O(ε \r\n1/2\r\n ). Our approach is based on the gradient-flow structure of the Allen–Cahn equation and its limiting motion: building on the recent concept of “gradient-flow calibrations” for multiphase mean curvature flow, we introduce a notion of relative entropy for the vectorial Allen–Cahn equation with multi-well potential. This enables us to overcome the limitations of other approaches, e.g. avoiding the need for a stability analysis of the Allen–Cahn operator or additional convergence hypotheses for the energy at positive times."}]},{"supervisor":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"}],"page":"129","article_processing_charge":"No","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"title":"Compressing large neural networks : Algorithms, systems and scaling laws","alternative_title":["ISTA Thesis"],"ec_funded":1,"abstract":[{"lang":"eng","text":"Large language models (LLMs) have made tremendous progress in the past few years, from being able to generate coherent text to matching or surpassing humans in a wide variety of creative, knowledge or reasoning tasks. Much of this can be attributed to massively increased scale, both in the size of the model as well as the amount of training data, from 100s of millions to 100s of billions, or even trillions. This trend is expected to continue, which, although exciting, also raises major practical concerns. Already today's 100+ billion parameter LLMs require top-of-the-line hardware just to run. Hence, it is clear that sustaining these developments will require significant efficiency advances.\r\n\r\nHistorically, one of the most practical ways of improving model efficiency has been compression, especially in the form of sparsity or quantization. While this has been studied extensively in the past, existing accurate methods are all designed for models around 100 million parameters; scaling them up to ones literally 1000x larger is highly challenging. In this thesis, we introduce a new unified sparsification and quantization approach OBC, which through additional algorithmic enhancements leads to GPTQ and SparseGPT, the first techniques fast and accurate enough to compress 100+ billion parameter models to 4- or even 3-bit precision and 50% weight-sparsity, respectively. Additionally, we show how weight-only quantizion does not just bring space savings but also up to 4.5x faster generation speed, via custom GPU kernels.\r\n\r\nIn fact, we show for the first time that it is possible to develop an FP16 times INT4 mixed-precision matrix multiplication kernel, called Marlin, which comes close to simultaneously maximizing both memory and compute utilization, making weight-only quantization highly practical even for multi-user serving. Further, we demonstrate that GPTQ can be scaled to widely overparametrized trillion-parameter models, where extreme sub-1-bit compression rates can be achieved without any inference slow-down, by co-designing a bespoke entropy coding scheme together with an efficient kernel.\r\n\r\nFinally, we also study compression from the perspective of someone with access to massive amounts of compute resources for training large models completely from scratch. Here the key questions evolve around the joint scaling behavior between compression, model size, and amount of training data used. Based on extensive experimental results for both vision and text models, we introduce the first scaling law which accurately captures the relationship between weight-sparsity, number of non-zero weights and data. This further allows us to characterize the optimal sparsity, which we find to increase the longer a fixed cost model is being trained.\r\n\r\nOverall, this thesis presents contributions to three different angles of large model efficiency: affordable but accurate algorithms, highly efficient systems implementations, and fundamental scaling laws for compressed training."}],"file_date_updated":"2024-09-06T16:24:59Z","oa_version":"Published Version","oa":1,"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"OA_place":"publisher","language":[{"iso":"eng"}],"type":"dissertation","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"09","citation":{"ista":"Frantar E. 2024. Compressing large neural networks : Algorithms, systems and scaling laws. Institute of Science and Technology Austria.","apa":"Frantar, E. (2024). <i>Compressing large neural networks : Algorithms, systems and scaling laws</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17485\">https://doi.org/10.15479/at:ista:17485</a>","short":"E. Frantar, Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws, Institute of Science and Technology Austria, 2024.","ieee":"E. Frantar, “Compressing large neural networks : Algorithms, systems and scaling laws,” Institute of Science and Technology Austria, 2024.","mla":"Frantar, Elias. <i>Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17485\">10.15479/at:ista:17485</a>.","ama":"Frantar E. Compressing large neural networks : Algorithms, systems and scaling laws. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17485\">10.15479/at:ista:17485</a>","chicago":"Frantar, Elias. “Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17485\">https://doi.org/10.15479/at:ista:17485</a>."},"degree_awarded":"PhD","_id":"17485","publication_identifier":{"issn":["2663-337X"]},"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"17378"},{"id":"17087","relation":"part_of_dissertation","status":"public"},{"id":"14458","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"18061"},{"id":"18062","relation":"part_of_dissertation","status":"public"}]},"doi":"10.15479/at:ista:17485","date_created":"2024-09-02T11:01:48Z","has_accepted_license":"1","author":[{"first_name":"Elias","last_name":"Frantar","full_name":"Frantar, Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"}],"corr_author":"1","ddc":["000"],"date_published":"2024-09-05T00:00:00Z","file":[{"creator":"efrantar","file_size":1615167,"content_type":"application/zip","date_updated":"2024-09-05T12:04:11Z","date_created":"2024-09-05T12:04:11Z","checksum":"5d785645805a78c5b4ce7cc3df557b09","relation":"source_file","access_level":"closed","file_name":"thesis-final.zip","file_id":"17570"},{"success":1,"file_id":"17880","file_name":"frantar_thesis_final.pdf","file_size":2376611,"date_updated":"2024-09-06T16:24:59Z","content_type":"application/pdf","creator":"efrantar","access_level":"open_access","relation":"main_file","date_created":"2024-09-06T16:24:59Z","checksum":"a9dd1c2d23734986924eb44ebb55fd8f"}],"year":"2024","day":"05","date_updated":"2026-06-18T17:58:39Z","publisher":"Institute of Science and Technology Austria","publication_status":"published","status":"public"},{"oa_version":"Published Version","oa":1,"file":[{"date_updated":"2024-09-03T17:39:32Z","content_type":"application/x-zip-compressed","file_size":965778072,"creator":"rsatapat","access_level":"open_access","date_created":"2024-09-03T17:39:32Z","relation":"main_file","checksum":"df9d6c8ddffa046c3b1639281f83cfcf","success":1,"file_id":"17489","file_name":"BehaviouralData.zip"}],"department":[{"_id":"GradSch"},{"_id":"MaJö"}],"year":"2024","month":"09","date_updated":"2026-06-10T07:58:35Z","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","type":"research_data","citation":{"apa":"Satapathy, R. K., Jösch, M. A., Symonova, O., &#38; Pokusaeva, V. (2024). Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:17488\">https://doi.org/10.15479/AT:ISTA:17488</a>","ista":"Satapathy RK, Jösch MA, Symonova O, Pokusaeva V. 2024. Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:17488\">10.15479/AT:ISTA:17488</a>.","chicago":"Satapathy, Roshan K, Maximilian A Jösch, Olga Symonova, and Victoria Pokusaeva. “Bilateral Interactions of Optic-Flow Sensitive Neurons Coordinate Course Control in Flies.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/AT:ISTA:17488\">https://doi.org/10.15479/AT:ISTA:17488</a>.","ama":"Satapathy RK, Jösch MA, Symonova O, Pokusaeva V. Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies. 2024. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:17488\">10.15479/AT:ISTA:17488</a>","ieee":"R. K. Satapathy, M. A. Jösch, O. Symonova, and V. Pokusaeva, “Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies.” Institute of Science and Technology Austria, 2024.","mla":"Satapathy, Roshan K., et al. <i>Bilateral Interactions of Optic-Flow Sensitive Neurons Coordinate Course Control in Flies</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:17488\">10.15479/AT:ISTA:17488</a>.","short":"R.K. Satapathy, M.A. Jösch, O. Symonova, V. Pokusaeva, (2024)."},"publisher":"Institute of Science and Technology Austria","doi":"10.15479/AT:ISTA:17488","status":"public","date_created":"2024-09-03T17:42:46Z","related_material":{"record":[{"id":"18444","relation":"used_in_publication","status":"public"}]},"_id":"17488","article_processing_charge":"No","keyword":["drosophila","behaviour","locomotion","gap junctions"],"project":[{"_id":"9B767A34-BA93-11EA-9121-9846C619BF3A","grant_number":"429960716","name":"Evolution of Sensorimotor Transformation Across Diptera"}],"has_accepted_license":"1","acknowledged_ssus":[{"_id":"M-Shop"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"title":"Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies","author":[{"last_name":"Satapathy","first_name":"Roshan K","id":"46046B7A-F248-11E8-B48F-1D18A9856A87","full_name":"Satapathy, Roshan K","orcid":"0009-0006-2974-5075"},{"orcid":"0000-0002-3937-1330","full_name":"Jösch, Maximilian A","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","first_name":"Maximilian A","last_name":"Jösch"},{"orcid":"0000-0003-2012-9947","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","full_name":"Symonova, Olga","last_name":"Symonova","first_name":"Olga"},{"last_name":"Pokusaeva","first_name":"Victoria","id":"3184041C-F248-11E8-B48F-1D18A9856A87","full_name":"Pokusaeva, Victoria","orcid":"0000-0001-7660-444X"}],"abstract":[{"lang":"eng","text":"Behavioural data for Pokusaeva, Satapathy et al. Relevant information can be found in the 'README.txt' file."}],"corr_author":"1","file_date_updated":"2024-09-03T17:39:32Z","ddc":["570"],"date_published":"2024-09-01T00:00:00Z"},{"file":[{"creator":"imarkov","date_updated":"2024-09-04T08:35:35Z","content_type":"application/x-zip-compressed","file_size":43327753,"date_created":"2024-09-04T08:35:35Z","relation":"source_file","checksum":"77609f4835d2730e46fa0d42d9134ed9","access_level":"closed","file_name":"Thesis.zip","file_id":"17491"},{"success":1,"file_name":"Thesis_final_version_pdfa2.pdf","file_id":"17492","creator":"imarkov","content_type":"application/pdf","date_updated":"2024-09-04T08:36:06Z","file_size":2756082,"checksum":"9e68f7217570f756ceb8f70b980938cd","relation":"main_file","date_created":"2024-09-04T08:36:06Z","access_level":"open_access"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","year":"2024","day":"04","date_updated":"2026-06-18T17:55:23Z","publisher":"Institute of Science and Technology Austria","publication_status":"published","status":"public","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"author":[{"first_name":"Ilia","last_name":"Markov","full_name":"Markov, Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"}],"corr_author":"1","date_published":"2024-09-04T00:00:00Z","ddc":["000"],"oa_version":"Published Version","oa":1,"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"OA_place":"publisher","language":[{"iso":"eng"}],"type":"dissertation","month":"09","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"chicago":"Markov, Ilia. “Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17490\">https://doi.org/10.15479/at:ista:17490</a>.","ama":"Markov I. Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17490\">10.15479/at:ista:17490</a>","ieee":"I. Markov, “Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective,” Institute of Science and Technology Austria, 2024.","mla":"Markov, Ilia. <i>Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17490\">10.15479/at:ista:17490</a>.","short":"I. Markov, Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective, Institute of Science and Technology Austria, 2024.","apa":"Markov, I. (2024). <i>Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17490\">https://doi.org/10.15479/at:ista:17490</a>","ista":"Markov I. 2024. Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective. Institute of Science and Technology Austria."},"degree_awarded":"PhD","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"14461"},{"status":"public","relation":"part_of_dissertation","id":"12780"},{"id":"17456","status":"public","relation":"part_of_dissertation"}]},"_id":"17490","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/at:ista:17490","date_created":"2024-09-04T08:51:11Z","supervisor":[{"first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"page":"102","article_processing_charge":"No","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"title":"Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective","alternative_title":["ISTA Thesis"],"ec_funded":1,"abstract":[{"lang":"eng","text":"Deep learning is essential in numerous applications nowadays, with many recent advancements made possible by training very large models. Despite their broad applicability, training neural networks is often time-intensive, and it is usually impractical to manage large models and datasets on a single machine. To address these issues, distributed deep learning training has become increasingly important. However, distributed training requires synchronization among nodes, and the mini-batch stochastic gradient descent algorithm places a significant load on network connections. A possible solution to tackle the synchronization bottleneck is to reduce a message size by lossy compression.\r\n\r\nIn this thesis, we investigate systems and algorithmic approaches to communication compression during training. From the systems perspective, we demonstrate that a common approach of expensive hardware overprovisioning can be replaced through a thorough system design. We introduce a framework that introduces efficient software support for compressed communication in machine learning applications, applicable to both multi-GPU single-node training and larger-scale multi-node training. Our framework integrates with popular ML frameworks, providing up to 3x speedups for multi-GPU nodes based on commodity hardware and order-of-magnitude improvements in the multi-node setting, with negligible impact on accuracy.\r\n\r\nAlso, we consider an application of our framework to different communication schemes, such as Fully Sharded Data Parallel. We provide strong convergence guarantees for the compression in such a setup. Empirical validation shows that our method preserves model accuracy for GPT-family models with up to 1.3 billion parameters, while completely removing the communication bottlenecks of non-compressed alternatives, providing up to 2.2x speedups end-to-end.\r\n\r\nFrom the algorithmic side, we propose a general framework that dynamically adjusts the degree of compression across a model's layers during training. This approach enhances overall compression and results in significant speedups without compromising accuracy. Our algorithm utilizes an adaptive algorithm that automatically selects the optimal compression parameters for model layers, ensuring the best compression ratio while adhering to an error constraint. Our method is effective across all existing families of compression methods. It achieves up to 2.5x faster training and up to a 5x improvement in compression compared to efficient implementations of current approaches. Additionally, LGreCo can complement existing adaptive algorithms.\r\n"}],"file_date_updated":"2024-09-04T08:36:06Z"},{"article_number":"031035","title":"Many-body entropies and entanglement from polynomially many local measurements","file_date_updated":"2024-09-05T09:39:00Z","abstract":[{"text":"Estimating global properties of many-body quantum systems such as entropy or bipartite entanglement is a notoriously difficult task, typically requiring a number of measurements or classical postprocessing resources growing exponentially in the system size. In this work, we address the problem of estimating global entropies and mixed-state entanglement via partial-transposed (PT) moments and show that efficient estimation strategies exist under the assumption that all the spatial correlation lengths are finite. Focusing on one-dimensional systems, we identify a set of approximate factorization conditions (AFCs) on the system density matrix, which allow us to reconstruct entropies and PT moments from information on local subsystems. This identification yields a simple and efficient strategy for entropy and entanglement estimation. Our method could be implemented in different ways, depending on how information on local subsystems is extracted. Focusing on randomized measurements providing a practical and common measurement scheme, we prove that our protocol requires only polynomially many measurements and postprocessing operations, assuming that the state to be measured satisfies the AFCs. We prove that the AFCs hold for finite-depth quantum-circuit states and translation-invariant matrix-product density operators and provide numerical evidence that they are satisfied in more general, physically interesting cases, including thermal states of local Hamiltonians. We argue that our method could be practically useful to detect bipartite mixed-state entanglement for large numbers of qubits available in today’s quantum platforms.","lang":"eng"}],"publication":"Physical Review X","ec_funded":1,"volume":14,"project":[{"grant_number":"850899","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","call_identifier":"H2020"}],"article_processing_charge":"Yes","external_id":{"arxiv":["2311.08108"],"isi":["001299667100002"]},"arxiv":1,"scopus_import":"1","citation":{"apa":"Vermersch, B., Ljubotina, M., Cirac, J. I., Zoller, P., Serbyn, M., &#38; Piroli, L. (2024). Many-body entropies and entanglement from polynomially many local measurements. <i>Physical Review X</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevx.14.031035\">https://doi.org/10.1103/physrevx.14.031035</a>","ista":"Vermersch B, Ljubotina M, Cirac JI, Zoller P, Serbyn M, Piroli L. 2024. Many-body entropies and entanglement from polynomially many local measurements. Physical Review X. 14(3), 031035.","ama":"Vermersch B, Ljubotina M, Cirac JI, Zoller P, Serbyn M, Piroli L. Many-body entropies and entanglement from polynomially many local measurements. <i>Physical Review X</i>. 2024;14(3). doi:<a href=\"https://doi.org/10.1103/physrevx.14.031035\">10.1103/physrevx.14.031035</a>","chicago":"Vermersch, Benoît, Marko Ljubotina, J. Ignacio Cirac, Peter Zoller, Maksym Serbyn, and Lorenzo Piroli. “Many-Body Entropies and Entanglement from Polynomially Many Local Measurements.” <i>Physical Review X</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/physrevx.14.031035\">https://doi.org/10.1103/physrevx.14.031035</a>.","short":"B. Vermersch, M. Ljubotina, J.I. Cirac, P. Zoller, M. Serbyn, L. Piroli, Physical Review X 14 (2024).","ieee":"B. Vermersch, M. Ljubotina, J. I. Cirac, P. Zoller, M. Serbyn, and L. Piroli, “Many-body entropies and entanglement from polynomially many local measurements,” <i>Physical Review X</i>, vol. 14, no. 3. American Physical Society, 2024.","mla":"Vermersch, Benoît, et al. “Many-Body Entropies and Entanglement from Polynomially Many Local Measurements.” <i>Physical Review X</i>, vol. 14, no. 3, 031035, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/physrevx.14.031035\">10.1103/physrevx.14.031035</a>."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"08","type":"journal_article","doi":"10.1103/physrevx.14.031035","date_created":"2024-09-04T18:57:11Z","_id":"17493","publication_identifier":{"issn":["2160-3308"]},"acknowledgement":"B. V. acknowledges funding from the Austrian Science Foundation (Grant No. FWF, P 32597 N), from the French National Research Agency via the JCJC project QRand (Grant No. ANR-20-CE47-0005), and via the research programs Plan France 2030 EPIQ (Grant No. ANR-22-PETQ-0007), QUBITAF (Grant No. ANR-22-PETQ-0004), and HQI (Grant No. ANR-22-PNCQ-0002). M. L. and M. S. acknowledge support by the European Research Council under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 850899). M. S. acknowledges the hospitality of KITP supported in part by the National Science Foundation under Grants No. NSF PHY-1748958 and No. NSF PHY-2309135. J. I. C. is supported by the Hightech Agenda Bayern Plus through the Munich Quantum Valley and the German Federal Ministry of Education and Research through EQUAHUMO (Grant No. 13N16066). P. Z. acknowledges funding from the European Union’s Horizon 2020 research and innovation program under Grant Agreement No. 101113690 (PASQuanS2.1).","department":[{"_id":"MaSe"}],"DOAJ_listed":"1","oa_version":"Published Version","oa":1,"issue":"3","quality_controlled":"1","language":[{"iso":"eng"}],"OA_place":"publisher","author":[{"full_name":"Vermersch, Benoît","last_name":"Vermersch","first_name":"Benoît"},{"orcid":"0000-0003-0038-7068","full_name":"Ljubotina, Marko","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","first_name":"Marko","last_name":"Ljubotina"},{"last_name":"Cirac","first_name":"J. Ignacio","full_name":"Cirac, J. Ignacio"},{"first_name":"Peter","last_name":"Zoller","full_name":"Zoller, Peter"},{"last_name":"Serbyn","first_name":"Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","full_name":"Serbyn, Maksym"},{"full_name":"Piroli, Lorenzo","first_name":"Lorenzo","last_name":"Piroli"}],"ddc":["530"],"date_published":"2024-08-26T00:00:00Z","APC_amount":"4863,6 EUR","OA_type":"gold","has_accepted_license":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"intvolume":"        14","publisher":"American Physical Society","article_type":"original","date_updated":"2025-09-08T09:04:14Z","status":"public","publication_status":"published","file":[{"success":1,"file_id":"17532","file_name":"2024_PhysRevX_Vermersch.pdf","date_updated":"2024-09-05T09:39:00Z","content_type":"application/pdf","file_size":1408836,"creator":"cchlebak","access_level":"open_access","relation":"main_file","date_created":"2024-09-05T09:39:00Z","checksum":"1b114acc89025120727200681e4e9074"}],"day":"26","year":"2024"},{"article_type":"letter_note","publisher":"Taylor & Francis","date_updated":"2026-06-18T17:56:59Z","status":"public","pmid":1,"publication_status":"published","day":"01","year":"2024","author":[{"full_name":"Bravo, Jack Peter Kelly","id":"96aecfa5-8931-11ee-af30-aa6a5d6eee0e","orcid":"0000-0003-0456-0753","first_name":"Jack Peter Kelly","last_name":"Bravo"}],"date_published":"2024-10-01T00:00:00Z","ddc":["570"],"OA_type":"free access","corr_author":"1","has_accepted_license":"1","isi":1,"intvolume":"        19","scopus_import":"1","citation":{"apa":"Bravo, J. P. K. (2024). Anti-plasmid immunity: A key to pathogen success? <i>Future Microbiology</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/17460913.2024.2389720\">https://doi.org/10.1080/17460913.2024.2389720</a>","ista":"Bravo JPK. 2024. Anti-plasmid immunity: A key to pathogen success? Future Microbiology. 19(15), 1269–1272.","ama":"Bravo JPK. Anti-plasmid immunity: A key to pathogen success? <i>Future Microbiology</i>. 2024;19(15):1269-1272. doi:<a href=\"https://doi.org/10.1080/17460913.2024.2389720\">10.1080/17460913.2024.2389720</a>","chicago":"Bravo, Jack Peter Kelly. “Anti-Plasmid Immunity: A Key to Pathogen Success?” <i>Future Microbiology</i>. Taylor &#38; Francis, 2024. <a href=\"https://doi.org/10.1080/17460913.2024.2389720\">https://doi.org/10.1080/17460913.2024.2389720</a>.","short":"J.P.K. Bravo, Future Microbiology 19 (2024) 1269–1272.","ieee":"J. P. K. Bravo, “Anti-plasmid immunity: A key to pathogen success?,” <i>Future Microbiology</i>, vol. 19, no. 15. Taylor &#38; Francis, pp. 1269–1272, 2024.","mla":"Bravo, Jack Peter Kelly. “Anti-Plasmid Immunity: A Key to Pathogen Success?” <i>Future Microbiology</i>, vol. 19, no. 15, Taylor &#38; Francis, 2024, pp. 1269–72, doi:<a href=\"https://doi.org/10.1080/17460913.2024.2389720\">10.1080/17460913.2024.2389720</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","type":"journal_article","doi":"10.1080/17460913.2024.2389720","date_created":"2024-09-05T07:32:00Z","publication_identifier":{"eissn":["1746-0921"],"issn":["1746-0913"]},"_id":"17494","main_file_link":[{"url":"https://doi.org/10.1080/17460913.2024.2389720","open_access":"1"}],"acknowledgement":"I would like to thank K Kiernan for insightful comments and feedback. J P K Bravo is supported by IST Austria.","department":[{"_id":"JaBr"}],"oa_version":"Published Version","oa":1,"issue":"15","quality_controlled":"1","language":[{"iso":"eng"}],"OA_place":"publisher","title":"Anti-plasmid immunity: A key to pathogen success?","publication":"Future Microbiology","volume":19,"page":"1269-1272","external_id":{"pmid":["39230568"],"isi":["001306115400001"]},"article_processing_charge":"No"},{"intvolume":"         8","extern":"1","date_published":"2024-06-20T00:00:00Z","author":[{"first_name":"Lennard","last_name":"Gäher","full_name":"Gäher, Lennard"},{"last_name":"Sammler","first_name":"Michael Joachim","id":"510d3901-2a03-11ee-914d-d9ae9011f0a7","full_name":"Sammler, Michael Joachim"},{"first_name":"Ralf","last_name":"Jung","full_name":"Jung, Ralf"},{"last_name":"Krebbers","first_name":"Robbert","full_name":"Krebbers, Robbert"},{"last_name":"Dreyer","first_name":"Derek","full_name":"Dreyer, Derek"}],"year":"2024","day":"20","status":"public","publication_status":"published","date_updated":"2024-09-10T07:16:49Z","publisher":"Association for Computing Machinery","article_type":"original","page":"1115-1139","article_processing_charge":"No","abstract":[{"text":"Rust is a modern systems programming language whose ownership-based type system statically guarantees memory safety, making it particularly well-suited to the domain of safety-critical systems. In recent years, a wellspring of automated deductive verification tools have emerged for establishing functional correctness of Rust code. However, none of the previous tools produce foundational proofs (machine-checkable in a general-purpose proof assistant), and all of them are restricted to the safe fragment of Rust. This is a problem because the vast majority of Rust programs make use of unsafe code at critical points, such as in the implementation of widely-used APIs. We propose RefinedRust, a refinement type system—proven sound in the Coq proof assistant—with the goal of establishing foundational semi-automated functional correctness verification of both safe and unsafe Rust code. We have developed a prototype verification tool implementing RefinedRust. Our tool translates Rust code (with user annotations) into a model of Rust embedded in Coq, and then checks its adherence to the RefinedRust type system using separation logic automation in Coq. All proofs generated by RefinedRust are checked by the Coq proof assistant, so the automation and type system do not have to be trusted. We evaluate the effectiveness of RefinedRust by verifying a variant of Rust’s Vec implementation that involves intricate reasoning about unsafe pointer-manipulating code.","lang":"eng"}],"publication":"Proceedings of the ACM on Programming Languages","volume":8,"title":"RefinedRust: A type system for high-assurance verification of rust programs","issue":"PLDI","language":[{"iso":"eng"}],"quality_controlled":"1","oa":1,"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3656422"}],"date_created":"2024-09-05T07:52:27Z","doi":"10.1145/3656422","_id":"17495","publication_identifier":{"issn":["2475-1421"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"06","type":"journal_article","scopus_import":"1","citation":{"apa":"Gäher, L., Sammler, M. J., Jung, R., Krebbers, R., &#38; Dreyer, D. (2024). RefinedRust: A type system for high-assurance verification of rust programs. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3656422\">https://doi.org/10.1145/3656422</a>","ista":"Gäher L, Sammler MJ, Jung R, Krebbers R, Dreyer D. 2024. RefinedRust: A type system for high-assurance verification of rust programs. Proceedings of the ACM on Programming Languages. 8(PLDI), 1115–1139.","ama":"Gäher L, Sammler MJ, Jung R, Krebbers R, Dreyer D. RefinedRust: A type system for high-assurance verification of rust programs. <i>Proceedings of the ACM on Programming Languages</i>. 2024;8(PLDI):1115-1139. doi:<a href=\"https://doi.org/10.1145/3656422\">10.1145/3656422</a>","chicago":"Gäher, Lennard, Michael Joachim Sammler, Ralf Jung, Robbert Krebbers, and Derek Dreyer. “RefinedRust: A Type System for High-Assurance Verification of Rust Programs.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3656422\">https://doi.org/10.1145/3656422</a>.","short":"L. Gäher, M.J. Sammler, R. Jung, R. Krebbers, D. Dreyer, Proceedings of the ACM on Programming Languages 8 (2024) 1115–1139.","ieee":"L. Gäher, M. J. Sammler, R. Jung, R. Krebbers, and D. Dreyer, “RefinedRust: A type system for high-assurance verification of rust programs,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 8, no. PLDI. Association for Computing Machinery, pp. 1115–1139, 2024.","mla":"Gäher, Lennard, et al. “RefinedRust: A Type System for High-Assurance Verification of Rust Programs.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 8, no. PLDI, Association for Computing Machinery, 2024, pp. 1115–39, doi:<a href=\"https://doi.org/10.1145/3656422\">10.1145/3656422</a>."}},{"oa_version":"Published Version","oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"issue":"PLDI","citation":{"ieee":"S. Spies, L. Gäher, M. J. Sammler, and D. Dreyer, “Quiver: Guided abductive inference of separation logic specifications in coq,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 8, no. PLDI. Association for Computing Machinery, pp. 889–913, 2024.","mla":"Spies, Simon, et al. “Quiver: Guided Abductive Inference of Separation Logic Specifications in Coq.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 8, no. PLDI, Association for Computing Machinery, 2024, pp. 889–913, doi:<a href=\"https://doi.org/10.1145/3656413\">10.1145/3656413</a>.","short":"S. Spies, L. Gäher, M.J. Sammler, D. Dreyer, Proceedings of the ACM on Programming Languages 8 (2024) 889–913.","chicago":"Spies, Simon, Lennard Gäher, Michael Joachim Sammler, and Derek Dreyer. “Quiver: Guided Abductive Inference of Separation Logic Specifications in Coq.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3656413\">https://doi.org/10.1145/3656413</a>.","ama":"Spies S, Gäher L, Sammler MJ, Dreyer D. Quiver: Guided abductive inference of separation logic specifications in coq. <i>Proceedings of the ACM on Programming Languages</i>. 2024;8(PLDI):889-913. doi:<a href=\"https://doi.org/10.1145/3656413\">10.1145/3656413</a>","ista":"Spies S, Gäher L, Sammler MJ, Dreyer D. 2024. Quiver: Guided abductive inference of separation logic specifications in coq. Proceedings of the ACM on Programming Languages. 8(PLDI), 889–913.","apa":"Spies, S., Gäher, L., Sammler, M. J., &#38; Dreyer, D. (2024). Quiver: Guided abductive inference of separation logic specifications in coq. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3656413\">https://doi.org/10.1145/3656413</a>"},"scopus_import":"1","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"06","publication_identifier":{"issn":["2475-1421"]},"_id":"17497","doi":"10.1145/3656413","date_created":"2024-09-05T08:10:41Z","main_file_link":[{"url":"https://doi.org/10.1145/3656413","open_access":"1"}],"page":"889-913","article_processing_charge":"No","title":"Quiver: Guided abductive inference of separation logic specifications in coq","volume":8,"publication":"Proceedings of the ACM on Programming Languages","abstract":[{"text":"Over the past two decades, there has been a great deal of progress on verification of full functional correctness of programs using separation logic, sometimes even producing “foundational” proofs in proof assistants like Coq. Unfortunately, even though existing approaches to this problem provide significant support for automated verification, they still incur a significant specification overhead: the user must supply the specification against which the program is verified, and the specification may be long, complex, or tedious to formulate. In this paper, we introduce Quiver, the first technique for inferring functional correctness specifications in separation logic while simultaneously verifying foundationally that they are correct. To guide Quiver towards the final specification, we take hints from the user in the form of a specification sketch, and then complete the sketch using inference. To do so, Quiver introduces a new abductive deductive verification technique, which integrates ideas from abductive inference (for specification inference) together with deductive separation logic automation (for foundational verification). The result is that users have to provide some guidance, but significantly less than with traditional deductive verification techniques based on separation logic. We have evaluated Quiver on a range of case studies, including code from popular open-source libraries.","lang":"eng"}],"day":"20","year":"2024","publisher":"Association for Computing Machinery","article_type":"original","date_updated":"2024-09-10T12:00:57Z","publication_status":"published","status":"public","extern":"1","intvolume":"         8","author":[{"full_name":"Spies, Simon","first_name":"Simon","last_name":"Spies"},{"first_name":"Lennard","last_name":"Gäher","full_name":"Gäher, Lennard"},{"first_name":"Michael Joachim","last_name":"Sammler","full_name":"Sammler, Michael Joachim","id":"510d3901-2a03-11ee-914d-d9ae9011f0a7"},{"full_name":"Dreyer, Derek","last_name":"Dreyer","first_name":"Derek"}],"date_published":"2024-06-20T00:00:00Z"},{"article_number":"104","title":"NuSTAR observations of candidate subparsec binary supermassive black holes","publication":"The Astrophysical Journal","abstract":[{"lang":"eng","text":"We present an analysis of NuSTAR X-ray observations of three active galactic nuclei (AGN) that were identified as candidate subparsec binary supermassive black hole (SMBH) systems in the Catalina Real-Time Transient Survey based on apparent periodicity in their optical light curves. Simulations predict that close-separation accreting SMBH binaries will have different X-ray spectra than single accreting SMBHs. We previously observed these AGN with Chandra and found no differences between their low-energy X-ray properties and the larger AGN population. However, some models predict differences to be more prominent at energies higher than probed by Chandra. We find that even at the higher energies probed by NuSTAR, the spectra of these AGN are indistinguishable from the larger AGN population. This could rule out models predicting large differences in the X-ray spectra in the NuSTAR bands. Alternatively, it might mean that these three AGN are not binary SMBHs."}],"volume":966,"article_processing_charge":"No","month":"04","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","scopus_import":"1","citation":{"apa":"Saade, M. L., Brightman, M., Stern, D., Connor, T., Djorgovski, S. G., D’Orazio, D. J., … Walton, D. J. (2024). NuSTAR observations of candidate subparsec binary supermassive black holes. <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.3847/1538-4357/ad372e\">https://doi.org/10.3847/1538-4357/ad372e</a>","ista":"Saade ML, Brightman M, Stern D, Connor T, Djorgovski SG, D’Orazio DJ, Ford KES, Graham MJ, Haiman Z, Jun HD, Kammoun E, Kraft RP, McKernan B, Vikhlinin A, Walton DJ. 2024. NuSTAR observations of candidate subparsec binary supermassive black holes. The Astrophysical Journal. 966(1), 104.","ama":"Saade ML, Brightman M, Stern D, et al. NuSTAR observations of candidate subparsec binary supermassive black holes. <i>The Astrophysical Journal</i>. 2024;966(1). doi:<a href=\"https://doi.org/10.3847/1538-4357/ad372e\">10.3847/1538-4357/ad372e</a>","chicago":"Saade, M. Lynne, Murray Brightman, Daniel Stern, Thomas Connor, S. G. Djorgovski, Daniel J. D’Orazio, K. E. S. Ford, et al. “NuSTAR Observations of Candidate Subparsec Binary Supermassive Black Holes.” <i>The Astrophysical Journal</i>. American Astronomical Society, 2024. <a href=\"https://doi.org/10.3847/1538-4357/ad372e\">https://doi.org/10.3847/1538-4357/ad372e</a>.","short":"M.L. Saade, M. Brightman, D. Stern, T. Connor, S.G. Djorgovski, D.J. D’Orazio, K.E.S. Ford, M.J. Graham, Z. Haiman, H.D. Jun, E. Kammoun, R.P. Kraft, B. McKernan, A. Vikhlinin, D.J. Walton, The Astrophysical Journal 966 (2024).","ieee":"M. L. Saade <i>et al.</i>, “NuSTAR observations of candidate subparsec binary supermassive black holes,” <i>The Astrophysical Journal</i>, vol. 966, no. 1. American Astronomical Society, 2024.","mla":"Saade, M. Lynne, et al. “NuSTAR Observations of Candidate Subparsec Binary Supermassive Black Holes.” <i>The Astrophysical Journal</i>, vol. 966, no. 1, 104, American Astronomical Society, 2024, doi:<a href=\"https://doi.org/10.3847/1538-4357/ad372e\">10.3847/1538-4357/ad372e</a>."},"main_file_link":[{"url":"https://doi.org/10.3847/1538-4357/ad372e","open_access":"1"}],"date_created":"2024-09-05T08:57:37Z","doi":"10.3847/1538-4357/ad372e","publication_identifier":{"issn":["0004-637X","1538-4357"]},"_id":"17517","oa_version":"Published Version","oa":1,"issue":"1","quality_controlled":"1","language":[{"iso":"eng"}],"author":[{"last_name":"Saade","first_name":"M. Lynne","full_name":"Saade, M. Lynne"},{"full_name":"Brightman, Murray","last_name":"Brightman","first_name":"Murray"},{"full_name":"Stern, Daniel","first_name":"Daniel","last_name":"Stern"},{"full_name":"Connor, Thomas","last_name":"Connor","first_name":"Thomas"},{"full_name":"Djorgovski, S. G.","first_name":"S. G.","last_name":"Djorgovski"},{"full_name":"D’Orazio, Daniel J.","first_name":"Daniel J.","last_name":"D’Orazio"},{"last_name":"Ford","first_name":"K. E. S.","full_name":"Ford, K. E. S."},{"last_name":"Graham","first_name":"Matthew J.","full_name":"Graham, Matthew J."},{"first_name":"Zoltán","last_name":"Haiman","full_name":"Haiman, Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"},{"full_name":"Jun, Hyunsung D.","first_name":"Hyunsung D.","last_name":"Jun"},{"full_name":"Kammoun, Elias","last_name":"Kammoun","first_name":"Elias"},{"first_name":"Ralph P.","last_name":"Kraft","full_name":"Kraft, Ralph P."},{"first_name":"Barry","last_name":"McKernan","full_name":"McKernan, Barry"},{"full_name":"Vikhlinin, Alexei","first_name":"Alexei","last_name":"Vikhlinin"},{"first_name":"Dominic J.","last_name":"Walton","full_name":"Walton, Dominic J."}],"date_published":"2024-04-29T00:00:00Z","intvolume":"       966","extern":"1","date_updated":"2024-09-10T14:31:31Z","publisher":"American Astronomical Society","article_type":"original","status":"public","publication_status":"published","year":"2024","day":"29"}]
