PageRank SEO: Why Modern Search Optimization Is an Information Architecture Problem Author: Daniel Kliewer Date: 2026-09-03 Tags: SEO, PageRank, Graph, Information Architecture, Search, MCP, Agent, Open Source, Local-First, SDK, Hermes Description: Why modern SEO is increasingly an information-architecture and systems-engineering problem, and how the open-source pagerank-seo SDK turns the idea into a working, evidence-traceable auditor for Python scripts, CI pipelines, and autonomous agents. ---![Graph visualization](/images/1103012.png) *September 3, 2026 · Daniel Kliewer* **Modern SEO is an engineering discipline where search reputation, information architecture, code quality, machine-readable representation, and user experience converge.** It should be understood not as optimizing individual pages, but as optimizing the information graph a website presents to search engines and users. This essay makes the case, walks through the implementation, and releases the open-source [pagerank-seo](https://github.com/kliewerdaniel/pagerank-seo) SDK that turns the idea into something a Python script, a CI pipeline, or an autonomous agent can run. --- ## From keyword stuffing to graph reasoning SEO used to be a textual problem. In the late 1990s, the problem was literal text: keyword density, meta keywords, hidden text. The [original PageRank paper](http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf) already disagreed. The paper opens by noting that *"the importance of a web page is an inherently subjective matter… But there is still much that can be said objectively about the relative importance of web pages."* The objective thing Page and Brin said was: a page's importance propagates through the **links** pointing at it, not the words inside it. Twenty-six years later, almost every documented Google concern about a website is, at some level, a graph concern: - **Crawlable structure.** Crawlers extract links from known pages to discover new ones. A site with a broken internal-link graph *cannot be fully crawled.* - **Canonicalization.** Google clusters duplicate pages and chooses a canonical representative. A site that fans out into hundreds of near-duplicate URLs forces the engine to do more work, with worse results, for everyone. - **Helpful content.** The unit of analysis is not a page; it's a *site* — and a site's quality is, in part, a graph property. - **Sitemaps.** Sitemaps tell Google about pages and the *relationships between them*. The word is literally "site-map" — a map of the structure. The unit of optimization that matters is the site-as-graph, not the page-as-text. --- ## Modeling a website as a graph A graph `G = (V, E)` has nodes and edges. For a website: - Each **page** is a node. - Each **internal hyperlink** is a directed edge, carrying metadata (anchor text, `rel` attribute, DOM position). From this graph we compute **PageRank** (public-domain algorithm, damping factor 0.85, dangling-node correction), **weighted PageRank** (edges weighted by link position and `rel`), **in/out degree**, **weakly-connected components**, **orphan pages** (in-degree zero, excluding seed), **Gini coefficient of PageRank**, and **top-1 PageRank share**. I am explicitly *not* claiming that the PageRank number produced here equals Google's score. It is an analytical tool for reasoning about the site. All the original PageRank patents expired in September 2019. --- ## The six layers SEO splits into six interacting layers, each depending on the ones below it: 1. **Technical representation** — charset, title, meta description, canonical, viewport, JSON-LD, robots directives. 2. **Information architecture** — URL hierarchy, breadcrumbs, sitemap, orphan pages, deep pages. 3. **Link graph** — PageRank, weighted PageRank, in/out degree, weakly-connected components, Gini, top-1 share. 4. **Semantic relevance** — title/content overlap, heading structure, duplicate titles, thin content. 5. **User experience** — `