pith. sign in

arxiv: 2606.02392 · v1 · pith:22UNPOMYnew · submitted 2026-06-01 · 💻 cs.SI · cs.LO· q-bio.NC

Topology as Logic: Structural Role Geometry Across Formal, Software, Biological, and Prebiotic Systems

Vladi Ivanov This is my paper

Pith reviewed 2026-06-28 11:46 UTC · model grok-4.3

classification 💻 cs.SI cs.LOq-bio.NC
keywords topologyfunctional organizationnetwork analysislogic structuresprebiotic networksdigital circuitsformal systemshub persistence
0
0 comments X

The pith

Dependency topology recovers expert-described logic structures across mathematics, software, biology, and circuits via hub persistence under the Functional Proximity Law.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper tests whether dependency networks contain recoverable geometry that corresponds to functional load-bearing organization recognized as logic by domain experts. It applies the Functional Proximity Law to measure hub persistence and rank divergence across seven substrates, from formal mathematics and legacy software to neural evolution, prebiotic networks, and digital circuits. Pre-registered experiments show that betweenness-based persistence aligns more closely with expert descriptions than degree-based measures, with confirmed correlations in benchmark circuits and proof-assistant libraries. The work treats topology as a measurable indicator rather than a metaphor for identifying operational organization.

Core claim

Across seven independent substrates, hub persistence and rank divergence under the Functional Proximity Law recover operational organization that domain experts describe as logic: axiomatic load-bearing structure in formal mathematics, control and contract structure in legacy software, conserved hub grammar across neural evolution, catalytic role organization in a prebiotic autocatalytic network, carry-path dominance in a 4-bit digital circuit, betweenness persistence in the ISCAS85 c432 benchmark, and directional replication in the Coq Corelib.

What carries the argument

The Functional Proximity Law applied to multilayer networks, which identifies persistent high-load hubs and rank divergences that align with functional roles described as logic.

If this is right

  • Betweenness centrality yields stronger layer-to-layer persistence than degree centrality in physical versus simulation layers.
  • The approach confirms primary hypotheses in pre-registered tests on ISCAS85 c432 and Lean mathlib4 corpora.
  • Topology supplies a consistent structural signature for logic-like organization that holds from prebiotic chemistry to formal proof systems.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same metrics could be tested on economic transaction networks to recover allocation logic without domain-specific rules.
  • If the pattern holds, automated extraction of functional modules becomes possible in systems where expert labels are unavailable.
  • Extensions to quantum circuit topologies or social coordination graphs would check whether the law generalizes beyond the tested substrates.

Load-bearing premise

The Functional Proximity Law and chosen centrality metrics define functional load-bearing organization in a domain-independent way that matches expert descriptions without circular use of the same topological features.

What would settle it

A new substrate or pre-registered test in which hub persistence and rank divergence under the Functional Proximity Law show no correlation with independent expert identification of logical structures.

read the original abstract

We ask whether dependency topology correlates with functional load-bearing organization as recoverable geometry -- not as a metaphor, but as a measurable structural property detectable by multilayer network analysis. Across seven independent substrates, we show that hub persistence and rank divergence under the Functional Proximity Law recover operational organization that domain experts describe as logic: axiomatic load-bearing structure in formal mathematics, control and contract structure in legacy software, conserved hub grammar across approx. 600 million years of neural evolution, catalytic role organization in a published prebiotic autocatalytic network, carry-path dominance in a 4-bit digital circuit, betweenness persistence in the ISCAS85 c432 standard benchmark (n=196), and a directional formal-systems replication in the Coq Corelib (n=17). A key methodological finding: degree-based hub persistence is weak between physical wiring and simulation state-correlation layers (r=0.21 in c432), while betweenness-based persistence is stronger (r=0.77 in the 4-bit ALU post-hoc; r=0.34 in c432). The ISCAS85 pre-registered primary hypothesis was CONFIRMED (degree r=0.426, p=0.002, Spearman r=0.551). The formal-systems claim is supported by two proof-assistant corpora: Lean 4 mathlib4 (CONFIRMED, r=0.777, p=0.004) and Coq Corelib (PARTIAL, direction confirmed, r=0.288, p=0.287, n=17, underpowered). All seven experiments were pre-registered before analysis.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The paper claims that across seven independent substrates (formal math, legacy software, neural evolution, prebiotic autocatalytic networks, digital circuits, ISCAS85 c432 benchmark, and Coq Corelib), multilayer network analysis shows that hub persistence and rank divergence under the Functional Proximity Law recover operational organization that domain experts describe as logic. It reports pre-registered quantitative results including confirmed hypotheses (degree r=0.426, p=0.002 in c432; r=0.777, p=0.004 in mathlib4), notes stronger betweenness persistence in some cases, and highlights domain-independent structural geometry linking topology to functional load-bearing roles.

