@article{12281, abstract = {We study the hydrodynamic and hydrostatic limits of the one-dimensional open symmetric inclusion process with slow boundary. Depending on the value of the parameter tuning the interaction rate of the bulk of the system with the boundary, we obtain a linear heat equation with either Dirichlet, Robin or Neumann boundary conditions as hydrodynamic equation. In our approach, we combine duality and first-second class particle techniques to reduce the scaling limit of the inclusion process to the limiting behavior of a single, non-interacting, particle.}, author = {Franceschini, Chiara and Gonçalves, Patrícia and Sau, Federico}, issn = {1350-7265}, journal = {Bernoulli}, keywords = {Statistics and Probability}, number = {2}, pages = {1340--1381}, publisher = {Bernoulli Society for Mathematical Statistics and Probability}, title = {{Symmetric inclusion process with slow boundary: Hydrodynamics and hydrostatics}}, doi = {10.3150/21-bej1390}, volume = {28}, year = {2022}, } @article{12282, abstract = {From a simple thought to a multicellular movement}, author = {Amberg, Nicole and Stouffer, Melissa A and Vercellino, Irene}, issn = {1477-9137}, journal = {Journal of Cell Science}, number = {8}, publisher = {The Company of Biologists}, title = {{Operation STEM fatale – how an equity, diversity and inclusion initiative has brought us to reflect on the current challenges in cell biology and science as a whole}}, doi = {10.1242/jcs.260017}, volume = {135}, year = {2022}, } @article{12283, abstract = {Neurons extend axons to form the complex circuitry of the mature brain. This depends on the coordinated response and continuous remodelling of the microtubule and F-actin networks in the axonal growth cone. Growth cone architecture remains poorly understood at nanoscales. We therefore investigated mouse hippocampal neuron growth cones using cryo-electron tomography to directly visualise their three-dimensional subcellular architecture with molecular detail. Our data showed that the hexagonal arrays of actin bundles that form filopodia penetrate and terminate deep within the growth cone interior. We directly observed the modulation of these and other growth cone actin bundles by alteration of individual F-actin helical structures. Microtubules with blunt, slightly flared or gently curved ends predominated in the growth cone, frequently contained lumenal particles and exhibited lattice defects. Investigation of the effect of absence of doublecortin, a neurodevelopmental cytoskeleton regulator, on growth cone cytoskeleton showed no major anomalies in overall growth cone organisation or in F-actin subpopulations. However, our data suggested that microtubules sustained more structural defects, highlighting the importance of microtubule integrity during growth cone migration.}, author = {Atherton, Joseph and Stouffer, Melissa A and Francis, Fiona and Moores, Carolyn A.}, issn = {1477-9137}, journal = {Journal of Cell Science}, keywords = {Cell Biology}, number = {7}, publisher = {The Company of Biologists}, title = {{Visualising the cytoskeletal machinery in neuronal growth cones using cryo-electron tomography}}, doi = {10.1242/jcs.259234}, volume = {135}, year = {2022}, } @article{12286, abstract = {Inspired by the study of loose cycles in hypergraphs, we define the loose core in hypergraphs as a structurewhich mirrors the close relationship between cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial random hypergraph $H^r(n,p)$, the order of the loose core undergoes a phase transition at a certain critical threshold and determine this order, as well as the number of edges, asymptotically in the subcritical and supercritical regimes. Our main tool is an algorithm called CoreConstruct, which enables us to analyse a peeling process for the loose core. By analysing this algorithm we determine the asymptotic degree distribution of vertices in the loose core and in particular how many vertices and edges the loose core contains. As a corollary we obtain an improved upper bound on the length of the longest loose cycle in $H^r(n,p)$.}, author = {Cooley, Oliver and Kang, Mihyun and Zalla, Julian}, issn = {1077-8926}, journal = {The Electronic Journal of Combinatorics}, keywords = {Computational Theory and Mathematics, Geometry and Topology, Theoretical Computer Science, Applied Mathematics, Discrete Mathematics and Combinatorics}, number = {4}, publisher = {The Electronic Journal of Combinatorics}, title = {{Loose cores and cycles in random hypergraphs}}, doi = {10.37236/10794}, volume = {29}, year = {2022}, } @article{12288, abstract = {To understand the function of neuronal circuits, it is crucial to disentangle the connectivity patterns within the network. However, most tools currently used to explore connectivity have low throughput, low selectivity, or limited accessibility. Here, we report the development of an improved packaging system for the production of the highly neurotropic RVdGenvA-CVS-N2c rabies viral vectors, yielding titers orders of magnitude higher with no background contamination, at a fraction of the production time, while preserving the efficiency of transsynaptic labeling. Along with the production pipeline, we developed suites of ‘starter’ AAV and bicistronic RVdG-CVS-N2c vectors, enabling retrograde labeling from a wide range of neuronal populations, tailored for diverse experimental requirements. We demonstrate the power and flexibility of the new system by uncovering hidden local and distal inhibitory connections in the mouse hippocampal formation and by imaging the functional properties of a cortical microcircuit across weeks. Our novel production pipeline provides a convenient approach to generate new rabies vectors, while our toolkit flexibly and efficiently expands the current capacity to label, manipulate and image the neuronal activity of interconnected neuronal circuits in vitro and in vivo.}, author = {Sumser, Anton L and Jösch, Maximilian A and Jonas, Peter M and Ben Simon, Yoav}, issn = {2050-084X}, journal = {eLife}, keywords = {General Immunology and Microbiology, General Biochemistry, Genetics and Molecular Biology, General Medicine, General Neuroscience}, publisher = {eLife Sciences Publications}, title = {{Fast, high-throughput production of improved rabies viral vectors for specific, efficient and versatile transsynaptic retrograde labeling}}, doi = {10.7554/elife.79848}, volume = {11}, year = {2022}, } @article{12290, abstract = {We prove local laws, i.e. optimal concentration estimates for arbitrary products of resolvents of a Wigner random matrix with deterministic matrices in between. We find that the size of such products heavily depends on whether some of the deterministic matrices are traceless. Our estimates correctly account for this dependence and they hold optimally down to the smallest possible spectral scale.}, author = {Cipolloni, Giorgio and Erdös, László and Schröder, Dominik J}, issn = {1083-6489}, journal = {Electronic Journal of Probability}, keywords = {Statistics, Probability and Uncertainty, Statistics and Probability}, pages = {1--38}, publisher = {Institute of Mathematical Statistics}, title = {{Optimal multi-resolvent local laws for Wigner matrices}}, doi = {10.1214/22-ejp838}, volume = {27}, year = {2022}, } @article{12291, abstract = {The phytohormone auxin triggers transcriptional reprogramming through a well-characterized perception machinery in the nucleus. By contrast, mechanisms that underlie fast effects of auxin, such as the regulation of ion fluxes, rapid phosphorylation of proteins or auxin feedback on its transport, remain unclear1,2,3. Whether auxin-binding protein 1 (ABP1) is an auxin receptor has been a source of debate for decades1,4. Here we show that a fraction of Arabidopsis thaliana ABP1 is secreted and binds auxin specifically at an acidic pH that is typical of the apoplast. ABP1 and its plasma-membrane-localized partner, transmembrane kinase 1 (TMK1), are required for the auxin-induced ultrafast global phospho-response and for downstream processes that include the activation of H+-ATPase and accelerated cytoplasmic streaming. abp1 and tmk mutants cannot establish auxin-transporting channels and show defective auxin-induced vasculature formation and regeneration. An ABP1(M2X) variant that lacks the capacity to bind auxin is unable to complement these defects in abp1 mutants. These data indicate that ABP1 is the auxin receptor for TMK1-based cell-surface signalling, which mediates the global phospho-response and auxin canalization.}, author = {Friml, Jiří and Gallei, Michelle C and Gelová, Zuzana and Johnson, Alexander J and Mazur, Ewa and Monzer, Aline and Rodriguez Solovey, Lesia and Roosjen, Mark and Verstraeten, Inge and Živanović, Branka D. and Zou, Minxia and Fiedler, Lukas and Giannini, Caterina and Grones, Peter and Hrtyan, Mónika and Kaufmann, Walter and Kuhn, Andre and Narasimhan, Madhumitha and Randuch, Marek and Rýdza, Nikola and Takahashi, Koji and Tan, Shutang and Teplova, Anastasiia and Kinoshita, Toshinori and Weijers, Dolf and Rakusová, Hana}, issn = {1476-4687}, journal = {Nature}, number = {7927}, pages = {575--581}, publisher = {Springer Nature}, title = {{ABP1–TMK auxin perception for global phosphorylation and auxin canalization}}, doi = {10.1038/s41586-022-05187-x}, volume = {609}, year = {2022}, } @inproceedings{12298, abstract = {Existing committee-based Byzantine state machine replication (SMR) protocols, typically deployed in production blockchains, face a clear trade-off: (1) they either achieve linear communication cost in the steady state, but sacrifice liveness during periods of asynchrony, or (2) they are robust (progress with probability one) but pay quadratic communication cost. We believe this trade-off is unwarranted since existing linear protocols still have asymptotic quadratic cost in the worst case. We design Ditto, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the steady state (linear and quadratic, respectively) and progress guarantee under asynchrony and DDoS attacks. We achieve this by replacing the view-synchronization of partially synchronous protocols with an asynchronous fallback mechanism at no extra asymptotic cost. Specifically, we start from HotStuff, a state-of-the-art linear protocol, and gradually build Ditto. As a separate contribution and an intermediate step, we design a 2-chain version of HotStuff, Jolteon, which leverages a quadratic view-change mechanism to reduce the latency of the standard 3-chain HotStuff. We implement and experimentally evaluate all our systems to prove that breaking the robustness-efficiency trade-off is in the realm of practicality.}, author = {Gelashvili, Rati and Kokoris Kogias, Eleftherios and Sonnino, Alberto and Spiegelman, Alexander and Xiang, Zhuolun}, booktitle = {Financial Cryptography and Data Security}, isbn = {9783031182822}, issn = {1611-3349}, location = {Radisson Grenada Beach Resort, Grenada}, pages = {296--315}, publisher = {Springer Nature}, title = {{Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback}}, doi = {10.1007/978-3-031-18283-9_14}, volume = {13411}, year = {2022}, } @inproceedings{12299, abstract = {Transfer learning is a classic paradigm by which models pretrained on large “upstream” datasets are adapted to yield good results on “downstream” specialized datasets. Generally, more accurate models on the “upstream” dataset tend to provide better transfer accuracy “downstream”. In this work, we perform an in-depth investigation of this phenomenon in the context of convolutional neural networks (CNNs) trained on the ImageNet dataset, which have been pruned-that is, compressed by sparsifiying their connections. We consider transfer using unstructured pruned models obtained by applying several state-of-the-art pruning methods, including magnitude-based, second-order, regrowth, lottery-ticket, and regularization approaches, in the context of twelve standard transfer tasks. In a nutshell, our study shows that sparse models can match or even outperform the transfer performance of dense models, even at high sparsities, and, while doing so, can lead to significant inference and even training speedups. At the same time, we observe and analyze significant differences in the behaviour of different pruning methods. The code is available at: https://github.com/IST-DASLab/sparse-imagenet-transfer.}, author = {Iofinova, Eugenia B and Peste, Elena-Alexandra and Kurtz, Mark and Alistarh, Dan-Adrian}, booktitle = {2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition}, issn = {2575-7075}, location = {New Orleans, LA, United States}, pages = {12256--12266}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{How well do sparse ImageNet models transfer?}}, doi = {10.1109/cvpr52688.2022.01195}, year = {2022}, } @inproceedings{12300, abstract = {Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted third party and is a building block to decentralized protocols such as randomness beacons, threshold signatures, and general multiparty computation. Until recently, DKG protocols have assumed the synchronous model and thus are vulnerable when their underlying network assumptions do not hold. The recent advancements in asynchronous DKG protocols are insufficient as they either have poor efficiency or limited functionality, resulting in a lack of concrete implementations. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol. In a network of n nodes, our ADKG protocol can tolerate up to t