What does Long-Tail Information Gain and Indexation conclude, in numbers, about “A Floor on Information Gain: Shingles, SimHash and Unique Facts per Page”?
Answer: Chapter 3, the spine of the book, derives from shingle resemblance, SimHash and a site-mean model a floor on unique facts per page, from 1.72 to 8.31 facts in the book's setting; adding 1,000 pages with a single fact each to a site of 400 pages lowers modelled traffic by 0.5091.
Scope of the numbers: Parameters are illustrative and all calculations come from the book's programs. This is general business analysis, not personalised advice: property content is not legal, tax or investment advice, the tarot material offers no personal readings, and all data are synthetic.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 1.72, 1000, 400, 8.31
| site mean q0 d_new u* (unique facts) g(u*) | |
| 0.5 | 3 3.23 0.4165 |
| 0.5 | 15 1.72 0.2498 |
| 0.7 | 3 5.25 0.5831 |
| 0.7 | 15 2.58 0.3498 |
| 0.9 | 3 8.31 0.7497 |
| 0.9 | 15 3.58 0.4497 |
| bulk launch on a site of 400 pages, q0 | 0.7, d_new = 3 |
| new pages u traffic before after change | |
| 1,000 | 1 2,940.0 1,443.2 -0.5091 |
| 1,000 | 4 2,940.0 3,099.0 +0.0541 |
| 1,000 | 12 2,940.0 5,554.9 +0.8894 |
| 200 | 12 2,940.0 3,562.2 +0.2116 |
Show the full program
# Chapter 3. p33: a lower bound on unique facts per page (author's
# hypothesis model, not a published ranking formula). A page with u
# unique facts has usefulness g(u) = 1 - exp(-u / U0). Its own traffic
# is d * g(u) * Q, where Q is the mean usefulness of all pages on the
# site (a site-level quality factor). Adding a page with g below the
# site mean lowers Q for every existing page. Marginal traffic:
# dT = d_new g(u) Q' + n d0 q0 (Q' - Q), Q' = (n q0 + g(u)) / (n + 1)
# u* is the smallest u with dT >= 0 (bisection on a real u). All
# parameters are illustrative.
import math
U0 = 6.0
N0, D0 = 400, 15.0 # existing pages and their monthly demand each
def g(u):
return 1.0 - math.exp(-u / U0)
def d_traffic(u, q0, d_new, n=N0):
q = q0
q2 = (n * q0 + g(u)) / (n + 1.0)
return math.fsum([d_new * g(u) * q2, n * D0 * q0 * (q2 - q)])
def u_star(q0, d_new):
if d_traffic(0.0, q0, d_new) >= 0:
return 0.0
lo, hi = 0.0, 200.0
for _ in range(80):
mid = (lo + hi) / 2.0
if d_traffic(mid, q0, d_new) >= 0:
hi = mid
else:
lo = mid
return hi
def bulk(m, u, q0):
base = N0 * D0 * q0 * q0
q2 = (N0 * q0 + m * g(u)) / float(N0 + m)
after = math.fsum([N0 * D0 * q0 * q2, m * 3.0 * g(u) * q2])
return base, after
if __name__ == "__main__":
print("site mean q0 d_new u* (unique facts) g(u*)")
for q0 in (0.5, 0.7, 0.9):
for d_new in (3.0, 15.0):
us = u_star(q0, d_new)
print(" {:.1f} {:>4.0f} {:>6.2f} {:.4f}"
.format(q0, d_new, us, g(us)))
print("bulk launch on a site of 400 pages, q0 = 0.7, d_new = 3")
print(" new pages u traffic before after change")
for m, u in ((1000, 1.0), (1000, 4.0), (1000, 12.0), (200, 12.0)):
b, a = bulk(m, u, 0.7)
print(" {:>8,} {:>3.0f} {:>12,.1f} {:>8,.1f} {:>+7.4f}".format(
m, u, b, a, a / b - 1.0))Single source and citation
Fan, Y. (2026). Programmatic SEO Long-Tail Topology, Rapid Indexation and High-Intent Organic Traffic Harvesting across Multi-Domain Fleets (Version 1.0.0), Chapter 3: A Floor on Information Gain: Shingles, SimHash and Unique Facts per Page. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-346 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026346,
author = {Fan, Yafu},
title = {Programmatic SEO Long-Tail Topology, Rapid Indexation and High-Intent Organic Traffic Harvesting across Multi-Domain Fleets},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Zipf Long Tail: Head, Tail and Intent-Weighted Cash
- Chapter 2 · The Keyword Matrix: Cartesian Products, Feasible Cells and the First Hundred Pages
- Chapter 4 · Internal-Link Topology: the PageRank Funnel and the Stationary Share of the Inquiry Page
- Chapter 5 · The Indexation Schedule: Poisson Discovery, Host Queues and Batch Launches in the First Thirty Days
- Chapter 6 · A Fleet of Domains: Independent Value, a Division of Queries and hreflang Clusters
- Chapter 7 · Reading the Sources: Zheng Qiao's Classes in the Tongzhi and Vannevar Bush's Associative Trails
- Chapter 8 · Closing the Loop: the Batch Ledger, the Information-Gain and Indexation Scheduler, and Pre-Registered Refutation