What does Reciprocal Edges and Ice-Breaking Pairs in Peer Boards conclude, in numbers, about “Closing the Loop: the Intake Pairing Sheet, the Ice-Breaker Pairing Planner and a Pre-Registered Test”?
Answer: Chapter 8 gives the intake pairing sheet, the distilled Ice-Breaker Pairing Planner and a pre-registered test plan needing about 34 intake cohorts per arm with reciprocal edges as the primary outcome. Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.
Scope of the numbers: Chapter 1 takes a census of an illustrative board, where 74 directed pairs with contact form only 15 reciprocal edges, and shows with two simulated worlds that risk ratios of 6.09 and 2.69 can both arise where reciprocal edges do nothing. Marked boxes separate published evidence, runnable Python calculations (18 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: 34
| z(0.975) | 1.9600, z(0.80) = 0.8416 |
| primary: > | 1 reciprocal edge by day 90 |
| p0 p1 n/arm ICC 0.02 ICC 0.05 ICC 0.10 (cohorts/arm) | |
| 0.55 | 0.70 163 30 34 41 |
| 0.60 | 0.75 152 28 32 38 |
| 0.60 | 0.70 356 66 75 89 |
| secondary: silent exit in the first quarter | |
| 0.12 | 0.08: 882 newcomers per arm, 184 cohorts at ICC 0.05 |
| 0.15 | 0.10: 686 newcomers per arm, 143 cohorts at ICC 0.05 |
Show the full program
# Chapter 8. p82: sample sizes for the pre-registered intake trial.
# Unit of randomisation: an intake cohort (6 newcomers joining one
# board), assigned whole to the sheet of p81 or to random pairing, so
# that the two arms never share a meeting. Primary outcome: newcomer
# holds >= 1 reciprocal edge on day 90. Secondary: silent exit within
# the first quarter. Two-sided alpha 0.05, power 0.80;
# n per arm = (za sqrt(2 pbar qbar) + zb sqrt(p0 q0 + p1 q1))^2
# / (p1 - p0)^2,
# inflated by the design effect 1 + (m - 1) ICC with m = 6.
# Rates and ICC values are illustrative planning inputs.
import math
from statistics import NormalDist
Z = NormalDist()
za, zb = Z.inv_cdf(0.975), Z.inv_cdf(0.80)
def n_arm(p0, p1):
pb = (p0 + p1) / 2
top = (za * math.sqrt(2 * pb * (1 - pb))
+ zb * math.sqrt(p0 * (1 - p0) + p1 * (1 - p1)))
return top ** 2 / (p1 - p0) ** 2
print("z(0.975) = %.4f, z(0.80) = %.4f" % (za, zb))
print("primary: >= 1 reciprocal edge by day 90")
print(" p0 p1 n/arm ICC 0.02 ICC 0.05 ICC 0.10 (cohorts/arm)")
for p0, p1 in ((0.55, 0.70), (0.60, 0.75), (0.60, 0.70)):
n = math.ceil(n_arm(p0, p1))
cells = []
for icc in (0.02, 0.05, 0.10):
de = 1 + 5 * icc
cells.append("%9d" % math.ceil(n * de / 6))
print(" %.2f %.2f %5d " % (p0, p1, n) + " ".join(cells))
print("secondary: silent exit in the first quarter")
for p0, p1 in ((0.12, 0.08), (0.15, 0.10)):
n = math.ceil(n_arm(p0, p1))
print(" %.2f -> %.2f: %d newcomers per arm, %d cohorts at ICC 0.05"
% (p0, p1, n, math.ceil(n * 1.25 / 6)))Single source and citation
Fan, Y. (2026). Cohesion Topology of High-Ticket Peer Boards and First-Quarter Silent Attrition: Degree Centrality, Reciprocal Edge Weights and Ice-Breaking Pairing Algorithms (Version 1.0.0), Chapter 8: Closing the Loop: the Intake Pairing Sheet, the Ice-Breaker Pairing Planner and a Pre-Registered Test. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-278 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026278,
author = {Fan, Yafu},
title = {Cohesion Topology of High-Ticket Peer Boards and First-Quarter Silent Attrition: Degree Centrality, Reciprocal Edge Weights and Ice-Breaking Pairing Algorithms},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · No Reciprocal Edge: a Structural Signal of First-Quarter Silent Attrition and the Problem of Identifying It
- Chapter 2 · Degree, Betweenness and Structural Holes: Whose Exit Would Cut the Board Apart
- Chapter 3 · Weighing Reciprocal Edges: Chat Volume, Two-Way Exchange and a Random Baseline
- Chapter 4 · Maximum-Weight Matching for Ice-Breaking Pairs: Exact Recursion, Greed, Rotation and Three Possible Worlds
- Chapter 5 · Stable Pairing: Irving's Roommates Algorithm, Instances without a Solution and the Price of Satisfaction
- Chapter 6 · Similarity and Bridging: the Structural Cost of Pairing and the Ethical Limits of Risk Labels
- Chapter 7 · Eastern and Western Sources Examined: the Joined Lakes of the Dui Hexagram and Aristotle on Friendship