What does Link Authority, Retrieval Truncation and Direct Answers conclude, in numbers, about “The Classics Examined: Zheng Qiao's Classification and Bush's Associative Trails”?
Answer: Chapter 7 reads Zheng Qiao's Treatise on Collation beside Vannevar Bush's As We May Think, and shows with a program that classification helps retrieval only when its accuracy exceeds 0.667.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; the book is not personalised legal, financial or business advice and makes no promise about citation rankings in any system. Chapter 1 computes PageRank and HITS with power iteration and a random surfer: in an illustrative knowledge base with damping factor 0.85, the mother page receives 0.3240, or 2.59 times the uniform share.
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.667
| query | flat | right class | wrong class |
|---|---|---|---|
| branch | 0.333 | 1.000 | 0.000 |
| bank branch | 1.000 | 1.000 | 0.000 |
| stream | 0.333 | 0.333 | 0.000 |
| bank | 0.333 | 0.667 | 0.000 |
| mean | 0.500 | 0.750 | 0.000 |
| break-even classifier accuracy: 0.667 |
Show the full program
# Chapter 7. p71: Zheng Qiao's claim "once the classes are divided, the
# learning explains itself", tested on an invented twelve-snippet corpus
# with words that mean different things in different classes (bank,
# branch, stream). BM25 (k1 = 1.2, b = 0.75) ranks all twelve; then the
# ranking is restricted to the class the query belongs to. Precision at
# 3 against hand-judged relevant sets. If a classifier puts the query
# in the right class with accuracy a, expected precision is
# a * P(right class) + (1 - a) * P(wrong class), so filtering pays only
# above the break-even accuracy printed at the end.
import math
from collections import Counter
DOCS = {
"f1": ("fin", "the bank raised the interest rate on savings"),
"f2": ("fin", "open an account at a bank branch to deposit cash"),
"f3": ("fin", "the bank branch reviews each loan application"),
"f4": ("fin", "interest on a loan is paid to the bank monthly"),
"g1": ("geo", "the river bank floods when the stream rises"),
"g2": ("geo", "a branch of the river splits into a delta"),
"g3": ("geo", "erosion moves the bank of a stream downstream"),
"g4": ("geo", "the delta forms where the river branch meets the sea"),
"s1": ("soft", "create a branch then merge it into the main line"),
"s2": ("soft", "a merge conflict appears when two branch edits"
" overlap"),
"s3": ("soft", "the stream api reads records lazily from a source"),
"s4": ("soft", "rebase rewrites a branch before the merge"),
}
QUERIES = [
("branch", "soft", {"s1", "s2", "s4"}),
("bank branch", "fin", {"f1", "f2", "f3"}),
("stream", "soft", {"s3"}),
("bank", "geo", {"g1", "g3"}),
]
def bm25_rank(query, keep, k1=1.2, b=0.75):
toks = {d: DOCS[d][1].split() for d in DOCS}
n = len(toks)
avgdl = math.fsum(len(t) for t in toks.values()) / n
df = Counter()
for t in toks.values():
df.update(set(t))
sc = {}
for d in keep:
tf = Counter(toks[d])
norm = k1 * (1 - b + b * len(toks[d]) / avgdl)
sc[d] = math.fsum(
math.log(1 + (n - df[q] + 0.5) / (df[q] + 0.5))
* tf[q] * (k1 + 1) / (tf[q] + norm) for q in query.split())
return sorted(keep, key=lambda d: (-sc[d], d))
def p_at_3(ranked, rel):
return len([d for d in ranked[:3] if d in rel]) / 3
if __name__ == "__main__":
print("query flat right class wrong class")
flat, right, wrong = [], [], []
for q, cls, rel in QUERIES:
f = p_at_3(bm25_rank(q, sorted(DOCS)), rel)
r = p_at_3(bm25_rank(q, [d for d in DOCS if DOCS[d][0] == cls]),
rel)
others = sorted({c for c, _ in DOCS.values()} - {cls})
w = math.fsum(p_at_3(bm25_rank(
q, [d for d in DOCS if DOCS[d][0] == o]), rel)
for o in others) / len(others)
flat.append(f)
right.append(r)
wrong.append(w)
print("{:<20}{:6.3f}{:13.3f}{:13.3f}".format(q, f, r, w))
pf = math.fsum(flat) / len(flat)
pr = math.fsum(right) / len(right)
pw = math.fsum(wrong) / len(wrong)
print("mean {:6.3f}{:13.3f}{:13.3f}".format(pf, pr, pw))
print("break-even classifier accuracy: {:.3f}".format(
(pf - pw) / (pr - pw)))Single source and citation
Fan, Y. (2026). Hyperlink Authority Propagation in Machine-Readable Knowledge Bases, Retrieval-Truncation Games in Generative Answering and High-SNR Snippet Extraction (Version 1.0.0), Chapter 7: The Classics Examined: Zheng Qiao's Classification and Bush's Associative Trails. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-176 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026176,
author = {Fan, Yafu},
title = {Hyperlink Authority Propagation in Machine-Readable Knowledge Bases, Retrieval-Truncation Games in Generative Answering and High-SNR Snippet Extraction},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Power Iteration and the Damping Factor: How Hyperlink Authority Flows Through a Knowledge Base
- Chapter 2 · The Mother Page: How Internal-Link Topology Concentrates Authority
- Chapter 3 · BM25 and Length Normalisation: the Term-Frequency Ledger of Stuffing, Padding and Direct Answers
- Chapter 4 · Top-k Truncation: the Probability that a Passage Enters the Context
- Chapter 5 · Competing for k Positions: Position Auctions, Homogenisation and the Commons
- Chapter 6 · Signal-to-Noise and Softmax Reranking: the Selection Gain of Direct-Answer Snippets
- Chapter 8 · Practice and Falsification: the Copy Checker, a Publisher's Checklist and a Pre-Registered Test