What does Provenance and Fidelity of Derivatives conclude, in numbers, about “Structural Homomorphism: a Derivative Must Be a Homomorphic Image of the Book's Argument Graph”?
Answer: Reversals and flips are caught by the structure check every time and by the hash never, since the claim texts are unchanged. A randomly added edge is caught by the structure check in 0.9620 of trials; of the remainder, 0.0160 happened to add an edge that already exists in the master, which is not drift. When two claims swap places along with their ids, the structure check catches 0.9802; the rest are swaps of claims that lie on none of the edges the derivative draws, which changes nothing. A slipped digit is never caught by the structure check and always by the hash. Together the two checks catch every kind of edit except deletion at rates of 0.9620 or more. Deletion is reported by neither, because cutting is allowed and is reported through coverage.
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: 0.0160, 0.9620, 0.9802
| edit | structure | hash | either | harmless |
|---|---|---|---|---|
| drop | 0.0000 | 0.0000 | 0.0000 | 0.0000 |
| reverse | 1.0000 | 0.0000 | 1.0000 | 0.0000 |
| flip | 1.0000 | 0.0000 | 1.0000 | 0.0000 |
| add | 0.9620 | 0.0000 | 0.9620 | 0.0160 |
| swap | 0.9802 | 0.0000 | 0.9802 | 0.0000 |
| digit | 0.0000 | 1.0000 | 1.0000 | 0.0000 |
| drop is omission: no check flags it; coverage reports it |
Show the full program
# Chapter 4. p43: structure checks and hashes catch different edits.
# A derivative keeps a random 5 of the 8 master edges and all 8 claim
# texts (each with a provenance hash by anchor id). One random edit is
# applied, then two checks run: the structure check of p41 and the hash
# check (claim text under each id against the master hash).
# Edit types: drop an edge; reverse an edge; flip a label; add an edge
# between two random claims; swap two claims with their ids (positions
# exchange); slip a digit inside one claim text.
# Illustrative; fixed-seed Monte Carlo, 4000 trials per edit type.
import hashlib
import random
MASTER = [("C1", "C2", "supports"), ("C2", "C3", "precedes"),
("C3", "C4", "supports"), ("C4", "C2", "refines"),
("C5", "C6", "supports"), ("C2", "C8", "supports"),
("C7", "C8", "contradicts"), ("C1", "C5", "precedes")]
MSET = set(MASTER)
LABELS = ["supports", "precedes", "refines", "contradicts"]
IDS = ["C%d" % i for i in range(1, 9)]
TEXT = {c: "claim %s holds at 0.%d5" % (c, i) for i, c in
enumerate(IDS, 1)}
HASH = {c: hashlib.sha256(TEXT[c].encode()).hexdigest() for c in IDS}
TRIALS = 4000
def edit(rng, kind, edges, text):
if kind == "drop":
edges.pop(rng.randrange(len(edges)))
elif kind == "reverse":
i = rng.randrange(len(edges))
u, v, lab = edges[i]
edges[i] = (v, u, lab)
elif kind == "flip":
i = rng.randrange(len(edges))
u, v, lab = edges[i]
edges[i] = (u, v, rng.choice([x for x in LABELS if x != lab]))
elif kind == "add":
u, v = rng.sample(IDS, 2)
edges.append((u, v, rng.choice(LABELS)))
elif kind == "swap":
a, b = rng.sample(IDS, 2)
sw = {a: b, b: a}
edges[:] = [(sw.get(u, u), sw.get(v, v), lab)
for u, v, lab in edges]
elif kind == "digit":
c = rng.choice(IDS)
text[c] = text[c].replace("5", "6")
rng = random.Random(20261113)
print("%-8s %9s %7s %7s %9s" % ("edit", "structure", "hash", "either",
"harmless"))
for kind in ("drop", "reverse", "flip", "add", "swap", "digit"):
st = hs = ei = harmless = 0
for _ in range(TRIALS):
edges = rng.sample(MASTER, 5)
before = set(edges)
text = dict(TEXT)
edit(rng, kind, edges, text)
s_bad = any(e not in MSET for e in edges)
h_bad = any(hashlib.sha256(text[c].encode()).hexdigest()
!= HASH[c] for c in IDS)
if set(edges) <= MSET and set(edges) != before and \
kind != "drop":
harmless += 1
st += s_bad
hs += h_bad
ei += s_bad or h_bad
print("%-8s %9.4f %7.4f %7.4f %9.4f" % (
kind, st / TRIALS, hs / TRIALS, ei / TRIALS, harmless / TRIALS))
print("drop is omission: no check flags it; coverage reports it")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 4: Structural Homomorphism: a Derivative Must Be a Homomorphic Image of the Book's Argument Graph. 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 5 · Derivation Topology: Compile from the Master or from the Layer Before?
- 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