Cross-Volume Theorem-Conflict Detection in Large Bilingual Monograph Libraries, Anti-Decay of Code Reproducibility and Erasure-Coded Cold Storage: chapter answers
A library of two hundred bilingual monographs, each with runnable programs, accumulates three kinds of trouble over time: one term is defined or valued differently in different volumes, the programs behind the printed numbers stop reproducing them as dependencies drift, and the media that keep the manuscripts fail or rot silently. This book turns the sayings "every volume was checked, so the library is consistent", "the code is public, so it can be tested for ever" and "keep a few more copies and rest easy" into computable arithmetic and asks under which parameters they hold. Library sizes, e…
DOI pending · monograph page goes live after publication · 5DL-B-182 · 中文版
- Chapter 1 · The Library as a Graph: Volumes, Chapters, Terms and Numeric Claims as Nodes
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… - Chapter 2 · Normalization and Hash Indexing: False Alarms and Misses in Cross-Volume Conflict Detection
Chapter 2 compares four comparators: one that only normalizes terms has a precision of 0.073, while the interval-overlap rule has no false alarms. - Chapter 3 · The Sampling Theory of Regression Audits: the Rule of Three and the Finite-Population Correction
Chapter 3 gives the rule of three for clean audits: showing a conflict rate below 0.01 with 95 % confidence takes 299 clean checks, almost regardless of library size. - Chapter 4 · The Decay of Code Reproducibility: Hazard Rates of Dependency Drift and Byte-Exact Output Regression
Chapter 4 uses a hazard model to show that standard-library programs have a half-life of 34.7 years against 2.2 years with five dependencies, and that a yearly byte-exact output comparison cuts the unknown failure-years… - Chapter 5 · Reed-Solomon over GF(2^8): Erasure Coding and Recovery in the Standard Library
Chapter 5 implements a systematic Reed-Solomon erasure code over GF(2^8) in standard-library Python; an overhead of 1.50 survives three lost blocks, and all 1,001 survivor sets of RS(10+4) decode. - Chapter 6 · The Reliability of Replicas and Erasure Codes: Binomial Windows, Markov Chains and Scrubbing for Bit Rot
Chapter 6 computes yearly data-loss probabilities with a binomial window model and Markov chains, showing that a twofold correlated acceleration of failures shrinks the MTTDL by 15.9 times and that, with a scrub every f… - Chapter 7 · Classical Sources: Siku Collation, the Fate of the Seven Pavilions and Lachmann's Stemmatics
Chapter 7 examines the collation records of the Siku quanshu and the fate of its seven pavilion copies alongside Lachmann's stemmatics: with four kindred copies and one independent copy, voting by manuscripts leaves 20.… - Chapter 8 · Practice and Falsification: a Publisher's Checklists for Consistency, Reproducibility and Cold Storage
Chapter 8 offers checklists for publishers, a cold-storage cost calculator, an errata register format and a pre-registered test protocol. Marked boxes separate published evidence, runnable Python calculations (20 progra…
Illustrative model calculation, not a live quote