[{"article_type":"original","article_number":"4826","publication":"Nature Communications","date_updated":"2023-08-03T13:01:19Z","year":"2022","keyword":["General Physics and Astronomy","General Biochemistry","Genetics and Molecular Biology","General Chemistry","Multidisciplinary"],"oa":1,"isi":1,"language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","intvolume":"        13","publisher":"Springer Nature","date_published":"2022-08-16T00:00:00Z","external_id":{"isi":["000841396400008"]},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"SSU"}],"date_created":"2022-08-24T08:25:50Z","department":[{"_id":"JoCs"},{"_id":"PeJo"},{"_id":"JoDa"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"We thank F. Marr and A. Schlögl for technical assistance, E. Kralli-Beller for manuscript editing, as well as C. Sommer and the Imaging and Optics Facility of the Institute of Science and Technology Austria (ISTA) for image analysis scripts and microscopy support. We extend our gratitude to J. Wallenschus and D. Rangel Guerrero for technical assistance acquiring single-unit data and I. Gridchyn for help with single-unit clustering. Finally, we also thank B. Suter for discussions, A. Saunders, M. Jösch, and H. Monyer for critically reading earlier versions of the manuscript, C. Petersen for sharing clearing protocols, and the Scientific Service Units of ISTA for efficient support. This project was funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (ERC advanced grant No 692692 to P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award for P.J. and I3600-B27 for J.G.D. and P.V.).","publication_status":"published","status":"public","ec_funded":1,"publication_identifier":{"issn":["2041-1723"]},"project":[{"grant_number":"692692","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Biophysics and circuit function of a giant cortical glumatergic synapse"},{"call_identifier":"FWF","name":"Optical control of synaptic function via adhesion molecules","grant_number":"I03600","_id":"265CB4D0-B435-11E9-9278-68D0E5697425"},{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"abstract":[{"lang":"eng","text":"The mammalian hippocampal formation (HF) plays a key role in several higher brain functions, such as spatial coding, learning and memory. Its simple circuit architecture is often viewed as a trisynaptic loop, processing input originating from the superficial layers of the entorhinal cortex (EC) and sending it back to its deeper layers. Here, we show that excitatory neurons in layer 6b of the mouse EC project to all sub-regions comprising the HF and receive input from the CA1, thalamus and claustrum. Furthermore, their output is characterized by unique slow-decaying excitatory postsynaptic currents capable of driving plateau-like potentials in their postsynaptic targets. Optogenetic inhibition of the EC-6b pathway affects spatial coding in CA1 pyramidal neurons, while cell ablation impairs not only acquisition of new spatial memories, but also degradation of previously acquired ones. Our results provide evidence of a functional role for cortical layer 6b neurons in the adult brain."}],"doi":"10.1038/s41467-022-32559-8","author":[{"last_name":"Ben Simon","full_name":"Ben Simon, Yoav","first_name":"Yoav","id":"43DF3136-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karola","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","last_name":"Käfer","full_name":"Käfer, Karola"},{"full_name":"Velicky, Philipp","last_name":"Velicky","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp","orcid":"0000-0002-2340-7431"},{"full_name":"Csicsvari, Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","orcid":"0000-0002-5193-4036"},{"id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johann G","full_name":"Danzl, Johann G","last_name":"Danzl","orcid":"0000-0001-8559-3973"},{"full_name":"Jonas, Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","orcid":"0000-0001-5001-4804"}],"title":"A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory","_id":"11951","has_accepted_license":"1","article_processing_charge":"No","volume":13,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"checksum":"405936d9e4d33625d80c093c9713a91f","content_type":"application/pdf","access_level":"open_access","date_updated":"2022-08-26T11:51:40Z","success":1,"relation":"main_file","creator":"dernst","file_size":5910357,"file_name":"2022_NatureCommunications_BenSimon.pdf","date_created":"2022-08-26T11:51:40Z","file_id":"11990"}],"oa_version":"Published Version","day":"16","citation":{"short":"Y. Ben Simon, K. Käfer, P. Velicky, J.L. Csicsvari, J.G. Danzl, P.M. Jonas, Nature Communications 13 (2022).","ista":"Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. 2022. A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. Nature Communications. 13, 4826.","ama":"Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-32559-8\">10.1038/s41467-022-32559-8</a>","apa":"Ben Simon, Y., Käfer, K., Velicky, P., Csicsvari, J. L., Danzl, J. G., &#38; Jonas, P. M. (2022). A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-32559-8\">https://doi.org/10.1038/s41467-022-32559-8</a>","ieee":"Y. Ben Simon, K. Käfer, P. Velicky, J. L. Csicsvari, J. G. Danzl, and P. M. Jonas, “A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022.","chicago":"Ben Simon, Yoav, Karola Käfer, Philipp Velicky, Jozsef L Csicsvari, Johann G Danzl, and Peter M Jonas. “A Direct Excitatory Projection from Entorhinal Layer 6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-32559-8\">https://doi.org/10.1038/s41467-022-32559-8</a>.","mla":"Ben Simon, Yoav, et al. “A Direct Excitatory Projection from Entorhinal Layer 6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” <i>Nature Communications</i>, vol. 13, 4826, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-32559-8\">10.1038/s41467-022-32559-8</a>."},"file_date_updated":"2022-08-26T11:51:40Z","month":"08","ddc":["570"]},{"date_updated":"2022-09-05T08:19:38Z","publication":"ACM SIGLOG News","page":"30-59","article_type":"original","oa":1,"year":"2022","publisher":"Association for Computing Machinery","intvolume":"         9","main_file_link":[{"url":"http://arxiv.org/abs/2208.13538","open_access":"1"}],"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"UlWa"}],"date_created":"2022-08-27T11:23:37Z","external_id":{"arxiv":["2208.13538"]},"date_published":"2022-07-01T00:00:00Z","publication_identifier":{"issn":["2372-3491"]},"status":"public","publication_status":"published","_id":"11991","title":"An invitation to the promise constraint satisfaction problem","author":[{"full_name":"Krokhin, Andrei","last_name":"Krokhin","first_name":"Andrei"},{"orcid":"0000-0003-1245-3456","first_name":"Jakub","id":"ec596741-c539-11ec-b829-c79322a91242","last_name":"Opršal","full_name":"Opršal, Jakub"}],"doi":"10.1145/3559736.3559740","abstract":[{"lang":"eng","text":"The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP, has started to gain prominence. In this survey, we explain the importance of promise CSP and highlight many new very interesting features that the study of promise CSP has brought to light. The complexity classification quest for the promise CSP is wide open, and we argue that, despite the promise CSP being more general, this quest is rather more accessible to a wide range of researchers than the dichotomy-led study of the CSP has been."}],"issue":"3","arxiv":1,"volume":9,"article_processing_charge":"No","month":"07","citation":{"mla":"Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” <i>ACM SIGLOG News</i>, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:<a href=\"https://doi.org/10.1145/3559736.3559740\">10.1145/3559736.3559740</a>.","chicago":"Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” <i>ACM SIGLOG News</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3559736.3559740\">https://doi.org/10.1145/3559736.3559740</a>.","apa":"Krokhin, A., &#38; Opršal, J. (2022). An invitation to the promise constraint satisfaction problem. <i>ACM SIGLOG News</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3559736.3559740\">https://doi.org/10.1145/3559736.3559740</a>","ieee":"A. Krokhin and J. Opršal, “An invitation to the promise constraint satisfaction problem,” <i>ACM SIGLOG News</i>, vol. 9, no. 3. Association for Computing Machinery, pp. 30–59, 2022.","short":"A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.","ama":"Krokhin A, Opršal J. An invitation to the promise constraint satisfaction problem. <i>ACM SIGLOG News</i>. 2022;9(3):30-59. doi:<a href=\"https://doi.org/10.1145/3559736.3559740\">10.1145/3559736.3559740</a>","ista":"Krokhin A, Opršal J. 2022. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 9(3), 30–59."},"day":"01","oa_version":"Preprint"},{"file":[{"file_size":32480850,"creator":"bbickel","relation":"main_file","file_name":"star_molding_preprint.pdf","checksum":"c40cc8ceb7b7f0512172b883d712198e","content_type":"application/pdf","access_level":"open_access","description":"This is the pre-peer reviewed version of the following article: Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P. and Pietroni, N. (2022), State of the Art in Computational Mould Design. Computer Graphics Forum, which has been published in final form at https://doi.org/10.1111/cgf.14581. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.","date_updated":"2022-08-28T18:18:08Z","date_created":"2022-08-28T18:18:08Z","file_id":"11994","title":"pre-peer reviewed version"}],"volume":41,"article_processing_charge":"No","has_accepted_license":"1","month":"09","file_date_updated":"2022-08-28T18:18:08Z","ddc":["000"],"day":"01","citation":{"mla":"Alderighi, Thomas, et al. “State of the Art in Computational Mould Design.” <i>Computer Graphics Forum</i>, vol. 41, no. 6, Wiley, 2022, pp. 435–52, doi:<a href=\"https://doi.org/10.1111/cgf.14581\">10.1111/cgf.14581</a>.","chicago":"Alderighi, Thomas, Luigi Malomo, Thomas Auzinger, Bernd Bickel, Paulo Cignoni, and Nico Pietroni. “State of the Art in Computational Mould Design.” <i>Computer Graphics Forum</i>. Wiley, 2022. <a href=\"https://doi.org/10.1111/cgf.14581\">https://doi.org/10.1111/cgf.14581</a>.","ama":"Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. State of the art in computational mould design. <i>Computer Graphics Forum</i>. 2022;41(6):435-452. doi:<a href=\"https://doi.org/10.1111/cgf.14581\">10.1111/cgf.14581</a>","short":"T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, N. Pietroni, Computer Graphics Forum 41 (2022) 435–452.","ista":"Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. 2022. State of the art in computational mould design. Computer Graphics Forum. 41(6), 435–452.","apa":"Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P., &#38; Pietroni, N. (2022). State of the art in computational mould design. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14581\">https://doi.org/10.1111/cgf.14581</a>","ieee":"T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, and N. Pietroni, “State of the art in computational mould design,” <i>Computer Graphics Forum</i>, vol. 41, no. 6. Wiley, pp. 435–452, 2022."},"oa_version":"Submitted Version","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"publication_status":"published","status":"public","_id":"11993","author":[{"first_name":"Thomas","full_name":"Alderighi, Thomas","last_name":"Alderighi"},{"full_name":"Malomo, Luigi","last_name":"Malomo","first_name":"Luigi"},{"first_name":"Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87","last_name":"Auzinger","full_name":"Auzinger, Thomas","orcid":"0000-0002-1546-3265"},{"last_name":"Bickel","full_name":"Bickel, Bernd","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"},{"first_name":"Paulo","last_name":"Cignoni","full_name":"Cignoni, Paulo"},{"first_name":"Nico","full_name":"Pietroni, Nico","last_name":"Pietroni"}],"title":"State of the art in computational mould design","doi":"10.1111/cgf.14581","issue":"6","abstract":[{"text":"Moulding refers to a set of manufacturing techniques in which a mould, usually a cavity or a solid frame, is used to shape a liquid or pliable material into an object of the desired shape. The popularity of moulding comes from its effectiveness, scalability and versatility in terms of employed materials. Its relevance as a fabrication process is demonstrated by the extensive literature covering different aspects related to mould design, from material flow simulation to the automation of mould geometry design. In this state-of-the-art report, we provide an extensive review of the automatic methods for the design of moulds, focusing on contributions from a geometric perspective. We classify existing mould design methods based on their computational approach and the nature of their target moulding process. We summarize the relationships between computational approaches and moulding techniques, highlighting their strengths and limitations. Finally, we discuss potential future research directions.","lang":"eng"}],"intvolume":"        41","publisher":"Wiley","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"BeBi"}],"scopus_import":"1","date_created":"2022-08-28T18:17:01Z","date_published":"2022-09-01T00:00:00Z","external_id":{"isi":["000842638900001"]},"date_updated":"2023-08-03T13:21:55Z","publication":"Computer Graphics Forum","article_type":"original","page":"435-452","oa":1,"keyword":["Computer Graphics and Computer-Aided Design"],"year":"2022"},{"publication_identifier":{"eissn":["2041-1723"]},"project":[{"name":"Modulating microglia through G protein-coupled receptor (GPCR) signaling","_id":"267F75D8-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","acknowledgement":"The authors thank the Scientific Service Units at ISTA, in particular the Molecular Biology Service of the Lab Support Facility, Imaging & Optics Facility, and the Preclinical Facility, and the Novarino group, Harald Janoviak, and Marco Benevento for sharing reagents and expertise. This research was supported by a DOC Fellowship (24979) awarded to R.S. by the Austrian Academy of Sciences.","status":"public","title":"Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses","author":[{"last_name":"Schulz","full_name":"Schulz, Rouven","first_name":"Rouven","id":"4C5E7B96-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5297-733X"},{"orcid":"0000-0003-4309-2251","id":"4B51CE74-F248-11E8-B48F-1D18A9856A87","first_name":"Medina","full_name":"Korkut, Medina","last_name":"Korkut"},{"orcid":"0000-0003-2356-9403","last_name":"Venturino","full_name":"Venturino, Alessandro","first_name":"Alessandro","id":"41CB84B2-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-9434-8902","id":"3483CF6C-F248-11E8-B48F-1D18A9856A87","first_name":"Gloria","full_name":"Colombo, Gloria","last_name":"Colombo"},{"full_name":"Siegert, Sandra","last_name":"Siegert","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","first_name":"Sandra","orcid":"0000-0001-8635-0877"}],"_id":"11995","abstract":[{"text":"G protein-coupled receptors (GPCRs) regulate processes ranging from immune responses to neuronal signaling. However, ligands for many GPCRs remain unknown, suffer from off-target effects or have poor bioavailability. Additionally, dissecting cell type-specific responses is challenging when the same GPCR is expressed on different cells within a tissue. Here, we overcome these limitations by engineering DREADD-based GPCR chimeras that bind clozapine-N-oxide and mimic a GPCR-of-interest. We show that chimeric DREADD-β2AR triggers responses comparable to β2AR on second messenger and kinase activity, post-translational modifications, and protein-protein interactions. Moreover, we successfully recapitulate β2AR-mediated filopodia formation in microglia, an immune cell capable of driving central nervous system inflammation. When dissecting microglial inflammation, we included two additional DREADD-based chimeras mimicking microglia-enriched GPR65 and GPR109A. DREADD-β2AR and DREADD-GPR65 modulate the inflammatory response with high similarity to endogenous β2AR, while DREADD-GPR109A shows no impact. Our DREADD-based approach allows investigation of cell type-dependent pathways without known endogenous ligands.","lang":"eng"}],"doi":"10.1038/s41467-022-32390-1","file":[{"file_name":"2022_NatComm_Schulz.pdf","relation":"main_file","file_size":7317396,"creator":"cchlebak","success":1,"date_updated":"2022-08-29T06:44:30Z","access_level":"open_access","content_type":"application/pdf","checksum":"191d9db0266e14a28d3a56dc7f65da84","file_id":"12002","date_created":"2022-08-29T06:44:30Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","article_processing_charge":"No","volume":13,"citation":{"mla":"Schulz, Rouven, et al. “Chimeric GPCRs Mimic Distinct Signaling Pathways and Modulate Microglia Responses.” <i>Nature Communications</i>, vol. 13, 4728, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-32390-1\">10.1038/s41467-022-32390-1</a>.","chicago":"Schulz, Rouven, Medina Korkut, Alessandro Venturino, Gloria Colombo, and Sandra Siegert. “Chimeric GPCRs Mimic Distinct Signaling Pathways and Modulate Microglia Responses.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-32390-1\">https://doi.org/10.1038/s41467-022-32390-1</a>.","ista":"Schulz R, Korkut M, Venturino A, Colombo G, Siegert S. 2022. Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses. Nature Communications. 13, 4728.","short":"R. Schulz, M. Korkut, A. Venturino, G. Colombo, S. Siegert, Nature Communications 13 (2022).","ama":"Schulz R, Korkut M, Venturino A, Colombo G, Siegert S. Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-32390-1\">10.1038/s41467-022-32390-1</a>","ieee":"R. Schulz, M. Korkut, A. Venturino, G. Colombo, and S. Siegert, “Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022.","apa":"Schulz, R., Korkut, M., Venturino, A., Colombo, G., &#38; Siegert, S. (2022). Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-32390-1\">https://doi.org/10.1038/s41467-022-32390-1</a>"},"day":"15","pmid":1,"file_date_updated":"2022-08-29T06:44:30Z","month":"08","ddc":["570"],"oa_version":"Published Version","publication":"Nature Communications","date_updated":"2024-02-21T12:34:51Z","related_material":{"link":[{"relation":"press_release","description":"News on ISTA website","url":"https://ista.ac.at/en/news/dreaddful-mimicry/"}],"record":[{"relation":"part_of_dissertation","status":"public","id":"11945"},{"status":"public","relation":"research_data","id":"11542"}]},"article_number":"4728","article_type":"original","oa":1,"year":"2022","publisher":"Springer Nature","intvolume":"        13","isi":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"SaSi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000840984400032"],"pmid":["35970889"]},"date_published":"2022-08-15T00:00:00Z","date_created":"2022-08-28T22:01:59Z","acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"},{"_id":"LifeSc"}],"scopus_import":"1"},{"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","intvolume":"       377","publisher":"American Association for the Advancement of Science","scopus_import":"1","date_created":"2022-08-28T22:02:00Z","date_published":"2022-08-12T00:00:00Z","external_id":{"pmid":["35951689 "]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JePa"}],"article_type":"letter_note","page":"710-711","date_updated":"2022-09-05T07:37:37Z","publication":"Science","year":"2022","article_processing_charge":"No","volume":377,"oa_version":"None","pmid":1,"month":"08","day":"12","citation":{"ama":"Palacci JA. A soft active matter that can climb walls. <i>Science</i>. 2022;377(6607):710-711. doi:<a href=\"https://doi.org/10.1126/science.adc9202\">10.1126/science.adc9202</a>","ista":"Palacci JA. 2022. A soft active matter that can climb walls. Science. 377(6607), 710–711.","short":"J.A. Palacci, Science 377 (2022) 710–711.","ieee":"J. A. Palacci, “A soft active matter that can climb walls,” <i>Science</i>, vol. 377, no. 6607. American Association for the Advancement of Science, pp. 710–711, 2022.","apa":"Palacci, J. A. (2022). A soft active matter that can climb walls. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.adc9202\">https://doi.org/10.1126/science.adc9202</a>","chicago":"Palacci, Jérémie A. “A Soft Active Matter That Can Climb Walls.” <i>Science</i>. American Association for the Advancement of Science, 2022. <a href=\"https://doi.org/10.1126/science.adc9202\">https://doi.org/10.1126/science.adc9202</a>.","mla":"Palacci, Jérémie A. “A Soft Active Matter That Can Climb Walls.” <i>Science</i>, vol. 377, no. 6607, American Association for the Advancement of Science, 2022, pp. 710–11, doi:<a href=\"https://doi.org/10.1126/science.adc9202\">10.1126/science.adc9202</a>."},"status":"public","publication_status":"published","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"doi":"10.1126/science.adc9202","issue":"6607","abstract":[{"lang":"eng","text":"If you mix fruit syrups with alcohol to make a schnapps, the two liquids will remain perfectly blended forever. But if you mix oil with vinegar to make a vinaigrette, the oil and vinegar will soon separate back into their previous selves. Such liquid-liquid phase separation is a thermodynamically driven phenomenon and plays an important role in many biological processes (1). Although energy injection at the macroscale can reverse the phase separation—a strong shake is the normal response to a separated vinaigrette—little is known about the effect of energy added at the microscopic level on phase separation. This fundamental question has deep ramifications, notably in biology, because active processes also make the interior of a living cell different from a dead one. On page 768 of this issue, Adkins et al. (2) examine how mechanical activity at the microscopic scale affects liquid-liquid phase separation and allows liquids to climb surfaces."}],"_id":"11996","author":[{"orcid":"0000-0002-7253-9465","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","first_name":"Jérémie A","full_name":"Palacci, Jérémie A","last_name":"Palacci"}],"title":"A soft active matter that can climb walls"},{"oa":1,"year":"2022","publication":"Physical Review A","date_updated":"2024-08-07T07:16:52Z","article_number":"023301","article_type":"original","department":[{"_id":"MiLe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000837953600006"],"arxiv":["2109.07451"]},"date_published":"2022-08-04T00:00:00Z","date_created":"2022-08-28T22:02:00Z","scopus_import":"1","publisher":"American Physical Society","intvolume":"       106","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2109.07451","open_access":"1"}],"isi":1,"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"title":"Impurity in a heteronuclear two-component Bose mixture","author":[{"orcid":"0000-0001-8823-9777","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","first_name":"Giacomo","full_name":"Bighin, Giacomo","last_name":"Bighin"},{"full_name":"Burchianti, A.","last_name":"Burchianti","first_name":"A."},{"first_name":"F.","full_name":"Minardi, F.","last_name":"Minardi"},{"full_name":"Macrì, T.","last_name":"Macrì","first_name":"T."}],"_id":"11997","abstract":[{"text":"We study the fate of an impurity in an ultracold heteronuclear Bose mixture, focusing on the experimentally relevant case of a ⁴¹K - ⁸⁷Rb mixture, with the impurity in a ⁴¹K hyperfine state. Our paper provides a comprehensive description of an impurity in a BEC mixture with contact interactions across its phase diagram. We present results for the miscible and immiscible regimes, as well as for the impurity in a self-bound quantum droplet. Here, varying the interactions, we find exotic states where the impurity localizes either at the center or\r\nat the surface of the droplet. ","lang":"eng"}],"issue":"2","doi":"10.1103/PhysRevA.106.023301","publication_identifier":{"issn":["2469-9926"],"eissn":["2469-9934"]},"project":[{"_id":"26986C82-B435-11E9-9278-68D0E5697425","grant_number":"M02641","call_identifier":"FWF","name":"A path-integral approach to composite impurities"}],"acknowledgement":"We thank A. Simoni for providing the calculations of the intercomponent scattering lengths. We gratefully acknowledge stimulating discussions with L. A. Peña Ardila, R. Schmidt, H. Silva, V. Zampronio, and M. Prevedelli for careful reading. G.B. acknowledges support from the Austrian Science Fund (FWF) under Project No. M2641-N27. T.M. acknowledges CNPq for support through Bolsa de produtividade em Pesquisa No. 311079/2015-6. This work is supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy No. EXC2181/1-390900948 (the Heidelberg STRUCTURES Excellence Cluster). This work was supported by the Serrapilheira Institute (Grant No. Serra-1812-27802). We thank the High-Performance Computing Center (NPAD) at UFRN for providing computational resources.","publication_status":"published","status":"public","citation":{"mla":"Bighin, Giacomo, et al. “Impurity in a Heteronuclear Two-Component Bose Mixture.” <i>Physical Review A</i>, vol. 106, no. 2, 023301, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/PhysRevA.106.023301\">10.1103/PhysRevA.106.023301</a>.","chicago":"Bighin, Giacomo, A. Burchianti, F. Minardi, and T. Macrì. “Impurity in a Heteronuclear Two-Component Bose Mixture.” <i>Physical Review A</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/PhysRevA.106.023301\">https://doi.org/10.1103/PhysRevA.106.023301</a>.","apa":"Bighin, G., Burchianti, A., Minardi, F., &#38; Macrì, T. (2022). Impurity in a heteronuclear two-component Bose mixture. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.106.023301\">https://doi.org/10.1103/PhysRevA.106.023301</a>","ieee":"G. Bighin, A. Burchianti, F. Minardi, and T. Macrì, “Impurity in a heteronuclear two-component Bose mixture,” <i>Physical Review A</i>, vol. 106, no. 2. American Physical Society, 2022.","short":"G. Bighin, A. Burchianti, F. Minardi, T. Macrì, Physical Review A 106 (2022).","ista":"Bighin G, Burchianti A, Minardi F, Macrì T. 2022. Impurity in a heteronuclear two-component Bose mixture. Physical Review A. 106(2), 023301.","ama":"Bighin G, Burchianti A, Minardi F, Macrì T. Impurity in a heteronuclear two-component Bose mixture. <i>Physical Review A</i>. 2022;106(2). doi:<a href=\"https://doi.org/10.1103/PhysRevA.106.023301\">10.1103/PhysRevA.106.023301</a>"},"day":"04","month":"08","oa_version":"Preprint","arxiv":1,"volume":106,"article_processing_charge":"No"},{"publisher":"IOP","intvolume":"        24","isi":1,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","department":[{"_id":"MiLe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000839216900001"]},"date_published":"2022-08-11T00:00:00Z","date_created":"2022-08-28T22:02:01Z","scopus_import":"1","publication":"New Journal of Physics","date_updated":"2024-08-07T07:16:52Z","article_number":"075004","article_type":"original","oa":1,"year":"2022","file":[{"file_id":"12005","date_created":"2022-08-29T09:57:40Z","success":1,"date_updated":"2022-08-29T09:57:40Z","access_level":"open_access","checksum":"10116a08d3489befc13dba2cc44490f1","content_type":"application/pdf","file_name":"2022_NewJournalofPhysics_Cherepanov.pdf","relation":"main_file","creator":"alisjak","file_size":1912882}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","volume":24,"article_processing_charge":"Yes","citation":{"ieee":"I. Cherepanov, G. Bighin, C. A. Schouder, A. S. Chatterley, H. Stapelfeldt, and M. Lemeshko, “A simple model for high rotational excitations of molecules in a superfluid,” <i>New Journal of Physics</i>, vol. 24, no. 7. IOP, 2022.","apa":"Cherepanov, I., Bighin, G., Schouder, C. A., Chatterley, A. S., Stapelfeldt, H., &#38; Lemeshko, M. (2022). A simple model for high rotational excitations of molecules in a superfluid. <i>New Journal of Physics</i>. IOP. <a href=\"https://doi.org/10.1088/1367-2630/ac8113\">https://doi.org/10.1088/1367-2630/ac8113</a>","ama":"Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Stapelfeldt H, Lemeshko M. A simple model for high rotational excitations of molecules in a superfluid. <i>New Journal of Physics</i>. 2022;24(7). doi:<a href=\"https://doi.org/10.1088/1367-2630/ac8113\">10.1088/1367-2630/ac8113</a>","short":"I. Cherepanov, G. Bighin, C.A. Schouder, A.S. Chatterley, H. Stapelfeldt, M. Lemeshko, New Journal of Physics 24 (2022).","ista":"Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Stapelfeldt H, Lemeshko M. 2022. A simple model for high rotational excitations of molecules in a superfluid. New Journal of Physics. 24(7), 075004.","chicago":"Cherepanov, Igor, Giacomo Bighin, Constant A. Schouder, Adam S. Chatterley, Henrik Stapelfeldt, and Mikhail Lemeshko. “A Simple Model for High Rotational Excitations of Molecules in a Superfluid.” <i>New Journal of Physics</i>. IOP, 2022. <a href=\"https://doi.org/10.1088/1367-2630/ac8113\">https://doi.org/10.1088/1367-2630/ac8113</a>.","mla":"Cherepanov, Igor, et al. “A Simple Model for High Rotational Excitations of Molecules in a Superfluid.” <i>New Journal of Physics</i>, vol. 24, no. 7, 075004, IOP, 2022, doi:<a href=\"https://doi.org/10.1088/1367-2630/ac8113\">10.1088/1367-2630/ac8113</a>."},"day":"11","month":"08","ddc":["530"],"file_date_updated":"2022-08-29T09:57:40Z","oa_version":"Published Version","publication_identifier":{"issn":["1367-2630"]},"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020"},{"name":"A path-integral approach to composite impurities","call_identifier":"FWF","_id":"26986C82-B435-11E9-9278-68D0E5697425","grant_number":"M02641"}],"status":"public","publication_status":"published","acknowledgement":"IC acknowledges the support by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. GB acknowledges support from the Austrian Science Fund (FWF), under Project No. M2461-N27 and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy EXC2181/1-390900948 (the Heidelberg STRUCTURES Excellence Cluster). ML acknowledges support by the Austrian Science Fund (FWF), under Project No. P29902-N27, and by the European Research Council (ERC) starting Grant No. 801770 (ANGULON). HS acknowledges support from the Independent Research Fund Denmark (Project No. 8021-00232B) and from the Villum Fonden through a Villum Investigator Grant No. 25886.","ec_funded":1,"title":"A simple model for high rotational excitations of molecules in a superfluid","author":[{"id":"339C7E5A-F248-11E8-B48F-1D18A9856A87","first_name":"Igor","full_name":"Cherepanov, Igor","last_name":"Cherepanov"},{"last_name":"Bighin","full_name":"Bighin, Giacomo","first_name":"Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8823-9777"},{"full_name":"Schouder, Constant A.","last_name":"Schouder","first_name":"Constant A."},{"full_name":"Chatterley, Adam S.","last_name":"Chatterley","first_name":"Adam S."},{"last_name":"Stapelfeldt","full_name":"Stapelfeldt, Henrik","first_name":"Henrik"},{"orcid":"0000-0002-6990-7802","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"_id":"11998","abstract":[{"text":"Recently it became possible to study highly excited rotational states of molecules in superfluid helium through nonadiabatic alignment experiments (Cherepanov et al 2021 Phys. Rev. A 104 L061303). This calls for theoretical approaches that go beyond explaining renormalized values of molecular spectroscopic constants, which suffices when only the lowest few rotational states are involved. As the first step in this direction, here we present a basic quantum mechanical model describing highly excited rotational states of molecules in superfluid helium nanodroplets. We show that a linear molecule immersed in a superfluid can be seen as an effective symmetric top, similar to the rotational structure of radicals, such as OH or NO, but with the angular momentum of the superfluid playing the role of the electronic angular momentum in free molecules. The simple theory sheds light onto what happens when the rotational angular momentum of the molecule increases beyond the lowest excited states accessible by infrared spectroscopy. In addition, the model allows to estimate the effective rotational and centrifugal distortion constants for a broad range of species and to explain the crossover between light and heavy molecules in superfluid 4He in terms of the many-body wavefunction structure. Some of the above mentioned insights can be acquired by analyzing a simple 2 × 2 matrix.","lang":"eng"}],"issue":"7","doi":"10.1088/1367-2630/ac8113"},{"isi":1,"quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"intvolume":"     13371","publisher":"Springer","external_id":{"isi":["000870304500004"]},"date_published":"2022-08-07T00:00:00Z","scopus_import":"1","date_created":"2022-08-28T22:02:02Z","department":[{"_id":"KrCh"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"14539"}]},"page":"55-78","publication":"Proceedings of the 34th International Conference on Computer Aided Verification","date_updated":"2025-07-14T09:09:58Z","year":"2022","alternative_title":["LNCS"],"oa":1,"has_accepted_license":"1","volume":13371,"article_processing_charge":"Yes (in subscription journal)","file":[{"content_type":"application/pdf","checksum":"24e0f810ec52735a90ade95198bc641d","access_level":"open_access","date_updated":"2022-08-29T09:17:01Z","success":1,"creator":"alisjak","file_size":505094,"relation":"main_file","file_name":"2022_LNCS_Chatterjee.pdf","date_created":"2022-08-29T09:17:01Z","file_id":"12003"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"conference":{"name":"CAV: Computer Aided Verification","start_date":"2022-08-07","location":"Haifa, Israel","end_date":"2022-08-10"},"oa_version":"Published Version","day":"07","citation":{"mla":"Chatterjee, Krishnendu, et al. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.” <i>Proceedings of the 34th International Conference on Computer Aided Verification</i>, vol. 13371, Springer, 2022, pp. 55–78, doi:<a href=\"https://doi.org/10.1007/978-3-031-13185-1_4\">10.1007/978-3-031-13185-1_4</a>.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.” In <i>Proceedings of the 34th International Conference on Computer Aided Verification</i>, 13371:55–78. Springer, 2022. <a href=\"https://doi.org/10.1007/978-3-031-13185-1_4\">https://doi.org/10.1007/978-3-031-13185-1_4</a>.","apa":"Chatterjee, K., Goharshady, A. K., Meggendorfer, T., &#38; Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In <i>Proceedings of the 34th International Conference on Computer Aided Verification</i> (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. <a href=\"https://doi.org/10.1007/978-3-031-13185-1_4\">https://doi.org/10.1007/978-3-031-13185-1_4</a>","ieee":"K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in <i>Proceedings of the 34th International Conference on Computer Aided Verification</i>, Haifa, Israel, 2022, vol. 13371, pp. 55–78.","ama":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. Sound and complete certificates for auantitative termination analysis of probabilistic programs. In: <i>Proceedings of the 34th International Conference on Computer Aided Verification</i>. Vol 13371. Springer; 2022:55-78. doi:<a href=\"https://doi.org/10.1007/978-3-031-13185-1_4\">10.1007/978-3-031-13185-1_4</a>","ista":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2022. Sound and complete certificates for auantitative termination analysis of probabilistic programs. Proceedings of the 34th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13371, 55–78.","short":"K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, in:, Proceedings of the 34th International Conference on Computer Aided Verification, Springer, 2022, pp. 55–78."},"ddc":["000"],"file_date_updated":"2022-08-29T09:17:01Z","month":"08","publication_status":"published","status":"public","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt), the HKUST-Kaisa Joint Research Institute Project Grant HKJRI3A-055, the HKUST Startup Grant R9272 and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","ec_funded":1,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031131844"],"eissn":["1611-3349"]},"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"abstract":[{"lang":"eng","text":"We consider the quantitative problem of obtaining lower-bounds on the probability of termination of a given non-deterministic probabilistic program. Specifically, given a non-termination threshold p∈[0,1], we aim for certificates proving that the program terminates with probability at least 1−p. The basic idea of our approach is to find a terminating stochastic invariant, i.e. a subset SI of program states such that (i) the probability of the program ever leaving SI is no more than p, and (ii) almost-surely, the program either leaves SI or terminates.\r\n\r\nWhile stochastic invariants are already well-known, we provide the first proof that the idea above is not only sound, but also complete for quantitative termination analysis. We then introduce a novel sound and complete characterization of stochastic invariants that enables template-based approaches for easy synthesis of quantitative termination certificates, especially in affine or polynomial forms. Finally, by combining this idea with the existing martingale-based methods that are relatively complete for qualitative termination analysis, we obtain the first automated, sound, and relatively complete algorithm for quantitative termination analysis. Notably, our completeness guarantees for quantitative termination analysis are as strong as the best-known methods for the qualitative variant.\r\n\r\nOur prototype implementation demonstrates the effectiveness of our approach on various probabilistic programs. We also demonstrate that our algorithm certifies lower bounds on termination probability for probabilistic programs that are beyond the reach of previous methods."}],"doi":"10.1007/978-3-031-13185-1_4","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0003-1702-6584","last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699"}],"title":"Sound and complete certificates for auantitative termination analysis of probabilistic programs","_id":"12000"},{"year":"2022","oa":1,"article_type":"original","page":"358-374","publication":"Evolution Letters","date_updated":"2023-08-03T13:18:17Z","external_id":{"isi":["000839621100001"]},"date_published":"2022-10-01T00:00:00Z","scopus_import":"1","date_created":"2022-08-28T22:02:02Z","department":[{"_id":"NiBa"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","intvolume":"         6","publisher":"Oxford Academic","issue":"5","abstract":[{"lang":"eng","text":"Sexual antagonism is a common hypothesis for driving the evolution of sex chromosomes, whereby recombination suppression is favored between sexually antagonistic loci and the sex-determining locus to maintain beneficial combinations of alleles. This results in the formation of a sex-determining region. Chromosomal inversions may contribute to recombination suppression but their precise role in sex chromosome evolution remains unclear. Because local adaptation is frequently facilitated through the suppression of recombination between adaptive loci by chromosomal inversions, there is potential for inversions that cover sex-determining regions to be involved in local adaptation as well, particularly if habitat variation creates environment-dependent sexual antagonism. With these processes in mind, we investigated sex determination in a well-studied example of local adaptation within a species: the intertidal snail, Littorina saxatilis. Using SNP data from a Swedish hybrid zone, we find novel evidence for a female-heterogametic sex determination system that is restricted to one ecotype. Our results suggest that four putative chromosomal inversions, two previously described and two newly discovered, span the putative sex chromosome pair. We determine their differing associations with sex, which suggest distinct strata of differing ages. The same inversions are found in the second ecotype but do not show any sex association. The striking disparity in inversion-sex associations between ecotypes that are connected by gene flow across a habitat transition that is just a few meters wide indicates a difference in selective regime that has produced a distinct barrier to the spread of the newly discovered sex-determining region between ecotypes. Such sex chromosome-environment interactions have not previously been uncovered in L. saxatilis and are known in few other organisms. A combination of both sex-specific selection and divergent natural selection is required to explain these highly unusual patterns."}],"doi":"10.1002/evl3.295","author":[{"last_name":"Hearn","full_name":"Hearn, Katherine E.","first_name":"Katherine E."},{"first_name":"Eva L.","full_name":"Koch, Eva L.","last_name":"Koch"},{"last_name":"Stankowski","full_name":"Stankowski, Sean","first_name":"Sean","id":"43161670-5719-11EA-8025-FABC3DDC885E"},{"first_name":"Roger K.","full_name":"Butlin, Roger K.","last_name":"Butlin"},{"last_name":"Faria","full_name":"Faria, Rui","first_name":"Rui"},{"first_name":"Kerstin","full_name":"Johannesson, Kerstin","last_name":"Johannesson"},{"orcid":"0000-0003-1050-4969","last_name":"Westram","full_name":"Westram, Anja M","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87"}],"title":"Differing associations between sex determination and sex-linked inversions in two ecotypes of Littorina saxatilis","_id":"12001","publication_status":"published","acknowledgement":"We thank A. Wright and four anonymous reviewers for valuable comments on an earlier draft of this manuscript and all members of the Littorina group for helpful discussions. This work was supported by a European Research Council grant to RKB and by a Natural Environment Research Council studentship to KEH through the ACCE doctoral training program. KJ acknowledges support from the Swedish Science Research Council VR (Vetenskaprådet) (2017-03798). RF was supported by an FCT CEEC (Fundação para a Ciênca e a Tecnologia, Concurso Estímulo ao Emprego Científico) contract (2020.00275.CEECIND).","status":"public","publication_identifier":{"eissn":["2056-3744"]},"oa_version":"Published Version","day":"01","citation":{"mla":"Hearn, Katherine E., et al. “Differing Associations between Sex Determination and Sex-Linked Inversions in Two Ecotypes of Littorina Saxatilis.” <i>Evolution Letters</i>, vol. 6, no. 5, Oxford Academic, 2022, pp. 358–74, doi:<a href=\"https://doi.org/10.1002/evl3.295\">10.1002/evl3.295</a>.","chicago":"Hearn, Katherine E., Eva L. Koch, Sean Stankowski, Roger K. Butlin, Rui Faria, Kerstin Johannesson, and Anja M Westram. “Differing Associations between Sex Determination and Sex-Linked Inversions in Two Ecotypes of Littorina Saxatilis.” <i>Evolution Letters</i>. Oxford Academic, 2022. <a href=\"https://doi.org/10.1002/evl3.295\">https://doi.org/10.1002/evl3.295</a>.","apa":"Hearn, K. E., Koch, E. L., Stankowski, S., Butlin, R. K., Faria, R., Johannesson, K., &#38; Westram, A. M. (2022). Differing associations between sex determination and sex-linked inversions in two ecotypes of Littorina saxatilis. <i>Evolution Letters</i>. Oxford Academic. <a href=\"https://doi.org/10.1002/evl3.295\">https://doi.org/10.1002/evl3.295</a>","ieee":"K. E. Hearn <i>et al.</i>, “Differing associations between sex determination and sex-linked inversions in two ecotypes of Littorina saxatilis,” <i>Evolution Letters</i>, vol. 6, no. 5. Oxford Academic, pp. 358–374, 2022.","ista":"Hearn KE, Koch EL, Stankowski S, Butlin RK, Faria R, Johannesson K, Westram AM. 2022. Differing associations between sex determination and sex-linked inversions in two ecotypes of Littorina saxatilis. Evolution Letters. 6(5), 358–374.","short":"K.E. Hearn, E.L. Koch, S. Stankowski, R.K. Butlin, R. Faria, K. Johannesson, A.M. Westram, Evolution Letters 6 (2022) 358–374.","ama":"Hearn KE, Koch EL, Stankowski S, et al. Differing associations between sex determination and sex-linked inversions in two ecotypes of Littorina saxatilis. <i>Evolution Letters</i>. 2022;6(5):358-374. doi:<a href=\"https://doi.org/10.1002/evl3.295\">10.1002/evl3.295</a>"},"month":"10","ddc":["570"],"file_date_updated":"2023-02-27T07:17:42Z","has_accepted_license":"1","volume":6,"article_processing_charge":"Yes","file":[{"success":1,"date_updated":"2023-02-27T07:17:42Z","access_level":"open_access","checksum":"2dcd06186a11b7d1be4cddc6b189f8fb","content_type":"application/pdf","file_name":"2022_EvolutionLetters_Hearn.pdf","creator":"dernst","relation":"main_file","file_size":2368965,"file_id":"12686","date_created":"2023-02-27T07:17:42Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"isi":1,"publisher":"Springer Nature","intvolume":"         5","date_created":"2022-09-04T22:02:02Z","scopus_import":"1","external_id":{"isi":["000844814800007"]},"date_published":"2022-08-25T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"TiVo"}],"article_number":"873","article_type":"original","date_updated":"2023-08-03T13:22:42Z","publication":"Communications biology","year":"2022","oa":1,"volume":5,"article_processing_charge":"No","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_name":"2022_CommBiology_Jia.pdf","creator":"dernst","relation":"main_file","file_size":2491191,"access_level":"open_access","content_type":"application/pdf","checksum":"3ec724c4f6d3440028c217305e32915f","success":1,"date_updated":"2022-09-05T08:55:11Z","file_id":"12022","date_created":"2022-09-05T08:55:11Z"}],"oa_version":"Published Version","ddc":["570"],"file_date_updated":"2022-09-05T08:55:11Z","month":"08","citation":{"chicago":"Jia, David W., Tim P Vogels, and Rui Ponte Costa. “Developmental Depression-to-Facilitation Shift Controls Excitation-Inhibition Balance.” <i>Communications Biology</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s42003-022-03801-2\">https://doi.org/10.1038/s42003-022-03801-2</a>.","mla":"Jia, David W., et al. “Developmental Depression-to-Facilitation Shift Controls Excitation-Inhibition Balance.” <i>Communications Biology</i>, vol. 5, 873, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s42003-022-03801-2\">10.1038/s42003-022-03801-2</a>.","short":"D.W. Jia, T.P. Vogels, R.P. Costa, Communications Biology 5 (2022).","ista":"Jia DW, Vogels TP, Costa RP. 2022. Developmental depression-to-facilitation shift controls excitation-inhibition balance. Communications biology. 5, 873.","ama":"Jia DW, Vogels TP, Costa RP. Developmental depression-to-facilitation shift controls excitation-inhibition balance. <i>Communications biology</i>. 2022;5. doi:<a href=\"https://doi.org/10.1038/s42003-022-03801-2\">10.1038/s42003-022-03801-2</a>","apa":"Jia, D. W., Vogels, T. P., &#38; Costa, R. P. (2022). Developmental depression-to-facilitation shift controls excitation-inhibition balance. <i>Communications Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42003-022-03801-2\">https://doi.org/10.1038/s42003-022-03801-2</a>","ieee":"D. W. Jia, T. P. Vogels, and R. P. Costa, “Developmental depression-to-facilitation shift controls excitation-inhibition balance,” <i>Communications biology</i>, vol. 5. Springer Nature, 2022."},"day":"25","ec_funded":1,"publication_status":"published","status":"public","acknowledgement":"We would like to thank the Vogels Lab for feedback on an earlier version of this manuscript. D.W.J. was supported by a Marshall Scholarship and a Clarendon Scholarship. R.P.C. and T.P.V. were supported by a Wellcome Trust and Royal Society Sir Henry Dale Fellowship (WT 100000), a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z), and an ERC Consolidator Grant (SYNAPSEEK).","project":[{"grant_number":"214316/Z/18/Z","_id":"c084a126-5a5b-11eb-8a69-d75314a70a87","name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks."},{"name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","call_identifier":"H2020","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","grant_number":"819603"}],"publication_identifier":{"eissn":["2399-3642"]},"doi":"10.1038/s42003-022-03801-2","abstract":[{"text":"Changes in the short-term dynamics of excitatory synapses over development have been observed throughout cortex, but their purpose and consequences remain unclear. Here, we propose that developmental changes in synaptic dynamics buffer the effect of slow inhibitory long-term plasticity, allowing for continuously stable neural activity. Using computational modeling we demonstrate that early in development excitatory short-term depression quickly stabilises neural activity, even in the face of strong, unbalanced excitation. We introduce a model of the commonly observed developmental shift from depression to facilitation and show that neural activity remains stable throughout development, while inhibitory synaptic plasticity slowly balances excitation, consistent with experimental observations. Our model predicts changes in the input responses from phasic to phasic-and-tonic and more precise spike timings. We also observe a gradual emergence of short-lasting memory traces governed by short-term plasticity development. We conclude that the developmental depression-to-facilitation shift may control excitation-inhibition balance throughout development with important functional consequences.","lang":"eng"}],"_id":"12009","title":"Developmental depression-to-facilitation shift controls excitation-inhibition balance","author":[{"last_name":"Jia","full_name":"Jia, David W.","first_name":"David W."},{"id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","first_name":"Tim P","full_name":"Vogels, Tim P","last_name":"Vogels","orcid":"0000-0003-3295-6181"},{"first_name":"Rui Ponte","full_name":"Costa, Rui Ponte","last_name":"Costa"}]},{"oa_version":"Preprint","conference":{"name":"ICRA: International Conference on Robotics and Automation","end_date":"2022-05-27","location":"Philadelphia, PA, United States","start_date":"2022-05-23"},"month":"07","citation":{"apa":"Brunnbauer, A., Berducci, L., Brandstatter, A., Lechner, M., Hasani, R., Rus, D., &#38; Grosu, R. (2022). Latent imagination facilitates zero-shot transfer in autonomous racing. In <i>2022 International Conference on Robotics and Automation</i> (pp. 7513–7520). Philadelphia, PA, United States: IEEE. <a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">https://doi.org/10.1109/ICRA46639.2022.9811650</a>","ieee":"A. Brunnbauer <i>et al.</i>, “Latent imagination facilitates zero-shot transfer in autonomous racing,” in <i>2022 International Conference on Robotics and Automation</i>, Philadelphia, PA, United States, 2022, pp. 7513–7520.","ista":"Brunnbauer A, Berducci L, Brandstatter A, Lechner M, Hasani R, Rus D, Grosu R. 2022. Latent imagination facilitates zero-shot transfer in autonomous racing. 2022 International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, 7513–7520.","ama":"Brunnbauer A, Berducci L, Brandstatter A, et al. Latent imagination facilitates zero-shot transfer in autonomous racing. In: <i>2022 International Conference on Robotics and Automation</i>. IEEE; 2022:7513-7520. doi:<a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">10.1109/ICRA46639.2022.9811650</a>","short":"A. Brunnbauer, L. Berducci, A. Brandstatter, M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, 2022 International Conference on Robotics and Automation, IEEE, 2022, pp. 7513–7520.","mla":"Brunnbauer, Axel, et al. “Latent Imagination Facilitates Zero-Shot Transfer in Autonomous Racing.” <i>2022 International Conference on Robotics and Automation</i>, IEEE, 2022, pp. 7513–20, doi:<a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">10.1109/ICRA46639.2022.9811650</a>.","chicago":"Brunnbauer, Axel, Luigi Berducci, Andreas Brandstatter, Mathias Lechner, Ramin Hasani, Daniela Rus, and Radu Grosu. “Latent Imagination Facilitates Zero-Shot Transfer in Autonomous Racing.” In <i>2022 International Conference on Robotics and Automation</i>, 7513–20. IEEE, 2022. <a href=\"https://doi.org/10.1109/ICRA46639.2022.9811650\">https://doi.org/10.1109/ICRA46639.2022.9811650</a>."},"day":"12","article_processing_charge":"No","arxiv":1,"doi":"10.1109/ICRA46639.2022.9811650","abstract":[{"text":"World models learn behaviors in a latent imagination space to enhance the sample-efficiency of deep reinforcement learning (RL) algorithms. While learning world models for high-dimensional observations (e.g., pixel inputs) has become practicable on standard RL benchmarks and some games, their effectiveness in real-world robotics applications has not been explored. In this paper, we investigate how such agents generalize to real-world autonomous vehicle control tasks, where advanced model-free deep RL algorithms fail. In particular, we set up a series of time-lap tasks for an F1TENTH racing robot, equipped with a high-dimensional LiDAR sensor, on a set of test tracks with a gradual increase in their complexity. In this continuous-control setting, we show that model-based agents capable of learning in imagination substantially outperform model-free agents with respect to performance, sample efficiency, successful task completion, and generalization. Moreover, we show that the generalization ability of model-based agents strongly depends on the choice of their observation model. We provide extensive empirical evidence for the effectiveness of world models provided with long enough memory horizons in sim2real tasks.","lang":"eng"}],"_id":"12010","title":"Latent imagination facilitates zero-shot transfer in autonomous racing","author":[{"full_name":"Brunnbauer, Axel","last_name":"Brunnbauer","first_name":"Axel"},{"first_name":"Luigi","full_name":"Berducci, Luigi","last_name":"Berducci"},{"first_name":"Andreas","full_name":"Brandstatter, Andreas","last_name":"Brandstatter"},{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"full_name":"Rus, Daniela","last_name":"Rus","first_name":"Daniela"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"ec_funded":1,"publication_status":"published","status":"public","acknowledgement":"L.B. was supported by the Doctoral College Resilient Embedded Systems. M.L. was supported in part by the ERC2020-AdG 101020093 and the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. were supported by The Boeing Company and the Office of Naval Research (ONR) Grant N00014-18-1-2830. R.G. was partially supported by the Horizon-2020 ECSEL Project grant No. 783163 (iDev40) and A.B. by FFG Project ADEX.","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"isbn":["9781728196817"],"issn":["1050-4729"]},"date_created":"2022-09-04T22:02:02Z","scopus_import":"1","external_id":{"arxiv":["2103.04909"]},"date_published":"2022-07-12T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","publisher":"IEEE","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2103.04909","open_access":"1"}],"year":"2022","oa":1,"page":"7513-7520","date_updated":"2022-09-05T08:46:12Z","publication":"2022 International Conference on Robotics and Automation"},{"month":"08","citation":{"ieee":"Y. Zhang, S. Jaggi, M. Langberg, and A. D. Sarwate, “The capacity of causal adversarial channels,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 2523–2528.","apa":"Zhang, Y., Jaggi, S., Langberg, M., &#38; Sarwate, A. D. (2022). The capacity of causal adversarial channels. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 2523–2528). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">https://doi.org/10.1109/ISIT50566.2022.9834709</a>","ista":"Zhang Y, Jaggi S, Langberg M, Sarwate AD. 2022. The capacity of causal adversarial channels. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2523–2528.","short":"Y. Zhang, S. Jaggi, M. Langberg, A.D. Sarwate, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2523–2528.","ama":"Zhang Y, Jaggi S, Langberg M, Sarwate AD. The capacity of causal adversarial channels. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:2523-2528. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">10.1109/ISIT50566.2022.9834709</a>","mla":"Zhang, Yihan, et al. “The Capacity of Causal Adversarial Channels.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 2523–28, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">10.1109/ISIT50566.2022.9834709</a>.","chicago":"Zhang, Yihan, Sidharth Jaggi, Michael Langberg, and Anand D. Sarwate. “The Capacity of Causal Adversarial Channels.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:2523–28. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">https://doi.org/10.1109/ISIT50566.2022.9834709</a>."},"day":"03","oa_version":"Preprint","conference":{"name":"ISIT: Internation Symposium on Information Theory","end_date":"2022-07-01","start_date":"2022-06-26","location":"Espoo, Finland"},"arxiv":1,"volume":2022,"article_processing_charge":"No","_id":"12011","title":"The capacity of causal adversarial channels","author":[{"first_name":"Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","last_name":"Zhang","full_name":"Zhang, Yihan"},{"last_name":"Jaggi","full_name":"Jaggi, Sidharth","first_name":"Sidharth"},{"first_name":"Michael","full_name":"Langberg, Michael","last_name":"Langberg"},{"full_name":"Sarwate, Anand D.","last_name":"Sarwate","first_name":"Anand D."}],"doi":"10.1109/ISIT50566.2022.9834709","abstract":[{"lang":"eng","text":"We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost constraints, (c) the transition matrix of the channel is deterministic given the state, and (d) at each time step the adversary can only observe the current and past channel inputs when choosing the state at that time. The achievable strategy involves stochastic encoding together with list decoding and a disambiguation step. The converse uses a two-phase \"babble-and-push\" strategy where the adversary chooses the state randomly in the first phase, list decodes the output, and then chooses state inputs to symmetrize the channel in the second phase. These results generalize prior work on specific channels models (additive, erasure) to general discrete alphabets and models."}],"publication_identifier":{"isbn":["9781665421591"],"issn":["2157-8095"]},"publication_status":"published","status":"public","acknowledgement":"The work of ADS and ML was supported in part by the US National Science Foundation under awards CCF-1909468 and CCF-1909451.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MaMo"}],"date_created":"2022-09-04T22:02:03Z","scopus_import":"1","external_id":{"arxiv":["2205.06708"]},"date_published":"2022-08-03T00:00:00Z","publisher":"IEEE","intvolume":"      2022","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2205.06708"}],"quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"oa":1,"year":"2022","date_updated":"2022-09-05T09:09:15Z","publication":"2022 IEEE International Symposium on Information Theory","page":"2523-2528"},{"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2203.15429","open_access":"1"}],"intvolume":"      2022","publisher":"IEEE","scopus_import":"1","date_created":"2022-09-04T22:02:04Z","external_id":{"arxiv":["2203.15429"]},"date_published":"2022-08-03T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MaMo"}],"page":"1623-1628","date_updated":"2022-09-05T10:28:35Z","publication":"2022 IEEE International Symposium on Information Theory","year":"2022","oa":1,"volume":2022,"article_processing_charge":"No","arxiv":1,"conference":{"location":"Espoo, Finland","start_date":"2022-06-26","end_date":"2022-07-01","name":"ISIT: Internation Symposium on Information Theory"},"oa_version":"Preprint","month":"08","day":"03","citation":{"ieee":"S. Torkamani, J. B. Ebrahimi, P. Sadeghi, R. G. L. D’Oliveira, and M. Médard, “Heterogeneous differential privacy via graphs,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 1623–1628.","apa":"Torkamani, S., Ebrahimi, J. B., Sadeghi, P., D’Oliveira, R. G. L., &#38; Médard, M. (2022). Heterogeneous differential privacy via graphs. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 1623–1628). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">https://doi.org/10.1109/ISIT50566.2022.9834711</a>","short":"S. Torkamani, J.B. Ebrahimi, P. Sadeghi, R.G.L. D’Oliveira, M. Médard, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 1623–1628.","ama":"Torkamani S, Ebrahimi JB, Sadeghi P, D’Oliveira RGL, Médard M. Heterogeneous differential privacy via graphs. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:1623-1628. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">10.1109/ISIT50566.2022.9834711</a>","ista":"Torkamani S, Ebrahimi JB, Sadeghi P, D’Oliveira RGL, Médard M. 2022. Heterogeneous differential privacy via graphs. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 1623–1628.","chicago":"Torkamani, Sahel, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G.L. D’Oliveira, and Muriel Médard. “Heterogeneous Differential Privacy via Graphs.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:1623–28. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">https://doi.org/10.1109/ISIT50566.2022.9834711</a>.","mla":"Torkamani, Sahel, et al. “Heterogeneous Differential Privacy via Graphs.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 1623–28, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">10.1109/ISIT50566.2022.9834711</a>."},"status":"public","publication_status":"published","publication_identifier":{"isbn":["9781665421591"],"issn":["2157-8095"]},"doi":"10.1109/ISIT50566.2022.9834711","abstract":[{"text":"This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. We generalize a previous framework for designing utility-optimal differentially private (DP) mechanisms via graphs, where datasets are vertices in the graph and edges represent dataset neighborhood. The boundary set contains datasets where an individual’s response changes the binary-valued query compared to its neighbors. Previous work was limited to the homogeneous case where the privacy parameter ε across all datasets was the same and the mechanism at boundary datasets was identical. In our work, the mechanism can take different distributions at the boundary and the privacy parameter ε is a function of neighboring datasets, which recovers an earlier definition of personalized DP as special case. The problem is how to extend the mechanism, which is only defined at the boundary set, to other datasets in the graph in a computationally efficient and utility optimal manner. Using the concept of strongest induced DP condition we solve this problem efficiently in polynomial time (in the size of the graph).","lang":"eng"}],"_id":"12012","author":[{"full_name":"Torkamani, Sahel","last_name":"Torkamani","id":"0503e7f8-2d05-11ed-aa17-db0640c720fc","first_name":"Sahel"},{"first_name":"Javad B.","full_name":"Ebrahimi, Javad B.","last_name":"Ebrahimi"},{"last_name":"Sadeghi","full_name":"Sadeghi, Parastoo","first_name":"Parastoo"},{"first_name":"Rafael G.L.","last_name":"D'Oliveira","full_name":"D'Oliveira, Rafael G.L."},{"full_name":"Médard, Muriel","last_name":"Médard","first_name":"Muriel"}],"title":"Heterogeneous differential privacy via graphs"},{"intvolume":"      2022","publisher":"IEEE","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":2022,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","day":"03","department":[{"_id":"MaMo"}],"citation":{"chicago":"Joshi, Pranav, Amritakshya Purkayastha, Yihan Zhang, Amitalok J. Budkuley, and Sidharth Jaggi. “On the Capacity of Additive AVCs with Feedback.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:504–9. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834850\">https://doi.org/10.1109/ISIT50566.2022.9834850</a>.","mla":"Joshi, Pranav, et al. “On the Capacity of Additive AVCs with Feedback.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 504–09, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834850\">10.1109/ISIT50566.2022.9834850</a>.","ieee":"P. Joshi, A. Purkayastha, Y. Zhang, A. J. Budkuley, and S. Jaggi, “On the capacity of additive AVCs with feedback,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 504–509.","apa":"Joshi, P., Purkayastha, A., Zhang, Y., Budkuley, A. J., &#38; Jaggi, S. (2022). On the capacity of additive AVCs with feedback. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 504–509). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834850\">https://doi.org/10.1109/ISIT50566.2022.9834850</a>","ama":"Joshi P, Purkayastha A, Zhang Y, Budkuley AJ, Jaggi S. On the capacity of additive AVCs with feedback. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:504-509. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834850\">10.1109/ISIT50566.2022.9834850</a>","ista":"Joshi P, Purkayastha A, Zhang Y, Budkuley AJ, Jaggi S. 2022. On the capacity of additive AVCs with feedback. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 504–509.","short":"P. Joshi, A. Purkayastha, Y. Zhang, A.J. Budkuley, S. Jaggi, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 504–509."},"scopus_import":"1","conference":{"name":"ISIT: Internation Symposium on Information Theory","end_date":"2022-07-01","start_date":"2022-06-26","location":"Espoo, Finland"},"date_created":"2022-09-04T22:02:04Z","oa_version":"None","date_published":"2022-08-03T00:00:00Z","date_updated":"2022-09-05T10:23:35Z","publication_identifier":{"isbn":["9781665421591"],"issn":["2157-8095"]},"publication":"2022 IEEE International Symposium on Information Theory","page":"504-509","publication_status":"published","status":"public","_id":"12013","author":[{"full_name":"Joshi, Pranav","last_name":"Joshi","first_name":"Pranav"},{"full_name":"Purkayastha, Amritakshya","last_name":"Purkayastha","first_name":"Amritakshya"},{"full_name":"Zhang, Yihan","last_name":"Zhang","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","first_name":"Yihan"},{"first_name":"Amitalok J.","full_name":"Budkuley, Amitalok J.","last_name":"Budkuley"},{"first_name":"Sidharth","last_name":"Jaggi","full_name":"Jaggi, Sidharth"}],"title":"On the capacity of additive AVCs with feedback","doi":"10.1109/ISIT50566.2022.9834850","year":"2022","abstract":[{"text":"We consider the problem of communication over adversarial channels with feedback. Two parties comprising sender Alice and receiver Bob seek to communicate reliably. An adversary James observes Alice's channel transmission entirely and chooses, maliciously, its additive channel input or jamming state thereby corrupting Bob's observation. Bob can communicate over a one-way reverse link with Alice; we assume that transmissions over this feedback link cannot be corrupted by James. Our goal in this work is to study the optimum throughput or capacity over such channels with feedback. We first present results for the quadratically-constrained additive channel where communication is known to be impossible when the noise-to-signal (power) ratio (NSR) is at least 1. We present a novel achievability scheme to establish that positive rate communication is possible even when the NSR is as high as 8/9. We also present new converse upper bounds on the capacity of this channel under potentially stochastic encoders and decoders. We also study feedback communication over the more widely studied q-ary alphabet channel under additive noise. For the q -ary channel, where q > 2, it is well known that capacity is positive under full feedback if and only if the adversary can corrupt strictly less than half the transmitted symbols. We generalize this result and show that the same threshold holds for positive rate communication when the noiseless feedback may only be partial; our scheme employs a stochastic decoder. We extend this characterization, albeit partially, to fully deterministic schemes under partial noiseless feedback. We also present new converse upper bounds for q-ary channels under full feedback, where the encoder and/or decoder may privately randomize. Our converse results bring to the fore an interesting alternate expression for the well known converse bound for the q—ary channel under full feedback which, when specialized to the binary channel, also equals its known capacity.","lang":"eng"}]},{"date_published":"2022-08-03T00:00:00Z","conference":{"name":"ISIT: Internation Symposium on Information Theory","location":"Espoo, Finland","start_date":"2022-06-26","end_date":"2022-07-01"},"scopus_import":"1","oa_version":"None","date_created":"2022-09-04T22:02:04Z","day":"03","department":[{"_id":"MaMo"}],"citation":{"chicago":"Zhang, Yihan, and Shashank Vatedka. “List-Decodability of Poisson Point Processes.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:2559–64. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834512\">https://doi.org/10.1109/ISIT50566.2022.9834512</a>.","mla":"Zhang, Yihan, and Shashank Vatedka. “List-Decodability of Poisson Point Processes.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 2559–64, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834512\">10.1109/ISIT50566.2022.9834512</a>.","apa":"Zhang, Y., &#38; Vatedka, S. (2022). List-decodability of Poisson Point Processes. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 2559–2564). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834512\">https://doi.org/10.1109/ISIT50566.2022.9834512</a>","ieee":"Y. Zhang and S. Vatedka, “List-decodability of Poisson Point Processes,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 2559–2564.","ista":"Zhang Y, Vatedka S. 2022. List-decodability of Poisson Point Processes. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2559–2564.","ama":"Zhang Y, Vatedka S. List-decodability of Poisson Point Processes. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:2559-2564. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834512\">10.1109/ISIT50566.2022.9834512</a>","short":"Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2559–2564."},"month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","article_processing_charge":"No","volume":2022,"intvolume":"      2022","publisher":"IEEE","year":"2022","abstract":[{"lang":"eng","text":"We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let N > 0 and L∈Z≥2. A multiple packing is a set C of points in Rn such that any point in Rn lies in the intersection of at most L – 1 balls of radius nN−−−√ around points in C. Given a well-known connection with coding theory, multiple packings can be viewed as the Euclidean analog of list-decodable codes, which are well-studied for finite fields. In this paper, we exactly pin down the asymptotic density of (expurgated) Poisson Point Processes under a stronger notion called average-radius multiple packing. To this end, we apply tools from high-dimensional geometry and large deviation theory. This gives rise to the best known lower bound on the largest multiple packing density. Our result corrects a mistake in a previous paper by Blinovsky [Bli05]."}],"doi":"10.1109/ISIT50566.2022.9834512","author":[{"last_name":"Zhang","full_name":"Zhang, Yihan","first_name":"Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"},{"last_name":"Vatedka","full_name":"Vatedka, Shashank","first_name":"Shashank"}],"title":"List-decodability of Poisson Point Processes","_id":"12014","publication_status":"published","status":"public","page":"2559-2564","publication_identifier":{"isbn":["9781665421591"],"issn":["2157-8095"]},"publication":"2022 IEEE International Symposium on Information Theory","date_updated":"2022-09-05T09:23:04Z"},{"article_processing_charge":"No","volume":2022,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","publisher":"IEEE","intvolume":"      2022","date_created":"2022-09-04T22:02:05Z","oa_version":"None","conference":{"name":"ISIT: Internation Symposium on Information Theory","location":"Espoo, Finland","start_date":"2022-06-26","end_date":"2022-07-01"},"scopus_import":"1","date_published":"2022-08-03T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","citation":{"ieee":"Y. Zhang and S. Vatedka, “Lower bounds for multiple packing,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 3085–3090.","apa":"Zhang, Y., &#38; Vatedka, S. (2022). Lower bounds for multiple packing. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 3085–3090). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834443\">https://doi.org/10.1109/ISIT50566.2022.9834443</a>","ista":"Zhang Y, Vatedka S. 2022. Lower bounds for multiple packing. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 3085–3090.","short":"Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 3085–3090.","ama":"Zhang Y, Vatedka S. Lower bounds for multiple packing. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:3085-3090. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834443\">10.1109/ISIT50566.2022.9834443</a>","mla":"Zhang, Yihan, and Shashank Vatedka. “Lower Bounds for Multiple Packing.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 3085–90, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834443\">10.1109/ISIT50566.2022.9834443</a>.","chicago":"Zhang, Yihan, and Shashank Vatedka. “Lower Bounds for Multiple Packing.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:3085–90. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834443\">https://doi.org/10.1109/ISIT50566.2022.9834443</a>."},"department":[{"_id":"MaMo"}],"day":"03","page":"3085-3090","publication_status":"published","status":"public","date_updated":"2022-09-05T10:39:04Z","publication":"2022 IEEE International Symposium on Information Theory","publication_identifier":{"isbn":["9781665421591"],"issn":["2157-8095"]},"doi":"10.1109/ISIT50566.2022.9834443","abstract":[{"text":"We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let P, N > 0 and L∈Z≥2. A multiple packing is a set C of points in Bn(0–,nP−−−√) such that any point in ℝ n lies in the intersection of at most L – 1 balls of radius nN−−−√ around points in C. 1 In this paper, we derive two lower bounds on the largest possible density of a multiple packing. These bounds are obtained through a stronger notion called average-radius multiple packing. Specifically, we exactly pin down the asymptotics of (expurgated) Gaussian codes and (expurgated) spherical codes under average-radius multiple packing. To this end, we apply tools from high-dimensional geometry and large deviation theory. The bound for spherical codes matches the previous best known bound which was obtained for the standard (weaker) notion of multiple packing through a curious connection with error exponents [Bli99], [ZV21]. The bound for Gaussian codes suggests that they are strictly inferior to spherical codes.","lang":"eng"}],"year":"2022","_id":"12015","title":"Lower bounds for multiple packing","author":[{"full_name":"Zhang, Yihan","last_name":"Zhang","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","first_name":"Yihan"},{"last_name":"Vatedka","full_name":"Vatedka, Shashank","first_name":"Shashank"}]},{"page":"2154-2159","date_updated":"2024-09-10T13:03:17Z","publication":"2022 IEEE International Symposium on Information Theory","year":"2022","oa":1,"language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","publisher":"IEEE","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2201.10082"}],"intvolume":"      2022","date_created":"2022-09-04T22:02:05Z","scopus_import":"1","external_id":{"arxiv":["2201.10082"]},"date_published":"2022-08-03T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MaMo"}],"publication_status":"published","status":"public","acknowledgement":"D. Fathollahi and M. Mondelli were partially supported by the 2019 Lopez-Loreta Prize. The authors thank Hamed Hassani and Hessam Mahdavifar for helpful discussions.","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"publication_identifier":{"isbn":["9781665421591"],"issn":["2157-8095"]},"doi":"10.1109/ISIT50566.2022.9834712","abstract":[{"lang":"eng","text":"We consider the problem of coded distributed computing using polar codes. The average execution time of a coded computing system is related to the error probability for transmission over the binary erasure channel in recent work by Soleymani, Jamali and Mahdavifar, where the performance of binary linear codes is investigated. In this paper, we focus on polar codes and unveil a connection between the average execution time and the scaling exponent μ of the family of codes. In the finite-length characterization of polar codes, the scaling exponent is a key object capturing the speed of convergence to capacity. In particular, we show that (i) the gap between the normalized average execution time of polar codes and that of optimal MDS codes is O(n –1/μ ), and (ii) this upper bound can be improved to roughly O(n –1/2 ) by considering polar codes with large kernels. We conjecture that these bounds could be improved to O(n –2/μ ) and O(n –1 ), respectively, and provide a heuristic argument as well as numerical evidence supporting this view."}],"_id":"12016","title":"Polar coded computing: The role of the scaling exponent","author":[{"last_name":"Fathollahi","full_name":"Fathollahi, Dorsa","first_name":"Dorsa"},{"last_name":"Mondelli","full_name":"Mondelli, Marco","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"}],"volume":2022,"article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","conference":{"name":"ISIT: Internation Symposium on Information Theory","end_date":"2022-07-01","location":"Espoo, Finland","start_date":"2022-06-26"},"month":"08","citation":{"ieee":"D. Fathollahi and M. Mondelli, “Polar coded computing: The role of the scaling exponent,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 2154–2159.","apa":"Fathollahi, D., &#38; Mondelli, M. (2022). Polar coded computing: The role of the scaling exponent. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 2154–2159). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834712\">https://doi.org/10.1109/ISIT50566.2022.9834712</a>","short":"D. Fathollahi, M. Mondelli, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2154–2159.","ista":"Fathollahi D, Mondelli M. 2022. Polar coded computing: The role of the scaling exponent. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2154–2159.","ama":"Fathollahi D, Mondelli M. Polar coded computing: The role of the scaling exponent. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:2154-2159. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834712\">10.1109/ISIT50566.2022.9834712</a>","mla":"Fathollahi, Dorsa, and Marco Mondelli. “Polar Coded Computing: The Role of the Scaling Exponent.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 2154–59, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834712\">10.1109/ISIT50566.2022.9834712</a>.","chicago":"Fathollahi, Dorsa, and Marco Mondelli. “Polar Coded Computing: The Role of the Scaling Exponent.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:2154–59. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834712\">https://doi.org/10.1109/ISIT50566.2022.9834712</a>."},"day":"03"},{"publication":"2022 IEEE International Symposium on Information Theory","publication_identifier":{"issn":["2157-8095"],"isbn":["9781665421591"]},"date_updated":"2023-02-13T09:00:14Z","publication_status":"published","status":"public","page":"2535-2540","author":[{"first_name":"Anuj Kumar","last_name":"Yadav","full_name":"Yadav, Anuj Kumar"},{"last_name":"Alimohammadi","full_name":"Alimohammadi, Mohammadreza","first_name":"Mohammadreza"},{"last_name":"Zhang","full_name":"Zhang, Yihan","first_name":"Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"},{"full_name":"Budkuley, Amitalok J.","last_name":"Budkuley","first_name":"Amitalok J."},{"first_name":"Sidharth","last_name":"Jaggi","full_name":"Jaggi, Sidharth"}],"title":"New results on AVCs with omniscient and myopic adversaries","_id":"12017","year":"2022","abstract":[{"lang":"eng","text":"In the classic adversarial communication problem, two parties communicate over a noisy channel in the presence of a malicious jamming adversary. The arbitrarily varying channels (AVCs) offer an elegant framework to study a wide range of interesting adversary models. The optimal throughput or capacity over such AVCs is intimately tied to the underlying adversary model; in some cases, capacity is unknown and the problem is known to be notoriously hard. The omniscient adversary, one which knows the sender’s entire channel transmission a priori, is one of such classic models of interest; the capacity under such an adversary remains an exciting open problem. The myopic adversary is a generalization of that model where the adversary’s observation may be corrupted over a noisy discrete memoryless channel. Through the adversary’s myopicity, one can unify the slew of different adversary models, ranging from the omniscient adversary to one that is completely blind to the transmission (the latter is the well known oblivious model where the capacity is fully characterized).In this work, we present new results on the capacity under both the omniscient and myopic adversary models. We completely characterize the positive capacity threshold over general AVCs with omniscient adversaries. The characterization is in terms of two key combinatorial objects: the set of completely positive distributions and the CP-confusability set. For omniscient AVCs with positive capacity, we present non-trivial lower and upper bounds on the capacity; unlike some of the previous bounds, our bounds hold under fairly general input and jamming constraints. Our lower bound improves upon the generalized Gilbert-Varshamov bound for general AVCs while the upper bound generalizes the well known Elias-Bassalygo bound (known for binary and q-ary alphabets). For the myopic AVCs, we build on prior results known for the so-called sufficiently myopic model, and present new results on the positive rate communication threshold over the so-called insufficiently myopic regime (a completely insufficient myopic adversary specializes to an omniscient adversary). We present interesting examples for the widely studied models of adversarial bit-flip and bit-erasure channels. In fact, for the bit-flip AVC with additive adversarial noise as well as random noise, we completely characterize the omniscient model capacity when the random noise is sufficiently large vis-a-vis the adversary’s budget."}],"doi":"10.1109/ISIT50566.2022.9834632","intvolume":"      2022","publisher":"Institute of Electrical and Electronics Engineers","language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","volume":2022,"article_processing_charge":"No","day":"03","department":[{"_id":"MaMo"}],"citation":{"mla":"Yadav, Anuj Kumar, et al. “New Results on AVCs with Omniscient and Myopic Adversaries.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, Institute of Electrical and Electronics Engineers, 2022, pp. 2535–40, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834632\">10.1109/ISIT50566.2022.9834632</a>.","chicago":"Yadav, Anuj Kumar, Mohammadreza Alimohammadi, Yihan Zhang, Amitalok J. Budkuley, and Sidharth Jaggi. “New Results on AVCs with Omniscient and Myopic Adversaries.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:2535–40. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834632\">https://doi.org/10.1109/ISIT50566.2022.9834632</a>.","ieee":"A. K. Yadav, M. Alimohammadi, Y. Zhang, A. J. Budkuley, and S. Jaggi, “New results on AVCs with omniscient and myopic adversaries,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 2535–2540.","apa":"Yadav, A. K., Alimohammadi, M., Zhang, Y., Budkuley, A. J., &#38; Jaggi, S. (2022). New results on AVCs with omniscient and myopic adversaries. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 2535–2540). Espoo, Finland: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834632\">https://doi.org/10.1109/ISIT50566.2022.9834632</a>","ista":"Yadav AK, Alimohammadi M, Zhang Y, Budkuley AJ, Jaggi S. 2022. New results on AVCs with omniscient and myopic adversaries. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2535–2540.","short":"A.K. Yadav, M. Alimohammadi, Y. Zhang, A.J. Budkuley, S. Jaggi, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 2535–2540.","ama":"Yadav AK, Alimohammadi M, Zhang Y, Budkuley AJ, Jaggi S. New results on AVCs with omniscient and myopic adversaries. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. Institute of Electrical and Electronics Engineers; 2022:2535-2540. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834632\">10.1109/ISIT50566.2022.9834632</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","date_published":"2022-08-03T00:00:00Z","scopus_import":"1","conference":{"location":"Espoo, Finland","start_date":"2022-06-26","end_date":"2022-07-01","name":"ISIT: Internation Symposium on Information Theory"},"oa_version":"None","date_created":"2022-09-04T22:02:06Z"},{"date_updated":"2023-02-13T09:02:06Z","publication_identifier":{"isbn":["9781665421591"],"issn":["2157-8095"]},"publication":"2022 IEEE International Symposium on Information Theory","page":"1324-1329","publication_status":"published","status":"public","_id":"12018","author":[{"full_name":"Zhang, Yihan","last_name":"Zhang","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","first_name":"Yihan"},{"full_name":"Vatedka, Shashank","last_name":"Vatedka","first_name":"Shashank"}],"title":"Lower bounds on list decoding capacity using error exponents","doi":"10.1109/ISIT50566.2022.9834815","year":"2022","abstract":[{"lang":"eng","text":"We study the problem of characterizing the maximal rates of list decoding in Euclidean spaces for finite list sizes. For any positive integer L ≥ 2 and real N > 0, we say that a subset C⊂Rn is an (N,L – 1)-multiple packing or an (N,L– 1)-list decodable code if every Euclidean ball of radius nN−−−√ in ℝ n contains no more than L − 1 points of C. We study this problem with and without ℓ 2 norm constraints on C, and derive the best-known lower bounds on the maximal rate for (N,L−1) multiple packing. Our bounds are obtained via error exponents for list decoding over Additive White Gaussian Noise (AWGN) channels. We establish a curious inequality which relates the error exponent, a quantity of average-case nature, to the list-decoding radius, a quantity of worst-case nature. We derive various bounds on the error exponent for list decoding in both bounded and unbounded settings which could be of independent interest beyond multiple packing."}],"intvolume":"      2022","publisher":"Institute of Electrical and Electronics Engineers","language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","volume":2022,"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","department":[{"_id":"MaMo"}],"day":"03","citation":{"ieee":"Y. Zhang and S. Vatedka, “Lower bounds on list decoding capacity using error exponents,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 1324–1329.","apa":"Zhang, Y., &#38; Vatedka, S. (2022). Lower bounds on list decoding capacity using error exponents. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 1324–1329). Espoo, Finland: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834815\">https://doi.org/10.1109/ISIT50566.2022.9834815</a>","short":"Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 1324–1329.","ama":"Zhang Y, Vatedka S. Lower bounds on list decoding capacity using error exponents. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. Institute of Electrical and Electronics Engineers; 2022:1324-1329. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834815\">10.1109/ISIT50566.2022.9834815</a>","ista":"Zhang Y, Vatedka S. 2022. Lower bounds on list decoding capacity using error exponents. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 1324–1329.","chicago":"Zhang, Yihan, and Shashank Vatedka. “Lower Bounds on List Decoding Capacity Using Error Exponents.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:1324–29. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834815\">https://doi.org/10.1109/ISIT50566.2022.9834815</a>.","mla":"Zhang, Yihan, and Shashank Vatedka. “Lower Bounds on List Decoding Capacity Using Error Exponents.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, Institute of Electrical and Electronics Engineers, 2022, pp. 1324–29, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834815\">10.1109/ISIT50566.2022.9834815</a>."},"scopus_import":"1","conference":{"start_date":"2022-06-26","location":"Espoo, Finland","end_date":"2022-07-01","name":"ISIT: Internation Symposium on Information Theory"},"oa_version":"None","date_created":"2022-09-04T22:02:06Z","date_published":"2022-08-03T00:00:00Z"},{"date_published":"2022-08-03T00:00:00Z","date_created":"2022-09-04T22:02:07Z","oa_version":"None","conference":{"start_date":"2022-06-26","location":"Espoo, Finland","end_date":"2022-07-01","name":"ISIT: Internation Symposium on Information Theory"},"scopus_import":"1","citation":{"mla":"Polyanskii, Nikita, and Yihan Zhang. “List-Decodable Zero-Rate Codes for the Z-Channel.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, Institute of Electrical and Electronics Engineers, 2022, pp. 2553–58, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834829\">10.1109/ISIT50566.2022.9834829</a>.","chicago":"Polyanskii, Nikita, and Yihan Zhang. “List-Decodable Zero-Rate Codes for the Z-Channel.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:2553–58. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834829\">https://doi.org/10.1109/ISIT50566.2022.9834829</a>.","ieee":"N. Polyanskii and Y. Zhang, “List-decodable zero-rate codes for the Z-channel,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 2553–2558.","apa":"Polyanskii, N., &#38; Zhang, Y. (2022). List-decodable zero-rate codes for the Z-channel. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 2553–2558). Espoo, Finland: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834829\">https://doi.org/10.1109/ISIT50566.2022.9834829</a>","ama":"Polyanskii N, Zhang Y. List-decodable zero-rate codes for the Z-channel. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. Institute of Electrical and Electronics Engineers; 2022:2553-2558. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834829\">10.1109/ISIT50566.2022.9834829</a>","short":"N. Polyanskii, Y. Zhang, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 2553–2558.","ista":"Polyanskii N, Zhang Y. 2022. List-decodable zero-rate codes for the Z-channel. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2553–2558."},"day":"03","department":[{"_id":"MaMo"}],"month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","volume":2022,"type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Institute of Electrical and Electronics Engineers","intvolume":"      2022","abstract":[{"text":"This paper studies combinatorial properties of codes for the Z-channel. A Z-channel with error fraction τ takes as input a length-n binary codeword and injects in an adversarial manner up to nτ asymmetric errors, i.e., errors that only zero out bits but do not flip 0’s to 1’s. It is known that the largest (L − 1)-list-decodable code for the Z-channel with error fraction τ has exponential (in n) size if τ is less than a critical value that we call the Plotkin point and has constant size if τ is larger than the threshold. The (L−1)-list-decoding Plotkin point is known to be L−1L−1−L−LL−1. In this paper, we show that the largest (L−1)-list-decodable code ε-above the Plotkin point has size Θ L (ε −3/2 ) for any L − 1 ≥ 1.","lang":"eng"}],"year":"2022","doi":"10.1109/ISIT50566.2022.9834829","title":"List-decodable zero-rate codes for the Z-channel","author":[{"first_name":"Nikita","full_name":"Polyanskii, Nikita","last_name":"Polyanskii"},{"first_name":"Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","last_name":"Zhang","full_name":"Zhang, Yihan"}],"_id":"12019","publication_status":"published","status":"public","page":"2553-2558","publication_identifier":{"isbn":["9781665421591"],"issn":["2157-8095"]},"publication":"2022 IEEE International Symposium on Information Theory","date_updated":"2023-02-13T09:02:18Z"}]