@inproceedings{10053,
  abstract     = {This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N1−1 μ+NPlog2log2NP), where N is the block length of the code and μ is the scaling exponent of polar codes for the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P=N2 , the latency of SSC decoding is O(N1−1/μ) , which is sublinear in the block length. This recovers a result from an earlier work. Second, in a fully-serial implementation where P=1 , the latency of SSC decoding scales as O(Nlog2log2N) . The multiplicative constant is also calculated: we show that the latency of SSC decoding when P=1 is given by (2+o(1))Nlog2log2N . Third, in a semi-parallel implementation, the smallest P that gives the same latency as that of the fully-parallel implementation is P=N1/μ . The tightness of our bound on SSC decoding latency and the applicability of the foregoing results is validated through extensive simulations.},
  author       = {Hashemi, Seyyed Ali and Mondelli, Marco and Fazeli, Arman and Vardy, Alexander and Cioffi, John and Goldsmith, Andrea},
  booktitle    = {2021 IEEE International Symposium on Information Theory},
  isbn         = {978-1-5386-8210-4},
  issn         = {2157-8095},
  location     = {Melbourne, Australia},
  pages        = {2369--2374},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Parallelism versus latency in simplified successive-cancellation decoding of polar codes}},
  doi          = {10.1109/ISIT45174.2021.9518153},
  year         = {2021},
}

@inproceedings{10054,
  abstract     = {Graphs and games on graphs are fundamental models for the analysis of reactive systems, in particular, for model-checking and the synthesis of reactive systems. The class of ω-regular languages provides a robust specification formalism for the desired properties of reactive systems. In the classical infinitary formulation of the liveness part of an ω-regular specification, a "good" event must happen eventually without any bound between the good events. A stronger notion of liveness is bounded liveness, which requires that good events happen within d transitions. Given a graph or a game graph with n vertices, m edges, and a bounded liveness objective, the previous best-known algorithmic bounds are as follows: (i) O(dm) for graphs, which in the worst-case is O(n³); and (ii) O(n² d²) for games on graphs. Our main contributions improve these long-standing algorithmic bounds. For graphs we present: (i) a randomized algorithm with one-sided error with running time O(n^{2.5} log n) for the bounded liveness objectives; and (ii) a deterministic linear-time algorithm for the complement of bounded liveness objectives. For games on graphs, we present an O(n² d) time algorithm for the bounded liveness objectives.},
  author       = {Chatterjee, Krishnendu and Henzinger, Monika H and Kale, Sagar Sudhir and Svozil, Alexander},
  booktitle    = {48th International Colloquium on Automata, Languages, and Programming},
  isbn         = {978-3-95977-195-5},
  issn         = {1868-8969},
  location     = {Glasgow, Scotland},
  publisher    = {Schloss Dagstuhl - Leibniz Zentrum für Informatik},
  title        = {{Faster algorithms for bounded liveness in graphs and game graphs}},
  doi          = {10.4230/LIPIcs.ICALP.2021.124},
  volume       = {198},
  year         = {2021},
}

@inproceedings{10055,
  abstract     = {Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid M, it is natural to ask how long a sequence of elements of M needs to be to ensure the presence of consecutive idempotent factors. This question is formalised through the notion of the Ramsey function R_M associated to M, obtained by mapping every k ∈ ℕ to the minimal integer R_M(k) such that every word u ∈ M^* of length R_M(k) contains k consecutive non-empty factors that correspond to the same idempotent element of M. In this work, we study the behaviour of the Ramsey function R_M by investigating the regular 𝒟-length of M, defined as the largest size L(M) of a submonoid of M isomorphic to the set of natural numbers {1,2, …, L(M)} equipped with the max operation. We show that the regular 𝒟-length of M determines the degree of R_M, by proving that k^L(M) ≤ R_M(k) ≤ (k|M|⁴)^L(M). To allow applications of this result, we provide the value of the regular 𝒟-length of diverse monoids. In particular, we prove that the full monoid of n × n Boolean matrices, which is used to express transition monoids of non-deterministic automata, has a regular 𝒟-length of (n²+n+2)/2.},
  author       = {Jecker, Ismael R},
  booktitle    = {38th International Symposium on Theoretical Aspects of Computer Science},
  isbn         = {978-3-9597-7180-1},
  issn         = {1868-8969},
  location     = {Saarbrücken, Germany},
  publisher    = {Schloss Dagstuhl - Leibniz Zentrum für Informatik},
  title        = {{A Ramsey theorem for finite monoids}},
  doi          = {10.4230/LIPIcs.STACS.2021.44},
  volume       = {187},
  year         = {2021},
}

