What does Anti-Spam Detection and Compliant Bridge Pages conclude, in numbers, about “Classical Sources Examined: "Rumours Stop at Those Who Know" in the Xunzi and Aristotle on Ethos in the Rhetoric”?
Answer: Chapter 7 examines "rumours stop with those who know" from the Xunzi and Aristotle on character: with three checks the critical share of careful readers is 0.429, and once concealment is discovered trust falls from 0.732 to 0.505 or below.
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.505, 0.732
| policy | w | trust after a year | items opened of 24 |
| disclosed | 0 | 0.732 | 15.82 |
| hidden | 4 | 0.505 | 12.25 |
| hidden | 8 | 0.397 | 10.76 |
| hidden | 16 | 0.290 | 9.06 |
| readers per row: 5,000 |
Show the full program
# Chapter 7. p72: ethos as a reader's running estimate of good faith.
# Model (illustrative): a reader's trust in a recommender is a Beta(a, b)
# belief, prior Beta(2, 2). The recommender offers 24 recommendations a
# year; the reader opens the next one with probability equal to the
# current trust mean a / (a + b). Each opened recommendation fits the
# reader with probability 0.8 (a + 1) or not (b + 1). Disclosed: every
# paid link is labelled. Hidden: no labels; at each opened item the
# reader discovers the paid relation with probability 0.15, which adds
# w failures at once (w = 4, 8 or 16; the size of this penalty is an
# assumption). 5,000 seeded readers per row.
import math
import random
def reader(rng, hidden, w):
a, b, opened = 2.0, 2.0, 0
for _ in range(24):
if rng.random() >= a / (a + b):
continue
opened += 1
if rng.random() < 0.8:
a += 1
else:
b += 1
if hidden and rng.random() < 0.15:
b += w
return a / (a + b), opened
if __name__ == "__main__":
rng = random.Random(20261128)
n = 5000
print("policy w trust after a year items opened of 24")
for hidden, w in ((False, 0), (True, 4), (True, 8), (True, 16)):
res = [reader(rng, hidden, w) for _ in range(n)]
t = math.fsum(r[0] for r in res) / n
o = math.fsum(r[1] for r in res) / n
name = "hidden" if hidden else "disclosed"
print("{:<10} {:>4} {:>20.3f} {:>20.2f}".format(name, w, t, o))
print("readers per row: {:,}".format(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 7: Classical Sources Examined: "Rumours Stop at Those Who Know" in the Xunzi and Aristotle on Ethos in the Rhetoric. 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
- Chapter 1 · The Timing Fingerprint: Burstiness, Memory and the Illusion of Safety in Small Numbers
- Chapter 2 · A Few Posts Are Enough: Likelihood Ratios, Sequential Tests and Change-Point Alarms
- Chapter 3 · The Fingerprint of Words: Shingles, the Jaccard Coefficient and Minimum Hashing
- Chapter 4 · The Price of Links: Demotion Thresholds, Information Posts and the Binomial Test
- Chapter 5 · The Compliant Bridge Page: Funnels, Honest Disclosure and the Attribution Window
- Chapter 6 · After the Throttle: First-Order Recovery, Half-Lives and a Year of Commission Accounts
- Chapter 8 · Closing the Loop: a Monthly Public-Feed Compliance Check-up, a Distilled Tool and a Pre-Registered Plan of Refutation