What does Stories, Counter-Arguing and Checkout Bridges conclude, in numbers, about “The Dose of Transportation: Longer and Sadder Is Not Better”?

Answer: Chapter 2 derives a dose ceiling for transportation; in the illustrative model the best story segment is about 600 hanzi with light melodrama, while a long, tearful version keeps only 33.9 % of the best value; it also sets the ratio of an identifiable person to statistics.

Scope of the numbers: Parameters are illustrative, and all calculations are generated by the book's programs. This is general business analysis, not legal or medical advice; every story sample is an illustrative fiction, and no testimonial or real case is fabricated.

中文版

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: 33.9, 600

scales: transport saturates at 600, reach decays at 2,500 hanzi
A. value at the CTA by length (m = 0.25)
lengthTreachV
2000.2640.9230.4399
6000.5430.7870.4928
1,0000.6860.6700.4644
1,4000.7600.5710.4139
2,0000.8090.4490.3348
2,6000.8270.3530.2659
3,4000.8350.2570.1939
B. best length for each melodrama level
msbest LV at best
0.000.3006000.4860
0.250.3376000.4928
0.500.4506000.4823
0.750.6378000.4455
1.000.9001,0000.3680
C. overall best: L = 600 hanzi, m = 0.25, V = 0.4928
long and maudlin (3,400, m = 1): V = 0.1669, 33.9% of best
Show the full program
# Chapter 2. p21: story length and melodrama have a dose ceiling.
# Illustrative model built on p11 (all parameters are assumptions):
#   transport T(L, m) = min(0.95, 0.80 * (1 - exp(-L / 600)) + 0.15 m)
#   L = story length in hanzi before the call to action, m = melodrama
#   salience s(m) = 0.30 + 0.60 m^2   (overt tear-jerking is noticed)
#   reach r(L) = exp(-L / 2500)       (share still reading at the CTA)
#   value at the CTA V = r(L) * A(Q = 0.55, s, T), A from p11.
import math

B0, B1, B2 = -1.5, 3.0, 2.5
BETA, GAMMA = 0.30, 0.25


def shift(q, s, t):
    c = 1.0 / (1.0 + math.exp(-(B0 + B1 * s - B2 * t)))
    return math.fsum([q * (1.0 - c), BETA * t, -GAMMA * c * s])


def value(length, m):
    t = min(0.95, 0.80 * (1.0 - math.exp(-length / 600.0)) + 0.15 * m)
    s = 0.30 + 0.60 * m * m
    return math.exp(-length / 2500.0) * shift(0.55, s, t), t, s


if __name__ == "__main__":
    lengths = list(range(200, 3401, 200))
    print("scales: transport saturates at {:,}, reach decays at {:,} hanzi"
          .format(600, 2500))
    print("A. value at the CTA by length (m = 0.25)")
    print("  length   T      reach   V")
    for n in (200, 600, 1000, 1400, 2000, 2600, 3400):
        v, t, _ = value(n, 0.25)
        print("  {:>6,}  {:.3f}  {:.3f}   {:.4f}".format(
            n, t, math.exp(-n / 2500.0), v))
    print("B. best length for each melodrama level")
    print("    m     s     best L   V at best")
    for m in (0.0, 0.25, 0.5, 0.75, 1.0):
        best = max(lengths, key=lambda n: value(n, m)[0])
        v, _, s = value(best, m)
        print("  {:.2f}  {:.3f}  {:>6,}    {:.4f}".format(m, s, best, v))
    grid = [(value(n, m)[0], n, m) for n in lengths
            for m in (0.0, 0.25, 0.5, 0.75, 1.0)]
    v, n, m = max(grid)
    print("C. overall best: L = {:,} hanzi, m = {:.2f}, V = {:.4f}".format(
        n, m, v))
    v3 = value(3400, 1.0)[0]
    print("   long and maudlin (3,400, m = 1): V = {:.4f}, {:.1%} of best"
          .format(v3, v3 / v))

Single source and citation

Fan, Y. (2026). Commercial Storytelling Mechanics, Counter-Arguing Suppression Arcs and Seamless Narrative-to-Checkout Bridges (Version 1.0.0), Chapter 2: The Dose of Transportation: Longer and Sadder Is Not Better. 5D Library. DOI pending

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

BibTeX
@book{fan2026380,
  author    = {Fan, Yafu},
  title     = {Commercial Storytelling Mechanics, Counter-Arguing Suppression Arcs and Seamless Narrative-to-Checkout Bridges},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book