What does Long-Tail Information Gain and Indexation conclude, in numbers, about “The Indexation Schedule: Poisson Discovery, Host Queues and Batch Launches in the First Thirty Days”?
Answer: Chapter 5 splits the "sandbox" into discovery delay and host queueing: an orphan page has a median first crawl of 89.33 days, which falls to 7.30 days once it is in the sitemap, and enriching pages before releasing them in value order gives a 30-day indexed value share of 0.7038 against 0.0654 for launching everything at once.
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: 30, 7.30, 89.33
| new host, queue mean 6 days | |||
| scenario | median | P(<=7d) | P(<=30d) |
| orphan page | 89.33 | 0.0234 | 0.1806 |
| sitemap only | 7.30 | 0.4791 | 0.9869 |
| sitemap + hub link | 5.45 | 0.6124 | 0.9916 |
| + IndexNow (if joined) | 4.25 | 0.6837 | 0.9932 |
| known host, queue mean 1.5 days | |||
| scenario | median | P(<=7d) | P(<=30d) |
| orphan page | 84.69 | 0.0448 | 0.2113 |
| sitemap only | 3.63 | 0.8222 | 0.9999 |
| sitemap + hub link | 2.25 | 0.9653 | 1.0000 |
| + IndexNow (if joined) | 1.13 | 0.9900 | 1.0000 |
Show the full program
# Chapter 5. p51: time to first crawl as discovery delay plus queue
# delay. Discovery channels are independent exponential clocks, so the
# discovery delay D is exponential with the summed rate a; the queue
# delay after discovery C is exponential with rate b (host-level crawl
# capacity). T = D + C has the hypoexponential distribution
# F(t) = 1 - (b exp(-a t) - a exp(-b t)) / (b - a).
# Rates are illustrative (per day). IndexNow is a public protocol that
# some engines join and others do not; for an engine outside it, the
# channel simply does not exist.
import math
CHANNELS = {
"external": 1 / 120.0, # someone else happens to link
"sitemap": 1 / 3.0, # sitemap refetched every 3 days on average
"hub link": 1 / 2.0, # linked from a hub recrawled every 2 days
"indexnow": 1 / 0.1, # push notice, participating engines only
}
def cdf(t, a, b):
if abs(a - b) < 1e-12:
return 1 - math.exp(-a * t) * (1 + a * t)
return 1 - (b * math.exp(-a * t) - a * math.exp(-b * t)) / (b - a)
def median(a, b):
lo, hi = 0.0, 2000.0
for _ in range(100):
mid = (lo + hi) / 2
if cdf(mid, a, b) < 0.5:
lo = mid
else:
hi = mid
return hi
SCEN = [
("orphan page", ["external"]),
("sitemap only", ["external", "sitemap"]),
("sitemap + hub link", ["external", "sitemap", "hub link"]),
("+ IndexNow (if joined)", ["external", "sitemap", "hub link",
"indexnow"]),
]
if __name__ == "__main__":
for label, b in (("new host, queue mean 6 days", 1 / 6.0),
("known host, queue mean 1.5 days", 1 / 1.5)):
print(label)
print(" scenario median P(<=7d) P(<=30d)")
for name, ch in SCEN:
a = math.fsum(CHANNELS[c] for c in ch)
print(" {:<23} {:>6.2f} {:.4f} {:.4f}".format(
name, median(a, b), cdf(7, a, b), cdf(30, a, b)))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 5: The Indexation Schedule: Poisson Discovery, Host Queues and Batch Launches in the First Thirty Days. 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 3 · A Floor on Information Gain: Shingles, SimHash and Unique Facts per Page
- Chapter 4 · Internal-Link Topology: the PageRank Funnel and the Stationary Share of the Inquiry Page
- 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