What does Computational Bibliometrics and Self-Verifying Books conclude, in numbers, about “Two Survival Laws: Why Most Books Fade and a Few Keep Being Read”?
Answer: Chapter 1 shows that "three years to waste paper" is a parameter, not a law: a trend book with a rising hazard keeps 0.0055 of its first-year attention at year 3 and a reference book with a falling hazard 0.3330, yet a trend book that starts more than 11.08 times larger is never overtaken; and citation totals are finite.
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.0055, 0.3330, 11.08
year trend left ref left trend hazard ref hazard
1 0.3679 0.6147 1.500 0.400
3 0.0055 0.3330 2.598 0.240
10 0.0000 0.1165 4.743 0.100
30 0.0000 0.0359 8.216 0.037
attention-years over 30 years: trend 0.903, ref 4.257
all-time totals: trend 0.903, ref 10.000; ref can never catch a
trend book that starts more than 11.08 times larger
trend book starts 1 times larger: ref overtakes in year 0.5
trend book starts 2 times larger: ref overtakes in year 3.4
trend book starts 3 times larger: ref overtakes in year 7.7
trend book starts 5 times larger: ref overtakes in year 38.2Show the full program
# Chapter 1. p01: Two kinds of book, two survival laws. A "trend" book's
# yearly attention follows a Weibull survival exp(-(t/lam)^k) with k > 1
# (decline speeds up); a "reference" book follows a Lomax (Pareto II) law
# (1 + t/s)^-a, whose hazard falls with age. Illustrative parameters.
# We print the share of first-year attention left, the hazard, and the
# year in which the reference book's cumulative attention overtakes a
# trend book that starts R times larger.
import math
from math import exp, gamma
LAM, K = 1.0, 1.5 # trend book: Weibull scale (years), shape
S, A = 2.0, 1.2 # reference book: Lomax scale (years), shape
def weib(t):
return exp(-(t / LAM) ** K)
def lomax(t):
return (1 + t / S) ** -A
def haz_w(t):
return K / LAM * (t / LAM) ** (K - 1)
def haz_l(t):
return A / (S + t)
def cum(f, T, n=30000):
h = T / n
return h * math.fsum(f((i + 0.5) * h) for i in range(n))
def crossover(r, horizon=200.0):
# first year in which cum(lomax) >= r * cum(weib)
t, step = 0.0, 0.05
while t < horizon:
t += step
if cum(lomax, t, 2000) >= r * cum(weib, t, 2000):
return t
return None
if __name__ == "__main__":
print(" year trend left ref left trend hazard ref hazard")
for t in (1, 3, 10, 30):
print(" {:4d} {:9.4f} {:8.4f} {:12.3f} {:10.3f}".format(
t, weib(t), lomax(t), haz_w(t), haz_l(t)))
cw, cl = cum(weib, 30), cum(lomax, 30)
print(" attention-years over 30 years: trend {:.3f}, ref {:.3f}"
.format(cw, cl))
tot_w = LAM * gamma(1 + 1 / K)
tot_l = S / (A - 1)
print(" all-time totals: trend {:.3f}, ref {:.3f}; ref can never"
" catch a".format(tot_w, tot_l))
print(" trend book that starts more than {:.2f} times larger"
.format(tot_l / tot_w))
for r in (1, 2, 3, 5):
x = crossover(r)
print(" trend book starts {} times larger: ref overtakes "
"{}".format(r, "never (200 y)" if x is None
else "in year {:.1f}".format(x)))Single source and citation
Fan, Y. (2026). Computational Bibliometrics, Falsification-First Rhetoric and Self-Verifying Monograph Compilers (Version 1.0.0), Chapter 1: Two Survival Laws: Why Most Books Fade and a Few Keep Being Read. 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 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
- Chapter 8 · Practice: Costs, the Long Tail and a Checklist