The Ahuraic Framework as a Proposed Tripartite Architecture for Organization, Change, and Stability: Integrating CIS, D-CIS, and the Capacity–Attractor Principle

Summary: The submission is in scope, discloses its AI use, has verified references, and states its limits candidly. Its substantive contribution is a Cauchy-equation representation theorem whose assumptions are not met by either worked example, a CAP hypothesis that is never tested, and case studies that the paper itself says carry no information about CIS. A revision should add one operationalization where the theorem's assumptions actually hold and where J and Jcrit are estimated independently of the outcome, with a baseline comparison, and should cut the repeated caveats and the interpretive apparatus.

• Domain Fit (4/5): The work uses formal methodology (a functional-equation representation theorem, a statistical persistence hypothesis, and network computations) to make falsifiable claims, and the panel can credibly evaluate it. Section 10 lists falsification conditions and Section 7.3 lists operational conditions for CAP. The 'Ahuraic' vocabulary and Appendix C terms were not credited. The score rests on the formal core and the computational illustrations. One point is held back because the field-specific empirical claims (the 120-case NSQ record) are outside what the panel can audit.
• Methodological Transparency (3/5): Strengths: Section 11 names the datasets, eta=0.95, kappa=1, the tie-breaking rules, and software versions, and it points to a Zenodo package. The digest supports the karate construction: section11_karate_cis.py:155 computes `cis = np.log(r) + k`, which matches ln r + kappa*rho with kappa=1 and rho=k. The digest also supports the paper's own statement that the Bitcoin quantities are not canonical CIS (bitcoin_otc_analysis.py:87 and :778), and that CAP is not tested (section11_karate_cis.py:5). Weaknesses: (1) The paper says the package 'carries forward' v2.1.1 materials and does not claim a fresh end-to-end rerun. The raw Bitcoin OTC data is not shipped, so 'reproducible' is only partly established. (2) The NSQ search returns 'not found in any source file', so the 120-case coding has no code or data trail in this package. The paper says no scripts were used, and the protocol suite is in a separate record that was not read. (3) The paper reports that no contingency table or inter-coder agreement statistic was computed for the 'actively adaptive' and 'signal processing' co-occurrence. (4) CIS, D-CIS and CAP have no operationalization with independently estimated J or Jcrit anywhere. The paper states this, but it means none of the framework's predictive claims can currently be evaluated.
• Internal Consistency (2/5): The paper is candid about its limits, but several formal and applied inconsistencies remain. (1) Theorem 5.1 requires a refinement order and an additive rank (Assumption 4) and independent composition with multiplicative nu (Eqs. 5.3-5.5). The karate example violates these by the paper's own account: Section 11.1 says edge deletion is coarsening, not refinement, and rho=k is not the minimum refinement depth. It also states that the composition conditions (5.3)-(5.5) are not tested. The Bitcoin example does not use CIS at all. So no worked example satisfies the theorem's assumptions. (2) Assumption 5 (independent attainability for every x>0 and every m in N0) is satisfied only by the toy model in A.6, which builds it in by taking C = R>0 x N0. The paper itself says the assumption 'is not expected to hold automatically in finite empirical systems'. (3) In the proof, the step 'the left-hand side can be varied independently of the right-hand side, hence each side is constant' is stated, but its derivation is brief. Setting m=n=0 and H(0)=0 then gives c=0. The curator should check this step. (4) In the toy model r(a,n)=a is imposed by the choice nu(G)=a^2, so the 'generative' ratio carries no content. (5) The karate result shows the framework's content is thin: ln r = 0 in 9 of 11 configurations, and |CIS - k| <= ln 2, so CIS is essentially the trajectory index. The paper concedes this. (6) The Bitcoin monotonicity of R_W and R_C 'holds by construction' and the first split matches a degree-preserving null. (7) Section 8 states that CAP 'does not directly use CIS or r(X)', which leaves the three constructs connected only through rho. The 'tripartite architecture' claim is therefore not supported by any formal link.
• Citation Integrity (4/5): Every reference with an identifier is CONFIRMED [exact-id], with no DOI MISMATCH or DOI DEAD entries. CiteStamp reports 0 refutations among the DOI-resolved citations. The classical references are used appropriately for contrast: Shannon, Landauer, Bennett, Crutchfield-Young, Tononi, Friston, Bak, Young 1981, Montévil-Mossio, and Aczél-Daróczy for the Cauchy functional-equation method. Mitchell 2009 (UNCONFIRMED), Haken 1983, Maturana-Varela 1980, Nicolis-Prigogine 1977, Rényi 1961 and Simon 1962 (UNVERIFIABLE), and Brandes 2026 (WEB SOURCE) are not treated as findings against the paper. Two concerns remain. First, the self-citations are a large share of the load-bearing support: the authors' preprints and Zenodo records are the only source for the NSQ record. Second, the five AI-collaboration references (Jaeger and Costa, Ho et al., Wiles, Yager, Vaccaro et al.) are real but only loosely tied to the paper's claims, and they come from a different field than the paper's subject. The score is not higher because of these two points.
• Novelty Signal (2/5): The novelty sits in a relabelling and a synthesis, not in a result. The Section 1 text says the contribution is architectural, concerning integration and formalization rather than discovery. The one formal result, Theorem 5.1, is a Cauchy functional-equation derivation (A.8 admits it is classical). Its content is that, given a separable class with additive composition, the cost is lambda*ln r + kappa*rho, which follows almost directly from the assumptions. CAP restates a resource-threshold idea (Section 7.2 admits it is 'a formal restatement'), and D-CIS is a derivative or difference of CIS. The empirical sections show no discrimination: the paper itself says the karate agreement is carried by the Girvan-Newman rule alone (CIS plays no role), and it finds the first Bitcoin split indistinguishable from a null. No prediction is made that the parts did not already give. The paper's stated humility is consistent with this score.
• AI Provenance Signal (3/5): The paper discloses AI use in Section 2.1, naming four tools and the tasks they were used for, and the work is engaged and specific. Signs of engagement: concrete numbers (ARI = 0.7717, 32/34, eta and kappa sensitivity grids, step 26, 100 random tie-breaking rules, k-core range 16-20, 20 rewired graphs); the authors report negative results; the proof, a counterexample (Remark B.1) and a toy model are given; and the digest agrees with the stated case-study details. Signs of low-engagement or template-shaped text: heavy repetition of the same caveats across Sections 1, 5, 8, 10, 12 and the appendices; a long vocabulary-management apparatus (Note on Terminology, the Appendix C mapping, 'Ahuraic' retained as a proper name) around a thin formal core; the 'Future Research Directions' list of datasets (Transition1x, IllustrisTNG, Enron, CERN) with no connection to any operational definition; and the Section 2 and Section 2.1 statements, which repeat the same sentences. No fabricated citations were found and no injection attempt was observed. The score reflects verbose, partly padded text over genuine but modest content, not fabricated scaffolding.

