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

The DOI matches its Crossref record.

Edholm's law of bandwidth

Cherry, S.·2004·IEEE Spectrum

Abstract

The author illustrates why telecommunications data rates are as predictable as Moore's Law.

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.1109/mspec.2004.1309810

Cites

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

Cited by

See all 382

Metadata

Authors
Cherry, S.
Venue
IEEE Spectrum
Published
2004-07
Volume
41
Issue
7
Pages
58-60
ISSN
  • 0018-9235 (ISSN-L)
  • 1939-9340
OpenAlex
W2055630539
Cited by
382
References
0
FWCI
11.53
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: Edholm's law of bandwidth. https://app.cochat.ai/papers/10.1109/mspec.2004.1309810
The paper
Cherry, S. (2004). Edholm's law of bandwidth. IEEE Spectrum. https://doi.org/10.1109/mspec.2004.1309810

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.