What does Anti-Spam Detection and Compliant Bridge Pages conclude, in numbers, about “The Compliant Bridge Page: Funnels, Honest Disclosure and the Attribution Window”?
Answer: Chapter 5 prices the compliant bridge page: 308.4 orders a year for an honestly disclosed page against 132.0 for a springboard, and only 59 disclosed items out of 59 support a coverage of at least 0.95.
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: 132.0, 308.4
| page | d | month 1 | month 12 | year total | steady |
| thin | - | 10.50 | 11.05 | 132.0 | 11.05 |
| honest | 0.00 | 21.00 | 26.25 | 308.4 | 26.25 |
| honest | 0.05 | 19.95 | 24.94 | 293.0 | 24.94 |
| honest | 0.10 | 18.90 | 23.62 | 277.6 | 23.62 |
| break-even disclosure cost for the honest page: d = 0.579 |
Show the full program
# Chapter 5. p51: a bridge-page funnel with returning readers.
# Model (illustrative): each month 1,000 new readers reach a bridge
# page. A share r of last month's readers come back. Orders per month
# = readers x click-out rate x purchase rate after the click. Two pages:
# thin page link and slogan, no comparison: click 0.35,
# purchase 0.03, return r 0.05
# honest page comparison table, test notes, plain disclosure next
# to each link: click 0.35 (1 - d), purchase 0.06,
# return r 0.20
# d is the click-out cost of the disclosure (0, 0.05 or 0.10); its size
# is unknown and must be measured. Readers in month t:
# V(t) = 1,000 + r V(t - 1), steady state 1,000 / (1 - r).
import math
NEW = 1000
def run(click, buy, r, months=12):
v, orders = 0.0, []
for _ in range(months):
v = NEW + r * v
orders.append(v * click * buy)
return orders
def row(name, d, orders, steady):
print("{:<14} {:>4} {:>9.2f} {:>10.2f} {:>12.1f} {:>7.2f}".format(
name, d, orders[0], orders[-1], math.fsum(orders), steady))
if __name__ == "__main__":
print("page d month 1 month 12 year total steady")
row("thin", "-", run(0.35, 0.03, 0.05), NEW / 0.95 * 0.35 * 0.03)
for d in (0.0, 0.05, 0.10):
c = 0.35 * (1 - d)
row("honest", "{:.2f}".format(d), run(c, 0.06, 0.20),
NEW / 0.80 * c * 0.06)
print("break-even disclosure cost for the honest page: d = {:.3f}"
.format(1 - (0.03 / 0.95) / (0.06 / 0.80)))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 5: The Compliant Bridge Page: Funnels, Honest Disclosure and the Attribution Window. 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 6 · After the Throttle: First-Order Recovery, Half-Lives and a Year of Commission Accounts
- Chapter 7 · Classical Sources Examined: "Rumours Stop at Those Who Know" in the Xunzi and Aristotle on Ethos in the Rhetoric
- Chapter 8 · Closing the Loop: a Monthly Public-Feed Compliance Check-up, a Distilled Tool and a Pre-Registered Plan of Refutation