Science Atlas

How We Know What We Know
Connections

Path Finder

Pick any two entries and see the chain of recorded relations that links them, one hop at a time. Every step is a connection somebody wrote down in the atlas, not a resemblance this page inferred.

Choose Two Entries

Search for an entity by name and choose the starting point; a second search chooses the destination.

Names and descriptions are both searched, and accents are ignored.

How the Chain Is Chosen

  • Every hop is a relation somebody recorded in the atlas. Nothing here is inferred, and the atlas's own filing edges, which place every entry in its category, are not counted as connections.
  • Links the atlas has tested and rejected are excluded, so a chain never routes through a claim we exist to correct.
  • The shortest chain always wins. Where two chains are the same length, the one through more specific relations is preferred, because almost anything can be joined to almost anything through a shared language or tradition.
  • Disputed links are walkable and are marked where they appear.
  • The search gives up after 6 hops.