What does Causal Graphs, Suspense Entropy and Foreshadowing conclude, in numbers, about “The Classics Examined: Jin Shengtan's "How to Read the Fifth Book of Genius" against Aristotle's *Poetics*”?

Answer: 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 mentions give a satisfaction of 0.820 against 0.574 for one loud reminder, one interlude chapter raises retention over a twelve-chapter siege from 0.677 to 0.737, and the best distance for a lead-in is about 4.48 chapters. Aristotle's standard of unity removes 5 nodes from the illustrative graph, and his demand for the unexpected that follows from causes can be scored as earned surprise. The disagreement between the two classics reminds us to distinguish structural unity from sustained reading, and to hand both to data.

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.574, 0.677, 0.737, 0.820, 4.48

(1) object pays off at chapter 40; recall x (1 - spoil)
never mentioned again0.036
one loud mention at 370.574
one loud mention at 250.554
six faint mentions0.820
(2) 12-chapter siege arc, kept: unbroken 0.677, with interlude 0.737
(3) lead-in k chapters before a big episode; appetite x recall:
k1 0.099, k=2 0.158, k=4 0.202, k=5 0.202, k=9 0.151, k=15 0.069
best k = TAU ln(1 + SL / TAU)4.48 chapters
Show the full program
# Chapter 7. p71: three of Jin Shengtan's devices as testable models.
# (1) Grass-snake ash line: an object is mentioned faintly many times
#     before it matters. Memory model of p52: a mention resets recall and
#     raises stability by G (1 - R); a faint mention has gain GF and
#     gives the payoff away with weight WF, a loud one GL and WL.
# (2) Clouds cutting across the mountain: an interlude chapter inside a
#     long high-tension arc releases entropy; churn law of p41.
# (3) Lead-in: a small episode k chapters before a big one starts the
#     appetite 1 - exp(-k / TAU) early, but is itself recalled only with
#     exp(-k / SL): the lead-in is a short foreshadowing (p51 form).
# Parameters are illustrative; the devices are Jin's, the numbers are not.
import math

P, S0, TAU, DELTA = 40, 12.0, 8.0, 6.0
GF, WF, GL, WL, SL = 0.6, 0.08, 1.5, 0.6, 6.0


def payoff(mentions):
    s, last, spoil = S0, 0, 0.0
    for r, g, w in sorted(mentions):
        s *= 1 + g * (1 - math.exp(-(r - last) / s))
        last = r
        spoil += w * math.exp(-(P - r) / DELTA)
    return math.exp(-(P - last) / s) * max(0.0, 1 - spoil)


print("(1) object pays off at chapter {}; recall x (1 - spoil)".format(P))
plans = [("never mentioned again", []),
         ("one loud mention at 37", [(37, GL, WL)]),
         ("one loud mention at 25", [(25, GL, WL)]),
         ("six faint mentions", [(r, GF, WF) for r in range(6, 37, 6)])]
for label, m in plans:
    print("    {:<24} {:.3f}".format(label, payoff(m)))


def arc(interlude, n=12, h=1.6, rho=0.25):
    s = 1.0
    for t in range(1, n + 1):
        h *= 1 - rho
        if interlude and t == n // 2:
            h *= 0.5
        else:
            h = min(3.0, h + 1.0)
        s *= 1 - (0.005 + 0.06 * math.exp(-1.5 * h)
                  + 0.03 * max(0.0, h - 2.0) ** 2)
    return s


print("(2) 12-chapter siege arc, kept: unbroken {:.3f},".format(
    arc(False)) + " with interlude {:.3f}".format(arc(True)))
print("(3) lead-in k chapters before a big episode; appetite x recall:")
cells = []
for k in (1, 2, 4, 5, 9, 15):
    v = (1 - math.exp(-k / TAU)) * math.exp(-k / SL)
    cells.append("k={} {:.3f}".format(k, v))
print("    " + ", ".join(cells))
print("    best k = TAU ln(1 + SL / TAU) = {:.2f} chapters".format(
    TAU * math.log(1 + SL / TAU)))

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 7: The Classics Examined: Jin Shengtan's "How to Read the Fifth Book of Genius" against Aristotle's *Poetics*. 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