Computational Bibliometrics, Falsification-First Rhetoric and Self-Verifying Monograph Compilers: chapter answers
This book turns the methods of 5D Library on the library itself. Why do most books stop being read within a few years while a few keep being read and cited? Does opening with a refuted overclaim earn more trust than self-praise? Can a bilingual manuscript be compiled so that every printed number is checked against the program that produced it? The book writes these claims as runnable arithmetic and then asks when they hold. 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.
DOI pending · monograph page goes live after publication · 5DL-B-101 · 中文版
- Chapter 1 · Two Survival Laws: Why Most Books Fade and a Few Keep Being Read
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… - Chapter 2 · Surprise, Anchors and Completion
Chapter 2 measures surprise in bits: a correction from 10 times to 1.35 carries 12.65 bits; the best steady dose in a toy reader is 1.2 bits a section; and sales data overstate the value of anchors 3.39 times. - Chapter 3 · Falsify, Then Bound: The Bayesian Case and Its Limits
Chapter 3 gives the Bayesian case for "falsify, then bound": with a likelihood ratio of 12, tripling trust needs a prior at or below 0.273; when only significant small studies are published, a true ratio of 1.35 has a m… - Chapter 4 · The Trust Ratchet Turns Both Ways
Chapter 4 shows that one found error cancels 17.8 good checks. - Chapter 5 · Proofreading Floors and Whitelist Gates
Chapter 5 shows that when errors differ in visibility three human passes still leave 0.14950 of them, and that a whitelist cannot catch swaps between true numbers. - Chapter 6 · The Self-Verifying Compiler: Code Points and the Whole Pipeline
Chapter 6 surveys the code points that print like ideographs (all 214 Kangxi radicals) and computes that the whole pipeline takes a draft with 81 wrong numbers to an expected 1.322, with a chance of no error of 0.2665,… - Chapter 7 · Liu Xie, Dai Zhen and Knuth: Old Rules for Checkable Writing
A true gloss fits each passage with chance 0.95, a plausible false one with chance 0.50. Starting from a prior of 0.30, one fitting passage moves belief only to 0.4488; four passages to 0.8481; eight to 0.9864; and 9 ar… - Chapter 8 · Practice: Costs, the Long Tail and a Checklist
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), clas…
Illustrative model calculation, not a live quote