@phdthesis{9056,
  abstract     = {In this thesis we study persistence of multi-covers of Euclidean balls and the geometric structures underlying their computation, in particular Delaunay mosaics and Voronoi tessellations. The k-fold cover for some discrete input point set consists of the space where at least k balls of radius r around the input points overlap. Persistence is a notion that captures, in some sense, the topology of the shape underlying the input. While persistence is usually computed for the union of balls, the k-fold cover is of interest as it captures local density,
and thus might approximate the shape of the input better if the input data is noisy. To compute persistence of these k-fold covers, we need a discretization that is provided by higher-order Delaunay mosaics. We present and implement a simple and efficient algorithm for the computation of higher-order Delaunay mosaics, and use it to give experimental results for their combinatorial properties. The algorithm makes use of a new geometric structure, the rhomboid tiling. It contains the higher-order Delaunay mosaics as slices, and by introducing a filtration
function on the tiling, we also obtain higher-order α-shapes as slices. These allow us to compute persistence of the multi-covers for varying radius r; the computation for varying k is less straight-foward and involves the rhomboid tiling directly. We apply our algorithms to experimental sphere packings to shed light on their structural properties. Finally, inspired by periodic structures in packings and materials, we propose and implement an algorithm for periodic Delaunay triangulations to be integrated into the Computational Geometry Algorithms Library (CGAL), and discuss the implications on persistence for periodic data sets.},
  author       = {Osang, Georg F},
  issn         = {2663-337X},
  pages        = {134},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Multi-cover persistence and Delaunay mosaics}},
  doi          = {10.15479/AT:ISTA:9056},
  year         = {2021},
}

@article{9121,
  abstract     = {We show that the energy gap for the BCS gap equation is
Ξ=μ(8e−2+o(1))exp(π2μ−−√a)
in the low density limit μ→0. Together with the similar result for the critical temperature by Hainzl and Seiringer (Lett Math Phys 84: 99–107, 2008), this shows that, in the low density limit, the ratio of the energy gap and critical temperature is a universal constant independent of the interaction potential V. The results hold for a class of potentials with negative scattering length a and no bound states.},
  author       = {Lauritsen, Asbjørn Bækgaard},
  issn         = {1573-0530},
  journal      = {Letters in Mathematical Physics},
  keywords     = {Mathematical Physics, Statistical and Nonlinear Physics},
  publisher    = {Springer Nature},
  title        = {{The BCS energy gap at low density}},
  doi          = {10.1007/s11005-021-01358-5},
  volume       = {111},
  year         = {2021},
}

@misc{9192,
  abstract     = {Here are the research data underlying the publication " Effects of fine-scale population structure on inbreeding in a long-term study of snapdragons (Antirrhinum majus)." Further information are summed up in the README document.},
  author       = {Surendranadh, Parvathy and Arathoon, Louise S and Baskett, Carina and Field, David and Pickup, Melinda and Barton, Nicholas H},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus}},
  doi          = {10.15479/AT:ISTA:9192},
  year         = {2021},
}

@misc{9323,
  abstract     = {This .zip File contains the data for figures presented in the main text and supplementary material of "A singlet triplet hole spin qubit in planar Ge" by D. Jirovec, et. al. The measurements were done using Labber Software and the data is stored in the hdf5 file format. The files can be opened using either the Labber Log Browser (https://labber.org/overview/) or Labber Python API (http://labber.org/online-doc/api/LogFile.html). A single file is acquired with QCodes and features the corresponding data type. XRD data are in .dat format and a code to open the data is provided. The code for simulations is as well provided in Python.},
  author       = {Jirovec, Daniel},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Research data for "A singlet-triplet hole spin qubit planar Ge"}},
  doi          = {10.15479/AT:ISTA:9323},
  year         = {2021},
}

@misc{9327,
  abstract     = {This archive contains the missing sweater mesh animations and displacement models for the code of "Mechanics-Aware Deformation of Yarn Pattern Geometry"

Code Repository: https://git.ist.ac.at/gsperl/MADYPG},
  author       = {Sperl, Georg and Narain, Rahul and Wojtan, Christopher J},
  publisher    = {IST Austria},
  title        = {{Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model Data)}},
  doi          = {10.15479/AT:ISTA:9327},
  year         = {2021},
}

