5D Library › Cart-Abandonment Recovery Kinetics, Sunk-Data Retention Ratchets and High-Ticket B2B Qualification Mechanisms · 中文
Preface: After No Sale, After the Sale and Before the Large Sale
Note
Please read this first. The book studies the mathematics of three things: when, and how many times, to follow up after a buyer abandons a cart; how the data a subscriber accumulates affects renewal, and what a rising renewal rate actually shows; and how high-ticket business licences and advisory services can screen clients with menus, application forms and deposits. Return rates, unsubscribe rates, renewal parameters, client valuations and close rates are illustrative or synthetic models, there to show structure, not data from any real shop or client; all data are generated by the programs printed in the book. The book is not legal advice.
Volume 78 dealt with adding to an order at the moment of sale and after it. This book deals with three neighbouring moments: when a buyer leaves without buying, when a subscriber decides whether to renew, and when a business client weighs a licence at RM 9,800 or RM 29,800. Each has a popular rule of thumb: after abandonment, follow up at 15 minutes, 24 hours and 72 hours; the more data users accumulate the harder it is to leave, so renewal rises month by month; expensive products need an application form that keeps unsuitable clients out. The book writes them as runnable arithmetic and then asks when they hold.
The book continues Volumes 77 and 78, forming a set of three, and keeps the same approach: compute first, then draw the boundaries, and report negative results as they are.
What the book contains
Chapter 1 uses an externally excited return-intensity model to compare the timing of three follow-ups and to compute how many to send. Chapter 2 computes how discount hooks teach buyers to abandon on purpose, and how many “recovered” orders would have come back anyway. Chapter 3 writes down a sunk-data renewal ratchet and shows that the same rising renewal curve can come entirely from selection. Chapter 4 computes the cost of data export and the self-selection of annual plans. Chapter 5 discusses screening with a two-licence menu and an application form, and Chapter 6 computes the allocation of advisor time and the signalling role of a deposit. Chapter 7 reads the “Nine Grounds” chapter of the Sunzi, the “Chuai” and “Mo” chapters of the Guiguzi and the “Exalting the Worthy I” chapter of the Mozi. Chapter 8 gives the full recovery ledger, an experiment that tells a ratchet from selection, and a pre-registered holdout experiment.
Claims corrected after checking
- “15 minutes, 24 hours, 72 hours” is not a precise optimum. In the illustrative model it reaches 91% of the best gain on the grid; the grid optimum is 0.25 h, 12 h and 24 h, and 33 of 220 candidate schedules reach 90% of the best gain. The optimum is flat; what matters is sending the first message early (p01).
- This is not a Hawkes process in the strict sense. Returning is an absorbing event (after coming back to buy, one does not “return” again), so self-excitation has no meaning; the book uses an intensity excited from outside by the follow-ups (p01).
- Attributed recovery greatly overstates the effect. With the first message at 0.25 h, only 0.43 of the orders attribution credits are increments caused by the follow-ups; after refunds, unsubscribes and complaints, net revenue is only 36% of the attributed figure (p04, p14).
- Discount hooks teach buyers to wait. When buyers who receive a coupon learn to abandon on purpose with probability 0.6, a year’s revenue is RM 880,971, below the RM 882,196 of plain reminders (p03).
- Renewal rising month by month does not prove a ratchet. A selection model in which everyone’s renewal rate is constant but people differ (sBG) fits the ratchet model’s cohort survival curve to within a largest gap of 0.011; only a randomised experiment can tell the two apart (p06, p15).
- The Rothschild-Stiglitz model is about competitive insurance markets. One seller designing two licences is closer to the monopoly menu of Mussa and Rosen; the friction of an application form screens only if unsuitable clients give up more easily (p09, p10).
How to read the boxes
The boxes separate published evidence, runnable Python calculations (16 programs, standard library only, fixed random seeds, each run at build time with its real output printed beneath it), classical sources, notes and the author’s hypotheses; every hypothesis states what result would show it wrong. Programs and their output use ASCII characters only.
Disclosure
The author uses the works of 5D Library, including this book, as the methodological basis of his community courses, the 5D Ascension Cards (Dimensional Shift Card Decks) and the Yafu AI knowledge base, and runs a number of websites, paid online reading software, subscriptions, reports, courses, business licences and advisory services whose abandonment follow-ups, renewals and client screening are exactly what this book studies, so he has a direct commercial interest in its subject. The book promotes no software, course, card deck or service, uses no user data from the author’s businesses, and accepts no sponsorship. Its parameters are synthetic or illustrative. The experiment in Chapter 8 must follow a pre-registered protocol, and its results will be published whether positive or negative.
Fan, Y. (2026). Cart-Abandonment Recovery Kinetics, Sunk-Data Retention Ratchets and High-Ticket B2B Qualification Mechanisms: Multi-Pulse Follow-Up Timing, Switching-Cost Accumulation and Screening Equilibria [弃单挽回动力学、沉没数据续费棘轮与高客单顾问筛选机制] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090209 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).