What does Causal Graphs, Suspense Entropy and Foreshadowing conclude, in numbers, about “The Forgetting of Foreshadowing: Best Payoff Time, Mid-Way Reminders and a Ceiling on Open Threads”?

Answer: 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.

Scope of the numbers: Its serials, readers and parameters are illustrative models; all calculations are generated by its programs; it is not legal, financial or investment advice, and it keeps one red line: no false suspense to win clicks. Marked boxes separate published evidence, runnable Python calculations (21 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: 0.018, 0.678

payoff at chapter 60, initial stability 15 chapters
plansatisfactionrecall@Pstability
no reminder0.0180.01815.0
one at ch 300.4170.41934.5
one at ch 570.5860.92237.0
best one: ch 510.6780.78336.7
two even: ch 20, 400.6740.68953.8
best two: ch 19, 490.7520.83360.1
best three: ch 10, 25, 490.7720.85670.6
marginal gain of reminders 1, 2, 3: 0.659, 0.074, 0.020
Show the full program
# Chapter 5. p52: reminders for a long-range foreshadowing.
# A clue planted at chapter 0 pays off at chapter P = 60. Recall decays as
# exp(-age / S) from the last exposure. A light reminder at chapter r
# resets recall to 1 and, as in the spacing effect, raises stability more
# the more had been forgotten: S <- S (1 + G (1 - R(r))). A reminder d
# chapters before the payoff gives the payoff away with weight
# W exp(-d / DELTA). Satisfaction = appetite A(P) x recall at P x
# (1 - spoil). Exhaustive search over one, two and three positions.
# All parameters are illustrative.
import itertools
import math

P, S0, TAU, G, W, DELTA = 60, 15.0, 8.0, 1.5, 0.6, 6.0


def satisfaction(reminders):
    s, last = S0, 0
    for r in sorted(reminders):
        rec = math.exp(-(r - last) / s)
        s *= 1 + G * (1 - rec)
        last = r
    recall = math.exp(-(P - last) / s)
    spoil = math.fsum(W * math.exp(-(P - r) / DELTA) for r in reminders)
    appetite = 1 - math.exp(-P / TAU)
    return appetite * recall * max(0.0, 1 - spoil), recall, s


base = satisfaction(())
print("payoff at chapter {}, initial stability {:.0f} chapters".format(
    P, S0))
print("plan                      satisfaction  recall@P  stability")
print("{:<25} {:>12.3f}  {:>8.3f}  {:>9.1f}".format("no reminder", *base))
rows = [("one at ch 30", (30,)), ("one at ch 57", (57,))]
best1 = max(range(1, P), key=lambda r: satisfaction((r,))[0])
rows.append(("best one: ch {}".format(best1), (best1,)))
rows.append(("two even: ch 20, 40", (20, 40)))
best2 = max(itertools.combinations(range(1, P), 2),
            key=lambda rr: satisfaction(rr)[0])
rows.append(("best two: ch {}, {}".format(*best2), best2))
for label, rr in rows:
    print("{:<25} {:>12.3f}  {:>8.3f}  {:>9.1f}".format(
        label, *satisfaction(rr)))
best3 = max(itertools.combinations(range(1, P), 3),
            key=lambda rr: satisfaction(rr)[0])
print("{:<25} {:>12.3f}  {:>8.3f}  {:>9.1f}".format(
    "best three: ch {}, {}, {}".format(*best3), *satisfaction(best3)))
m = [satisfaction(x)[0] for x in ((), (best1,), best2, best3)]
print("marginal gain of reminders 1, 2, 3: {:.3f}, {:.3f}, {:.3f}".format(
    m[1] - m[0], m[2] - m[1], m[3] - m[2]))

Single source and citation

Fan, Y. (2026). Causal-DAG Validation of Long-Form Narrative, Sawtooth Scheduling of Chapter Suspense Entropy and Forgetting-Aware Foreshadowing Recovery (Version 1.0.0), Chapter 5: The Forgetting of Foreshadowing: Best Payoff Time, Mid-Way Reminders and a Ceiling on Open Threads. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-178 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026178,
  author    = {Fan, Yafu},
  title     = {Causal-DAG Validation of Long-Form Narrative, Sawtooth Scheduling of Chapter Suspense Entropy and Forgetting-Aware Foreshadowing Recovery},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book