What does Birth-Time Error and Boundary Flips conclude, in numbers, about “Heaping in Reported Times: Full Hours, Half Hours and a Rounding Mixture”?

Answer: 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.

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.0083, 0.2782

minute-of-hour class shares, 60000 reports per source
classexpectedmemoryratiorecordratio
:000.01670.566233.970.07644.58
:300.01670.16259.750.05753.45
:15/:450.03330.07842.350.07922.38
other x50.13330.11360.850.22781.71
rest0.80000.07940.100.55900.70
memory reports exactly on an odd hour (a boundary): 0.2782
same share with no rounding at all: 0.0083
Show the full program
# Chapter 1. p11: a rounding-mixture model makes reported times heap.
# Model: the true clock time T is uniform over the day (minutes); the
# report adds a recall error e ~ Normal(0, s) and then rounds T + e to
# the nearest g minutes, where g is drawn from a mixture over
# {1, 5, 15, 30, 60}. Two sources, both with illustrative weights (not
# measured): a parent's memory and a hospital record. Fixed-seed Monte
# Carlo; we print the share of reports by minute-of-hour class and a
# heaping ratio (observed share / share expected with no rounding).
import math
import random

GRAN = [1, 5, 15, 30, 60]
# 示意参数:父母回忆与医院记录两种来源的取整权重与回忆误差(分钟)
SOURCES = {
    "memory": ([0.10, 0.15, 0.10, 0.25, 0.40], 15.0),
    "record": ([0.70, 0.20, 0.05, 0.03, 0.02], 3.0),
}
N = 60000


def report(rng, weights, s):
    t = rng.random() * 1440.0
    g = rng.choices(GRAN, weights)[0]
    x = t + rng.gauss(0.0, s)
    r = int(math.floor(x / g + 0.5)) * g
    return t, r % 1440


def minute_class(m):
    if m == 0:
        return ":00"
    if m == 30:
        return ":30"
    if m in (15, 45):
        return ":15/:45"
    if m % 5 == 0:
        return "other x5"
    return "rest"


# 无取整时各类分钟的理论份额
EXPECT = {":00": 1 / 60, ":30": 1 / 60, ":15/:45": 2 / 60,
          "other x5": 8 / 60, "rest": 48 / 60}
CLASSES = [":00", ":30", ":15/:45", "other x5", "rest"]

rng = random.Random(20261113)
print("minute-of-hour class shares, %d reports per source" % N)
print("class      expected   memory  ratio   record  ratio")
counts = {}
for name in ("memory", "record"):
    w, s = SOURCES[name]
    c = dict.fromkeys(CLASSES, 0)
    for _ in range(N):
        _, r = report(rng, w, s)
        c[minute_class(r % 60)] += 1
    counts[name] = c
for k in CLASSES:
    a = counts["memory"][k] / N
    b = counts["record"][k] / N
    print("%-9s  %7.4f   %6.4f %6.2f   %6.4f %6.2f"
          % (k, EXPECT[k], a, a / EXPECT[k], b, b / EXPECT[k]))
odd = 0
for _ in range(N):
    _, r = report(rng, *SOURCES["memory"])
    if r % 120 == 60:
        odd += 1
print("memory reports exactly on an odd hour (a boundary): %.4f" % (odd / N))
print("same share with no rounding at all: %.4f" % (1 / 120))

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 1: Heaping in Reported Times: Full Hours, Half Hours and a Rounding Mixture. 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