关于「原典考辨:《荀子·劝学》的善假于物与亚里士多德的三种说服」,《图文截流与联盟 EPC》给出的定量结论是什么?
结论:《荀子·劝学》的「登高而招」「顺风而呼」「善假于物」说的是放大:位置、时段与工具都是乘数,不改变内容本身;示意活跃曲线下最好钟点是最差钟点的 7.35 倍,但这是忽略同时段竞争的上限。借来的必须是正当的外物,冒名不是假物。亚里士多德说品格应来自言辞而非先前声望;合成数据显示,40 条帖子会把粉丝数的作用高估近一倍,160 条才分得清。两部旧书合起来,就是触达靠正当借势、信任靠可核对的证据。
数据口径:已发表的研究只支持争议与讨论之间的倒 U 形,并没有测量购买;把下游转化惩罚乘上去,示意参数下讨论顶点在争议度 6.00,收入顶点在 3.50,按热闹发帖要损失 0.268。 书中参数为示意,全部计算由书中程序生成。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 160, 40
| posts = 40 | ||||
| term | true | estimate | se | |z| |
| b0 | -3.600 | -3.553 | 0.118 | 30.11 |
| bE ethos | 0.400 | 0.374 | 0.096 | 3.89 |
| bF reput | 0.050 | 0.096 | 0.047 | 2.05 |
| bP c | 0.100 | 0.097 | 0.051 | 1.90 |
| bQ c^2 | -0.012 | -0.012 | 0.006 | 2.23 |
| bL logos | 0.250 | 0.227 | 0.097 | 2.35 |
| posts = 160 | ||||
| term | true | estimate | se | |z| |
| b0 | -3.600 | -3.670 | 0.073 | 49.95 |
| bE ethos | 0.400 | 0.462 | 0.046 | 9.95 |
| bF reput | 0.050 | 0.027 | 0.024 | 1.12 |
| bP c | 0.100 | 0.106 | 0.027 | 3.89 |
| bQ c^2 | -0.012 | -0.012 | 0.003 | 4.37 |
| bL logos | 0.250 | 0.266 | 0.047 | 5.72 |
查看完整验算程序
# 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))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《公域图文社交信息流截流、评论区置顶桥接与电商联盟高佣变现母典》第 7 章「原典考辨:《荀子·劝学》的善假于物与亚里士多德的三种说服」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}