Significance. If the central claim holds with independent validation, the work would establish a measurable, domain-independent geometric property in dependency networks that aligns with expert-recognized logic-like organization, bridging network science with formal systems, software engineering, and evolutionary biology. Strengths include the pre-registration of all seven experiments, the multi-substrate design, and explicit reporting of effect sizes and power limitations (e.g., Coq n=17 underpowered). These elements provide a falsifiable framework that could be tested further if circularity concerns are resolved.

major comments (3)
  1. [Abstract] Abstract: The central claim that 'domain experts describe as logic' validates the recovered structures is load-bearing, yet the abstract provides no protocol details on expert elicitation (pre-specification, blinding to topological metrics such as degree vs. betweenness persistence, or separation of functional labels from the centrality patterns whose persistence is measured). Without this, the reported correlations risk being self-referential rather than external confirmation.
  2. [Abstract] Abstract: The Functional Proximity Law is presented as the key construct under which rank divergence recovers logic, but no definition or independence from the outcome metrics (hub persistence, degree/betweenness) is supplied. If the law incorporates or is tuned to the same network properties whose persistence is then reported as evidence, the derivation reduces to a definitional relationship, undermining the claim of domain-independent recovery.
  3. [Abstract] Abstract: The ISCAS85 primary hypothesis is stated as pre-registered and confirmed (degree r=0.426), yet the text also reports a post-hoc r=0.77 in the 4-bit ALU and r=0.34 in c432 for betweenness; if the betweenness analysis was not pre-specified, this selective emphasis on stronger results after the fact weakens the pre-registration protection against post-hoc metric choice.
minor comments (2)
  1. [Abstract] Abstract: The phrase 'approx. 600 million years of neural evolution' lacks a specific citation or substrate reference; adding the exact source would improve traceability.
  2. [Abstract] Abstract: The Coq Corelib result is described as 'PARTIAL' with r=0.288, p=0.287, n=17; explicitly stating the pre-registered power calculation or effect-size threshold would clarify why it is labeled partial rather than inconclusive.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive comments on the abstract and pre-registration. We address each point below with clarifications and proposed revisions to strengthen the manuscript.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The central claim that 'domain experts describe as logic' validates the recovered structures is load-bearing, yet the abstract provides no protocol details on expert elicitation (pre-specification, blinding to topological metrics such as degree vs. betweenness persistence, or separation of functional labels from the centrality patterns whose persistence is measured). Without this, the reported correlations risk being self-referential rather than external confirmation.

    Authors: The functional labels derive from independent, pre-existing domain literature and expert publications for each substrate (e.g., published circuit analyses for ISCAS85, mathematical literature for Lean/Coq), not from new elicitation by the authors. These sources predate our network analysis and are separated from the centrality computations. The abstract is length-constrained, but the full text (Section 3) cites the sources. We will revise the abstract to explicitly state that labels come from independent domain sources and note the absence of author-conducted elicitation or blinding. This addresses the self-referential concern by clarifying the temporal and methodological separation. revision: yes

  2. Referee: [Abstract] Abstract: The Functional Proximity Law is presented as the key construct under which rank divergence recovers logic, but no definition or independence from the outcome metrics (hub persistence, degree/betweenness) is supplied. If the law incorporates or is tuned to the same network properties whose persistence is then reported as evidence, the derivation reduces to a definitional relationship, undermining the claim of domain-independent recovery.

    Authors: The Functional Proximity Law is defined in the introduction as the general principle that functional proximity corresponds to shortest-path distances in the multilayer dependency graph; it is not derived from or tuned to the specific centrality measures (degree or betweenness) whose persistence is later measured. Rank divergence is computed from these distances as an independent test of the law. We will add a concise definition and statement of independence to the revised abstract to prevent any appearance of circularity. revision: yes

  3. Referee: [Abstract] Abstract: The ISCAS85 primary hypothesis is stated as pre-registered and confirmed (degree r=0.426), yet the text also reports a post-hoc r=0.77 in the 4-bit ALU and r=0.34 in c432 for betweenness; if the betweenness analysis was not pre-specified, this selective emphasis on stronger results after the fact weakens the pre-registration protection against post-hoc metric choice.

    Authors: The pre-registered primary hypothesis for ISCAS85 was the degree-based correlation (confirmed at r=0.426, p=0.002). The betweenness results are explicitly labeled as post-hoc exploratory analyses in the manuscript. We will revise the abstract to clearly distinguish the pre-registered primary result from the post-hoc betweenness findings, removing any ambiguity about what was pre-specified. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected; derivation is self-contained.

