What does Pruning a Domain Portfolio conclude, in numbers, about “Generative Search and Entity Consistency: Only Structured Data that Visitors Can See”?
Answer: Part B adds the owner's own page, always accurate and marked up with visible structured data. With five other sources, the chance of a correct answer rises from 0.5094 to 0.7206 when \(q\) is 0.40, from 0.7463 to 0.8869 when \(q\) is 0.55, and from 0.9104 to 0.9703 when \(q\) is 0.70. The owner's page is the only source entirely under the owner's control, and it does most good when consistency elsewhere is poor.
Scope of the numbers: Chapter 2 examines the price evidence: in the illustrative model a repeat-sales estimate is biased upwards by 0.1284, and applying the index's growth of 0.0723 a year leads to systematic under-pruning. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.
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: 0.40, 0.5094, 0.55, 0.70, 0.7206, 0.7463
| A. chance the engine states the current value | |
| sources q | 0.40 q=0.55 q=0.70 q=0.85 |
| 3 | 0.4480 0.6490 0.8260 0.9520 |
| 5 | 0.5094 0.7463 0.9104 0.9869 |
| 9 | 0.5986 0.8646 0.9776 0.9992 |
| 13 | 0.6661 0.9259 0.9942 1.0000 |
| B. adding the owner's consistent page (n | 5) |
| q 0.40 | 0.5094 -> 0.7206 |
| q 0.55 | 0.7463 -> 0.8869 |
| q 0.70 | 0.9104 -> 0.9703 |
| C. fixing two stale listings vs adding two new ones, q 0.55 | |
| 5 sources at q 0.55 | 0.7463 |
| 7 sources at q 0.55 | 0.8173 |
| 5 sources at q 0.95 (fixed) | 0.9995 |
Show the full program
# Chapter 6. p61: consistent facts across sources and the answer an
# engine gives. Model: an answer engine reads n independent sources
# about one business attribute (address, hours, phone). Each source
# shows the current value with chance q, else one of k = 3 stale
# values at random. The engine repeats the plurality value; a tie that
# includes the current value counts as a fair coin among the tied.
# Exact enumeration of all count vectors (multinomial). Adding the
# owner's own page, kept consistent and marked up with visible
# structured data, adds one source with q = 1. Values illustrative.
import itertools
import math
def p_correct(n, q, k=3, own=0):
terms = []
for counts in itertools.product(range(n + 1), repeat=k + 1):
if math.fsum(counts) != n:
continue
coef = math.factorial(n)
for c in counts:
coef //= math.factorial(c)
pr = coef * q ** counts[0]
for c in counts[1:]:
pr *= ((1 - q) / k) ** c
mine = counts[0] + own
top = max(counts[1:])
if mine > top:
terms.append(pr)
elif mine == top:
ties = 1 + len([c for c in counts[1:] if c == top])
terms.append(pr / ties)
return math.fsum(terms)
if __name__ == "__main__":
print("A. chance the engine states the current value")
print(" sources q=0.40 q=0.55 q=0.70 q=0.85")
for n in (3, 5, 9, 13):
row = [p_correct(n, q) for q in (0.40, 0.55, 0.70, 0.85)]
print(" {:>7} {:>7.4f} {:>7.4f} {:>7.4f} {:>7.4f}".format(
n, *row))
print("B. adding the owner's consistent page (n = 5)")
for q in (0.40, 0.55, 0.70):
print(" q {:.2f}: {:.4f} -> {:.4f}".format(
q, p_correct(5, q), p_correct(5, q, own=1)))
print("C. fixing two stale listings vs adding two new ones, q 0.55")
print(" 5 sources at q 0.55: {:.4f}".format(
p_correct(5, 0.55)))
print(" 7 sources at q 0.55: {:.4f}".format(
p_correct(7, 0.55)))
print(" 5 sources at q 0.95 (fixed): {:.4f}".format(
p_correct(5, 0.95)))Single source and citation
Fan, Y. (2026). Real-Options Valuation of Geo-Exact Domain Portfolios, Optimal Renewal Pruning and the Moats of Organic Search (Version 1.0.0), Chapter 6: Generative Search and Entity Consistency: Only Structured Data that Visitors Can See. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-341 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026341,
author = {Fan, Yafu},
title = {Real-Options Valuation of Geo-Exact Domain Portfolios, Optimal Renewal Pruning and the Moats of Organic Search},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Carrying Cost and the Development Option: the Value of Waiting, Renewal Fees and Two Boundaries
- Chapter 2 · The Price Evidence: Repeat-Sales Indices, Survivorship Bias and the Cost of Holding
- Chapter 3 · A Finite-Horizon Lattice: Renewing, Lapsing and Building Year by Year
- Chapter 4 · Pruning under a Budget: the Knapsack, the Greedy Ratio and a Ten-Year Back-Test of Policies
- Chapter 5 · Rank, Clicks and Direct Navigation: Where the Moat of a Geo-Exact Name Comes From
- Chapter 7 · Classics East and West: Bai Gui's "Take What Others Discard" and Henry George on Land Speculation
- Chapter 8 · The Annual Renewal Audit and a Plan for Refutation