What does Creator Certification: Signals and Grades conclude, in numbers, about “Grades: How Many Levels, Where to Cut, and Why Grade Inflation Is Sweet Before It Turns Bitter”?
Answer: The number of levels is set by the precision of scoring. Program p31 shows that with an error standard deviation of 0.3 three levels are best, with 0.5 two levels, and with 1.0 a single level. Program p32 shows that once the cost of applying reaches 0.241 two levels beat exact scores, and once it reaches 0.315 even pass or fail beats them. Program p33 shows that grade inflation is ahead only in the second quarter, and that the total premium over nine quarters falls from 305,243 to 134,913.
Scope of the numbers: Its numbers of creators and brands, scoring errors, costs, premiums and audit parameters are illustrative, and all calculations are generated by its programs. It is general business guidance, not individual, legal, tax or investment advice.
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.3, 0.5, 1.0
| score noise sigma | 0.3, pass rate 0.20 |
| K | 1 R^2 0.000 misgrade 0.000 net 0.0 |
| K | 2 R^2 0.477 misgrade 0.127 net 39.2 share of holders above each cut 0.28 |
| K | 3 R^2 0.594 misgrade 0.243 net 42.8 share of holders above each cut 0.46 0.12 |
| K | 4 R^2 0.640 misgrade 0.342 net 40.0 share of holders above each cut 0.56 0.24 0.06 |
| K | 5 R^2 0.663 misgrade 0.423 net 35.5 share of holders above each cut 0.63 0.34 0.15 0.04 |
| best number of holder levels | 3 |
| score noise sigma | 0.5, pass rate 0.20 |
| K | 1 R^2 0.000 misgrade 0.000 net 0.0 |
| K | 2 R^2 0.314 misgrade 0.187 net 20.8 share of holders above each cut 0.28 |
| K | 3 R^2 0.391 misgrade 0.339 net 19.2 share of holders above each cut 0.45 0.12 |
| K | 4 R^2 0.421 misgrade 0.449 net 14.4 share of holders above each cut 0.56 0.24 0.06 |
| K | 5 R^2 0.436 misgrade 0.530 net 9.1 share of holders above each cut 0.63 0.34 0.15 0.04 |
| best number of holder levels | 2 |
| score noise sigma | 1.0, pass rate 0.20 |
| K | 1 R^2 0.000 misgrade 0.000 net 0.0 |
| K | 2 R^2 0.121 misgrade 0.260 net -1.0 share of holders above each cut 0.28 |
| K | 3 R^2 0.150 misgrade 0.431 net -8.1 share of holders above each cut 0.45 0.12 |
| K | 4 R^2 0.162 misgrade 0.538 net -14.6 share of holders above each cut 0.56 0.24 0.06 |
| K | 5 R^2 0.168 misgrade 0.608 net -20.5 share of holders above each cut 0.62 0.34 0.14 0.03 |
| best number of holder levels | 1 |
Show the full program
# Chapter 3. p31: how many holder levels a noisy audit can support.
# Quality q ~ N(0, 1), audited score s = q + e, e ~ N(0, sigma^2). The top
# 20 per cent of scores pass (the pass rate of Chapter 2). Holders are
# split into K levels (K = 1 is a single badge) with cut points set by the
# Lloyd-Max rule on the posterior mean among holders, which maximises the
# share of holders' quality variance the level explains (R^2 within).
# Misgrade = share of holders whose level differs from the level their
# true quality would earn at the same cut values. Net value per holder
# (illustrative weights): 100 * R^2 - 4 * (K - 1) for running each extra
# level - 35 * misgrade for appeals and lost trust.
import math
from statistics import NormalDist
ND = NormalDist()
PASS = 0.20
STEP = 0.004
GRID = [-6.0 + i * STEP for i in range(3001)]
def levels(sigma, k):
v = 1 / (1 + sigma * sigma) # variance of E[q | s]
t_m = ND.inv_cdf(1 - PASS) * math.sqrt(v)
mg = [m for m in GRID if m > t_m]
w = [ND.pdf(m / math.sqrt(v)) for m in mg]
tot = math.fsum(w)
w = [x / tot for x in w]
mean_m = math.fsum(m * x for m, x in zip(mg, w))
var_m = math.fsum((m - mean_m) ** 2 * x for m, x in zip(mg, w))
var_q = var_m + sigma * sigma / (1 + sigma * sigma)
qs = [mg[int(len(mg) * j / k)] for j in range(1, k)]
cuts = list(qs)
for _ in range(200):
edges = [t_m] + cuts + [math.inf]
cent = []
for a, b in zip(edges, edges[1:]):
sel = [(m, x) for m, x in zip(mg, w) if a < m <= b]
mass = math.fsum(x for _, x in sel)
cent.append(math.fsum(m * x for m, x in sel) / mass)
cuts = [(x + y) / 2 for x, y in zip(cent, cent[1:])]
edges = [t_m] + cuts + [math.inf]
between = []
for a, b, c in zip(edges, edges[1:], cent):
mass = math.fsum(x for m, x in zip(mg, w) if a < m <= b)
between.append(mass * (c - mean_m) ** 2)
r2 = math.fsum(between) / var_q
# misgrade among holders: cut values on the score scale s = m / v
s_edges = [e / v for e in edges]
terms, hold = [], []
for x in GRID:
f = ND.pdf(x) * STEP
j = 0
while j < k - 1 and x > s_edges[j + 1]:
j += 1
p_hold = 1 - ND.cdf((s_edges[0] - x) / sigma)
same = ND.cdf((s_edges[j + 1] - x) / sigma) - \
ND.cdf((s_edges[j] - x) / sigma)
hold.append(f * p_hold)
terms.append(f * (p_hold - same))
mis = math.fsum(terms) / math.fsum(hold)
shares = []
for c in cuts:
above = math.fsum(x for m, x in zip(mg, w) if m > c)
shares.append(above)
return r2, mis, shares
for sigma in (0.3, 0.5, 1.0):
print("score noise sigma = %.1f, pass rate %.2f" % (sigma, PASS))
best = (1, 0.0)
print(" K=1 R^2 0.000 misgrade 0.000 net 0.0")
for k in range(2, 6):
r2, mis, shares = levels(sigma, k)
net = 100 * r2 - 4 * (k - 1) - 35 * mis
if net > best[1]:
best = (k, net)
print(" K=%d R^2 %.3f misgrade %.3f net %.1f share of holders "
"above each cut %s" % (k, r2, mis, net,
" ".join("%.2f" % s for s in shares)))
print(" best number of holder levels: %d" % best[0])Single source and citation
Fan, Y. (2026). Bootstrapping Industry Accreditation Standards, Spence Signalling Tiers and Inbound Creator Certification Magnetics (Version 1.0.0), Chapter 3: Grades: How Many Levels, Where to Cut, and Why Grade Inflation Is Sweet Before It Turns Bitter. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-358 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026358,
author = {Fan, Yafu},
title = {Bootstrapping Industry Accreditation Standards, Spence Signalling Tiers and Inbound Creator Certification Magnetics},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Signalling Equilibrium: When a Certificate Separates Creators and When It Pools Them
- Chapter 2 · The Early Pass Rate: Where to Set the Bar When Scores Are Noisy
- Chapter 4 · The Holder Premium: How Many Inquiries a Badge Brings, and How to Measure It Honestly
- Chapter 5 · Filtering by Brands and the Opportunity Cost of Not Certifying: When It Is Real and When It Is Exaggerated
- Chapter 6 · The Badge Display Cascade: Thresholds, Informational Cascades, Audits and Revocation
- Chapter 7 · Classical Sources East and West: "Inscribe the Maker's Name to Examine Sincerity" in the Book of Rites, and English Hallmarking
- Chapter 8 · System Architecture and Operating Specification: Application Flow, Public Registry, Weekly Ledger and Pre-Registered Tests