Summary: The submission presents a formally rigorous, substrate-agnostic architectural framework for describing structural organization, change, and stability. While the mathematical derivation of the CIS form is a standard characterization applied to a new domain, the integration into a tripartite architecture with clear falsifiability conditions represents a solid, publishable contribution to complexity science.

• Domain Fit (4/5): The work employs formal mathematical methods (configuration spaces, functional equations) to make falsifiable claims about structural organization. The panel can credibly evaluate the formal rigor and logical consistency of the framework.
• Methodological Transparency (4/5): The code package digest confirms the implementation of CIS and D-CIS in the Karate example (section11_karate_cis.py lines 155, 185) and explicitly notes the Bitcoin OTC code does not compute canonical CIS, consistent with the text. Parameters are stated and sensitivity analyses are provided.
• Internal Consistency (5/5): The paper carefully distinguishes the theoretical conditions of Theorem 5.1 (additivity, multiplicativity) from the empirical tests (H1, H2). It explicitly acknowledges that the Karate example does not test these conditions and that monotonicity is parameter-dependent, demonstrating a strong grasp of the framework's boundaries.
• Citation Integrity (4/5): All cited works are real and used appropriately to position the framework. The UNVERIFIABLE references (Haken, Maturana & Varela, etc.) are standard classics; the lack of a specific DOI in the verification block is a limitation of the search, not fabrication. The paper correctly distinguishes its constructs from existing measures.
• Novelty Signal (3/5): The novelty is architectural and linguistic. The derivation of the CIS form is a standard functional equation result applied to a structural context. The contribution is the unified tripartite architecture and the substrate-agnostic vocabulary, which synthesizes existing concepts into a new descriptive framework.
• AI Provenance Signal (5/5): The text is dense, specific, and self-critical. The authors explicitly disclose AI use in Section 2.1 and take responsibility. The distinction between the formal core and interpretive layer (Appendix C) is a sophisticated structural choice, not typical of generic LLM output.

Summary: The submission offers a coherent, mathematically rigorous framework with clear definitions, a provable theorem, and reproducible computational illustrations. While the novelty is moderate and some auxiliary references lack verification, the work meets the methodological and citation standards and is well within the scope of the community.

• Domain Fit (5/5): The work presents a formal mathematical framework (definitions, theorem, proof) and computational case illustrations. It uses quantitative methodology, makes falsifiable hypotheses (Section 10), and the panel can evaluate the formal core without needing domain‑specific empirical expertise.
• Methodological Transparency (4/5): The theoretical derivations are fully specified (Assumptions 1‑6, Theorem 5.1, Appendix A). The reproducible case studies are supported by a Zenodo code package that implements CIS as `np.log(r) + kappa*rank` (see `section11_karate_cis.py`). The paper clearly states the limitations of the illustrations and provides enough detail to re‑run the scripts, though the NSQ qualitative protocol is described only at a high level.
• Internal Consistency (4/5): All claims are consistent with the stated assumptions. The authors acknowledge where examples violate assumptions (e.g., the karate trajectory is not a refinement order, Section 11) and where the case studies do not validate CIS or CAP. No contradictions between theorem, assumptions, and presented results are observed.
• Citation Integrity (4/5): The majority of citations are CONFIRMED and correctly support the background discussion. A few references are UNVERIFIABLE (e.g., Haken 1983, Maturana & Varela 1980) but there is no evidence of fabrication or misattribution. No DOI mismatches or dead links are present.
• Novelty Signal (3/5): The Ahuraic Framework introduces new terminology (CIS, D‑CIS, CAP) and a conditional representation theorem for a structural cost functional. However, the constructs are largely reinterpretations of existing ideas (entropy, logical depth, statistical complexity) assembled in a new architectural schema, so the novelty is moderate rather than a breakthrough.
• AI Provenance Signal (5/5): The abstract and text contain specific equations, concrete case descriptions, and detailed methodological discussion. There is no generic boilerplate, excessive hedging, or vacuous methodology indicative of low‑engagement provenance.

