What does Computational Bibliometrics and Self-Verifying Books conclude, in numbers, about “Practice: Costs, the Long Tail and a Checklist”?
Answer: Chapter 8 prices the gates, shows that ten errors leave a reference book 0.608 of its long-run attention, and gives a checklist. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.
Scope of the numbers: Its readers, books, error rates and costs are illustrative models; all calculations are generated by its programs; the book is not legal, financial or publishing advice. Marked boxes separate published evidence, runnable Python calculations (16 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.608
| errors | reference book | trend book |
|---|---|---|
| 0 | 4.256 (1.000) | 0.903 (1.000) |
| 1 | 3.981 (0.935) | 0.889 (0.985) |
| 3 | 3.536 (0.831) | 0.862 (0.955) |
| 10 | 2.588 (0.608) | 0.786 (0.870) |
Show the full program
# Chapter 8. p16: Why residual errors cost a long-tail book the most.
# Yearly attention follows p01's Lomax law (1 + t/2)^-1.2. Readers find
# each remaining error at a rate proportional to attention (0.15 a year
# at full attention); every found error cuts all later attention by a
# quarter (trust, p07). We print 30-year attention for books that ship
# with 0, 1, 3 or 10 errors, averaged over 20,000 runs (seed 101), and
# the same for a trend book (Weibull, p01).
import math
import random
from math import exp
rng = random.Random(101)
def lomax(t):
return (1 + t / 2.0) ** -1.2
def weib(t):
return exp(-(t / 1.0) ** 1.5)
def run(errors, curve, years=30, steps=12):
h = 1.0 / steps
left, mult, total = errors, 1.0, 0.0
for i in range(years * steps):
t = (i + 0.5) * h
a = curve(t) * mult
total += a * h
for _ in range(left):
if rng.random() < 0.15 * a * h:
left -= 1
mult *= 0.75
return total
if __name__ == "__main__":
print(" errors reference book trend book")
base = {}
for e in (0, 1, 3, 10):
r = math.fsum(run(e, lomax) for _ in range(20000)) / 20000
w = math.fsum(run(e, weib) for _ in range(20000)) / 20000
base.setdefault("r", r)
base.setdefault("w", w)
print(" {:6d} {:8.3f} ({:.3f}) {:6.3f} ({:.3f})".format(
e, r, r / base["r"], w, w / base["w"]))Single source and citation
Fan, Y. (2026). Computational Bibliometrics, Falsification-First Rhetoric and Self-Verifying Monograph Compilers (Version 1.0.0), Chapter 8: Practice: Costs, the Long Tail and a Checklist. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-101 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026101,
author = {Fan, Yafu},
title = {Computational Bibliometrics, Falsification-First Rhetoric and Self-Verifying Monograph Compilers},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Two Survival Laws: Why Most Books Fade and a Few Keep Being Read
- Chapter 2 · Surprise, Anchors and Completion
- Chapter 3 · Falsify, Then Bound: The Bayesian Case and Its Limits
- Chapter 4 · The Trust Ratchet Turns Both Ways
- Chapter 5 · Proofreading Floors and Whitelist Gates
- Chapter 6 · The Self-Verifying Compiler: Code Points and the Whole Pipeline
- Chapter 7 · Liu Xie, Dai Zhen and Knuth: Old Rules for Checkable Writing