What does Anti-Spam Detection and Compliant Bridge Pages conclude, in numbers, about “Closing the Loop: a Monthly Public-Feed Compliance Check-up, a Distilled Tool and a Pre-Registered Plan of Refutation”?

Answer: Chapter 8 gives the monthly check-up, the distilled Public-Feed Compliance Check-up Sheet and a pre-registered plan of refutation needing 112 topics per arm. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.

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: 112, 20

topics per arm; alpha 0.05 two-sided, power 0.80
mu0 per 90 dthetaRR 1.3RR 1.5RR 2.0
5126911238
531174816
20123910034
203873613
simulated power, mu0 5, RR 1.5, theta 1, n 112: 0.798
Show the full program
# Chapter 8. p82: sample size for the pre-registered commission test.
# Design: product topics are randomised to two compliant arms, both
# with disclosed links and both within the platform's published rules:
#   arm 0  short link posts, several a week per topic
#   arm 1  one bridge page per topic plus one or two posts a week
# Outcome: credited orders per topic over 90 days, negative binomial
# with mean mu and dispersion theta (variance mu + mu^2 / theta). By the
# delta method Var(log rate ratio) = (1/mu0 + 1/mu1 + 2/theta) / n, so
#   n per arm = (z_0.975 + z_0.80)^2 (1/mu0 + 1/mu1 + 2/theta) / ln(RR)^2.
# A seeded simulation checks the power for one cell (2,000 trials).
import math
import random
import statistics

ND = statistics.NormalDist()
ZA, ZB = ND.inv_cdf(0.975), ND.inv_cdf(0.80)


def n_arm(mu0, rr, theta):
    mu1 = mu0 * rr
    return math.ceil((ZA + ZB) ** 2 * (1 / mu0 + 1 / mu1 + 2 / theta)
                     / math.log(rr) ** 2)


def nb(rng, mu, theta):
    lam = rng.gammavariate(theta, mu / theta)
    k, p, L = 0, 1.0, math.exp(-lam)
    while True:
        p *= rng.random()
        if p < L:
            return k
        k += 1


def power(rng, mu0, rr, theta, n, trials=2000):
    hit = 0
    for _ in range(trials):
        a = [nb(rng, mu0, theta) for _ in range(n)]
        b = [nb(rng, mu0 * rr, theta) for _ in range(n)]
        m0, m1 = statistics.fmean(a), statistics.fmean(b)
        if m0 == 0 or m1 == 0:
            continue
        v0, v1 = statistics.variance(a), statistics.variance(b)
        se = math.sqrt(v0 / (n * m0 * m0) + v1 / (n * m1 * m1))
        hit += abs(math.log(m1 / m0)) / se > ZA
    return hit / trials


if __name__ == "__main__":
    print("topics per arm; alpha 0.05 two-sided, power 0.80")
    print("mu0 per 90 d   theta   RR 1.3   RR 1.5   RR 2.0")
    for mu0 in (5.0, 20.0):
        for theta in (1.0, 3.0):
            print("{:>13.0f} {:>7.0f} {:>8} {:>8} {:>8}".format(
                mu0, theta, n_arm(mu0, 1.3, theta),
                n_arm(mu0, 1.5, theta), n_arm(mu0, 2.0, theta)))
    rng = random.Random(20261129)
    n = n_arm(5.0, 1.5, 1.0)
    print("simulated power, mu0 5, RR 1.5, theta 1, n {}: {:.3f}".format(
        n, power(rng, 5.0, 1.5, 1.0, n)))

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 8: Closing the Loop: a Monthly Public-Feed Compliance Check-up, a Distilled Tool and a Pre-Registered Plan of Refutation. 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