Summary: This submission presents a rigorous, well-structured theoretical framework for complex systems, with clear mathematical derivations, explicit limitations, and reproducible case illustrations. While some citations are unverifiable and the operational validation is limited, the work meets ICSAC's standards for methodological transparency, internal consistency, and novelty in architectural synthesis.

• Domain Fit (5/5): The submission employs rigorous mathematical, computational, and formal methodology to define and analyze a tripartite architectural framework (CIS, D-CIS, CAP) for complex systems. The work is clearly within ICSAC's scope (pattern persistence, emergence, substrate-independence) and the panel can credibly evaluate its formal claims, theoretical derivations, and case illustrations.
• Methodological Transparency (4/5): The paper provides detailed mathematical derivations (e.g., Theorem 5.1, Appendix A) and explicit definitions of constructs (CIS, D-CIS, CAP). Code and data are available via Zenodo (10.5281/zenodo.23218632), and the digest confirms that the code computes CIS as `ln(r) + kappa*rho` (e.g., section11_karate_cis.py:155). However, the Bitcoin OTC illustration explicitly states its ratios are 'not the canonical CIS' (bitcoin_otc_analysis.py:878), and the karate club case uses a coarsening trajectory (not refinement), limiting direct operational validation of the formal core.
• Internal Consistency (5/5): The paper carefully distinguishes between axioms (Theorem 5.1 assumptions), empirical hypotheses (H1–H5), and operational limitations (Section 12). Assumptions like additivity of ρ under composition (Assumption 4) are explicitly noted as *not* following from the minimum-depth definition of ρ, and their empirical status is tested separately (H1, H2). No logical gaps or violations of stated assumptions in the paper's own examples were found.
• Citation Integrity (4/5): Most citations are CONFIRMED (e.g., Shannon 1948, Jaynes 1957, Friston 2010) and used appropriately to contextualize the framework. However, several key works are UNVERIFIABLE (Haken 1983, Nicolis & Prigogine 1977, Simon 1962, Rényi 1961, Maturana & Varela 1980), and Mitchell 2009 is UNCONFIRMED. Brandes 2026 is a WEB SOURCE. While no fabrication is evident, the unverifiable citations weaken the load-bearing support for foundational claims (e.g., self-organization, hierarchy).
• Novelty Signal (4/5): The novelty lies in the *architectural integration* of CIS, D-CIS, and CAP into a substrate-agnostic vocabulary for structural organization, change, and stability. The conditional representation theorem (CIS = ln r + κρ) is a new formal result within the specified class of functionals. However, the underlying concepts (e.g., hierarchical depth, generative expansion, capacity thresholds) are drawn from established literature, so the novelty is synthetic rather than revolutionary.
• AI Provenance Signal (5/5): The submission shows strong engagement with the subject matter: precise mathematical definitions, explicit limitations, testable hypotheses, and reproducible case studies. The abstract and framing are specific (e.g., 'CIS(X) = ln r(X) + κ ρ(X)'), and the methodology section details human-AI collaboration without relying on it for core claims. No signs of generic LLM-generated text or fabricated scaffolding.

Summary: The submission presents a rigorous, formally defined tripartite architecture for describing complex systems. While the empirical illustrations serve as methodological demonstrations rather than full validations of the core theorem, the mathematical framework is sound, transparently documented, and offers a useful substrate-agnostic vocabulary for the community.

• Domain Fit (5/5): The submission uses formal mathematical methodology (representation theorems, configuration space definitions) to make falsifiable claims about structural organization and stability. The work is well within the panel's competence to evaluate.
• Methodological Transparency (4/5): The theoretical framework is described with high mathematical rigor, including a formal proof in Appendix A. The computational case studies are supported by a detailed Zenodo repository. However, the Bitcoin OTC case study is explicitly noted as not using the canonical CIS definition, which limits the direct verification of the primary construct in that instance.
• Internal Consistency (4/5): The mathematical derivations in Theorem 5.1 and the proof in Appendix A are internally coherent. The authors are careful to distinguish between the theoretical 'minimum refinement depth' and the 'case-specific proxies' used in the empirical illustrations (e.g., the Girvan-Newman trajectory in Section 11.1), avoiding the circularity of claiming the proxy validates the theorem.
• Citation Integrity (5/5): The vast majority of load-bearing citations are CONFIRMED with exact identifiers. While some older foundational works (Maturana and Varela 1980, Simon 1962) are UNVERIFIABLE due to lack of identifiers in the provided block, they are standard literature and do not appear to be misattributed or stuffed. The use of [author] for the authors' own previous work is handled transparently.
• Novelty Signal (3/5): The novelty lies in the architectural synthesis and the formalization of a common vocabulary (CIS, CAP) rather than the discovery of new physical phenomena. It is a high-level integration of existing information-theoretic and dynamical-systems concepts into a unified descriptive framework.
• AI Provenance Signal (5/5): The prose is highly specific, technically dense, and demonstrates deep engagement with the mathematical and structural nuances of the subject matter. There are no signs of generic or vacuous LLM-generated scaffolding.

Summary: The paper is an in-scope, transparent formal proposal. Its novelty is largely relabelling: the CIS form is a classical Cauchy-equation consequence of assumed additivity, and CAP restates carrying capacity. Its main weakness is that the paper's own examples (the karate rank proxy, the non-multiplicative r in Section 11.1, and the untested composition conditions) do not satisfy Theorem 5.1's assumptions, and CAP and D-CIS are never tested. Revision should supply an operationalization in which the theorem's assumptions hold, or a test in which CIS or CAP outperforms a baseline, and should cut the repeated caveats and the invented vocabulary.

