What does Provenance and Fidelity of Derivatives conclude, in numbers, about “Derivation Topology: Compile from the Master or from the Layer Before?”?
Answer: Chapter 5 compares derivation topologies: without checks the five products of a chain carry 28.07 wrong facts between them and those of a star 10.00; with compilation and error costs in one expression the lowest-cost tree is usually a hub.
Scope of the numbers: Parameters are illustrative and costs are accounting points, not prices; all calculations are generated by the book's programs. It is not individual legal or business advice; its "copyright chain" means only provenance and permission records for the author's own works, and publishing any derivative needs sign-off by the person in charge.
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: 10.00, 28.07
| unchecked, per-step fidelity 0.950 | |||||||
| topology | summary | script | slides | quiz | clip | mean | wrong |
| chain | 0.9500 | 0.9025 | 0.8574 | 0.8145 | 0.7738 | 0.8596 | 28.07 |
| star | 0.9500 | 0.9500 | 0.9500 | 0.9500 | 0.9500 | 0.9500 | 10.00 |
| re-anchor | 0.9500 | 0.9025 | 0.9500 | 0.9025 | 0.9500 | 0.9310 | 13.80 |
| with master check D=0.9, per-step fidelity 0.995 | |||||||
| topology | summary | script | slides | quiz | clip | mean | wrong |
| chain | 0.9950 | 0.9900 | 0.9851 | 0.9801 | 0.9752 | 0.9851 | 2.98 |
| star | 0.9950 | 0.9950 | 0.9950 | 0.9950 | 0.9950 | 0.9950 | 1.00 |
| re-anchor | 0.9950 | 0.9900 | 0.9950 | 0.9900 | 0.9950 | 0.9930 | 1.40 |
Show the full program
# Chapter 5. p51: compile every product from the master, not in a chain.
# Five products: summary, script, slides, quiz, clip. In a chain each is
# compiled from the one before; in a star each is compiled from the
# master; "re-anchor" compiles every second product from the master.
# Per-compilation fidelity p = 0.95; with a check of detection rate
# D = 0.9 against the master and repair, the per-step loss becomes
# (1 - p)(1 - D). 40 facts. Illustrative parameters.
import math
N, P, D = 40, 0.95, 0.9
NAMES = ["summary", "script", "slides", "quiz", "clip"]
TOPO = {
"chain": [0, 1, 2, 3, 4], # parent index (0 = master)
"star": [0, 0, 0, 0, 0],
"re-anchor": [0, 1, 0, 3, 0],
}
def depths(par):
d = []
for j, p in enumerate(par):
d.append(1 if p == 0 else d[p - 1] + 1)
return d
for checked in (False, True):
q = 1 - (1 - P) * (1 - D) if checked else P
tag = "with master check D=%.1f" % D if checked else "unchecked"
print("%s, per-step fidelity %.3f" % (tag, q))
print("%-10s" % "topology" + "".join("%8s" % n for n in NAMES)
+ "%8s %7s" % ("mean", "wrong"))
for name, par in TOPO.items():
f = [q ** d for d in depths(par)]
mean = math.fsum(f) / len(f)
wrong = math.fsum(N * (1 - x) for x in f)
print("%-10s" % name + "".join("%8.4f" % x for x in f)
+ "%8.4f %7.2f" % (mean, wrong))Single source and citation
Fan, Y. (2026). Multimodal Derivative Compilation and Provenance Chains: A Structure-Preserving Pipeline from One Monograph to Podcasts, Slides and Quiz Banks (Version 1.0.0), Chapter 5: Derivation Topology: Compile from the Master or from the Layer Before?. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-268 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026268,
author = {Fan, Yafu},
title = {Multimodal Derivative Compilation and Provenance Chains: A Structure-Preserving Pipeline from One Monograph to Podcasts, Slides and Quiz Banks},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Compounding of Drift: Serial Reproduction, p to the Power k, and Repair
- Chapter 2 · Provenance Hashes: Pinning Facts Down as Atoms that Compare Byte for Byte
- Chapter 3 · What Detection Really Means: a Hash Sees Only What Was Anchored
- Chapter 4 · Structural Homomorphism: a Derivative Must Be a Homomorphic Image of the Book's Argument Graph
- Chapter 7 · Classical Sources East and West: Liu Xiang's Collation and Bartlett's Serial Reproduction
- Chapter 8 · Closing the Loop: the Provenance Hash Manifest and a Protocol for Refutation