What does Creative Fatigue and Orthogonal Remixing conclude, in numbers, about “What an Orthogonal Array Can Estimate: Building L4, L8, L9 and L16, Main-Effect Efficiency and the Structure of Aliasing”?
Answer: Chapter 3 builds L4, L8, L9 and L16 from scratch; the contrast variance is 0.6667 under L9 against 2.0000 one factor at a time, but a hook-by-call-to-action synergy lands wholly on the pain-point module.
Scope of the numbers: Parameters are illustrative; all calculations come from the book's programs. This is general business analysis, not individual advice, and promises no advertising result.
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.6667, 2.0000
contrast variance, level 1 minus level 0, noise sd 1: L9 : 0.6667 (3 runs per level mean) OFAT: 2.0000 (one run against the base run) Monte Carlo 20,000 runs, A1-A0 (true 0.3): L9 mean 0.2925 variance 0.6706 OFAT mean 0.3025 variance 1.9962 synergy bonus 0.2 when hook level = CTA level; level means: hook L9 0.067 0.067 0.067 full 0.067 0.067 0.067 pain L9 0.200 0.000 0.000 full 0.067 0.067 0.067 proof L9 0.067 0.067 0.067 full 0.067 0.067 0.067 cta L9 0.067 0.067 0.067 full 0.067 0.067 0.067
Show the full program
# Chapter 3. p33: what L9 buys (precision) and what it costs (aliasing)
# Part 1: variance of a level contrast with nine runs, L9 versus
# one-factor-at-a-time (OFAT: a base run plus two runs per factor).
# Part 2: a hook-by-CTA synergy (bonus when hook level equals CTA level)
# in L9 columns A=i, B=j, C=i+j, D=i+2j (mod 3) versus the full 81.
import itertools
import math
import random
SIG = 1.0
print("contrast variance, level 1 minus level 0, noise sd 1:")
print(" L9 : {:.4f} (3 runs per level mean)".format(SIG * (1 / 3 + 1 / 3)))
print(" OFAT: {:.4f} (one run against the base run)".format(SIG * 2))
rng = random.Random(40033)
TRUE = [0.0, 0.3, 0.1] # factor A level effects, others zero
l9 = [[i, j, (i + j) % 3, (i + 2 * j) % 3]
for i, j in itertools.product(range(3), repeat=2)]
ofat = [[0, 0, 0, 0]]
for f in range(4):
for lv in (1, 2):
r = [0, 0, 0, 0]
r[f] = lv
ofat.append(r)
e9, eo = [], []
for _ in range(20000):
y9 = [TRUE[r[0]] + rng.gauss(0, SIG) for r in l9]
m1 = math.fsum(y for y, r in zip(y9, l9) if r[0] == 1) / 3
m0 = math.fsum(y for y, r in zip(y9, l9) if r[0] == 0) / 3
e9.append(m1 - m0)
yo = [TRUE[r[0]] + rng.gauss(0, SIG) for r in ofat]
eo.append(yo[1] - yo[0])
print("Monte Carlo 20,000 runs, A1-A0 (true 0.3):")
for name, es in (("L9 ", e9), ("OFAT", eo)):
m = math.fsum(es) / len(es)
v = math.fsum((e - m) ** 2 for e in es) / (len(es) - 1)
print(" {} mean {:.4f} variance {:.4f}".format(name, m, v))
BONUS = 0.2
full = list(itertools.product(range(3), repeat=4))
def level_means(rows, f):
out = []
for lv in range(3):
ys = [BONUS * (r[0] == r[3]) for r in rows if r[f] == lv]
out.append(math.fsum(ys) / len(ys))
return out
print("synergy bonus {:.1f} when hook level = CTA level; level means:"
.format(BONUS))
for f, name in enumerate(["hook", "pain", "proof", "cta"]):
a = level_means(l9, f)
b = level_means(full, f)
print(" {:<5} L9 {} full {}".format(
name, " ".join("{:.3f}".format(x) for x in a),
" ".join("{:.3f}".format(x) for x in b)))Single source and citation
Fan, Y. (2026). Ad-Creative Fatigue Half-Lives, Orthogonal Storyboard Recombination and Automated Permutation Rendering (Version 1.0.0), Chapter 3: What an Orthogonal Array Can Estimate: Building L4, L8, L9 and L16, Main-Effect Efficiency and the Structure of Aliasing. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-400 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026400,
author = {Fan, Yafu},
title = {Ad-Creative Fatigue Half-Lives, Orthogonal Storyboard Recombination and Automated Permutation Rendering},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Fatigue Curve Is Not an Exponential: the Two-Factor Process of Repetition and the Estimation of Half-Lives
- Chapter 2 · Pausing Brings Recovery: Naik-Type Dynamics, Frequency Caps and the Size of a Rotation
- Chapter 4 · How Different Are Recombined Creatives? Hamming Distance, Correlated Performance and the Shared Fatigue of Shared Shots
- Chapter 5 · How Many Winners Can a Hundred Creatives Reveal? Sample Size, the False Discovery Rate and the Signal-to-Noise Ratio of Advertising Returns
- Chapter 6 · The Platform Will Not Run Your Experiment: the Bias of Allocating by Prediction and Thompson-Sampling Races
- Chapter 7 · Classical Sources: the Changes of Five Notes, the Art of Combination and Nothing New Under the Sun
- Chapter 8 · Closing the Loop: the Fatigue-and-Remix Ledger, Field Tools and Checker Specifications