@phdthesis{10058,
  abstract     = {Quantum information and computation has become a vast field paved with opportunities for researchers and investors. As large multinational companies and international funds are heavily investing in quantum technologies it is still a question which platform is best suited for the task of realizing a scalable quantum processor. In this work we investigate hole spins in Ge quantum wells. These hold great promise as they possess several favorable properties: a small effective mass, a strong spin-orbit coupling, long relaxation time and an inherent immunity to hyperfine noise. All these characteristics helped Ge hole spin qubits to evolve from a single qubit to a fully entangled four qubit processor in only 3 years. Here, we investigated a qubit approach leveraging the large out-of-plane g-factors of heavy hole states in Ge quantum dots. We found this qubit to be reproducibly operable at extremely low magnetic field and at large speeds while maintaining coherence. This was possible because large differences of g-factors in adjacent dots can be achieved in the out-of-plane direction. In the in-plane direction the small g-factors, on the other hand, can be altered very effectively by the confinement potentials. Here, we found that this can even lead to a sign change of the g-factors. The resulting g-factor difference alters the dynamics of the system drastically and produces effects typically attributed to a spin-orbit induced spin-flip term.  The investigations carried out in this thesis give further insights into the possibilities of holes in Ge and reveal new physical properties that need to be considered when designing future spin qubit experiments.},
  author       = {Jirovec, Daniel},
  issn         = {2663-337X},
  keywords     = {qubits, quantum computing, holes},
  pages        = {151},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases}},
  doi          = {10.15479/at:ista:10058},
  year         = {2021},
}

@unpublished{10066,
  abstract     = {The potential of Si and SiGe-based devices for the scaling of quantum circuits is tainted by device variability. Each device needs to be tuned to operation conditions. We give a key step towards tackling this variability with an algorithm that, without modification, is capable of tuning a 4-gate Si FinFET, a 5-gate GeSi nanowire and a 7-gate SiGe heterostructure double quantum dot device from scratch. We achieve tuning times of 30, 10, and 92 minutes, respectively. The algorithm also provides insight into the parameter space landscape for each of these devices. These results show that overarching solutions for the tuning of quantum devices are enabled by machine learning.},
  author       = {Severin, B. and Lennon, D. T. and Camenzind, L. C. and Vigneau, F. and Fedele, F. and Jirovec, Daniel and Ballabio, A. and Chrastina, D. and Isella, G. and Kruijf, M. de and Carballido, M. J. and Svab, S. and Kuhlmann, A. V. and Braakman, F. R. and Geyer, S. and Froning, F. N. M. and Moon, H. and Osborne, M. A. and Sejdinovic, D. and Katsaros, Georgios and Zumbühl, D. M. and Briggs, G. A. D. and Ares, N.},
  booktitle    = {arXiv},
  title        = {{Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning}},
  doi          = {10.48550/arXiv.2107.12975},
  year         = {2021},
}

@article{10067,
  abstract     = {The search for novel entangled phases of matter has lead to the recent discovery of a new class of “entanglement transitions,” exemplified by random tensor networks and monitored quantum circuits. Most known examples can be understood as some classical ordering transitions in an underlying statistical mechanics model, where entanglement maps onto the free-energy cost of inserting a domain wall. In this paper we study the possibility of entanglement transitions driven by physics beyond such statistical mechanics mappings. Motivated by recent applications of neural-network-inspired variational Ansätze, we investigate under what conditions on the variational parameters these Ansätze can capture an entanglement transition. We study the entanglement scaling of short-range restricted Boltzmann machine (RBM) quantum states with random phases. For uncorrelated random phases, we analytically demonstrate the absence of an entanglement transition and reveal subtle finite-size effects in finite-size numerical simulations. Introducing phases with correlations decaying as 1/r^α in real space, we observe three regions with a different scaling of entanglement entropy depending on the exponent α. We study the nature of the transition between these regions, finding numerical evidence for critical behavior. Our work establishes the presence of long-range correlated phases in RBM-based wave functions as a required ingredient for entanglement transitions.},
  author       = {Medina Ramos, Raimel A and Vasseur, Romain and Serbyn, Maksym},
  issn         = {2469-9969},
  journal      = {Physical Review B},
  number       = {10},
  publisher    = {American Physical Society},
  title        = {{Entanglement transitions from restricted Boltzmann machines}},
  doi          = {10.1103/physrevb.104.104205},
  volume       = {104},
  year         = {2021},
}