@inproceedings{9356,
  abstract     = {In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision.},
  author       = {Henzinger, Thomas A and Sarac, Naci E},
  booktitle    = {Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science},
  location     = {Online},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Quantitative and approximate monitoring}},
  doi          = {10.1109/LICS52264.2021.9470547},
  year         = {2021},
}

@article{9387,
  abstract     = {We report the complete analysis of a deterministic model of deleterious mutations and negative selection against them at two haploid loci without recombination. As long as mutation is a weaker force than selection, mutant alleles remain rare at the only stable equilibrium, and otherwise, a variety of dynamics are possible. If the mutation-free genotype is absent, generally the only stable equilibrium is the one that corresponds to fixation of the mutant allele at the locus where it is less deleterious. This result suggests that fixation of a deleterious allele that follows a click of the Muller’s ratchet is governed by natural selection, instead of random drift.},
  author       = {Khudiakova, Kseniia and Neretina, Tatiana Yu. and Kondrashov, Alexey S.},
  issn         = {0022-5193},
  journal      = {Journal of Theoretical Biology},
  keywords     = {General Biochemistry, Genetics and Molecular Biology, Modelling and Simulation, Statistics and Probability, General Immunology and Microbiology, Applied Mathematics, General Agricultural and Biological Sciences, General Medicine},
  publisher    = {Elsevier },
  title        = {{Two linked loci under mutation-selection balance and Muller’s ratchet}},
  doi          = {10.1016/j.jtbi.2021.110729},
  volume       = {524},
  year         = {2021},
}

@misc{9389,
  abstract     = {This .zip File contains the transport data for  "Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states" by M. Valentini, et. al.  
The measurements were done using Labber Software and the data is stored in the hdf5 file format.
Instructions of how to read the data are in "Notebook_Valentini.pdf".},
  author       = {Valentini, Marco},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Research data for "Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states"}},
  doi          = {10.15479/AT:ISTA:9389},
  year         = {2021},
}

@phdthesis{9397,
  abstract     = {Accumulation of interstitial fluid (IF) between embryonic cells is a common phenomenon in vertebrate embryogenesis. Unlike other model systems, where these accumulations coalesce into a large central cavity – the blastocoel, in zebrafish, IF is more uniformly distributed between the deep cells (DC) before the onset of gastrulation. This is likely due to the presence of a large extraembryonic structure – the yolk cell (YC) at the position where the blastocoel typically forms in other model organisms. IF has long been speculated to play a role in tissue morphogenesis during embryogenesis, but direct evidence supporting such function is still sparse. Here we show that the relocalization of IF to the interface between the YC and DC/epiblast is critical for axial mesendoderm (ME) cell protrusion formation and migration along this interface, a key process in embryonic axis formation. We further demonstrate that axial ME cell migration and IF relocalization engage in a positive feedback loop, where axial ME migration triggers IF accumulation ahead of the advancing axial ME tissue by mechanically compressing the overlying epiblast cell layer. Upon compression, locally induced flow relocalizes the IF through the porous epiblast tissue resulting in an IF accumulation ahead of the leading axial ME. This IF accumulation, in turn, promotes cell protrusion formation and migration of the leading axial ME cells, thereby facilitating axial ME extension. Our findings reveal a central role of dynamic IF relocalization in orchestrating germ layer morphogenesis during gastrulation.},
  author       = {Huljev, Karla},
  issn         = {2663-337X},
  pages        = {101},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation}},
  doi          = {10.15479/at:ista:9397},
  year         = {2021},
}