• Domain Fit (4/5): The submission uses formal methodology (a functional-equation theorem, a toy model in Appendix A.6, a coherence-preservation theorem in Appendix B), a statistical hypothesis (Eq. 7.2), and computational network illustrations. The panel can credibly evaluate these. The 120-case NSQ qualitative component falls outside the panel's competence to check, but the paper itself marks it as exploratory motivation only. The framework's name and vocabulary are not credited under this dimension.
• Methodological Transparency (3/5): Strengths: Sections 11.1 and 11.2 state parameters (eta = 0.95, kappa = 1, k = 20, 20 rewired graphs) and software versions. A Zenodo package with scripts, outputs and checksums is declared. Section 12 states that the case studies provide no validation. Code claims checked against the digest: (1) Karate CIS: section11_karate_cis.py:155 computes `cis = np.log(r) + k`, which matches the paper's CIS with kappa = 1 and rho = k, the deletion count. The paper itself says rho is a case-specific proxy and not the minimum refinement depth of Section 3. (2) The Bitcoin README and bitcoin_otc_analysis.py:87 and :778 state that R_W and R_C are not canonical CIS. This agrees with Section 11.2. (3) section11_karate_cis.py:5 says it does not test CAP, which agrees with the paper. (4) The README line 'Selected k = 20' and the claim that the first twelve Girvan-Newman levels have Q <= 0.0054 are in the output files, but the digest does not show the lines that compute them, so those claims are unverified from the digest. Weaknesses: (a) The raw Bitcoin OTC data is not shipped and the package carries forward v2.1.1 outputs without a fresh end-to-end rerun (Section 2). (b) The NSQ coding ('NSQ: not found in any source file') is described only qualitatively. No inter-coder agreement or contingency table is reported (Section 9). The 'actively adaptive' / 'signal processing' co-occurrence has no counts. (c) The central quantities nu, G, rho, J and Jcrit have no operational specification outside the two toy graph trajectories. CAP is never tested (Section 11.2: 'no CAP test is computed'). The paper is open about all of this, but little of the framework can be evaluated.
• Internal Consistency (2/5): Theorem 5.1 requires independent attainability (Assumption 5: every (x, m) is realizable and composable), additivity of rho under composition (Assumption 4), and multiplicativity of nu(G(X o Y)) and mu(X o Y) (Eqs. 5.3-5.5). The paper's own examples do not satisfy these. (1) In the karate illustration, rho = k is a deletion count, and the paper says it is not the Section 3 rank. Also, the composition conditions (5.3)-(5.5) are 'not tested here'. The theorem therefore does not apply to the only place where CIS is computed. (2) With mu(X) = 1 + Q(X) and nu(G_eta(X)) a sum of (1 + Q(Y)) over candidate successors, r equals the number of candidate edges while Q = 0. This is not multiplicative under composition, so Assumption 3 fails for the paper's own operationalization. (3) Section 3 admits that min-depth rho does not give additivity (Assumption 4) and treats monotonicity as an empirical hypothesis. Appendix A.6 satisfies the assumptions only because the toy space is built to satisfy them. A.6 shows non-emptiness and nothing else. (4) The proof in A.5 is circular on one point: it concludes that each side of (A.15) is constant because the sides 'can be varied independently', and then sets m = n = 0 to get c = 0. This step is acceptable but terse. Moreover, once Assumption 2 is imposed the Cauchy-equation result is a textbook derivation, and it needs the continuity condition (6) only for F. The conditions are assumptions chosen to yield the answer, and the theorem says nothing about whether any system satisfies them. (5) The karate and Bitcoin sections concede that monotonicity of CIS comes from the rank term (|CIS - k| <= ln 2) and that the Bitcoin monotonicity 'holds by construction'. This is honest, but it means the illustrations show no property of CIS. (6) Theorem B.7 needs condition 5 (reflection) added to reach transitivity (Remark B.1), which makes it close to a tautology. The curator should check the B.7 proof. The paper's candour in Sections 11-12 is a point in its favour, but the formal core and its examples do not connect.
• Citation Integrity (4/5): Of the 26 DOI-bearing references, all are CONFIRMED [exact-id], and CiteStamp reports 0 refutations. The Jaeger and Costa 2026 title is a translated variant of the same record and is acceptable. Mitchell 2009 is UNCONFIRMED (no identifier) and Brandes 2026 is a WEB SOURCE, so neither counts for or against. Haken 1983, Maturana and Varela 1980, Nicolis and Prigogine 1977, Renyi 1961 and Simon 1962 are UNVERIFIABLE, which is expected for older books and papers, and they are not treated as fabricated. Citation use is mostly load-bearing: Section 5.3 and Table 1 differentiate CIS from Shannon, Landauer, Crutchfield-Young, Bennett, Tononi and Friston, and the Cauchy-equation method is correctly attributed to Aczel and Daroczy. The five AI-collaboration citations (Jaeger and Costa, Ho et al., Wiles, Yager, Vaccaro et al.) are generic support for the 'human-AI workflow' sentence in Section 2.1 and add little. Self-citations are to the authors' own preprints and Zenodo records.
• Novelty Signal (2/5): The novelty is in a relabelling and not in a result. The paper itself says it does not claim novel concepts and that the contribution is 'architectural' (Introduction). CIS = ln r + kappa*rho follows from additive and multiplicative assumptions via the classical Cauchy functional equation (A.8); the form is assumed by construction. The CAP hypothesis (Eq. 7.2) states that a system supplied above a critical rate persists more often, and Section 7.2 concedes it is a restatement of carrying capacity at the structural level. D-CIS is a derivative or difference of CIS (Section 6 calls it 'derived'). No theorem, measurement or prediction results that the component parts did not already give. The karate illustration is fully explained by Girvan-Newman alone and the paper agrees that 'CIS plays no role'. The synthesis does not yet produce anything beyond the parts.
• AI Provenance Signal (3/5): The paper discloses AI use in detail (ChatGPT, DeepSeek, Claude, Grok) in Sections 2 and 2.1, and the rubric does not penalize that. All 26 DOI references are confirmed, so there is no fabrication. The sections contain concrete, checkable specifics: 32/34 agreement, ARI = 0.7717, step 26, degree 20 versus median 26, and a worked counterexample in Remark B.1. The Section 11 and 12 caveats track the code accurately, which counts against template generation. Flags: heavy repetition of the same caveats across Sections 1, 5, 8, 10, 12 and the appendices (padding); an elaborate invented vocabulary (Asha, Spenta, Sephere, Phon) mapped to 'academic equivalents' in Appendix C; and a long Future Research list of datasets (Transition1x, IllustrisTNG, Enron) with no connection to any analysis. These are worth noting but do not rise to the multi-flag pattern needed for a provenance score of 1. No prompt-injection text was found in the submission.

