5D Library › Short-Video Completion Hazards, Recommender Exploration Loops and Automated Acquisition Funnels · 中文
Chapter 4. Reverse Selection by Hook Breadth and the Timing of the Offer
More views, fewer buyers
A “broad” hook speaks to everyone; a “narrow” one speaks only to the target buyer. Broad hooks bring more views, but mostly of people who will not buy. Let hook breadth run from 0 (narrowest) to 1 (broadest): daily views are and paid conversion is , so at views are 10 times higher and conversion 20 times lower. Conversion falls with because a slightly broader hook first brings in “near-buyers” and only later strangers. The entry product costs RM 49; a share of buyers later buys the RM 298 programme; refunds run at ; support costs RM 6 per buyer and fixed costs RM 120 per day.
Calculation
# Chapter 4. p07: Broad hooks, more views, fewer buyers.
# Hook breadth b runs from 0 (a hook that speaks only to the target
# buyer) to 1 (a hook that speaks to everyone). Illustrative model:
# daily views V(b) = 2,000 x 10^b (10 times at b = 1);
# paid conversion c(b) = 0.01 x 20^(-b^2) (20 times lower at b = 1;
# a slightly broader hook first adds near-buyers, then strangers);
# entry product RM 49; a share u(b) = 0.2 x 2^(-b) of buyers later
# buys the RM 298 programme; refunds r(b) = 0.03 + 0.05 b;
# support cost RM 6 per buyer; fixed cost RM 120 per day.
# Daily net cash = buyers x (49 + u 298) x (1 - r) - 6 buyers - 120.
# The program scans b and finds the best breadth on a fine grid.
def day(b):
views = 2000 * 10 ** b
buyers = views * 0.01 * 20 ** (-b * b)
u = 0.2 * 2 ** (-b)
r = 0.03 + 0.05 * b
cash = buyers * (49 + u * 298) * (1 - r) - 6 * buyers - 120
return views, buyers, cash
if __name__ == "__main__":
print(" breadth b views/day buyers/day net cash RM/day")
for i in range(0, 11, 2):
b = i / 10
v, n, c = day(b)
print(" {:9.1f} {:13,.0f} {:12.1f} {:17,.0f}".format(b, v, n, c))
best = max((day(i / 1000)[2], i / 1000) for i in range(1001))
v, n, c = day(best[1])
print("\n best breadth b = {:.3f}: {:,.0f} views, {:.1f} buyers,"
.format(best[1], v, n))
print(" RM {:,.0f} a day".format(c))
v1, n1, c1 = day(1.0)
print(" the broadest hook: {:.1f} times the views of the best,"
.format(v1 / v))
print(" {:.2f} of its buyers, RM {:,.0f} a day".format(n1 / n, c1))
print("\nReading: the cash optimum sits at a modest breadth, well")
print("short of the hook that maximises views. Past it, each extra")
print("view brings more strangers than buyers, refunds rise and")
print("the premium programme sells to fewer of them. The broadest")
print("hook earns about a fifth of the optimum with ten times the")
print("views of the narrowest.")
# breadth b views/day buyers/day net cash RM/day
# 0.0 2,000 20.0 1,867
# 0.2 3,170 28.1 2,435
# 0.4 5,024 31.1 2,476
# 0.6 7,962 27.1 1,966
# 0.8 12,619 18.6 1,205
# 1.0 20,000 10.0 545
#
# best breadth b = 0.314: 4,121 views, 30.7 buyers,
# RM 2,534 a day
# the broadest hook: 4.9 times the views of the best,
# 0.33 of its buyers, RM 545 a day
#
# Reading: the cash optimum sits at a modest breadth, well
# short of the hook that maximises views. Past it, each extra
# view brings more strangers than buyers, refunds rise and
# the premium programme sells to fewer of them. The broadest
# hook earns about a fifth of the optimum with ten times the
# views of the narrowest.The narrowest hook brings 2,000 views, 20.0 buyers and RM 1,867 of net cash a day. The cash-optimal breadth is 0.314: 4,121 views, 30.7 buyers and RM 2,534 a day. The broadest hook brings 20,000 views, 4.9 times the optimum, but only 0.33 of its buyers and RM 545 a day, about a fifth of the optimum. The mechanism of reverse selection is direct: past the optimum each extra view brings more strangers than buyers, refunds rise, and the premium programme sells to fewer people.
Attention residue and the timing of the offer
A viewer who taps through from the feed to a landing page arrives with part of the mind still on the feed. Leroy’s experiments showed that switching away from an unfinished task leaves “attention residue” that impairs performance on the next task, and that finishing the first task before switching reduces it (Leroy 2009). The program lets attention at second after arrival be and the chance the viewer is still on the page be ; an offer shown at second converts in proportion to their product.
Calculation
# Chapter 4. p08: Attention residue and the landing page delay.
# A viewer who taps through from the feed arrives with part of the
# mind still on the feed (attention residue). Illustrative model:
# attention at time t after arrival a(t) = 1 - rho exp(-t / tau);
# chance the viewer is still there exp(-beta t);
# and the offer, shown at time t, converts in proportion to both:
# f(t) = exp(-beta t) (1 - rho exp(-t / tau)).
# Setting f'(t) = 0 gives the best delay
# t* = tau ln(rho (1 + beta tau) / (beta tau)), or 0 if negative.
# tau = 8 s, beta = 0.03 per second. rho = 0.5 when the video leaves
# its story open (a cliffhanger) and 0.2 when it closes the story
# before the call to action. The program also checks t* on a grid.
import math
def f(t, rho, tau=8.0, beta=0.03):
return math.exp(-beta * t) * (1 - rho * math.exp(-t / tau))
def t_star(rho, tau=8.0, beta=0.03):
x = rho * (1 + beta * tau) / (beta * tau)
return max(0.0, tau * math.log(x))
if __name__ == "__main__":
print(" delay t (s) open story rho 0.5 closed story rho 0.2")
for t in (0, 2, 4, 8, 15, 30):
print(" {:11d} {:20.3f} {:22.3f}".format(t, f(t, 0.5), f(t, 0.2)))
for rho in (0.5, 0.2):
ts = t_star(rho)
grid = max((f(i / 100, rho), i / 100) for i in range(6001))
print("\n rho = {}: t* = {:.2f} s, f(t*) = {:.3f}; grid {:.2f} s"
.format(rho, ts, f(ts, rho), grid[1]))
gain = f(t_star(0.2), 0.2) / f(t_star(0.5), 0.5)
print("\n closing the story first: {:.3f} times the conversion"
.format(gain))
print("\nReading: an offer shown the instant a viewer lands meets a")
print("divided mind; a short decompression of several seconds helps")
print("more than it loses to bounces. Better still is to let the")
print("video finish its story before the call to action, so that")
print("less of the mind stays behind.")
# delay t (s) open story rho 0.5 closed story rho 0.2
# 0 0.500 0.800
# 2 0.575 0.795
# 4 0.618 0.779
# 8 0.642 0.729
# 15 0.589 0.618
# 30 0.402 0.405
#
# rho = 0.5: t* = 7.59 s, f(t*) = 0.642; grid 7.59 s
#
# rho = 0.2: t* = 0.26 s, f(t*) = 0.800; grid 0.26 s
#
# closing the story first: 1.246 times the conversion
#
# Reading: an offer shown the instant a viewer lands meets a
# divided mind; a short decompression of several seconds helps
# more than it loses to bounces. Better still is to let the
# video finish its story before the call to action, so that
# less of the mind stays behind.When the video ends on a cliffhanger (), an offer at the instant of arrival converts at a relative 0.500; the best delay is 7.59 seconds, which lifts conversion to 0.642. When the video finishes its story before the call to action (), the best delay is only 0.26 seconds and conversion is 0.800, 1.246 times the best of the cliffhanger case. Two conclusions: with residue, a few seconds of “decompression” gain more than they lose; better still, let the video finish its story so that less attention stays behind.
Hypothesis · not established
Testable consequence. In a randomised landing-page experiment, visitors who come from cliffhanger videos should convert better as the offer is delayed, up to a point, and worse after it; visitors from videos that finish their story should convert almost best when the offer appears at once. What would show this wrong: if conversion falls steadily with delay for both kinds of visitor, attention residue is not a main driver of landing conversion.
Summary
Hook breadth has a cash optimum far below the breadth that maximises views; past it, views rise and cash falls. The best moment for an offer depends on the attention residue a viewer brings, and the most effective remedy is to let the video complete its story.
References
Fan, Y. (2026). Short-Video Completion Hazards, Recommender Exploration Loops and Automated Acquisition Funnels: Weibull Swipe-Away Kinetics, Multi-Stage Pool Promotion Thresholds and Traffic-to-Cashflow Conversion Bounds [短视频完播率风险函数、推荐反馈环与自动化获客漏斗] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090213 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).