What does Library Conflicts, Reproducibility and Erasure Codes conclude, in numbers, about “The Library as a Graph: Volumes, Chapters, Terms and Numeric Claims as Nodes”?
Answer: Chapter 1 draws the library as a knowledge graph and shows that the more volumes there are, the fewer places an error can hide: at 200 volumes, 0.9821 of deviant definitions in the illustrative library sit where another volume can contradict them.
Scope of the numbers: Library sizes, error rates, hazards and failure rates are illustrative; all calculations are generated by the programs in the book; the book is not legal, financial, procurement or storage-service advice. Chapter 1 draws the library as a knowledge graph and shows that the more volumes there are, the fewer places an error can hide: at 200 volumes, 0.9821 of deviant definitions in the illustrative library sit where another volume can contradict them.
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.9821, 200
| volumes terms in 2+ conflicting deviant hidden visible | |
| volumes terms defs defs share | |
| 10 | 19.4 1.18 7.20 6.00 0.1663 |
| 25 | 106.4 6.79 18.00 11.08 0.3842 |
| 50 | 317.1 22.10 36.00 13.38 0.6284 |
| 100 | 716.1 60.16 72.00 9.74 0.8647 |
| 200 | 1092.7 133.15 144.00 2.58 0.9821 |
| 400 | 1196.6 256.02 288.00 0.09 0.9997 |
| at 200 volumes | 133.15 conflicting terms expected, and 0.9821 of |
| deviant definitions sit where a second volume can contradict them |
Show the full program
# Chapter 1. p12: as a library grows, how many terms carry a detectable
# cross-volume conflict, and what share of deviant definitions can be seen
# at all. Exact binomial model: vocabulary V, each volume defines each
# term independently with probability Q, each definition deviates from
# the canonical one with probability E. A deviation is visible only when
# the same term is defined in at least one other volume. V, Q and E are
# illustrative, not estimates for any real library.
import math
V, Q, E = 1200, 0.02, 0.03
def row(n):
multi = 1 - (1 - Q) ** n - n * Q * (1 - Q) ** (n - 1)
terms = []
for k in range(2, n + 1):
pk = math.comb(n, k) * Q ** k * (1 - Q) ** (n - k)
terms.append(pk * (1 - (1 - E) ** k))
conflict = V * math.fsum(terms)
deviant = V * n * Q * E
hidden = V * n * Q * (1 - Q) ** (n - 1) * E
return multi * V, conflict, deviant, hidden
print("{:>7} {:>11} {:>12} {:>10} {:>10} {:>9}".format(
"volumes", "terms in 2+", "conflicting", "deviant", "hidden",
"visible"))
print("{:>7} {:>11} {:>12} {:>10} {:>10} {:>9}".format(
"", "volumes", "terms", "defs", "defs", "share"))
for n in (10, 25, 50, 100, 200, 400):
m, c, d, h = row(n)
print("{:>7} {:>11.1f} {:>12.2f} {:>10.2f} {:>10.2f} {:>9.4f}".format(
n, m, c, d, h, 1 - h / d))
m, c, d, h = row(200)
print("at 200 volumes: {:.2f} conflicting terms expected, and {:.4f} of"
.format(c, 1 - h / d))
print("deviant definitions sit where a second volume can contradict them")Single source and citation
Fan, Y. (2026). Cross-Volume Theorem-Conflict Detection in Large Bilingual Monograph Libraries, Anti-Decay of Code Reproducibility and Erasure-Coded Cold Storage (Version 1.0.0), Chapter 1: The Library as a Graph: Volumes, Chapters, Terms and Numeric Claims as Nodes. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-182 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026182,
author = {Fan, Yafu},
title = {Cross-Volume Theorem-Conflict Detection in Large Bilingual Monograph Libraries, Anti-Decay of Code Reproducibility and Erasure-Coded Cold Storage},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 2 · Normalization and Hash Indexing: False Alarms and Misses in Cross-Volume Conflict Detection
- Chapter 3 · The Sampling Theory of Regression Audits: the Rule of Three and the Finite-Population Correction
- Chapter 4 · The Decay of Code Reproducibility: Hazard Rates of Dependency Drift and Byte-Exact Output Regression
- Chapter 5 · Reed-Solomon over GF(2^8): Erasure Coding and Recovery in the Standard Library
- Chapter 6 · The Reliability of Replicas and Erasure Codes: Binomial Windows, Markov Chains and Scrubbing for Bit Rot
- Chapter 7 · Classical Sources: Siku Collation, the Fate of the Seven Pavilions and Lachmann's Stemmatics
- Chapter 8 · Practice and Falsification: a Publisher's Checklists for Consistency, Reproducibility and Cold Storage