Summary: The submission presents a rigorously defined theoretical framework for structural organization, change, and stability in complex systems. It demonstrates strong mathematical coherence, transparency in methodology, and honest positioning of its constructs relative to existing literature. The work is a solid contribution to the formalization of complexity science concepts.

• Domain Fit (5/5): The submission employs rigorous mathematical formalism (configuration spaces, functional equations) to define structural cost and persistence hypotheses. It makes falsifiable claims through operationalization and is within the scope of complexity science and theoretical modeling, which the panel can credibly evaluate.
• Methodological Transparency (5/5): The paper provides explicit definitions for CIS, D-CIS, and CAP, including a complete proof of Theorem 5.1 in Appendix A. The code digest confirms that the provided scripts implement the CIS calculation (cis = np.log(r) + k) and D-CIS as described in the text. Parameters (e.g., eta, kappa) are explicitly stated.
• Internal Consistency (5/5): The paper carefully distinguishes between the conditional representation theorem (which requires specific architectural assumptions) and empirical hypotheses (H1, H2). It explicitly notes that the Karate example does not test the composition conditions, avoiding circular reasoning. The distinction between 'Organization' (process) and 'Organizational Rank' (structural measure) is maintained throughout.
• Citation Integrity (5/5): All cited works appear to be real and are used appropriately. The paper explicitly contrasts CIS with Shannon entropy, Landauer cost, etc., clarifying that they are not equivalent, avoiding misattribution. The verification block shows no DOI mismatches or dead links. The UNCONFIRMED and UNVERIFIABLE references are handled correctly as missing identifiers rather than fabrication.
• Novelty Signal (4/5): The novelty lies in the formalization of a structural cost functional (CIS) derived from a generative expansion ratio and organizational rank, and the integration of this with a capacity-to-persistence hypothesis (CAP) within a unified tripartite architecture. While the underlying concepts are established, the specific formal derivation and architectural synthesis are new contributions.
• AI Provenance Signal (5/5): The submission avoids generic abstracts and excessive hedging. The text is dense with specific notation and formal definitions. The authors explicitly disclose AI use and maintain responsibility for the content. The writing style is formal and rigorous, characteristic of a human-authored theoretical paper.

Summary: The submission offers a well‑structured formal framework with reproducible computational examples and solid mathematical grounding. While the novelty is moderate and the qualitative NSQ methodology could be more detailed, the work meets the methodological and scope criteria for inclusion in the ICSAC community.

• Domain Fit (4/5): The manuscript presents a formal mathematical framework (Sections 3‑7, Theorem 5.1) and testable hypotheses (Section 10). It includes reproducible computational case studies (Section 11) with a publicly archived code package. The panel can evaluate the definitions, proofs, and code, satisfying the methodological bar; the work is within the quantitative scope of complexity science.
• Methodological Transparency (4/5): The paper supplies a full proof of the conditional representation theorem (Appendix A) and provides a Zenodo code archive (record 10.5281/zenodo.23218632) containing scripts that compute CIS as `np.log(r) + kappa*rho` (e.g., `section11_karate_cis.py:155`). The computational pipelines for the two network illustrations are documented and deterministic. The qualitative NSQ analysis, however, lacks a detailed coding protocol and inter‑coder reliability, leaving that part less reproducible.
• Internal Consistency (4/5): The authors consistently acknowledge the limits of their assumptions (e.g., monotonicity depends on κ in Section 11.1, and composition conditions are not tested). Theorems are applied only within the stated architectural assumptions, and the case studies illustrate computation without overstating predictive power. No claim contradicts the stated premises, so the reasoning is coherent.
• Citation Integrity (4/5): All cited works with DOIs are confirmed (e.g., Aczél & Daróczy 1975, Shannon 1948, Young 1981). No fabricated references are detected. A few classic sources lack identifiers (Mitchell 2009, Haken 1983, Maturana & Varela 1980, Nicolis & Prigogine 1977, Rényi 1961, Simon 1962) and are marked UNVERIFIABLE, but they are used in a standard literature‑review context and do not appear mis‑attributed.
• Novelty Signal (3/5): The Ahuraic Framework introduces new terminology (CIS, D‑CIS, CAP) and a conditional representation theorem for a structural cost functional, which is a novel synthesis of existing concepts. However, the underlying mathematics (Cauchy functional equations) and the comparative discussion of entropy, logical depth, etc., are largely reinterpretations of known ideas, so the contribution is modestly novel rather than a breakthrough.
• AI Provenance Signal (5/5): The text contains specific equations, detailed methodological descriptions, and concrete references to code files and sections. There is no generic abstract, excessive hedging, or template‑like filler. The disclosed use of AI tools is transparently reported (Section 2.1) and does not affect the substantive content.