full rationale

The paper pre-registers all seven experiments and reports quantitative correlations (e.g., degree r=0.426, p=0.002 in c432; r=0.777 in mathlib4) using standard, pre-specified centrality metrics applied to independent substrates. The Functional Proximity Law functions as an applied framework whose outputs are tested against external expert descriptions and pre-registered hypotheses rather than being defined in terms of those outputs. No equations or steps reduce by construction to fitted parameters or self-citations; the central claim retains independent content through cross-substrate replication and falsifiable statistical tests.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claim rests on the validity of the Functional Proximity Law as an independent descriptor of functional organization and on the assumption that expert descriptions of logic constitute an external benchmark rather than a post-hoc label.

axioms (1)
  • domain assumption Multilayer network centrality metrics capture functional load-bearing roles across disparate domains
    Invoked when interpreting hub persistence as recovering logic in mathematics, software, and biology.
invented entities (1)
  • Functional Proximity Law no independent evidence
    purpose: Defines the relationship between topological persistence and recoverable functional organization
    Central construct under which rank divergence is said to recover logic structures; no independent evidence supplied in abstract.

pith-pipeline@v0.9.1-grok · 5827 in / 1474 out tokens · 41825 ms · 2026-06-28T11:46:37.782043+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

9 extracted references · 8 canonical work pages · 1 internal anchor

  1. [1]

    Ivanov, V. (2026). Evidence for a Functional Proximity Law in Multilayer Networks. arXiv:2604.23639 [cs.SI]. Also available via Zenodo: https://doi.org/10.5281/zenodo. 20349791

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.5281/zenodo 2026

  2. [2]

    Varshney, L.R., Chen, B.L., Paniagua, E., Hall, D.H., & Chklovskii, D.B. (2011). Structural properties of theCaenorhabditis elegansneuronal network.PLOS Computational Biology, 7(2), e1001066.https://doi.org/10.1371/journal.pcbi.1001066

    work page doi:10.1371/journal.pcbi.1001066 2011

  3. [3]

    Bhatt, D.L

    Winding, M., Pedigo, B.D., Barnes, C.L., Patsolic, H.G., Park, Y., Kazimiers, T., ... Bhatt, D.L. (2023). The connectome of an insect brain.Science, 379(6636), eadd9330. https://doi.org/10.1126/science.add9330

    work page doi:10.1126/science.add9330 2023

  4. [4]

    The mathlib Community. (2020). The Lean Mathematical Library. InProceedings of CPP 2020(pp. 367–381). ACM.https://doi.org/10.1145/3372885.3373824

    work page doi:10.1145/3372885.3373824 2020

  5. [5]

    de Moura, L., & Ullrich, S. (2021). The Lean 4 theorem prover and programming language. In CADE 2021(pp. 625–635). Springer.https://doi.org/10.1007/978-3-030-79876-5_37

    work page doi:10.1007/978-3-030-79876-5_37 2021

  6. [6]

    Brglez, F., Bryan, D., & Kozminski, K. (1989). Combinational profiles of sequential benchmark circuits. InIEEE International Symposium on Circuits and Systems(pp. 1929–1934).https: //doi.org/10.1109/ISCAS.1989.100747

    work page doi:10.1109/iscas.1989.100747 1989

  7. [7]

    De Domenico, M., Solé-Ribalta, A., Omodei, E., Gómez, S., & Arenas, A. (2015). Ranking in interconnected multilayer networks reveals versatile nodes.Nature Communications, 6, 6868. https://doi.org/10.1038/ncomms7868

    work page doi:10.1038/ncomms7868 2015

  8. [8]

    Kivelä, M., Arenas, A., Barthelemy, M., Gleeson, J.P., Moreno, Y., & Porter, M.A. (2014). Multilayer networks.Journal of Complex Networks, 2(3), 203–271.https://doi.org/10. 1093/comnet/cnu016

    2014

  9. [9]

    Xavier, J.C., Hordijk, W., Kauffman, S., Steel, M., & Martin, W.F. (2020). Autocatalytic chemical networks at the origin of metabolism.Proceedings of the Royal Society B, 287(1922), 20192377.https://doi.org/10.1098/rspb.2019.2377 6 Table 1: Seven-substrate evidence base with exact pre-registered metrics. All experiments pre-registered before analysis. Sub...

    work page doi:10.1098/rspb.2019.2377 2020