Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 301

The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.

Network dismantling

Open access
Braunstein, Alfredo, Dall’Asta, Luca, Semerjian, Guilhem, Zdeborová, Lenka · 2016 · Proceedings of the National Academy of Sciences

Abstract

Significance: Many systems of interest can be represented by a network of nodes connected by edges. In many circumstances, the existence of a giant component is necessary for the network to fulfill its function. Motivated by the need to understand optimal attack strategies, optimal spread of information, or immunization policies, we study the network dismantling problem (i.e., the search for a minimal set of nodes in which removal leaves the network broken into components of subextensive size). We give the size of the optimal dismantling set for random networks, propose an efficient dismantling algorithm for general networks that outperforms by a large margin existing strategies, and provide various insights about the problem.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1073/pnas.1605083113

Cites

22 of 22 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 22 references

Cited by

See all 301

Metadata

Authors
Braunstein, A., Dall’Asta, L., Semerjian, G., & Zdeborová, L.
Venue
Proceedings of the National Academy of Sciences
Published
2016-10-18
Volume
113
Issue
44
Pages
12368-12373
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
OpenAlex
W2572289316
Cited by
301
References
22
FWCI
11.72
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Network dismantling. https://app.cochat.ai/papers/10.1073/pnas.1605083113
The paper
Braunstein, A., Dall’Asta, L., Semerjian, G., & Zdeborová, L. (2016). Network dismantling. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1605083113

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.