Causal-DAG Validation of Long-Form Narrative, Sawtooth Scheduling of Chapter Suspense Entropy and Forgetting-Aware Foreshadowing Recovery: chapter answers
Anyone who publishes a novel that runs to hundreds of chapters answers three questions every week: does the world contradict itself, how many chapters should separate the hooks, and how long should a planted clue wait for its payoff? Writing courses have slogans for all three, none of which data could refute. This book writes them as directed graphs, as entropy with a Markov retention chain, and as forgetting curves with survival analysis, and asks for which parameters each slogan holds. Its serials, readers and parameters are illustrative models; all calculations are generated by its program…
DOI pending · monograph page goes live after publication · 5DL-B-178 · 中文版
- Chapter 1 · The Causal Graph: Kahn's Topological Sort and Version Conflicts in a Setting
Chapters 1 and 2 use Kahn's topological sort and a version check grouped by key to find time paradoxes and attributes written with two values, and show that cross-volume retcons hide in implied order: one edge in volume… - Chapter 2 · Cross-Volume Retcons: Incremental Cycle Detection, Transitive Closure and the Author's Own Forgetting
Cross-volume retcons have two sources. One is implied order: in the illustrative serial a harmless-looking edge in volume six closes a cycle, contradicting a chain of 10 stated edges written between volume 2 and volume… - Chapter 3 · The Entropy of Suspense: Bayesian Readers, Contrary Evidence and the Suspense Budget
Once suspense is written as entropy, a hook acquires a precise mathematical identity: it is evidence for an ending the reader did not favour, so it can raise entropy, even though evidence lowers entropy on average. The… - Chapter 4 · Sawtooth Scheduling: Hook Spacing and a Markov Model of Serial Retention
Chapter 4 solves for the best hook spacing under sawtooth entropy, gap-dependent churn and habituation: under illustrative parameters a hook every three chapters keeps 0.234 of readers at chapter 100 against 0.098 for a… - Chapter 5 · The Forgetting of Foreshadowing: Best Payoff Time, Mid-Way Reminders and a Ceiling on Open Threads
Chapter 5 gives a closed form for the best payoff time; one well-placed light reminder raises satisfaction from 0.018 to 0.678, and a climax leaning on 6 clues is fully understood with probability only 0.531. - Chapter 6 · The Survivors Who Keep Reading: Reader Heterogeneity, Survivor Bias and Censoring
Chapter 6 shows that reader heterogeneity makes late hooks look spectacular in naive comparisons (a ratio of 0.194 for a true effect of zero), and that a naive ratio puts retention at chapter 50 at 0.0918 where the prod… - Chapter 7 · The Classics Examined: Jin Shengtan's "How to Read the Fifth Book of Genius" against Aristotle's *Poetics*
Jin Shengtan's grass-snake ash line, clouds across the mountain and lead-in correspond to this book's spread light reminders, release of overload and short-range foreshadowing. In the illustrative models six light menti… - Chapter 8 · Practice and Falsification: A Publisher's Checklist, a Persuasive-Copy Checker and a Pre-Registered Test
Chapter 8 gives a checklist, an eight-rule persuasive-copy checker and a pre-registered protocol: comparing hook schedules needs 3,044 readers per arm, and evaluating a single hook needs 583,531 starting readers per arm…
Illustrative model calculation, not a live quote