The attached 200-page manuscript, The Organization of Abstract Organisms, is the complete review copy. It develops a higher-topos semantics of organizational production, typed supplementation, and sustained physical maintenance.
Production and descent
For a demand diagram $D\to R\gets P$ in a slice of a higher topos, closure is the order relation $\operatorname{im}(D\to R)\leq \operatorname{im}(P\to R)$. The image of $D\times_R P\to D$ is the pullback of the production image. Thus closure is equivalent to the existence of production witnesses on an effective cover of the demand. Image factorizations commute with restriction, and pullback along an effective epimorphism reflects their subobject order. This gives a local-to-global test for closure.
A finitary rule presentation defines a monotone production operator $\Phi$. Finite products distribute over directed joins, so the join of the finite production stages is $\mu\Phi$. By induction on height, its stage images are exactly the images of the spaces of typed derivation trees. A compatible host coupling is an operadic pushout $P\amalg_I H$ over the declared interface $I$. Its realization image includes mixed terms, such as a host transformation providing the input of a replicator-controlled operation.
Viable maintenance
A compiled round checks the stock guards, exergy ledger, and discharged organizational obligations of its labeled production witnesses. For the safe subobject $V$ and admitted edge object $L$, define $$ \Psi(A)=V\cap\operatorname{im}(L\times_{S,t}A\xrightarrow{s}S). $$ The join of postfixed subobjects is the greatest fixed point $\nu\Psi$. In a finite graph it consists of the states from which a safe directed cycle is reachable. The round compilation matches this cycle certificate with indefinitely repeatable executions of the admitted production witnesses.
For a periodic schedule with arrivals $a_i$, charges $c_i$, and deficits $d_i=c_i-a_i$, indefinite execution from a full finite battery requires $\sum_i d_i\leq 0$. In an arrival-first ledger the least full-start capacity is $$ \max_i\left(c_i+\max_{0\leq \ell<m}\sum_{j=1}^{\ell}d_{i+j\bmod m}\right). $$ Unfolding the clipped ledger gives this maximum over circular deficit windows. The paper also proves the corresponding robust capacity formula on a finite disturbance graph. A reachable positive-deficit cycle obstructs every finite capacity. Otherwise a maximum-deficit simple suffix after each possible leading charge determines the exact robust threshold.
Separation and evidence
Equivalences of the complete bounded records transport material support, production images, attained budget relations, and viable kernels. Explicit models separate endogenous cellular maintenance, host-dependent replication, and industrially sustained computing machinery. Examples with a common computational observation exhibit distinct physical maintenance records.
The manuscript contains 90 exact worked models of periodic supply, source portfolios, control games, selectable repair routes, stock schedules, and local closure on finite context spaces. It includes proofs, finite verification procedures, and 32 linked references. The three essays in the source reading edition motivate the organization of the paper.
The byline is Anonymous. AI assistance was used in drafting, mathematical exposition, and generating and checking the worked model atlas.