<?xml version='1.0' encoding='utf-8'?>
<?xml-stylesheet type="text/xsl" href="/v2/static/oai2.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-10-09T03:40:42Z</responseDate>
  <request identifier="oai:figshare.com:article/33981751" metadataPrefix="oai_dc" verb="GetRecord">https://api.figshare.com/v2/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:figshare.com:article/33981751</identifier>
        <datestamp>2026-09-24T11:50:07Z</datestamp>
        <setSpec>category_29755</setSpec>
        <setSpec>category_29761</setSpec>
        <setSpec>category_29764</setSpec>
        <setSpec>item_type_3</setSpec>
        <setSpec>month_year_09_2026</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"  xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>D-CODE: Code and Data Supporting the Organizing Principle Theorem for Cooperation under Imperfect Information</dc:title>
          <dc:creator>Geetha Ganesan (6738512)</dc:creator>
          <dc:creator>PANCHABI VAITHIYANATHAN (24591081)</dc:creator>
          <dc:subject>Biological mathematics</dc:subject>
          <dc:subject>Complex systems</dc:subject>
          <dc:subject>Dynamical systems in applications</dc:subject>
          <dc:subject>Folk theorems</dc:subject>
          <dc:subject>Evolutionary Game Theory</dc:subject>
          <dc:subject>Cooperation Dynamics</dc:subject>
          <dc:description>&lt;p dir="ltr"&gt;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.&lt;/p&gt;&lt;p dir="ltr"&gt;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.&lt;/p&gt;&lt;p dir="ltr"&gt;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.&lt;/p&gt;</dc:description>
          <dc:date>2026-09-24T11:50:07Z</dc:date>
          <dc:type>Dataset</dc:type>
          <dc:type>Dataset</dc:type>
          <dc:identifier>10.6084/m9.figshare.33981751.v1</dc:identifier>
          <dc:relation>https://figshare.com/articles/dataset/D-CODE_Code_and_Data_Supporting_the_Organizing_Principle_Theorem_for_Cooperation_under_Imperfect_Information/33981751</dc:relation>
          <dc:rights>CC BY 4.0</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
