Google's Graph Distance Patent — How Entity Proximity Determines Authority

Google measures how many relationship hops separate your entity from trusted authority nodes. The closer you are, the more authority you inherit. Most businesses are sitting five or six hops away from the nearest trust source — and wondering why they can't rank.

The Web as a Graph — How Google Thinks About Trust

Google doesn't just count links. It maps the web as a graph — a network of nodes (pages, entities) and edges (links, relationships). In this graph, some nodes are designated as trusted seeds: Wikipedia, government domains, major news organisations, academic institutions.

Trust flows outward from these seeds through links and entity relationships. A site directly linked to by Wikipedia has a graph distance of 1 from a trusted seed. A site linked to by a site that is linked to by Wikipedia has a distance of 2. The further you are from the nearest trusted seed, the less authority you inherit from the trust propagation model.

The Seed Set — Google's Trust Foundation

Google's trust model starts with a manually curated seed set of highly authoritative, verified websites. These are the root nodes of the trust graph. Every other site's trustworthiness is calculated relative to its distance from these roots.

The seed set includes (but is not limited to):

• Wikipedia and the Wikimedia Foundation properties
• Government domains (.gov, .gov.uk, etc.)
• Academic institutions (.edu domains)
• Major news organisations (BBC, Reuters, AP, NYT)
• Industry regulatory bodies and professional associations

A business that has a Wikidata entry is one hop from Wikipedia — a seed node. A business mentioned in a Reuters article is one hop from Reuters — another seed node. A business with no external citations is potentially dozens of hops from the nearest seed, or not connected at all.

How Graph Distance Affects Rankings

The graph distance model explains a phenomenon that confuses many SEOs: why does a site with fewer backlinks sometimes outrank a site with more? Because the site with fewer backlinks is closer to a trusted seed. A single link from Wikipedia is worth more than 1,000 links from low-authority directories — not just because of PageRank, but because of graph distance.

Entity Relationships — How Schema Markup Reduces Graph Distance

Schema markup with sameAs relationships is a direct mechanism for reducing graph distance. When your schema says:

"sameAs": [
  "https://www.wikidata.org/wiki/Q[YOUR_Q_NUMBER]",
  "https://linkedin.com/company/your-company",
  "https://en.wikipedia.org/wiki/Your_Company"
]

You are telling Google's Knowledge Graph parser: “This entity is the same as these verified entities.” If those entities are close to seed nodes, your entity inherits that proximity. The sameAs relationship is a graph edge — and it reduces your distance from the authority nodes those entities are connected to.

The Recursive Authority Loop — Engineering Proximity at Scale

The FIF Protocol's Infrastructure stage is specifically designed to reduce graph distance through a recursive authority loop. The mechanism:

1. Press release on a high-authority news outlet (1 hop from a seed node) mentions the business.
2. That press release links to the business website.
3. The business website's schema markup has sameAs pointing to Wikidata.
4. Wikidata is directly connected to Wikipedia (a seed node).
5. The business is now 2–3 hops from two different seed nodes simultaneously.

Each additional press mention, each additional sameAsrelationship, each additional backlink from an authority-adjacent site reduces graph distance further. This is what “recursive authority” means in practice — and it's the mechanism behind Patent US6285999B1.

Graph Distance and AI Citation Probability

LLMs were trained on web data. The entities closest to authority nodes in the web graph appear most frequently in high-authority contexts — Wikipedia articles, news coverage, academic papers. These entities are disproportionately represented in LLM training data.

When ChatGPT or Gemini forms a recommendation, it draws on this training data. Entities with low graph distance from authority nodes appear in more training contexts and with higher confidence. The result: reducing your graph distance from authority nodes improves both Google rankings and AI citation probability simultaneously. This is the unified theory behind the GEO framework.

Frequently Asked Questions