What does Short-Video Traffic Pools conclude, in numbers, about “The Zero-Ad-Spend Test Matrix: a Twelve-Run Plackett–Burman Design and Its Sample Size”?
Answer: Chapter 6 presents a zero-ad-spend Plackett-Burman matrix of twelve videos a week and three factors, whose main-effect variance is 0.333 of a single video's; detecting a completion difference of 0.04 takes 11 weeks.
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. printed values that match the answer: 0.333, 11
| video A hook B length C topic | |
| 1 result | 40s how-to |
| 2 question | 40s story |
| 3 result | 15s story |
| 4 question | 40s how-to |
| 5 question | 15s story |
| 6 question | 15s how-to |
| 7 result | 15s how-to |
| 8 result | 40s how-to |
| 9 result | 40s story |
| 10 question | 40s story |
| 11 result | 15s story |
| 12 question | 15s how-to |
| factor A: +1 in 6 videos, -1 in 6 | |
| factor B: +1 in 6 videos, -1 in 6 | |
| factor C: +1 in 6 videos, -1 in 6 | |
| columns A.B dot product | 0 |
| columns A.C dot product | 0 |
| columns B.C dot product | 0 |
| interaction alias: AB on C -0.333, AC on B -0.333, BC on A -0.333 | |
| variance of a main effect | 4/12 sigma^2 = 0.333 sigma^2 |
| one factor at a time, 3 baseline + 3 per factor: | |
| variance | 1/3 + 1/3 = 0.667 sigma^2, twice the matrix |
Show the full program
# Chapter 6. p61: the twelve-run Plackett-Burman matrix (1946).
# Twelve videos a week, three two-level factors (illustrative):
# A hook : question opening (-1) or result-first opening (+1)
# B length : about 15 s (-1) or about 40 s (+1)
# C topic : how-to (-1) or behind-the-scenes story (+1)
# Rows are the cyclic shifts of the Plackett-Burman generator plus a
# row of all -1; we keep the first three columns. Every factor is +1
# in six videos and -1 in six, and every pair of columns is
# orthogonal, so each main effect is estimated from all twelve videos
# at once: effect = mean(+1) - mean(-1), variance 4 sigma^2 / 12.
# The price: each two-factor interaction leaks into the third factor's
# main effect with weight -1/3 (partial aliasing, printed below).
GEN = [1, 1, -1, 1, 1, 1, -1, -1, -1, 1, -1]
rows = [GEN[-i:] + GEN[:-i] for i in range(11)] + [[-1] * 11]
X = [r[:3] for r in rows]
label = {("A", -1): "question", ("A", 1): "result",
("B", -1): "15s", ("B", 1): "40s",
("C", -1): "how-to", ("C", 1): "story"}
print("video A hook B length C topic")
for i, r in enumerate(X, 1):
print("%5d %-8s %-8s %s" % (i, label[("A", r[0])],
label[("B", r[1])],
label[("C", r[2])]))
cols = list(zip(*X))
for j, name in enumerate("ABC"):
print("factor %s: +1 in %d videos, -1 in %d"
% (name, cols[j].count(1), cols[j].count(-1)))
for a in range(3):
for b in range(a + 1, 3):
dot = 0
for u, v in zip(cols[a], cols[b]):
dot += u * v # step: integer count
print("columns %s.%s dot product = %d" % ("ABC"[a], "ABC"[b], dot))
alias = []
for a, b, o in ((0, 1, 2), (0, 2, 1), (1, 2, 0)):
tot = 0
for i in range(12):
tot += cols[a][i] * cols[b][i] * cols[o][i] # step: integer
alias.append("%s%s on %s %+.3f" % ("ABC"[a], "ABC"[b], "ABC"[o],
tot / 12.0))
print("interaction alias: " + ", ".join(alias))
print("variance of a main effect = 4/12 sigma^2 = 0.333 sigma^2")
print("one factor at a time, 3 baseline + 3 per factor:")
print(" variance = 1/3 + 1/3 = 0.667 sigma^2, twice the matrix")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 6: The Zero-Ad-Spend Test Matrix: a Twelve-Run Plackett–Burman Design and Its Sample Size. 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 7 · Classical Sources East and West: Sunzi's "Disposition" and Galton–Watson
- Chapter 8 · Closing the Loop: the Weekly Sheet, the Promotion Calculator and a Pre-registered Refutation Plan