What does Creative Fatigue and Orthogonal Remixing conclude, in numbers, about “Closing the Loop: the Fatigue-and-Remix Ledger, Field Tools and Checker Specifications”?
Answer: Chapter 8 gives the fatigue-and-remix ledger, a rendering and naming pipeline, the distilled Creative Fatigue Half-Life and Orthogonal Remix Scheduler, checker specifications grouped by the four kits and pre-registered tests. Boxes separate published evidence, runnable Python calculations (22 programs), classical sources and hypotheses.
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 only
| id | genes freq cap | h | level | rules | manifest |
|---|---|---|---|---|---|
| c01 0000 | 3.1 | 5 | 4.2 GREEN | - | 9a6ba7f8962f |
| c02 0112 | 4.3 | 5 | 4.0 YELLOW | F1 | 6deba194c7fb |
| c03 0221 | 5.6 | 4 | 3.9 RED | F1 | 7cb5bd6aa68a |
| c04 1011 | 2.4 | 3 | 2.1 RED | F2 | 830e42da4c8a |
| c05 1120 | 2.0 | 5 | 4.4 RED | F7 | 5bace3f826fe |
| c06 1202 | 2.2 | 5 | 4.1 RED | F4 | 6a585524cb98 |
| c07 2022 | 2.5 | 5 | 4.6 RED | F5 | bc5aff4b2d92 |
| c08 2101 | 1.8 | 5 | 4.0 RED | F3,F6 | 184d7b92a6ce |
Show the full program
# Chapter 8. p81: red / yellow / green rules on a creative ledger
# Eight illustrative ledger rows (no real account). Rules:
# F1 frequency above cap -> red; at 0.8 of cap or more -> yellow
# cap = 1 + floor(h * log2(c0 V / m)), c0 0.012, V 2.0, m 0.012
# F2 half-life upper bound below 0.7 x last month -> red;
# point estimate below 0.85 x last month -> yellow
# F3 licence missing or expired -> red; 14 days or less -> yellow
# F4 AI-synthetic footage without platform label -> red
# F5 "winner" declared without FDR correction -> red
# F6 proof shot not verified as real (or not marked illustrative) -> red
# F7 manifest hash differs from the registered hash -> red
import hashlib
import math
C0, V, M = 0.012, 2.0, 0.012
def cap(h):
return 1 + math.floor(h * math.log2(C0 * V / M))
def manifest(r):
keys = ("id", "genes", "lic", "ai", "label", "proof")
text = "|".join(str(r[k]) for k in keys)
return hashlib.sha256(text.encode("ascii")).hexdigest()[:12]
ROWS = [
dict(id="c01", genes="0000", freq=3.1, h=4.2, lo=3.6, hi=4.9, prev=4.0,
lic=120, ai=False, label=False, win=False, fdr=False, proof=True),
dict(id="c02", genes="0112", freq=4.3, h=4.0, lo=3.5, hi=4.6, prev=4.1,
lic=60, ai=False, label=False, win=False, fdr=False, proof=True),
dict(id="c03", genes="0221", freq=5.6, h=3.9, lo=3.3, hi=4.4, prev=4.0,
lic=90, ai=False, label=False, win=False, fdr=False, proof=True),
dict(id="c04", genes="1011", freq=2.4, h=2.1, lo=1.7, hi=2.6, prev=4.0,
lic=90, ai=False, label=False, win=False, fdr=False, proof=True),
dict(id="c05", genes="1120", freq=2.0, h=4.4, lo=3.8, hi=5.0, prev=4.3,
lic=9, ai=False, label=False, win=False, fdr=False, proof=True),
dict(id="c06", genes="1202", freq=2.2, h=4.1, lo=3.4, hi=4.8, prev=4.0,
lic=200, ai=True, label=False, win=False, fdr=False, proof=True),
dict(id="c07", genes="2022", freq=2.5, h=4.6, lo=4.0, hi=5.3, prev=4.4,
lic=150, ai=False, label=False, win=True, fdr=False, proof=True),
dict(id="c08", genes="2101", freq=1.8, h=4.0, lo=3.2, hi=4.9, prev=3.9,
lic=None, ai=True, label=True, win=False, fdr=False, proof=False),
]
REG = {r["id"]: manifest(r) for r in ROWS}
ROWS[4]["lic"] = 45 # licence edited after registration
def judge(r):
red, yel = [], []
c = cap(r["h"])
if r["freq"] > c:
red.append("F1")
elif r["freq"] >= 0.8 * c:
yel.append("F1")
if r["hi"] < 0.7 * r["prev"]:
red.append("F2")
elif r["h"] < 0.85 * r["prev"]:
yel.append("F2")
if r["lic"] is None or r["lic"] < 0:
red.append("F3")
elif r["lic"] <= 14:
yel.append("F3")
if r["ai"] and not r["label"]:
red.append("F4")
if r["win"] and not r["fdr"]:
red.append("F5")
if not r["proof"]:
red.append("F6")
if manifest(r) != REG[r["id"]]:
red.append("F7")
level = "RED" if red else ("YELLOW" if yel else "GREEN")
return c, level, red + yel
print("id genes freq cap h level rules manifest")
for r in ROWS:
c, level, why = judge(r)
print("{} {} {:>4.1f} {:>3} {:>4.1f} {:<7} {:<10} {}".format(
r["id"], r["genes"], r["freq"], c, r["h"], level,
",".join(why) or "-", manifest(r)))Single source and citation
Fan, Y. (2026). Ad-Creative Fatigue Half-Lives, Orthogonal Storyboard Recombination and Automated Permutation Rendering (Version 1.0.0), Chapter 8: Closing the Loop: the Fatigue-and-Remix Ledger, Field Tools and Checker Specifications. 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 3 · What an Orthogonal Array Can Estimate: Building L4, L8, L9 and L16, Main-Effect Efficiency and the Structure of Aliasing
- 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