[{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.16648"}],"type":"preprint","month":"05","corr_author":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"project":[{"name":"Rational curves via function field analytic number theory","_id":"bd8a4fdc-d553-11ed-ba76-80a0167441a3","grant_number":"P36278"}],"date_created":"2024-10-10T13:15:43Z","publication_status":"submitted","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"id":"19013","relation":"later_version","status":"public"},{"relation":"dissertation_contains","id":"18132","status":"public"}]},"external_id":{"arxiv":["2405.16648"]},"arxiv":1,"year":"2024","abstract":[{"text":"By developing a suitable version of the circle method, we show that the space of degree e rational curves on a smooth hypersurface of degree d has only canonical singularities provided its dimension is sufficiently large with respect to e and d.","lang":"eng"}],"das_tickbox":"0","date_updated":"2026-10-21T11:02:29Z","status":"public","article_processing_charge":"No","department":[{"_id":"TiBr"}],"OA_place":"repository","author":[{"full_name":"Glas, Jakob","first_name":"Jakob","id":"d6423cba-dc74-11ea-a0a7-ee61689ff5fb","last_name":"Glas"}],"day":"26","fulldoi":"https://doi.org/10.48550/arXiv.2405.16648","title":"Canonical singularities on moduli spaces of rational curves via the  circle method","date_published":"2024-05-26T00:00:00Z","_id":"18295","citation":{"apa":"Glas, J. (n.d.). Canonical singularities on moduli spaces of rational curves via the  circle method. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2405.16648\">https://doi.org/10.48550/arXiv.2405.16648</a>","ama":"Glas J. Canonical singularities on moduli spaces of rational curves via the  circle method. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2405.16648\">10.48550/arXiv.2405.16648</a>","ieee":"J. Glas, “Canonical singularities on moduli spaces of rational curves via the  circle method,” <i>arXiv</i>. .","mla":"Glas, Jakob. “Canonical Singularities on Moduli Spaces of Rational Curves via the  Circle Method.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2405.16648\">10.48550/arXiv.2405.16648</a>.","chicago":"Glas, Jakob. “Canonical Singularities on Moduli Spaces of Rational Curves via the  Circle Method.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2405.16648\">https://doi.org/10.48550/arXiv.2405.16648</a>.","ista":"Glas J. Canonical singularities on moduli spaces of rational curves via the  circle method. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2405.16648\">10.48550/arXiv.2405.16648</a>.","short":"J. Glas, ArXiv (n.d.)."},"oa_version":"Preprint","researchdata_availability":"no","supplementarymaterial":"no","language":[{"iso":"eng"}],"doi":"10.48550/arXiv.2405.16648","publication":"arXiv"},{"_id":"19013","citation":{"short":"J. Glas, M. Hase-Liu, ArXiv (n.d.).","ista":"Glas J, Hase-Liu M. Terminal singularities of the moduli space of curves on low degree hypersurfaces and the circle method. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2412.14923\">10.48550/arXiv.2412.14923</a>.","chicago":"Glas, Jakob, and Matthew  Hase-Liu. “Terminal Singularities of the Moduli Space of Curves on Low Degree Hypersurfaces and the Circle Method.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2412.14923\">https://doi.org/10.48550/arXiv.2412.14923</a>.","mla":"Glas, Jakob, and Matthew Hase-Liu. “Terminal Singularities of the Moduli Space of Curves on Low Degree Hypersurfaces and the Circle Method.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2412.14923\">10.48550/arXiv.2412.14923</a>.","ieee":"J. Glas and M. Hase-Liu, “Terminal singularities of the moduli space of curves on low degree hypersurfaces and the circle method,” <i>arXiv</i>. .","ama":"Glas J, Hase-Liu M. Terminal singularities of the moduli space of curves on low degree hypersurfaces and the circle method. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2412.14923\">10.48550/arXiv.2412.14923</a>","apa":"Glas, J., &#38; Hase-Liu, M. (n.d.). Terminal singularities of the moduli space of curves on low degree hypersurfaces and the circle method. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2412.14923\">https://doi.org/10.48550/arXiv.2412.14923</a>"},"date_published":"2024-12-19T00:00:00Z","researchdata_availability":"no","supplementarymaterial":"no","oa_version":"Preprint","publication":"arXiv","language":[{"iso":"eng"}],"doi":"10.48550/arXiv.2412.14923","article_processing_charge":"No","author":[{"id":"d6423cba-dc74-11ea-a0a7-ee61689ff5fb","last_name":"Glas","full_name":"Glas, Jakob","first_name":"Jakob"},{"last_name":"Hase-Liu","first_name":"Matthew ","full_name":"Hase-Liu, Matthew "}],"department":[{"_id":"TiBr"}],"OA_place":"repository","fulldoi":"https://doi.org/10.48550/arXiv.2412.14923","title":"Terminal singularities of the moduli space of curves on low degree hypersurfaces and the circle method","day":"19","year":"2024","abstract":[{"lang":"eng","text":"We study the singularities of the moduli space of degree e maps from smooth genus g curves to an arbitrary smooth hypersurface of low degree. For e large compared to g, we show that these moduli spaces have at worst terminal singularities. Our main approach is to study the jet schemes of these moduli spaces by developing a suitable form of the circle method."}],"date_updated":"2026-10-21T11:02:28Z","das_tickbox":"0","status":"public","type":"preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2412.14923","open_access":"1"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","oa":1,"month":"12","date_created":"2025-02-07T12:04:11Z","publication_status":"draft","related_material":{"record":[{"status":"public","id":"18295","relation":"earlier_version"}]},"external_id":{"arxiv":["2412.14923"]},"arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"department":[{"_id":"TiVo"}],"article_type":"original","OA_place":"publisher","author":[{"first_name":"Jerome","full_name":"Clatot, Jerome","last_name":"Clatot"},{"full_name":"Currin, Christopher","first_name":"Christopher","orcid":"0000-0002-4809-5059","id":"e8321fc5-3091-11eb-8a53-83f309a11ac9","last_name":"Currin"},{"first_name":"Qiansheng","full_name":"Liang, Qiansheng","last_name":"Liang"},{"last_name":"Pipatpolkai","first_name":"Tanadet","full_name":"Pipatpolkai, Tanadet"},{"full_name":"Massey, Shavonne L.","first_name":"Shavonne L.","last_name":"Massey"},{"last_name":"Helbig","first_name":"Ingo","full_name":"Helbig, Ingo"},{"first_name":"Lucie","full_name":"Delemotte, Lucie","last_name":"Delemotte"},{"first_name":"Tim P","full_name":"Vogels, Tim P","orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","last_name":"Vogels"},{"last_name":"Covarrubias","first_name":"Manuel","full_name":"Covarrubias, Manuel"},{"full_name":"Goldberg, Ethan M.","first_name":"Ethan M.","last_name":"Goldberg"}],"day":"16","fulldoi":"https://doi.org/10.1073/pnas.2307776121","title":"A structurally precise mechanism links an epilepsy-associated KCNC2 potassium channel mutation to interneuron dysfunction","article_processing_charge":"Yes (in subscription journal)","language":[{"iso":"eng"}],"doi":"10.1073/pnas.2307776121","publisher":"National Academy of Sciences","publication":"Proceedings of the National Academy of Sciences of the United States of America","dataavailabilitystatement":"Full modeling code is available at https://github.com/ChrisCurrin/pv-kcnc2","date_published":"2024-01-16T00:00:00Z","article_number":"e2307776121","citation":{"apa":"Clatot, J., Currin, C., Liang, Q., Pipatpolkai, T., Massey, S. L., Helbig, I., … Goldberg, E. M. (2024). A structurally precise mechanism links an epilepsy-associated KCNC2 potassium channel mutation to interneuron dysfunction. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2307776121\">https://doi.org/10.1073/pnas.2307776121</a>","ama":"Clatot J, Currin C, Liang Q, et al. A structurally precise mechanism links an epilepsy-associated KCNC2 potassium channel mutation to interneuron dysfunction. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2024;121(3). doi:<a href=\"https://doi.org/10.1073/pnas.2307776121\">10.1073/pnas.2307776121</a>","ieee":"J. Clatot <i>et al.</i>, “A structurally precise mechanism links an epilepsy-associated KCNC2 potassium channel mutation to interneuron dysfunction,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 121, no. 3. National Academy of Sciences, 2024.","mla":"Clatot, Jerome, et al. “A Structurally Precise Mechanism Links an Epilepsy-Associated KCNC2 Potassium Channel Mutation to Interneuron Dysfunction.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 121, no. 3, e2307776121, National Academy of Sciences, 2024, doi:<a href=\"https://doi.org/10.1073/pnas.2307776121\">10.1073/pnas.2307776121</a>.","chicago":"Clatot, Jerome, Christopher Currin, Qiansheng Liang, Tanadet Pipatpolkai, Shavonne L. Massey, Ingo Helbig, Lucie Delemotte, Tim P Vogels, Manuel Covarrubias, and Ethan M. Goldberg. “A Structurally Precise Mechanism Links an Epilepsy-Associated KCNC2 Potassium Channel Mutation to Interneuron Dysfunction.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2024. <a href=\"https://doi.org/10.1073/pnas.2307776121\">https://doi.org/10.1073/pnas.2307776121</a>.","ista":"Clatot J, Currin C, Liang Q, Pipatpolkai T, Massey SL, Helbig I, Delemotte L, Vogels TP, Covarrubias M, Goldberg EM. 2024. A structurally precise mechanism links an epilepsy-associated KCNC2 potassium channel mutation to interneuron dysfunction. Proceedings of the National Academy of Sciences of the United States of America. 121(3), e2307776121.","short":"J. Clatot, C. Currin, Q. Liang, T. Pipatpolkai, S.L. Massey, I. Helbig, L. Delemotte, T.P. Vogels, M. Covarrubias, E.M. Goldberg, Proceedings of the National Academy of Sciences of the United States of America 121 (2024)."},"_id":"14841","intvolume":"       121","quality_controlled":"1","oa_version":"Published Version","pmid":1,"researchdata_availability":"yes","supplementarymaterial":"yes","project":[{"name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","grant_number":"819603","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","call_identifier":"H2020"}],"date_created":"2024-01-21T23:00:56Z","file_date_updated":"2025-04-23T13:51:16Z","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"link":[{"url":"https://github.com/ChrisCurrin/pv-kcnc2 ","relation":"software"}]},"external_id":{"pmid":["38194456"],"isi":["001167401000001"]},"type":"journal_article","issue":"3","month":"01","OA_type":"hybrid","has_accepted_license":"1","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publication_identifier":{"eissn":["1091-6490"]},"volume":121,"ddc":["570"],"ec_funded":1,"isi":1,"status":"public","abstract":[{"lang":"eng","text":"De novo heterozygous variants in KCNC2 encoding the voltage-gated potassium (K+) channel subunit Kv3.2 are a recently described cause of developmental and epileptic encephalopathy (DEE). A de novo variant in KCNC2 c.374G > A (p.Cys125Tyr) was identified via exome sequencing in a patient with DEE. Relative to wild-type Kv3.2, Kv3.2-p.Cys125Tyr induces K+ currents exhibiting a large hyperpolarizing shift in the voltage dependence of activation, accelerated activation, and delayed deactivation consistent with a relative stabilization of the open conformation, along with increased current density. Leveraging the cryogenic electron microscopy (cryo-EM) structure of Kv3.1, molecular dynamic simulations suggest that a strong π-π stacking interaction between the variant Tyr125 and Tyr156 in the α-6 helix of the T1 domain promotes a relative stabilization of the open conformation of the channel, which underlies the observed gain of function. A multicompartment computational model of a Kv3-expressing parvalbumin-positive cerebral cortex fast-spiking γ-aminobutyric acidergic (GABAergic) interneuron (PV-IN) demonstrates how the Kv3.2-Cys125Tyr variant impairs neuronal excitability and dysregulates inhibition in cerebral cortex circuits to explain the resulting epilepsy."}],"year":"2024","scopus_import":"1","file":[{"file_id":"19613","date_created":"2025-04-23T13:51:16Z","success":1,"relation":"main_file","creator":"dernst","file_size":3060109,"content_type":"application/pdf","file_name":"2024_PNAS_Clatot.pdf","checksum":"f498c643be81895dd3a69ee90115a782","access_level":"open_access","date_updated":"2025-04-23T13:51:16Z"}],"das_tickbox":"1","acknowledgement":"This work was supported by an ERC Consolidator Grant (SYNAPSEEK) to T.P.V., the NOMIS Foundation through the NOMIS Fellowships program at IST Austria to C.B.C., a Jefferson Synaptic Biology Center Pilot Project Grant to M.C., NIH NINDS U54 NS108874 (PI, Alfred L. George), and NIH NINDS R01 NS122887 to E.M.G. The computations were enabled by resources provided by the Swedish National Infrastructure for Computing (SNIC) at the PDC Center for High-Performance Computing, KTH Royal Institute of Technology, partially funded by the Swedish Research Council through grant agreement no. 2018-05973. We thank Akshay Sridhar for the fruitful discussion of the project.","date_updated":"2026-10-21T11:13:59Z"},{"external_id":{"isi":["001190081400001"],"pmid":["38509348 "]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-03-24T23:01:00Z","file_date_updated":"2025-06-25T08:45:32Z","publication_status":"published","project":[{"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"}],"page":"964-974","oa":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"05","OA_type":"hybrid","has_accepted_license":"1","type":"journal_article","status":"public","isi":1,"ec_funded":1,"volume":27,"publication_identifier":{"issn":["1097-6256"],"eissn":["1546-1726"]},"ddc":["570"],"date_updated":"2026-10-21T11:22:59Z","das_tickbox":"1","acknowledgement":"We thank C. Currin, B. Podlaski and the members of the Vogels group for fruitful discussions. E.J.A. and T.P.V. were supported by a Research Project Grant from the Leverhulme Trust (RPG-2016-446; TPV), a Sir Henry Dale Fellowship from the Wellcome Trust and the Royal Society (WT100000; T.P.V.), a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z; T.P.V.) and a European Research Council Consolidator Grant (SYNAPSEEK, 819603; T.P.V.). For the purpose of open access, the authors have applied a CC BY public copyright license to any author accepted manuscript version arising from this submission. Open access funding provided by University of Basel.","file":[{"file_name":"2025_NatureNeuroscience_Agnes.pdf","content_type":"application/pdf","checksum":"dfca68a24749575b912b3a78a7de4516","access_level":"open_access","date_updated":"2025-06-25T08:45:32Z","date_created":"2025-06-25T08:45:32Z","file_id":"19902","relation":"main_file","success":1,"creator":"dernst","file_size":10508018}],"abstract":[{"text":"The brain’s functionality is developed and maintained through synaptic plasticity. As synapses undergo plasticity, they also affect each other. The nature of such ‘co-dependency’ is difficult to disentangle experimentally, because multiple synapses must be monitored simultaneously. To help understand the experimentally observed phenomena, we introduce a framework that formalizes synaptic co-dependency between different connection types. The resulting model explains how inhibition can gate excitatory plasticity while neighboring excitatory–excitatory interactions determine the strength of long-term potentiation. Furthermore, we show how the interplay between excitatory and inhibitory synapses can account for the quick rise and long-term stability of a variety of synaptic weight profiles, such as orientation tuning and dendritic clustering of co-active synapses. In recurrent neuronal networks, co-dependent plasticity produces rich and stable motor cortex-like dynamics with high input sensitivity. Our results suggest an essential role for the neighborly synaptic interaction during learning, connecting micro-level physiology with network-wide phenomena.","lang":"eng"}],"year":"2024","scopus_import":"1","fulldoi":"https://doi.org/10.1038/s41593-024-01597-4","title":"Co-dependent excitatory and inhibitory plasticity accounts for quick, stable and long-lasting memories in biological networks","day":"01","author":[{"last_name":"Agnes","full_name":"Agnes, Everton J.","first_name":"Everton J."},{"id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","last_name":"Vogels","orcid":"0000-0003-3295-6181","full_name":"Vogels, Tim P","first_name":"Tim P"}],"department":[{"_id":"TiVo"}],"article_type":"original","OA_place":"publisher","article_processing_charge":"Yes (via OA deal)","dataavailabilitystatement":"Spike-timing-dependent plasticity data (ref. 15 and ref. 16) are publicly available from http://plasticity.muhc.mcgill.ca/page8.html.","publisher":"Springer Nature","publication":"Nature Neuroscience","language":[{"iso":"eng"}],"doi":"10.1038/s41593-024-01597-4","pmid":1,"researchdata_availability":"yes","supplementarymaterial":"yes","intvolume":"        27","quality_controlled":"1","oa_version":"Published Version","_id":"15171","citation":{"short":"E.J. Agnes, T.P. Vogels, Nature Neuroscience 27 (2024) 964–974.","ista":"Agnes EJ, Vogels TP. 2024. Co-dependent excitatory and inhibitory plasticity accounts for quick, stable and long-lasting memories in biological networks. Nature Neuroscience. 27, 964–974.","chicago":"Agnes, Everton J., and Tim P Vogels. “Co-Dependent Excitatory and Inhibitory Plasticity Accounts for Quick, Stable and Long-Lasting Memories in Biological Networks.” <i>Nature Neuroscience</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41593-024-01597-4\">https://doi.org/10.1038/s41593-024-01597-4</a>.","mla":"Agnes, Everton J., and Tim P. Vogels. “Co-Dependent Excitatory and Inhibitory Plasticity Accounts for Quick, Stable and Long-Lasting Memories in Biological Networks.” <i>Nature Neuroscience</i>, vol. 27, Springer Nature, 2024, pp. 964–74, doi:<a href=\"https://doi.org/10.1038/s41593-024-01597-4\">10.1038/s41593-024-01597-4</a>.","ama":"Agnes EJ, Vogels TP. Co-dependent excitatory and inhibitory plasticity accounts for quick, stable and long-lasting memories in biological networks. <i>Nature Neuroscience</i>. 2024;27:964-974. doi:<a href=\"https://doi.org/10.1038/s41593-024-01597-4\">10.1038/s41593-024-01597-4</a>","ieee":"E. J. Agnes and T. P. Vogels, “Co-dependent excitatory and inhibitory plasticity accounts for quick, stable and long-lasting memories in biological networks,” <i>Nature Neuroscience</i>, vol. 27. Springer Nature, pp. 964–974, 2024.","apa":"Agnes, E. J., &#38; Vogels, T. P. (2024). Co-dependent excitatory and inhibitory plasticity accounts for quick, stable and long-lasting memories in biological networks. <i>Nature Neuroscience</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41593-024-01597-4\">https://doi.org/10.1038/s41593-024-01597-4</a>"},"date_published":"2024-05-01T00:00:00Z"},{"author":[{"full_name":"Feitosa Tomé, Douglas","first_name":"Douglas","id":"0eed2d40-3d48-11ec-8d38-f789cc2e40b2","last_name":"Feitosa Tomé"},{"first_name":"Ying","full_name":"Zhang, Ying","last_name":"Zhang"},{"last_name":"Aida","first_name":"Tomomi","full_name":"Aida, Tomomi"},{"first_name":"Olivia","full_name":"Mosto, Olivia","last_name":"Mosto"},{"last_name":"Lu","full_name":"Lu, Yifeng","first_name":"Yifeng"},{"last_name":"Chen","full_name":"Chen, Mandy","first_name":"Mandy"},{"first_name":"Sadra","full_name":"Sadeh, Sadra","last_name":"Sadeh"},{"last_name":"Roy","first_name":"Dheeraj S.","full_name":"Roy, Dheeraj S."},{"last_name":"Clopath","full_name":"Clopath, Claudia","first_name":"Claudia"}],"department":[{"_id":"TiVo"}],"article_type":"original","fulldoi":"https://doi.org/10.1038/s41593-023-01551-w","title":"Dynamic and selective engrams emerge with memory consolidation","day":"01","article_processing_charge":"Yes (in subscription journal)","publisher":"Springer Nature","publication":"Nature Neuroscience","language":[{"iso":"eng"}],"doi":"10.1038/s41593-023-01551-w","dataavailabilitystatement":"The data necessary to reproduce the simulations and data analyses reported in this study are available in a public repository https://doi.org/10.5281/zenodo.10251086. Calcium imaging, individual mouse behavior and cell counting data are available in the Source Data files. Source data are provided with this paper.","citation":{"ama":"Feitosa Tomé D, Zhang Y, Aida T, et al. Dynamic and selective engrams emerge with memory consolidation. <i>Nature Neuroscience</i>. 2024;27:561-572. doi:<a href=\"https://doi.org/10.1038/s41593-023-01551-w\">10.1038/s41593-023-01551-w</a>","ieee":"D. Feitosa Tomé <i>et al.</i>, “Dynamic and selective engrams emerge with memory consolidation,” <i>Nature Neuroscience</i>, vol. 27. Springer Nature, pp. 561–572, 2024.","apa":"Feitosa Tomé, D., Zhang, Y., Aida, T., Mosto, O., Lu, Y., Chen, M., … Clopath, C. (2024). Dynamic and selective engrams emerge with memory consolidation. <i>Nature Neuroscience</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41593-023-01551-w\">https://doi.org/10.1038/s41593-023-01551-w</a>","ista":"Feitosa Tomé D, Zhang Y, Aida T, Mosto O, Lu Y, Chen M, Sadeh S, Roy DS, Clopath C. 2024. Dynamic and selective engrams emerge with memory consolidation. Nature Neuroscience. 27, 561–572.","short":"D. Feitosa Tomé, Y. Zhang, T. Aida, O. Mosto, Y. Lu, M. Chen, S. Sadeh, D.S. Roy, C. Clopath, Nature Neuroscience 27 (2024) 561–572.","mla":"Feitosa Tomé, Douglas, et al. “Dynamic and Selective Engrams Emerge with Memory Consolidation.” <i>Nature Neuroscience</i>, vol. 27, Springer Nature, 2024, pp. 561–72, doi:<a href=\"https://doi.org/10.1038/s41593-023-01551-w\">10.1038/s41593-023-01551-w</a>.","chicago":"Feitosa Tomé, Douglas, Ying Zhang, Tomomi Aida, Olivia Mosto, Yifeng Lu, Mandy Chen, Sadra Sadeh, Dheeraj S. Roy, and Claudia Clopath. “Dynamic and Selective Engrams Emerge with Memory Consolidation.” <i>Nature Neuroscience</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41593-023-01551-w\">https://doi.org/10.1038/s41593-023-01551-w</a>."},"_id":"14887","date_published":"2024-03-01T00:00:00Z","pmid":1,"researchdata_availability":"yes","supplementarymaterial":"yes","quality_controlled":"1","intvolume":"        27","oa_version":"Published Version","date_created":"2024-01-28T23:01:43Z","file_date_updated":"2024-07-16T12:15:19Z","publication_status":"published","page":"561-572","related_material":{"record":[{"relation":"research_data","id":"14892","status":"public"}]},"external_id":{"pmid":["38243089"],"isi":["001145442300001"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","oa":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","month":"03","has_accepted_license":"1","volume":27,"publication_identifier":{"issn":["1097-6256"],"eissn":["1546-1726"]},"ddc":["570"],"status":"public","isi":1,"file":[{"creator":"dernst","file_size":15830346,"file_id":"17268","date_created":"2024-07-16T12:15:19Z","success":1,"relation":"main_file","date_updated":"2024-07-16T12:15:19Z","access_level":"open_access","file_name":"2024_NatureNeuroscience_FeitosaTome.pdf","content_type":"application/pdf","checksum":"c509fcad757e4c1c153e857e55c20083"}],"year":"2024","abstract":[{"lang":"eng","text":"Episodic memories are encoded by experience-activated neuronal ensembles that remain necessary and sufficient for recall. However, the temporal evolution of memory engrams after initial encoding is unclear. In this study, we employed computational and experimental approaches to examine how the neural composition and selectivity of engrams change with memory consolidation. Our spiking neural network model yielded testable predictions: memories transition from unselective to selective as neurons drop out of and drop into engrams; inhibitory activity during recall is essential for memory selectivity; and inhibitory synaptic plasticity during memory consolidation is critical for engrams to become selective. Using activity-dependent labeling, longitudinal calcium imaging and a combination of optogenetic and chemogenetic manipulations in mouse dentate gyrus, we conducted contextual fear conditioning experiments that supported our model’s predictions. Our results reveal that memory engrams are dynamic and that changes in engram composition mediated by inhibitory plasticity are crucial for the emergence of memory selectivity."}],"scopus_import":"1","date_updated":"2026-10-21T11:20:36Z","das_tickbox":"1","acknowledgement":"We thank S. Erisken from Inscopix for helping us establish in vivo one-photon calcium imaging for this work. We thank K. Su at Tsinghua University for assistance with this work. This work was funded by the President’s PhD Scholarship from Imperial College London (D.F.T.), the Wellcome Trust (225412/Z/22/Z) (S.S.), the Biotechnology and Biological Sciences Research Council (BB/N013956/1 and BB/N019008/1) (C.C.), the Wellcome Trust (200790/Z/16/Z) (C.C.), the Simons Foundation (564408) (C.C.) and the Engineering and Physical Sciences Research Council (EP/R035806/1) (CC). The School of Life Sciences and the IDG/McGovern Institute for Brain Research supported Y.Z. The Warren Alpert Distinguished Scholar Award and National Institutes of Health 1K99NS125131-01 supported D.S.R."},{"article_processing_charge":"Yes","author":[{"id":"BA06AFEE-A4BA-11EA-AE5C-14673DDC885E","last_name":"Chintaluri","first_name":"Chaitanya","orcid":"0000-0003-4252-1608","full_name":"Chintaluri, Chaitanya"},{"last_name":"Bejtka","full_name":"Bejtka, Marta","first_name":"Marta"},{"last_name":"Sredniawa","first_name":"Wladyslaw","full_name":"Sredniawa, Wladyslaw"},{"last_name":"Czerwinski","first_name":"Michal","full_name":"Czerwinski, Michal"},{"full_name":"Dzik, Jakub M.","first_name":"Jakub M.","last_name":"Dzik"},{"full_name":"Jedrzejewska-Szmek, Joanna","first_name":"Joanna","last_name":"Jedrzejewska-Szmek"},{"full_name":"Wojciki, Daniel K.","first_name":"Daniel K.","last_name":"Wojciki"}],"OA_place":"publisher","article_type":"original","department":[{"_id":"TiVo"}],"title":"kCSD-python, reliable current source density estimation with quality control","fulldoi":"https://doi.org/10.1371/journal.pcbi.1011941","day":"14","_id":"15169","citation":{"ieee":"C. Chintaluri <i>et al.</i>, “kCSD-python, reliable current source density estimation with quality control,” <i>PLoS Computational Biology</i>, vol. 20, no. 3. Public Library of Science, 2024.","ama":"Chintaluri C, Bejtka M, Sredniawa W, et al. kCSD-python, reliable current source density estimation with quality control. <i>PLoS Computational Biology</i>. 2024;20(3). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">10.1371/journal.pcbi.1011941</a>","apa":"Chintaluri, C., Bejtka, M., Sredniawa, W., Czerwinski, M., Dzik, J. M., Jedrzejewska-Szmek, J., &#38; Wojciki, D. K. (2024). kCSD-python, reliable current source density estimation with quality control. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">https://doi.org/10.1371/journal.pcbi.1011941</a>","short":"C. Chintaluri, M. Bejtka, W. Sredniawa, M. Czerwinski, J.M. Dzik, J. Jedrzejewska-Szmek, D.K. Wojciki, PLoS Computational Biology 20 (2024).","ista":"Chintaluri C, Bejtka M, Sredniawa W, Czerwinski M, Dzik JM, Jedrzejewska-Szmek J, Wojciki DK. 2024. kCSD-python, reliable current source density estimation with quality control. PLoS Computational Biology. 20(3), e1011941.","chicago":"Chintaluri, Chaitanya, Marta Bejtka, Wladyslaw Sredniawa, Michal Czerwinski, Jakub M. Dzik, Joanna Jedrzejewska-Szmek, and Daniel K. Wojciki. “KCSD-Python, Reliable Current Source Density Estimation with Quality Control.” <i>PLoS Computational Biology</i>. Public Library of Science, 2024. <a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">https://doi.org/10.1371/journal.pcbi.1011941</a>.","mla":"Chintaluri, Chaitanya, et al. “KCSD-Python, Reliable Current Source Density Estimation with Quality Control.” <i>PLoS Computational Biology</i>, vol. 20, no. 3, e1011941, Public Library of Science, 2024, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1011941\">10.1371/journal.pcbi.1011941</a>."},"article_number":"e1011941","date_published":"2024-03-14T00:00:00Z","supplementarymaterial":"yes","pmid":1,"researchdata_availability":"yes","oa_version":"Published Version","intvolume":"        20","quality_controlled":"1","publication":"PLoS Computational Biology","publisher":"Public Library of Science","doi":"10.1371/journal.pcbi.1011941","language":[{"iso":"eng"}],"dataavailabilitystatement":"kCSD-python package, an implementation of the kernel Current Source Density method (https://doi.org/10.1162/NECO_a_00236) and its two variants ((https://doi.org/10.1007/s12021-015-9265-6) and (https://doi.org/10.7554/eLife.29384)) is available under the modified BSD License (3-Clause BSD) on GitHub (https://github.com/Neuroinflab/kCSD-python).","issue":"3","type":"journal_article","oa":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","has_accepted_license":"1","month":"03","OA_type":"gold","publication_status":"published","file_date_updated":"2025-06-25T05:47:36Z","date_created":"2024-03-24T23:00:59Z","external_id":{"isi":["001190689800001"],"pmid":["38484020"]},"related_material":{"link":[{"relation":"software","url":"https://github.com/Neuroinflab/kCSD-python"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file":[{"date_updated":"2025-06-25T05:47:36Z","access_level":"open_access","checksum":"c09718d0d09614642d877d0716ce32e8","content_type":"application/pdf","file_name":"2024_PLoSCompBio_Chintaluri.pdf","file_size":2540277,"creator":"dernst","success":1,"relation":"main_file","file_id":"19897","date_created":"2025-06-25T05:47:36Z"}],"scopus_import":"1","year":"2024","abstract":[{"lang":"eng","text":"Interpretation of extracellular recordings can be challenging due to the long range of electric field. This challenge can be mitigated by estimating the current source density (CSD). Here we introduce kCSD-python, an open Python package implementing Kernel Current Source Density (kCSD) method and related tools to facilitate CSD analysis of experimental data and the interpretation of results. We show how to counter the limitations imposed by noise and assumptions in the method itself. kCSD-python allows CSD estimation for an arbitrary distribution of electrodes in 1D, 2D, and 3D, assuming distributions of sources in tissue, a slice, or in a single cell, and includes a range of diagnostic aids. We demonstrate its features in a Jupyter Notebook tutorial which illustrates a typical analytical workflow and main functionalities useful in validating analysis results."}],"date_updated":"2026-10-21T11:22:14Z","acknowledgement":"The Python implementation of kCSD was started by Grzegorz Parka during Google Summer of Code project through the International Neuroinformatics Coordinating Facility. Jan Mąka implemented the first Python version of skCSD class. This work was supported by the Polish National Science Centre (2013/08/W/NZ4/00691 to DKW; 2015/17/B/ST7/04123 to DKW). ","das_tickbox":"1","ddc":["000","570"],"DOAJ_listed":"1","volume":20,"publication_identifier":{"eissn":["1553-7358"],"issn":["1553-734X"]},"status":"public","isi":1},{"language":[{"iso":"eng"}],"doi":"10.1523/JNEUROSCI.0846-23.2024","publisher":"Society for Neuroscience","publication":"Journal of Neuroscience","date_published":"2024-05-22T00:00:00Z","article_number":"e0846232024","citation":{"ama":"Delamare G, Feitosa Tomé D, Clopath C. Intrinsic neural excitability biases allocation and overlap of memory engrams. <i>Journal of Neuroscience</i>. 2024;44(21). doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0846-23.2024\">10.1523/JNEUROSCI.0846-23.2024</a>","ieee":"G. Delamare, D. Feitosa Tomé, and C. Clopath, “Intrinsic neural excitability biases allocation and overlap of memory engrams,” <i>Journal of Neuroscience</i>, vol. 44, no. 21. Society for Neuroscience, 2024.","apa":"Delamare, G., Feitosa Tomé, D., &#38; Clopath, C. (2024). Intrinsic neural excitability biases allocation and overlap of memory engrams. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.0846-23.2024\">https://doi.org/10.1523/JNEUROSCI.0846-23.2024</a>","short":"G. Delamare, D. Feitosa Tomé, C. Clopath, Journal of Neuroscience 44 (2024).","ista":"Delamare G, Feitosa Tomé D, Clopath C. 2024. Intrinsic neural excitability biases allocation and overlap of memory engrams. Journal of Neuroscience. 44(21), e0846232024.","chicago":"Delamare, Geoffroy, Douglas Feitosa Tomé, and Claudia Clopath. “Intrinsic Neural Excitability Biases Allocation and Overlap of Memory Engrams.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2024. <a href=\"https://doi.org/10.1523/JNEUROSCI.0846-23.2024\">https://doi.org/10.1523/JNEUROSCI.0846-23.2024</a>.","mla":"Delamare, Geoffroy, et al. “Intrinsic Neural Excitability Biases Allocation and Overlap of Memory Engrams.” <i>Journal of Neuroscience</i>, vol. 44, no. 21, e0846232024, Society for Neuroscience, 2024, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.0846-23.2024\">10.1523/JNEUROSCI.0846-23.2024</a>."},"_id":"17092","intvolume":"        44","quality_controlled":"1","oa_version":"Published Version","pmid":1,"researchdata_availability":"no","supplementarymaterial":"no","department":[{"_id":"TiVo"}],"article_type":"original","author":[{"first_name":"Geoffroy","full_name":"Delamare, Geoffroy","last_name":"Delamare"},{"full_name":"Feitosa Tomé, Douglas","first_name":"Douglas","id":"0eed2d40-3d48-11ec-8d38-f789cc2e40b2","last_name":"Feitosa Tomé"},{"full_name":"Clopath, Claudia","first_name":"Claudia","last_name":"Clopath"}],"day":"22","fulldoi":"https://doi.org/10.1523/JNEUROSCI.0846-23.2024","title":"Intrinsic neural excitability biases allocation and overlap of memory engrams","article_processing_charge":"Yes (in subscription journal)","publication_identifier":{"issn":["0270-6474"],"eissn":["1529-2401"]},"volume":44,"ddc":["570"],"isi":1,"status":"public","year":"2024","abstract":[{"text":"Memories are thought to be stored in neural ensembles known as engrams that are specifically reactivated during memory recall. Recent studies have found that memory engrams of two events that happened close in time tend to overlap in the hippocampus and the amygdala, and these overlaps have been shown to support memory linking. It has been hypothesized that engram overlaps arise from the mechanisms that regulate memory allocation itself, involving neural excitability, but the exact process remains unclear. Indeed, most theoretical studies focus on synaptic plasticity and little is known about the role of intrinsic plasticity, which could be mediated by neural excitability and serve as a complementary mechanism for forming memory engrams. Here, we developed a rate-based recurrent neural network that includes both synaptic plasticity and neural excitability. We obtained structural and functional overlap of memory engrams for contexts that are presented close in time, consistent with experimental and computational studies. We then investigated the role of excitability in memory allocation at the network level and unveiled competitive mechanisms driven by inhibition. This work suggests mechanisms underlying the role of intrinsic excitability in memory allocation and linking, and yields predictions regarding the formation and the overlap of memory engrams.","lang":"eng"}],"scopus_import":"1","file":[{"date_updated":"2024-06-03T06:34:21Z","access_level":"open_access","checksum":"4e19159800db605b802c721e4d4b1ffe","content_type":"application/pdf","file_name":"2024_JourNeuroscience_Delamare.pdf","file_size":920354,"creator":"dernst","relation":"main_file","success":1,"date_created":"2024-06-03T06:34:21Z","file_id":"17095"}],"das_tickbox":"0","acknowledgement":"We thank Sadra Sadeh and Inês Completo Guerreiro for helpful comments on the manuscript, Yosif Zaki and Denise J. Cai for useful feedback and members of the Clopath lab for discussion and support. This work was supported by Biotechnology and Biological Sciences Research Council (BB/N013956/1 awarded to C.C.), Wellcome Trust (200790/Z/16/Z awarded to C.C.), the Simons Foundation (564408 awarded to C.C.), and Engineering and Physical Sciences Research Council (EP/R035806/1 awarded to C.C.).","date_updated":"2026-10-21T11:07:11Z","file_date_updated":"2024-06-03T06:34:21Z","date_created":"2024-06-02T22:00:57Z","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["001249681000008"],"pmid":["38561228"]},"type":"journal_article","issue":"21","month":"05","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1},{"publisher":"Oxford University Press","publication":"The Quarterly Journal of Mathematics","language":[{"iso":"eng"}],"doi":"10.1093/qmath/haae044","_id":"18930","citation":{"ista":"Elsholtz C, Wurzinger L. 2024. Sumsets in the set of squares. The Quarterly Journal of Mathematics. 75(4), 1243–1254.","short":"C. Elsholtz, L. Wurzinger, The Quarterly Journal of Mathematics 75 (2024) 1243–1254.","mla":"Elsholtz, Christian, and Lena Wurzinger. “Sumsets in the Set of Squares.” <i>The Quarterly Journal of Mathematics</i>, vol. 75, no. 4, Oxford University Press, 2024, pp. 1243–54, doi:<a href=\"https://doi.org/10.1093/qmath/haae044\">10.1093/qmath/haae044</a>.","chicago":"Elsholtz, Christian, and Lena Wurzinger. “Sumsets in the Set of Squares.” <i>The Quarterly Journal of Mathematics</i>. Oxford University Press, 2024. <a href=\"https://doi.org/10.1093/qmath/haae044\">https://doi.org/10.1093/qmath/haae044</a>.","ama":"Elsholtz C, Wurzinger L. Sumsets in the set of squares. <i>The Quarterly Journal of Mathematics</i>. 2024;75(4):1243-1254. doi:<a href=\"https://doi.org/10.1093/qmath/haae044\">10.1093/qmath/haae044</a>","ieee":"C. Elsholtz and L. Wurzinger, “Sumsets in the set of squares,” <i>The Quarterly Journal of Mathematics</i>, vol. 75, no. 4. Oxford University Press, pp. 1243–1254, 2024.","apa":"Elsholtz, C., &#38; Wurzinger, L. (2024). Sumsets in the set of squares. <i>The Quarterly Journal of Mathematics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/qmath/haae044\">https://doi.org/10.1093/qmath/haae044</a>"},"date_published":"2024-12-01T00:00:00Z","researchdata_availability":"no","supplementarymaterial":"no","intvolume":"        75","quality_controlled":"1","oa_version":"Published Version","author":[{"last_name":"Elsholtz","first_name":"Christian","full_name":"Elsholtz, Christian"},{"full_name":"Wurzinger, Lena","first_name":"Lena","orcid":"0009-0004-5360-0074","id":"50c57d72-32a8-11ee-aeea-d652094d2ccd","last_name":"Wurzinger"}],"department":[{"_id":"TiBr"}],"article_type":"original","OA_place":"publisher","fulldoi":"https://doi.org/10.1093/qmath/haae044","title":"Sumsets in the set of squares","day":"01","article_processing_charge":"Yes (via OA deal)","volume":75,"publication_identifier":{"eissn":["1464-3847"],"issn":["0033-5606"]},"ddc":["510"],"status":"public","isi":1,"PlanS_conform":"1","file":[{"date_updated":"2025-01-28T07:03:51Z","access_level":"open_access","checksum":"1a06e052761d3f1e873463d6f529dd82","file_name":"2024_QuarterlyJourMath_Elsholtz.pdf","content_type":"application/pdf","file_size":424645,"creator":"dernst","relation":"main_file","success":1,"date_created":"2025-01-28T07:03:51Z","file_id":"18931"}],"year":"2024","abstract":[{"lang":"eng","text":"We study sumsets 𝒜 + ℬ in the set of squares 𝒮 (and, more generally, in the set of kth powers 𝒮k, where k ≥2 is an integer). It is known by a result of Gyarmati that 𝒜 + ℬ ⊂ 𝒮k ∩[1,N] implies that min(|𝒜|,|ℬ|) =Ok(logN). Here, we study how the upper bound on |ℬ| decreases, when the size of |𝒜| increases (or vice versa). In particular, if |𝒜| ≥ Ck1m m(logN)1m , then |ℬ| = Ok(m2logN), for sufficiently large N, a positive integer m and an explicit constant C > 0. For example, with m ∼ loglogN this gives: If |𝒜| ≥ CkloglogN,then |ℬ| = Ok(logN(loglogN)2)."}],"scopus_import":"1","date_updated":"2026-10-21T11:06:48Z","das_tickbox":"0","acknowledgement":"This manuscript grew out of the second author’s MSc Thesis at Graz University of Technology [34]. C. Elsholtz is supported by a joint FWF-ANR project ArithRand, grant numbers FWF I 4945-N and ANR-20-CE91-0006. Both authors would like to thank Igor Shparlinski for drawing our attention to related character sum estimates. Furthermore, we would like to thank the referee for a careful reading of the paper.","file_date_updated":"2025-01-28T07:03:51Z","date_created":"2025-01-28T06:55:31Z","publication_status":"published","page":"1243-1254","external_id":{"isi":["001304396600001"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","issue":"4","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","oa":1,"month":"12","OA_type":"hybrid","has_accepted_license":"1"},{"abstract":[{"text":"Sequential decision-making in probabilistic environments is a fundamental problem with many applications in AI and economics. In this paper, we present an algorithm for synthesizing sequential decision-making agents that optimize statistical properties such as maximum and average response times. In the general setting of sequential decision-making, the environment is modeled as a random process that generates inputs. The agent responds to each input, aiming to maximize rewards and minimize costs within a specified time horizon. The corresponding synthesis problem is known to be PSPACE-hard. We consider the special case where the input distribution, reward, and cost depend on input-output statistics specified by counter automata. For such problems, this paper presents the first PTIME synthesis algorithms. We introduce the notion of statistical abstraction, which clusters statistically indistinguishable input-output sequences into equivalence classes. This abstraction allows for a dynamic programming algorithm whose complexity grows polynomially with the considered horizon, making the statistical case exponentially more efficient than the general case. We evaluate our algorithm on three different application scenarios of a client-server protocol, where multiple clients compete via bidding to gain access to the service offered by the server. The synthesized policies optimize profit while guaranteeing that none of the server’s clients is disproportionately starved of the service.","lang":"eng"}],"year":"2024","scopus_import":"1","file":[{"access_level":"open_access","date_updated":"2024-07-29T11:15:59Z","checksum":"cc6bb89be0eaa404a6ce019392cd293e","file_name":"2024_LIPICs_Cano.pdf","content_type":"application/pdf","file_size":1391381,"creator":"dernst","success":1,"relation":"main_file","file_id":"17341","date_created":"2024-07-29T11:15:59Z"}],"das_tickbox":"0","acknowledgement":"This work is partly supported by the European Research Council under Grant No.: ERC2020-AdG 101020093. It is also partially supported by the State Government of Styria, Austria –\r\nDepartment Zukunftsfonds Steiermark.","date_updated":"2026-10-21T12:02:55Z","alternative_title":["LIPIcs"],"publication_identifier":{"isbn":["9783959773232"],"issn":["1868-8969"]},"volume":299,"ddc":["000"],"conference":{"end_date":"2024-07-13","start_date":"2024-07-10","location":"Tallinn, Estonia","name":"FSCD: Conference on Formal Structures for Computation and Deduction"},"isi":1,"ec_funded":1,"status":"public","type":"conference","month":"07","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","oa":1,"project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"file_date_updated":"2024-07-29T11:15:59Z","date_created":"2024-07-28T22:01:09Z","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["001587746100002"]},"date_published":"2024-07-01T00:00:00Z","article_number":"2","citation":{"ama":"Cano F, Henzinger TA, Könighofer B, Kueffner K, Mallik K. Abstraction-based decision making for statistical properties. In: <i>9th International Conference on Formal Structures for Computation and Deduction</i>. Vol 299. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSCD.2024.2\">10.4230/LIPIcs.FSCD.2024.2</a>","ieee":"F. Cano, T. A. Henzinger, B. Könighofer, K. Kueffner, and K. Mallik, “Abstraction-based decision making for statistical properties,” in <i>9th International Conference on Formal Structures for Computation and Deduction</i>, Tallinn, Estonia, 2024, vol. 299.","apa":"Cano, F., Henzinger, T. A., Könighofer, B., Kueffner, K., &#38; Mallik, K. (2024). Abstraction-based decision making for statistical properties. In <i>9th International Conference on Formal Structures for Computation and Deduction</i> (Vol. 299). Tallinn, Estonia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSCD.2024.2\">https://doi.org/10.4230/LIPIcs.FSCD.2024.2</a>","short":"F. Cano, T.A. Henzinger, B. Könighofer, K. Kueffner, K. Mallik, in:, 9th International Conference on Formal Structures for Computation and Deduction, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Cano F, Henzinger TA, Könighofer B, Kueffner K, Mallik K. 2024. Abstraction-based decision making for statistical properties. 9th International Conference on Formal Structures for Computation and Deduction. FSCD: Conference on Formal Structures for Computation and Deduction, LIPIcs, vol. 299, 2.","chicago":"Cano, Filip, Thomas A Henzinger, Bettina Könighofer, Konstantin Kueffner, and Kaushik Mallik. “Abstraction-Based Decision Making for Statistical Properties.” In <i>9th International Conference on Formal Structures for Computation and Deduction</i>, Vol. 299. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.FSCD.2024.2\">https://doi.org/10.4230/LIPIcs.FSCD.2024.2</a>.","mla":"Cano, Filip, et al. “Abstraction-Based Decision Making for Statistical Properties.” <i>9th International Conference on Formal Structures for Computation and Deduction</i>, vol. 299, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSCD.2024.2\">10.4230/LIPIcs.FSCD.2024.2</a>."},"_id":"17327","quality_controlled":"1","intvolume":"       299","oa_version":"Published Version","researchdata_availability":"no","supplementarymaterial":"no","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.FSCD.2024.2","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication":"9th International Conference on Formal Structures for Computation and Deduction","article_processing_charge":"Yes","department":[{"_id":"ToHe"}],"author":[{"full_name":"Cano, Filip","first_name":"Filip","last_name":"Cano"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Könighofer","first_name":"Bettina","full_name":"Könighofer, Bettina"},{"last_name":"Kueffner","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","full_name":"Kueffner, Konstantin","first_name":"Konstantin","orcid":"0000-0001-8974-2542"},{"full_name":"Mallik, Kaushik","first_name":"Kaushik","orcid":"0000-0001-9864-7475","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"}],"day":"01","fulldoi":"https://doi.org/10.4230/LIPIcs.FSCD.2024.2","title":"Abstraction-based decision making for statistical properties"},{"related_material":{"record":[{"status":"public","relation":"research_data","id":"23182"}]},"external_id":{"isi":["001316474600001"],"pmid":["39217864"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","file_date_updated":"2025-01-13T08:26:08Z","date_created":"2024-09-08T22:01:10Z","project":[{"_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","call_identifier":"H2020","grant_number":"819603","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning."}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"corr_author":"1","has_accepted_license":"1","month":"12","OA_type":"hybrid","type":"journal_article","status":"public","ec_funded":1,"isi":1,"ddc":["570"],"volume":180,"publication_identifier":{"issn":["0893-6080"],"eissn":["1879-2782"]},"date_updated":"2026-10-21T11:57:08Z","acknowledgement":"A.P. is grateful to Chaitanya Chintaluri, Douglas Feitosa Tomé, and Tim P. Vogels for useful discussions. This work was supported by a European Research Council Consolidator Grant (SYNAPSEEK, 819603, to Tim P. Vogels).","das_tickbox":"1","file":[{"file_name":"2024_NeuralNetworks_Zendrikov.pdf","content_type":"application/pdf","checksum":"6a194323234e01d4ae725f674529cdb1","date_updated":"2025-01-13T08:26:08Z","access_level":"open_access","file_id":"18825","date_created":"2025-01-13T08:26:08Z","success":1,"relation":"main_file","creator":"dernst","file_size":6162281}],"scopus_import":"1","year":"2024","abstract":[{"lang":"eng","text":"Thin pancake-like neuronal networks cultured on top of a planar microelectrode array have been extensively tried out in neuroengineering, as a substrate for the mobile robot’s control unit, i.e., as a cyborg’s brain. Most of these attempts failed due to intricate self-organizing dynamics in the neuronal systems. In particular, the networks may exhibit an emergent spatial map of steady nucleation sites (“n-sites”) of spontaneous population spikes. Being unpredictable and independent of the surface electrode locations, the n-sites drastically change local ability of the network to generate spikes. Here, using a spiking neuronal network model with generative spatially-embedded connectome, we systematically show in simulations that the number, location, and relative activity of spontaneously formed n-sites (“the vitals”) crucially depend on the samplings of three distributions: (1) the network distribution of neuronal excitability, (2) the distribution of connections between neurons of the network, and (3) the distribution of maximal amplitudes of a single synaptic current pulse. Moreover, blocking the dynamics of a small fraction (about 4%) of non-pacemaker neurons having the highest excitability was enough to completely suppress the occurrence of population spikes and their n-sites. This key result is explained theoretically. Remarkably, the n-sites occur taking into account only short-term synaptic plasticity, i.e., without a Hebbian-type plasticity. As the spiking network model used in this study is strictly deterministic, all simulation results can be accurately reproduced. The model, which has already demonstrated a very high richness-to-complexity ratio, can also be directly extended into the three-dimensional case, e.g., for targeting peculiarities of spiking dynamics in cerebral (or brain) organoids. We recommend the model as an excellent illustrative tool for teaching network-level computational neuroscience, complementing a few benchmark models."}],"title":"The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks","fulldoi":"https://doi.org/10.1016/j.neunet.2024.106589","day":"01","author":[{"first_name":"Dmitrii","full_name":"Zendrikov, Dmitrii","last_name":"Zendrikov"},{"last_name":"Paraskevov","id":"d05e3c56-9262-11ed-9231-be692464e5ac","first_name":"Alexander","full_name":"Paraskevov, Alexander"}],"article_type":"original","OA_place":"publisher","department":[{"_id":"TiVo"}],"article_processing_charge":"Yes (via OA deal)","dataavailabilitystatement":"The attached Supplementary Material for this article contains four Figures, S1–S4, and two Videos. The simulation data and program codes required for reproducing all results of this study are available online at https://doi.org/10.6084/m9.figshare.24527848","publication":"Neural Networks","publisher":"Elsevier","doi":"10.1016/j.neunet.2024.106589","language":[{"iso":"eng"}],"supplementarymaterial":"yes","researchdata_availability":"yes","pmid":1,"oa_version":"Published Version","intvolume":"       180","quality_controlled":"1","citation":{"mla":"Zendrikov, Dmitrii, and Alexander Paraskevov. “The Vitals for Steady Nucleation Maps of Spontaneous Spiking Coherence in Autonomous Two-Dimensional Neuronal Networks.” <i>Neural Networks</i>, vol. 180, 106589, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.neunet.2024.106589\">10.1016/j.neunet.2024.106589</a>.","chicago":"Zendrikov, Dmitrii, and Alexander Paraskevov. “The Vitals for Steady Nucleation Maps of Spontaneous Spiking Coherence in Autonomous Two-Dimensional Neuronal Networks.” <i>Neural Networks</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.neunet.2024.106589\">https://doi.org/10.1016/j.neunet.2024.106589</a>.","ista":"Zendrikov D, Paraskevov A. 2024. The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks. Neural Networks. 180, 106589.","short":"D. Zendrikov, A. Paraskevov, Neural Networks 180 (2024).","apa":"Zendrikov, D., &#38; Paraskevov, A. (2024). The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks. <i>Neural Networks</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neunet.2024.106589\">https://doi.org/10.1016/j.neunet.2024.106589</a>","ieee":"D. Zendrikov and A. Paraskevov, “The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks,” <i>Neural Networks</i>, vol. 180. Elsevier, 2024.","ama":"Zendrikov D, Paraskevov A. The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks. <i>Neural Networks</i>. 2024;180. doi:<a href=\"https://doi.org/10.1016/j.neunet.2024.106589\">10.1016/j.neunet.2024.106589</a>"},"_id":"17886","article_number":"106589","date_published":"2024-12-01T00:00:00Z"},{"language":[{"iso":"eng"}],"doi":"10.1016/j.nahs.2023.101430","publisher":"Elsevier","publication":"Nonlinear Analysis: Hybrid Systems","dataavailabilitystatement":"No data was used for the research described in the article.\r\n","date_published":"2024-02-01T00:00:00Z","article_number":"101430","citation":{"apa":"Majumdar, R., Mallik, K., Schmuck, A. K., &#38; Soudjani, S. (2024). Symbolic control for stochastic systems via finite parity games. <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">https://doi.org/10.1016/j.nahs.2023.101430</a>","ama":"Majumdar R, Mallik K, Schmuck AK, Soudjani S. Symbolic control for stochastic systems via finite parity games. <i>Nonlinear Analysis: Hybrid Systems</i>. 2024;51(2). doi:<a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">10.1016/j.nahs.2023.101430</a>","ieee":"R. Majumdar, K. Mallik, A. K. Schmuck, and S. Soudjani, “Symbolic control for stochastic systems via finite parity games,” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 51, no. 2. Elsevier, 2024.","mla":"Majumdar, Rupak, et al. “Symbolic Control for Stochastic Systems via Finite Parity Games.” <i>Nonlinear Analysis: Hybrid Systems</i>, vol. 51, no. 2, 101430, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">10.1016/j.nahs.2023.101430</a>.","chicago":"Majumdar, Rupak, Kaushik Mallik, Anne Kathrin Schmuck, and Sadegh Soudjani. “Symbolic Control for Stochastic Systems via Finite Parity Games.” <i>Nonlinear Analysis: Hybrid Systems</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.nahs.2023.101430\">https://doi.org/10.1016/j.nahs.2023.101430</a>.","ista":"Majumdar R, Mallik K, Schmuck AK, Soudjani S. 2024. Symbolic control for stochastic systems via finite parity games. Nonlinear Analysis: Hybrid Systems. 51(2), 101430.","short":"R. Majumdar, K. Mallik, A.K. Schmuck, S. Soudjani, Nonlinear Analysis: Hybrid Systems 51 (2024)."},"_id":"14400","quality_controlled":"1","intvolume":"        51","oa_version":"Published Version","researchdata_availability":"not applicable","supplementarymaterial":"yes","department":[{"_id":"ToHe"}],"article_type":"original","author":[{"last_name":"Majumdar","full_name":"Majumdar, Rupak","first_name":"Rupak"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","first_name":"Kaushik"},{"last_name":"Schmuck","first_name":"Anne Kathrin","full_name":"Schmuck, Anne Kathrin"},{"last_name":"Soudjani","full_name":"Soudjani, Sadegh","first_name":"Sadegh"}],"day":"01","fulldoi":"https://doi.org/10.1016/j.nahs.2023.101430","title":"Symbolic control for stochastic systems via finite parity games","article_processing_charge":"Yes (in subscription journal)","volume":51,"publication_identifier":{"issn":["1751-570X"]},"ddc":["000"],"ec_funded":1,"isi":1,"status":"public","abstract":[{"lang":"eng","text":"We consider the problem of computing the maximal probability of satisfying an \r\n-regular specification for stochastic, continuous-state, nonlinear systems evolving in discrete time. The problem reduces, after automata-theoretic constructions, to finding the maximal probability of satisfying a parity condition on a (possibly hybrid) state space. While characterizing the exact satisfaction probability is open, we show that a lower bound on this probability can be obtained by (I) computing an under-approximation of the qualitative winning region, i.e., states from which the parity condition can be enforced almost surely, and (II) computing the maximal probability of reaching this qualitative winning region.\r\nThe heart of our approach is a technique to symbolically compute the under-approximation of the qualitative winning region in step (I) via a finite-state abstraction of the original system as a \r\n-player parity game. Our abstraction procedure uses only the support of the probabilistic evolution; it does not use precise numerical transition probabilities. We prove that the winning set in the abstract -player game induces an under-approximation of the qualitative winning region in the original synthesis problem, along with a policy to solve it. By combining these contributions with (a) a symbolic fixpoint algorithm to solve \r\n-player games and (b) existing techniques for reachability policy synthesis in stochastic nonlinear systems, we get an abstraction-based algorithm for finding a lower bound on the maximal satisfaction probability.\r\nWe have implemented the abstraction-based algorithm in Mascot-SDS, where we combined the outlined abstraction step with our tool Genie (Majumdar et al., 2023) that solves \r\n-player parity games (through a reduction to Rabin games) more efficiently than existing algorithms. We evaluated our implementation on the nonlinear model of a perturbed bistable switch from the literature. We show empirically that the lower bound on the winning region computed by our approach is precise, by comparing against an over-approximation of the qualitative winning region. Moreover, our implementation outperforms a recently proposed tool for solving this problem by a large margin."}],"year":"2024","scopus_import":"1","file":[{"access_level":"open_access","date_updated":"2024-07-16T10:26:41Z","content_type":"application/pdf","file_name":"2024_NonlinearAnalysis_Majumdar.pdf","checksum":"4eab70274d1004ea411f7f0e74c033ac","creator":"dernst","file_size":1787569,"file_id":"17258","date_created":"2024-07-16T10:26:41Z","success":1,"relation":"main_file"}],"das_tickbox":"1","acknowledgement":"We thank Daniel Hausmann and Nir Piterman for their valuable comments on an earlier version of the manuscript of our other paper [22] where we present, among other things, the parity fixpoint for 2 1/2-player games (for a slightly more general class of games) with a different and indirect proof of correctness. Based on their comments we observed that, unlike the other fixpoints that we present in [22], the parity fixpoint does not follow the exact same structure as its counterpart for 2-player games, which we also use int his paper.\r\nWe also thank Thejaswini Raghavan for observing that our symbolic parity fixpoint algorithm can be solved in quasi-polynomial time using recent improved algorithms for solving \r\n-calculus expressions. This significantly improved the complexity bounds of our algorithm in this paper.\r\nThe work of R. Majumdar and A.-K. Schmuck are partially supported by DFG, Germany project 389792660 TRR 248–CPEC. A.-K. Schmuck is additionally funded through DFG, Germany project (SCHM 3541/1-1). K. Mallik is supported by the ERC project ERC-2020-AdG 101020093. S. Soudjani is supported by the following projects: EPSRC EP/V043676/1, EIC 101070802, and ERC 101089047.","date_updated":"2026-10-21T12:00:53Z","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"date_created":"2023-10-08T22:01:15Z","file_date_updated":"2024-07-16T10:26:41Z","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","arxiv":1,"external_id":{"isi":["001093188100001"],"arxiv":["2101.00834"]},"type":"journal_article","issue":"2","month":"02","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"corr_author":"1"},{"das_tickbox":"0","acknowledgement":"We would like to recognise the feedback and ideas shared with us by all attendees during the\r\nfocus groups that contributed to the development of this paper. Acknowledgements are given\r\nto Elisee Jafsia, Umar Farouk Ahmad, Zohra Slim, Mizanur Rahman, Rev. Katie Tupling,\r\nChristopher Emmanuel, Abdalrhman Mostafa, Pradeep Eranti, Toby Hodges, Avishkar\r\nBhoopchand, and Carolyn Dickson. We would like to thank our community members and\r\nacknowledge their bravery for sharing their stories that shaped the narrative of these Ten Simple\r\nRules. The stories shared with us formed the case studies, and while they are anonymous\r\nfor privacy and protection reasons, it is these stories that were on our mind during the entire\r\nprocess and kept us going. We acknowledge the efforts of the organisers that contribute to the\r\nhighly successful events that are the inspiration for the ideas presented here: the Deep\r\nLearning Indaba, Neuromatch Academy, the IBRO Simons Computational Neuroscience\r\nImbizo, and OLS. OLS also supported this project through their mentorship programme,\r\nOpen Seeds.","date_updated":"2026-10-21T11:23:24Z","abstract":[{"text":"Inclusion at academic events is facing increased scrutiny as the communities these events serve raise their expectations for who can practically attend. Active efforts in recent years to bring more diversity to academic events have brought progress and created momentum. However, we must reflect on these efforts and determine which underrepresented groups are being disadvantaged. Inclusion at academic events is important to ensure diversity of discourse and opinion, to help build networks, and to avoid academic siloing. All of these contribute to the development of a robust and resilient academic field. We have developed these Ten Simple Rules both to amplify the voices that have been speaking out and to celebrate the progress of many Equity, Diversity, and Inclusivity practices that continue to drive the organisation of academic events. The Rules aim to raise awareness as well as provide actionable suggestions and tools to support these initiatives further. This aims to support academic organisations such as the Deep Learning Indaba, Neuromatch Academy, the IBRO-Simons Computational Neuroscience Imbizo, Biodiversity Information Standards (TDWG), Arabs in Neuroscience, FAIRPoints, and OLS (formerly Open Life Science). This article is a call to action for organisers to reevaluate the impact and reach of their inclusive practices.","lang":"eng"}],"year":"2024","scopus_import":"1","file":[{"file_id":"15289","date_created":"2024-04-03T13:29:36Z","success":1,"relation":"main_file","creator":"dernst","file_size":858521,"content_type":"application/pdf","file_name":"2024_PloS_Hall.pdf","checksum":"1f0f837c5b4341f54f6347370ed8c1b7","date_updated":"2024-04-03T13:29:36Z","access_level":"open_access"}],"isi":1,"status":"public","volume":20,"publication_identifier":{"issn":["1553-7358"]},"ddc":["000"],"DOAJ_listed":"1","OA_type":"gold","month":"03","has_accepted_license":"1","oa":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"type":"journal_article","issue":"3","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["001181690200005"],"pmid":["38427633"]},"file_date_updated":"2024-04-03T13:29:36Z","date_created":"2024-04-02T11:37:32Z","publication_status":"published","intvolume":"        20","quality_controlled":"1","oa_version":"Published Version","researchdata_availability":"no","pmid":1,"supplementarymaterial":"yes","date_published":"2024-03-01T00:00:00Z","article_number":"e1011797","citation":{"ista":"Hall SM, Kochin D, Carne C, Herterich P, Lewers KL, Abdelhack M, Ramasubramanian A, Michael Alphonse JF, Ung V, El-Gebali S, Currin C, Plomp E, Thompson R, Sharan M. 2024. Ten simple rules for pushing boundaries of inclusion at academic events. PLOS Computational Biology. 20(3), e1011797.","short":"S.M. Hall, D. Kochin, C. Carne, P. Herterich, K.L. Lewers, M. Abdelhack, A. Ramasubramanian, J.F. Michael Alphonse, V. Ung, S. El-Gebali, C. Currin, E. Plomp, R. Thompson, M. Sharan, PLOS Computational Biology 20 (2024).","mla":"Hall, Siobhan Mackenzie, et al. “Ten Simple Rules for Pushing Boundaries of Inclusion at Academic Events.” <i>PLOS Computational Biology</i>, vol. 20, no. 3, e1011797, Public Library of Science, 2024, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1011797\">10.1371/journal.pcbi.1011797</a>.","chicago":"Hall, Siobhan Mackenzie, Daniel Kochin, Carmel Carne, Patricia Herterich, Kristen Lenay Lewers, Mohamed Abdelhack, Arun Ramasubramanian, et al. “Ten Simple Rules for Pushing Boundaries of Inclusion at Academic Events.” <i>PLOS Computational Biology</i>. Public Library of Science, 2024. <a href=\"https://doi.org/10.1371/journal.pcbi.1011797\">https://doi.org/10.1371/journal.pcbi.1011797</a>.","ieee":"S. M. Hall <i>et al.</i>, “Ten simple rules for pushing boundaries of inclusion at academic events,” <i>PLOS Computational Biology</i>, vol. 20, no. 3. Public Library of Science, 2024.","ama":"Hall SM, Kochin D, Carne C, et al. Ten simple rules for pushing boundaries of inclusion at academic events. <i>PLOS Computational Biology</i>. 2024;20(3). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1011797\">10.1371/journal.pcbi.1011797</a>","apa":"Hall, S. M., Kochin, D., Carne, C., Herterich, P., Lewers, K. L., Abdelhack, M., … Sharan, M. (2024). Ten simple rules for pushing boundaries of inclusion at academic events. <i>PLOS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1011797\">https://doi.org/10.1371/journal.pcbi.1011797</a>"},"_id":"15258","language":[{"iso":"eng"}],"doi":"10.1371/journal.pcbi.1011797","publisher":"Public Library of Science","publication":"PLOS Computational Biology","article_processing_charge":"Yes","day":"01","fulldoi":"https://doi.org/10.1371/journal.pcbi.1011797","title":"Ten simple rules for pushing boundaries of inclusion at academic events","department":[{"_id":"TiVo"}],"OA_place":"publisher","article_type":"original","author":[{"first_name":"Siobhan Mackenzie","full_name":"Hall, Siobhan Mackenzie","last_name":"Hall"},{"first_name":"Daniel","full_name":"Kochin, Daniel","last_name":"Kochin"},{"last_name":"Carne","full_name":"Carne, Carmel","first_name":"Carmel"},{"last_name":"Herterich","full_name":"Herterich, Patricia","first_name":"Patricia"},{"first_name":"Kristen Lenay","full_name":"Lewers, Kristen Lenay","last_name":"Lewers"},{"last_name":"Abdelhack","full_name":"Abdelhack, Mohamed","first_name":"Mohamed"},{"last_name":"Ramasubramanian","full_name":"Ramasubramanian, Arun","first_name":"Arun"},{"full_name":"Michael Alphonse, Juno Felecia","first_name":"Juno Felecia","last_name":"Michael Alphonse"},{"full_name":"Ung, Visotheary","first_name":"Visotheary","last_name":"Ung"},{"last_name":"El-Gebali","first_name":"Sara","full_name":"El-Gebali, Sara"},{"id":"e8321fc5-3091-11eb-8a53-83f309a11ac9","last_name":"Currin","orcid":"0000-0002-4809-5059","first_name":"Christopher","full_name":"Currin, Christopher"},{"last_name":"Plomp","full_name":"Plomp, Esther","first_name":"Esther"},{"first_name":"Rachel","full_name":"Thompson, Rachel","last_name":"Thompson"},{"full_name":"Sharan, Malvika","first_name":"Malvika","last_name":"Sharan"}]},{"das_tickbox":"0","date_updated":"2026-10-21T12:00:08Z","scopus_import":"1","abstract":[{"text":"Background: Benzodiazepines and antidepressants are effective agents for the treatment of generalized anxiety disorder (GAD), with the HAM-A frequently used as a primary outcome measure. The GAD literature is inconsistent regarding which medications are more effective for somatic versus psychic symptoms of GAD, and treatment guidelines do not advocate for prescribing based on subtype. This meta-analysis aimed to determine whether benzodiazepines and antidepressants have a differential impact on the somatic versus psychic subscales of the HAM-A in GAD.\r\n\r\nMethods: An electronic search was undertaken for randomized controlled trials of either benzodiazepines or antidepressants for GAD that reported treatment response using the HAM-A subscales. Data were extracted by independent reviewers. A random effects assessment of weighted mean difference with 95% confidence intervals and subgroup difference was applied. All analysis was done on SPSS 26. An assessment of bias, and of quality of evidence was performed.\r\n\r\nResults: 24 randomized controlled trials met the inclusion criteria: 18 antidepressant trials, 5 benzodiazepine trials and 1 of both. 14 studies were assessed as having between some and high risk of bias, while 10 were assessed as having low risk of bias. Benzodiazepines (WMD of 1.81 [CI 1.03, 2.58]) were significantly more effective than antidepressants (WMD of 0.83 [CI 0.64, 1.02]) for reducing somatic symptoms of GAD (Chi2 = 5.81, p = 0.02), and were also more effective (WMD of 2.46 [CI 1.83, 3.09]) in reducing psychic symptoms than antidepressants (WMD of 1.83 [CI 1.55, 2.10]), although this comparison did not reach statistical significance (Chi2 = 3.31, p = 0.07).\r\n\r\nConclusion: The finding that benzodiazepines were significantly more effective than antidepressants for somatic symptoms needs to be weighed up against potential benefits of antidepressants over benzodiazepines. It may be useful for future treatment guidelines for GAD to explicitly consider symptom subtype.","lang":"eng"}],"year":"2024","file":[{"creator":"dernst","file_size":2874425,"file_id":"18839","date_created":"2025-01-13T10:47:20Z","success":1,"relation":"main_file","access_level":"open_access","date_updated":"2025-01-13T10:47:20Z","file_name":"2024_ComprehensivePsychiatry_Beyer.pdf","content_type":"application/pdf","checksum":"aadb57448b5f170761ed72cbcc31ba16"}],"isi":1,"status":"public","DOAJ_listed":"1","ddc":["570"],"volume":132,"publication_identifier":{"eissn":["1532-8384"],"issn":["0010-440X"]},"has_accepted_license":"1","month":"07","OA_type":"gold","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"oa":1,"type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"pmid":["38564872"],"isi":["001221136000001"]},"publication_status":"published","file_date_updated":"2025-01-13T10:47:20Z","date_created":"2024-04-07T22:00:55Z","oa_version":"Published Version","intvolume":"       132","quality_controlled":"1","supplementarymaterial":"no","pmid":1,"researchdata_availability":"no","article_number":"152479","date_published":"2024-07-01T00:00:00Z","_id":"15295","citation":{"mla":"Beyer, Chad, et al. “Meta-Analysis of the Comparative Efficacy of Benzodiazepines and Antidepressants for Psychic versus Somatic Symptoms of Generalized Anxiety Disorder.” <i>Comprehensive Psychiatry</i>, vol. 132, 152479, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.comppsych.2024.152479\">10.1016/j.comppsych.2024.152479</a>.","chicago":"Beyer, Chad, Christopher Currin, Taryn Williams, and Dan J. Stein. “Meta-Analysis of the Comparative Efficacy of Benzodiazepines and Antidepressants for Psychic versus Somatic Symptoms of Generalized Anxiety Disorder.” <i>Comprehensive Psychiatry</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.comppsych.2024.152479\">https://doi.org/10.1016/j.comppsych.2024.152479</a>.","ista":"Beyer C, Currin C, Williams T, Stein DJ. 2024. Meta-analysis of the comparative efficacy of benzodiazepines and antidepressants for psychic versus somatic symptoms of generalized anxiety disorder. Comprehensive Psychiatry. 132, 152479.","short":"C. Beyer, C. Currin, T. Williams, D.J. Stein, Comprehensive Psychiatry 132 (2024).","apa":"Beyer, C., Currin, C., Williams, T., &#38; Stein, D. J. (2024). Meta-analysis of the comparative efficacy of benzodiazepines and antidepressants for psychic versus somatic symptoms of generalized anxiety disorder. <i>Comprehensive Psychiatry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comppsych.2024.152479\">https://doi.org/10.1016/j.comppsych.2024.152479</a>","ama":"Beyer C, Currin C, Williams T, Stein DJ. Meta-analysis of the comparative efficacy of benzodiazepines and antidepressants for psychic versus somatic symptoms of generalized anxiety disorder. <i>Comprehensive Psychiatry</i>. 2024;132. doi:<a href=\"https://doi.org/10.1016/j.comppsych.2024.152479\">10.1016/j.comppsych.2024.152479</a>","ieee":"C. Beyer, C. Currin, T. Williams, and D. J. Stein, “Meta-analysis of the comparative efficacy of benzodiazepines and antidepressants for psychic versus somatic symptoms of generalized anxiety disorder,” <i>Comprehensive Psychiatry</i>, vol. 132. Elsevier, 2024."},"doi":"10.1016/j.comppsych.2024.152479","language":[{"iso":"eng"}],"publication":"Comprehensive Psychiatry","publisher":"Elsevier","article_processing_charge":"Yes","day":"01","title":"Meta-analysis of the comparative efficacy of benzodiazepines and antidepressants for psychic versus somatic symptoms of generalized anxiety disorder","fulldoi":"https://doi.org/10.1016/j.comppsych.2024.152479","article_type":"original","department":[{"_id":"TiVo"}],"author":[{"last_name":"Beyer","first_name":"Chad","full_name":"Beyer, Chad"},{"orcid":"0000-0002-4809-5059","first_name":"Christopher","full_name":"Currin, Christopher","id":"e8321fc5-3091-11eb-8a53-83f309a11ac9","last_name":"Currin"},{"last_name":"Williams","first_name":"Taryn","full_name":"Williams, Taryn"},{"last_name":"Stein","first_name":"Dan J.","full_name":"Stein, Dan J."}]},{"language":[{"iso":"eng"}],"publication":"27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems","publisher":"VDE Verlag","oa_version":"Submitted Version","quality_controlled":"1","supplementarymaterial":"unclear","researchdata_availability":"unclear","date_published":"2024-02-01T00:00:00Z","_id":"17053","citation":{"chicago":"Froleyks, Nils, Emily Yu, and Armin Biere. “Ternary Simulation as Abstract Interpretation (Work in Progress).” In <i>27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems</i>, 148–51. VDE Verlag, 2024.","mla":"Froleyks, Nils, et al. “Ternary Simulation as Abstract Interpretation (Work in Progress).” <i>27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems</i>, VDE Verlag, 2024, pp. 148–51.","short":"N. Froleyks, E. Yu, A. Biere, in:, 27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems, VDE Verlag, 2024, pp. 148–151.","ista":"Froleyks N, Yu E, Biere A. 2024. Ternary simulation as abstract interpretation (Work in Progress). 27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems. MBMV: Methods and Description Languages for Modeling and Verification of Circuits and Systems, 148–151.","apa":"Froleyks, N., Yu, E., &#38; Biere, A. (2024). Ternary simulation as abstract interpretation (Work in Progress). In <i>27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems</i> (pp. 148–151). Kaiserslautern, Germany: VDE Verlag.","ama":"Froleyks N, Yu E, Biere A. Ternary simulation as abstract interpretation (Work in Progress). In: <i>27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems</i>. VDE Verlag; 2024:148-151.","ieee":"N. Froleyks, E. Yu, and A. Biere, “Ternary simulation as abstract interpretation (Work in Progress),” in <i>27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems</i>, Kaiserslautern, Germany, 2024, pp. 148–151."},"day":"01","title":"Ternary simulation as abstract interpretation (Work in Progress)","OA_place":"repository","department":[{"_id":"ToHe"}],"author":[{"last_name":"Froleyks","first_name":"Nils","full_name":"Froleyks, Nils"},{"id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","last_name":"Yu","first_name":"Zhengqi","orcid":"0000-0002-4993-773X","full_name":"Yu, Zhengqi"},{"last_name":"Biere","first_name":"Armin","full_name":"Biere, Armin"}],"article_processing_charge":"No","ec_funded":1,"status":"public","publication_identifier":{"isbn":["9783800762682"]},"conference":{"name":"MBMV: Methods and Description Languages for Modeling and Verification of Circuits and Systems","location":"Kaiserslautern, Germany","end_date":"2024-02-15","start_date":"2024-02-14"},"acknowledgement":"This work is supported by the Austrian Science Fund (FWF) under the project W1255-N23, the LIT AI Lab funded by the State of Upper Austria, the ERC-2020-AdG 101020093 and by a gift from Intel Corporation.","das_tickbox":"1","date_updated":"2026-10-21T12:01:13Z","scopus_import":"1","year":"2024","abstract":[{"lang":"eng","text":"We introduce a formalization of ternary simulation as abstract interpretation along with a widening operator to speed up convergence. With the same goal, we present a subsumption algorithm that can determine termination earlier than the usual approach using hash sets. Additionally, we introduce a narrowing operator that utilizes recent advances in backbone extraction, allowing to increase the overapproximation precision in simulation at any time. The experiments evaluate the presented techniques in the context of hardware model checking."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"148-151","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093"}],"publication_status":"published","date_created":"2024-05-26T22:00:58Z","month":"02","OA_type":"green","oa":1,"main_file_link":[{"open_access":"1","url":"https://cca.informatik.uni-freiburg.de/papers/FroleyksYuBiere-MBMV24.pdf"}],"type":"conference"},{"oa_version":"None","date_updated":"2026-10-21T11:57:09Z","abstract":[{"lang":"eng","text":"This online resource contains the simulation data and program codes required for reproducing all results of the study described in the article, and Supplementary Figures and Videos."}],"year":"2024","date_published":"2024-05-01T00:00:00Z","_id":"23182","citation":{"apa":"Zendrikov, D., &#38; Paraskevov, A. (2024). Supplementary Material for the article entitled “The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks.” Figshare. <a href=\"https://doi.org/10.6084/m9.figshare.24527848\">https://doi.org/10.6084/m9.figshare.24527848</a>","ama":"Zendrikov D, Paraskevov A. Supplementary Material for the article entitled “The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks.” 2024. doi:<a href=\"https://doi.org/10.6084/m9.figshare.24527848\">10.6084/m9.figshare.24527848</a>","ieee":"D. Zendrikov and A. Paraskevov, “Supplementary Material for the article entitled ‘The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks.’” Figshare, 2024.","mla":"Zendrikov, Dmitrii, and Alexander Paraskevov. <i>Supplementary Material for the Article Entitled “The Vitals for Steady Nucleation Maps of Spontaneous Spiking Coherence in Autonomous Two-Dimensional Neuronal Networks.”</i> Figshare, 2024, doi:<a href=\"https://doi.org/10.6084/m9.figshare.24527848\">10.6084/m9.figshare.24527848</a>.","chicago":"Zendrikov, Dmitrii, and Alexander Paraskevov. “Supplementary Material for the Article Entitled ‘The Vitals for Steady Nucleation Maps of Spontaneous Spiking Coherence in Autonomous Two-Dimensional Neuronal Networks.’” Figshare, 2024. <a href=\"https://doi.org/10.6084/m9.figshare.24527848\">https://doi.org/10.6084/m9.figshare.24527848</a>.","ista":"Zendrikov D, Paraskevov A. 2024. Supplementary Material for the article entitled ‘The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks’, Figshare, <a href=\"https://doi.org/10.6084/m9.figshare.24527848\">10.6084/m9.figshare.24527848</a>.","short":"D. Zendrikov, A. Paraskevov, (2024)."},"status":"public","doi":"10.6084/m9.figshare.24527848","ddc":["570"],"publisher":"Figshare","month":"05","OA_type":"green","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.24527848"}],"article_processing_charge":"No","type":"research_data_reference","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","title":"Supplementary Material for the article entitled \"The vitals for steady nucleation maps of spontaneous spiking coherence in autonomous two-dimensional neuronal networks\"","related_material":{"record":[{"id":"17886","relation":"used_in_publication","status":"public"}]},"fulldoi":"https://doi.org/10.6084/m9.figshare.24527848","OA_place":"repository","department":[{"_id":"TiVo"}],"author":[{"last_name":"Zendrikov","first_name":"Dmitrii","full_name":"Zendrikov, Dmitrii"},{"full_name":"Paraskevov, Alexander","first_name":"Alexander","last_name":"Paraskevov"}],"date_created":"2026-10-21T11:57:04Z"},{"has_accepted_license":"1","month":"09","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","oa":1,"type":"conference","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"arxiv":["2407.06288"],"isi":["001556847400008"]},"arxiv":1,"project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"publication_status":"published","date_created":"2024-09-15T22:01:39Z","file_date_updated":"2024-09-17T09:35:03Z","acknowledgement":"This work was supported in part by the ERC projects ERC-2020-AdG 101020093 and CoG 863818 (ForM-SMArt) and by ISF grant no. 1679/21.","das_tickbox":"0","date_updated":"2026-10-21T12:17:18Z","scopus_import":"1","abstract":[{"lang":"eng","text":"Graph games lie at the algorithmic core of many automated design problems in computer science. These are games usually played between two players on a given graph, where the players keep moving a token along the edges according to pre-determined rules (turn-based, concurrent, etc.), and the winner is decided based on the infinite path (aka play) traversed by the token from a given initial position. In bidding games, the players initially get some monetary budgets which they need to use to bid for the privilege of moving the token at each step. Each round of bidding affects the players' available budgets, which is the only form of update that the budgets experience. We introduce bidding games with charging where the players can additionally improve their budgets during the game by collecting vertex-dependent monetary rewards, aka the \"charges.\" Unlike traditional bidding games (where all charges are zero), bidding games with charging allow non-trivial recurrent behaviors. For example, a reachability objective may require multiple detours to vertices with high charges to earn additional budget. We show that, nonetheless, the central property of traditional bidding games generalizes to bidding games with charging: For each vertex there exists a threshold ratio, which is the necessary and sufficient fraction of the total budget for winning the game from that vertex. While the thresholds of traditional bidding games correspond to unique fixed points of linear systems of equations, in games with charging, these fixed points are no longer unique. This significantly complicates the proof of existence and the algorithmic computation of thresholds for infinite-duration objectives. We also provide the lower complexity bounds for computing thresholds for Rabin and Streett objectives, which are the first known lower bounds in any form of bidding games (with or without charging), and we solve the following repair problem for safety and reachability games that have unsatisfiable objectives: Can we distribute a given amount of charge to the players in a way such that the objective can be satisfied?"}],"year":"2024","file":[{"date_created":"2024-09-17T09:35:03Z","file_id":"18083","relation":"main_file","success":1,"creator":"dernst","file_size":854430,"file_name":"2024_LIPICS_Avni.pdf","content_type":"application/pdf","checksum":"cb6f2254b84922cd7bf224f550b73f4a","access_level":"open_access","date_updated":"2024-09-17T09:35:03Z"}],"isi":1,"ec_funded":1,"status":"public","ddc":["000"],"volume":311,"publication_identifier":{"isbn":["9783959773393"],"issn":["1868-8969"]},"alternative_title":["LIPIcs"],"conference":{"start_date":"2024-09-09","end_date":"2024-09-13","location":"Calgary, Canada","name":"CONCUR: Conference on Concurrency Theory"},"article_processing_charge":"Yes","day":"01","title":"Bidding games with charging","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8","department":[{"_id":"ToHe"}],"author":[{"orcid":"0000-0001-5588-8287","first_name":"Guy","full_name":"Avni, Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","first_name":"Ehsan Kafshdar","full_name":"Goharshady, Ehsan Kafshdar"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","orcid":"0000-0001-9864-7475","first_name":"Kaushik","full_name":"Mallik, Kaushik"}],"oa_version":"Published Version","intvolume":"       311","quality_controlled":"1","supplementarymaterial":"no","researchdata_availability":"no","article_number":"8","date_published":"2024-09-01T00:00:00Z","_id":"18066","citation":{"ama":"Avni G, Goharshady EK, Henzinger TA, Mallik K. Bidding games with charging. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">10.4230/LIPIcs.CONCUR.2024.8</a>","ieee":"G. Avni, E. K. Goharshady, T. A. Henzinger, and K. Mallik, “Bidding games with charging,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311.","apa":"Avni, G., Goharshady, E. K., Henzinger, T. A., &#38; Mallik, K. (2024). Bidding games with charging. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.8</a>","ista":"Avni G, Goharshady EK, Henzinger TA, Mallik K. 2024. Bidding games with charging. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 8.","short":"G. Avni, E.K. Goharshady, T.A. Henzinger, K. Mallik, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","mla":"Avni, Guy, et al. “Bidding Games with Charging.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">10.4230/LIPIcs.CONCUR.2024.8</a>.","chicago":"Avni, Guy, Ehsan Kafshdar Goharshady, Thomas A Henzinger, and Kaushik Mallik. “Bidding Games with Charging.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.8</a>."},"doi":"10.4230/LIPIcs.CONCUR.2024.8","language":[{"iso":"eng"}],"publication":"35th International Conference on Concurrency Theory","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","oa":1,"month":"09","has_accepted_license":"1","type":"conference","external_id":{"isi":["001556847400012"],"arxiv":["2407.08620"]},"arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2024-09-17T07:31:18Z","date_created":"2024-09-15T22:01:40Z","publication_status":"published","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"date_updated":"2026-10-21T12:17:34Z","das_tickbox":"0","acknowledgement":"Udi Boker: Israel Science Foundation grant 2410/22\r\nThomas A. Henzinger: ERC-2020-AdG 101020093 (VAMOS)\r\nKaroliina Lehtinen: ANR QUASY 23-CE48-0008-01\r\nAditya Prakash: Chancellors’ International Scholarship from the University of Warwick and Centre for Discrete Mathematics and Its Applications (DIMAP)","file":[{"access_level":"open_access","date_updated":"2024-09-17T07:31:18Z","checksum":"66db11ef8e600a434079c278050c3f09","content_type":"application/pdf","file_name":"2024_LIPICS_Boker.pdf","file_size":766902,"creator":"dernst","success":1,"relation":"main_file","file_id":"18080","date_created":"2024-09-17T07:31:18Z"}],"year":"2024","abstract":[{"text":"An automaton 𝒜 is history-deterministic if its nondeterminism can be resolved on the fly, only using the prefix of the word read so far. This mild form of nondeterminism has attracted particular attention for its applications in synthesis problems. An automaton 𝒜 is guidable with respect to a class C of automata if it can fairly simulate every automaton in C, whose language is contained in that of 𝒜. In other words, guidable automata are those for which inclusion and simulation coincide, making them particularly interesting for model-checking. We study the connection between these two notions, and specifically the question of when they coincide. For classes of automata on which they do, deciding guidability, an otherwise challenging decision problem, reduces to deciding history-determinism, a problem that is starting to be well-understood for many classes. We provide a selection of sufficient criteria for a class of automata to guarantee the coincidence of the notions, and use them to show that the notions coincide for the most common automata classes, among which are ω-regular automata and many infinite-state automata with safety and reachability acceptance conditions, including vector addition systems with states, one-counter nets, pushdown-, Parikh-, and timed-automata. We also demonstrate that history-determinism and guidability do not always coincide, for example, for the classes of timed automata with a fixed number of clocks.","lang":"eng"}],"scopus_import":"1","status":"public","isi":1,"ec_funded":1,"conference":{"location":"Calgary, Canada","start_date":"2024-09-09","end_date":"2024-09-13","name":"CONCUR: Conference on Concurrency Theory"},"volume":311,"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773393"]},"alternative_title":["LIPIcs"],"ddc":["000"],"article_processing_charge":"No","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12","title":"History-determinism vs fair simulation","day":"01","author":[{"first_name":"Udi","full_name":"Boker, Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lehtinen","full_name":"Lehtinen, Karoliina","first_name":"Karoliina"},{"last_name":"Prakash","full_name":"Prakash, Aditya","first_name":"Aditya"}],"department":[{"_id":"ToHe"}],"researchdata_availability":"no","supplementarymaterial":"no","intvolume":"       311","quality_controlled":"1","oa_version":"Published Version","_id":"18067","citation":{"short":"U. Boker, T.A. Henzinger, K. Lehtinen, A. Prakash, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Boker U, Henzinger TA, Lehtinen K, Prakash A. 2024. History-determinism vs fair simulation. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 12.","chicago":"Boker, Udi, Thomas A Henzinger, Karoliina Lehtinen, and Aditya Prakash. “History-Determinism vs Fair Simulation.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.12</a>.","mla":"Boker, Udi, et al. “History-Determinism vs Fair Simulation.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">10.4230/LIPIcs.CONCUR.2024.12</a>.","ieee":"U. Boker, T. A. Henzinger, K. Lehtinen, and A. Prakash, “History-determinism vs fair simulation,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311.","ama":"Boker U, Henzinger TA, Lehtinen K, Prakash A. History-determinism vs fair simulation. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">10.4230/LIPIcs.CONCUR.2024.12</a>","apa":"Boker, U., Henzinger, T. A., Lehtinen, K., &#38; Prakash, A. (2024). History-determinism vs fair simulation. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.12</a>"},"date_published":"2024-09-01T00:00:00Z","article_number":"12","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication":"35th International Conference on Concurrency Theory","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.CONCUR.2024.12"},{"page":"153-172","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"publication_status":"published","date_created":"2024-05-12T22:01:02Z","file_date_updated":"2024-05-22T07:09:24Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["001284187100008"],"arxiv":["2310.11798"]},"arxiv":1,"type":"conference","has_accepted_license":"1","month":"04","corr_author":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"ddc":["000"],"volume":14572,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031572555"],"eissn":["1611-3349"]},"alternative_title":["LNCS"],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2024-04-11","start_date":"2024-04-06","location":"Luxembourg City, Luxembourg"},"isi":1,"ec_funded":1,"status":"public","scopus_import":"1","year":"2024","abstract":[{"text":"Sequential decision-making tasks often require satisfaction of multiple, partially-contradictory objectives. Existing approaches are monolithic, where a single policy fulfills all objectives. We present auction-based scheduling, a decentralized framework for multi-objective sequential decision making. Each objective is fulfilled using a separate and independent policy. Composition of policies is performed at runtime, where at each step, the policies simultaneously bid from pre-allocated budgets for the privilege of choosing the next action. The framework allows policies to be independently created, modified, and replaced. We study path planning problems on finite graphs with two temporal objectives and present algorithms to synthesize policies together with bidding policies in a decentralized manner. We consider three categories of decentralized synthesis problems, parameterized by the assumptions that the policies make on each other. We identify a class of assumptions called assume-admissible for which synthesis is always possible for graphs whose every vertex has at most two outgoing edges.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"date_created":"2024-05-22T07:09:24Z","file_id":"15414","file_size":508191,"creator":"dernst","checksum":"dbeb123510997886d11925aedbf9c400","file_name":"2024_LNCS_Avni.pdf","content_type":"application/pdf","access_level":"open_access","date_updated":"2024-05-22T07:09:24Z"}],"acknowledgement":"This work was supported in part by the ERC project ERC-2020-AdG 101020093 and by ISF grant no. 1679/21.","das_tickbox":"0","date_updated":"2026-10-21T12:16:28Z","department":[{"_id":"ToHe"}],"author":[{"first_name":"Guy","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mallik, Kaushik","first_name":"Kaushik","orcid":"0000-0001-9864-7475","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"last_name":"Sadhukhan","full_name":"Sadhukhan, Suman","first_name":"Suman"}],"day":"05","title":"Auction-based scheduling","fulldoi":"https://doi.org/10.1007/978-3-031-57256-2_8","article_processing_charge":"Yes (in subscription journal)","doi":"10.1007/978-3-031-57256-2_8","language":[{"iso":"eng"}],"publication":"30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","publisher":"Springer Nature","date_published":"2024-04-05T00:00:00Z","citation":{"ieee":"G. Avni, K. Mallik, and S. Sadhukhan, “Auction-based scheduling,” in <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Luxembourg City, Luxembourg, 2024, vol. 14572, pp. 153–172.","ama":"Avni G, Mallik K, Sadhukhan S. Auction-based scheduling. In: <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 14572. Springer Nature; 2024:153-172. doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">10.1007/978-3-031-57256-2_8</a>","apa":"Avni, G., Mallik, K., &#38; Sadhukhan, S. (2024). Auction-based scheduling. In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 14572, pp. 153–172). Luxembourg City, Luxembourg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">https://doi.org/10.1007/978-3-031-57256-2_8</a>","short":"G. Avni, K. Mallik, S. Sadhukhan, in:, 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2024, pp. 153–172.","ista":"Avni G, Mallik K, Sadhukhan S. 2024. Auction-based scheduling. 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 14572, 153–172.","chicago":"Avni, Guy, Kaushik Mallik, and Suman Sadhukhan. “Auction-Based Scheduling.” In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 14572:153–72. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">https://doi.org/10.1007/978-3-031-57256-2_8</a>.","mla":"Avni, Guy, et al. “Auction-Based Scheduling.” <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 14572, Springer Nature, 2024, pp. 153–72, doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">10.1007/978-3-031-57256-2_8</a>."},"_id":"15376","oa_version":"Published Version","quality_controlled":"1","intvolume":"     14572","supplementarymaterial":"no","researchdata_availability":"no"},{"file":[{"date_updated":"2024-08-12T06:53:39Z","access_level":"open_access","content_type":"application/pdf","file_name":"2024_LNCS_Froleyks.pdf","checksum":"7d7839fc8c5c680ea3ac09f40a66e55d","creator":"dernst","file_size":556902,"date_created":"2024-08-12T06:53:39Z","file_id":"17414","relation":"main_file","success":1}],"year":"2024","abstract":[{"lang":"eng","text":"Certification helps to increase trust in formal verification of safety-critical systems which require assurance on their correctness. In hardware model checking, a widely used formal verification technique, phase abstraction is considered one of the most commonly used preprocessing techniques. We present an approach to certify an extended form of phase abstraction using a generic certificate format. As in earlier works our approach involves constructing a witness circuit with an inductive invariant property that certifies the correctness of the entire model checking process, which is then validated by an independent certificate checker. We have implemented and evaluated the proposed approach including certification for various preprocessing configurations on hardware model checking competition benchmarks. As an improvement on previous work in this area, the proposed method is able to efficiently complete certification with an overhead of a fraction of model checking time."}],"scopus_import":"1","date_updated":"2026-10-21T12:03:11Z","das_tickbox":"0","acknowledgement":"This work is supported by the Austrian Science Fund (FWF) under the project W1255-N23, the LIT AI Lab funded by the State of Upper Austria, the ERC-2020-AdG 101020093, the Academy of Finland under the project 336092 and by a gift from Intel Corporation.","conference":{"start_date":"2024-07-03","end_date":"2024-07-06","location":"Nancy, France","name":"IJCAR: International Joint Conference on Automated Reasoning"},"volume":14739,"alternative_title":["LNCS"],"publication_identifier":{"isbn":["9783031634970"],"eissn":["1611-3349"],"issn":["0302-9743"]},"ddc":["000"],"status":"public","isi":1,"ec_funded":1,"type":"conference","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"month":"07","has_accepted_license":"1","file_date_updated":"2024-08-12T06:53:39Z","date_created":"2024-08-11T22:01:13Z","publication_status":"published","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"page":"284-303","arxiv":1,"external_id":{"isi":["001273489700017"],"arxiv":["2405.04297"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"apa":"Froleyks, N., Yu, E., Biere, A., &#38; Heljanko, K. (2024). Certifying phase abstraction. In <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 14739, pp. 284–303). Nancy, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-63498-7_17\">https://doi.org/10.1007/978-3-031-63498-7_17</a>","ama":"Froleyks N, Yu E, Biere A, Heljanko K. Certifying phase abstraction. In: <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 14739. Springer Nature; 2024:284-303. doi:<a href=\"https://doi.org/10.1007/978-3-031-63498-7_17\">10.1007/978-3-031-63498-7_17</a>","ieee":"N. Froleyks, E. Yu, A. Biere, and K. Heljanko, “Certifying phase abstraction,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Nancy, France, 2024, vol. 14739, pp. 284–303.","chicago":"Froleyks, Nils, Emily Yu, Armin Biere, and Keijo Heljanko. “Certifying Phase Abstraction.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, 14739:284–303. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-63498-7_17\">https://doi.org/10.1007/978-3-031-63498-7_17</a>.","mla":"Froleyks, Nils, et al. “Certifying Phase Abstraction.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, vol. 14739, Springer Nature, 2024, pp. 284–303, doi:<a href=\"https://doi.org/10.1007/978-3-031-63498-7_17\">10.1007/978-3-031-63498-7_17</a>.","short":"N. Froleyks, E. Yu, A. Biere, K. Heljanko, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2024, pp. 284–303.","ista":"Froleyks N, Yu E, Biere A, Heljanko K. 2024. Certifying phase abstraction. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). IJCAR: International Joint Conference on Automated Reasoning, LNCS, vol. 14739, 284–303."},"_id":"17413","date_published":"2024-07-01T00:00:00Z","researchdata_availability":"no","supplementarymaterial":"no","intvolume":"     14739","quality_controlled":"1","oa_version":"Published Version","publisher":"Springer Nature","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-63498-7_17","article_processing_charge":"Yes (in subscription journal)","author":[{"last_name":"Froleyks","full_name":"Froleyks, Nils","first_name":"Nils"},{"full_name":"Yu, Zhengqi","first_name":"Zhengqi","orcid":"0000-0002-4993-773X","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","last_name":"Yu"},{"last_name":"Biere","full_name":"Biere, Armin","first_name":"Armin"},{"last_name":"Heljanko","first_name":"Keijo","full_name":"Heljanko, Keijo"}],"department":[{"_id":"ToHe"}],"fulldoi":"https://doi.org/10.1007/978-3-031-63498-7_17","title":"Certifying phase abstraction","day":"01"},{"citation":{"ista":"Chalupa M, Richter C. 2024. Bubaak-SpLit: Split what you cannot verify (Competition contribution). 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 14572, 353–358.","short":"M. Chalupa, C. Richter, in:, 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2024, pp. 353–358.","mla":"Chalupa, Marek, and Cedric Richter. “Bubaak-SpLit: Split What You Cannot Verify (Competition Contribution).” <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 14572, Springer Nature, 2024, pp. 353–358, doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_20\">10.1007/978-3-031-57256-2_20</a>.","chicago":"Chalupa, Marek, and Cedric Richter. “Bubaak-SpLit: Split What You Cannot Verify (Competition Contribution).” In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 14572:353–358. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_20\">https://doi.org/10.1007/978-3-031-57256-2_20</a>.","ama":"Chalupa M, Richter C. Bubaak-SpLit: Split what you cannot verify (Competition contribution). In: <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 14572. Springer Nature; 2024:353–358. doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_20\">10.1007/978-3-031-57256-2_20</a>","ieee":"M. Chalupa and C. Richter, “Bubaak-SpLit: Split what you cannot verify (Competition contribution),” in <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Luxembourg City, Luxembourg, 2024, vol. 14572, pp. 353–358.","apa":"Chalupa, M., &#38; Richter, C. (2024). Bubaak-SpLit: Split what you cannot verify (Competition contribution). In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 14572, pp. 353–358). Luxembourg City, Luxembourg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_20\">https://doi.org/10.1007/978-3-031-57256-2_20</a>"},"_id":"15333","date_published":"2024-04-05T00:00:00Z","supplementarymaterial":"no","researchdata_availability":"yes","oa_version":"Published Version","intvolume":"     14572","quality_controlled":"1","publication":"30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","publisher":"Springer Nature","doi":"10.1007/978-3-031-57256-2_20","language":[{"iso":"eng"}],"dataavailabilitystatement":"The submitted version of our tool contribution is archived and available at Zenodo [2] https://zenodo.org/records/10202207. The source code is also available on GitLab [3] https://gitlab.com/mchalupa/bubaak","article_processing_charge":"Yes (in subscription journal)","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","first_name":"Marek","full_name":"Chalupa, Marek"},{"last_name":"Richter","full_name":"Richter, Cedric","first_name":"Cedric"}],"department":[{"_id":"ToHe"}],"title":"Bubaak-SpLit: Split what you cannot verify (Competition contribution)","fulldoi":"https://doi.org/10.1007/978-3-031-57256-2_20","day":"05","file":[{"access_level":"open_access","date_updated":"2024-04-26T11:27:26Z","file_name":"2024_LNCS_Chalupa.pdf","content_type":"application/pdf","checksum":"208c855c60824bec936b8d01d0396474","creator":"cchlebak","file_size":577128,"date_created":"2024-04-26T11:27:26Z","file_id":"15347","relation":"main_file","success":1}],"scopus_import":"1","year":"2024","abstract":[{"text":"BUBAAK-SpLit is a tool for dynamically splitting verification tasks into parts that can then be analyzed in parallel. It is built on top of BUBAAK, a tool designed for running combinations of verifiers in parallel. In contrast to BUBAAK, that directly invokes verifiers on the inputs, BUBAAK-SpLit first starts by splitting the input program into multiple modified versions called program splits. During the splitting process, BUBAAK-SpLit utilizes a weak verifier (in our case symbolic execution with a short timelimit) to analyze each generated program split. If the weak verifier fails on a program split, we split this program split again and start the verification process again on the generated program splits. We run the splitting process until a predefined number of hard-to-verify program splits is generated or a splitting limit is reached. During the main verification phase, we run a combination of BUBAAK-LEE and SLOWBEAST in parallel on the remaining unsolved parts of the verification task.","lang":"eng"}],"date_updated":"2026-10-21T12:12:16Z","acknowledgement":"This work was partially supported by the ERC-2020-AdG 10102009 grant.","das_tickbox":"1","conference":{"location":"Luxembourg City, Luxembourg","start_date":"2024-04-06","end_date":"2024-04-11","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"ddc":["000"],"publication_identifier":{"isbn":["9783031572555"],"eisbn":["9783031572562"],"eissn":["1611-3349"],"issn":["0302-9743"]},"alternative_title":["LNCS"],"volume":14572,"status":"public","isi":1,"ec_funded":1,"type":"conference","corr_author":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"has_accepted_license":"1","month":"04","publication_status":"published","date_created":"2024-04-20T18:14:06Z","file_date_updated":"2024-04-26T11:27:26Z","page":"353–358","project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"external_id":{"isi":["001284187100020"]},"related_material":{"record":[{"id":"23183","relation":"research_data","status":"public"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"}]
