What does Text Feeds, Pinned Comments and Affiliate EPC conclude, in numbers, about “Classical Sources: Xunzi on Borrowing Things and Aristotle's Three Modes of Persuasion”?

Answer: Xunzi's "beckoning from a height", "shouting with the wind" and "being good at borrowing things" describe amplification. Position, timing and instruments are multipliers that leave the content unchanged; under the illustrative activity curve the best hour beats the worst by 7.35 times, but this is an upper bound that ignores competition within the hour. What is borrowed must be legitimate, and impersonation is not borrowing. Aristotle held that ethos should come from the speech rather than from prior reputation; the synthetic data show that 40 posts overstate the effect of follower count almost twofold and that 160 are needed to tell the two apart. Read together, the two books say that reach comes from legitimate borrowing and trust from checkable evidence.

Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is general business analysis, not legal, tax or financial advice, and it promises no income.

中文版

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: 160, 40

posts = 40
termtrueestimatese|z|
b0-3.600-3.5530.11830.11
bE ethos0.4000.3740.0963.89
bF reput0.0500.0960.0472.05
bP c0.1000.0970.0511.90
bQ c^2-0.012-0.0120.0062.23
bL logos0.2500.2270.0972.35
posts = 160
termtrueestimatese|z|
b0-3.600-3.6700.07349.95
bE ethos0.4000.4620.0469.95
bF reput0.0500.0270.0241.12
bP c0.1000.1060.0273.89
bQ c^2-0.012-0.0120.0034.37
bL logos0.2500.2660.0475.72
Show the full program
# Chapter 7. p72: can a ledger tell ethos-in-the-post from reputation?
# Aristotle: credibility should come from what is said, not from what
# people thought of the speaker beforehand. Synthetic posts: each has
# 300 affiliate clicks; orders ~ Binomial(300, p) with
# logit p = b0 + bE E + bF F + bP c + bQ c^2 + bL L, where E = a
# checkable test is shown, F = standardised log follower count (prior
# reputation), c = controversy 0..10 (pathos), L = a comparison table
# (logos). True values illustrative. Logistic fit by Newton steps.
import math
import random

TRUE = [-3.6, 0.40, 0.05, 0.10, -0.012, 0.25]
NAMES = ["b0", "bE ethos", "bF reput", "bP c", "bQ c^2", "bL logos"]


def solve(a, v):
    n = len(v)
    m = [row[:] + [v[i]] for i, row in enumerate(a)]
    for i in range(n):
        p = max(range(i, n), key=lambda r: abs(m[r][i]))
        m[i], m[p] = m[p], m[i]
        for r in range(n):
            if r != i:
                f = m[r][i] / m[i][i]
                m[r] = [x - f * y for x, y in zip(m[r], m[i])]
    return [m[i][n] / m[i][i] for i in range(n)]


def inverse_diag(a):
    n = len(a)
    out = []
    for i in range(n):
        e = [1.0 if j == i else 0.0 for j in range(n)]
        out.append(solve(a, e)[i])
    return out


def binom(rng, n, p):
    k = 0
    for _ in range(n):
        if rng.random() < p:
            k += 1
    return k


def make(rng, n):
    rows = []
    for _ in range(n):
        c = rng.randint(0, 10)
        x = [1.0, float(rng.random() < 0.5), rng.gauss(0, 1), c, c * c,
             float(rng.random() < 0.5)]
        eta = math.fsum(b * v for b, v in zip(TRUE, x))
        rows.append((x, binom(rng, 300, 1 / (1 + math.exp(-eta)))))
    return rows


def fit(rows):
    b = [0.0] * 6
    for _ in range(25):
        g = [0.0] * 6
        h = [[0.0] * 6 for _ in range(6)]
        gs = [[] for _ in range(6)]
        hs = [[[] for _ in range(6)] for _ in range(6)]
        for x, k in rows:
            eta = math.fsum(bi * v for bi, v in zip(b, x))
            p = 1 / (1 + math.exp(-eta))
            w = 300 * p * (1 - p)
            for i in range(6):
                gs[i].append((k - 300 * p) * x[i])
                for j in range(6):
                    hs[i][j].append(w * x[i] * x[j])
        g = [math.fsum(t) for t in gs]
        h = [[math.fsum(t) for t in row] for row in hs]
        b = [bi + di for bi, di in zip(b, solve(h, g))]
    return b, [math.sqrt(v) for v in inverse_diag(h)]


if __name__ == "__main__":
    rng = random.Random(20261120)
    for n in (40, 160):
        b, se = fit(make(rng, n))
        print("posts = {}".format(n))
        print("  term        true   estimate    se    |z|")
        for nm, t, bi, s in zip(NAMES, TRUE, b, se):
            print("  {:<10} {:>6.3f}  {:>8.3f}  {:.3f}  {:>5.2f}".format(
                nm, t, bi, s, abs(bi) / s))

Single source and citation

Fan, Y. (2026). Text-First Social Feed Traffic Interception, Pinned-Comment Bridge Funnels and High-Commission Affiliate Monetisation (Version 1.0.0), Chapter 7: Classical Sources: Xunzi on Borrowing Things and Aristotle's Three Modes of Persuasion. 5D Library. DOI pending

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

BibTeX
@book{fan2026354,
  author    = {Fan, Yafu},
  title     = {Text-First Social Feed Traffic Interception, Pinned-Comment Bridge Funnels and High-Commission Affiliate Monetisation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book