What does Short-Video Traffic Pools conclude, in numbers, about “More Posts or Better Posts: the Linear Ledger and the Multiplicative Ledger”?

Answer: Chapter 5 finds an interior optimum for expected breakouts under a budget of production time (1.189 and 1.334 a week in the illustrations); the polished plan goes a quarter without a breakout with probability 0.069, the high-volume plan with 0.687.

Scope of the numbers: Chapter 3 shows that a hard threshold is a ramp in the data, whose width narrows from 0.124 to 0.023 as the batch grows from 100 to 3,000 viewers; the illustrative base video breaks out with probability 0.03585, with the bottleneck at the fourth gate. Marked boxes separate published evidence, runnable Python calculations (18 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: 1.189, 1.334

n/wkh/videoq_satE[break]q_logE[break]
124.01.5990.4972.2920.918
212.01.5710.9411.7921.334
38.01.4891.1791.5001.210
46.01.3831.1891.2920.893
64.01.1780.8751.0000.387
83.01.0110.5470.7920.156
122.00.7790.2140.5000.028
241.00.4540.0370.0000.000
best n: saturating 4 (1.189/wk), logarithmic 2 (1.334/wk)
six a week (h = 4) vs best: 0.74 and 0.29 of the best

Key formula

\[E(n) = n \cdot P\bigl(q(H/n)\bigr).\]
Show the full program
# Chapter 5. p51: a fixed weekly budget split into n videos.
# A creator has H = 24 production hours a week (illustrative). With h
# hours per video the latent quality is q(h), and each video breaks
# out with P(q) from the four logistic gates of p11. Expected
# breakouts per week = n * P(q(H / n)): linear in n at fixed quality,
# but quality falls as n rises. Two illustrative quality curves:
#   saturating  q(h) = 1.6 * (1 - exp(-h / 3))
#   logarithmic q(h) = 0.5 + 0.5 * log2(h / 2)
import math

T = [0.0, 0.5, 1.0, 1.5]
S = 0.3
H = 24.0


def P(q):
    return math.prod(1.0 / (1.0 + math.exp(-(q - t) / S)) for t in T)


def q_sat(h):
    return 1.6 * (1.0 - math.exp(-h / 3.0))


def q_log(h):
    return 0.5 + 0.5 * math.log2(h / 2.0)


print("  n/wk  h/video   q_sat  E[break]   q_log  E[break]")
best = {}
for n in (1, 2, 3, 4, 6, 8, 12, 24):
    h = H / n
    es, el = n * P(q_sat(h)), n * P(q_log(h))
    for key, val in (("sat", es), ("log", el)):
        if key not in best or val > best[key][1]:
            best[key] = (n, val)
    print("%6d  %7.1f  %6.3f  %8.3f  %6.3f  %8.3f"
          % (n, h, q_sat(h), es, q_log(h), el))
print("best n: saturating %d (%.3f/wk), logarithmic %d (%.3f/wk)"
      % (best["sat"][0], best["sat"][1], best["log"][0], best["log"][1]))
print("six a week (h = 4) vs best: %.2f and %.2f of the best"
      % (6 * P(q_sat(4.0)) / best["sat"][1],
         6 * P(q_log(4.0)) / best["log"][1]))

Single source and citation

Fan, Y. (2026). Cold-Start Dynamics of Short-Video Traffic Pools: Step Thresholds in Completion, Engagement and Replay and a Zero-Ad-Spend Breakout Test Matrix (Version 1.0.0), Chapter 5: More Posts or Better Posts: the Linear Ledger and the Multiplicative Ledger. 5D Library. DOI pending

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

BibTeX
@book{fan2026273,
  author    = {Fan, Yafu},
  title     = {Cold-Start Dynamics of Short-Video Traffic Pools: Step Thresholds in Completion, Engagement and Replay and a Zero-Ad-Spend Breakout Test Matrix},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book