@article{10069,
  abstract     = {The extent to which women differ in the course of blood cell counts throughout pregnancy, and the importance of these changes to pregnancy outcomes has not been well defined. Here, we develop a series of statistical analyses of repeated measures data to reveal the degree to which women differ in the course of pregnancy, predict the changes that occur, and determine the importance of these changes for post-partum hemorrhage (PPH) which is one of the leading causes of maternal mortality. We present a prospective cohort of 4082 births recorded at the University Hospital, Lausanne, Switzerland between 2009 and 2014 where full labour records could be obtained, along with complete blood count data taken at hospital admission. We find significant differences, at a [Formula: see text] level, among women in how blood count values change through pregnancy for mean corpuscular hemoglobin, mean corpuscular volume, mean platelet volume, platelet count and red cell distribution width. We find evidence that almost all complete blood count values show trimester-specific associations with PPH. For example, high platelet count (OR 1.20, 95% CI 1.01-1.53), high mean platelet volume (OR 1.58, 95% CI 1.04-2.08), and high erythrocyte levels (OR 1.36, 95% CI 1.01-1.57) in trimester 1 increased PPH, but high values in trimester 3 decreased PPH risk (OR 0.85, 0.79, 0.67 respectively). We show that differences among women in the course of blood cell counts throughout pregnancy have an important role in shaping pregnancy outcome and tracking blood count value changes through pregnancy improves identification of women at increased risk of postpartum hemorrhage. This study provides greater understanding of the complex changes in blood count values that occur through pregnancy and provides indicators to guide the stratification of patients into risk groups.},
  author       = {Robinson, Matthew Richard and Patxot, Marion and Stojanov, Miloš and Blum, Sabine and Baud, David},
  issn         = {2045-2322},
  journal      = {Scientific Reports},
  publisher    = {Springer Nature},
  title        = {{Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy}},
  doi          = {10.1038/s41598-021-98411-z},
  volume       = {11},
  year         = {2021},
}

@article{10070,
  abstract     = {We extensively discuss the Rademacher and Sobolev-to-Lipschitz properties for generalized intrinsic distances on strongly local Dirichlet spaces possibly without square field operator. We present many non-smooth and infinite-dimensional examples. As an application, we prove the integral Varadhan short-time asymptotic with respect to a given distance function for a large class of strongly local Dirichlet forms.},
  author       = {Dello Schiavo, Lorenzo and Suzuki, Kohei},
  issn         = {1096-0783},
  journal      = {Journal of Functional Analysis},
  number       = {11},
  publisher    = {Elsevier},
  title        = {{Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local Dirichlet spaces}},
  doi          = {10.1016/j.jfa.2021.109234},
  volume       = {281},
  year         = {2021},
}

@article{10071,
  author       = {Adams, Henry and Kourimska, Hana and Heiss, Teresa and Percival, Sarah and Ziegelmeier, Lori},
  issn         = {1088-9477},
  journal      = {Notices of the American Mathematical Society},
  number       = {9},
  pages        = {1511--1514},
  publisher    = {American Mathematical Society},
  title        = {{How to tutorial-a-thon}},
  doi          = {10.1090/noti2349},
  volume       = {68},
  year         = {2021},
}