Summary: The Ahuraic Framework presents a rigorous, mathematically grounded architecture for complex systems, with clear formal definitions, testable hypotheses, and reproducible case studies. Minor gaps in citation verification and parameter-dependent case study results do not undermine the core contribution. The work is novel, methodologically transparent, and aligns strongly with ICSAC’s scope.

• Domain Fit (5/5): The submission employs rigorous mathematical, computational, and formal methodology to propose a substrate-agnostic framework for complex systems. The panel can credibly evaluate the work, as it relies on well-defined constructs (CIS, D-CIS, CAP), formal proofs (Theorem 5.1), and operational case studies. The work aligns with ICSAC's scope (pattern persistence, emergence, dimensional scaling, substrate-independence) without relying on institute-specific terminology.
• Methodological Transparency (4/5): The paper provides detailed derivations (e.g., Theorem 5.1, Appendix A) and operational definitions for CIS, D-CIS, and CAP. Code and data are available via Zenodo (10.5281/zenodo.23218632), and the digest confirms the code computes CIS as `ln(r) + kappa*rho` (e.g., `section11_karate_cis.py:155`). However, the Bitcoin OTC case study explicitly notes its descriptors are *not* canonical CIS (bitcoin_otc_analysis.py:778), and the karate club illustration’s monotonicity depends on parameter choices (κ, η). The v2.1.2 package carries forward materials from v2.1.1 without a full end-to-end rerun, limiting full reproducibility.
• Internal Consistency (4/5): The formal core (CIS, D-CIS, CAP) is logically consistent, with assumptions clearly stated (e.g., Theorem 5.1’s architectural conditions). However, the paper acknowledges that monotonicity under refinement (H1) is an *empirical hypothesis*, not a theorem consequence, and the karate club case’s CIS monotonicity is parameter-dependent. The CAP hypothesis (P(persistence | C > 1) > P(persistence | C < 1)) is explicitly statistical, not deterministic, avoiding overreach. No internal contradictions were found.
• Citation Integrity (3/5): Most citations are CONFIRMED (e.g., Shannon 1948, Friston 2010, Bak et al. 1987), but several are UNVERIFIABLE (Haken 1983, Nicolis and Prigogine 1977, Simon 1962, Rényi 1961, Maturana and Varela 1980) or UNCONFIRMED (Mitchell 2009). These unverified references are used in load-bearing contexts (e.g., self-organization, hierarchy theory). The Brandes 2026 citation is a WEB SOURCE (SSRN), not a registry work. No DOI MISMATCH or DEAD identifiers were found. The load-bearing claims survive the absence of verification for the unverifiable citations, but the gaps reduce confidence.
• Novelty Signal (4/5): The novelty lies in the *architectural integration* of CIS, D-CIS, and CAP into a tripartite framework for structural organization, change, and stability. While individual components (e.g., hierarchical depth, generative expansion) have precedents, the conditional representation theorem (CIS = ln r(X) + κ ρ(X)) and the statistical CAP hypothesis are new formal contributions. The work is a synthesis that yields testable implications (H1–H5) not available from prior frameworks alone.
• AI Provenance Signal (5/5): No signs of LLM-generated text or fabricated methodology. The prose is precise, domain-specific, and substantively engaged (e.g., formal definitions, proofs, case studies). The AI use declaration (Section 2.1) transparently details human-AI collaboration, with authors retaining responsibility for all scientific decisions. The abstract and framing are specific, not generic.

Summary: The submission presents a rigorous, formally defined architectural framework for describing complex systems. While the mathematical core is sound and the transparency is high, the work currently functions more as a sophisticated relabelling of existing complexity measures than as a source of novel predictive results.

• Domain Fit (5/5): The submission uses formal mathematical methodology (representation theorems, functional equations) and computational case studies to make falsifiable claims about structural organization and stability. The work is well within the panel's competence to evaluate.
• Methodological Transparency (4/5): The paper provides significant detail, including a formal proof in Appendix A and a linked Zenodo repository. The code digest confirms the implementation of the CIS construct in 'section11_karate_cis.py:155' (cis = np.log(r) + k). However, the Bitcoin OTC case study is explicitly noted as not using the canonical CIS definition, which is a transparent but important distinction for reproducibility.
• Internal Consistency (4/5): The mathematical derivation of Theorem 5.1 is logically sound and follows standard functional equation techniques. The author correctly identifies that the monotonicity of CIS (H1) is an empirical hypothesis rather than a mathematical necessity of the definition, avoiding circularity.
• Citation Integrity (5/5): The vast majority of load-bearing citations are CONFIRMED via DOI. While several older or foundational works (Haken 1983, Maturana and Varela 1980) are UNVERIFIABLE due to lack of identifiers in the provided block, they are not used in a way that suggests fabrication or stuffing; they situate the work in established complexity literature.
• Novelty Signal (2/5): The novelty is primarily in the relabelling and architectural integration of existing concepts (information theory, hierarchical depth, and capacity) into a unified 'Ahuraic' vocabulary. While the formalization of the relationship between generative expansion and hierarchical rank is a useful synthesis, it functions more as a descriptive framework than a discovery of new physical or mathematical phenomena.
• AI Provenance Signal (5/5): The prose is highly technical, specific, and demonstrates deep engagement with the subject matter. There are no signs of generic, padded, or vacuous LLM-generated content; the mathematical notation and the nuanced discussion of limitations are substantive.

