What does Birth-Time Error and Boundary Flips conclude, in numbers, about “After-the-Fact Matches: Loose Matching, Optional Stopping and Double Counting”?

Answer: Chapter 6 computes after-the-fact matches under the null: with items of no power, asking until something fits confirms within 40 items with probability 0.9958.

Scope of the numbers: Its parameters are illustrative, and all calculations are generated by its programs. Chapter 1 shows that in the illustrative model 0.2782 of remembered times fall exactly on a double-hour boundary, against 0.0083 without rounding.

中文版

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.9958, 40

assumed q = 0.8, odds factor 4.0000, net count needed s = 3
Noptional stoppingone look at N
40.25000.1250
80.57810.2891
120.76270.3877
200.92490.5034
400.99580.6358
assumed q = 0.7, odds factor 2.3333, net count needed s = 4
Noptional stoppingone look at N
40.12500.1250
80.35940.2891
120.53320.3877
200.75220.5034
400.94910.6358
Show the full program
# Chapter 6. p62: stop when it fits, and a useless bank "confirms".
# Null model: every answer is a fair coin under both candidates A and
# B. The reader, however, scores each item as if it had P(yes | A) = q
# and P(yes | B) = 1 - q, with the side that "yes" favours set by the
# item, so each answer multiplies the odds by L = q / (1 - q) or 1 / L
# with equal chance. Starting from even odds, a candidate is declared
# confirmed once its posterior reaches 0.95, i.e. once the net count
# of favouring answers reaches s = ceil(log 19 / log L). Exact dynamic
# programming over the net count. We compare stopping as soon as the
# threshold is hit (optional stopping) with one look after all N.
import math


def thresholds(q):
    lr = q / (1 - q)
    return math.ceil(math.log(19.0) / math.log(lr) - 1e-12)


def optional(N, s):
    # 净计数的随机游走,触到 +s 或 -s 即停止并宣布对上
    dist = {0: 1.0}
    hit = []
    for _ in range(N):
        nxt = {}
        for x, p in dist.items():
            for y in (x - 1, x + 1):
                if abs(y) >= s:
                    hit.append(0.5 * p)
                else:
                    nxt.setdefault(y, []).append(0.5 * p)
        dist = {y: math.fsum(v) for y, v in sorted(nxt.items())}
    return math.fsum(hit)


def one_look(N, s):
    terms = [math.comb(N, j) * 0.5 ** N for j in range(N + 1)
             if abs(2 * j - N) >= s]
    return math.fsum(terms)


for q in (0.8, 0.7):
    s = thresholds(q)
    print("assumed q = %.1f, odds factor %.4f, net count needed s = %d"
          % (q, q / (1 - q), s))
    print("   N   optional stopping   one look at N")
    for N in (4, 8, 12, 20, 40):
        print("%4d %19.4f %15.4f" % (N, optional(N, s), one_look(N, s)))

Single source and citation

Fan, Y. (2026). Error Propagation from Remembered Birth Times and Robust Chart Fixing: Flip Probabilities at Double-Hour Boundaries and the Fewest Past-Event Questions (Version 1.0.0), Chapter 6: After-the-Fact Matches: Loose Matching, Optional Stopping and Double Counting. 5D Library. DOI pending

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

BibTeX
@book{fan2026284,
  author    = {Fan, Yafu},
  title     = {Error Propagation from Remembered Birth Times and Robust Chart Fixing: Flip Probabilities at Double-Hour Boundaries and the Fewest Past-Event Questions},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book