@inproceedings{10072,
  abstract     = {The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combinatorics which can be used to establish the existence of objects that satisfy certain properties. The breakthrough paper of Moser and Tardos and follow-up works revealed that the LLL has intimate connections with a class of stochastic local search algorithms for finding such desirable objects. In particular, it can be seen as a sufficient condition for this type of algorithms to converge fast. Besides conditions for existence of and fast convergence to desirable objects, one may naturally ask further questions regarding properties of these algorithms. For instance, "are they parallelizable?", "how many solutions can they output?", "what is the expected "weight" of a solution?", etc. These questions and more have been answered for a class of LLL-inspired algorithms called commutative. In this paper we introduce a new, very natural and more general notion of commutativity (essentially matrix commutativity) which allows us to show a number of new refined properties of LLL-inspired local search algorithms with significantly simpler proofs.},
  author       = {Harris, David G. and Iliopoulos, Fotis and Kolmogorov, Vladimir},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
  isbn         = {978-3-9597-7207-5},
  issn         = {1868-8969},
  location     = {Virtual},
  publisher    = {Schloss Dagstuhl - Leibniz Zentrum für Informatik},
  title        = {{A new notion of commutativity for the algorithmic Lovász Local Lemma}},
  doi          = {10.4230/LIPIcs.APPROX/RANDOM.2021.31},
  volume       = {207},
  year         = {2021},
}

@article{10073,
  abstract     = {Thermoelectric materials enable the direct conversion between heat and electricity. SnTe is a promising candidate due to its high charge transport performance. Here, we prepared SnTe nanocomposites by employing an aqueous method to synthetize SnTe nanoparticles (NP), followed by a unique surface treatment prior NP consolidation. This synthetic approach allowed optimizing the charge and phonon transport synergistically. The novelty of this strategy was the use of a soluble PbS molecular complex prepared using a thiol-amine solvent mixture that upon blending is adsorbed on the SnTe NP surface. Upon consolidation with spark plasma sintering, SnTe-PbS nanocomposite is formed. The presence of PbS complexes significantly compensates for the Sn vacancy and increases the average grain size of the nanocomposite, thus improving the carrier mobility. Moreover, lattice thermal conductivity is also reduced by the Pb and S-induced mass and strain fluctuation. As a result, an enhanced ZT of ca. 0.8 is reached at 873 K. Our finding provides a novel strategy to conduct rational surface treatment on NP-based thermoelectrics.},
  author       = {Chang, Cheng and Ibáñez, Maria},
  issn         = {1996-1944},
  journal      = {Materials},
  number       = {18},
  publisher    = {MDPI},
  title        = {{Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites}},
  doi          = {10.3390/ma14185416},
  volume       = {14},
  year         = {2021},
}

