Estimating the unseen is one statistical problem shared by cryptanalysis, ecology, paleontology, and knowledge-base completeness

The seed's "No-Change Assumption" (stop seeing new facts → the region is complete) is the folk version of a formal, ~80-year-old problem: estimating the unseen.

1. One problem, many fields. The estimators built for it "can be used to estimate any new elements of a set not previously found in samples" (Wikipedia, unseen species problem, Tier 4 — pointer). Its two roots are a cross-domain bridge: Corbet's Malayan butterflies (Fisher, 1940s ecology) and Turing & Good's estimate of never-seen Enigma settings at Bletchley Park (cryptanalysis), later published as Good-Turing smoothing — the same math that now smooths unseen n-grams in language models.

2. The bridge lands on the fossil record. The unseen-mass estimator is the currency of sample coverage: "standardizing samples by completeness rather than size" (Chao & Jost 2012, Ecology, Tier 1). Paleobiologists reinvented the identical method as shareholder quorum subsampling (Alroy 2010) to measure how complete the fossil record is — literally quantifying the gaps Mayr predicted.

3. The diagnostic, and its limit. What tells you how much you haven't seen is the count of things seen exactly once — ecology's "singletons," linguistics' "hapax legomena." Good-Turing sets unseen mass ≈ f₁/n; Chao1 = (n−1)/n · f₁²/2f₂ (Karsdorp, Tier 2). But you cannot extrapolate forever: from n samples the unseen is predictable only out to ≈ n·log(n), and that range "is the best possible" (Orlitsky, Suresh & Wu, PNAS 2016, Tier 1).

Why this was hop-worthy

It connects two unlinked vault notes — Mayr's fossil-record gaps and the Osteological Paradox — through the exact estimator the seed's KB-completeness note is reaching for.

Further leads

• Efron & Thisted used the same estimator on Shakespeare's vocabulary — how many words he knew but never wrote, then to authenticate a disputed poem. (Statistics → authorship attribution.)
• Immune-repertoire diversity (T-cell/antibody) is estimated with these same unseen-species estimators.
• "A bird in the hand is worth log n in the bush" (Valiant & Valiant 2016) — a second, independent proof of the same extrapolation limit.

Hop chain

Hop 1 — Seed: claim-kb-completeness-toolkit-cardinality-nca-recall.md → Good-Turing frequency estimation / unseen species problem

• Hook type: Cross-domain bridge (+ cross-time)
• Hook: the No-Change Assumption — "if repeated observations stop adding new facts, treat the region as converged."
• Why followed: the NCA is the informal shadow of a formal statistical problem spanning ecology, cryptanalysis, and linguistics; bridge_candidate confirmed (vault_bridge).
• Key findings: the unseen species problem began with Corbet's butterflies and Fisher (1940s) and independently with Turing & Good's Enigma work; both feed modern Good-Turing smoothing.

Hop 2 — [Unseen species problem] → Chao & Jost 2012, coverage-based rarefaction / Alroy SQS (zoom in)

• Hook type: Mechanism question + cross-domain bridge
• Hook: "sample coverage" = 1 − unseen probability mass; standardizing "by completeness rather than size."
• Why followed: it concretely lands the identified bridge — the estimator is used on the fossil record.
• Key findings: paleobiology's "shareholder quorum subsampling" (Alroy 2010) IS ecology's "coverage-based rarefaction" (Chao & Jost 2012) — same method, two field-specific names; used to measure fossil-record completeness.

Hop 3 — [Chao coverage] → Karsdorp, Chao1 as an unseen-species model (zoom in)

• Hook type: Cross-domain bridge
• Hook: "singletons" (ecology) = "hapax legomena" (linguistics) as the diagnostic of the unseen.
• Why followed: it's the shared mechanism under all the field-names, and re-connects the saved Shakespeare hook.
• Key findings: unseen mass ≈ f₁/n (fraction of once-seen items); Chao1 = (n−1)/n · f₁²/2f₂.

Hop 4 — [singletons] → Orlitsky, Suresh & Wu, PNAS 2016 (zoom out)

• Hook type: Surprising claim (quantitative)
• Hook: how far can you extrapolate the unseen?
• Why followed: it closes the loop to the seed by qualifying the NCA.
• Key findings: from n samples the unseen is predictable only up to ≈ n·log(n) more, and this range is provably optimal (Valiant & Valiant concurrent).

Saved hooks not followed:

• Efron & Thisted on Shakespeare's vocabulary and poem authentication — unseen species problem, Wikipedia — statistics-meets-literary-scholarship, but sat in a weaker vault neighborhood (Braille/blind-mathematicians cluster, max_cosine 0.734).
• Fabian Suchanek / YAGO as the person behind KB completeness — already partly in the vault (his "Atheist Bible" note), lower bridge value.
• The 2026 "Unseen Species Problem Revisited" preprint — frontier, but a deep vertical dive, not a bridge.

Surprise: expected estimating-the-unseen to be an ecology-and-AI concern — found paleobiologists (Alroy) independently reinvented the exact same coverage estimator under a different name (shareholder quorum subsampling). Surprise: expected "no new observations → complete" (the seed's NCA) to be broadly safe — found a proven fundamental limit (≈ n·log n horizon) beyond which the unseen tail is unknowable, so NCA is valid only within a log-factor window.

post-worthy: maybe — a clean one-idea-across-five-fields bridge with a crisp closing caveat, but it needs the Shakespeare and Enigma anecdotes fleshed out from primary sources to carry a full post.