@article{9402,
  abstract     = {Direct and indirect reciprocity are key mechanisms for the evolution of cooperation. Direct reciprocity means that individuals use their own experience to decide whether to cooperate with another person. Indirect reciprocity means that they also consider the experiences of others. Although these two mechanisms are intertwined, they are typically studied in isolation. Here, we introduce a mathematical framework that allows us to explore both kinds of reciprocity simultaneously. We show that the well-known ‘generous tit-for-tat’ strategy of direct reciprocity has a natural analogue in indirect reciprocity, which we call ‘generous scoring’. Using an equilibrium analysis, we characterize under which conditions either of the two strategies can maintain cooperation. With simulations, we additionally explore which kind of reciprocity evolves when members of a population engage in social learning to adapt to their environment. Our results draw unexpected connections between direct and indirect reciprocity while highlighting important differences regarding their evolvability.},
  author       = {Schmid, Laura and Chatterjee, Krishnendu and Hilbe, Christian and Nowak, Martin A.},
  issn         = {2397-3374},
  journal      = {Nature Human Behaviour},
  number       = {10},
  pages        = {1292–1302},
  publisher    = {Springer Nature},
  title        = {{A unified framework of direct and indirect reciprocity}},
  doi          = {10.1038/s41562-021-01114-8},
  volume       = {5},
  year         = {2021},
}

@inbook{9403,
  abstract     = {Optimal decision making requires individuals to know their available options and to anticipate correctly what consequences these options have. In many social interactions, however, we refrain from gathering all relevant information, even if this information would help us make better decisions and is costless to obtain. This chapter examines several examples of “deliberate ignorance.” Two simple models are proposed to illustrate how ignorance can evolve among self-interested and payoff - maximizing individuals, and open problems are highlighted that lie ahead for future research to explore.},
  author       = {Schmid, Laura and Hilbe, Christian},
  booktitle    = {Deliberate Ignorance: Choosing Not To Know},
  editor       = {Hertwig, Ralph and Engel, Christoph},
  isbn         = {978-0-262-04559-9},
  pages        = {139--152},
  publisher    = {MIT Press},
  title        = {{The evolution of strategic ignorance in strategic interaction}},
  volume       = {29},
  year         = {2021},
}

@misc{6995,
  abstract     = {Human brain organoids represent a powerful tool for the study of human neurological diseases particularly those that impact brain growth and structure. However, many neurological diseases lack obvious anatomical abnormalities, yet significantly impact neural network functions, raising the question of whether organoids possess sufficient neural network architecture and complexity to model these conditions. Here, we explore the network level functions of brain organoids using calcium sensor imaging and extracellular recording approaches that together reveal the existence of complex oscillatory network behaviors reminiscent of intact brain preparations. We further demonstrate strikingly abnormal epileptiform network activity in organoids derived from a Rett Syndrome patient despite only modest anatomical differences from isogenically matched controls, and rescue with an unconventional neuromodulatory drug Pifithrin-α. Together, these findings provide an essential foundation for the utilization of human brain organoids to study intact and disordered human brain network formation and illustrate their utility in therapeutic discovery.},
  author       = {Samarasinghe, Ranmal A. and Miranda, Osvaldo and Buth, Jessie E. and Mitchell, Simon and Ferando, Isabella and Watanabe, Momoko and Kurdian, Arinnae and Golshani, Peyman and Plath, Kathrin and Lowry, William E. and Parent, Jack M. and Mody, Istvan and Novitch, Bennett G.},
  issn         = {1546-1726},
  pages        = {32},
  publisher    = {Springer Nature},
  title        = {{Identification of neural oscillations and epileptiform changes in human brain organoids}},
  doi          = {10.1038/s41593-021-00906-5},
  volume       = {24},
  year         = {2021},
}

@unpublished{14278,
  abstract     = {The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely, integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of almost every ellipse that preserves integrability near the boundary, is itself an ellipse. We apply this result to study local spectral rigidity of ellipses using the connection between the wave trace of the Laplacian and the dynamics near the boundary and establish rigidity for almost all of them.},
  author       = {Koval, Illya},
  booktitle    = {arXiv},
  title        = {{Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse}},
  doi          = {10.48550/ARXIV.2111.12171},
  year         = {2021},
}

@phdthesis{10007,
  abstract     = {The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis.},
  author       = {Hensel, Sebastian},
  issn         = {2663-337X},
  pages        = {300},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Curvature driven interface evolution: Uniqueness properties of weak solution concepts}},
  doi          = {10.15479/at:ista:10007},
  year         = {2021},
}