@inproceedings{10075,
  abstract     = {We study the expressiveness and succinctness of good-for-games pushdown automata (GFG-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved based on the run constructed so far, but independently of the remainder of the input word. We prove that GFG-PDA recognise more languages than deterministic PDA (DPDA) but not all context-free languages (CFL). This class is orthogonal to unambiguous CFL. We further show that GFG-PDA can be exponentially more succinct than DPDA, while PDA can be double-exponentially more succinct than GFG-PDA. We also study GFGness in visibly pushdown automata (VPA), which enjoy better closure properties than PDA, and for which we show GFGness to be ExpTime-complete. GFG-VPA can be exponentially more succinct than deterministic VPA, while VPA can be exponentially more succinct than GFG-VPA. Both of these lower bounds are tight. Finally, we study the complexity of resolving nondeterminism in GFG-PDA. Every GFG-PDA has a positional resolver, a function that resolves nondeterminism and that is only dependant on the current configuration. Pushdown transducers are sufficient to implement the resolvers of GFG-VPA, but not those of GFG-PDA. GFG-PDA with finite-state resolvers are determinisable.},
  author       = {Guha, Shibashis and Jecker, Ismael R and Lehtinen, Karoliina and Zimmermann, Martin},
  booktitle    = {46th International Symposium on Mathematical Foundations of Computer Science},
  isbn         = {978-3-9597-7201-3},
  issn         = {1868-8969},
  location     = {Tallinn, Estonia},
  publisher    = {Schloss Dagstuhl - Leibniz Zentrum für Informatik},
  title        = {{A bit of nondeterminism makes pushdown automata expressive and succinct}},
  doi          = {10.4230/LIPIcs.MFCS.2021.53},
  volume       = {202},
  year         = {2021},
}

@inproceedings{10076,
  abstract     = {We present a novel approach for blockchain asset owners to reclaim their funds in case of accidental private-key loss or transfer to a mistyped address. Our solution can be deployed upon failure or absence of proactively implemented backup mechanisms, such as secret sharing and cold storage. The main advantages against previous proposals is it does not require any prior action from users and works with both single-key and multi-sig accounts. We achieve this by a 3-phase   Commit()→Reveal()→Claim()−or−Challenge()  smart contract that enables accessing funds of addresses for which the spending key is not available. We provide an analysis of the threat and incentive models and formalize the concept of reactive KEy-Loss Protection (KELP).},
  author       = {Blackshear, Sam and Chalkias, Konstantinos and Chatzigiannis, Panagiotis and Faizullabhoy, Riyaz and Khaburzaniya, Irakliy and Kokoris Kogias, Eleftherios and Lind, Joshua and Wong, David and Zakian, Tim},
  booktitle    = {FC 2021 Workshops},
  isbn         = {978-3-6626-3957-3},
  issn         = {1611-3349},
  location     = {Virtual},
  pages        = {431--450},
  publisher    = {Springer Nature},
  title        = {{Reactive key-loss protection in blockchains}},
  doi          = {10.1007/978-3-662-63958-0_34},
  volume       = {12676 },
  year         = {2021},
}

@unpublished{10077,
  abstract     = {Although much is known about how single neurons in the hippocampus represent an animal’s position, how cell-cell interactions contribute to spatial coding remains poorly understood. Using a novel statistical estimator and theoretical modeling, both developed in the framework of maximum entropy models, we reveal highly structured cell-to-cell interactions whose statistics depend on familiar vs. novel environment. In both conditions the circuit interactions optimize the encoding of spatial information, but for regimes that differ in the signal-to-noise ratio of their spatial inputs. Moreover, the topology of the interactions facilitates linear decodability, making the information easy to read out by downstream circuits. These findings suggest that the efficient coding hypothesis is not applicable only to individual neuron properties in the sensory periphery, but also to neural interactions in the central brain.},
  author       = {Nardin, Michele and Csicsvari, Jozsef L and Tkačik, Gašper and Savin, Cristina},
  booktitle    = {bioRxiv},
  publisher    = {Cold Spring Harbor Laboratory},
  title        = {{The structure of hippocampal CA1 interactions optimizes spatial coding across experience}},
  doi          = {10.1101/2021.09.28.460602},
  year         = {2021},
}

@unpublished{10080,
  abstract     = {Hippocampal and neocortical neural activity is modulated by the position of the individual in space. While hippocampal neurons provide the basis for a spatial map, prefrontal cortical neurons generalize over environmental features. Whether these generalized representations result from a bidirectional interaction with, or are mainly derived from hippocampal spatial representations is not known. By examining simultaneously recorded hippocampal and medial prefrontal neurons, we observed that prefrontal spatial representations show a delayed coherence with hippocampal ones. We also identified subpopulations of cells in the hippocampus and medial prefrontal cortex that formed functional cross-area couplings; these resembled the optimal connections predicted by a probabilistic model of spatial information transfer and generalization. Moreover, cross-area couplings were strongest and had the shortest delay preceding spatial decision-making. Our results suggest that generalized spatial coding in the medial prefrontal cortex is inherited from spatial representations in the hippocampus, and that the routing of information can change dynamically with behavioral demands.},
  author       = {Nardin, Michele and Käfer, Karola and Csicsvari, Jozsef L},
  booktitle    = {bioRxiv},
  publisher    = {Cold Spring Harbor Laboratory},
  title        = {{The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus}},
  doi          = {10.1101/2021.09.30.462269},
  year         = {2021},
}

@phdthesis{10083,
  abstract     = {Plant motions occur across a wide spectrum of timescales, ranging from seed dispersal through bursting (milliseconds) and stomatal opening (minutes) to long-term adaptation of gross architecture. Relatively fast motions include water-driven growth as exemplified by root cell expansion under abiotic/biotic stresses or during gravitropism. A showcase is a root growth inhibition in 30 seconds triggered by the phytohormone auxin. However, the cellular and molecular mechanisms are still largely unknown. This thesis covers the studies about this topic as follows. By taking advantage of microfluidics combined with live imaging, pharmaceutical tools, and transgenic lines, we examined the kinetics of and causal relationship among various auxininduced rapid cellular changes in root growth, apoplastic pH, cytosolic Ca2+, cortical microtubule (CMT) orientation, and vacuolar morphology. We revealed that CMT reorientation and vacuolar constriction are the consequence of growth itself instead of responding directly to auxin. In contrast, auxin induces apoplast alkalinization to rapidly inhibit root growth in 30 seconds. This auxin-triggered apoplast alkalinization results from rapid H+- influx that is contributed by Ca2+ inward channel CYCLIC NUCLEOTIDE-GATED CHANNEL 14 (CNGC14)-dependent Ca2+ signaling. To dissect which auxin signaling mediates the rapid apoplast alkalinization, we
combined microfluidics and genetic engineering to verify that TIR1/AFB receptors conduct a non-transcriptional regulation on Ca2+ and H+ -influx. This non-canonical pathway is mostly mediated by the cytosolic portion of TIR1/AFB. On the other hand, we uncovered, using biochemical and phospho-proteomic analysis, that auxin cell surface signaling component TRANSMEMBRANE KINASE 1 (TMK1) plays a negative role during auxin-trigger apoplast
alkalinization and root growth inhibition through directly activating PM H+ -ATPases. Therefore, we discovered that PM H+ -ATPases counteract instead of mediate the auxintriggered rapid H+ -influx, and that TIR1/AFB and TMK1 regulate root growth antagonistically. This opposite effect of TIR1/AFB and TMK1 is consistent during auxin-induced hypocotyl elongation, leading us to explore the relation of two signaling pathways. Assisted with biochemistry and fluorescent imaging, we verified for the first time that TIR1/AFB and TMK1 can interact with each other. The ability of TIR1/AFB binding to membrane lipid provides a basis for the interaction of plasma membrane- and cytosol-localized proteins.
Besides, transgenic analysis combined with genetic engineering and biochemistry showed that  vi
they do function in the same pathway. Particularly, auxin-induced TMK1 increase is TIR1/AFB dependent, suggesting TIR1/AFB regulation on TMK1. Conversely, TMK1 also regulates TIR1/AFB protein levels and thus auxin canonical signaling. To follow the study of rapid growth regulation, we analyzed another rapid growth regulator, signaling peptide RALF1. We showed that RALF1 also triggers a rapid and reversible growth inhibition caused by H + influx, highly resembling but not dependent on auxin. Besides, RALF1 promotes auxin biosynthesis by increasing expression of auxin biosynthesis enzyme YUCCAs and thus induces auxin signaling in ca. 1 hour, contributing to the sustained RALF1-triggered growth inhibition. These studies collectively contribute to understanding rapid regulation on plant cell
growth, novel auxin signaling pathway as well as auxin-peptide crosstalk. },
  author       = {Li, Lanxin},
  issn         = {2663-337X},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Rapid cell growth regulation in Arabidopsis}},
  doi          = {10.15479/at:ista:10083},
  year         = {2021},
}

