Evidence map›Paper›PMID 41124000›Full record

ArticleProceedings of the National Academy of Sciences of the United States of America2025

Hierarchical self-assembly for high-yield addressable complexity at fixed conditions.

Miranda Holmes-Cerfon, Matthieu Wyart

Abstract read
In one paragraph

Article in Proceedings of the National Academy of Sciences of the United States of America, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing 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

3 citing papers in PubMed.

  1. Article
  2. Coarse-Graining Self-Assembly by the Stochastic Landscape Method.Journal of chemical theory and computation · 2025
    Article
  3. Nonequilibrium Self-Assembly Control by the Stochastic Landscape Method.Journal of chemical information and modeling · 2025
    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

2 authors.

Miranda Holmes-CerfonDepartment of Mathematics, University of British Columbia, Vancouver, BC V6T 1Z1, Canada.ORCID 0000-0003-1556-5963
Matthieu WyartDepartment of Physics and Astronomy, Johns Hopkins University, Baltimore, MD 21218.

Funding

Canadian Government | Natural Sciences and Engineering Research Council of Canada (NSERC) RGPIN-2023-04449Simons Foundation (SF) 45495
6 · The paper itself

Abstract

There is evidence that the self-assembly of complex molecular systems often proceeds hierarchically, by first building subunits that later assemble in larger entities, in a process that can repeat multiple times. Yet, our understanding of this phenomenon and its performance is limited. Here, we introduce a simple model for hierarchical addressable self-assembly, where interactions between particles can be optimized to maximize the fraction of a well-formed target structure, or yield. We find that a hierarchical strategy leads to an impressive yield up to at least five generations of the hierarchy and does not require a cycle of temperatures as used in previous methods. High yield is obtained when the microscopic interaction decreases with the scale of units considered, such that the total interaction between intermediate structures remains identical at all scales. We provide thermodynamic and dynamical arguments constraining the interaction strengths where this strategy is effective. Overall, our work characterizes an alternative strategy for addressable self-assembly at a fixed temperature, and provides insight into the mechanisms sustaining hierarchical assembly in biological systems.

Indexed as

addressablehierarchyself-assemblysticky particles

Identifiers

PMID41124000
PMCPMC12582185

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
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.