@unpublished{18294,
  abstract     = {Using a two-dimensional version of the delta method, we establish an asymptotic formula for the number of rational points of bounded height on non-singular complete intersections of cubic and quadric hypersurfaces of dimension at least 23 over Fq(t), provided cha(Fq)>3. Under the same hypotheses, we also verify weak approximation.},
  author       = {Glas, Jakob},
  booktitle    = {arXiv},
  title        = {{Complete intersections of cubic and quadric hypersurfaces over Fq(t)}},
  doi          = {10.48550/arXiv.2306.02718},
  year         = {2023},
}

@misc{23142,
  abstract     = {It contains the benchmarks and the results of comparison between STORM, PET and MultiGain for the QComp category of Long-Run Average rewards.},
  author       = {Grover, Kush and Weiniger, Maximilian and Kretinsky, Jan},
  publisher    = {Zenodo},
  title        = {{QComp LRA results}},
  doi          = {10.5281/zenodo.8219190},
  year         = {2023},
}

@inproceedings{14417,
  abstract     = {Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective. This gives rise to an objective function that demands the control of systems in a risk-averse manner. We show that the resulting games are determined and, in particular, admit optimal memoryless deterministic strategies. This contrasts risk measures that previously have been considered in the special case of Markov decision processes and that require randomization and/or memory. We provide several results on the decidability and the computational complexity of the threshold problem, i.e. whether the optimal value of ERisk exceeds a given threshold. In the most general case, the problem is decidable subject to Shanuel’s conjecture. If all inputs are rational, the resulting threshold problem can be solved using algebraic numbers, leading to decidability via a polynomial-time reduction to the existential theory of the reals. Further restrictions on the encoding of the input allow the solution of the threshold problem in NP∩coNP. Finally, an approximation algorithm for the optimal value of ERisk is provided.},
  author       = {Baier, Christel and Chatterjee, Krishnendu and Meggendorfer, Tobias and Piribauer, Jakob},
  booktitle    = {48th International Symposium on Mathematical Foundations of Computer Science},
  isbn         = {9783959772921},
  issn         = {1868-8969},
  location     = {Bordeaux, France},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Entropic risk for turn-based stochastic games}},
  doi          = {10.4230/LIPIcs.MFCS.2023.15},
  volume       = {272},
  year         = {2023},
}

@inproceedings{19985,
  abstract     = {We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link (u, v) is determined by how much nodes u and v allocate for this link. Specifically, the input is a finite ordered sequence of packets that arrive in both directions along a link. Given (u, v) and a packet of weight x going from u to v, node u can either accept or reject the packet. If u accepts the packet, the capacity on link (u, v) decreases by x. Correspondingly, v’s capacity on (u, v) increases by x. If a node rejects the packet, this will entail a cost affinely linear in the weight of the packet. A link is “rechargeable” in the sense that the total capacity of the link has to remain constant, but the allocation of capacity at the ends of the link can depend arbitrarily on the nodes’ decisions. The goal is to minimise the sum of the capacity injected into the link and the cost of rejecting packets. We show that the problem is NP-hard, but can be approximated efficiently with a ratio of (1 + E) . (1 + square3) for some arbitrary E>0.},
  author       = {Schmid, Stefan and Svoboda, Jakub and Yeo, Michelle X},
  booktitle    = {30th International Colloquium on Structural Information and Communication Complexity},
  isbn         = {9783031327322},
  issn         = {1611-3349},
  location     = {Alcalá de Henares, Spain},
  pages        = {576--594},
  publisher    = {Springer Nature},
  title        = {{Weighted acket selection for rechargeable links in cryptocurrency networks: Complexity and approximation}},
  doi          = {10.1007/978-3-031-32733-9_26},
  volume       = {13892},
  year         = {2023},
}