@unpublished{10095,
  abstract     = {Growth regulation tailors plant development to its environment. A showcase is response to gravity, where shoots bend up and roots down1. This paradox is based on opposite effects of the phytohormone auxin, which promotes cell expansion in shoots, while inhibiting it in roots via a yet unknown cellular mechanism2. Here, by combining microfluidics, live imaging, genetic engineering and phospho-proteomics in Arabidopsis thaliana, we advance our understanding how auxin inhibits root growth. We show that auxin activates two distinct, antagonistically acting signalling pathways that converge on the rapid regulation of the apoplastic pH, a causative growth determinant. Cell surface-based TRANSMEMBRANE KINASE1 (TMK1) interacts with and mediates phosphorylation and activation of plasma membrane H+-ATPases for apoplast acidification, while intracellular canonical auxin signalling promotes net cellular H+-influx, causing apoplast alkalinisation. The simultaneous activation of these two counteracting mechanisms poises the root for a rapid, fine-tuned growth modulation while navigating complex soil environment.},
  author       = {Li, Lanxin and Verstraeten, Inge and Roosjen, Mark and Takahashi, Koji and Rodriguez Solovey, Lesia and Merrin, Jack and Chen, Jian and Shabala, Lana and Smet, Wouter and Ren, Hong and Vanneste, Steffen and Shabala, Sergey and De Rybel, Bert and Weijers, Dolf and Kinoshita, Toshinori and Gray, William M. and Friml, Jiří},
  booktitle    = {Research Square},
  issn         = {2693-5015},
  title        = {{Cell surface and intracellular auxin signalling for H+-fluxes in root growth}},
  doi          = {10.21203/rs.3.rs-266395/v3},
  year         = {2021},
}

