@inproceedings{13142, abstract = {Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifier framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, the certificates are invariant and barrier functions for safety, or Lyapunov and ranking functions for liveness, in the stochastic case the certificates are supermartingales. For certificate verification, we use interval arithmetic abstract interpretation to bound the expected values of neural network functions.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Lechner, Mathias and Zikelic, Dorde}, booktitle = {Tools and Algorithms for the Construction and Analysis of Systems }, isbn = {9783031308222}, issn = {1611-3349}, location = {Paris, France}, pages = {3--25}, publisher = {Springer Nature}, title = {{A learner-verifier framework for neural network controllers and certificates of stochastic systems}}, doi = {10.1007/978-3-031-30823-9_1}, volume = {13993}, year = {2023}, } @inproceedings{13141, abstract = {We automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the environment to allow the system player to win. Given an ω-regular winning condition Φ for the system player, we compute an ω-regular assumption Ψ for the environment player, such that (i) every environment strategy compliant with Ψ allows the system to fulfill Φ (sufficiency), (ii) Ψ can be fulfilled by the environment for every strategy of the system (implementability), and (iii) Ψ does not prevent any cooperative strategy choice (permissiveness). For parity games, which are canonical representations of ω-regular games, we present a polynomial-time algorithm for the symbolic computation of adequately permissive assumptions and show that our algorithm runs faster and produces better assumptions than existing approaches—both theoretically and empirically. To the best of our knowledge, for ω -regular games, we provide the first algorithm to compute sufficient and implementable environment assumptions that are also permissive.}, author = {Anand, Ashwani and Mallik, Kaushik and Nayak, Satya Prakash and Schmuck, Anne Kathrin}, booktitle = {TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems}, isbn = {9783031308192}, issn = {1611-3349}, location = {Paris, France}, pages = {211--228}, publisher = {Springer Nature}, title = {{Computing adequately permissive assumptions for synthesis}}, doi = {10.1007/978-3-031-30820-8_15}, volume = {13994}, year = {2023}, } @phdthesis{12826, abstract = {During navigation, animals can infer the structure of the environment by computing the optic flow cues elicited by their own movements, and subsequently use this information to instruct proper locomotor actions. These computations require a panoramic assessment of the visual environment in order to disambiguate similar sensory experiences that may require distinct behavioral responses. The estimation of the global motion patterns is therefore essential for successful navigation. Yet, our understanding of the algorithms and implementations that enable coherent panoramic visual perception remains scarce. Here I pursue this problem by dissecting the functional aspects of interneuronal communication in the lobula plate tangential cell network in Drosophila melanogaster. The results presented in the thesis demonstrate that the basis for effective interpretation of the optic flow in this circuit are stereotyped synaptic connections that mediate the formation of distinct subnetworks, each extracting a particular pattern of global motion. Firstly, I show that gap junctions are essential for a correct interpretation of binocular motion cues by horizontal motion-sensitive cells. HS cells form electrical synapses with contralateral H2 neurons that are involved in detecting yaw rotation and translation. I developed an FlpStop-mediated mutant of a gap junction protein ShakB that disrupts these electrical synapses. While the loss of electrical synapses does not affect the tuning of the direction selectivity in HS neurons, it severely alters their sensitivity to horizontal motion in the contralateral side. These physiological changes result in an inappropriate integration of binocular motion cues in walking animals. While wild-type flies form a binocular perception of visual motion by non-linear integration of monocular optic flow cues, the mutant flies sum the monocular inputs linearly. These results indicate that rather than averaging signals in neighboring neurons, gap-junctions operate in conjunction with chemical synapses to mediate complex non-linear optic flow computations. Secondly, I show that stochastic manipulation of neuronal activity in the lobula plate tangential cell network is a powerful approach to study the neuronal implementation of optic flow-based navigation in flies. Tangential neurons form multiple subnetworks, each mediating course-stabilizing response to a particular global pattern of visual motion. Application of genetic mosaic techniques can provide sparse optogenetic activation of HS cells in numerous combinations. These distinct combinations of activated neurons drive an array of distinct behavioral responses, providing important insights into how visuomotor transformation is performed in the lobula plate tangential cell network. This approach can be complemented by stochastic silencing of tangential neurons, enabling direct assessment of the functional role of individual tangential neurons in the processing of specific visual motion patterns. Taken together, the findings presented in this thesis suggest that establishing specific activity patterns of tangential cells via stereotyped synaptic connectivity is a key to efficient optic flow-based navigation in Drosophila melanogaster.}, author = {Pokusaeva, Victoria}, issn = {2663 - 337X}, pages = {106}, publisher = {Institute of Science and Technology Austria}, title = {{Neural control of optic flow-based navigation in Drosophila melanogaster}}, doi = {10.15479/at:ista:12826}, year = {2023}, } @article{12086, abstract = {We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box to construct the order-k mosaic from its vertices. Beyond this black-box, the algorithm uses only combinatorial operations, thus facilitating easy implementation. We extend this algorithm to compute higher-order α-shapes and provide open-source implementations. We present experimental results for properties of higher-order Delaunay mosaics of random point sets.}, author = {Edelsbrunner, Herbert and Osang, Georg F}, issn = {1432-0541}, journal = {Algorithmica}, pages = {277--295}, publisher = {Springer Nature}, title = {{A simple algorithm for higher-order Delaunay mosaics and alpha shapes}}, doi = {10.1007/s00453-022-01027-6}, volume = {85}, year = {2023}, } @article{12104, abstract = {We study ergodic decompositions of Dirichlet spaces under intertwining via unitary order isomorphisms. We show that the ergodic decomposition of a quasi-regular Dirichlet space is unique up to a unique isomorphism of the indexing space. Furthermore, every unitary order isomorphism intertwining two quasi-regular Dirichlet spaces is decomposable over their ergodic decompositions up to conjugation via an isomorphism of the corresponding indexing spaces.}, author = {Dello Schiavo, Lorenzo and Wirth, Melchior}, issn = {1424-3202}, journal = {Journal of Evolution Equations}, number = {1}, publisher = {Springer Nature}, title = {{Ergodic decompositions of Dirichlet forms under order isomorphisms}}, doi = {10.1007/s00028-022-00859-7}, volume = {23}, year = {2023}, } @inproceedings{12467, abstract = {Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In quantitative specification and verification, properties assign not truth values, but quantitative values to infinite traces (e.g., a cost, or the distance to a boolean property). We introduce quantitative safety and liveness, and we prove that our definitions induce conservative quantitative generalizations of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness decomposition of boolean properties. In particular, we show that every quantitative property can be written as the pointwise minimum of a quantitative safety property and a quantitative liveness property. Consequently, like boolean properties, also quantitative properties can be min-decomposed into safety and liveness parts, or alternatively, max-decomposed into co-safety and co-liveness parts. Moreover, quantitative properties can be approximated naturally. We prove that every quantitative property that has both safe and co-safe approximations can be monitored arbitrarily precisely by a monitor that uses only a finite number of states.}, author = {Henzinger, Thomas A and Mazzocchi, Nicolas Adrien and Sarac, Naci E}, booktitle = {26th International Conference Foundations of Software Science and Computation Structures}, isbn = {9783031308284}, issn = {1611-3349}, location = {Paris, France}, pages = {349--370}, publisher = {Springer Nature}, title = {{Quantitative safety and liveness}}, doi = {10.1007/978-3-031-30829-1_17}, volume = {13992}, year = {2023}, } @article{13179, abstract = {Writing concurrent code that is both correct and efficient is notoriously difficult. Thus, programmers often prefer to use synchronization abstractions, which render code simpler and easier to reason about. Despite a wealth of work on this topic, there is still a gap between the rich semantics provided by synchronization abstractions in modern programming languages—specifically, fair FIFO ordering of synchronization requests and support for abortable operations—and frameworks for implementing it correctly and efficiently. Supporting such semantics is critical given the rising popularity of constructs for asynchronous programming, such as coroutines, which abort frequently and are cheaper to suspend and resume compared to native threads. This paper introduces a new framework called CancellableQueueSynchronizer (CQS), which enables simple yet efficient implementations of a wide range of fair and abortable synchronization primitives: mutexes, semaphores, barriers, count-down latches, and blocking pools. Our main contribution is algorithmic, as implementing both fairness and abortability efficiently at this level of generality is non-trivial. Importantly, all our algorithms, including the CQS framework and the primitives built on top of it, come with formal proofs in the Iris framework for Coq for many of their properties. These proofs are modular, so it is easy to show correctness for new primitives implemented on top of CQS. From a practical perspective, implementation of CQS for native threads on the JVM improves throughput by up to two orders of magnitude over Java’s AbstractQueuedSynchronizer, the only practical abstraction offering similar semantics. Further, we successfully integrated CQS as a core component of the popular Kotlin Coroutines library, validating the framework’s practical impact and expressiveness in a real-world environment. In sum, CancellableQueueSynchronizer is the first framework to combine expressiveness with formal guarantees and solid practical performance. Our approach should be extensible to other languages and families of synchronization primitives.}, author = {Koval, Nikita and Khalanskiy, Dmitry and Alistarh, Dan-Adrian}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, publisher = {Association for Computing Machinery }, title = {{CQS: A formally-verified framework for fair and abortable synchronization}}, doi = {10.1145/3591230}, volume = {7}, year = {2023}, } @article{13180, abstract = {We study the density of everywhere locally soluble diagonal quadric surfaces, parameterised by rational points that lie on a split quadric surface}, author = {Browning, Timothy D and Lyczak, Julian and Sarapin, Roman}, issn = {1944-4184}, journal = {Involve}, number = {2}, pages = {331--342}, publisher = {Mathematical Sciences Publishers}, title = {{Local solubility for a family of quadrics over a split quadric surface}}, doi = {10.2140/involve.2023.16.331}, volume = {16}, year = {2023}, } @inproceedings{13162, author = {Elefante, Stefano and Stadlbauer, Stephan and Alexander, Michael F and Schlögl, Alois}, booktitle = {ASHPC23 - Austrian-Slovenian HPC Meeting 2023}, location = {Maribor, Slovenia}, pages = {42--42}, publisher = {EuroCC}, title = {{Cryo-EM software packages: A sys-admins point of view}}, year = {2023}, } @inproceedings{13161, author = {Schlögl, Alois and Elefante, Stefano and Hodirnau, Victor-Valentin}, booktitle = {ASHPC23 - Austrian-Slovenian HPC Meeting 2023}, location = {Maribor, Slovenia}, pages = {59--59}, publisher = {EuroCC}, title = {{Running Windows-applications on a Linux HPC cluster using WINE}}, year = {2023}, } @article{13251, abstract = {A rotating organic cation and a dynamically disordered soft inorganic cage are the hallmark features of organic-inorganic lead-halide perovskites. Understanding the interplay between these two subsystems is a challenging problem, but it is this coupling that is widely conjectured to be responsible for the unique behavior of photocarriers in these materials. In this work, we use the fact that the polarizability of the organic cation strongly depends on the ambient electrostatic environment to put the molecule forward as a sensitive probe of the local crystal fields inside the lattice cell. We measure the average polarizability of the C/N–H bond stretching mode by means of infrared spectroscopy, which allows us to deduce the character of the motion of the cation molecule, find the magnitude of the local crystal field, and place an estimate on the strength of the hydrogen bond between the hydrogen and halide atoms. Our results pave the way for understanding electric fields in lead-halide perovskites using infrared bond spectroscopy.}, author = {Wei, Yujing and Volosniev, Artem and Lorenc, Dusan and Zhumekenov, Ayan A. and Bakr, Osman M. and Lemeshko, Mikhail and Alpichshev, Zhanybek}, issn = {1948-7185}, journal = {The Journal of Physical Chemistry Letters}, keywords = {General Materials Science, Physical and Theoretical Chemistry}, number = {27}, pages = {6309--6314}, publisher = {American Chemical Society}, title = {{Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites}}, doi = {10.1021/acs.jpclett.3c01158}, volume = {14}, year = {2023}, } @inproceedings{13292, abstract = {The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time.}, author = {Henzinger, Thomas A and Kebis, Pavol and Mazzocchi, Nicolas Adrien and Sarac, Naci E}, booktitle = {50th International Colloquium on Automata, Languages, and Programming}, isbn = {9783959772785}, issn = {1868-8969}, location = {Paderborn, Germany}, pages = {129:1----129:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Regular methods for operator precedence languages}}, doi = {10.4230/LIPIcs.ICALP.2023.129}, volume = {261}, year = {2023}, } @article{13277, abstract = {Recent experimental advances have inspired the development of theoretical tools to describe the non-equilibrium dynamics of quantum systems. Among them an exact representation of quantum spin systems in terms of classical stochastic processes has been proposed. Here we provide first steps towards the extension of this stochastic approach to bosonic systems by considering the one-dimensional quantum quartic oscillator. We show how to exactly parameterize the time evolution of this prototypical model via the dynamics of a set of classical variables. We interpret these variables as stochastic processes, which allows us to propose a novel way to numerically simulate the time evolution of the system. We benchmark our findings by considering analytically solvable limits and providing alternative derivations of known results.}, author = {Tucci, Gennaro and De Nicola, Stefano and Wald, Sascha and Gambassi, Andrea}, issn = {2666-9366}, journal = {SciPost Physics Core}, keywords = {Statistical and Nonlinear Physics, Atomic and Molecular Physics, and Optics, Nuclear and High Energy Physics, Condensed Matter Physics}, number = {2}, publisher = {SciPost Foundation}, title = {{Stochastic representation of the quantum quartic oscillator}}, doi = {10.21468/scipostphyscore.6.2.029}, volume = {6}, year = {2023}, } @article{13276, abstract = {We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost.}, author = {Rammelmüller, Lukas and Huber, David and Volosniev, Artem}, issn = {2949-804X}, journal = {SciPost Physics Codebases}, publisher = {SciPost Foundation}, title = {{A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D}}, doi = {10.21468/scipostphyscodeb.12}, year = {2023}, } @misc{13275, abstract = {We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost.}, author = {Rammelmüller, Lukas and Huber, David and Volosniev, Artem}, publisher = {SciPost Foundation}, title = {{Codebase release 1.0 for FermiFCI}}, doi = {10.21468/scipostphyscodeb.12-r1.0}, year = {2023}, } @inproceedings{13262, abstract = {Determining the degree of inherent parallelism in classical sequential algorithms and leveraging it for fast parallel execution is a key topic in parallel computing, and detailed analyses are known for a wide range of classical algorithms. In this paper, we perform the first such analysis for the fundamental Union-Find problem, in which we are given a graph as a sequence of edges, and must maintain its connectivity structure under edge additions. We prove that classic sequential algorithms for this problem are well-parallelizable under reasonable assumptions, addressing a conjecture by [Blelloch, 2017]. More precisely, we show via a new potential argument that, under uniform random edge ordering, parallel union-find operations are unlikely to interfere: T concurrent threads processing the graph in parallel will encounter memory contention O(T2 · log |V| · log |E|) times in expectation, where |E| and |V| are the number of edges and nodes in the graph, respectively. We leverage this result to design a new parallel Union-Find algorithm that is both internally deterministic, i.e., its results are guaranteed to match those of a sequential execution, but also work-efficient and scalable, as long as the number of threads T is O(|E|1 over 3 - ε), for an arbitrarily small constant ε > 0, which holds for most large real-world graphs. We present lower bounds which show that our analysis is close to optimal, and experimental results suggesting that the performance cost of internal determinism is limited.}, author = {Fedorov, Alexander and Hashemi, Diba and Nadiradze, Giorgi and Alistarh, Dan-Adrian}, booktitle = {Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures}, isbn = {9781450395458}, location = {Orlando, FL, United States}, pages = {261--271}, publisher = {Association for Computing Machinery}, title = {{Provably-efficient and internally-deterministic parallel Union-Find}}, doi = {10.1145/3558481.3591082}, year = {2023}, } @article{11479, abstract = {Understanding population divergence that eventually leads to speciation is essential for evolutionary biology. High species diversity in the sea was regarded as a paradox when strict allopatry was considered necessary for most speciation events because geographical barriers seemed largely absent in the sea, and many marine species have high dispersal capacities. Combining genome-wide data with demographic modelling to infer the demographic history of divergence has introduced new ways to address this classical issue. These models assume an ancestral population that splits into two subpopulations diverging according to different scenarios that allow tests for periods of gene flow. Models can also test for heterogeneities in population sizes and migration rates along the genome to account, respectively, for background selection and selection against introgressed ancestry. To investigate how barriers to gene flow arise in the sea, we compiled studies modelling the demographic history of divergence in marine organisms and extracted preferred demographic scenarios together with estimates of demographic parameters. These studies show that geographical barriers to gene flow do exist in the sea but that divergence can also occur without strict isolation. Heterogeneity of gene flow was detected in most population pairs suggesting the predominance of semipermeable barriers during divergence. We found a weak positive relationship between the fraction of the genome experiencing reduced gene flow and levels of genome-wide differentiation. Furthermore, we found that the upper bound of the ‘grey zone of speciation’ for our dataset extended beyond that found before, implying that gene flow between diverging taxa is possible at higher levels of divergence than previously thought. Finally, we list recommendations for further strengthening the use of demographic modelling in speciation research. These include a more balanced representation of taxa, more consistent and comprehensive modelling, clear reporting of results and simulation studies to rule out nonbiological explanations for general results.}, author = {De Jode, Aurélien and Le Moan, Alan and Johannesson, Kerstin and Faria, Rui and Stankowski, Sean and Westram, Anja M and Butlin, Roger K. and Rafajlović, Marina and Fraisse, Christelle}, issn = {1752-4571}, journal = {Evolutionary Applications}, number = {2}, pages = {542--559}, publisher = {Wiley}, title = {{Ten years of demographic modelling of divergence and speciation in the sea}}, doi = {10.1111/eva.13428}, volume = {16}, year = {2023}, } @article{12329, abstract = {In this article, we develop two independent and new approaches to model epidemic spread in a network. Contrary to the most studied models, those developed here allow for contacts with different probabilities of transmitting the disease (transmissibilities). We then examine each of these models using some mean field type approximations. The first model looks at the late-stage effects of an epidemic outbreak and allows for the computation of the probability that a given vertex was infected. This computation is based on a mean field approximation and only depends on the number of contacts and their transmissibilities. This approach shares many similarities with percolation models in networks. The second model we develop is a dynamic model which we analyze using a mean field approximation which highly reduces the dimensionality of the system. In particular, the original system which individually analyses each vertex of the network is reduced to one with as many equations as different transmissibilities. Perhaps the greatest contribution of this article is the observation that, in both these models, the existence and size of an epidemic outbreak are linked to the properties of a matrix which we call the R-matrix. This is a generalization of the basic reproduction number which more precisely characterizes the main routes of infection.}, author = {Gómez, Arturo and Oliveira, Goncalo}, issn = {2045-2322}, journal = {Scientific Reports}, publisher = {Springer Nature}, title = {{New approaches to epidemic modeling on networks}}, doi = {10.1038/s41598-022-19827-9}, volume = {13}, year = {2023}, } @article{9034, abstract = {We determine an asymptotic formula for the number of integral points of bounded height on a blow-up of P3 outside certain planes using universal torsors.}, author = {Wilsch, Florian Alexander}, issn = {1687-0247}, journal = {International Mathematics Research Notices}, number = {8}, pages = {6780--6808}, publisher = {Oxford Academic}, title = {{Integral points of bounded height on a log Fano threefold}}, doi = {10.1093/imrn/rnac048}, volume = {2023}, year = {2023}, } @article{12469, abstract = {Hosts can carry many viruses in their bodies, but not all of them cause disease. We studied ants as a social host to determine both their overall viral repertoire and the subset of actively infecting viruses across natural populations of three subfamilies: the Argentine ant (Linepithema humile, Dolichoderinae), the invasive garden ant (Lasius neglectus, Formicinae) and the red ant (Myrmica rubra, Myrmicinae). We used a dual sequencing strategy to reconstruct complete virus genomes by RNA-seq and to simultaneously determine the small interfering RNAs (siRNAs) by small RNA sequencing (sRNA-seq), which constitute the host antiviral RNAi immune response. This approach led to the discovery of 41 novel viruses in ants and revealed a host ant-specific RNAi response (21 vs. 22 nt siRNAs) in the different ant species. The efficiency of the RNAi response (sRNA/RNA read count ratio) depended on the virus and the respective ant species, but not its population. Overall, we found the highest virus abundance and diversity per population in Li. humile, followed by La. neglectus and M. rubra. Argentine ants also shared a high proportion of viruses between populations, whilst overlap was nearly absent in M. rubra. Only one of the 59 viruses was found to infect two of the ant species as hosts, revealing high host-specificity in active infections. In contrast, six viruses actively infected one ant species, but were found as contaminants only in the others. Disentangling spillover of disease-causing infection from non-infecting contamination across species is providing relevant information for disease ecology and ecosystem management.}, author = {Viljakainen, Lumi and Fürst, Matthias and Grasse, Anna V and Jurvansuu, Jaana and Oh, Jinook and Tolonen, Lassi and Eder, Thomas and Rattei, Thomas and Cremer, Sylvia}, issn = {1664-302X}, journal = {Frontiers in Microbiology}, publisher = {Frontiers}, title = {{Antiviral immune response reveals host-specific virus infections in natural ant populations}}, doi = {10.3389/fmicb.2023.1119002}, volume = {14}, year = {2023}, }