@unpublished{17173,
  abstract     = {Consider the random variable $\mathrm{Tr}( f_1(W)A_1\dots f_k(W)A_k)$ where $W$ is an $N\times N$ Hermitian Wigner matrix, $k\in\mathbb{N}$, and choose (possibly $N$-dependent) regular functions $f_1,\dots, f_k$ as well as bounded deterministic matrices $A_1,\dots,A_k$. We give a functional central limit theorem showing that the fluctuations around the expectation are Gaussian. Moreover, we determine the limiting covariance structure and give explicit error bounds in terms of the scaling of $f_1,\dots,f_k$ and the number of traceless matrices among $A_1,\dots,A_k$, thus extending the results of [Cipolloni, Erdős, Schröder 2023] to products of arbitrary length $k\geq2$. As an application, we consider the fluctuation of $\mathrm{Tr}(\mathrm{e}^{\mathrm{i} tW}A_1\mathrm{e}^{-\mathrm{i} tW}A_2)$ around its thermal value $\mathrm{Tr}(A_1)\mathrm{Tr}(A_2)$ when $t$ is large and give an explicit formula for the variance.},
  author       = {Reker, Jana},
  booktitle    = {arXiv},
  title        = {{Multi-point functional central limit theorem for Wigner Matrices}},
  doi          = {10.48550/arXiv.2307.11028},
  year         = {2023},
}

@unpublished{17174,
  abstract     = {We prove that a class of weakly perturbed Hamiltonians of the form $H_λ= H_0 + λW$, with $W$ being a Wigner matrix, exhibits prethermalization. That is, the time evolution generated by $H_λ$ relaxes to its ultimate thermal state via an intermediate prethermal state with a lifetime of order $λ^{-2}$. Moreover, we obtain a general relaxation formula, expressing the perturbed dynamics via the unperturbed dynamics and the ultimate thermal state. The proof relies on a two-resolvent law for the deformed Wigner matrix $H_λ$.},
  author       = {Erdös, László and Henheik, Sven Joscha and Reker, Jana and Riabov, Volodymyr},
  booktitle    = {arXiv},
  title        = {{Prethermalization for deformed Wigner Matrices}},
  doi          = {10.48550/arXiv.2310.06677},
  year         = {2023},
}

