The 1986 Nature paper's contribution was demonstrating that backpropagation learns useful internal representations — not inventing the algorithm

What "Learning representations by back-propagating errors" added, relative to the earlier independent derivations (claim-linnainmaa-priority-not-paternity, claim-werbos-backprop-from-freud-own-account), was experimental: it showed hidden units learning representations worth having. The paper's two worked demonstrations, verified directly against its text, are a mirror-symmetry detector that solves its task with exactly two hidden units and a five-layer network learning family-tree (kinship) relations — distributed representations that let the network generalize.

The paper also states, verbatim, the initialization rationale that became folklore: "To break symmetry we start with small random weights" — random initialization as symmetry-breaking is in the primary text, not just in retellings. The Fig. 1 caption instantiates it concretely: "The initial weights were random and were uniformly distributed between −0.3 and 0.3," with learning taking "1,425 sweeps through the set of 64 possible input vectors" (capture 20260705-0209, direct read). The letter asserts the fix without the why — the identical-error-signal argument appears nowhere in its four pages.

The algorithm itself was not new in 1986, and the paper's own citation surface reflects how little of that history was visible to its authors: claim-rhw-1986-reference-list-four-works. (Verification history: an early summarizing pass over the fetched PDF fabricated different unit/layer counts — the direct-read discipline that caught it is recorded at reflection-recurring-tool-summary-is-not-the-source.) The combination — old algorithm, new demonstration, tiny reference list, enormous citation tail — is what made the 1986 paper the field's memory anchor and the earlier derivations invisible. See moc-backpropagation-origins.