What does Anti-Spam Detection and Compliant Bridge Pages conclude, in numbers, about “The Timing Fingerprint: Burstiness, Memory and the Illusion of Safety in Small Numbers”?

Answer: Chapter 1 shows that burstiness does not depend on posting frequency: −0.969 for a fixed timer, 0.300 for a human-like rhythm.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is general business analysis, not personalised business, legal or financial advice, and rules must be checked by a human reviewer before publication. Marked boxes separate published evidence, runnable Python calculations (20 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. standard-library Python onlyprinted values that match the answer: 0.300

rhythmmean gap hBMH bits
fixed scheduler6.00-0.9690.0250.99
loose scheduler5.85-0.4450.0094.99
Poisson3.81-0.0050.0015.23
human-like5.280.300-0.0034.60
reference textsB 0.00M 0.01(Goh and Barabasi 2008)
reference heartB -0.69M 0.97(healthy, same paper)
periodic limit B -1; Poisson B 0; most bursty limit B 1
Show the full program
# Chapter 1. p11: burstiness B and memory M of four posting rhythms.
# Model: Goh and Barabasi (EPL 2008) define B = (s - m) / (s + m) on the
# inter-event times (m mean, s standard deviation) and M as the
# correlation of consecutive inter-event times. Four synthetic rhythms,
# 400 gaps each, mean gap about 4 to 6 hours (illustrative):
#   fixed scheduler   6 h with uniform jitter of +-10 minutes
#   loose scheduler   uniform 2 to 10 hours
#   Poisson           exponential, mean 4 h
#   human-like        session mixture: 0.6 short gaps (exp, mean 0.25 h)
#                     and 0.4 long gaps (lognormal, median 8 h, sigma 1.0)
# H is the Shannon entropy (bits) of the gaps rounded to 15 minutes,
# the timing-entropy idea of Chu et al. (IEEE TDSC 2012).
# Published reference points (Goh and Barabasi 2008): letter spacing in
# texts B 0, M 0.01; healthy heartbeat B -0.69, M 0.97.
import math
import random
import statistics
from collections import Counter


def burstiness(gaps):
    m = statistics.fmean(gaps)
    s = statistics.pstdev(gaps)
    return (s - m) / (s + m)


def memory(gaps):
    return statistics.correlation(gaps[:-1], gaps[1:])


def entropy_bits(gaps, step=0.25):
    c = Counter(round(g / step) for g in gaps)
    n = len(gaps)
    return -math.fsum((k / n) * math.log2(k / n) for k in c.values())


def human_gaps(rng, n):
    out = []
    for _ in range(n):
        if rng.random() < 0.6:
            out.append(rng.expovariate(1 / 0.25))
        else:
            out.append(rng.lognormvariate(math.log(8.0), 1.0))
    return out


def rhythms(rng, n):
    return [
        ("fixed scheduler", [6 + rng.uniform(-1 / 6, 1 / 6)
                             for _ in range(n)]),
        ("loose scheduler", [rng.uniform(2, 10) for _ in range(n)]),
        ("Poisson", [rng.expovariate(1 / 4) for _ in range(n)]),
        ("human-like", human_gaps(rng, n)),
    ]


if __name__ == "__main__":
    rng = random.Random(20261120)
    print("rhythm             mean gap h       B       M   H bits")
    for name, g in rhythms(rng, 400):
        print("{:<16} {:>10.2f} {:>7.3f} {:>7.3f} {:>8.2f}".format(
            name, statistics.fmean(g), burstiness(g), memory(g),
            entropy_bits(g)))
    print("reference texts    B 0.00   M 0.01  (Goh and Barabasi 2008)")
    print("reference heart    B -0.69  M 0.97  (healthy, same paper)")
    print("periodic limit B -1; Poisson B 0; most bursty limit B 1")

Single source and citation

Fan, Y. (2026). Social-Graph Anti-Spam Detection Bounds, Compliant Affiliate Bridge-Page Funnels and the Kinetics of Recovery after Reach Throttling (Version 1.0.0), Chapter 1: The Timing Fingerprint: Burstiness, Memory and the Illusion of Safety in Small Numbers. 5D Library. DOI pending

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

BibTeX
@book{fan2026342,
  author    = {Fan, Yafu},
  title     = {Social-Graph Anti-Spam Detection Bounds, Compliant Affiliate Bridge-Page Funnels and the Kinetics of Recovery after Reach Throttling},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book