@article{10103,
  abstract     = {The small cellular molecule inositol hexakisphosphate (IP6) has been known for ~20 years to promote the in vitro assembly of HIV-1 into immature virus-like particles. However, the molecular details underlying this effect have been determined only recently, with the identification of the IP6 binding site in the immature Gag lattice. IP6 also promotes formation of the mature capsid protein (CA) lattice via a second IP6 binding site, and enhances core stability, creating a favorable environment for reverse transcription. IP6 also enhances assembly of other retroviruses, from both the Lentivirus and the Alpharetrovirus genera. These findings suggest that IP6 may have a conserved function throughout the family Retroviridae. Here, we discuss the different steps in the viral life cycle that are influenced by IP6, and describe in detail how IP6 interacts with the immature and mature lattices of different retroviruses.},
  author       = {Obr, Martin and Schur, Florian KM and Dick, Robert A.},
  issn         = {1999-4915},
  journal      = {Viruses},
  keywords     = {virology, infectious diseases},
  number       = {9},
  publisher    = {MDPI},
  title        = {{A structural perspective of the role of IP6 in immature and mature retroviral assembly}},
  doi          = {10.3390/v13091853},
  volume       = {13},
  year         = {2021},
}

@inproceedings{10108,
  abstract     = {We argue that the time is ripe to investigate differential monitoring, in which the specification of a program's behavior is implicitly given by a second program implementing the same informal specification. Similar ideas have been proposed before, and are currently implemented in restricted form for testing and specialized run-time analyses, aspects of which we combine. We discuss the challenges of implementing differential monitoring as a general-purpose, black-box run-time monitoring framework, and present promising results of a preliminary implementation, showing low monitoring overheads for diverse programs.},
  author       = {Mühlböck, Fabian and Henzinger, Thomas A},
  booktitle    = {International Conference on Runtime Verification},
  isbn         = {978-3-030-88493-2},
  issn         = {1611-3349},
  keywords     = {run-time verification, software engineering, implicit specification},
  location     = {Virtual},
  pages        = {231--243},
  publisher    = {Springer Nature},
  title        = {{Differential monitoring}},
  doi          = {10.1007/978-3-030-88494-9_12},
  volume       = {12974},
  year         = {2021},
}

@misc{10110,
  abstract     = {Pattern separation is a fundamental brain computation that converts small differences in input patterns into large differences in output patterns. Several synaptic mechanisms of pattern separation have been proposed, including code expansion, inhibition and plasticity; however, which of these mechanisms play a role in the entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation circuit, remains unclear. Here we show that a biologically realistic, full-scale EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator. Both external gamma-modulated inhibition and internal lateral inhibition mediated by PV+-INs substantially contributed to pattern separation. Both local connectivity and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness. Similarly, mossy fiber synapses with conditional detonator properties contributed to pattern separation. By contrast, perforant path synapses with Hebbian synaptic plasticity and direct EC–CA3 connection shifted the network towards pattern completion. Our results demonstrate that the specific properties of cells and synapses optimize higher-order computations in biological networks and might be useful to improve the deep learning capabilities of technical networks.},
  author       = {Guzmán, José and Schlögl, Alois and Espinoza Martinez, Claudia  and Zhang, Xiaomin and Suter, Benjamin and Jonas, Peter M},
  publisher    = {IST Austria},
  title        = {{How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network}},
  doi          = {10.15479/AT:ISTA:10110},
  year         = {2021},
}