@article{1161, abstract = {Coordinated changes of cell shape are often the result of the excitable, wave-like dynamics of the actin cytoskeleton. New work shows that, in migrating cells, protrusion waves arise from mechanochemical crosstalk between adhesion sites, membrane tension and the actin protrusive machinery.}, author = {Müller, Jan and Sixt, Michael K}, issn = {09609822}, journal = {Current Biology}, number = {1}, pages = {R24 -- R25}, publisher = {Cell Press}, title = {{Cell migration: Making the waves}}, doi = {10.1016/j.cub.2016.11.035}, volume = {27}, year = {2017}, } @article{1162, abstract = {Selected universal experimental properties of high-temperature superconducting (HTS) cuprates have been singled out in the last decade. One of the pivotal challenges in this field is the designation of a consistent interpretation framework within which we can describe quantitatively the universal features of those systems. Here we analyze in a detailed manner the principal experimental data and compare them quantitatively with the approach based on a single-band model of strongly correlated electrons supplemented with strong antiferromagnetic (super)exchange interaction (the so-called t−J−U model). The model rationale is provided by estimating its microscopic parameters on the basis of the three-band approach for the Cu-O plane. We use our original full Gutzwiller wave-function solution by going beyond the renormalized mean-field theory (RMFT) in a systematic manner. Our approach reproduces very well the observed hole doping (δ) dependence of the kinetic-energy gain in the superconducting phase, one of the principal non-Bardeen-Cooper-Schrieffer features of the cuprates. The calculated Fermi velocity in the nodal direction is practically δ-independent and its universal value agrees very well with that determined experimentally. Also, a weak doping dependence of the Fermi wave vector leads to an almost constant value of the effective mass in a pure superconducting phase which is both observed in experiment and reproduced within our approach. An assessment of the currently used models (t−J, Hubbard) is carried out and the results of the canonical RMFT as a zeroth-order solution are provided for comparison to illustrate the necessity of the introduced higher-order contributions.}, author = {Spałek, Jozef and Zegrodnik, Michał and Kaczmarczyk, Jan}, issn = {24699950}, journal = {Physical Review B - Condensed Matter and Materials Physics}, number = {2}, publisher = {American Physical Society}, title = {{Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment}}, doi = {10.1103/PhysRevB.95.024506}, volume = {95}, year = {2017}, } @article{1163, abstract = {We investigate the effect of the electron-hole (e-h) symmetry breaking on d-wave superconductivity induced by non-local effects of correlations in the generalized Hubbard model. The symmetry breaking is introduced in a two-fold manner: by the next-to-nearest neighbor hopping of electrons and by the charge-bond interaction - the off-diagonal term of the Coulomb potential. Both terms lead to a pronounced asymmetry of the superconducting order parameter. The next-to-nearest neighbor hopping enhances superconductivity for h-doping, while diminishes it for e-doping. The charge-bond interaction alone leads to the opposite effect and, additionally, to the kinetic-energy gain upon condensation in the underdoped regime. With both terms included, with similar amplitudes, the height of the superconducting dome and the critical doping remain in favor of h-doping. The influence of the charge-bond interaction on deviations from symmetry of the shape of the gap at the Fermi surface in the momentum space is briefly discussed.}, author = {Wysokiński, Marcin and Kaczmarczyk, Jan}, issn = {09538984}, journal = {Journal of Physics: Condensed Matter}, number = {8}, publisher = {IOP Publishing Ltd.}, title = {{Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms}}, doi = {10.1088/1361-648X/aa532f}, volume = {29}, year = {2017}, } @article{1168, abstract = {Optimum experimental design theory has recently been extended for parameter estimation in copula models. The use of these models allows one to gain in flexibility by considering the model parameter set split into marginal and dependence parameters. However, this separation also leads to the natural issue of estimating only a subset of all model parameters. In this work, we treat this problem with the application of the (Formula presented.)-optimality to copula models. First, we provide an extension of the corresponding equivalence theory. Then, we analyze a wide range of flexible copula models to highlight the usefulness of (Formula presented.)-optimality in many possible scenarios. Finally, we discuss how the usage of the introduced design criterion also relates to the more general issue of copula selection and optimal design for model discrimination.}, author = {Perrone, Elisa and Rappold, Andreas and Müller, Werner}, journal = {Statistical Methods and Applications}, number = {3}, pages = {403 -- 418}, publisher = {Springer}, title = {{D inf s optimality in copula models}}, doi = {10.1007/s10260-016-0375-6}, volume = {26}, year = {2017}, } @article{1169, abstract = {Dispersal is a crucial factor in natural evolution, since it determines the habitat experienced by any population and defines the spatial scale of interactions between individuals. There is compelling evidence for systematic differences in dispersal characteristics within the same population, i.e., genotype-dependent dispersal. The consequences of genotype-dependent dispersal on other evolutionary phenomena, however, are poorly understood. In this article we investigate the effect of genotype-dependent dispersal on spatial gene frequency patterns, using a generalization of the classical diffusion model of selection and dispersal. Dispersal is characterized by the variance of dispersal (diffusion coefficient) and the mean displacement (directional advection term). We demonstrate that genotype-dependent dispersal may change the qualitative behavior of Fisher waves, which change from being “pulled” to being “pushed” wave fronts as the discrepancy in dispersal between genotypes increases. The speed of any wave is partitioned into components due to selection, genotype-dependent variance of dispersal, and genotype-dependent mean displacement. We apply our findings to wave fronts maintained by selection against heterozygotes. Furthermore, we identify a benefit of increased variance of dispersal, quantify its effect on the speed of the wave, and discuss the implications for the evolution of dispersal strategies.}, author = {Novak, Sebastian and Kollár, Richard}, issn = {00166731}, journal = {Genetics}, number = {1}, pages = {367 -- 374}, publisher = {Genetics Society of America}, title = {{Spatial gene frequency waves under genotype dependent dispersal}}, doi = {10.1534/genetics.116.193946}, volume = {205}, year = {2017}, } @article{1173, abstract = {We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result neither extends to topological triangulations in the plane nor to geometric triangulations in three and higher dimensions.}, author = {Edelsbrunner, Herbert and Glazyrin, Alexey and Musin, Oleg and Nikitenko, Anton}, issn = {02099683}, journal = {Combinatorica}, number = {5}, pages = {887 -- 910}, publisher = {Springer}, title = {{The Voronoi functional is maximized by the Delaunay triangulation in the plane}}, doi = {10.1007/s00493-016-3308-y}, volume = {37}, year = {2017}, } @inproceedings{1174, abstract = {Security of cryptographic applications is typically defined by security games. The adversary, within certain resources, cannot win with probability much better than 0 (for unpredictability applications, like one-way functions) or much better than 1/2 (indistinguishability applications for instance encryption schemes). In so called squared-friendly applications the winning probability of the adversary, for different values of the application secret randomness, is not only close to 0 or 1/2 on average, but also concentrated in the sense that its second central moment is small. The class of squared-friendly applications, which contains all unpredictability applications and many indistinguishability applications, is particularly important for key derivation. Barak et al. observed that for square-friendly applications one can beat the "RT-bound", extracting secure keys with significantly smaller entropy loss. In turn Dodis and Yu showed that in squared-friendly applications one can directly use a "weak" key, which has only high entropy, as a secure key. In this paper we give sharp lower bounds on square security assuming security for "weak" keys. We show that any application which is either (a) secure with weak keys or (b) allows for entropy savings for keys derived by universal hashing, must be square-friendly. Quantitatively, our lower bounds match the positive results of Dodis and Yu and Barak et al. (TCC\'13, CRYPTO\'11) Hence, they can be understood as a general characterization of squared-friendly applications. While the positive results on squared-friendly applications where derived by one clever application of the Cauchy-Schwarz Inequality, for tight lower bounds we need more machinery. In our approach we use convex optimization techniques and some theory of circular matrices.}, author = {Skórski, Maciej}, issn = {18688969}, location = {Hannover, Germany}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Lower bounds on key derivation for square-friendly applications}}, doi = {10.4230/LIPIcs.STACS.2017.57}, volume = {66}, year = {2017}, } @inproceedings{1175, abstract = {We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation. Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the non- deterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10–15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure.}, author = {Alwen, Joel F and De Rezende, Susanna and Nordstrom, Jakob and Vinyals, Marc}, editor = {Papadimitriou, Christos}, issn = {18688969}, location = {Berkeley, CA, United States}, pages = {38:1--38--21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Cumulative space in black-white pebbling and resolution}}, doi = {10.4230/LIPIcs.ITCS.2017.38}, volume = {67}, year = {2017}, } @inproceedings{1176, abstract = {The algorithm Argon2i-B of Biryukov, Dinu and Khovratovich is currently being considered by the IRTF (Internet Research Task Force) as a new de-facto standard for password hashing. An older version (Argon2i-A) of the same algorithm was chosen as the winner of the recent Password Hashing Competition. An important competitor to Argon2i-B is the recently introduced Balloon Hashing (BH) algorithm of Corrigan-Gibs, Boneh and Schechter. A key security desiderata for any such algorithm is that evaluating it (even using a custom device) requires a large amount of memory amortized across multiple instances. Alwen and Blocki (CRYPTO 2016) introduced a class of theoretical attacks against Argon2i-A and BH. While these attacks yield large asymptotic reductions in the amount of memory, it was not, a priori, clear if (1) they can be extended to the newer Argon2i-B, (2) the attacks are effective on any algorithm for practical parameter ranges (e.g., 1GB of memory) and (3) if they can be effectively instantiated against any algorithm under realistic hardware constrains. In this work we answer all three of these questions in the affirmative for all three algorithms. This is also the first work to analyze the security of Argon2i-B. In more detail, we extend the theoretical attacks of Alwen and Blocki (CRYPTO 2016) to the recent Argon2i-B proposal demonstrating severe asymptotic deficiencies in its security. Next we introduce several novel heuristics for improving the attack's concrete memory efficiency even when on-chip memory bandwidth is bounded. We then simulate our attacks on randomly sampled Argon2i-A, Argon2i-B and BH instances and measure the resulting memory consumption for various practical parameter ranges and for a variety of upperbounds on the amount of parallelism available to the attacker. Finally we describe, implement, and test a new heuristic for applying the Alwen-Blocki attack to functions employing a technique developed by Corrigan-Gibs et al. for improving concrete security of memory-hard functions. We analyze the collected data and show the effects various parameters have on the memory consumption of the attack. In particular, we can draw several interesting conclusions about the level of security provided by these functions. · For the Alwen-Blocki attack to fail against practical memory parameters, Argon2i-B must be instantiated with more than 10 passes on memory - beyond the "paranoid" parameter setting in the current IRTF proposal. · The technique of Corrigan-Gibs for improving security can also be overcome by the Alwen-Blocki attack under realistic hardware constraints. · On a positive note, both the asymptotic and concrete security of Argon2i-B seem to improve on that of Argon2i-A.}, author = {Alwen, Joel F and Blocki, Jeremiah}, isbn = {978-150905761-0}, location = {Paris, France}, publisher = {IEEE}, title = {{Towards practical attacks on Argon2i and balloon hashing}}, doi = {10.1109/EuroSP.2017.47}, year = {2017}, } @inproceedings{791, abstract = {Consider the following random process: we are given n queues, into which elements of increasing labels are inserted uniformly at random. To remove an element, we pick two queues at random, and remove the element of lower label (higher priority) among the two. The cost of a removal is the rank of the label removed, among labels still present in any of the queues, that is, the distance from the optimal choice at each step. Variants of this strategy are prevalent in state-of-the-art concurrent priority queue implementations. Nonetheless, it is not known whether such implementations provide any rank guarantees, even in a sequential model. We answer this question, showing that this strategy provides surprisingly strong guarantees: Although the single-choice process, where we always insert and remove from a single randomly chosen queue, has degrading cost, going to infinity as we increase the number of steps, in the two choice process, the expected rank of a removed element is O(n) while the expected worst-case cost is O(n log n). These bounds are tight, and hold irrespective of the number of steps for which we run the process. The argument is based on a new technical connection between "heavily loaded" balls-into-bins processes and priority scheduling. Our analytic results inspire a new concurrent priority queue implementation, which improves upon the state of the art in terms of practical performance.}, author = {Alistarh, Dan-Adrian and Kopinsky, Justin and Li, Jerry and Nadiradze, Giorgi}, booktitle = {Proceedings of the ACM Symposium on Principles of Distributed Computing}, isbn = {978-145034992-5}, location = {Washington, WA, USA}, pages = {283 -- 292}, publisher = {ACM}, title = {{The power of choice in priority scheduling}}, doi = {10.1145/3087801.3087810}, volume = {Part F129314}, year = {2017}, } @article{792, abstract = {The chaotic dynamics of low-dimensional systems, such as Lorenz or Rössler flows, is guided by the infinity of periodic orbits embedded in their strange attractors. Whether this is also the case for the infinite-dimensional dynamics of Navier–Stokes equations has long been speculated, and is a topic of ongoing study. Periodic and relative periodic solutions have been shown to be involved in transitions to turbulence. Their relevance to turbulent dynamics – specifically, whether periodic orbits play the same role in high-dimensional nonlinear systems like the Navier–Stokes equations as they do in lower-dimensional systems – is the focus of the present investigation. We perform here a detailed study of pipe flow relative periodic orbits with energies and mean dissipations close to turbulent values. We outline several approaches to reduction of the translational symmetry of the system. We study pipe flow in a minimal computational cell at Re=2500, and report a library of invariant solutions found with the aid of the method of slices. Detailed study of the unstable manifolds of a sample of these solutions is consistent with the picture that relative periodic orbits are embedded in the chaotic saddle and that they guide the turbulent dynamics.}, author = {Budanur, Nazmi B and Short, Kimberly and Farazmand, Mohammad and Willis, Ashley and Cvitanović, Predrag}, issn = {00221120}, journal = {Journal of Fluid Mechanics}, pages = {274 -- 301}, publisher = {Cambridge University Press}, title = {{Relative periodic orbits form the backbone of turbulent pipe flow}}, doi = {10.1017/jfm.2017.699}, volume = {833}, year = {2017}, } @article{793, abstract = {Let P be a finite point set in the plane. A cordinary triangle in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P . Motivated by a question of Erdös, and answering a question of de Zeeuw, we prove that there exists a constant c > 0such that P contains a c-ordinary triangle, provided that P is not contained in the union of two lines. Furthermore, the number of c-ordinary triangles in P is Ω(| P |). }, author = {Fulek, Radoslav and Mojarrad, Hossein and Naszódi, Márton and Solymosi, József and Stich, Sebastian and Szedlák, May}, issn = {09257721}, journal = {Computational Geometry: Theory and Applications}, pages = {28 -- 31}, publisher = {Elsevier}, title = {{On the existence of ordinary triangles}}, doi = {10.1016/j.comgeo.2017.07.002}, volume = {66}, year = {2017}, } @article{794, abstract = {We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph G with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment G by adding edges without creating an edge-crossing so that in the resulting spherical graph the vertices of each part induce a connected sub-graph. We proceed by a reduction to the problem of testing the existence of a perfect matching in planar bipartite graphs. We formulate our result in a slightly more general setting of cyclic clustered graphs, i.e., the simple graph obtained by contracting each cluster, where we disregard loops and multi-edges, is a cycle.}, author = {Fulek, Radoslav}, journal = {Computational Geometry: Theory and Applications}, pages = {1 -- 13}, publisher = {Elsevier}, title = {{C-planarity of embedded cyclic c-graphs}}, doi = {10.1016/j.comgeo.2017.06.016}, volume = {66}, year = {2017}, } @article{795, abstract = {We introduce a common generalization of the strong Hanani–Tutte theorem and the weak Hanani–Tutte theorem: if a graph G has a drawing D in the plane where every pair of independent edges crosses an even number of times, then G has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in D. The theorem is implicit in the proof of the strong Hanani–Tutte theorem by Pelsmajer, Schaefer and Štefankovič. We give a new, somewhat simpler proof.}, author = {Fulek, Radoslav and Kynčl, Jan and Pálvölgyi, Dömötör}, issn = {10778926}, journal = {Electronic Journal of Combinatorics}, number = {3}, publisher = {International Press}, title = {{Unified Hanani Tutte theorem}}, doi = {10.37236/6663}, volume = {24}, year = {2017}, } @article{796, abstract = {We present the fabrication and characterization of an aluminum transmon qubit on a silicon-on-insulator substrate. Key to the qubit fabrication is the use of an anhydrous hydrofluoric vapor process which selectively removes the lossy silicon oxide buried underneath the silicon device layer. For a 5.6 GHz qubit measured dispersively by a 7.1 GHz resonator, we find T1 = 3.5 μs and T∗2 = 2.2 μs. This process in principle permits the co-fabrication of silicon photonic and mechanical elements, providing a route towards chip-scale integration of electro-opto-mechanical transducers for quantum networking of superconducting microwave quantum circuits. The additional processing steps are compatible with established fabrication techniques for aluminum transmon qubits on silicon.}, author = {Keller, Andrew J and Dieterle, Paul and Fang, Michael and Berger, Brett and Fink, Johannes M and Painter, Oskar}, issn = {00036951}, journal = {Applied Physics Letters}, number = {4}, publisher = {American Institute of Physics}, title = {{Al transmon qubits on silicon on insulator for quantum device integration}}, doi = {10.1063/1.4994661}, volume = {111}, year = {2017}, } @article{797, abstract = {Phasenübergänge helfen beim Verständnis von Vielteilchensystemen in der Festkörperphysik und Fluiddynamik bis hin zur Teilchenphysik. Unserer internationalen Kollaboration ist es gelungen, einen neuartigen Phasenübergang in einem Quantensystem zu beobachten [1]. In einem Mikrowellenresonator konnte erstmals die spontane Zustandsänderung von undurchsichtig zu transparent nachgewiesen werden.}, author = {Fink, Johannes M}, journal = {Physik in unserer Zeit}, number = {3}, pages = {111 -- 113}, publisher = {Wiley}, title = {{Photonenblockade aufgelöst}}, doi = {10.1002/piuz.201770305}, volume = {48}, year = {2017}, } @article{798, abstract = {Nonreciprocal circuit elements form an integral part of modern measurement and communication systems. Mathematically they require breaking of time-reversal symmetry, typically achieved using magnetic materials and more recently using the quantum Hall effect, parametric permittivity modulation or Josephson nonlinearities. Here we demonstrate an on-chip magnetic-free circulator based on reservoir-engineered electromechanic interactions. Directional circulation is achieved with controlled phase-sensitive interference of six distinct electro-mechanical signal conversion paths. The presented circulator is compact, its silicon-on-insulator platform is compatible with both superconducting qubits and silicon photonics, and its noise performance is close to the quantum limit. With a high dynamic range, a tunable bandwidth of up to 30 MHz and an in situ reconfigurability as beam splitter or wavelength converter, it could pave the way for superconducting qubit processors with multiplexed on-chip signal processing and readout.}, author = {Barzanjeh, Shabir and Wulf, Matthias and Peruzzo, Matilda and Kalaee, Mahmoud and Dieterle, Paul and Painter, Oskar and Fink, Johannes M}, issn = {20411723}, journal = {Nature Communications}, number = {1}, publisher = {Nature Publishing Group}, title = {{Mechanical on chip microwave circulator}}, doi = {10.1038/s41467-017-01304-x}, volume = {8}, year = {2017}, } @article{799, abstract = {Membrane traffic at the trans-Golgi network (TGN) is crucial for correctly distributing various membrane proteins to their destination. Polarly localized auxin efflux proteins, including PIN-FORMED1 (PIN1), are dynamically transported between the endosomes and the plasma membrane (PM) in the plant cells. The intracellular trafficking of PIN1 protein is sensitive to a fungal toxin brefeldin A (BFA), which is known to inhibit guanine-nucleotide exchange factors for ADP ribosylation factors (ARF GEFs) such as GNOM. However, the molecular details of the BFA-sensitive trafficking pathway have not been revealed fully. In a previous study, we have identified an Arabidopsis mutant BFA-visualized endocytic trafficking defective 3 (ben3) which exhibited reduced sensitivity to BFA in terms of BFA-induced intracellular PIN1 agglomeration. Here, we show that BEN3 encodes a member of BIG family ARF GEFs, BIG2. Fluorescent proteins tagged BEN3/BIG2 co-localized with markers for TGN / early endosome (EE). Inspection of conditionally induced de novo synthesized PIN1 confirmed that its secretion to the PM is BFA-sensitive and established BEN3/BIG2 as a crucial component of this BFA action at the level of TGN/EE. Furthermore, ben3 mutation alleviated BFA-induced agglomeration of another TGN-localized ARF GEF BEN1/MIN7. Taken together our results suggest that BEN3/BIG2 is an ARF GEF component, which confers BFA sensitivity to the TGN/EE in Arabidopsis.}, author = {Kitakura, Saeko and Adamowski, Maciek and Matsuura, Yuki and Santuari, Luca and Kouno, Hirotaka and Arima, Kohei and Hardtke, Christian and Friml, Jirí and Kakimoto, Tatsuo and Tanaka, Hirokazu}, issn = {00320781}, journal = {Plant and Cell Physiology}, number = {10}, publisher = {Oxford University Press}, title = {{BEN3/BIG2 ARF GEF is involved in brefeldin a-sensitive trafficking at the trans-Golgi network/early endosome in Arabidopsis thaliana}}, doi = {10.1093/pcp/pcx118}, volume = {58}, year = {2017}, } @article{800, abstract = {Gamma oscillations (30–150 Hz) in neuronal networks are associated with the processing and recall of information. We measured local field potentials in the dentate gyrus of freely moving mice and found that gamma activity occurs in bursts, which are highly heterogeneous in their spatial extensions, ranging from focal to global coherent events. Synaptic communication among perisomatic-inhibitory interneurons (PIIs) is thought to play an important role in the generation of hippocampal gamma patterns. However, how neuronal circuits can generate synchronous oscillations at different spatial scales is unknown. We analyzed paired recordings in dentate gyrus slices and show that synaptic signaling at interneuron-interneuron synapses is distance dependent. Synaptic strength declines whereas the duration of inhibitory signals increases with axonal distance among interconnected PIIs. Using neuronal network modeling, we show that distance-dependent inhibition generates multiple highly synchronous focal gamma bursts allowing the network to process complex inputs in parallel in flexibly organized neuronal centers.}, author = {Strüber, Michael and Sauer, Jonas and Jonas, Peter M and Bartos, Marlene}, issn = {20411723}, journal = {Nature Communications}, number = {1}, publisher = {Nature Publishing Group}, title = {{Distance-dependent inhibition facilitates focality of gamma oscillations in the dentate gyrus}}, doi = {10.1038/s41467-017-00936-3}, volume = {8}, year = {2017}, } @article{803, abstract = {Eukaryotic cells store their chromosomes in a single nucleus. This is important to maintain genomic integrity, as chromosomes packaged into separate nuclei (micronuclei) are prone to massive DNA damage. During mitosis, higher eukaryotes disassemble their nucleus and release individualized chromosomes for segregation. How numerous chromosomes subsequently reform a single nucleus has remained unclear. Using image-based screening of human cells, we identified barrier-to-autointegration factor (BAF) as a key factor guiding membranes to form a single nucleus. Unexpectedly, nuclear assembly does not require BAF?s association with inner nuclear membrane proteins but instead relies on BAF?s ability to bridge distant DNA sites. Live-cell imaging and in vitro reconstitution showed that BAF enriches around the mitotic chromosome ensemble to induce a densely cross-bridged chromatin layer that is mechanically stiff and limits membranes to the surface. Our study reveals that BAF-mediated changes in chromosome mechanics underlie nuclear assembly with broad implications for proper genome function.}, author = {Samwer, Matthias and Schneider, Maximilian and Hoefler, Rudolf and Schmalhorst, Philipp S and Jude, Julian and Zuber, Johannes and Gerlic, Daniel}, issn = {00928674}, journal = {Cell}, number = {5}, pages = {956 -- 972}, publisher = {Cell Press}, title = {{DNA cross-bridging shapes a single nucleus from a set of mitotic chromosomes}}, doi = {10.1016/j.cell.2017.07.038}, volume = {170}, year = {2017}, }