hinton_number
ABOUT

What is a
Hinton number?

The Erdős number, rebuilt for the deep-learning era. Paul Erdős wrote 1,500+ papers; mathematicians measure their distance to him in co-authorship hops. We do the same with Geoffrey E. Hinton as the origin.

scroll ↓
THE_IDEA
  1. Geoffrey E. Hinton← the origin, distance 0
  2. co-authored a paper together
  3. his co-authorhinton_number = 1
  4. co-authored with a 1
  5. their co-authorhinton_number = 2
  6. …the shortest co-authorship path…
  7. youhinton_number = ?

Co-author a paper with Hinton and your number is 1; co-author with a 1 and yours is 2 — your Hinton number is the length of the shortest co-authorship path from you back to Hinton.

THE_DATA
0M
papers
0M
authors
0M
co-author edges

Everything comes from the full dblp.org dump (CC0 1.0) — the computer-science bibliography. We rebuild the co-author graph and re-run the computation monthly; the verified date on every badge is that build date. Nothing is computed live: your lookup reads a precomputed table.

one BFS from Hinton's node
HOW_ITS_COMPUTED
  1. 01Parse every paper in DBLP; two people share an edge if they co-authored at least one paper. Papers with more than 25 authors are excluded — a 300-author consortium paper is not a handshake.
  2. 02Run one breadth-first search from Hinton's node over all 31.3M edges. Every author gets a distance and a parent pointer — that pointer chain is the shortest path shown on your page.
  3. 03Count the distinct shortest paths of that length (the "via N paths" line) and your percentile among all ~3.8M connected authors.
THE_STATISTICS

Almost everyone
is connected.

Of the 4.3M authors in DBLP, 0% have a finite path to Hinton. Each square below is ~21,000.0 authors — the gray ones have published, but never within reach of the giant connected component.

connected: ~3.8M authors∞: ~0.3M
THE_INNER_CIRCLE

Distance 1 is a club of 224.

Only 224 people ever co-authored a paper directly with Hinton — the top 0.006% of connected authors. Being a 1 is rarer, among CS authors, than being struck by lightning in your lifetime.

HALL_OF_FAME — famous hinton_numbers
1
Yoshua Bengio
1
Yann LeCun
1
Ilya Sutskever
1
Alex Krizhevsky
THE_ANCESTORS

The man the metric is named
after is 3 hops away.

The Hinton number is measured in a unit invented for Paul Erdős — and Erdős himself has a Hinton number of 3. Legends who never touched deep learning have one too; publish anywhere near the field's ancestry and the graph finds you.

HALL_OF_LEGENDS — hinton_numbers across a century
3
Paul Erdős
3
Claude Shannon
3
Donald Knuth
4
John von Neumann
3
Noam Chomsky
3
Terence Tao
2
Marvin Minsky
2
Judea Pearl
3
Tim Berners-Lee
Alan Turing is in DBLP — but has no path. He published alone, or with people the connected graph never absorbed. Not even the father of the field is guaranteed a number.
DISTANCE_DISTRIBUTION

The whole field sits at 4.

The most common distance is 4 — 55% of connected authors sit there, and 96% land between 3 and 5. Distances above 7 are vanishingly rare.

<1%
<1%
20.9%
54.7%
20.1%
3.1%
<1%
<1%
<1%
<1%
mean 4.06
1
2
3
4
5
6
7
8
9
10+
4.06
mean distance
4
median
4
mode (55%)
12
max observed
DEGREES_OF_SEPARATION

ML is a tighter web
than mathematics.

Mean distance to the center of each famous small world. The average Hinton number beats the average Erdős number — deep learning collaborates harder.

Kevin Bacon — actors (Bacon number)2.9
random Facebook users, any two3.5
Geoffrey Hinton — CS authors4.06
Paul Erdős — mathematicians4.65
shorter bar = smaller world · Bacon/Erdős/Facebook figures from published studies
LINK_STRENGTH

Hops aren't the whole story.

Hop count treats a one-off workshop paper the same as a decade of collaboration. Link strength doesn't. We use the standard co-authorship tie strength from network science — Newman's collaboration weight (M. E. J. Newman, 2001) — where each shared paper adds 1 / (co-authors − 1) to an edge: many small-team papers make a strong edge; one 25-author paper adds almost nothing.

SHORTEST (3 hops, thin)
you1 paper each — fragilehinton
STRONGEST (4 hops, heavy) ← your real lineage
you12 · 7 · 23 · 5 shared papers — thickness = weighthinton

We find your strongest route to Hinton (it may take more hops than the shortest one) and report where that strength ranks, as a percentile. A long chain of heavy collaborations can outrank a short chain of thin ones. The ten-box meter on your badge is that percentile in 10-point steps:

link_strength = top 0% (example)
FAQ

Why is my number ∞? You have no path to Hinton in DBLP yet — usually meaning no indexed publication. Your first paper is your ticket in.

I can't find myself / that isn't me. Names collide; pick yourself by the paper titles shown in search. Author identity follows DBLP's disambiguation.

Non-CS papers? Not yet — DBLP covers computer science. Broader sources are on the roadmap.

your_hinton_number = ?
find_your_number()
data: dblp.org (CC0 1.0) · graph verified 2026-07-21
privacy · contact · find your number
not affiliated with, endorsed by, or sponsored by Geoffrey Hinton