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

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

A dynamic inertia weight particle swarm optimization algorithm

Jiao, Bin, Lian, Zhigang, Gu, Xingsheng·2008·Chaos, Solitons & Fractals

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1016/j.chaos.2006.09.063

Cites

19 of 19 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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 19 references

Cited by

See all 272

Metadata

Authors
Jiao, B., Lian, Z., & Gu, X.
Venue
Chaos, Solitons & Fractals
Publisher
Elsevier BV
Published
2008-08
Volume
37
Issue
3
Pages
698-705
ISSN
0960-0779 (ISSN-L)
OpenAlex
W2018700453
Cited by
272
References
19
FWCI
8.04
Type
journal article
Language
en
Open access
closed

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: A dynamic inertia weight particle swarm optimization algorithm. https://app.cochat.ai/papers/10.1016/j.chaos.2006.09.063
The paper
Jiao, B., Lian, Z., & Gu, X. (2008). A dynamic inertia weight particle swarm optimization algorithm. Chaos, Solitons & Fractals. https://doi.org/10.1016/j.chaos.2006.09.063

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.