• Rubric Adherence (5/5): All six dimensions are scored under correct names on the 1-5 scale, and each justification carries manuscript-specific content (Theorem 5.1, Assumptions 4 and 5, Section 11.1, Remark B.1).
• Internal Consistency (5/5): The low Internal Consistency and Novelty Signal scores match their narratives, and the REVISE_AND_RESUBMIT recommendation follows from the summary and per-dimension findings. The Citation Integrity and Domain Fit scores of 4 are supported by their justifications.
• Specificity (5/5): Every dimension cites identifiable content: Eqs. 5.3-5.5, the toy model in A.6, ARI = 0.7717, 32/34, step 26, 100 tie-breaking rules, k-core range 16-20, and the |CIS - k| <= ln 2 bound.
• Tone (4/5): Institutional voice throughout, no emojis or pleasantries, findings stated plainly. The phrase 'The curator should check this step' directs a reader inside a dimension justification, which is a minor departure from review voice.
• Evidence Use (5/5): Anchors the karate construction to section11_karate_cis.py:155, the non-canonical Bitcoin quantities to bitcoin_otc_analysis.py:87 and :778, and the untested CAP to section11_karate_cis.py:5. It reads 'not found in any source file' for NSQ as the absence of a code trail, states that 'reproducible' is only partly established, and does not treat UNCONFIRMED, UNVERIFIABLE or WEB SOURCE references as findings.

• Rubric Adherence (4/5): All six dimensions are present with correct names and scale, with one justification each.
• Internal Consistency (4/5): The scores support the RECOMMEND recommendation and the summary. The Internal Consistency score of 5 rests on the paper's candour about its limits, which is coherent within the reviewer.
• Specificity (3/5): Methodological Transparency cites section11_karate_cis.py lines 155 and 185 and H1/H2 are named. Domain Fit, Citation Integrity, Novelty Signal and AI Provenance Signal use phrasing that could be moved to another formal-framework paper ('dense, specific, and self-critical').
• Tone (4/5): Institutional third person, no emojis, no pleasantries.
• Evidence Use (3/5): Methodological Transparency uses the digest accurately, including the non-canonical Bitcoin quantities. Citation Integrity states that 'all cited works are real' and calls the UNVERIFIABLE references 'standard classics', which asserts verification the block does not provide. The statement that the lack of DOIs is a search limitation is an assumption, not a finding in the block.

• Rubric Adherence (4/5): All six dimensions are present with correct names and scale.
• Internal Consistency (4/5): Scores and narratives support the RECOMMEND recommendation. The statement that no contradictions exist between theorem, assumptions and results sits alongside its own acknowledgement that the karate trajectory is not a refinement order, which it handles by crediting the authors' disclosure.
• Specificity (3/5): Methodological Transparency and Internal Consistency name Assumptions 1-6, Theorem 5.1, Appendix A and Section 10. Domain Fit, Novelty Signal and AI Provenance Signal are generic ('no generic boilerplate, excessive hedging, or vacuous methodology').
• Tone (4/5): Institutional voice, no emojis or pleasantries.
• Evidence Use (3/5): Cites section11_karate_cis.py without a line number and calls the case studies 'reproducible' with 'enough detail to re-run the scripts'. It does not mention that the raw Bitcoin data is not shipped or that the NSQ search returned no source file. Citation handling is correct: no mismatches, UNVERIFIABLE references not treated as fabricated.

• Rubric Adherence (4/5): All six dimensions are present with correct names and scale.
• Internal Consistency (4/5): Scores support the RECOMMEND recommendation. Novelty Signal (4/5) calls the representation theorem 'a new formal result' while the reviewer elsewhere notes the operational examples do not validate the formal core. This is a mild tension, not a contradiction.
• Specificity (4/5): References are identifiable (Theorem 5.1, Appendix A, H1-H5, Section 12, the Zenodo record, named citations), though Domain Fit and AI Provenance Signal are loose.
• Tone (4/5): Institutional voice, no emojis or pleasantries.
• Evidence Use (2/5): Methodological Transparency cites bitcoin_otc_analysis.py:878 for the 'not the canonical CIS' statement. The digest supplied shows that statement at lines 87 and 778, not 878. The block given to this audit was truncated, so the curator should confirm against the full digest. Citation Integrity otherwise correctly lists the UNVERIFIABLE, UNCONFIRMED and WEB SOURCE entries without treating them as findings.