@phdthesis{10030,
  abstract     = {This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning
non-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces.},
  author       = {Portinale, Lorenzo},
  issn         = {2663-337X},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Discrete-to-continuum limits of transport problems and gradient flows in the space of measures}},
  doi          = {10.15479/at:ista:10030},
  year         = {2021},
}

@phdthesis{10035,
  abstract     = {Many security definitions come in two flavors: a stronger “adaptive” flavor, where the adversary can arbitrarily make various choices during the course of the attack, and a weaker “selective” flavor where the adversary must commit to some or all of their choices a-priori. For example, in the context of identity-based encryption, selective security requires the adversary to decide on the identity of the attacked party at the very beginning of the game whereas adaptive security allows the attacker to first see the master public key and some secret keys before making this choice. Often, it appears to be much easier to achieve selective security than it is to achieve adaptive security. A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption [Pan07][FJP15], constrained PRFs [FKPR14], and Yao’s garbled circuits [JW16]. Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework (published at Crypto ’17 [JKK+17a]) that connects all of these works and allows us to present them in a unified and simplified fashion. Having the framework in place, we show how to achieve adaptive security for proxy re-encryption schemes (published at PKC ’19 [FKKP19]) and provide the first adaptive security proofs for continuous group key agreement protocols (published at S&P ’21 [KPW+21]). Questioning optimality of our framework, we then show that currently used proof techniques cannot lead to significantly better security guarantees for "graph-building" games (published at TCC ’21 [KKPW21a]). These games cover generalized selective decryption, as well as the security of prominent constructions for constrained PRFs, continuous group key agreement, and proxy re-encryption. Finally, we revisit the adaptive security of Yao’s garbled circuits and extend the analysis of Jafargholi and Wichs in two directions: While they prove adaptive security only for a modified construction with increased online complexity, we provide the first positive results for the original construction by Yao (published at TCC ’21 [KKP21a]). On the negative side, we prove that the results of Jafargholi and Wichs are essentially optimal by showing that no black-box reduction can provide a significantly better security bound (published at Crypto ’21 [KKPW21c]).},
  author       = {Klein, Karen},
  issn         = {2663-337X},
  pages        = {276},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{On the adaptive security of graph-based games}},
  doi          = {10.15479/at:ista:10035},
  year         = {2021},
}

@unpublished{10045,
  abstract     = {Given a fixed finite metric space (V,μ), the {\em minimum 0-extension problem}, denoted as 0-Ext[μ], is equivalent to the following optimization problem: minimize function of the form minx∈Vn∑ifi(xi)+∑ijcijμ(xi,xj) where cij,cvi are given nonnegative costs and fi:V→R are functions given by fi(xi)=∑v∈Vcviμ(xi,v). The computational complexity of 0-Ext[μ] has been recently established by Karzanov and by Hirai: if metric μ is {\em orientable modular} then 0-Ext[μ] can be solved in polynomial time, otherwise 0-Ext[μ] is NP-hard. To prove the tractability part, Hirai developed a theory of discrete convex functions on orientable modular graphs generalizing several known classes of functions in discrete convex analysis, such as L♮-convex functions. We consider a more general version of the problem in which unary functions fi(xi) can additionally have terms of the form cuv;iμ(xi,{u,v}) for {u,v}∈F, where set F⊆(V2) is fixed. We extend the complexity classification above by providing an explicit condition on (μ,F) for the problem to be tractable. In order to prove the tractability part, we generalize Hirai's theory and define a larger class of discrete convex functions. It covers, in particular, another well-known class of functions, namely submodular functions on an integer lattice. Finally, we improve the complexity of Hirai's algorithm for solving 0-Ext on orientable modular graphs.
},
  author       = {Dvorak, Martin and Kolmogorov, Vladimir},
  booktitle    = {arXiv},
  keywords     = {minimum 0-extension problem, metric labeling problem, discrete metric spaces, metric extensions, computational complexity, valued constraint satisfaction problems, discrete convex analysis, L-convex functions},
  title        = {{Generalized minimum 0-extension problem and discrete convexity}},
  doi          = {10.48550/arXiv.2109.10203},
  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{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},
}