Metcalfe's Law after 40 Years of Ethernet¶
Metcalfe, B. (2013). Metcalfe's Law after 40 Years of Ethernet. Computer, 46(12), 26-31.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Common-Medium Intermediation
- The argument is combinatorial: the count of pairwise translations grows as N times N-minus-one over two, while the count of one-to-medium adaptations grows as N.
This sourceStates the network-value law derived from the N(N−1)/2 possible pairwise connections versus N adopters of a shared standard — the combinatorial basis of the hub collapse and the network effect.
- The argument is combinatorial: the count of pairwise translations grows as N times N-minus-one over two, while the count of one-to-medium adaptations grows as N.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:44a9b6418013 · see in the full table