@inproceedings{14922,
  abstract     = {We propose a novel approach to concentration for non-independent random variables. The main idea is to ``pretend'' that the random variables are independent and pay a multiplicative price measuring how far they are from actually being independent. This price is encapsulated in the Hellinger integral between the joint and the product of the marginals, which is then upper bounded leveraging tensorisation properties. Our bounds represent a natural generalisation of concentration inequalities in the presence of dependence: we recover exactly the classical bounds (McDiarmid's inequality) when the random variables are independent. Furthermore, in a ``large deviations'' regime, we obtain the same decay in the probability as for the independent case, even when the random variables display non-trivial dependencies. To show this, we consider a number of applications of interest. First, we provide a bound for Markov chains with finite state space. Then, we consider the Simple Symmetric Random Walk, which is a non-contracting Markov chain, and a non-Markovian setting in which the stochastic process depends on its entire past. To conclude, we propose an application to Markov Chain Monte Carlo methods, where our approach leads to an improved lower bound on the minimum burn-in period required to reach a certain accuracy. In all of these settings, we provide a regime of parameters in which our bound fares better than what the state of the art can provide.},
  author       = {Esposito, Amedeo Roberto and Mondelli, Marco},
  booktitle    = {Proceedings of 2023 IEEE International Symposium on Information Theory},
  issn         = {2157-8117},
  location     = {Taipei, Taiwan},
  pages        = {400--405},
  publisher    = {IEEE},
  title        = {{Concentration without independence via information measures}},
  doi          = {10.1109/isit54713.2023.10206899},
  year         = {2023},
}

@inproceedings{14083,
  abstract     = {In this work we consider the list-decodability and list-recoverability of arbitrary q-ary codes, for all integer values of q ≥ 2. A code is called (p,L)_q-list-decodable if every radius pn Hamming ball contains less than L codewords; (p,𝓁,L)_q-list-recoverability is a generalization where we place radius pn Hamming balls on every point of a combinatorial rectangle with side length 𝓁 and again stipulate that there be less than L codewords.
Our main contribution is to precisely calculate the maximum value of p for which there exist infinite families of positive rate (p,𝓁,L)_q-list-recoverable codes, the quantity we call the zero-rate threshold. Denoting this value by p_*, we in fact show that codes correcting a p_*+ε fraction of errors must have size O_ε(1), i.e., independent of n. Such a result is typically referred to as a "Plotkin bound." To complement this, a standard random code with expurgation construction shows that there exist positive rate codes correcting a p_*-ε fraction of errors. We also follow a classical proof template (typically attributed to Elias and Bassalygo) to derive from the zero-rate threshold other tradeoffs between rate and decoding radius for list-decoding and list-recovery.
Technically, proving the Plotkin bound boils down to demonstrating the Schur convexity of a certain function defined on the q-simplex as well as the convexity of a univariate function derived from it. We remark that an earlier argument claimed similar results for q-ary list-decoding; however, we point out that this earlier proof is flawed.},
  author       = {Resch, Nicolas and Yuan, Chen and Zhang, Yihan},
  booktitle    = {50th International Colloquium on Automata, Languages, and Programming},
  isbn         = {9783959772785},
  issn         = {1868-8969},
  location     = {Paderborn, Germany},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery}},
  doi          = {10.4230/LIPIcs.ICALP.2023.99},
  volume       = {261},
  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{13236,
  abstract     = {We present an auction algorithm using multiplicative instead of constant weight updates to compute a (1−ε)-approximate maximum weight matching (MWM) in a bipartite graph with n vertices and m edges in time O(mε−1log(ε−1)), matching the running time of the linear-time approximation algorithm of Duan and Pettie [JACM ’14]. Our algorithm is very simple and it can be extended to give a dynamic data structure that maintains a (1−ε)-approximate maximum weight matching under (1) one-sided vertex deletions (with incident edges) and (2) one-sided vertex insertions (with incident edges sorted by weight) to the other side. The total time time used is O(mε−1log(ε−1)), where m is the sum of the number of initially existing and inserted edges.},
  author       = {Zheng, Da Wei and Henzinger, Monika H},
  booktitle    = {International Conference on Integer Programming and Combinatorial Optimization},
  isbn         = {9783031327254},
  issn         = {1611-3349},
  location     = {Madison, WI, United States},
  pages        = {453--465},
  publisher    = {Springer Nature},
  title        = {{Multiplicative auction algorithm for approximate maximum weight bipartite matching}},
  doi          = {10.1007/978-3-031-32726-1_32},
  volume       = {13904},
  year         = {2023},
}

@misc{22867,
  abstract     = {The impact of ongoing climate change on populations will be contingent upon their contemporary adaptive evolution. In this study, we investigated the contemporary evolution of four populations of the cold-water kelp Laminaria digitata by analysing their spatial and temporal genomic variation using ddRAD-sequencing. These populations were sampled from the center to the southern margin of its north-eastern Atlantic distribution at two-time points, spanning at least two generations. Through genome scans for local adaptation at a single time point, we identified candidate loci that showed clinal variation correlated with changes in sea surface temperature (SST) along latitudinal gradients. This finding suggests that SST may drive the adaptive response of these kelp populations, although factors such as species' demographic history should also be considered. Additionally, we performed a simulation approach to distinguish the effect of selection from genetic drift in allele frequency changes over time. This enabled the detection of loci in the southernmost population that exhibited temporal differentiation beyond what would be expected from genetic drift alone: these are candidate loci which could have evolved under selection over time. In contrast, we did not detect any outlier locus based on temporal differentiation in the population from the North Sea, which also displayed low and decreasing levels of genetic diversity. The diverse evolutionary scenarios observed among populations can be attributed to variations in the prevalence of selection relative to genetic drift across different environments. Therefore, our study highlights the potential of temporal genomics to offer valuable insights into the contemporary evolution of marine foundation species facing climate change.},
  author       = {Reynes, Lauric},
  publisher    = {Repository},
  title        = {{Genomic datasets of Laminaria digitata: Paired-end reads from dd-RADseq, reference genome assembly and filtered VCF}},
  doi          = {10.5061/dryad.tb2rbp064},
  year         = {2023},
}

@misc{22868,
  author       = {Pal, Arka and Mihir, Joshi and Thaker, Maria},
  publisher    = {Repository},
  title        = {{Raw data for: Too much information? Males convey parasite levels using more signal modalities than females utilise.}},
  doi          = {10.5281/zenodo.10423539},
  year         = {2023},
}

@unpublished{14732,
  abstract     = {Fragmented landscapes pose a significant threat to the persistence of species as they are highly susceptible to heightened risk of extinction due to the combined effects of genetic and demographic factors such as genetic drift and demographic stochasticity. This paper explores the intricate interplay between genetic load and extinction risk within metapopulations with a focus on understanding the impact of eco-evolutionary feedback mechanisms. We distinguish between two models of selection: soft selection, characterised by subpopulations maintaining carrying capacity despite load, and hard selection, where load can significantly affect population size. Within the soft selection framework, we investigate the impact of gene flow on genetic load at a single locus, while also considering the effect of selection strength and dominance coefficient. We subsequently build on this to examine how gene flow influences both population size and load under hard selection as well as identify critical thresholds for metapopulation persistence. Our analysis employs the diffusion, semi-deterministic and effective migration approximations. Our findings reveal that under soft selection, even modest levels of migration can significantly alleviate the burden of load. In sharp contrast, with hard selection, a much higher degree of gene flow is required to mitigate load and prevent the collapse of the metapopulation. Overall, this study sheds light into the crucial role migration plays in shaping the dynamics of genetic load and extinction risk in fragmented landscapes, offering valuable insights for conservation strategies and the preservation of diversity in a changing world.},
  author       = {Olusanya, Oluwafunmilola O and Khudiakova, Kseniia and Sachdeva, Himani},
  booktitle    = {bioRxiv},
  title        = {{Genetic load, eco-evolutionary feedback and extinction in a metapopulation}},
  doi          = {10.1101/2023.12.02.569702},
  year         = {2023},
}

@misc{14812,
  abstract     = {This repository contains the code and VCF files needed to conduct the analyses in our MS. Each folder contains a readMe document explaining the nature of each file and dataset and the results and analyses that they relate to. The same anlaysis code (but not VCF files) is also available at https://github.com/seanstankowski/Littorina_reproductive_mode},
  author       = {Stankowski, Sean},
  publisher    = {Zenodo},
  title        = {{Data and code for: The genetic architecture of a recent transition to live-bearing in marine snails}},
  doi          = {10.5281/ZENODO.8318995},
  year         = {2023},
}

@misc{13126,
  abstract     = {Mapping the complex and dense arrangement of cells and their connectivity in brain tissue demands nanoscale spatial resolution imaging. Super-resolution optical microscopy excels at visualizing specific molecules and individual cells but fails to provide tissue context. Here, we developed Comprehensive Analysis of Tissues across Scales (CATS), a technology to densely map brain tissue architecture from millimeter regional to nanometer synaptic scales in diverse chemically fixed brain preparations, including rodent and human. CATS uses fixation-compatible extracellular labeling and optical imaging, including stimulated emission depletion or expansion microscopy, to comprehensively delineate cellular structures. It enables three-dimensional reconstruction of single synapses and mapping of synaptic connectivity by identification and analysis of putative synaptic cleft regions. Applying CATS to the mouse hippocampal mossy fiber circuitry, we reconstructed and quantified the synaptic input and output structure of identified neurons. We furthermore demonstrate applicability to clinically derived human tissue samples, including formalin-fixed paraffin-embedded routine diagnostic specimens, for visualizing the cellular architecture of brain tissue in health and disease.},
  author       = {Danzl, Johann G},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Research data for the publication "Imaging brain tissue architecture across millimeter to nanometer scales"}},
  doi          = {10.15479/AT:ISTA:13126},
  year         = {2023},
}

@misc{13173,
  abstract     = {GABAB receptor (GBR) activation inhibits neurotransmitter release in axon terminals in the brain, except in medial habenula (MHb) terminals, which show robust potentiation. However, mechanisms underlying this enigmatic potentiation remain elusive. Here, we report that GBR activation on MHb terminals induces an activity-dependent transition from a facilitating, tonic to a depressing, phasic neurotransmitter release mode. This transition is accompanied by a 4.1-fold increase in readily releasable vesicle pool (RRP) size and a 3.5-fold increase of docked synaptic vesicles at the presynaptic active zone (AZ). Strikingly, tonic and phasic release exhibit distinct coupling distances and are selectively affected by deletion of synaptoporin (SPO) and Ca2+-dependent activator protein for secretion 2 (CAPS2), respectively. SPO modulates augmentation, the short-term plasticity associated with tonic release, and CAPS2 retains the increased RRP for initial responses in phasic response trains. Double pre-embedding immunolabeling confirmed the co-localization of CAPS2 and SPO inside the same terminal. The cytosolic protein CAPS2 showed a synaptic vesicle (SV)-associated distribution similar to the vesicular transmembrane protein SPO. A newly developed “Flash and Freeze-fracture” method revealed the release of SPO-associated vesicles in both tonic and phasic modes and activity-dependent recruitment of CAPS2 to the AZ during phasic release, which lasted several minutes. Overall, these results indicate that GBR activation translocates CAPS2 to the AZ along with the fusion of CAPS2-associated SVs, contributing to a persistent RRP increase. Thus, we discovered structural and molecular mechanisms underlying tonic and phasic neurotransmitter release and their transition by GBR activation in MHb terminals.},
  author       = {Shigemoto, Ryuichi},
  keywords     = {medial habenula, GABAB receptor, vesicle release, Flash and Freeze, Flash and Freeze-fracture},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Transition from tonic to phasic neurotransmitter release by presynaptic GABAB receptor activation in medial habenula terminals}},
  doi          = {10.15479/AT:ISTA:13173},
  year         = {2023},
}

