@article{10335,
abstract = {Van der Holst and Pendavingh introduced a graph parameter σ, which coincides with the more famous Colin de Verdière graph parameter μ for small values. However, the definition of a is much more geometric/topological directly reflecting embeddability properties of the graph. They proved μ(G) ≤ σ(G) + 2 and conjectured σ(G) ≤ σ(G) for any graph G. We confirm this conjecture. As far as we know, this is the first topological upper bound on σ(G) which is, in general, tight.
Equality between μ and σ does not hold in general as van der Holst and Pendavingh showed that there is a graph G with μ(G) ≤ 18 and σ(G) ≥ 20. We show that the gap appears at much smaller values, namely, we exhibit a graph H for which μ(H) ≥ 7 and σ(H) ≥ 8. We also prove that, in general, the gap can be large: The incidence graphs Hq of finite projective planes of order q satisfy μ(Hq) ∈ O(q3/2) and σ(Hq) ≥ q2.},
author = {Kaluza, Vojtech and Tancer, Martin},
issn = {0209-9683},
journal = {Combinatorica},
pages = {1317--1345},
publisher = {Springer Nature},
title = {{Even maps, the Colin de Verdière number and representations of graphs}},
doi = {10.1007/s00493-021-4443-7},
volume = {42},
year = {2022},
}
@article{10364,
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/μ + N/P log2 log2 N/P), where N is the block length of the code and μ is the scaling exponent of the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P = N/2, the latency of SSC decoding is O(N1-1/μ), which is sublinear in the block length. This recovers a result from our earlier work. Second, in a fully-serial implementation where P = 1, the latency of SSC decoding scales as O(N log2 log2 N). The multiplicative constant is also calculated: we show that the latency of SSC decoding when P = 1 is given by (2 + o(1))N log2 log2 N. 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},
issn = {1558-2248},
journal = {IEEE Transactions on Wireless Communications},
number = {6},
pages = {3909--3920},
publisher = {Institute of Electrical and Electronics Engineers},
title = {{Parallelism versus latency in simplified successive-cancellation decoding of polar codes}},
doi = {10.1109/TWC.2021.3125626},
volume = {21},
year = {2022},
}
@article{10413,
abstract = {Motivated by the recent introduction of the intrinsic semilattice entropy, we study generalized quasi-metric semilattices and their categories. We investigate the relationship between these objects and generalized semivaluations, extending Nakamura and Schellekens' approach. Finally, we use this correspondence to compare the intrinsic semilattice entropy and the semigroup entropy induced in particular situations, like sets, torsion abelian groups and vector spaces.},
author = {Dikranjan, Dikran and Giordano Bruno, Anna and Künzi, Hans Peter and Zava, Nicolò and Toller, Daniele},
issn = {0166-8641},
journal = {Topology and its Applications},
publisher = {Elsevier},
title = {{Generalized quasi-metric semilattices}},
doi = {10.1016/j.topol.2021.107916},
volume = {309},
year = {2022},
}
@article{10530,
abstract = {Cell dispersion from a confined area is fundamental in a number of biological processes,
including cancer metastasis. To date, a quantitative understanding of the interplay of single
cell motility, cell proliferation, and intercellular contacts remains elusive. In particular, the role
of E- and N-Cadherin junctions, central components of intercellular contacts, is still
controversial. Combining theoretical modeling with in vitro observations, we investigate the
collective spreading behavior of colonies of human cancer cells (T24). The spreading of these
colonies is driven by stochastic single-cell migration with frequent transient cell-cell contacts.
We find that inhibition of E- and N-Cadherin junctions decreases colony spreading and average
spreading velocities, without affecting the strength of correlations in spreading velocities of
neighboring cells. Based on a biophysical simulation model for cell migration, we show that the
behavioral changes upon disruption of these junctions can be explained by reduced repulsive
excluded volume interactions between cells. This suggests that in cancer cell migration,
cadherin-based intercellular contacts sharpen cell boundaries leading to repulsive rather than
cohesive interactions between cells, thereby promoting efficient cell spreading during collective
migration.
},
author = {Zisis, Themistoklis and Brückner, David and Brandstätter, Tom and Siow, Wei Xiong and d’Alessandro, Joseph and Vollmar, Angelika M. and Broedersz, Chase P. and Zahler, Stefan},
issn = {0006-3495},
journal = {Biophysical Journal},
keywords = {Biophysics},
number = {1},
pages = {P44--60},
publisher = {Elsevier},
title = {{Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration}},
doi = {10.1016/j.bpj.2021.12.006},
volume = {121},
year = {2022},
}
@article{10537,
abstract = {We consider the quantum many-body evolution of a homogeneous Fermi gas in three dimensions in the coupled semiclassical and mean-field scaling regime. We study a class of initial data describing collective particle–hole pair excitations on the Fermi ball. Using a rigorous version of approximate bosonization, we prove that the many-body evolution can be approximated in Fock space norm by a quasi-free bosonic evolution of the collective particle–hole excitations.},
author = {Benedikter, Niels P and Nam, Phan Thành and Porta, Marcello and Schlein, Benjamin and Seiringer, Robert},
issn = {1424-0637},
journal = {Annales Henri Poincaré},
number = {5},
pages = {1725--1764},
publisher = {Springer Nature},
title = {{Bosonization of fermionic many-body dynamics}},
doi = {10.1007/s00023-021-01136-y},
volume = {23},
year = {2022},
}
@article{10547,
abstract = {We establish global-in-time existence results for thermodynamically consistent reaction-(cross-)diffusion systems coupled to an equation describing heat transfer. Our main interest is to model species-dependent diffusivities,
while at the same time ensuring thermodynamic consistency. A key difficulty of the non-isothermal case lies in the intrinsic presence of cross-diffusion type phenomena like the Soret and the Dufour effect: due to the temperature/energy dependence of the thermodynamic equilibria, a nonvanishing temperature gradient may drive a concentration flux even in a situation with constant concentrations; likewise, a nonvanishing concentration gradient may drive a heat flux even in a case of spatially constant temperature. We use time discretisation and regularisation techniques and derive a priori estimates based on a suitable entropy and the associated entropy production. Renormalised solutions are used in cases where non-integrable diffusion fluxes or reaction terms appear.},
author = {Fischer, Julian L and Hopf, Katharina and Kniely, Michael and Mielke, Alexander},
issn = {0036-1410},
journal = {SIAM Journal on Mathematical Analysis},
keywords = {Energy-Reaction-Diffusion Systems, Cross Diffusion, Global-In-Time Existence of Weak/Renormalised Solutions, Entropy Method, Onsager System, Soret/Dufour Effect},
number = {1},
pages = {220--267},
publisher = {Society for Industrial and Applied Mathematics},
title = {{Global existence analysis of energy-reaction-diffusion systems}},
doi = {10.1137/20M1387237},
volume = {54},
year = {2022},
}
@article{10548,
abstract = {Consider a linear elliptic partial differential equation in divergence form with a random coefficient field. The solution operator displays fluctuations around its expectation. The recently developed pathwise theory of fluctuations in stochastic homogenization reduces the characterization of these fluctuations to those of the so-called standard homogenization commutator. In this contribution, we investigate the scaling limit of this key quantity: starting
from a Gaussian-like coefficient field with possibly strong correlations, we establish the convergence of the rescaled commutator to a fractional Gaussian field, depending on the decay of correlations of the coefficient field, and we
investigate the (non)degeneracy of the limit. This extends to general dimension $d\ge1$ previous results so far limited to dimension $d=1$, and to the continuum setting with strong correlations recent results in the discrete iid case.},
author = {Duerinckx, Mitia and Fischer, Julian L and Gloria, Antoine},
issn = {1050-5164},
journal = {Annals of applied probability},
number = {2},
pages = {1179--1209},
publisher = {Institute of Mathematical Statistics},
title = {{Scaling limit of the homogenization commutator for Gaussian coefficient fields}},
doi = {10.1214/21-AAP1705},
volume = {32},
year = {2022},
}
@article{21078,
abstract = {The ease with which racemic mixtures crystallize compared with the equivalent chiral systems is routinely taken advantage of to produce crystals of small molecules. However, biological macromolecules such as DNA and proteins are naturally chiral, and thus the limited range of chiral space groups available hampers the crystallization of such molecules. Inspiring work over the past 15 years has shown that racemic mixtures of proteins, which were made possible by impressive advances in protein chemical synthesis, can indeed improve the success rate of protein crystallization experiments. More recently, the racemic crystallization approach was extended to include nucleic acids as a possible aid in the determination of enantiopure DNA crystal structures. Here, findings are reported that suggest that the benefits may extend beyond this. Two racemic crystal structures of the DNA sequence d(CCCGGG) are described which were found to fold into A-form DNA. This form differs from the Z-form DNA conformation adopted by the chiral equivalent in the solid state, suggesting that the use of racemates may also favour the emergence of new conformations. Importantly, the racemic mixture forms interactions in the solid state that differ from the chiral equivalent (including the formation of racemic pseudo-helices), suggesting that the use of racemic DNA mixtures could provide new possibilities for the design of precise self-assembled nanomaterials and nanostructures.},
author = {Mandal, Pradeep K and Collie, Gavin W. and Kauffmann, Brice and Huc, Ivan},
issn = {2059-7983},
journal = {Acta Crystallographica Section D Structural Biology},
number = {6},
pages = {709--715},
publisher = {International Union of Crystallography},
title = {{Racemic crystal structures of A-DNA duplexes}},
doi = {10.1107/s2059798322003928},
volume = {78},
year = {2022},
}
@article{21079,
abstract = {AbstractA series of aromatic oligoamide foldamer sequences containing different proportions of three δ‐amino acids derived from quinoline, pyridine, and benzene and possessing varying flexibility, for example due to methylene bridges, were synthesized. Crystallographic structures of two key sequences and 1H NMR data in water concur to show that a canonical aromatic helix fold prevails in almost all cases and that helix stability critically depends on the ratio between rigid and flexible units. Notwithstanding subtle variations of curvature, i. e. the numbers of units per turn, the aromatic δ‐peptide helix is therefore shown to be general and tolerant of a great number of sp3 centers. We also demonstrate canonical helical folding upon alternating two monomers that do not promote folding when taken separately: folding occurs with two methylenes between every other unit, not with one methylene between every unit. These findings highlight that a fine‐tuning of helix handedness inversion kinetics, curvature, and side chain positioning in aromatic δ‐peptidic foldamers can be realized by systematically combining different yet compatible δ‐amino acids.},
author = {Bindl, Daniel and Mandal, Pradeep K and Huc, Ivan},
issn = {1521-3765},
journal = {Chemistry – A European Journal},
number = {31},
publisher = {Wiley},
title = {{Generalizing the aromatic δ‐amino acid foldamer helix}},
doi = {10.1002/chem.202200538},
volume = {28},
year = {2022},
}
@article{21080,
abstract = {Tight binding was observed between the C‐terminal cross section of aromatic oligoamide helices in aqueous solution, leading to the formation of discrete head‐to‐head dimers in slow exchange on the NMR timescale with the corresponding monomers. The nature and structure of the dimers was evidenced by 2D NOESY and DOSY spectroscopy, mass spectrometry and X‐ray crystallography. The binding interface involves a large hydrophobic aromatic surface and hydrogen bonding. Dimerization requires that helices have the same handedness and the presence of a C‐terminal carboxy function. The protonation state of the carboxy group plays a crucial role, resulting in pH dependence of the association. Dimerization is also influenced by neighboring side chains and can be programmed to selectively produce heteromeric aggregates.},
author = {Bindl, Daniel and Mandal, Pradeep K and Allmendinger, Lars and Huc, Ivan},
issn = {1521-3773},
journal = {Angewandte Chemie International Edition},
number = {11},
publisher = {Wiley},
title = {{Discrete stacked dimers of aromatic oligoamide helices}},
doi = {10.1002/anie.202116509},
volume = {61},
year = {2022},
}
@misc{17057,
abstract = {Martin Loose studied chemistry at the University of Heidelberg, Germany. He then joined Petra Schwille's group at the Max Planck Institute of Molecular Cell Biology and Genetics in Dresden, where he obtained his PhD degree in 2010 for work on self-organization and pattern formation in the bacterial Min protein system. He then moved to Tim Mitchison's lab at Harvard Medical School, Boston, USA for his postdoc, funded by Human Frontier Science Program (HSFP) and European Molecular Biology Organization (EMBO) long-term fellowships; there, he discovered that the bacterial cell division proteins FtsA and FtsZ self-organize into dynamic cytoskeletal patterns. Martin established his independent research group at the Institute of Science and Technology (IST) Austria in 2015, supported by an European Research Council (ERC) starting grant and HFSP Young Investigator Grant. His lab studies the self-organization of bacterial cell division and small GTPase networks.},
author = {Loose, Martin},
booktitle = {Journal of Cell Science},
issn = {1477-9137},
number = {2},
publisher = {The Company of Biologists},
title = {{Cell scientist to watch – Martin Loose}},
doi = {10.1242/jcs.259715},
volume = {135},
year = {2022},
}
@article{17058,
abstract = {We compare the Manin-type conjecture for Campana points recently formulated by Pieropan, Smeets, Tanimoto and Várilly-Alvarado with an alternative prediction of Browning and Van Valckenborgh in the special case of the orbifold (P1,D), where D=1/2[0]+1/2[1]+1/2[∞]. We find that the two predicted leading constants do not agree, and we discuss whether thin sets could explain this discrepancy. Motivated by this, we provide a counterexample to the Manin-type conjecture for Campana points, by considering orbifolds corresponding to squareful values of binary quadratic forms.},
author = {Shute, Alec L},
issn = {1730-6264},
journal = {Acta Arithmetica},
number = {4},
pages = {317--346},
publisher = {Institute of Mathematics},
title = {{On the leading constant in the Manin-type conjecture for Campana points}},
doi = {10.4064/aa210430-1-7},
volume = {204},
year = {2022},
}
@inproceedings{17059,
abstract = {The recent focus on the efficiency of deep neural networks (DNNs) has led to significant work on model compression approaches, of which weight pruning is one of the most popular. At the same time, there is rapidly-growing computational support for efficiently executing the unstructured-sparse models obtained via pruning. Yet, most existing pruning methods minimize just the number of remaining weights, i.e. the size of the model, rather than optimizing for inference time. We address this gap by introducing SPDY, a new compression method which automatically determines layer-wise sparsity targets achieving a desired inference speedup on a given system, while minimizing accuracy loss. SPDY is the composition of two new techniques. The first is an efficient and general dynamic programming algorithm for solving constrained layer-wise compression problems, given a set of layer-wise error scores. The second technique is a local search procedure for automatically determining such scores in an accurate and robust manner. Experiments across popular vision and language models show that SPDY guarantees speedups while recovering higher accuracy relative to existing strategies, both for one-shot and gradual pruning scenarios, and is compatible with most existing pruning approaches. We also extend our approach to the recently-proposed task of pruning with very little data, where we achieve the best known accuracy recovery when pruning to the GPU-supported 2:4 sparsity pattern.},
author = {Frantar, Elias and Alistarh, Dan-Adrian},
booktitle = {39th International Conference on Machine Learning},
location = {Baltimore, MD, United States},
pages = {6726--6743},
publisher = {ML Research Press},
title = {{SPDY: Accurate pruning with speedup guarantees}},
volume = {162},
year = {2022},
}
@inproceedings{17060,
abstract = {Payment channel networks (PCNs) are one of the most prominent solutions to the limited transaction throughput of blockchains. Nevertheless, PCNs suffer themselves from a throughput limitation due to the capital constraints of their channels. A similar dependence on high capital is also found in inter-bank payment settlements, where the so-called netting technique is used to mitigate liquidity demands.
In this work, we alleviate this limitation by introducing the notion of transaction aggregation: instead of executing transactions sequentially through a PCN, we enable senders to aggregate multiple transactions and execute them simultaneously to benefit from several amounts that may "cancel out". Two direct advantages of our proposal is the decrease in intermediary fees paid by senders as well as the obfuscation of the transaction data from the intermediaries.
We formulate the transaction aggregation as a computational problem, a generalization of the Bank Clearing Problem. We present a generic framework for the transaction aggregation execution, and thereafter we propose Wiser as an implementation of this framework in a specific hub-based setting. To overcome the NP-hardness of the transaction aggregation problem, in Wiser we propose a fixed-parameter linear algorithm for a special case of transaction aggregation as well as the Bank Clearing Problem. Wiser can also be seen as a modern variant of the Hawala money transfer system, as well as a decentralized implementation of the overseas remittance service of Wise.},
author = {Tiwari, Samarth and Yeo, Michelle X and Avarikioti, Zeta and Salem, Iosif and Pietrzak, Krzysztof Z and Schmid, Stefan},
booktitle = {Proceedings of the 4th ACM Conference on Advances in Financial Technologies},
isbn = {9781450398619},
location = {Cambridge, MA, United States},
pages = {217--231},
publisher = {Association for Computing Machinery},
title = {{Wiser: Increasing throughput in payment channel networks with transaction aggregation}},
doi = {10.1145/3558535.3559775},
year = {2022},
}
@article{17061,
abstract = {Across many domains of interaction, both natural and artificial, individuals use past experience to shape future behaviors. The results of such learning processes depend on what individuals wish to maximize. A natural objective is one’s own success. However, when two such “selfish” learners interact with each other, the outcome can be detrimental to both, especially when there are conflicts of interest. Here, we explore how a learner can align incentives with a selfish opponent. Moreover, we consider the dynamics that arise when learning rules themselves are subject to evolutionary pressure. By combining extensive simulations and analytical techniques, we demonstrate that selfish learning is unstable in most classical two-player repeated games. If evolution operates on the level of long-run payoffs, selection instead favors learning rules that incorporate social (other-regarding) preferences. To further corroborate these results, we analyze data from a repeated prisoner’s dilemma experiment. We find that selfish learning is insufficient to explain human behavior when there is a trade-off between payoff maximization and fairness.},
author = {McAvoy, Alex and Kates-Harbeck, Julian and Chatterjee, Krishnendu and Hilbe, Christian},
issn = {2752-6542},
journal = {PNAS Nexus},
number = {4},
publisher = {Oxford University Press},
title = {{Evolutionary instability of selfish learning in repeated games}},
doi = {10.1093/pnasnexus/pgac141},
volume = {1},
year = {2022},
}
@inproceedings{17062,
author = {Ibáñez, Maria and Liu, Yu and Calcabrini, Mariano},
booktitle = {Proceedings of the nanoGe Spring Meeting 2022},
location = {Spain/Virtual},
publisher = {Fundació Scito},
title = {{The importance of surface adsorbates in solution-processed thermoelectric materials}},
doi = {10.29363/nanoge.nsm.2022.159},
year = {2022},
}
@article{17063,
abstract = {This workshop continued a biannual series of workshops at Oberwolfach on dynamical systems that started with a meeting organized by Moser and Zehnder in 1981. Workshops in this series focus on new results and developments in dynamical systems and related areas of mathematics, with symplectic geometry playing an important role in recent years in connection with Hamiltonian dynamics. In this year special emphasis was placed on various kinds of spectra (in contact geometry, in Riemannian geometry, in dynamical systems and in symplectic topology) and their applications to dynamics.},
author = {Arnaud, Marie-Claude and Hofer, Helmut W. and Hutchings, Michael and Kaloshin, Vadim},
issn = {1660-8941},
journal = {Oberwolfach Reports},
number = {3},
pages = {1735--1803},
publisher = {European Mathematical Society},
title = {{Dynamische Systeme}},
doi = {10.4171/owr/2021/33},
volume = {18},
year = {2022},
}
@article{17065,
abstract = {Past work on optimizing fabrication plans given a carpentry design can provide Pareto-optimal plans trading off between material waste, fabrication time, precision, and other considerations. However, when developing fabrication plans, experts rarely restrict to a single design, instead considering families of design variations, sometimes adjusting designs to simplify fabrication. Jointly exploring the design and fabrication plan spaces for each design is intractable using current techniques. We present a new approach to jointly optimize design and fabrication plans for carpentered objects. To make this bi-level optimization tractable, we adapt recent work from program synthesis based on equality graphs (e-graphs), which encode sets of equivalent programs. Our insight is that subproblems within our bi-level problem share significant substructures. By representing both designs and fabrication plans in a new bag of parts (BOP) e-graph, we amortize the cost of optimizing design components shared among multiple candidates. Even using BOP e-graphs, the optimization space grows quickly in practice. Hence, we also show how a feedback-guided search strategy dubbed Iterative Contraction and Expansion on E-graphs (ICEE) can keep the size of the e-graph manageable and direct the search towards promising candidates. We illustrate the advantages of our pipeline through examples from the carpentry domain.},
author = {Zhao, Haisen and Willsey, Max and Zhu, Amy and Nandi, Chandrakana and Tatlock, Zachary and Solomon, Justin and Schulz, Adriana},
issn = {1557-7368},
journal = {ACM Transactions on Graphics},
number = {3},
publisher = {Association for Computing Machinery},
title = {{Co-optimization of design and fabrication plans for carpentry}},
doi = {10.1145/3508499},
volume = {41},
year = {2022},
}
@article{17066,
abstract = {A cell’s size affects the likelihood that it will die. But how is cell size controlled in this context and how does cell size impact commitment to the cell death fate? We present evidence that the caspase CED-3 interacts with the RhoGEF ECT-2 in Caenorhabditis elegans neuroblasts that generate “unwanted” cells. We propose that this interaction promotes polar actomyosin contractility, which leads to unequal neuroblast division and the generation of a daughter cell that is below the critical “lethal” size threshold. Furthermore, we find that hyperactivation of ECT-2 RhoGEF reduces the sizes of unwanted cells. Importantly, this suppresses the “cell death abnormal” phenotype caused by the partial loss of ced-3 caspase and therefore increases the likelihood that unwanted cells die. A putative null mutation of ced-3 caspase, however, is not suppressed, which indicates that cell size affects CED-3 caspase activation and/or activity. Therefore, we have uncovered novel sequential and reciprocal interactions between the apoptosis pathway and cell size that impact a cell’s commitment to the cell death fate.},
author = {Sethi, Aditya and Wei, Hai and Mishra, Nikhil and Segos, Ioannis and Lambie, Eric J. and Zanin, Esther and Conradt, Barbara},
issn = {1545-7885},
journal = {PLOS Biology},
number = {10},
publisher = {Public Library of Science},
title = {{A caspase–RhoGEF axis contributes to the cell size threshold for apoptotic death in developing Caenorhabditis elegans}},
doi = {10.1371/journal.pbio.3001786},
volume = {20},
year = {2022},
}
@article{17067,
abstract = {Human doublecortin (DCX) mutations are associated with severe brain malformations leading to aberrant neuron positioning (heterotopia), intellectual disability and epilepsy. DCX is a microtubule-associated protein which plays a key role during neurodevelopment in neuronal migration and differentiation. Dcx knockout (KO) mice show disorganized hippocampal pyramidal neurons. The CA2/CA3 pyramidal cell layer is present as two abnormal layers and disorganized CA3 KO pyramidal neurons are also more excitable than wild-type (WT) cells. To further identify abnormalities, we characterized Dcx KO hippocampal neurons at subcellular, molecular and ultrastructural levels. Severe defects were observed in mitochondria, affecting number and distribution. Also, the Golgi apparatus was visibly abnormal, increased in volume and abnormally organized. Transcriptome analyses from laser microdissected hippocampal tissue at postnatal day 60 (P60) highlighted organelle abnormalities. Ultrastructural studies of CA3 cells performed in P60 (young adult) and > 9 months (mature) tissue showed that organelle defects are persistent throughout life. Locomotor activity and fear memory of young and mature adults were also abnormal: Dcx KO mice consistently performed less well than WT littermates, with defects becoming more severe with age. Thus, we show that disruption of a neurodevelopmentally-regulated gene can lead to permanent organelle anomalies contributing to abnormal adult behavior.},
author = {Stouffer, Melissa A and Khalaf-Nazzal, R. and Cifuentes-Diaz, C. and Albertini, G. and Bandet, E. and Grannec, G. and Lavilla, V. and Deleuze, J.-F. and Olaso, R. and Nosten-Bertrand, M. and Francis, F.},
issn = {0969-9961},
journal = {Neurobiology of Disease},
publisher = {Elsevier},
title = {{Doublecortin mutation leads to persistent defects in the Golgi apparatus and mitochondria in adult hippocampal pyramidal cells}},
doi = {10.1016/j.nbd.2022.105702},
volume = {168},
year = {2022},
}