[{"oa":1,"author":[{"last_name":"Shikara","full_name":"Shikara, Dania","first_name":"Dania"},{"last_name":"Bishop","first_name":"Eden","full_name":"Bishop, Eden"},{"last_name":"Barton","full_name":"Barton, Nathan","first_name":"Nathan"},{"last_name":"Makdissi","full_name":"Makdissi, Stephanie","first_name":"Stephanie"},{"last_name":"Kailasam","first_name":"Senthilkumar","full_name":"Kailasam, Senthilkumar"},{"last_name":"György","id":"3BCEDBE0-F248-11E8-B48F-1D18A9856A87","first_name":"Attila","full_name":"György, Attila","orcid":"0000-0002-1819-198X"},{"last_name":"Siekhaus","full_name":"Siekhaus, Daria E","first_name":"Daria E","orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Borroto, Maria Carla","first_name":"Maria Carla","last_name":"Borroto"},{"full_name":"Campeau, Philippe M.","first_name":"Philippe M.","last_name":"Campeau"},{"last_name":"Vong","full_name":"Vong, Linda","first_name":"Linda"},{"first_name":"Chaim M.","full_name":"Roifman, Chaim M.","last_name":"Roifman"},{"last_name":"Parsons","full_name":"Parsons, Brendon D.","first_name":"Brendon D."},{"first_name":"Francesca","full_name":"Di Cara, Francesca","last_name":"Di Cara"}],"ddc":["570"],"department":[{"_id":"DaSi"}],"language":[{"iso":"eng"}],"date_updated":"2026-09-16T08:48:22Z","researchdata_availability":"yes","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","DOAJ_listed":"1","date_created":"2026-09-13T22:01:51Z","publisher":"Springer Nature","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"article_type":"original","intvolume":" 17","external_id":{"pmid":["42463491"]},"fulldoi":"https://doi.org/10.1038/s41467-026-75539-y","citation":{"ista":"Shikara D, Bishop E, Barton N, Makdissi S, Kailasam S, György A, Siekhaus DE, Borroto MC, Campeau PM, Vong L, Roifman CM, Parsons BD, Di Cara F. 2026. The minor spliceosome component U4atac regulates JAK/STAT signaling to modulate hematopoiesis and immune responses in Drosophila melanogaster. Nature Communications. 17, 9582.","ieee":"D. Shikara et al., “The minor spliceosome component U4atac regulates JAK/STAT signaling to modulate hematopoiesis and immune responses in Drosophila melanogaster,” Nature Communications, vol. 17. Springer Nature, 2026.","ama":"Shikara D, Bishop E, Barton N, et al. The minor spliceosome component U4atac regulates JAK/STAT signaling to modulate hematopoiesis and immune responses in Drosophila melanogaster. Nature Communications. 2026;17. doi:10.1038/s41467-026-75539-y","apa":"Shikara, D., Bishop, E., Barton, N., Makdissi, S., Kailasam, S., György, A., … Di Cara, F. (2026). The minor spliceosome component U4atac regulates JAK/STAT signaling to modulate hematopoiesis and immune responses in Drosophila melanogaster. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-026-75539-y","chicago":"Shikara, Dania, Eden Bishop, Nathan Barton, Stephanie Makdissi, Senthilkumar Kailasam, Attila György, Daria E Siekhaus, et al. “The Minor Spliceosome Component U4atac Regulates JAK/STAT Signaling to Modulate Hematopoiesis and Immune Responses in Drosophila Melanogaster.” Nature Communications. Springer Nature, 2026. https://doi.org/10.1038/s41467-026-75539-y.","short":"D. Shikara, E. Bishop, N. Barton, S. Makdissi, S. Kailasam, A. György, D.E. Siekhaus, M.C. Borroto, P.M. Campeau, L. Vong, C.M. Roifman, B.D. Parsons, F. Di Cara, Nature Communications 17 (2026).","mla":"Shikara, Dania, et al. “The Minor Spliceosome Component U4atac Regulates JAK/STAT Signaling to Modulate Hematopoiesis and Immune Responses in Drosophila Melanogaster.” Nature Communications, vol. 17, 9582, Springer Nature, 2026, doi:10.1038/s41467-026-75539-y."},"OA_type":"gold","OA_place":"publisher","title":"The minor spliceosome component U4atac regulates JAK/STAT signaling to modulate hematopoiesis and immune responses in Drosophila melanogaster","scopus_import":"1","year":"2026","file":[{"date_created":"2026-09-16T08:43:27Z","content_type":"application/pdf","relation":"main_file","success":1,"access_level":"open_access","file_size":5784038,"file_name":"2026_NatureComm_Shikara.pdf","checksum":"7a1036697767e6b948d009ff57b1e1b6","file_id":"22934","date_updated":"2026-09-16T08:43:27Z","creator":"dernst"}],"_id":"22910","article_number":"9582","status":"public","type":"journal_article","acknowledgement":"Microscopy was performed at the Dalhousie University, Faculty of Medicine, Cellular and Molecular Digital Imaging. We thank Gerard Gaspard for their help with microscopy. The sequencing of the RNA libraries was performed at Génome Québec, Montreal, QC. Bioinformatics support was provided by the Canadian Center for Computational Genomics (C3G) at the McGill Genome Center of the Victor Phillip Dahdaleh Institute of Genomic Medicine, Montreal, Quebec, Canada. We thank Dr. Rahul Kanadia at the University of Connecticut for insightful discussions on the topic. This work was funded by a Project Grant from the 2019-20 Establishment Grant (Research Nova Scotia), the CIHR Project grant PJT-169179, a CIHR Catalyst grant Rare Diseases: Models & Mechanisms Network and NSERC Discovery Grant RGPIN-2019-04083 to Francesca Di Cara. Dania Shikara and Eden Bishop were funded by NSERC URSA Summer 2021, and Nathan Barton was funded by an Imhotep’s Legacy Academy Summer Scholarship and CIHR-SSRP Summer 2023.","date_published":"2026-09-08T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","dataavailabilitystatement":"The original RNA-seq DATA have been deposited at NCBI and are publicly available as of the date of publication under the accession numbers NCBI Bioproject Number: PRJNA1329293. All data are included in the Supplementary Information or available from the authors, as are unique reagents used in this Article. The raw numbers for charts and graphs are available in the Source Data file whenever possible Source data are provided in this paper.","publication_status":"published","pmid":1,"supplementarymaterial":"yes","quality_controlled":"1","month":"09","publication_identifier":{"eissn":["2041-1723"]},"article_processing_charge":"Yes","has_accepted_license":"1","day":"08","doi":"10.1038/s41467-026-75539-y","volume":17,"publication":"Nature Communications","file_date_updated":"2026-09-16T08:43:27Z","abstract":[{"text":"The small nuclear RNA U4atac is a core component of the minor spliceosome. In humans, homozygous or compound heterozygous point mutations in U4atac cause rare developmental disorders, such as Roifman syndrome, characterized by growth restriction, brain anomalies, and immune deficiency. To better define the pathophysiological role of U4atac mutations, we here establish a model of minor spliceosome dysfunction by generating a Drosophila melanogaster CRISPR/Cas9-induced U4atac mutant in the highly conserved stem II region. U4atac homozygous mutants exhibit growth and neurodevelopmental defects, immunodeficiency, and gastrointestinal symptoms. Using bulk RNA-sequencing and functional assays, we reveal that mutations in U4atac affect the splicing of a large set of transcripts involved in innate immunity, hematopoiesis, and intestinal cell functions, including the Drosophila Janus kinase (JAK) homolog hopscotch (hop). Importantly, U4atac deficiency reduces Hop expression and causes Hop-related hematopoietic defects at the embryonic and larval stages. Notably, we also observe reduced expression of Jak1 and attenuated activation of downstream signaling in patients with Roifman syndrome. Thus, our work identifies alterations of Jak signaling as part of the pathogenesis of RNU4atac-opathy.","lang":"eng"}],"oa_version":"Published Version","das_tickbox":"1"},{"_id":"22775","degree_awarded":"PhD","year":"2026","file":[{"relation":"main_file","embargo_to":"open_access","content_type":"application/pdf","date_created":"2026-09-08T09:01:22Z","embargo":"2028-03-08","creator":"cchlebak","access_level":"closed","checksum":"d9a6fd39a0b6343c4473901f9323f127","file_name":"2026_Jamrichova_Silvia_Thesis.pdf","date_updated":"2026-09-08T09:01:22Z","file_id":"22850","file_size":8968078},{"creator":"cchlebak","file_size":17338630,"file_name":"2026_Jamrichova_Silvia_Thesis.docx","date_updated":"2026-09-08T09:02:52Z","checksum":"02b728c9157f88e392b69e94877889f0","file_id":"22851","access_level":"closed","relation":"source_file","date_created":"2026-09-08T09:02:52Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document"}],"date_published":"2026-09-03T00:00:00Z","type":"dissertation","status":"public","title":"Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans","OA_place":"publisher","file_date_updated":"2026-09-08T09:02:52Z","day":"03","doi":"10.15479/AT-ISTA-22775","oa_version":"Published Version","supervisor":[{"full_name":"Jonas, Peter M","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas"}],"doi_confirm":"1","supplementarymaterial":"no","project":[{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","call_identifier":"H2020","grant_number":"692692"},{"_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b","name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits","grant_number":"101199096"},{"name":"Mechanisms of GABA release in hippocampal circuits","_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5","grant_number":"P36232"},{"_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e","name":"Synaptic networks of human brain","grant_number":"PAT 4178023"},{"name":"Synaptic communication in neuronal microcircuits","_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","call_identifier":"FWF"},{"grant_number":"COE16","_id":"0a6c8641-b036-11f1-bacf-e4eec62b5bb4","name":"Neuronal circuits in health and disease (Jonas)"}],"publication_status":"published","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","has_accepted_license":"1","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-085-5"]},"month":"09","OA_embargo":"18","department":[{"_id":"GradSch"},{"_id":"PeJo"}],"date_updated":"2026-09-16T08:13:41Z","language":[{"iso":"eng"}],"researchdata_availability":"upon request","ec_funded":1,"ddc":["570"],"author":[{"orcid":"0009-0003-9929-8221","full_name":"Jamrichova, Silvia","first_name":"Silvia","id":"F0EA6804-AA27-11E9-8613-C0F7E5697425","last_name":"Jamrichova"}],"citation":{"short":"S. Jamrichova, Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans, Institute of Science and Technology Austria, 2026.","chicago":"Jamrichova, Silvia. “Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22775.","mla":"Jamrichova, Silvia. Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22775.","ista":"Jamrichova S. 2026. Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans. Institute of Science and Technology Austria.","ieee":"S. Jamrichova, “Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans,” Institute of Science and Technology Austria, 2026.","apa":"Jamrichova, S. (2026). Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22775","ama":"Jamrichova S. Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans. 2026. doi:10.15479/AT-ISTA-22775"},"fulldoi":"https://doi.org/10.15479/AT-ISTA-22775","page":"153","corr_author":"1","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"M-Shop"},{"_id":"LifeSc"}],"publisher":"Institute of Science and Technology Austria","date_created":"2026-09-03T08:06:58Z","alternative_title":["ISTA Thesis"],"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"}},{"intvolume":" 388","external_id":{"arxiv":["2511.02954"]},"corr_author":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.ESA.2026.101","citation":{"mla":"Van Der Hoog, Ivor, et al. “Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection.” 34th Annual European Symposium on Algorithms, vol. 388, 101, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.ESA.2026.101.","short":"I. Van Der Hoog, E. Rotenberg, D.P. Rutschmann, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","chicago":"Van Der Hoog, Ivor, Eva Rotenberg, and Daniel P Rutschmann. “Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection.” In 34th Annual European Symposium on Algorithms, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.101.","apa":"Van Der Hoog, I., Rotenberg, E., & Rutschmann, D. P. (2026). Tight Better-Than-Worst-Case bounds for element distinctness and set intersection. In 34th Annual European Symposium on Algorithms (Vol. 388). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2026.101","ama":"Van Der Hoog I, Rotenberg E, Rutschmann DP. Tight Better-Than-Worst-Case bounds for element distinctness and set intersection. In: 34th Annual European Symposium on Algorithms. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.ESA.2026.101","ista":"Van Der Hoog I, Rotenberg E, Rutschmann DP. 2026. Tight Better-Than-Worst-Case bounds for element distinctness and set intersection. 34th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 388, 101.","ieee":"I. Van Der Hoog, E. Rotenberg, and D. P. Rutschmann, “Tight Better-Than-Worst-Case bounds for element distinctness and set intersection,” in 34th Annual European Symposium on Algorithms, L’Aquila, Italy, 2026, vol. 388."},"date_created":"2026-09-13T22:01:52Z","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"},"alternative_title":["LIPIcs"],"researchdata_availability":"no","language":[{"iso":"eng"}],"department":[{"_id":"MoHe"}],"date_updated":"2026-09-16T09:21:35Z","ec_funded":1,"oa":1,"arxiv":1,"author":[{"first_name":"Ivor","full_name":"Van Der Hoog, Ivor","last_name":"Van Der Hoog"},{"full_name":"Rotenberg, Eva","first_name":"Eva","last_name":"Rotenberg"},{"last_name":"Rutschmann","full_name":"Rutschmann, Daniel P","first_name":"Daniel P","id":"7397d908-b582-11f0-bf73-88b902e86527"}],"ddc":["000"],"day":"25","doi":"10.4230/LIPIcs.ESA.2026.101","file_date_updated":"2026-09-16T09:20:49Z","volume":388,"publication":"34th Annual European Symposium on Algorithms","abstract":[{"text":"The element distinctness problem takes as input a list I of n values from a totally ordered universe, where pairwise comparisons between values are allowed, and the goal is to decide whether I contains any duplicates. It is a well-studied problem with a classical worst-case Ω(n log n) comparison-based lower bound by Fredman [TCS'76]. At first glance, this lower bound appears to rule out any algorithm more efficient than the naive approach of sorting I and comparing adjacent elements. However, upon closer inspection, the Ω(n log n) bound is overly pessimistic. For instance, if I contains n/2 identical elements, a median-finding algorithm will, regardless of the input order, find a duplicate in linear time. This raises a natural question: Are there comparison-based lower bounds for element distinctness that are sensitive to the amount of duplicates in the input instance?\r\nTo address this question, we derive instance-specific lower bounds. For any input instance I, we represent the combinatorial structure of the duplicates in I by an undirected graph G(I) that connects identical elements. Each such graph G is a union of cliques, and we study algorithms by their worst-case running time over all inputs I' with G(I') ≅ G. We establish an adversarial lower bound showing that, for any deterministic algorithm 𝒜, there exists a graph G and an algorithm 𝒜' that, for all inputs I with G(I) ≅ G, is a factor O(log log n) faster than 𝒜. Consequently, no deterministic algorithm can be o(log log n)-competitive for all graphs G. We complement this with an O(log log n)-competitive deterministic algorithm, thereby obtaining tight bounds for element distinctness that go beyond classical worst-case analysis. Subsequently, we study the related problem of set intersection. We show that no deterministic set intersection algorithm can be o(log n)-competitive, and provide an O(log n)-competitive deterministic algorithm. We find it interesting and surprising to discover tight O(log log n)-competitive bounds for element distinctness. Moreover, we find the separation between element distinctness and the set intersection problem unexpected.","lang":"eng"}],"oa_version":"Published Version","das_tickbox":"0","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","project":[{"name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","call_identifier":"H2020"}],"supplementarymaterial":"yes","quality_controlled":"1","month":"08","publication_identifier":{"isbn":["9783959774451"],"issn":["1868-8969"]},"has_accepted_license":"1","article_processing_charge":"Yes","year":"2026","file":[{"file_size":892322,"file_id":"22937","checksum":"c552853bfa37e4b9a0f060107e464ed0","date_updated":"2026-09-16T09:20:49Z","file_name":"2026_LIPIcsESA_vanderHoog.pdf","access_level":"open_access","creator":"dernst","date_created":"2026-09-16T09:20:49Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"article_number":"101","_id":"22915","status":"public","type":"conference","conference":{"end_date":"2026-09-04","location":"L’Aquila, Italy","name":"ESA: European Symposium on Algorithms","start_date":"2026-08-31"},"acknowledgement":"Ivor van der Hoog, Eva Rotenberg, and Daniel Rutschmann thank the VILLUM Foundation\r\ngrant (VIL37507) “Efficient Recomputations for Changeful Problems” for supporting this work.\r\nDaniel Rutschmann is supported by the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (No. 101019564) ","date_published":"2026-08-25T00:00:00Z","OA_type":"gold","keyword":["Comparison-based analysis","set intersection","universal optimality"],"OA_place":"publisher","title":"Tight Better-Than-Worst-Case bounds for element distinctness and set intersection","scopus_import":"1"},{"supplementarymaterial":"yes","project":[{"_id":"92503f6e-16d5-11f0-9cad-8c571927f3b7","name":"New regime of presynaptic release regulation","grant_number":"PAT 5720324"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"pmid":1,"publication_status":"published","dataavailabilitystatement":"All numerical data regarding electrophysiological recordings, calcium imaging, image analysis and behavioral tracking included in the article and/or SI Appendix have been deposited and are publicly available at ISTA REx (https://doi.org/10.15479/AT-ISTA-22704).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","publication_identifier":{"eissn":["1091-6490"]},"month":"09","quality_controlled":"1","issue":"36","file_date_updated":"2026-09-16T09:09:58Z","publication":"Proceedings of the National Academy of Sciences of the United States of America","volume":123,"doi":"10.1073/pnas.2536560123","day":"08","das_tickbox":"1","oa_version":"Published Version","abstract":[{"text":"The medial habenula (MHb) is implicated in regulating emotional responses to aversive events. Studies in zebrafish have identified a remarkable morphological left–right asymmetry in the dorsal habenula (zebrafish equivalent of mammalian MHb)-interpeduncular nucleus (IPN) pathway and its asymmetrical roles in behavior. However, there is little evidence for structural or functional lateralization in the mammalian MHb-IPN pathway. Here, we investigated the synaptic properties of left- and right-MHb afferents to the IPN and their roles in the expression of conditioned fear in mice. We found that each IPN neuron receives inputs from both left and right MHb, but the left MHb-originating synapses exhibit lower release probability and higher γ-aminobutyric acid type B receptor (GABABR)-mediated potentiation compared to the right MHb-originating synapses. Interestingly, these asymmetrical properties persist in the inversus visceral mutant mice with normal internal organ laterality (situs solitus), but nearly disappear in those with reversed internal organ laterality (situs inversus). Behaviorally, chemogenetic inhibition of cholinergic neurons and conditional deletion of GABABR in the left, but not the right, MHb significantly attenuated cue-dependent fear recall. Our results demonstrate functional asymmetry of the MHb under partial influence of the nodal flow in mice, revealing a predominant role of GABABR-mediated signaling in the left MHb-IPN pathway in modulating fear memories. These findings suggest that lateralized MHb pathways could represent a fundamental principle in the neural regulation of emotion across species but that they develop differently in zebrafish and mice.","lang":"eng"}],"keyword":["medial habenula","GABAB receptor","asymmetry","fear conditioning","mouse"],"OA_type":"hybrid","scopus_import":"1","title":"Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula","OA_place":"publisher","_id":"22913","article_number":"e2536560123","year":"2026","file":[{"file_size":7496942,"file_id":"22936","checksum":"8efe98c02ba79b9a3d76b7d6c1edbfbc","file_name":"2026_PNAS_Oenal.pdf","date_updated":"2026-09-16T09:09:58Z","access_level":"open_access","creator":"dernst","date_created":"2026-09-16T09:09:58Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"date_published":"2026-09-08T00:00:00Z","acknowledgement":"We thank Bernhard Bettler for GABAB1 floxed mice. This project has received funding from the Austrian Science Fund (10.55776/PAT5720324) to R.S., and the Marie Skłodowska-Curie Grant Agreement No. 665385 to C.Ö. We thank Todor Asenov from the ISTA machine shop for preparing the custom part and the ISTA preclinical facility for animal care. SI Appendix, Fig. S7 was created in BioRender under the following license [Onal, C.(2026) https://BioRender.com/wuyvshe]. For open access purposes, the author has applied a CC BY-NC-ND public copyright license to any author-accepted manuscript version arising from this submission.","related_material":{"record":[{"relation":"research_data","status":"public","id":"22704"}]},"type":"journal_article","status":"public","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"}],"publisher":"National Academy of Sciences","date_created":"2026-09-13T22:01:52Z","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"intvolume":" 123","article_type":"original","citation":{"ista":"Önal C, Koppensteiner P, Muhia MW, Le Monnier E, Shigemoto R. 2026. Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. Proceedings of the National Academy of Sciences of the United States of America. 123(36), e2536560123.","ieee":"C. Önal, P. Koppensteiner, M. W. Muhia, E. Le Monnier, and R. Shigemoto, “Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula,” Proceedings of the National Academy of Sciences of the United States of America, vol. 123, no. 36. National Academy of Sciences, 2026.","ama":"Önal C, Koppensteiner P, Muhia MW, Le Monnier E, Shigemoto R. Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. Proceedings of the National Academy of Sciences of the United States of America. 2026;123(36). doi:10.1073/pnas.2536560123","apa":"Önal, C., Koppensteiner, P., Muhia, M. W., Le Monnier, E., & Shigemoto, R. (2026). Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2536560123","short":"C. Önal, P. Koppensteiner, M.W. Muhia, E. Le Monnier, R. Shigemoto, Proceedings of the National Academy of Sciences of the United States of America 123 (2026).","chicago":"Önal, Cihan, Peter Koppensteiner, Mary W Muhia, Elodie Le Monnier, and Ryuichi Shigemoto. “Asymmetrical Modulation of Fear Expression via GABAB Receptors in the Mouse Medial Habenula.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2026. https://doi.org/10.1073/pnas.2536560123.","mla":"Önal, Cihan, et al. “Asymmetrical Modulation of Fear Expression via GABAB Receptors in the Mouse Medial Habenula.” Proceedings of the National Academy of Sciences of the United States of America, vol. 123, no. 36, e2536560123, National Academy of Sciences, 2026, doi:10.1073/pnas.2536560123."},"fulldoi":"https://doi.org/10.1073/pnas.2536560123","external_id":{"pmid":["42673459"]},"corr_author":"1","oa":1,"ec_funded":1,"ddc":["570"],"author":[{"last_name":"Önal","id":"4659D740-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2771-2011","first_name":"Hüseyin C","full_name":"Önal, Hüseyin C"},{"last_name":"Koppensteiner","orcid":"0000-0002-3509-1948","full_name":"Koppensteiner, Peter","first_name":"Peter","id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Muhia","first_name":"Mary W","full_name":"Muhia, Mary W","id":"ab7ed20f-09f7-11eb-909c-d5d0b443ee9d"},{"last_name":"Le Monnier","full_name":"Le Monnier, Elodie","first_name":"Elodie","id":"3B59276A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"researchdata_availability":"yes","date_updated":"2026-09-16T09:55:16Z","department":[{"_id":"RySh"},{"_id":"PreCl"}]},{"year":"2026","file":[{"content_type":"application/x-zip-compressed","date_created":"2026-08-13T12:07:53Z","relation":"main_file","success":1,"access_level":"open_access","date_updated":"2026-08-13T12:07:53Z","file_name":"Behavior.zip","file_id":"22705","checksum":"7742bb211a43bb87c2b5ce7bda3068ae","file_size":162086,"creator":"elemonni"},{"creator":"elemonni","access_level":"open_access","file_size":6643,"checksum":"a162eb6103a770d94536374e02934fcf","date_updated":"2026-08-13T12:07:57Z","file_id":"22706","file_name":"image_analysis.zip","relation":"main_file","success":1,"date_created":"2026-08-13T12:07:57Z","content_type":"application/x-zip-compressed"},{"file_size":1193016,"checksum":"608aaf395bba5fd9cf62d8c8940d63aa","file_id":"22707","file_name":"Recordings.zip","date_updated":"2026-08-13T12:07:59Z","access_level":"open_access","creator":"elemonni","date_created":"2026-08-13T12:07:59Z","content_type":"application/x-zip-compressed","success":1,"relation":"main_file"},{"success":1,"relation":"main_file","content_type":"text/plain","date_created":"2026-08-13T13:06:29Z","creator":"elemonni","checksum":"2389ebd71238bd7de03d20504a8cf962","date_updated":"2026-08-13T13:06:29Z","file_name":"README.txt","file_id":"22708","file_size":246,"access_level":"open_access"}],"_id":"22704","date_published":"2026-08-13T00:00:00Z","status":"public","related_material":{"record":[{"id":"22913","status":"public","relation":"used_in_publication"}]},"type":"research_data","OA_place":"repository","title":"Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula","file_date_updated":"2026-08-13T13:06:29Z","day":"13","doi":"10.15479/AT-ISTA-22704","oa_version":"None","abstract":[{"lang":"eng","text":"The medial habenula (MHb) is implicated in regulating emotional responses to aversive events. Studies in zebrafish have identified a remarkable morphological left–right asymmetry in the dorsal habenula (zebrafish equivalent of mammalian MHb)-interpeduncular nucleus (IPN) pathway and its asymmetrical roles in behavior. However, there is little evidence for structural or functional lateralization in the mammalian MHb-IPN pathway. Here, we investigated the synaptic properties of left- and right-MHb afferents to the IPN and their roles in the expression of conditioned fear in mice. We found that each IPN neuron receives inputs from both left and right MHb, but the left MHb-originating synapses exhibit lower release probability and higher γ-aminobutyric acid type B receptor (GABABR)-mediated potentiation compared to the right MHb-originating synapses. Interestingly, these asymmetrical properties persist in the inversus visceral mutant mice with normal internal organ laterality (situs solitus), but nearly disappear in those with reversed internal organ laterality (situs inversus). Behaviorally, chemogenetic inhibition of cholinergic neurons and conditional deletion of GABABR in the left, but not the right, MHb significantly attenuated cue-dependent fear recall. Our results demonstrate functional asymmetry of the MHb under partial influence of the nodal flow in mice, revealing a predominant role of GABABR-mediated signaling in the left MHb-IPN pathway in modulating fear memories. These findings suggest that lateralized MHb pathways could represent a fundamental principle in the neural regulation of emotion across species but that they develop differently in zebrafish and mice.\r\n"}],"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"},{"_id":"92503f6e-16d5-11f0-9cad-8c571927f3b7","name":"New regime of presynaptic release regulation","grant_number":"PAT 5720324"}],"doi_confirm":"1","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","article_processing_charge":"No","has_accepted_license":"1","month":"08","date_updated":"2026-09-16T09:55:15Z","department":[{"_id":"RySh"}],"oa":1,"ec_funded":1,"author":[{"last_name":"Le Monnier","id":"3B59276A-F248-11E8-B48F-1D18A9856A87","full_name":"Le Monnier, Elodie","first_name":"Elodie"},{"first_name":"Cihan","full_name":"Önal, Cihan","last_name":"Önal"}],"fulldoi":"https://doi.org/10.15479/AT-ISTA-22704","citation":{"ama":"Le Monnier E, Önal C. Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. 2026. doi:10.15479/AT-ISTA-22704","apa":"Le Monnier, E., & Önal, C. (2026). Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22704","ieee":"E. Le Monnier and C. Önal, “Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula.” Institute of Science and Technology Austria, 2026.","ista":"Le Monnier E, Önal C. 2026. Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula, Institute of Science and Technology Austria, 10.15479/AT-ISTA-22704.","mla":"Le Monnier, Elodie, and Cihan Önal. Asymmetrical Modulation of Fear Expression via GABAB Receptors in the Mouse Medial Habenula. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22704.","short":"E. Le Monnier, C. Önal, (2026).","chicago":"Le Monnier, Elodie, and Cihan Önal. “Asymmetrical Modulation of Fear Expression via GABAB Receptors in the Mouse Medial Habenula.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22704."},"corr_author":"1","publisher":"Institute of Science and Technology Austria","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"}],"date_created":"2026-08-13T12:20:08Z","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"}},{"page":"3707-3756","external_id":{"arxiv":["2410.10718"]},"corr_author":"1","citation":{"chicago":"Cipolloni, Giorgio, László Erdös, Sven Joscha Henheik, and Oleksii Kolupaiev. “Eigenvector Decorrelation for Random Matrices.” Annals of Applied Probability. Institute of Mathematical Statistics, 2026. https://doi.org/10.1214/26-AAP2318.","short":"G. Cipolloni, L. Erdös, S.J. Henheik, O. Kolupaiev, Annals of Applied Probability 36 (2026) 3707–3756.","mla":"Cipolloni, Giorgio, et al. “Eigenvector Decorrelation for Random Matrices.” Annals of Applied Probability, vol. 36, no. 4, Institute of Mathematical Statistics, 2026, pp. 3707–56, doi:10.1214/26-AAP2318.","ieee":"G. Cipolloni, L. Erdös, S. J. Henheik, and O. Kolupaiev, “Eigenvector decorrelation for random matrices,” Annals of Applied Probability, vol. 36, no. 4. Institute of Mathematical Statistics, pp. 3707–3756, 2026.","ista":"Cipolloni G, Erdös L, Henheik SJ, Kolupaiev O. 2026. Eigenvector decorrelation for random matrices. Annals of Applied Probability. 36(4), 3707–3756.","apa":"Cipolloni, G., Erdös, L., Henheik, S. J., & Kolupaiev, O. (2026). Eigenvector decorrelation for random matrices. Annals of Applied Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/26-AAP2318","ama":"Cipolloni G, Erdös L, Henheik SJ, Kolupaiev O. Eigenvector decorrelation for random matrices. Annals of Applied Probability. 2026;36(4):3707-3756. doi:10.1214/26-AAP2318"},"fulldoi":"https://doi.org/10.1214/26-AAP2318","article_type":"original","intvolume":" 36","mathsc":["60B20","82C10"],"date_created":"2026-09-13T22:01:54Z","publisher":"Institute of Mathematical Statistics","date_updated":"2026-09-16T10:00:54Z","researchdata_availability":"no","department":[{"_id":"LaEr"},{"_id":"GradSch"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Cipolloni","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","first_name":"Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"last_name":"Henheik","full_name":"Henheik, Sven Joscha","first_name":"Sven Joscha","orcid":"0000-0003-1106-327X","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb"},{"id":"149b70d4-896a-11ed-bdf8-8c63fd44ca61","first_name":"Oleksii","full_name":"Kolupaiev, Oleksii","orcid":"0000-0003-1491-4623","last_name":"Kolupaiev"}],"ec_funded":1,"arxiv":1,"oa":1,"abstract":[{"lang":"eng","text":"We study the sensitivity of the eigenvectors of random matrices, showing that even small perturbations make the eigenvectors almost orthogonal. More precisely, we consider two deformed Wigner matrices 𝑊 +𝐷1, 𝑊 +𝐷2 and show that their bulk eigenvectors become asymptotically orthogonal as soon as Tr(𝐷1−𝐷2)2 ≫1, or their respective energies are separated on a scale much bigger than the local eigenvalue spacing. Furthermore, we show that quadratic forms of eigenvectors of 𝑊 +𝐷1, 𝑊 +𝐷2 with any deterministic matrix 𝐴 ∈𝐂𝑁×𝑁 in a specific subspace of codimension one are of size 𝑁−1/2. This proves a generalization of the eigenstate thermalization hypothesis to eigenvectors belonging to two different spectral families."}],"das_tickbox":"0","oa_version":"Preprint","day":"01","doi":"10.1214/26-AAP2318","issue":"4","volume":36,"publication":"Annals of Applied Probability","month":"08","quality_controlled":"1","article_processing_charge":"No","publication_identifier":{"issn":["1050-5164"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","supplementarymaterial":"yes","project":[{"name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020"}],"publication_status":"published","type":"journal_article","related_material":{"record":[{"id":"19546","status":"public","relation":"earlier_version"}]},"status":"public","acknowledgement":"L. Erdős, J. Henheik and O. Kolupaiev were supported by the ERC Advanced Grant “RMTBeyond” No. 101020331. G. Cipolloni is partially supported by the MUR Excellence Department Project MatMod@TOV awarded to the Department of Mathematics, University of Rome Tor Vergata, CUP E83C18000100006.","date_published":"2026-08-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2410.10718"}],"_id":"22923","year":"2026","title":"Eigenvector decorrelation for random matrices","OA_place":"repository","scopus_import":"1","OA_type":"green","keyword":["characteristic flow","Davis–Kahan theorem","Eigenstate thermalization","Eigenvector perturbation theory","Local law","zigzag strategy"]},{"author":[{"last_name":"Vijatovic","id":"cf391e77-ec3c-11ea-a124-d69323410b58","full_name":"Vijatovic, David","first_name":"David","orcid":"0000-0002-5494-0941"},{"full_name":"Sweeney, Lora Beatrice Jaeger","first_name":"Lora Beatrice Jaeger","orcid":"0000-0001-9242-5601","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","last_name":"Sweeney"}],"ddc":["570"],"editor":[{"first_name":"Caroline W.","full_name":"Beck, Caroline W.","last_name":"Beck"}],"oa":1,"date_updated":"2026-09-17T08:03:32Z","department":[{"_id":"LoSw"}],"researchdata_availability":"no","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"alternative_title":["Methods in Molecular Biology"],"date_created":"2026-09-13T22:01:56Z","publisher":"Springer","external_id":{"pmid":["42681226"]},"corr_author":"1","page":"219-229","fulldoi":"https://doi.org/10.1007/978-1-0716-5360-9_9","citation":{"short":"D. Vijatovic, L.B. Sweeney, in:, C.W. Beck (Ed.), Xenopus, Springer, 2026, pp. 219–229.","chicago":"Vijatovic, David, and Lora B. Sweeney. “Adeno-Associated Virus (AAV) for Tracking Neural Development and Connectivity in Xenopus.” In Xenopus, edited by Caroline W. Beck, 3049:219–29. MIMB. Springer, 2026. https://doi.org/10.1007/978-1-0716-5360-9_9.","mla":"Vijatovic, David, and Lora B. Sweeney. “Adeno-Associated Virus (AAV) for Tracking Neural Development and Connectivity in Xenopus.” Xenopus, edited by Caroline W. Beck, vol. 3049, Springer, 2026, pp. 219–29, doi:10.1007/978-1-0716-5360-9_9.","ieee":"D. Vijatovic and L. B. Sweeney, “Adeno-Associated Virus (AAV) for tracking neural development and connectivity in Xenopus,” in Xenopus, vol. 3049, C. W. Beck, Ed. Springer, 2026, pp. 219–229.","ista":"Vijatovic D, Sweeney LB. 2026.Adeno-Associated Virus (AAV) for tracking neural development and connectivity in Xenopus. In: Xenopus. Methods in Molecular Biology, vol. 3049, 219–229.","ama":"Vijatovic D, Sweeney LB. Adeno-Associated Virus (AAV) for tracking neural development and connectivity in Xenopus. In: Beck CW, ed. Xenopus. Vol 3049. MIMB. Springer; 2026:219-229. doi:10.1007/978-1-0716-5360-9_9","apa":"Vijatovic, D., & Sweeney, L. B. (2026). Adeno-Associated Virus (AAV) for tracking neural development and connectivity in Xenopus. In C. W. Beck (Ed.), Xenopus (Vol. 3049, pp. 219–229). Springer. https://doi.org/10.1007/978-1-0716-5360-9_9"},"intvolume":" 3049","OA_place":"publisher","title":"Adeno-Associated Virus (AAV) for tracking neural development and connectivity in Xenopus","scopus_import":"1","OA_type":"hybrid","status":"public","type":"book_chapter","date_published":"2026-09-02T00:00:00Z","acknowledgement":"This work was supported by a Horizon Europe ERC Starting Grant Number 101041551 (L.B.S. and D.V.), FTI Strategy Lower Austria Dissertation Grant Number FT121-D-046 (D.V.), NSF IOS Grant Number 2110086 (L.B.S. and D.V.), Special Research Program (SFB) of the Austrian Science Fund (FWF) F7814-B (L.B.S.), and Austrian Science Fund (FWF) 10.55776/COE16 (L.B.S. and D.V.).","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-1-0716-5360-9_9"}],"year":"2026","file":[{"creator":"dernst","access_level":"open_access","file_size":852042,"date_updated":"2026-09-17T08:00:45Z","checksum":"ea5af1374dd6820830773e0e96535ac0","file_id":"22939","file_name":"2026_MIMB_Vijatovic2.pdf","relation":"main_file","success":1,"date_created":"2026-09-17T08:00:45Z","content_type":"application/pdf"}],"_id":"22926","quality_controlled":"1","month":"09","publication_identifier":{"eissn":["1940-6029"]},"has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","series_title":"MIMB","publication_status":"published","pmid":1,"project":[{"_id":"ebb66355-77a9-11ec-83b8-b8ac210a4dae","name":"Development and Evolution of Tetrapod Motor Circuits","grant_number":"101041551"},{"_id":"bd73af52-d553-11ed-ba76-912049f0ac7a","name":"Development of V1 interneuron diversity during swim-to-walk transition of Xenopus metamorphosis","grant_number":"FTI21-D-046"},{"grant_number":"F7814","_id":"8da85f50-16d5-11f0-9cad-eab8b0ff6c9e","name":"Stem Cell Modulation in Neural Development and Regeneration/ P14-Swim-to-limb transition: cell type to connection diversity"},{"grant_number":"COE16","name":"Neuronal circuits in health and disease (Sweeney)","_id":"cf428362-b037-11f1-b015-8277a8a2f63d"},{"grant_number":"3(GG016346-01)","_id":"34a02c70-11ca-11ed-8bc3-fbfd2c86c88f","name":"Development of Viral Vectors for Amphibian Gene Delivery and Manipulation"}],"supplementarymaterial":"no","abstract":[{"lang":"eng","text":"Adeno-associated viruses (AAVs) provide a versatile tool for labeling neurons in the Xenopus central nervous system across developmental stages. AAV-mediated transgene expression is long-lasting and stable, enabling robust labeling of neuronal populations without genomic integration and without the need to generate transgenic lines. The choice of AAV capsid and promoter can restrict expression to a population of interest, and depending on the route and timing of delivery, AAVs can selectively target either progenitor-derived neuronal cohorts or mature neuronal populations. Here, we have outlined two labeling strategies. First, intraventricular injections in tadpoles transduce neural progenitor cells lining the ventricular system, resulting in cohort-based labeling of neurons as they differentiate during development. Second, direct intraparenchymal injections in post-metamorphic frogs enable spatially restricted labeling and anterograde or retrograde tracing of connectivity within defined brain regions. Together, these approaches provide selective access to developing and mature neural circuits in X. laevis, supporting applications ranging from anatomical tracing to functional imaging and manipulation of neural circuits."}],"oa_version":"Published Version","das_tickbox":"0","doi":"10.1007/978-1-0716-5360-9_9","day":"02","file_date_updated":"2026-09-17T08:00:45Z","publication":"Xenopus","volume":3049},{"researchdata_availability":"no","department":[{"_id":"LoSw"},{"_id":"GradSch"},{"_id":"IAS"}],"date_updated":"2026-09-17T07:31:16Z","language":[{"iso":"eng"}],"editor":[{"last_name":"Beck","first_name":"Caroline W.","full_name":"Beck, Caroline W."}],"ddc":["570"],"author":[{"first_name":"David","full_name":"Vijatovic, David","orcid":"0000-0002-5494-0941","id":"cf391e77-ec3c-11ea-a124-d69323410b58","last_name":"Vijatovic"},{"id":"40606b92-f128-11eb-9611-bf66a98cfa5c","full_name":"Papadopoulos, Stavros","first_name":"Stavros","last_name":"Papadopoulos"},{"last_name":"Dalla Vecchia","id":"02a7a869-ff06-11ed-a87f-86649d6077e5","first_name":"Marco","full_name":"Dalla Vecchia, Marco"},{"full_name":"Sweeney, Lora Beatrice Jaeger","first_name":"Lora Beatrice Jaeger","orcid":"0000-0001-9242-5601","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","last_name":"Sweeney"}],"oa":1,"citation":{"mla":"Vijatovic, David, et al. “Fluorescent in Situ MRNA Hybridization (FISH) Using Hybridization Chain Reaction (HCR) in Xenopus Cryosections.” Xenopus, edited by Caroline W. Beck, vol. 3049, Springer, 2026, pp. 245–59, doi:10.1007/978-1-0716-5360-9_11.","short":"D. Vijatovic, S. Papadopoulos, M. Dalla Vecchia, L.B. Sweeney, in:, C.W. Beck (Ed.), Xenopus, Springer, 2026, pp. 245–259.","chicago":"Vijatovic, David, Stavros Papadopoulos, Marco Dalla Vecchia, and Lora B. Sweeney. “Fluorescent in Situ MRNA Hybridization (FISH) Using Hybridization Chain Reaction (HCR) in Xenopus Cryosections.” In Xenopus, edited by Caroline W. Beck, 3049:245–59. MIMB. Springer, 2026. https://doi.org/10.1007/978-1-0716-5360-9_11.","ama":"Vijatovic D, Papadopoulos S, Dalla Vecchia M, Sweeney LB. Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in Xenopus cryosections. In: Beck CW, ed. Xenopus. Vol 3049. MIMB. Springer; 2026:245-259. doi:10.1007/978-1-0716-5360-9_11","apa":"Vijatovic, D., Papadopoulos, S., Dalla Vecchia, M., & Sweeney, L. B. (2026). Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in Xenopus cryosections. In C. W. Beck (Ed.), Xenopus (Vol. 3049, pp. 245–259). Springer. https://doi.org/10.1007/978-1-0716-5360-9_11","ista":"Vijatovic D, Papadopoulos S, Dalla Vecchia M, Sweeney LB. 2026.Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in Xenopus cryosections. In: Xenopus. Methods in Molecular Biology, vol. 3049, 245–259.","ieee":"D. Vijatovic, S. Papadopoulos, M. Dalla Vecchia, and L. B. Sweeney, “Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in Xenopus cryosections,” in Xenopus, vol. 3049, C. W. Beck, Ed. Springer, 2026, pp. 245–259."},"fulldoi":"https://doi.org/10.1007/978-1-0716-5360-9_11","external_id":{"pmid":["42681228"]},"page":"245-259","corr_author":"1","intvolume":" 3049","alternative_title":["Methods in Molecular Biology"],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"publisher":"Springer","date_created":"2026-09-13T22:01:55Z","date_published":"2026-09-02T00:00:00Z","acknowledgement":"This work was supported by a Horizon Europe ERC Starting Grant\r\nNumber 101041551 (L.B.S., D.V., S.P.), Special Research Program\r\n(SFB) of the Austrian Science Fund (FWF) F7814-B (L.B.S., S.P.),\r\nAustrian Science Fund (FWF) 10.55776/COE16 (L.B.S.), FTI\r\nStrategy Lower Austria Dissertation Grant Number FT121-D-046\r\n(D.V.), and Austrian Academy of Sciences DOC Fellowship 27229\r\n(S.P.). We also thank the Imaging & Optics and Scientific Computing Facilities at ISTA for their support in developing the quantification pipeline.","type":"book_chapter","status":"public","_id":"22925","file":[{"access_level":"open_access","file_size":1004024,"file_id":"22938","file_name":"2026_MIMB_Vijatovic.pdf","date_updated":"2026-09-17T07:28:53Z","checksum":"e7a075a9ee1b91d5824f8f2b9b1f3c9b","creator":"dernst","date_created":"2026-09-17T07:28:53Z","content_type":"application/pdf","relation":"main_file","success":1}],"year":"2026","scopus_import":"1","title":"Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in Xenopus cryosections","OA_place":"publisher","keyword":["mRNA FISH","Hybridization chain reaction","In situ hybridization","Fluorescence microscopy"],"OA_type":"hybrid","das_tickbox":"0","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Hybridization Chain Reaction (HCR) enables highly sensitive and multiplexed detection of mRNA with subcellular spatial resolution. It employs fluorophore-tagged DNA hairpins that self-assemble on target-bound probe pairs, amplifying the signal without enzymatic reactions. Here, we describe a protocol for performing HCR fluorescence in situ hybridization (FISH) on Xenopus tissue sections. We also outline a semi-automated image analysis pipeline that enables per-cell quantification of probe expression and co-localization. This method provides a robust and quantitative approach for visualizing gene expression patterns in situ."}],"volume":3049,"publication":"Xenopus","file_date_updated":"2026-09-17T07:28:53Z","doi":"10.1007/978-1-0716-5360-9_11","day":"02","article_processing_charge":"No","has_accepted_license":"1","publication_identifier":{"eissn":["1940-6029"]},"month":"09","quality_controlled":"1","supplementarymaterial":"no","publication_status":"published","project":[{"_id":"ebb66355-77a9-11ec-83b8-b8ac210a4dae","name":"Development and Evolution of Tetrapod Motor Circuits","grant_number":"101041551"},{"grant_number":"F7814","_id":"8da85f50-16d5-11f0-9cad-eab8b0ff6c9e","name":"Stem Cell Modulation in Neural Development and Regeneration/ P14-Swim-to-limb transition: cell type to connection diversity"},{"_id":"cf428362-b037-11f1-b015-8277a8a2f63d","name":"Neuronal circuits in health and disease (Sweeney)","grant_number":"COE16"},{"_id":"bd73af52-d553-11ed-ba76-912049f0ac7a","name":"Development of V1 interneuron diversity during swim-to-walk transition of Xenopus metamorphosis","grant_number":"FTI21-D-046"},{"grant_number":"27229","_id":"907b765e-16d5-11f0-9cad-fef108a945b1","name":"A Tale of Two Circuits: Rostrocaudal spinal cord patterning during the swim-to-limb transition of Xenopus metamorphosis"}],"pmid":1,"series_title":"MIMB","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"doi":"10.1016/j.tplants.2026.08.002","day":"04","publication":"Trends in Plant Science","abstract":[{"lang":"eng","text":"Auxin and calcium (Ca2+) are central plant signals that coordinate growth, development, and responses to environmental cues. Typically studied as largely parallel pathways, they are now increasingly recognized as interconnected networks whose activities converge at multiple regulatory levels. Recent advances in live imaging, biosensors, optogenetics, and structural approaches have revealed that auxin can rapidly trigger Ca2+ influx from the apoplast via TRANSPORT INHIBITOR RESPONSE1 (TIR1)/AUXIN-SIGNALING F-BOX (AFB)-dependent signaling mechanisms and Ca2+ channels, presumably involving cyclic nucleotides produced by TIR1/AFB auxin receptors. Conversely, Ca2+ signals arising from mechanosensing, wounding, and environmental stress can modulate auxin transport, signaling, and transcriptional outputs. Together, these discoveries highlight a dynamic, reciprocal signaling axis where Ca2+ acts both downstream and upstream of auxin to shape growth, development, tropisms, and regeneration."}],"das_tickbox":"0","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","supplementarymaterial":"no","pmid":1,"publication_status":"epub_ahead","month":"09","quality_controlled":"1","article_processing_charge":"No","has_accepted_license":"1","publication_identifier":{"issn":["1360-1385"],"eissn":["1878-4372"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.tplants.2026.08.002"}],"_id":"22927","year":"2026","type":"journal_article","status":"public","acknowledgement":"The authors would like to acknowledge many colleagues whose valuable contributions to the field could not be included in this review due to space limitations and reference constraints.","date_published":"2026-09-04T00:00:00Z","OA_type":"hybrid","keyword":["auxin","calcium","rapid signaling","crosstalk","growth regulation","cyclic nucleotides"],"title":"Decoding dialog: The auxin–calcium signaling crosstalk in plants","OA_place":"publisher","scopus_import":"1","article_type":"original","corr_author":"1","external_id":{"pmid":["42692943"]},"citation":{"mla":"Zupunski, Milan, et al. “Decoding Dialog: The Auxin–Calcium Signaling Crosstalk in Plants.” Trends in Plant Science, Cell Press, 2026, doi:10.1016/j.tplants.2026.08.002.","chicago":"Zupunski, Milan, Guido Grossmann, and Jiří Friml. “Decoding Dialog: The Auxin–Calcium Signaling Crosstalk in Plants.” Trends in Plant Science. Cell Press, 2026. https://doi.org/10.1016/j.tplants.2026.08.002.","short":"M. Zupunski, G. Grossmann, J. Friml, Trends in Plant Science (2026).","apa":"Zupunski, M., Grossmann, G., & Friml, J. (2026). Decoding dialog: The auxin–calcium signaling crosstalk in plants. Trends in Plant Science. Cell Press. https://doi.org/10.1016/j.tplants.2026.08.002","ama":"Zupunski M, Grossmann G, Friml J. Decoding dialog: The auxin–calcium signaling crosstalk in plants. Trends in Plant Science. 2026. doi:10.1016/j.tplants.2026.08.002","ieee":"M. Zupunski, G. Grossmann, and J. Friml, “Decoding dialog: The auxin–calcium signaling crosstalk in plants,” Trends in Plant Science. Cell Press, 2026.","ista":"Zupunski M, Grossmann G, Friml J. 2026. Decoding dialog: The auxin–calcium signaling crosstalk in plants. Trends in Plant Science."},"fulldoi":"https://doi.org/10.1016/j.tplants.2026.08.002","date_created":"2026-09-13T22:01:56Z","publisher":"Cell Press","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"},"department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"date_updated":"2026-09-17T07:42:27Z","researchdata_availability":"no","oa":1,"author":[{"full_name":"Zupunski, Milan","first_name":"Milan","id":"f6a21fce-573e-11f0-a150-a8d96aee2539","last_name":"Zupunski"},{"first_name":"Guido","full_name":"Grossmann, Guido","last_name":"Grossmann"},{"full_name":"Friml, Jiří","first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml"}],"ddc":["580"]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions"}],"publication_status":"published","supplementarymaterial":"no","quality_controlled":"1","month":"08","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959774451"]},"has_accepted_license":"1","article_processing_charge":"Yes","doi":"10.4230/LIPIcs.ESA.2026.61","day":"25","volume":388,"file_date_updated":"2026-09-17T09:28:04Z","publication":"34th Annual European Symposium on Algorithms","abstract":[{"lang":"eng","text":"We present the first truly subquadratic time algorithm to compute diameter and eccentricities in real-weighted directed graphs with constant distance VC-dimension and strongly sublinear-sized balanced separators. For real-weighted K_h-minor-free digraphs, this runs in O(n^{2-1/(2h-2)} polylog(n)) time.\r\nPrior to this work, truly subquadratic time computation of diameter was only known for real-weighted planar graphs, while extensions to broader classes like minor-free graphs were restricted to unweighted settings. In particular, existing algorithms that use VC-dimension [Ducoffe, Habib, Viennot; SICOMP 2022] [Le, Wulff-Nilsen; SODA 2024] [Chan, Chang, Gao, Le, Kisfaludi-Bak, Zheng; FOCS 2025] work with small integer weights, but do not naturally generalize to real weights. We overcome this barrier by introducing a randomized search-to-decision reduction, demonstrating that VC-dimension is a sufficiently powerful tool in the real-weighted regime."}],"oa_version":"Published Version","das_tickbox":"0","OA_type":"gold","keyword":["Diameter","eccentricities","minor-free graphs","real weights","VC-dimension"],"OA_place":"publisher","title":"Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time","scopus_import":"1","file":[{"access_level":"open_access","date_updated":"2026-09-17T09:28:04Z","checksum":"574f50435b092a72041c7365cac3d280","file_name":"2026_LIPIcsESA_Zheng.pdf","file_id":"22942","file_size":760002,"creator":"dernst","content_type":"application/pdf","date_created":"2026-09-17T09:28:04Z","relation":"main_file","success":1}],"year":"2026","_id":"22914","article_number":"61:1-61:12","status":"public","type":"conference","conference":{"location":"L’Aquila, Italy","name":"ESA: European Symposium on Algorithms","end_date":"2026-09-04","start_date":"2026-08-31"},"acknowledgement":"This project has received funding from the Austrian Science Fund (FWF)\r\ngrant DOI 10.55776/I5982. For open access purposes, the author has applied a CC BY public\r\ncopyright license to any author-accepted manuscript version arising from this submission. Thanks to Jie Gao for feedback on a preliminary version of the manuscript","date_published":"2026-08-25T00:00:00Z","date_created":"2026-09-13T22:01:52Z","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"},"alternative_title":["LIPIcs"],"intvolume":" 388","corr_author":"1","external_id":{"arxiv":["2607.01926"]},"fulldoi":"https://doi.org/10.4230/LIPIcs.ESA.2026.61","citation":{"ama":"Zheng DW. Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time. In: 34th Annual European Symposium on Algorithms. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.ESA.2026.61","apa":"Zheng, D. W. (2026). Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time. In 34th Annual European Symposium on Algorithms (Vol. 388). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2026.61","ista":"Zheng DW. 2026. Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time. 34th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 388, 61:1-61:12.","ieee":"D. W. Zheng, “Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time,” in 34th Annual European Symposium on Algorithms, L’Aquila, Italy, 2026, vol. 388.","mla":"Zheng, Da Wei. “Real-Weighted Diameter and Eccentricities of Minor-Free and Bounded VC-Dimension Graphs in Truly Subquadratic Time.” 34th Annual European Symposium on Algorithms, vol. 388, 61:1-61:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.ESA.2026.61.","short":"D.W. Zheng, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","chicago":"Zheng, Da Wei. “Real-Weighted Diameter and Eccentricities of Minor-Free and Bounded VC-Dimension Graphs in Truly Subquadratic Time.” In 34th Annual European Symposium on Algorithms, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.61."},"oa":1,"arxiv":1,"author":[{"full_name":"Zheng, Da Wei","first_name":"Da Wei","id":"af77956b-e859-11ef-8dc9-d301b898e32f","last_name":"Zheng"}],"ddc":["000"],"researchdata_availability":"no","date_updated":"2026-09-17T09:31:02Z","department":[{"_id":"MoHe"}],"language":[{"iso":"eng"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","dataavailabilitystatement":"This paper makes use of the following ALMA data:\r\nADS/JAO.ALMA#2024.1.00440.S,\r\nADS/JAO.ALMA#2024.1.01197.S\r\nALMA is a partnership of ESO (representing its member states), NSF (USA) and NINS (Japan), together with\r\nNRC (Canada), MOST and ASIAA (Taiwan), and KASI\r\n(Republic of Korea), in cooperation with the Republic\r\nof Chile. The Joint ALMA Observatory is operated by\r\nESO, AUI/NRAO and NAOJ.","publication_status":"published","supplementarymaterial":"yes","quality_controlled":"1","month":"07","publication_identifier":{"eissn":["2565-6120"]},"has_accepted_license":"1","article_processing_charge":"No","doi":"10.33232/001c.165333","day":"21","publication":"The Open Journal of Astrophysics","volume":9,"abstract":[{"text":"We present deep ALMA Band 7 observations of the [O iii] 88 µm line and underlying dust continuum\r\nemission in four UV-bright, gravitationally lensed (magnification µ = 1.4 − 3.8), JWST-selected\r\ngalaxies at z = 8.5 − 10.3, with observed magnitudes −22.5 ≲ MUV ≲ −20.5. [O iii] 88 µm is\r\nconfidently detected in UNCOVER-10646 at z = 8.5080 ± 0.0011 (15σ) and DHZ1 at z = 9.3113 ±\r\n0.0006 (6σ), with both being intrinsically luminous systems [L[O iii] = (1.1− 1.6) ×109 L⊙] that follow\r\nthe local [O iii]-SFR relation. [O iii] 88 µm remains undetected in the two z > 10 targets, including in\r\nthe z = 10.07 X-ray AGN UHZ1, where we obtain a deep limit of L[O iii] < 6 × 107 L⊙. Dust emission\r\nis not detected in any individual source nor in a stack (< 3σ). The high S/N [O iii] 88 µm detection\r\nin UNCOVER-10646 uniquely reveals an additional broad component (FWHM = 1366+473\r\n−329 km/s;\r\n∆BIC ≈ 20) indicative of an ionized outflow. We infer a high outflow rate of M˙\r\nout = 128+80\r\n−46 M⊙ yr−1\r\n,\r\ncorresponding to a mass loading factor η = M˙\r\nout/SFR = 2.9\r\n+1.8\r\n−1.0\r\nthat matches or exceeds theoretical\r\npredictions and JWST-based studies of ionized outflows at high redshift. While high-resolution ALMA\r\nfollow-up is required to confirm and spatially resolve the outflow, this first systematic study at z > 8\r\nhighlights the unique diagnostic power of [O iii] 88 µm in characterizing galaxies in the early Universe.","lang":"eng"}],"oa_version":"Published Version","OA_type":"diamond","OA_place":"publisher","title":"A first systematic study of [OIII] 88μm at z>8: two luminous oxygen lines and a powerful ionized outflow in the first 600 million years","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2512.14486"}],"year":"2026","_id":"22928","status":"public","type":"journal_article","acknowledgement":"We thank the referee for their valuable and constructive comments that improved this work. We also thank Javier Alvarez-M´arquez for useful discussions ´\r\nabout the MIRI observations of UHZ1 and UNCOVER37126. HSBA gratefully acknowledges support from\r\nAcademia Sinica through grant AS-PD-1141-M01-2. MA\r\nis supported by FONDECYT grant number 1252054,\r\nand gratefully acknowledges support from ANID Basal\r\nProject FB210003 and ANID MILENIO NCN2024 112.\r\nAKI acknowledges support from KAKENHI Grant No.\r\n23H00131. NW was supported by the GACR EXPRO\r\ngrant No. 21-13491X.\r\nThis paper makes use of the following ALMA data:\r\nADS/JAO.ALMA#2024.1.00440.S,\r\nADS/JAO.ALMA#2024.1.01197.S\r\nALMA is a partnership of ESO (representing its member states), NSF (USA) and NINS (Japan), together with\r\nNRC (Canada), MOST and ASIAA (Taiwan), and KASI\r\n(Republic of Korea), in cooperation with the Republic\r\nof Chile. The Joint ALMA Observatory is operated by\r\nESO, AUI/NRAO and NAOJ.","date_published":"2026-07-21T00:00:00Z","date_created":"2026-09-13T22:01:57Z","publisher":"Maynooth Academic Publishing","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"},"article_type":"original","intvolume":" 9","external_id":{"arxiv":["2512.14486"]},"fulldoi":"https://doi.org/10.33232/001c.165333","citation":{"chicago":"Algera, Hiddo S.B., John R. Weaver, Tom J.L.C. Bakx, Manuel Aravena, Rychard J. Bouwens, Karin Cescon, Chian Chou Chen, et al. “A First Systematic Study of [OIII] 88μm at Z>8: Two Luminous Oxygen Lines and a Powerful Ionized Outflow in the First 600 Million Years.” The Open Journal of Astrophysics. Maynooth Academic Publishing, 2026. https://doi.org/10.33232/001c.165333.","short":"H.S.B. Algera, J.R. Weaver, T.J.L.C. Bakx, M. Aravena, R.J. Bouwens, K. Cescon, C.C. Chen, E. Da Cunha, P. Dayal, A. Faisst, A. Ferrara, S. Fujimoto, T. Hashimoto, K. Heintz, R. Herrera-Camus, J. Hodge, H. Inami, A.K. Inoue, J.J. Matthee, R. Meyer, S. Mizukoshi, C. Mondal, T. Nanayakkara, P.A. Oesch, A. Pallottini, H. Röttgering, L.E. Rowland, S. Schouws, R. Smit, L. Sommovigo, D.P. Stark, Y. Sugahara, L. Vallini, B. Vijarnwannaluk, P. Van Der Werf, N. Werner, J. Witstok, M. Xiao, The Open Journal of Astrophysics 9 (2026).","mla":"Algera, Hiddo S. B., et al. “A First Systematic Study of [OIII] 88μm at Z>8: Two Luminous Oxygen Lines and a Powerful Ionized Outflow in the First 600 Million Years.” The Open Journal of Astrophysics, vol. 9, Maynooth Academic Publishing, 2026, doi:10.33232/001c.165333.","ista":"Algera HSB, Weaver JR, Bakx TJLC, Aravena M, Bouwens RJ, Cescon K, Chen CC, Da Cunha E, Dayal P, Faisst A, Ferrara A, Fujimoto S, Hashimoto T, Heintz K, Herrera-Camus R, Hodge J, Inami H, Inoue AK, Matthee JJ, Meyer R, Mizukoshi S, Mondal C, Nanayakkara T, Oesch PA, Pallottini A, Röttgering H, Rowland LE, Schouws S, Smit R, Sommovigo L, Stark DP, Sugahara Y, Vallini L, Vijarnwannaluk B, Van Der Werf P, Werner N, Witstok J, Xiao M. 2026. A first systematic study of [OIII] 88μm at z>8: two luminous oxygen lines and a powerful ionized outflow in the first 600 million years. The Open Journal of Astrophysics. 9.","ieee":"H. S. B. Algera et al., “A first systematic study of [OIII] 88μm at z>8: two luminous oxygen lines and a powerful ionized outflow in the first 600 million years,” The Open Journal of Astrophysics, vol. 9. Maynooth Academic Publishing, 2026.","ama":"Algera HSB, Weaver JR, Bakx TJLC, et al. A first systematic study of [OIII] 88μm at z>8: two luminous oxygen lines and a powerful ionized outflow in the first 600 million years. The Open Journal of Astrophysics. 2026;9. doi:10.33232/001c.165333","apa":"Algera, H. S. B., Weaver, J. R., Bakx, T. J. L. C., Aravena, M., Bouwens, R. J., Cescon, K., … Xiao, M. (2026). A first systematic study of [OIII] 88μm at z>8: two luminous oxygen lines and a powerful ionized outflow in the first 600 million years. The Open Journal of Astrophysics. Maynooth Academic Publishing. https://doi.org/10.33232/001c.165333"},"oa":1,"arxiv":1,"author":[{"full_name":"Algera, Hiddo S.B.","first_name":"Hiddo S.B.","last_name":"Algera"},{"last_name":"Weaver","full_name":"Weaver, John R.","first_name":"John R."},{"last_name":"Bakx","first_name":"Tom J.L.C.","full_name":"Bakx, Tom J.L.C."},{"first_name":"Manuel","full_name":"Aravena, Manuel","last_name":"Aravena"},{"first_name":"Rychard J.","full_name":"Bouwens, Rychard J.","last_name":"Bouwens"},{"last_name":"Cescon","full_name":"Cescon, Karin","first_name":"Karin"},{"first_name":"Chian Chou","full_name":"Chen, Chian Chou","last_name":"Chen"},{"last_name":"Da Cunha","first_name":"Elisabete","full_name":"Da Cunha, Elisabete"},{"first_name":"Pratika","full_name":"Dayal, Pratika","last_name":"Dayal"},{"last_name":"Faisst","first_name":"Andreas","full_name":"Faisst, Andreas"},{"last_name":"Ferrara","full_name":"Ferrara, Andrea","first_name":"Andrea"},{"last_name":"Fujimoto","full_name":"Fujimoto, Seiji","first_name":"Seiji"},{"last_name":"Hashimoto","full_name":"Hashimoto, Takuya","first_name":"Takuya"},{"full_name":"Heintz, Kasper","first_name":"Kasper","last_name":"Heintz"},{"last_name":"Herrera-Camus","full_name":"Herrera-Camus, Rodrigo","first_name":"Rodrigo"},{"full_name":"Hodge, Jacqueline","first_name":"Jacqueline","last_name":"Hodge"},{"last_name":"Inami","first_name":"Hanae","full_name":"Inami, Hanae"},{"last_name":"Inoue","full_name":"Inoue, Akio K.","first_name":"Akio K."},{"last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X"},{"last_name":"Meyer","first_name":"Romain","full_name":"Meyer, Romain"},{"full_name":"Mizukoshi, Shoichiro","first_name":"Shoichiro","last_name":"Mizukoshi"},{"first_name":"Chayan","full_name":"Mondal, Chayan","last_name":"Mondal"},{"first_name":"Themiya","full_name":"Nanayakkara, Themiya","last_name":"Nanayakkara"},{"last_name":"Oesch","full_name":"Oesch, Pascal A.","first_name":"Pascal A."},{"last_name":"Pallottini","first_name":"Andrea","full_name":"Pallottini, Andrea"},{"full_name":"Röttgering, Huub","first_name":"Huub","last_name":"Röttgering"},{"last_name":"Rowland","full_name":"Rowland, Lucie E.","first_name":"Lucie E."},{"first_name":"Sander","full_name":"Schouws, Sander","last_name":"Schouws"},{"last_name":"Smit","full_name":"Smit, Renske","first_name":"Renske"},{"full_name":"Sommovigo, Laura","first_name":"Laura","last_name":"Sommovigo"},{"last_name":"Stark","full_name":"Stark, Daniel P.","first_name":"Daniel P."},{"full_name":"Sugahara, Yuma","first_name":"Yuma","last_name":"Sugahara"},{"last_name":"Vallini","full_name":"Vallini, Livia","first_name":"Livia"},{"first_name":"Bovornpratch","full_name":"Vijarnwannaluk, Bovornpratch","last_name":"Vijarnwannaluk"},{"last_name":"Van Der Werf","first_name":"Paul","full_name":"Van Der Werf, Paul"},{"last_name":"Werner","full_name":"Werner, Norbert","first_name":"Norbert"},{"full_name":"Witstok, Joris","first_name":"Joris","last_name":"Witstok"},{"full_name":"Xiao, Mengyuan","first_name":"Mengyuan","last_name":"Xiao"}],"ddc":["520"],"department":[{"_id":"JoMa"}],"language":[{"iso":"eng"}],"date_updated":"2026-09-17T08:31:24Z","researchdata_availability":"no"},{"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959774475"]},"has_accepted_license":"1","article_processing_charge":"Yes","quality_controlled":"1","month":"08","project":[{"grant_number":"COE12","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","name":"Bilateral Artificial Intelligence (Chatterjee)"},{"call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"F8502","name":"Interface Theory for Security and Privacy","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"}],"publication_status":"published","supplementarymaterial":"yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","das_tickbox":"0","abstract":[{"text":"Two-player games on graphs are a classical framework for analyzing strategic decision making. In turn-based games, two players move a token along the edges of the graph, and the right to move the token is determined by the current vertex. In traditional bidding games - referred to as pure bidding games - the right to move the token is determined at each step through bidding; here we consider Richman bidding, where the winning player of a bid pays the losing player. The winner is decided based on a temporal or quantitative specification evaluated over the resulting infinite play.\r\nIn this work, we combine turn-based games and pure bidding games into generalized bidding games, with player-1 vertices, player-2 vertices, and bidding vertices. This natural and simple generalization of bidding games has far-reaching consequences. First, we show that, as a model, generalized bidding games are more expressive than pure bidding games, and we provide several applications. Second, and most importantly, we show that generalized Richman bidding games are structurally equivalent to simple stochastic games, a well-studied model: they are linearly interreducible to each other. As was previously known, the special case of pure Richman bidding games corresponds to random-turn games. In other words, generalized bidding games extend pure bidding games in the same way that simple stochastic games extend random-turn games. We use this connection to solve generalized Richman bidding games for temporal (parity) and quantitative (mean-payoff and discounted-sum) specifications. From a computational perspective, we establish that generalized bidding games with parity and mean-payoff specifications retain the best known upper bounds for turn-based games and pure bidding games, namely NP∩coNP.\r\nFinally, we study a repair problem that asks whether bidding vertices can be assigned \"owners\" so as to bring the threshold budget required to win the game below a given target. This problem has direct applications in compositional policy synthesis for multi-objective settings, and we show it to be NP-complete.","lang":"eng"}],"volume":391,"publication":"37th International Conference on Concurrency Theory","file_date_updated":"2026-09-17T09:43:28Z","doi":"10.4230/LIPIcs.CONCUR.2026.13","day":"24","scopus_import":"1","OA_place":"publisher","title":"Generalized bidding games: Where bidding and stochastic games meet","keyword":["Bidding Games","Stochastic Games"],"OA_type":"gold","conference":{"start_date":"2026-09-01","name":"CONCUR: Conference on Concurrency Theory","location":"Liverpool, United Kingdom","end_date":"2026-09-04"},"acknowledgement":"The research was partially supported by Austrian Science Fund (FWF) 10.55776/COE12,\r\nERC CoG 863818 (ForM-SMArt), FWF-2022-SFB F8502 (SPyCoDe), ERC-2020-AdG 101020093\r\n(VAMOS), and the RYC2024-049116-I grant funded by MICIU/AEI/10.13039/501100011033 and\r\nESF+.\r\n","date_published":"2026-08-24T00:00:00Z","status":"public","type":"conference","file":[{"date_created":"2026-09-17T09:43:28Z","content_type":"application/pdf","relation":"main_file","success":1,"access_level":"open_access","file_size":1175682,"date_updated":"2026-09-17T09:43:28Z","file_name":"2026_LIPIcsCONCUR_Asadi.pdf","file_id":"22946","checksum":"de9af748d78fa42c173f68a71cbbd8d9","creator":"dernst"}],"year":"2026","article_number":"13:1-13:20","_id":"22920","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"},"alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2026-09-13T22:01:53Z","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2026.13","citation":{"ista":"Asadi A, Henzinger TA, Goharshady E, Kebis P, Mallik K. 2026. Generalized bidding games: Where bidding and stochastic games meet. 37th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 391, 13:1-13:20.","ieee":"A. Asadi, T. A. Henzinger, E. Goharshady, P. Kebis, and K. Mallik, “Generalized bidding games: Where bidding and stochastic games meet,” in 37th International Conference on Concurrency Theory, Liverpool, United Kingdom, 2026, vol. 391.","apa":"Asadi, A., Henzinger, T. A., Goharshady, E., Kebis, P., & Mallik, K. (2026). Generalized bidding games: Where bidding and stochastic games meet. In 37th International Conference on Concurrency Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13","ama":"Asadi A, Henzinger TA, Goharshady E, Kebis P, Mallik K. Generalized bidding games: Where bidding and stochastic games meet. In: 37th International Conference on Concurrency Theory. Vol 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.CONCUR.2026.13","short":"A. Asadi, T.A. Henzinger, E. Goharshady, P. Kebis, K. Mallik, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","chicago":"Asadi, Ali, Thomas A Henzinger, Ehsan Goharshady, Pavol Kebis, and Kaushik Mallik. “Generalized Bidding Games: Where Bidding and Stochastic Games Meet.” In 37th International Conference on Concurrency Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13.","mla":"Asadi, Ali, et al. “Generalized Bidding Games: Where Bidding and Stochastic Games Meet.” 37th International Conference on Concurrency Theory, vol. 391, 13:1-13:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.CONCUR.2026.13."},"external_id":{"arxiv":["2606.29420"]},"corr_author":"1","intvolume":" 391","ddc":["000"],"author":[{"full_name":"Asadi, Ali","first_name":"Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Kafshdar Goharshadi","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","orcid":"0000-0002-8595-0587","first_name":"Ehsan","full_name":"Kafshdar Goharshadi, Ehsan"},{"id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","first_name":"Pavol","full_name":"Kebis, Pavol","last_name":"Kebis"},{"last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik","first_name":"Kaushik"}],"arxiv":1,"oa":1,"ec_funded":1,"language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"},{"_id":"ToHe"}],"researchdata_availability":"no","date_updated":"2026-09-17T09:44:41Z"},{"scopus_import":"1","OA_place":"publisher","title":"PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance","keyword":["formal methods","games and logic","logical aspects of AI","model checking"],"OA_type":"gold","conference":{"start_date":"2026-09-01","name":"CONCUR: Conference on Concurrency Theory","location":"Liverpool, United Kingdom","end_date":"2026-09-04"},"date_published":"2026-08-24T00:00:00Z","acknowledgement":"The research was partially supported by Austrian Science Fund (FWF) 10.55776/COE12,\r\nERC CoG 863818 (ForM-SMArt), FWF-2022-SFB F8502 (SPyCoDe), and ERC-2020-AdG 101020093\r\n(VAMOS) grants.","status":"public","type":"conference","year":"2026","file":[{"relation":"main_file","success":1,"date_created":"2026-09-17T09:50:00Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_size":959234,"checksum":"2e6c55b65d9d7ce436a6f59e81d7ba17","file_name":"2026_LIPIcsCONCUR_Asadi2.pdf","date_updated":"2026-09-17T09:50:00Z","file_id":"22947"}],"article_number":"12:1-12:23","_id":"22919","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959774475"]},"has_accepted_license":"1","article_processing_charge":"Yes","quality_controlled":"1","month":"08","project":[{"name":"Bilateral Artificial Intelligence (Chatterjee)","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","grant_number":"COE12"},{"call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"F8502","name":"Interface Theory for Security and Privacy","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"}],"publication_status":"published","supplementarymaterial":"yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","das_tickbox":"0","abstract":[{"text":"Reachability is the most fundamental logical objective, yet it is notoriously difficult to learn in reinforcement learning settings: even for Markov decision processes, PAC learning of reachability is impossible without additional assumptions. This difficulty also holds in turn-based stochastic games (TBSGs), where two adversarial players interact on a finite state space. In this work, we consider turn-based stochastic games with reachability objectives. For such settings, adversarial learning, in which players are adversarial even in the learning phase, is impossible. Therefore, the goal is to consider learning, in which both players learn the unknown model together. In this spirit, previous literature on PAC learning in TBSGs considers (a) public information shared by both players; and (b) centralized learning, which means that players share the same learning algorithm. In this work, our contribution is two-fold. First, we relax these strong assumptions and ensure learning: (i) with private information not shared with the other player; and (ii) decentralized learning where the players do not share the same learning algorithm. To the best of our knowledge, this work is the first positive result for decentralized and private information learning of TBSGs with reachability objectives. Second, we introduce a game-theoretic generalization of the Expected Conditional Distance (ECD) parameter, which measures the expected length of reaching the target set. We establish a polynomial-sample complexity bound with respect to the number of states, actions, ECD parameter, and inverses of error tolerance and failure probability.","lang":"eng"}],"file_date_updated":"2026-09-17T09:50:00Z","volume":391,"publication":"37th International Conference on Concurrency Theory","doi":"10.4230/LIPIcs.CONCUR.2026.12","day":"24","ddc":["000"],"author":[{"id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","first_name":"Ali","full_name":"Asadi, Ali","last_name":"Asadi"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Kebis","first_name":"Pavol","full_name":"Kebis, Pavol","id":"2e0132b3-4e98-11ef-b275-cf7281c2802a"}],"arxiv":1,"oa":1,"ec_funded":1,"researchdata_availability":"no","date_updated":"2026-09-17T09:51:25Z","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"},{"_id":"ToHe"}],"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"},"alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2026-09-13T22:01:53Z","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2026.12","citation":{"ieee":"A. Asadi, K. Chatterjee, and P. Kebis, “PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance,” in 37th International Conference on Concurrency Theory, Liverpool, United Kingdom, 2026, vol. 391.","ista":"Asadi A, Chatterjee K, Kebis P. 2026. PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance. 37th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 391, 12:1-12:23.","ama":"Asadi A, Chatterjee K, Kebis P. PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance. In: 37th International Conference on Concurrency Theory. Vol 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.CONCUR.2026.12","apa":"Asadi, A., Chatterjee, K., & Kebis, P. (2026). PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance. In 37th International Conference on Concurrency Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2026.12","chicago":"Asadi, Ali, Krishnendu Chatterjee, and Pavol Kebis. “PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance.” In 37th International Conference on Concurrency Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.12.","short":"A. Asadi, K. Chatterjee, P. Kebis, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","mla":"Asadi, Ali, et al. “PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance.” 37th International Conference on Concurrency Theory, vol. 391, 12:1-12:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.CONCUR.2026.12."},"corr_author":"1","external_id":{"arxiv":["2607.14877"]},"intvolume":" 391"},{"month":"08","quality_controlled":"1","article_processing_charge":"Yes","has_accepted_license":"1","publication_identifier":{"isbn":["9783959774451"],"issn":["1868-8969"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","supplementarymaterial":"yes","project":[{"grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions"}],"publication_status":"published","abstract":[{"text":"Given a weighted digraph G, a (t,g,μ)-DAG cover is a collection of g dominating DAGs D_1,… ,D_g such that all distances are approximately preserved: for every pair (u,v) of vertices, min_id_{D_i}(u,v) ≤ t⋅ d_G(u,v), and the total number of non-G edges is bounded by |(∪_i D_i)⧵ G| ≤ μ. Assadi, Hoppenworth, and Wein [STOC 25] and Filtser [SODA 26] studied DAG covers for general digraphs. This paper initiates the study of Steiner DAG cover, where the DAGs are allowed to contain Steiner points. \r\nWe obtain Steiner DAG covers on the important classes of planar digraphs and low-treewidth digraphs. Specifically, we show that any digraph with treewidth tw admits a (1,2,Õ(n⋅tw))-Steiner DAG cover. For planar digraphs we provide a (1+ε,2,Õ_ε(n))-Steiner DAG cover.\r\nWe also demonstrate a stark difference between Steiner and non-Steiner DAG covers. As a lower bound, we show that any non-Steiner DAG cover for graphs with treewidth 1 with stretch t < 2 and sub-quadratic number of extra edges requires Ω(log n) DAGs.","lang":"eng"}],"das_tickbox":"0","oa_version":"Published Version","day":"25","doi":"10.4230/LIPIcs.ESA.2026.94","publication":"34th Annual European Symposium on Algorithms","volume":388,"file_date_updated":"2026-09-17T10:09:22Z","title":"DAG covers for structured graphs: The Steiner point effect","OA_place":"publisher","scopus_import":"1","OA_type":"gold","keyword":["Directed graphs","DAG (directed acyclic graphs)","distortion","metric embeddings","planar graph","treewidth"],"type":"conference","status":"public","acknowledgement":"This work was initiated at Dagstuhl Seminar 25212: Metric Sketching and\r\nDynamic Algorithms for Geometric and Topological Graphs. We thank the organizers and other\r\nparticipants for a productive environment.\r\nujoy Bhore: Work supported in part by ANRF ARG-MATRICS, Grant 002465.\r\nHsien-Chih Chang: Supported by the U.S. National Science Foundation Grant No. CCF-2443017.\r\nJonathan Conroy: Supported by the U.S. National Science Foundation Grant No. CCF-2443017.\r\nArnold Filtser: This research was supported by the ISRAEL SCIENCE FOUNDATION (grant No.\r\n1042/22).\r\nEunjin Oh: Supported by Institute of Information & Communications Technology Planning &\r\nEvaluation (IITP) grant funded by the Korea government (MSIT) (No. RS-2024-00440239, Sublinear\r\nScalable Algorithms for Large-Scale Data Analysis) and the National Research Foundation of Korea\r\n(NRF) grant funded by the Korea government (MSIT) (No. RS-2024-00358505).\r\nNicole Wein: Supported by NSF CAREER award 2541910.\r\nDa Wei Zheng: This project has received funding from the Austrian Science Fund (FWF) grant\r\nDOI 10.55776/I5982. For open access purposes, the author has applied a CC BY public copyright\r\nlicense to any author-accepted manuscript version arising from this submission.","date_published":"2026-08-25T00:00:00Z","conference":{"end_date":"2026-09-04","location":"L’Aquila, Italy","name":"ESA: European Symposium on Algorithms","start_date":"2026-08-31"},"article_number":"94:1-94:18","_id":"22918","file":[{"date_updated":"2026-09-17T10:09:22Z","file_id":"22948","file_name":"2026_LIPIcsESA_Bhore.pdf","checksum":"2082683b3b72865c6a795305e5d61276","file_size":1123327,"access_level":"open_access","creator":"dernst","content_type":"application/pdf","date_created":"2026-09-17T10:09:22Z","success":1,"relation":"main_file"}],"year":"2026","alternative_title":["LIPIcs"],"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"},"date_created":"2026-09-13T22:01:53Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","external_id":{"arxiv":["2604.04186"]},"corr_author":"1","citation":{"apa":"Bhore, S., Chang, H. C., Conroy, J., Filtser, A., Oh, E., Wein, N., & Zheng, D. W. (2026). DAG covers for structured graphs: The Steiner point effect. In 34th Annual European Symposium on Algorithms (Vol. 388). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2026.94","ama":"Bhore S, Chang HC, Conroy J, et al. DAG covers for structured graphs: The Steiner point effect. In: 34th Annual European Symposium on Algorithms. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.ESA.2026.94","ista":"Bhore S, Chang HC, Conroy J, Filtser A, Oh E, Wein N, Zheng DW. 2026. DAG covers for structured graphs: The Steiner point effect. 34th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 388, 94:1-94:18.","ieee":"S. Bhore et al., “DAG covers for structured graphs: The Steiner point effect,” in 34th Annual European Symposium on Algorithms, L’Aquila, Italy, 2026, vol. 388.","mla":"Bhore, Sujoy, et al. “DAG Covers for Structured Graphs: The Steiner Point Effect.” 34th Annual European Symposium on Algorithms, vol. 388, 94:1-94:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.ESA.2026.94.","short":"S. Bhore, H.C. Chang, J. Conroy, A. Filtser, E. Oh, N. Wein, D.W. Zheng, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","chicago":"Bhore, Sujoy, Hsien Chih Chang, Jonathan Conroy, Arnold Filtser, Eunjin Oh, Nicole Wein, and Da Wei Zheng. “DAG Covers for Structured Graphs: The Steiner Point Effect.” In 34th Annual European Symposium on Algorithms, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.94."},"fulldoi":"https://doi.org/10.4230/LIPIcs.ESA.2026.94","intvolume":" 388","author":[{"last_name":"Bhore","full_name":"Bhore, Sujoy","first_name":"Sujoy"},{"last_name":"Chang","first_name":"Hsien Chih","full_name":"Chang, Hsien Chih"},{"last_name":"Conroy","full_name":"Conroy, Jonathan","first_name":"Jonathan"},{"first_name":"Arnold","full_name":"Filtser, Arnold","last_name":"Filtser"},{"full_name":"Oh, Eunjin","first_name":"Eunjin","last_name":"Oh"},{"first_name":"Nicole","full_name":"Wein, Nicole","last_name":"Wein"},{"last_name":"Zheng","full_name":"Zheng, Da Wei","first_name":"Da Wei","id":"af77956b-e859-11ef-8dc9-d301b898e32f"}],"ddc":["000"],"oa":1,"arxiv":1,"researchdata_availability":"no","language":[{"iso":"eng"}],"department":[{"_id":"MoHe"}],"date_updated":"2026-09-17T10:27:46Z"},{"date_created":"2026-09-13T22:01:53Z","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"},"alternative_title":["LIPIcs"],"intvolume":" 388","corr_author":"1","external_id":{"arxiv":["2604.24134"]},"fulldoi":"https://doi.org/10.4230/LIPIcs.ESA.2026.45","citation":{"ista":"Van Der Hoog I, Iacono J, Rotenberg E, Rutschmann DP. 2026. Near-optimal working-set heaps and dijkstra on pointer machines. 34th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 388, 45:1-45:13.","ieee":"I. Van Der Hoog, J. Iacono, E. Rotenberg, and D. P. Rutschmann, “Near-optimal working-set heaps and dijkstra on pointer machines,” in 34th Annual European Symposium on Algorithms, L’Aquila, Italy, 2026, vol. 388.","apa":"Van Der Hoog, I., Iacono, J., Rotenberg, E., & Rutschmann, D. P. (2026). Near-optimal working-set heaps and dijkstra on pointer machines. In 34th Annual European Symposium on Algorithms (Vol. 388). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2026.45","ama":"Van Der Hoog I, Iacono J, Rotenberg E, Rutschmann DP. Near-optimal working-set heaps and dijkstra on pointer machines. In: 34th Annual European Symposium on Algorithms. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.ESA.2026.45","chicago":"Van Der Hoog, Ivor, John Iacono, Eva Rotenberg, and Daniel P Rutschmann. “Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines.” In 34th Annual European Symposium on Algorithms, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.45.","short":"I. Van Der Hoog, J. Iacono, E. Rotenberg, D.P. Rutschmann, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","mla":"Van Der Hoog, Ivor, et al. “Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines.” 34th Annual European Symposium on Algorithms, vol. 388, 45:1-45:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.ESA.2026.45."},"ec_funded":1,"arxiv":1,"oa":1,"author":[{"last_name":"Van Der Hoog","first_name":"Ivor","full_name":"Van Der Hoog, Ivor"},{"last_name":"Iacono","full_name":"Iacono, John","first_name":"John"},{"full_name":"Rotenberg, Eva","first_name":"Eva","last_name":"Rotenberg"},{"full_name":"Rutschmann, Daniel P","first_name":"Daniel P","id":"7397d908-b582-11f0-bf73-88b902e86527","last_name":"Rutschmann"}],"ddc":["000"],"language":[{"iso":"eng"}],"date_updated":"2026-09-17T10:35:56Z","researchdata_availability":"no","department":[{"_id":"MoHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","project":[{"grant_number":"101019564","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"}],"supplementarymaterial":"no","quality_controlled":"1","month":"08","publication_identifier":{"isbn":["9783959774451"],"eissn":["1868-8969"]},"article_processing_charge":"Yes","has_accepted_license":"1","doi":"10.4230/LIPIcs.ESA.2026.45","day":"25","file_date_updated":"2026-09-17T10:33:12Z","publication":"34th Annual European Symposium on Algorithms","volume":388,"abstract":[{"text":"A heap is a dynamic data structure that stores a set of labeled values under the following operations: pop returns the minimum value of the heap, Push(x_i) pushes a new value x_i onto the heap, and DecreaseKey(i, v) decreases the value x_i to v. A working-set heap is a heap that supports the x_i ← pop() operation in O(log Γ(x_i)) time where Γ(x_i) is the size of the working set: the number of elements that were pushed onto the heap while x_i was in the heap. The goal of working set heap design is to maintain the working set property while minimizing the overhead of the Push and DecreaseKey operations. On a word RAM, there exist working set heaps that support Push and DecreaseKey in amortized constant time. In this paper, we show via a simple construction that pointer machines, one of the most general and least-assuming computational models, support working set heaps that support Push in amortized constant time and DecreaseKey in inverse-Ackermann time. A by-product of this analysis is that Dijkstra’s shortest path algorithm can be near-universally optimal on a pointer machine - incurring only an additive O(m α(m)) overhead compared to the optimal running time for distance ordering, where m denotes the number of edges in the graph.","lang":"eng"}],"oa_version":"Published Version","das_tickbox":"0","OA_type":"gold","keyword":["Data structures","graph algorithms","amortized analysis"],"OA_place":"publisher","title":"Near-optimal working-set heaps and dijkstra on pointer machines","scopus_import":"1","year":"2026","file":[{"creator":"dernst","file_id":"22949","date_updated":"2026-09-17T10:33:12Z","checksum":"52e7cb8881060e8f17b89cd46504f445","file_name":"2026_LIPIcsESA_vanderHoog2.pdf","file_size":792024,"access_level":"open_access","success":1,"relation":"main_file","content_type":"application/pdf","date_created":"2026-09-17T10:33:12Z"}],"_id":"22917","article_number":"45:1-45:13","status":"public","type":"conference","conference":{"name":"ESA: European Symposium on Algorithms","location":"L’Aquila, Italy","end_date":"2026-09-04","start_date":"2026-08-31"},"date_published":"2026-08-25T00:00:00Z","acknowledgement":"Ivor van der Hoog, Eva Rotenberg, and Daniel Rutschmann thank the VILLUM Foundation\r\ngrant (VIL37507) “Efficient Recomputations for Changeful Problems” for supporting this work.\r\nDaniel Rutschmann is supported by the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (No. 101019564) . John Iacono\r\nis supported by the Fonds de la Recherche Scientifique – FNRS.This work started at Dagstuhl 25191: Adaptive and Scalable Data Structures.\r\n\r\n"},{"external_id":{"pmid":["42469244"]},"corr_author":"1","citation":{"mla":"Kerschbaumer, Aron, et al. “Quasi-Solitons in Rydberg Atom Chains.” Nature Communications, vol. 17, 8783, Springer Nature, 2026, doi:10.1038/s41467-026-75598-1.","short":"A. Kerschbaumer, J.-Y.M. Desaules, M. Ljubotina, M. Serbyn, Nature Communications 17 (2026).","chicago":"Kerschbaumer, Aron, Jean-Yves Marc Desaules, Marko Ljubotina, and Maksym Serbyn. “Quasi-Solitons in Rydberg Atom Chains.” Nature Communications. Springer Nature, 2026. https://doi.org/10.1038/s41467-026-75598-1.","apa":"Kerschbaumer, A., Desaules, J.-Y. M., Ljubotina, M., & Serbyn, M. (2026). Quasi-solitons in Rydberg atom chains. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-026-75598-1","ama":"Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. Quasi-solitons in Rydberg atom chains. Nature Communications. 2026;17. doi:10.1038/s41467-026-75598-1","ieee":"A. Kerschbaumer, J.-Y. M. Desaules, M. Ljubotina, and M. Serbyn, “Quasi-solitons in Rydberg atom chains,” Nature Communications, vol. 17. Springer Nature, 2026.","ista":"Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. 2026. Quasi-solitons in Rydberg atom chains. Nature Communications. 17, 8783."},"fulldoi":"https://doi.org/10.1038/s41467-026-75598-1","article_type":"original","intvolume":" 17","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"},"DOAJ_listed":"1","date_created":"2026-07-27T07:26:27Z","publisher":"Springer Nature","department":[{"_id":"MaSe"},{"_id":"GradSch"}],"language":[{"iso":"eng"}],"date_updated":"2026-09-17T10:54:09Z","researchdata_availability":"yes","author":[{"last_name":"Kerschbaumer","id":"ade85a9c-3200-11ee-973b-91c1eb240410","full_name":"Kerschbaumer, Aron","first_name":"Aron","orcid":"0009-0002-2370-8661"},{"last_name":"Desaules","id":"6c292945-a610-11ed-9eec-c3be1ad62a80","orcid":"0000-0002-3749-6375","first_name":"Jean-Yves Marc","full_name":"Desaules, Jean-Yves Marc"},{"last_name":"Ljubotina","first_name":"Marko","full_name":"Ljubotina, Marko","orcid":"0000-0003-0038-7068","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E"},{"last_name":"Serbyn","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"}],"ddc":["530"],"ec_funded":1,"oa":1,"abstract":[{"lang":"eng","text":"Solitons—localized wave packets that travel without spreading—play a central role in understanding transport and properties of nonlinear systems. In quantum many-body systems, however, such robust excitations are typically destroyed by thermalization. Here, we theoretically demonstrate the existence of solitonic excitations in high-energy states of Rydberg atom chains in the regime of strong nearest-neighbor Rydberg blockade. These localized wave packets propagate directionally atop a special class of reviving initial states related to quantum many-body scars and are capable of carrying energy. Exhibiting long coherence times, these states constitute a form of non-ergodic quantum dynamics and can be efficiently implemented on Rydberg atom simulators. In this work, in addition to a phenomenological description of solitons, we identify their counterpart in a classical nonlinear dynamical system, demonstrate their potential use in quantum information transfer, and conjecture their relevance for anomalous energy transport reported in numerical studies of Rydberg atom arrays."}],"das_tickbox":"1","PlanS_conform":"1","oa_version":"Published Version","doi":"10.1038/s41467-026-75598-1","day":"21","file_date_updated":"2026-09-09T07:04:48Z","volume":17,"publication":"Nature Communications","month":"08","quality_controlled":"1","article_processing_charge":"Yes","has_accepted_license":"1","publication_identifier":{"eissn":["2041-1723"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","dataavailabilitystatement":"The raw data used to generate the figures are available at ref54.The TEBD algorithm used in this work was implemented using the ITensor library48,49 and the integration of the classical differential equations was performed via SciPy’s Runge-Kutta RK45 integrator52,53. The code used in this study to produce the plots from the shared data is available at ref.54.","supplementarymaterial":"yes","publication_status":"published","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413"},{"grant_number":"COE01","name":"Quantum Science Austria (Serbyn)","_id":"92c64506-16d5-11f0-9cad-87ce313ee832"}],"pmid":1,"related_material":{"record":[{"id":"21960","status":"public","relation":"research_data"}]},"type":"journal_article","status":"public","acknowledgement":"We acknowledge useful discussions with J.-S. Caux, E. Demler, J. Dubail, F. Essler, J. Feldmeier, S. Garratt, W. W. Ho, M. Lukin, Z. Papic, S. Rotter, F. Surace, and R. Vasseur. J.-Y.D. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M. L. acknowledges support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868. We acknowledge support by the Erwin Schrödinger International Institute for Mathematics and Physics (ESI). This research was funded in part by the Austrian Science Fund (FWF) https://doi.org/10.55776/COE1 and the European Union—NextGenerationEU. This research was supported in part by grant NSF PHY2309135 to the Kavli Institute for Theoretical Physics (KITP).","date_published":"2026-08-21T00:00:00Z","_id":"22408","article_number":"8783","year":"2026","file":[{"relation":"main_file","success":1,"date_created":"2026-09-09T07:04:48Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_size":1337815,"file_id":"22863","checksum":"2e12ade81e19b7eea099a2196217edff","file_name":"2026_NatureComm_Kerschbaumer.pdf","date_updated":"2026-09-09T07:04:48Z"}],"title":"Quasi-solitons in Rydberg atom chains","OA_place":"publisher","scopus_import":"1","OA_type":"gold"},{"project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","has_accepted_license":"1","article_processing_charge":"No","month":"06","file_date_updated":"2026-06-15T22:02:07Z","doi":"10.15479/AT-ISTA-21960","day":"16","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Solitons - localized wave packets that travel without spreading - play a central role in understanding transport and properties of nonlinear systems. In quantum many-body systems, however, such robust excitations are typically destroyed by thermalization. Here, we theoretically demonstrate the existence of solitonic excitations in high-energy states of Rydberg atom chains in the regime of strong nearest-neighbor Rydberg blockade. \r\nThese localized wave packets propagate directionally atop a special class of reviving initial states related to quantum many-body scars and are capable of carrying energy. Exhibiting long coherence times, these states constitute a form of non-ergodic quantum dynamics and can be efficiently implemented on Rydberg atom simulators. In this work, in addition to a phenomenological description of solitons, we identify their counterpart in a classical nonlinear dynamical system, demonstrate their potential use in quantum information transfer, and conjecture their relevance for anomalous energy transport reported in numerical studies of Rydberg atom arrays."}],"OA_place":"repository","title":"Research Data: \"Quasi-solitons in Rydberg atom chains\"","file":[{"date_created":"2026-06-15T22:01:57Z","content_type":"text/plain","relation":"main_file","success":1,"access_level":"open_access","file_size":1940,"checksum":"133269a105e996c6c44fdd56128259c7","date_updated":"2026-06-15T22:01:57Z","file_id":"22010","file_name":"README.txt","creator":"akerschb"},{"file_name":"Soliton_Data.zip","file_id":"22011","checksum":"759f9649c3919f4c4ad37a1d104ea32a","date_updated":"2026-06-15T22:02:07Z","file_size":13259747,"access_level":"open_access","creator":"akerschb","content_type":"application/zip","date_created":"2026-06-15T22:02:07Z","success":1,"relation":"main_file"}],"year":"2026","contributor":[{"contributor_type":"contact_person","id":"ade85a9c-3200-11ee-973b-91c1eb240410","first_name":"Aron","orcid":"0009-0002-2370-8661","last_name":"Kerschbaumer"},{"first_name":"Maksym","orcid":"0000-0002-2399-5827","contributor_type":"supervisor","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn"},{"last_name":"Desaules","contributor_type":"researcher","id":"6c292945-a610-11ed-9eec-c3be1ad62a80","first_name":"Jean-Yves Marc","orcid":"0000-0002-3749-6375"},{"last_name":"Ljubotina","contributor_type":"researcher","first_name":"Marko"}],"_id":"21960","date_published":"2026-06-16T00:00:00Z","status":"public","type":"research_data","related_material":{"record":[{"relation":"used_in_publication","id":"22408","status":"public"}]},"publisher":"Institute of Science and Technology Austria","date_created":"2026-06-09T07:17:50Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"fulldoi":"https://doi.org/10.15479/AT-ISTA-21960","citation":{"ista":"Kerschbaumer A. 2026. Research Data: ‘Quasi-solitons in Rydberg atom chains’, Institute of Science and Technology Austria, 10.15479/AT-ISTA-21960.","ieee":"A. Kerschbaumer, “Research Data: ‘Quasi-solitons in Rydberg atom chains.’” Institute of Science and Technology Austria, 2026.","apa":"Kerschbaumer, A. (2026). Research Data: “Quasi-solitons in Rydberg atom chains.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21960","ama":"Kerschbaumer A. Research Data: “Quasi-solitons in Rydberg atom chains.” 2026. doi:10.15479/AT-ISTA-21960","short":"A. Kerschbaumer, (2026).","chicago":"Kerschbaumer, Aron. “Research Data: ‘Quasi-Solitons in Rydberg Atom Chains.’” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21960.","mla":"Kerschbaumer, Aron. Research Data: “Quasi-Solitons in Rydberg Atom Chains.” Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21960."},"corr_author":"1","oa":1,"ec_funded":1,"author":[{"last_name":"Kerschbaumer","id":"ade85a9c-3200-11ee-973b-91c1eb240410","first_name":"Aron","full_name":"Kerschbaumer, Aron","orcid":"0009-0002-2370-8661"}],"department":[{"_id":"GradSch"},{"_id":"MaSe"}],"date_updated":"2026-09-17T10:54:08Z","license":"https://creativecommons.org/licenses/by-nc/4.0/"},{"citation":{"ista":"Bravo JPK. 2026. ‘Guide and Prejudice’ - How Argonautes recognize targets across domains of life. FEBS Letters., 1873–3468.70450.","ieee":"J. P. K. Bravo, “‘Guide and Prejudice’ - How Argonautes recognize targets across domains of life,” FEBS Letters. Wiley, 2026.","apa":"Bravo, J. P. K. (2026). ‘Guide and Prejudice’ - How Argonautes recognize targets across domains of life. FEBS Letters. Wiley. https://doi.org/10.1002/1873-3468.70450","ama":"Bravo JPK. ‘Guide and Prejudice’ - How Argonautes recognize targets across domains of life. FEBS Letters. 2026. doi:10.1002/1873-3468.70450","chicago":"Bravo, Jack Peter Kelly. “‘Guide and Prejudice’ - How Argonautes Recognize Targets across Domains of Life.” FEBS Letters. Wiley, 2026. https://doi.org/10.1002/1873-3468.70450.","short":"J.P.K. Bravo, FEBS Letters (2026).","mla":"Bravo, Jack Peter Kelly. “‘Guide and Prejudice’ - How Argonautes Recognize Targets across Domains of Life.” FEBS Letters, 1873–3468.70450, Wiley, 2026, doi:10.1002/1873-3468.70450."},"fulldoi":"https://doi.org/10.1002/1873-3468.70450","corr_author":"1","external_id":{"pmid":["42711859"]},"article_type":"original","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"},"publisher":"Wiley","date_created":"2026-09-17T09:31:02Z","language":[{"iso":"eng"}],"researchdata_availability":"no","department":[{"_id":"JaBr"}],"date_updated":"2026-09-17T11:48:51Z","ddc":["570"],"author":[{"last_name":"Bravo","first_name":"Jack Peter Kelly","full_name":"Bravo, Jack Peter Kelly","orcid":"0000-0003-0456-0753","id":"96aecfa5-8931-11ee-af30-aa6a5d6eee0e"}],"oa":1,"das_tickbox":"0","PlanS_conform":"1","oa_version":"Published Version","abstract":[{"text":"Argonaute proteins mediate RNA interference in eukaryotes and nucleic‐acid defence in prokaryotes. Although these systems operate in distinct biological contexts and produce diverse downstream outcomes, they share a conserved structural architecture and mechanism of guide‐dependent target recognition. Here, we argue that Argonautes function as programmable surveillance platforms that kinetically sample nucleic acids, engage targets through sequential pairing and conformational checkpoints, and couple recognition to functional outputs through regulated structural transitions. Rather than representing distinct recognition mechanisms, the diverse targeting behaviours observed across Argonaute families reflect different implementations of this shared framework, in which guide biogenesis, target accessibility, pairing requirements and effector coupling are weighted differently according to biological context. Viewing Argonautes through this common operational logic reconciles apparent differences in specificity, mismatch tolerance and target selection across systems, while providing a unified conceptual framework for understanding their evolution and guiding the engineering of programmable nucleic‐acid recognition technologies.","lang":"eng"}],"publication":"FEBS Letters","day":"08","doi":"10.1002/1873-3468.70450","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","publication_identifier":{"eissn":["1873-3468"],"issn":["0014-5793"]},"month":"09","quality_controlled":"1","supplementarymaterial":"no","publication_status":"epub_ahead","pmid":1,"project":[{"name":"Search & Destroy: Mechanisms of anti-plasmid immunity","_id":"9f295cab-ad08-11f1-bc83-9e197d0f6d50","grant_number":"PAT1617625"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-09-08T00:00:00Z","acknowledgement":"I would like to thank K. Kiernan and F. Alcon for insightful comments and feedback. We acknowledge support from ISTA and from the Austrian Science Fund (FWF) (10.55776/PAT1617625). The author used Claude (Anthropic) to assist with improving the clarity and readability of portions of the manuscript. All scientific content, interpretation and conclusions were conceived, verified and approved by the author, who takes full responsibility for the final manuscript. Open Access funding provided by Institute of Science and Technology Austria.","type":"journal_article","status":"public","_id":"22941","article_number":"1873-3468.70450","year":"2026","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/1873-3468.70450"}],"scopus_import":"1","title":"‘Guide and Prejudice’ - How Argonautes recognize targets across domains of life","OA_place":"publisher","OA_type":"hybrid"},{"PlanS_conform":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Kinetically constrained models were originally introduced to capture slow relaxation in glassy systems, where dynamics are hindered by local constraints instead of energy barriers. Their quantum counterparts have recently drawn attention for exhibiting highly degenerate eigenstates at zero energy—known as zero modes—stemming from chiral symmetry. Yet, the structure and implications of these zero modes remain poorly understood. In this work, we focus on the properties of the zero mode subspace in quantum kinetically constrained models with a U(1) particle-conservation symmetry. We use the U(1) East, which lacks inversion symmetry, and the inversion-symmetric U(1) East-West models to illustrate our two main results. First, we observe that the simultaneous presence of constraints and chiral symmetry generally leads to a parametric increase in the number of zero modes due to the fragmentation of the many-body\r\nHilbert space into disconnected sectors. Second, we generalize the concept of compact localized states from single-particle physics and introduce the notion of collective bound states, a special kind of nonergodic eigenstates that are robust to enlarging the system size. We formulate sufficient criteria for their existence, arguing that the degenerate zero mode subspace plays a central role, and demonstrate bound states in both example models and in a two-dimensional model, the U(1) North-East, and in the pairflip model, a system without particle conservation. Our results motivate a systematic study of bound states and their relation to ergodicity breaking, transport, and other properties of quantum kinetically constrained\r\nmodels. "}],"volume":7,"publication":"PRX Quantum","file_date_updated":"2026-03-30T06:08:07Z","doi":"10.1103/sl79-1xgb","day":"13","has_accepted_license":"1","article_processing_charge":"Yes","publication_identifier":{"eissn":["2691-3399"]},"month":"03","quality_controlled":"1","project":[{"call_identifier":"H2020","grant_number":"850899","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-03-13T00:00:00Z","acknowledgement":"The authors acknowledge useful discussions with Berislav Buca. This work was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 850899). M.L. acknowledges support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868. This research was supported in part by grant NSF PHY-2309135 to the Kavli Institute for Theoretical Physics (KITP).","type":"journal_article","status":"public","_id":"21501","article_number":"010352","file":[{"file_size":1848724,"checksum":"d155ffa9e1a8275702149165f4bf963c","date_updated":"2026-03-30T06:08:07Z","file_name":"2026_PRXQuantum_Nicolau.pdf","file_id":"21505","access_level":"open_access","creator":"dernst","date_created":"2026-03-30T06:08:07Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"year":"2026","scopus_import":"1","title":"Fragmentation, zero modes, and collective bound states in constrained models","OA_place":"publisher","OA_type":"gold","citation":{"mla":"Nicolau Jimenez, Eloi, et al. “Fragmentation, Zero Modes, and Collective Bound States in Constrained Models.” PRX Quantum, vol. 7, 010352, American Physical Society, 2026, doi:10.1103/sl79-1xgb.","chicago":"Nicolau Jimenez, Eloi, Marko Ljubotina, and Maksym Serbyn. “Fragmentation, Zero Modes, and Collective Bound States in Constrained Models.” PRX Quantum. American Physical Society, 2026. https://doi.org/10.1103/sl79-1xgb.","short":"E. Nicolau Jimenez, M. Ljubotina, M. Serbyn, PRX Quantum 7 (2026).","ama":"Nicolau Jimenez E, Ljubotina M, Serbyn M. Fragmentation, zero modes, and collective bound states in constrained models. PRX Quantum. 2026;7. doi:10.1103/sl79-1xgb","apa":"Nicolau Jimenez, E., Ljubotina, M., & Serbyn, M. (2026). Fragmentation, zero modes, and collective bound states in constrained models. PRX Quantum. American Physical Society. https://doi.org/10.1103/sl79-1xgb","ieee":"E. Nicolau Jimenez, M. Ljubotina, and M. Serbyn, “Fragmentation, zero modes, and collective bound states in constrained models,” PRX Quantum, vol. 7. American Physical Society, 2026.","ista":"Nicolau Jimenez E, Ljubotina M, Serbyn M. 2026. Fragmentation, zero modes, and collective bound states in constrained models. PRX Quantum. 7, 010352."},"fulldoi":"https://doi.org/10.1103/sl79-1xgb","corr_author":"1","external_id":{"arxiv":["2504.17627"]},"intvolume":" 7","article_type":"original","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"},"publisher":"American Physical Society","date_created":"2026-03-28T14:57:56Z","DOAJ_listed":"1","language":[{"iso":"eng"}],"date_updated":"2026-09-17T11:50:06Z","department":[{"_id":"MaSe"}],"ddc":["530"],"author":[{"first_name":"Eulalia","full_name":"Nicolau Jimenez, Eulalia","id":"04b4791c-8fd7-11ee-a7df-be2fdc569c48","last_name":"Nicolau Jimenez"},{"last_name":"Ljubotina","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","first_name":"Marko","full_name":"Ljubotina, Marko","orcid":"0000-0003-0038-7068"},{"first_name":"Maksym","full_name":"Serbyn, Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn"}],"oa":1,"arxiv":1,"ec_funded":1},{"acknowledgement":"We thank Evangelos Kosinas for helpful discussions on this topic.\r\nFunded by the European Union. Views and opinions expressed\r\nare however those of the author(s) only and do not necessarily\r\nreflect those of the European Union or the European Research\r\nCouncil Executive Agency. Neither the European Union nor the\r\ngranting authority can be held responsible for them.\r\nThis project has received funding from the European Research\r\nCouncil (ERC) under the European Union’s Horizon 2020 research\r\nand innovation programme (MoDynStruct, No. 101019564)\r\nand the Austrian Science Fund (FWF) grant DOI 10.55776/I5982. For\r\nopen access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising\r\nfrom this submission.\r\nThis project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858.","date_published":"2026-06-09T00:00:00Z","conference":{"start_date":"2026-06-22","location":"Salt Lake City, UT, United States","name":"STOC: Symposium on the Theory of Computing","end_date":"2026-06-26"},"type":"conference","status":"public","_id":"22245","file":[{"file_size":919005,"file_name":"2026_STOC_HenzingerMo.pdf","date_updated":"2026-07-06T06:57:16Z","checksum":"2bef46be8da6d19a641697bb0d8ade65","file_id":"22250","access_level":"open_access","creator":"dernst","date_created":"2026-07-06T06:57:16Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"year":"2026","scopus_import":"1","title":"An improved quality hierarchical congestion approximator in near-linear time","OA_place":"publisher","keyword":["Congestion Approximators","Hierarchical Graph Decompositions"],"OA_type":"gold","das_tickbox":"0","oa_version":"Published Version","abstract":[{"lang":"eng","text":"A single-commodity congestion approximator for a graph is a compact data structure that approximately predicts the edge congestion required to route any set of single-commodity flow demands in a network. A hierarchical congestion approximator (HCA) consists of a laminar family of cuts in the graph and has numerous applications in approximating cut and flow problems in graphs, designing efficient routing schemes, and managing distributed networks.\r\nThere is a tradeoff between the running time for computing an HCA and its approximation quality. The best polynomial-time construction in an n-node graph gives an HCA with approximation quality O(log1.5n loglogn). Among near-linear time algorithms, the best previous result achieves approximation quality O(log4 n). We improve upon the latter result by giving the first near-linear time algorithm for computing an HCA with approximation quality O(log2 n loglogn). Additionally, our algorithm can be implemented in the parallel setting with polylogarithmic span and near-linear work, achieving the same approximation quality. This improves upon the best previous such algorithm, which has an O(log9n) approximation quality. We also present a lower bound of Ω(logn) for the approximation guarantee of hierarchical congestion approximators.\r\nCrucial for achieving a near-linear running time is a new partitioning routine that, unlike previous such routines, manages to avoid recursing on large subgraphs. To achieve the improved approximation quality, we introduce the new concept of border routability of a cut and provide an improved sparsest cut oracle for general vertex weights."}],"publication":"58th Annual ACM Symposium on Theory of Computing","file_date_updated":"2026-07-06T06:57:16Z","doi":"10.1145/3798129.3800851","day":"09","article_processing_charge":"Yes","has_accepted_license":"1","publication_identifier":{"isbn":["9798400725364"],"issn":["0737-8017"]},"month":"06","quality_controlled":"1","supplementarymaterial":"no","project":[{"name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","call_identifier":"H2020"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MoHe"}],"date_updated":"2026-09-17T12:39:36Z","language":[{"iso":"eng"}],"researchdata_availability":"no","ddc":["000"],"author":[{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Münk, Robin","first_name":"Robin","last_name":"Münk"},{"first_name":"Harald","full_name":"Räcke, Harald","last_name":"Räcke"}],"arxiv":1,"oa":1,"ec_funded":1,"citation":{"mla":"Henzinger, Monika, et al. “An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time.” 58th Annual ACM Symposium on Theory of Computing, ACM, 2026, pp. 1417–28, doi:10.1145/3798129.3800851.","chicago":"Henzinger, Monika, Robin Münk, and Harald Räcke. “An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time.” In 58th Annual ACM Symposium on Theory of Computing, 1417–28. ACM, 2026. https://doi.org/10.1145/3798129.3800851.","short":"M. Henzinger, R. Münk, H. Räcke, in:, 58th Annual ACM Symposium on Theory of Computing, ACM, 2026, pp. 1417–1428.","ama":"Henzinger M, Münk R, Räcke H. An improved quality hierarchical congestion approximator in near-linear time. In: 58th Annual ACM Symposium on Theory of Computing. ACM; 2026:1417-1428. doi:10.1145/3798129.3800851","apa":"Henzinger, M., Münk, R., & Räcke, H. (2026). An improved quality hierarchical congestion approximator in near-linear time. In 58th Annual ACM Symposium on Theory of Computing (pp. 1417–1428). Salt Lake City, UT, United States: ACM. https://doi.org/10.1145/3798129.3800851","ista":"Henzinger M, Münk R, Räcke H. 2026. An improved quality hierarchical congestion approximator in near-linear time. 58th Annual ACM Symposium on Theory of Computing. STOC: Symposium on the Theory of Computing, 1417–1428.","ieee":"M. Henzinger, R. Münk, and H. Räcke, “An improved quality hierarchical congestion approximator in near-linear time,” in 58th Annual ACM Symposium on Theory of Computing, Salt Lake City, UT, United States, 2026, pp. 1417–1428."},"fulldoi":"https://doi.org/10.1145/3798129.3800851","external_id":{"arxiv":["2511.03716"]},"page":"1417-1428","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"},"publisher":"ACM","date_created":"2026-07-05T22:01:36Z"}]