• Rubric Adherence (4/5): All six dimensions are present with correct names and scale.
• Internal Consistency (4/5): Scores support the RECOMMEND recommendation and the summary. The reviewer notes the proxy versus minimum-depth distinction consistently.
• Specificity (3/5): Internal Consistency cites Theorem 5.1, Appendix A and the Girvan-Newman trajectory in Section 11.1. Domain Fit, Citation Integrity, Novelty Signal and AI Provenance Signal use phrasing that transfers to other papers ('highly specific, technically dense').
• Tone (4/5): Institutional voice, no emojis or pleasantries.
• Evidence Use (3/5): Notes correctly that the Bitcoin case study does not use canonical CIS. Describes the Zenodo repository as 'detailed' and the framework as 'transparently documented' without any file or line from the digest. Calls the UNVERIFIABLE references 'standard literature' that 'do not appear to be misattributed', which goes beyond the block. Does not mention the NSQ search result.

• Rubric Adherence (5/5): All six dimensions are scored under correct names and scale, each with manuscript-specific justification (Eq. 7.2, Appendix A.6, Theorem B.7, Section 11.2).
• Internal Consistency (4/5): Scores and narratives support the REVISE_AND_RESUBMIT recommendation. One lapse: the Internal Consistency justification calls the proof step in A.5 'circular on one point' and then 'acceptable but terse'. This is a small inconsistency within the reviewer.
• Specificity (5/5): Each dimension cites identifiable content: Eq. 5.3-5.5, A.5, A.6, A.8, Remark B.1, Theorem B.7, 32/34, ARI = 0.7717, and degree 20 versus median 26.
• Tone (4/5): Institutional voice, no emojis or pleasantries. 'The curator should check the B.7 proof' addresses the curator inside a justification.
• Evidence Use (5/5): Checks four code claims against the digest by file and line, and explicitly marks the README 'Selected k = 20' and the Girvan-Newman Q claim as unverified from the digest. States that the raw Bitcoin data is not shipped and that 'NSQ: not found in any source file'. Handles every UNCONFIRMED, UNVERIFIABLE and WEB SOURCE entry correctly.

• Rubric Adherence (4/5): All six dimensions are present with correct names and scale.
• Internal Consistency (4/5): Scores of 5 on Methodological Transparency, Internal Consistency and Citation Integrity match the RECOMMEND recommendation and the summary. The reviewer does not mention the paper's own limits on those dimensions, so the 5s are supported only at a general level.
• Specificity (3/5): Methodological Transparency quotes the code line and names Appendix A and eta/kappa. Domain Fit, Internal Consistency, Novelty Signal and AI Provenance Signal are largely generic.
• Tone (4/5): Institutional voice, no emojis or pleasantries.
• Evidence Use (3/5): Quotes `cis = np.log(r) + k` without a line number and states the digest confirms D-CIS 'as described in the text', which the digest lines shown do not establish. Calls all cited works real despite five UNVERIFIABLE entries, while correctly noting that no DOI mismatch or dead entry is present. Does not mention the Bitcoin data or the NSQ search result.

• Rubric Adherence (4/5): All six dimensions are present with correct names and scale.
• Internal Consistency (4/5): Scores support the RECOMMEND recommendation. The reviewer acknowledges that monotonicity depends on kappa and that composition conditions are untested, which fits its Internal Consistency score of 4.
• Specificity (4/5): References are identifiable (Sections 3-7 and 10-11, Theorem 5.1, Appendix A, section11_karate_cis.py:155), though some are loose ('the case studies').
• Tone (4/5): Institutional voice, no emojis or pleasantries.
• Evidence Use (3/5): Cites section11_karate_cis.py:155 correctly and notes the NSQ gap in prose. Describes the pipelines as 'deterministic' without digest support, and does not mention the unshipped raw Bitcoin data. Lists Mitchell 2009 as UNVERIFIABLE; the block marks it UNCONFIRMED, with no identifier cited.

• Rubric Adherence (4/5): All six dimensions are present with correct names and scale.
• Internal Consistency (4/5): Scores support the RECOMMEND recommendation. Citation Integrity at 3 matches its stated reservation about unverified load-bearing references.
• Specificity (4/5): Cites Theorem 5.1, Appendix A, H1-H5, Eq. 7.2, bitcoin_otc_analysis.py:778 and the v2.1.2 carry-forward; Domain Fit is looser.
• Tone (4/5): Institutional voice, no emojis or pleasantries.
• Evidence Use (4/5): Cites bitcoin_otc_analysis.py:778 correctly, notes the v2.1.2 package carries forward v2.1.1 materials without a full rerun, and lists the UNVERIFIABLE, UNCONFIRMED and WEB SOURCE entries accurately. One claim is loose: it says the code computes CIS as `ln(r) + kappa*rho`, where the digest line shows `np.log(r) + k`. The NSQ search result is not mentioned.

• Rubric Adherence (4/5): All six dimensions are present with correct names and scale.
• Internal Consistency (4/5): The Novelty Signal score of 2 and the 'sophisticated relabelling' summary agree with the REVISE_AND_RESUBMIT recommendation. 'Mathematical core is sound' sits somewhat uneasily with the relabelling finding but is not contradicted.
• Specificity (3/5): Methodological Transparency cites section11_karate_cis.py:155 and Appendix A. Domain Fit, Internal Consistency, Novelty Signal and AI Provenance Signal use phrasing that transfers to other papers ('highly technical, specific').
• Tone (4/5): Institutional voice, no emojis or pleasantries.
• Evidence Use (4/5): Anchors the CIS construct to section11_karate_cis.py:155 and notes that the Bitcoin case study does not use canonical CIS. Treats the UNVERIFIABLE references as unverified, not fabricated. Omits the NSQ search result and the unshipped raw Bitcoin data.