What does Computational Bibliometrics and Self-Verifying Books conclude, in numbers, about “Falsify, Then Bound: The Bayesian Case and Its Limits”?

Answer: Chapter 3 gives the Bayesian case for "falsify, then bound": with a likelihood ratio of 12, tripling trust needs a prior at or below 0.273; when only significant small studies are published, a true ratio of 1.35 has a median published value of 11.89.

Scope of the numbers: Its readers, books, error rates and costs are illustrative models; all calculations are generated by its programs; the book is not legal, financial or publishing advice. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 0.273, 12

prior P(C)LRP(C) aftermultiplier
signal: falsify+bound (LR 12.00)
0.0512.000.3877.74
0.1012.000.5715.71
0.2012.000.7503.75
0.5012.000.9231.85
0.8012.000.9801.22
signal: imitated (LR 2.00)
0.052.000.0951.90
0.102.000.1821.82
0.202.000.3331.67
0.502.000.6671.33
0.802.000.8891.11
signal: self-praise (LR 0.33)
0.050.330.0170.34
0.100.330.0360.36
0.200.330.0770.38
0.500.330.2500.50
0.800.330.5710.71
a 3x jump with LR 12 needs a prior at or below 0.273
a 5x jump with LR 12 needs a prior at or below 0.127
Show the full program
# Chapter 3. p05: The Bayesian arithmetic of "falsify first". A reader
# weighs two kinds of author: calibrated (C) and hyping (H). An opening
# that refutes a popular overclaim in the author's own field, and states
# where the corrected result holds, is a signal: C does it with chance
# 0.60, H with chance 0.05 (likelihood ratio 12). Self-praise is the
# reverse signal: C 0.30, H 0.90 (ratio 1/3). If hypers learn to imitate
# the opening, the ratio falls. We print P(C) before and after, and the
# multiplier, for several priors.

def post(prior, lr):
    odds = prior / (1 - prior) * lr
    return odds / (1 + odds)

if __name__ == "__main__":
    print("   prior P(C)   LR    P(C) after   multiplier")
    for lr, label in ((12.0, "falsify+bound"), (2.0, "imitated"),
                      (1 / 3, "self-praise")):
        print("   signal: {} (LR {:.2f})".format(label, lr))
        for p in (0.05, 0.10, 0.20, 0.50, 0.80):
            q = post(p, lr)
            print("   {:9.2f}  {:5.2f}  {:10.3f}  {:10.2f}".format(
                p, lr, q, q / p))
    for m in (3, 5):
        # prior needed for a multiplier m with LR 12: q = m p
        lo, hi = 1e-9, 1 / m
        for _ in range(200):
            mid = (lo + hi) / 2
            if post(mid, 12.0) / mid > m:
                lo = mid
            else:
                hi = mid
        print("   a {}x jump with LR 12 needs a prior at or below {:.3f}"
              .format(m, lo))

Single source and citation

Fan, Y. (2026). Computational Bibliometrics, Falsification-First Rhetoric and Self-Verifying Monograph Compilers (Version 1.0.0), Chapter 3: Falsify, Then Bound: The Bayesian Case and Its Limits. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-101 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026101,
  author    = {Fan, Yafu},
  title     = {Computational Bibliometrics, Falsification-First Rhetoric and Self-Verifying Monograph Compilers},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book