D-CODE: Code and Data Supporting the Organizing Principle Theorem for Cooperation under Imperfect Information

<p dir="ltr">This deposit contains the complete analytical and computational verification of the D-CODE stochastic game framework presented in "D-CODE: An Organizing Principle Theorem for Cooperation under Imperfect Information" (Part I) and "D-CODE: Evaluating the Organizing Principle Across Biological and Computational Systems" (Part II). It is fully reproducible: every figure, threshold, and worked example reported in the two papers can be regenerated directly from the code here, using fixed random seeds throughout.</p><p dir="ltr">The deposit includes a 12-module analytical pipeline implementing all definitions, theorems, and corollaries from Part I in closed form, including an independent Jacobian eigenvalue verification of the local stability of Theorem 5's fixed points; a 7-module Mesa agent-based simulation placing four agent types on three network topologies (Erdős–Rényi, Watts–Strogatz, and Barabási–Albert) across twelve resource levels and fifty seeds per condition; six standalone verification scripts that each reproduce one specific figure or worked example from the papers; the resulting figures and CSV data; and eight supplementary documents covering the master parameter set, closed-form equations reference, Cooperation Stability Index definition, comparative theory tables, falsifiable predictions, and biological correspondence tables.</p><p dir="ltr">A README at the top level lists exact commands to reproduce each component and a table comparing every key computed value against the value stated in the papers.</p>