lin-0114

8.10 Five recurring deep shapes

The applications later in the book instantiate a small family of diagram shapes.

Shape	Declaration	Deep realization	Later example
Parallel paths	two serial routes agree	shared modules with route-specific composition	GIRL, ALLORA
Restricted factorization	edge or local data arise from a smaller object	encoder plus constrained decoder	LINCS–RLHF
Descent diagram	local models agree on overlaps and glue	local networks and learned restrictions	SID
Typed apex	faces restrict from an information-rich object	view encoders, gauges, global decoder	RADAR
Controlled interaction	generated update fields close or compose	skills, adapters, intervention modules	LASKO; BRIDGE; SKFM

Table 8.2 Recurring deep-sketch shapes. Domain semantics determine what each factorization means.

This classification does not prove the domain-specific claims of those systems. It shows that once their maps are realized as parametrized modules, the same serial, monoidal, tangent, and learner semantics can be reused.