@misc{14892,
  abstract     = {Code and data necessary to reproduce the simulations and data analyses reported in our manuscript: Tomé, D.F., Zhang, Y., Aida, T., Mosto, O., Lu, Y., Chen, M., Sadeh, S., Roy, D. S., Clopath, C. Dynamic and selective engrams emerge with memory consolidation. 2023.},
  author       = {Feitosa Tomé, Douglas},
  publisher    = {Zenodo},
  title        = {{douglastome/dynamic-engrams: Dynamic and selective engrams emerge with memory consolidation}},
  doi          = {10.5281/ZENODO.10251087},
  year         = {2023},
}

@misc{23183,
  abstract     = {Cooperative verification is gaining momentum in recent years.  The usual setup in cooperative verification is that verifier A is run with some pre-defined resources, and if it is not able to verify the program, the verification task is passed to verifier B together with information learned about the program by the verifier A, then the chain can continue to verifier C, and so on. This scheme, which is employed by most of cooperative verification tools, is static and sequential: tools run one after another in a fixed pre-defined order and fixed parameters and resource limits.

Bubaak is a portfolio-based program analysis tool for verification of C programs that run multiple program verifiers in parallel and allows to exchange verification artifacts between them on run-time. Moreover, the new version of Bubaak allows to combine sequential and parallel portfolios into workflows. In brief, one or more verification tasks are initially started and each of the tasks, when it is done (e.g., because of hitting a time limit or finishing its job), can rewrite itself into a new task or generate a set of new verification tasks. This all happens dynamically based on the result of the task that finished.

This artifact contains Bubaak and Bubaak-SpLit (which is a specific configuration for Bubaak) that competed in SV-COMP 2024.},
  author       = {Chalupa, Marek},
  publisher    = {Zenodo},
  title        = {{Bubaak at SV-COMP 2024}},
  doi          = {10.5281/zenodo.10065866},
  year         = {2023},
}

