What does Link Authority, Retrieval Truncation and Direct Answers conclude, in numbers, about “Top-k Truncation: the Probability that a Passage Enters the Context”?

Answer: Chapter 4 computes inclusion probabilities under top-k truncation: a ninety percent chance of the top three needs a score advantage of 2.46 standard deviations.

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: 2.46

delta top-1 top-3 top-5 top-10
0.00.0500 0.1500 0.2500 0.5000
0.50.1164 0.2863 0.4220 0.6847
1.00.2284 0.4631 0.6105 0.8320
1.50.3830 0.6475 0.7757 0.9255
2.00.5580 0.8021 0.8915 0.9728
3.00.8468 0.9632 0.9857 0.9980
with delta 0 the chance is k/20, as it must be
margin for a 0.90 chance of top-13.30 sd
margin for a 0.90 chance of top-32.46 sd
margin for a 0.90 chance of top-52.05 sd
margin for a 0.90 chance of top-101.33 sd
Show the full program
# Chapter 4. p42: top-k truncation with Gaussian score noise.
# N = 20 candidates: 19 rivals with true score 0, one target with true
# score delta (in units of the noise standard deviation). Observed score
# = true score + N(0, 1) noise, independent. P(target in top k) =
# integral of phi(x) * P(Binomial(19, 1 - Phi(x + delta)) <= k - 1),
# computed by Simpson's rule on [-9, 9] with 3,600 panels.
# Also: the margin needed for a 0.90 chance of entering the top k.
import math

M = 19


def Phi(x):
    return 0.5 * math.erfc(-x / math.sqrt(2))


def phi(x):
    return math.exp(-x * x / 2) / math.sqrt(2 * math.pi)


def p_top(delta, k, panels=3600):
    a, b = -9.0, 9.0
    h = (b - a) / panels
    terms = []
    for i in range(panels + 1):
        x = a + i * h
        q = 1 - Phi(x + delta)
        cdf = math.fsum(math.comb(M, j) * q ** j * (1 - q) ** (M - j)
                        for j in range(k))
        wt = 1 if i in (0, panels) else (4 if i % 2 else 2)
        terms.append(wt * phi(x) * cdf)
    return math.fsum(terms) * h / 3


def margin_for(k, goal=0.90):
    lo, hi = 0.0, 6.0
    for _ in range(40):
        mid = (lo + hi) / 2
        if p_top(mid, k, 600) < goal:
            lo = mid
        else:
            hi = mid
    return hi


if __name__ == "__main__":
    ks = (1, 3, 5, 10)
    print("delta " + "".join("   top-{:<3}".format(k) for k in ks))
    for delta in (0.0, 0.5, 1.0, 1.5, 2.0, 3.0):
        print("{:5.1f} ".format(delta) + "".join(
            "{:10.4f}".format(p_top(delta, k)) for k in ks))
    print("with delta 0 the chance is k/20, as it must be")
    for k in ks:
        print("margin for a 0.90 chance of top-{:<2}: {:.2f} sd".format(
            k, margin_for(k)))

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 4: Top-k Truncation: the Probability that a Passage Enters the Context. 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