What does Short-Video Traffic Pools conclude, in numbers, about “Classical Sources East and West: Sunzi's "Disposition" and Galton–Watson”?
Answer: Chapter 7 examines Sunzi's "first make yourself unbeatable" (a video of quality 1.0 breaks out with probability only 0.0645) and the fixed point 0.522588 that Watson missed.
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: 0.0645, 1.0
| outcome | mean | R^2 from q | P at q = 1.0 |
| pass gates 1-1 | 0.5000 | 0.577 | 0.9656 |
| pass gates 1-2 | 0.2895 | 0.613 | 0.8122 |
| pass gates 1-3 | 0.1510 | 0.595 | 0.4061 |
| pass gates 1-4 | 0.0672 | 0.555 | 0.0645 |
| at q = 1.0, failing gate 1 has probability 0.0344 (in our hands); | |||
| breaking out has probability 0.0645 (it waits on the audience). |
Show the full program
# Chapter 7. p71: what lies in our own hands, read off the gate model.
# Sunzi, "Disposition of the army": first make yourself unbeatable,
# then wait for the enemy to become beatable; victory can be known
# but cannot be made. We read "unbeatable" as not failing gate 1 and
# "the enemy becoming beatable" as the later gates. Gate model of p11,
# illustrative, cohort quality q ~ Normal(0, 1). For each outcome Y
# (reaching gate k + 1) we report how much of Var(Y) is explained by
# quality, R^2 = Var(E[Y | q]) / Var(Y), and what a creator at
# q = 1.0 controls.
import math
T = [0.0, 0.5, 1.0, 1.5]
S = 0.3
def gate(q, t):
return 1.0 / (1.0 + math.exp(-(q - t) / S))
def reach(q, k):
return math.prod(gate(q, t) for t in T[:k])
H = 0.01
GRID = [-6.0 + H * i for i in range(1201)]
W = [H * math.exp(-q * q / 2.0) / math.sqrt(2.0 * math.pi) for q in GRID]
print("outcome mean R^2 from q P at q = 1.0")
for k in range(1, 5):
p = [reach(q, k) for q in GRID]
m = math.fsum(w * x for w, x in zip(W, p))
vq = math.fsum(w * (x - m) ** 2 for w, x in zip(W, p))
print("pass gates 1-%d %7.4f %10.3f %13.4f"
% (k, m, vq / (m * (1.0 - m)), reach(1.0, k)))
print("at q = 1.0, failing gate 1 has probability %.4f (in our hands);"
% (1.0 - gate(1.0, 0.0)))
print("breaking out has probability %.4f (it waits on the audience)."
% reach(1.0, 4))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 7: Classical Sources East and West: Sunzi's "Disposition" and Galton–Watson. 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
- Chapter 1 · Promotion as a Product: Four Threshold Gates and the Nonlinear Return to Quality
- Chapter 2 · Branching Processes: Galton–Watson Cascades, Criticality and Overdispersion
- Chapter 3 · Why the Step Becomes a Ramp: Finite Batches, Logistic Promotion and the Bottleneck Gate
- Chapter 4 · Completion, Engagement, Replay: the Statistics of Three Rulers
- Chapter 5 · More Posts or Better Posts: the Linear Ledger and the Multiplicative Ledger
- Chapter 6 · The Zero-Ad-Spend Test Matrix: a Twelve-Run Plackett–Burman Design and Its Sample Size
- Chapter 8 · Closing the Loop: the Weekly Sheet, the Promotion Calculator and a Pre-registered Refutation Plan