Evidence map›Paper›PMID 34389712›Full record

ArticleNature communications2021

Frustrated self-assembly of non-Euclidean crystals of nanoparticles.

Francesco Serafin, Jun Lu, Nicholas Kotov, Kai Sun, Xiaoming Mao

Abstract read
In one paragraph

Article in Nature communications, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

0numbers the graph read from it
0cells of the map it votes in
7citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

7 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Review
  6. Exotic self-assembly of hard spheres in a morphometric solvent.Proceedings of the National Academy of Sciences of the United States of America · 2024
    Article
  7. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Francesco SerafinDepartment of Physics, University of Michigan, Ann Arbor, MI, USA.
Jun LuDepartment of Chemical Engineering, University of Michigan, Ann Arbor, MI, USA.
Nicholas KotovDepartment of Chemical Engineering, University of Michigan, Ann Arbor, MI, USA.ORCID http://orcid.org/0000-0002-6864-5804
Kai SunDepartment of Physics, University of Michigan, Ann Arbor, MI, USA.ORCID http://orcid.org/0000-0001-9595-7646
Xiaoming MaoDepartment of Physics, University of Michigan, Ann Arbor, MI, USA. maox@umich.edu.ORCID http://orcid.org/0000-0001-7920-3991

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Self-organized complex structures in nature, e.g., viral capsids, hierarchical biopolymers, and bacterial flagella, offer efficiency, adaptability, robustness, and multi-functionality. Can we program the self-assembly of three-dimensional (3D) complex structures using simple building blocks, and reach similar or higher level of sophistication in engineered materials? Here we present an analytic theory for the self-assembly of polyhedral nanoparticles (NPs) based on their crystal structures in non-Euclidean space. We show that the unavoidable geometrical frustration of these particle shapes, combined with competing attractive and repulsive interparticle interactions, lead to controllable self-assembly of structures of complex order. Applying this theory to tetrahedral NPs, we find high-yield and enantiopure self-assembly of helicoidal ribbons, exhibiting qualitative agreement with experimental observations. We expect that this theory will offer a general framework for the self-assembly of simple polyhedral building blocks into rich complex morphologies with new material capabilities such as tunable optical activity, essential for multiple emerging technologies.

Identifiers

PMID34389712
PMCPMC8363672

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.