What does Narrative Transportation and Scroll Rhythms conclude, in numbers, about “Scroll Depth as Survival: Weibull Hazards, Censoring and Cliff Sections”?
Answer: Chapter 5 treats scroll depth as a survival time: under negative aging the first two screens lose 0.347 of readers, while average scroll depth records a true willingness of 8.55 screens as 5.43.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not individual legal, advertising-compliance or financial advice, and it teaches no deception. Marked boxes separate published evidence, runnable Python calculations (20 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: 5.43, 8.55
| depth | true S | naive share | Kaplan-Meier |
|---|---|---|---|
| 2 | 0.653 | 0.653 | 0.653 |
| 4 | 0.500 | 0.497 | 0.497 |
| 6 | 0.398 | 0.391 | 0.391 |
| 10 | 0.268 | 0.202 | 0.260 |
| 16 | 0.161 | 0.079 | 0.155 |
| sessions censored by the page end: 0.218 | |||
| naive mean depth 5.43; true mean depth 8.55 screens |
Show the full program
# Chapter 5. p52: "Average scroll depth" versus a survival estimate.
# Readers' willingness to scroll is Weibull (K = 0.7, median 4 screens).
# Pages differ in length (LENGTHS screens); a reader who reaches the end
# of a page is censored, not lost: we never learn how far they would have
# gone. We compare the naive share "reached 10 screens" among all
# sessions with the Kaplan-Meier estimate and with the truth.
# Fixed-seed Monte Carlo; parameters are illustrative.
import math
import random
import statistics as st
rng = random.Random(20261112)
K, MED = 0.7, 4.0
LAM = MED / math.log(2) ** (1 / K)
LENGTHS = (6, 10, 16, 24)
N = 4000
obs = []
for _ in range(N):
d = LAM * (-math.log(1 - rng.random())) ** (1 / K)
length = rng.choice(LENGTHS)
obs.append((min(d, length), d < length))
obs.sort()
def km(at):
s, risk = 1.0, len(obs)
for t, event in obs:
if t > at:
break
if event:
s *= 1 - 1 / risk
risk -= 1
return s
print("depth true S naive share Kaplan-Meier")
for x in (2, 4, 6, 10, 16):
true = math.exp(-(x / LAM) ** K)
naive = len([1 for t, _ in obs if t >= x]) / N
print("{:5d} {:6.3f} {:11.3f} {:12.3f}".format(x, true, naive, km(x)))
cens = len([1 for _, e in obs if not e]) / N
print("sessions censored by the page end: {:.3f}".format(cens))
print("naive mean depth {:.2f}; true mean depth {:.2f} screens".format(
st.fmean([t for t, _ in obs]), LAM * math.gamma(1 + 1 / K)))Single source and citation
Fan, Y. (2026). Narrative Transportation, Cognitive-Dissonance Disarming and Dopaminergic Scroll Rhythms in High-Conversion Long-Form Copy (Version 1.0.0), Chapter 5: Scroll Depth as Survival: Weibull Hazards, Censoring and Cliff Sections. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-141 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026141,
author = {Fan, Yafu},
title = {Narrative Transportation, Cognitive-Dissonance Disarming and Dopaminergic Scroll Rhythms in High-Conversion Long-Form Copy},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Narrative Transportation: Scale Reliability, Attenuation and the Cost of Breaking a Story
- Chapter 2 · Cognitive Dissonance: the Dissonance Ratio, Four Exits and What "Breaking Defences" Really Means
- Chapter 3 · Falsify First: Two-Sided Messages, the Size of a Concession and the Persuasion-Knowledge Backfire
- Chapter 4 · Open Loops: the Zeigarnik Replication Debate and the Pace of Closing an Information Gap
- Chapter 6 · The "Dopamine" Rhythm: Reward-Prediction Errors, Hook Debt and the True Ledger of Pressure
- Chapter 7 · The Classics Examined: Persuasions of the Zhanguo ce and Aristotle's Rhetoric
- Chapter 8 · Practice and Falsification: the Persuasive-Copy Checker, Rules for Closing in Private Messages and a Pre-Registered Test