@phdthesis{12491,
  abstract     = {The extracellular matrix (ECM) is a hydrated and complex three-dimensional network consisting of proteins, polysaccharides, and water. It provides structural scaffolding for the cells embedded within it and is essential in regulating numerous physiological processes, including cell migration and proliferation, wound healing, and stem cell fate. 
Despite extensive study, detailed structural knowledge of ECM components in physiologically relevant conditions is still rudimentary. This is due to methodological limitations in specimen preparation protocols which are incompatible with keeping large samples, such as the ECM, in their native state for subsequent imaging. Conventional electron microscopy (EM) techniques rely on fixation, dehydration, contrasting, and sectioning. This results in the alteration of a highly hydrated environment and the potential introduction of artifacts. Other structural biology techniques, such as nuclear magnetic resonance (NMR) spectroscopy and X-ray crystallography, allow high-resolution analysis of protein structures but only work on homogenous and purified samples, hence lacking contextual information. Currently, no approach exists for the ultrastructural and structural study of extracellular components under native conditions in a physiological, 3D environment. 
In this thesis, I have developed a workflow that allows for the ultrastructural analysis of the ECM in near-native conditions at molecular resolution. The developments I introduced include implementing a novel specimen preparation workflow for cell-derived matrices (CDMs) to render them compatible with ion-beam milling and subsequent high-resolution cryo-electron tomography (ET). 
To this end, I have established protocols to generate CDMs grown over several weeks on EM grids that are compatible with downstream cryo-EM sample preparation and imaging techniques. Characterization of these ECMs confirmed that they contain essential ECM components such as collagen I, collagen VI, and fibronectin I in high abundance and hence represent a bona fide biologically-relevant sample. I successfully optimized vitrification of these specimens by testing various vitrification techniques and cryoprotectants. 
In order to obtain high-resolution molecular insights into the ultrastructure and organization of CDMs, I established cryo-focused ion beam scanning electron microscopy (FIBSEM) on these challenging and complex specimens. I explored different approaches for the creation of thin cryo-lamellae by FIB milling and succeeded in optimizing the cryo-lift-out technique, resulting in high-quality lamellae of approximately 200 nm thickness. 
High-resolution Cryo-ET of these lamellae revealed for the first time the architecture of native CDM in the context of matrix-secreting cells. This allowed for the in situ visualization of fibrillar matrix proteins such as collagen, laying the foundation for future structural and ultrastructural characterization of these proteins in their near-native environment. 
In summary, in this thesis, I present a novel workflow that combines state-of-the-art cryo-EM specimen preparation and imaging technologies to permit characterization of the ECM, an important tissue component in higher organisms. This innovative and highly versatile workflow will enable addressing far-reaching questions on ECM architecture, composition, and reciprocal ECM-cell interactions.},
  author       = {Zens, Bettina},
  isbn         = {978-3-99078-027-5},
  issn         = {2663-337X},
  keywords     = {cryo-EM, cryo-ET, FIB milling, method development, FIBSEM, extracellular matrix, ECM, cell-derived matrices, CDMs, cell culture, high pressure freezing, HPF, structural biology, tomography, collagen},
  pages        = {187},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Ultrastructural characterization of natively preserved extracellular matrix by cryo-electron tomography}},
  doi          = {10.15479/at:ista:12491},
  year         = {2023},
}