Internal Literature Review: The Ultrametric-Language-AI Research Program

A Comprehensive Due Diligence Report for the Nested Semantic Graph Project

Date: 2026-05-22 Version: 0.1 Status: Complete — four-pass due diligence across all accessible repositories

Executive Summary

This document presents the complete internal literature review conducted over four successive passes across the author's research corpus (December 2025 through May 2026). The review identified 35+ archived projects, 12+ published papers (11 with DOIs), 5+ GitHub repositories, and 3 archived 2025 projects — all connected through a single mathematical thread: ultrametric tree geometry as the unifying structure underlying physics, mathematics, cognition, language, and artificial intelligence.

The Nested Semantic Graph (NSG) project enters a mature research landscape where its conceptual foundation — that language is structured as nested ultrametric trees — has already been published ("Few Become One," 2026-05-22, DOI: 10.5281/zenodo.20328374). The NSG's specific contribution is the computational search architecture: formal specifications, algorithms, and Python prototypes for sub-graph matching, ultrametric ranking, and cross-linguistic semantic retrieval — the engineering layer that bridges the linguistic argument with the Q-PNA neural implementation.

1. Methodology

1.1 Search Strategy

Due diligence was conducted in four passes of increasing depth:

Pass	Scope	Key Discovery
Pass 1	`Obsidian\releases\`, `projects\_shared\`	Ultrametric physics corpus (2026-02 through 2026-05)
Pass 2	`Archive\projects\2025\`	PILE OF BABEL, Semantic Observatory, Grammar of Interaction, SHEAF
Pass 3	`Obsidian\releases\2026\05\` (full directory listing)	2026-05 publication cluster: 12+ papers including Few Become One, Q-PNA, Language-Info-Architecture
Pass 4	`Archive\projects\2026\04\`, `Obsidian\notes\`, targeted keyword searches	Foundational projects: Syntactic Token Calculus, Ultrametric Cognition, Verb Lexicon, ultrametric-ai-poc, PANN

1.2 Sources Searched

Source	Path	Type
Published releases	`G:\My Drive\Obsidian\releases\`	Finalized papers with DOIs
Active projects	`G:\My Drive\projects\`	Work in progress
Cross-project learnings	`G:\My Drive\projects\_shared\CROSS-PROJECT-LEARNINGS.md`	Shared lessons
Archive — projects	`G:\My Drive\Archive\projects\`	Past project directories (2025, 2026)
Archive — Obsidian	`G:\My Drive\Archive\Obsidian\`	Archived releases
Archive — notes	`G:\My Drive\Obsidian\notes\`	Research notes
QWAV strategy	`G:\My Drive\QWAV\`	Strategy documents
GitHub (external)	`github.com/rwnq8/`, `github.com/QNFO/`	Public code repositories

1.3 Search Terms

Keywords searched across all sources: ultrametric, semantic, graph, tree, p-adic, neural, PANN, Q-PNA, token, calculus, cognition, chunking, verb, lexicon, laws of form, cophenetic, polysynthetic, morpheme, linguistic, language, distinction, cocycle, cross-ratio, Bruhat-Tits.

2. The Complete Development Arc: A Timeline

2.1 December 2025 — The Seed

Item	Location	Significance
PANN concept (P-Adic Neural Networks)	`Obsidian\notes\v1\2025\12\24\_25358055542.md`	Earliest conceptualization of intrinsically interpretable AI using prime-number topology. References Mezić (2013) and Morishita (2012). "Its decision is the resonance." Evolved into Q-PNA.

2.2 April 2026 — Foundation Building

This was the pivotal month where the mathematical, cognitive, and computational foundations were laid. All projects below are archived at G:\My Drive\Archive\projects\2026\04\.

Project	Files	Core Contribution
Syntactic Token Calculus (v1→v3)	7 files + PDF	Mark (□), Void (ε), three reduction rules (Calling, Crossing, Void), cross-ratio as invariant, particles as stable normal forms, gravity as cocycle condition
Quantum Laws of Form	—	Spencer-Brown's Laws of Form applied to quantum mechanics. GitHub: `rwnq8/quantum-laws-of-form`
Ultrametric Cognition	70+ files incl. Python	Cognitive state space as Bruhat-Tits tree T_p. Cocycle coherence (δω=0), Page-Wootters time, Monna projection. 70+ files with simulations
Verb Lexicon	7 files	Dictionary of process-verbs vs. static-nouns. "The patterns we mistake for people." GitHub: `rwnq8/verb-lexicon`
ultrametric-ai-poc	12 files (Streamlit app)	Working web app: ultrametric attention, distinction calculus, cocycle verification, particle zoo. Token encoding via WordNet → prime products → p-adic valuations
Proof-of-Concept for Auditable Attention	—	Using ultrametric tree distances for explainable AI attention
Projective Geometric Frameworks for Semantic Structures	—	Semantic structures through projective geometry
Computational Syntax of Reality	—	Formal bridge: syntactic token calculus ↔ physical ultrametric structures
Syntactic Generation Primitive Distinctions	—	Primitive distinctions as syntactic generators
Monna Map Generation and Hallucination	—	Monna projection and its relationship to hallucination
Non-Archimedean Syntactic Paradigm for Physics	—	Non-Archimedean foundations for physics
Automated Formal Verification and Combinatorial Reduction	—	Formal verification of distinction-based calculus
Ultrametric Intelligence	—	Related AI framework
cocycle	—	Cocycle project

2.3 May 2026 — Rapid Publication Sequence

All papers below are published at G:\My Drive\Obsidian\releases\2026\05\ with DOIs unless noted.

Date	Paper	DOI	Category
May 6	TREE OF FREQUENCIES	`10.5281/zenodo.20049051`	Physics — frequency as universal coordinate, tree as fundamental geometry
May 6	How Geometry Creates Memory	`10.5281/zenodo.20061155`	Physics — Threshold Principle, ultrametric containment, Monna projection
May 8	Symmetry as a Grammatical Function	`10.5281/zenodo.20089746`	Math/Physics — all symmetry emerges from distinctions + ruler + closure
May 12	Language as Information Architecture	`10.5281/zenodo.20137616`	Linguistics — entropy gradient, mutual exclusion, 22 languages
May 12	Validation of Ultrametric Error Confinement	`10.5281/zenodo.20134944`	Physics/CS — zero logical errors at depth 7, 36,000 trials
May 15	Tree Distance Cophenetic	`10.5281/zenodo.20213043`	Math — cophenetic distance proof, 7 objections addressed
May 18	Ultrametric Geometry as Common Structure	`10.5281/zenodo.20265907`	Synthesis — 5-domain cross-domain analysis
May 19	Q-PNA Research Specification v2.0	`10.5281/zenodo.20287742`	AI — full neural architecture: p-adic encoding, ultrametric attention, token calculus
May 20	Convergence, Consilience	`10.5281/zenodo.20302276`	Meta — convergence/consilience as hierarchical signatures
May 21	The Tree Is Real	`10.5281/zenodo.20325850`	Validation — 649 triples, all ultrametric; agent-based simulation
May 21	The Tree at the Bottom of Thought	`10.5281/zenodo.20329583`	Synthesis — ultrametric branching from physics to cognition to language
May 22	Few Become One: Polysynthetic Communication and the Ultrametric Architecture of Language	`10.5281/zenodo.20328374`	Linguistics/CS — core conceptual paper for the NSG project

Additional 2026-05 releases without DOIs or in earlier stages: Hierarchical Universe, Two Ways of Measuring, Road Not Taken, Every Point is the Center of its Own Universe, Tree at the Bottom of Everything, A Different Geometry for Computing, Fractal Harmonic Trees, When Proofs Deceive, Force-Multiplier Playbook, Statistical Genesis of Appearance, Can Math Prove Physics, Arithmetic Gauge.

2.4 May 2026 — Parallel Archived Projects

Project	Archive Location	Status
polysynthetic-communication	`Archive\projects\2026\05\`	Archive version of "Few Become One"
Language-Info-Architecture	`Archive\projects\2026\05\`	Archive version
Q-PNA Research Specification v2.0	`Archive\projects\2026\05\`	Full project with 7-doc structure
ultrametric-trees-and-branching-in-physics	`Archive\projects\2026\05\`	Physics synthesis
Computational-Ultrametricity	`Archive\projects\2026\05\`	Computational validation project
ultrametric-game-of-life	`Archive\projects\2026\05\`	Game of Life on ultrametric trees

3. Mathematical Foundations

3.1 The Syntactic Token Calculus (STC)

Archive: Archive\projects\2026\04\Syntactic Token Calculus\ (v1→v3, 7 files + PDF) Published as: Syntactic Token Calculus report and PDF

The STC is the mathematical bedrock of the entire research program. It proposes that reality is not made of particles, fields, or spacetime, but of a single primitive operation — the distinction — and its syntactic consequences.

Core Primitives

Mark ($\square$): the elementary distinction, the act of drawing a boundary
Void ($\varepsilon$): the absence of distinction, the unmarked state, the identity element

Syntactic Operations

Juxtaposition: writing tokens side by side ($E_1 E_2$)
Enclosure: surrounding an expression with a boundary ($\lceil E \rfloor$)

Three Reduction Rules

Calling: $\square\square \to \square$ (two marks reduce to one)
Crossing: $\lceil \lceil E \rfloor \rfloor \to E$ (double enclosure cancels)
Void: $\varepsilon E \to E$ (void is identity)

Key Theorems

Confluence: The system is confluent — reduction order doesn't matter
Cross-ratio invariance: The only invariant is the cross-ratio, a purely syntactic construction requiring no numbers, coordinates, or background geometry
Particles = stable normal forms: irreducible expressions under the reduction rules
Masses = cross-ratios of particle tokens with reference scales
Gauge forces = automorphisms of the token web that preserve cross-ratios
Gravity = global cocycle condition: the graviton token cancels to the void
Time and space = epistemic projections of a finite, self-referential observer

Relevance to NSG

The STC provides the formal verification substrate for operations on semantic trees. The distinction calculus IS the syntactic token calculus for verifying tree operations. The cross-ratio as invariant maps directly to the entropy invariance principle in Few Become One.

3.2 Quantum Laws of Form

Archive: Archive\projects\2026\04\Quantum Laws of Form\ GitHub: github.com/rwnq8/quantum-laws-of-form

Spencer-Brown's Laws of Form (1969) applied to quantum mechanics. Extends the STC into the quantum domain, showing how quantum behavior emerges from distinction-based computation.

3.3 Tree Distance Cophenetic (May 15)

DOI: 10.5281/zenodo.20213043

Provides the formal mathematical proof that cophenetic distance $d(x,y) = h(\text{lca}(x,y))$ satisfies the ultrametric inequality $d(x,z) \leq \max(d(x,y), d(y,z))$ and derives triadic rigidity as a necessary consequence. Addresses 7 objections. This is the mathematical foundation for ultrametric distance computation in the NSG.

4. Physics: The Tree as Fundamental Geometry

4.1 TREE OF FREQUENCIES (May 6)

DOI: 10.5281/zenodo.20049051

Frequency as the universal coordinate of scale. From Einstein's $E=mc^2$ and Planck's $E=h\nu$, derives the Compton frequency $f = mc^2/h$. Shows that frequencies organize into a multiplicative hierarchy: bands at $[f_0 q^k, f_0 q^{k+1})$. The tree emerges naturally when frequencies are expressed in base $q$ — each digit picks a sub-band, producing a branching structure. The tree is not a metaphor but a precise mathematical structure.

Relevance to NSG: The frequency tree IS a nested semantic graph — each leaf is a frequency, each internal node is a branching point. The same ultrametric structure that organizes physical frequencies organizes semantic concepts.

4.2 How Geometry Creates Memory (May 6)

DOI: 10.5281/zenodo.20061155

The Threshold Principle: a single design choice — how we measure distance — determines whether a geometry creates fuzzy neighborhoods or sealed containers. The Archimedean ruler (additive distance) produces continuous space where small perturbations accumulate. The ultrametric ruler (maximum-bounded distance) produces a hierarchical tree where perturbations below a threshold are geometrically contained.

Key concepts:

Threshold Principle: For any state $s$ in an ultrametric tree with threshold $\tau$, perturbations smaller than $\tau(d)$ remain confined within the same ultrametric ball
Monna Projection: A continuous surjection $\Phi: \mathbb{Z}_p \to [0,1]$ that scrambles deterministic tree processes into apparent randomness when measured with Archimedean tools
Balls become containers: In ultrametric space, open balls of radius $r$ have a hard boundary — the interior-exterior gap is at least $r$

Relevance to NSG: The Threshold Principle provides the geometric guarantee that semantic queries matching at a certain tree depth will not be perturbed by surface-level variations — the same principle that provides fault tolerance in quantum computing.

4.3 Symmetry as a Grammatical Function (May 8)

DOI: 10.5281/zenodo.20089746

All continuous symmetry structures in mathematics and physics emerge from a single grammatical function: distinctions, arranged, under a ruler, forced to close by the requirement of internal consistency. Synthesizes Lie theory, quantum field theory anomaly cancellation, number theory, the Langlands program, and particle physics.

Relevance to NSG: Establishes that "grammar" — the rules governing how distinctions combine — is the deep structure underlying both mathematical symmetry and linguistic structure. The grammar-geometry connection is the bridge between the physics and linguistics branches.

4.4 Validation of Ultrametric Error Confinement (May 12)

DOI: 10.5281/zenodo.20134944 GitHub: github.com/QNFO/ultrametric-error-confinement

Computational validation: tree-encoded quantum circuits produced zero observed logical errors in 500 trials at depths $d \geq 3$ for physical error rates up to $p_{\text{err}} = 0.40$, while equivalent flat (Archimedean) encodings failed with logical error rates up to 0.152. The energy barrier protecting logical states scales as $E_{\text{barrier}}(d) = 2^d$.

Relevance to NSG: Demonstrates that ultrametric encoding provides passive fault tolerance — error suppression as a property of geometry rather than active correction. The same geometric confinement that protects quantum states protects semantic search precision.

4.5 Bruhat-Tits Tree as a Unifying Geometric Object (May)

DOI: available at Obsidian\releases\2026\05\

Most recent synthesis positioning the Bruhat-Tits tree as the universal geometric substrate across physics, mathematics, and computation.

4.6 Earlier Ultrametric Physics (February–April 2026)

Paper	Date	Key Concept
Spectral Dynamics on Bruhat-Tits Trees	Feb	Tree-based spectral analysis
Ballistic Transport on the Bruhat-Tits Tree	Feb	Dynamics on tree structures
Ultrametric Relaxation Dynamics in Topological Quantum Memory	Feb	Ultrametric distance on hierarchical state spaces
Ultrametric Quantum Computation	Apr	Ultrametricity as organizing principle for quantum computing
Ultrametric Quantum Gravity and Computation	Apr	Extension to quantum gravity
Ultrametric Physics from Discrete Hierarchical Geometry	Apr	Comprehensive treatment of ultrametric spacetime
Computational Toolkit for p-Adic Spacetime	Apr	Tools for p-adic computation

All available at G:\My Drive\Obsidian\releases\2026\02\ through 2026\04\.

5. AI / Neural Architecture

5.1 PANN — P-Adic Neural Networks (December 2025)

Location: Obsidian\notes\v1\2025\12\24\_25358055542.md

The earliest conceptualization of intrinsically interpretable AI using prime-number topology. Key passage:

"PANN, by contrast, is 'intrinsically interpretable.' Its decision is the resonance. There is no hidden layer of logic. If the system outputs 'Prime 5,' it is because it has physically configured itself into the topology of the number 5."

References Mezić (2013) and Morishita (2012) as mathematical translation manuals between dynamics, topology, and arithmetic. This concept evolved into Q-PNA.

5.2 Q-PNA Research Specification v2.0 (May 19)

DOI: 10.5281/zenodo.20287742 GitHub: github.com/QNFO/Q-PNA Archive: Archive\projects\2026\05\Q-PNA Research Specification v2.0\ (full 7-doc project)

The Q-PNA is a neural network architecture that replaces the continuous embedding spaces of standard deep learning with ultrametric geometry on Bruhat-Tits trees. It provides glass-box AI decisions with formal verifiability via syntactic token calculus and ultrametric attention.

Architecture Components

Component	Description
p-adic Valuation Encoding	Token → semantic primes → integer product $P(t) = \prod p_i^{f_i(t)}$ → valuation vector $\vec{v}(t) = (v_{p_1}(P(t)), \ldots, v_{p_k}(P(t)))$
Ultrametric Attention	Attention weights computed from tree distances with ZERO learned parameters. Similarity = $\exp(-d/\tau)$ normalized row-wise
Tree-Walk Optimization	Discrete analog of backpropagation — optimization through tree navigation rather than gradient descent
Syntactic Token Calculus	Formal verification of every decision — every token path is a normal form of some distinction expression

The Gauge Problem in Continuous AI

Q-PNA identifies a fundamental limitation of Archimedean (continuous) AI: embeddings in $\mathbb{R}^d$ are gauge-dependent — if $\phi$ is any diffeomorphism, $\phi(v)$ preserves all relational structure but the network treats it differently. This leads to adversarial fragility, opaque decisions, and poor analogical reasoning. Ultrametric spaces eliminate gauge dependence: the tree structure is invariant under isometries.

Relevance to NSG

The NSG's sub-graph matching search is the retrieval layer that complements Q-PNA's encoding layer:

Q-PNA encodes: text → valuation vectors → leaf activations on Bruhat-Tits tree
NSG matches: query graph → subgraph in document corpus → ultrametric ranking
Together: full pipeline from raw text to ranked semantic search results

5.3 ultrametric-ai-poc (April 2026)

Archive: Archive\projects\2026\04\ultrametric-ai-poc\ GitHub: github.com/rwnq8/ultrametric-ai-poc Status: Working Streamlit web application

A proof-of-concept demonstrating four modules:

Ultrametric Attention — attention weights from p-adic valuation distances with traceable LCA paths
Distinction Calculus — Spencer-Brown primitives applied to attention
Cocycle Auditor — verifies strong triangle inequality across token sets
Particle Zoo — stable syntactic patterns mapped to Standard Model particles

Architecture:

ultrametric-ai-poc/
├── app.py                    # Streamlit web application (4 modes)
├── model.py                  # Attention models (ultrametric + distinction)
├── distinction_calculus.py   # Spencer-Brown primitives + tree operations
├── cocycle.py                # Cocycle verification + valuation utils
├── requirements.txt          # Python dependencies
└── README.md

Token Encoding Pipeline:

Each word assigned semantic primes (good, bad, not, very, but) via WordNet hypernyms
Prime product encodes the word as integer: $P = \prod p_i^{f_i}$
p-adic valuations form a vector: $\vec{v} = (v_{p_1}(P), v_{p_2}(P), \ldots)$
Ultrametric distance: $d(a,b) = \max|v_p(a) - v_p(b)|$

Relevance to NSG: This is the working codebase that the NSG project can build on. The token encoding pipeline is the parser front-end; the NSG adds the search/retrieval back-end.

5.4 Proof-of-Concept for Auditable Attention (April 2026)

Archive: Archive\projects\2026\04\

Demonstrates that ultrametric tree distances enable fully auditable attention — every weight has a traceable path through the tree. This is the explainability argument that applies equally to semantic search: every match has a verifiable "why."

6. Linguistics

6.1 Language as Information Architecture (May 12)

DOI: 10.5281/zenodo.20137616 GitHub: github.com/rwnq8/language-info-architecture Archive: Archive\projects\2026\05\Language-Info-Architecture\

A cross-linguistic Bayesian pipeline analyzing 22 typologically diverse languages, treating language as an information channel with different mandatory metadata requirements.

Key Findings

Finding	Detail
Entropy gradient	Isolating: ~6.48 bits/word → Polysynthetic: ~6.80 bits/word. Reverses under per-morpheme normalization
Compression-tax trade-off	Languages with richer morphology impose lower mandatory category loads ($r = -0.48$)
Mutual exclusion principle	Of 28 pairwise domain combinations, 10 are empty — no language obligatorily marks categories from multiple mandatory information clusters simultaneously ($p < 0.0001$)
Four mandatory clusters	Reference-tracking, source-tracking, categorical-judgment, spatial-coordinate — mutually exclusive strategies for allocating a finite mandatory information budget

Relevance to NSG

The entropy invariance under recoding is the quantitative foundation for the NSG's language-neutrality claim. If propositional content (in bits) is preserved across recoding, then indexing the invariant structure (the semantic tree) rather than surface projections (words) enables genuinely cross-linguistic search. The mutual exclusion principle constrains the design space of the semantic graph: certain concept clusters will never co-occur as mandatory nodes.

6.2 Few Become One: Polysynthetic Communication and the Ultrametric Architecture of Language (May 22)

DOI: 10.5281/zenodo.20328374 Archive: Archive\projects\2026\05\polysynthetic-communication\ Status: Published — the core conceptual paper for the NSG project

Structure

Section	Content
I. The English-Centric Blind Spot	Diagnoses the illusion of language neutrality in digital infrastructure. English's isolating structure — where meaning lives in discrete, separable words — is assumed universal by search engines, databases, and LLMs
II. What Is Polysynthetic Communication?	Defines polysynthesis. Mohawk examples: Wakatonhkariá:ton ("I have finished eating") — one word = English clause. Morphological type spectrum: Isolating → Agglutinative → Fusional → Polysynthetic
III. Polysynthetic Written Communication	Explores writing systems, the "word" as non-universal convention, syllabic vs. Latin scripts, concept of morphographic writing
IV. The Digital Divide	Tokenization impedance mismatch, keyword search vs. morphemic search failure, LLM training data bias (~46% English), information deserts affecting 10-20 million polysynthetic speakers
V. Toward Integration: A Cross-Linguistic "Chunking" Framework	The constructive proposal. Sections V.A through V.E lay out the nested semantic graph architecture
VI. Broader Implications	Polysynthesis as mirror of thought, designing for linguistic pluralism, spoken interfaces, visual query builders, document as navigable tree
VII. Summary of the Synthesis	Restates the five-point argument

Section V — The Nested Semantic Graph Proposal (Detailed)

V.A — Recursive Nesting as Universal Cognitive Base The fundamental cognitive operation underlying all language is recursive chunking — the binding of many into one. What differs across languages is the level at which it is applied:

Chunking Level	Type	Surface Consequence
Phrase/sentence	Isolating	Many tokens per proposition
Word	Agglutinative	Fewer tokens, each internally structured
Word-sentence	Polysynthetic	One token = one complete event

V.B — A Common Representation: The Nested Semantic Graph The proposal: represent text as a tree of nested concepts rather than a flat sequence of tokens:

Nodes = conceptual primitives (entity, action, temporal frame, evidential source, logical relation)
Edges = scope and modification relationships
The tree is ultrametric: $d(x,z) \leq \max{d(x,y), d(y,z)}$
Language-neutral: English, Mohawk, Turkish all map to the SAME graph; differ only in linearization

V.C — Building Search and AI on Nested Graphs, Not Strings

Sub-graph matching search: query parsed into semantic graph, matched against document graph corpus
Requirements: (1) cross-linguistic semantic parsing, (2) ultrametric distance on graphs, (3) morphemic tokenization
Key insight: "These three requirements are not separate projects. They are aspects of a single architecture."

V.D — Formalizing the Syntax-Tree Isomorphism Ultrametric distance $d(x,y) = h(\text{lca}(x,y))$ in Syntactic Token Calculus (Modules M5, M11). Polysynthetic words: all morphemes share a shallow common ancestor — the entire word-sentence is a single ultrametric cluster. Isolating sentences: words in different phrases have higher LCA. Both are valid ultrametric trees; differ in branching factor and depth.

V.E — The Entropy Invariance Principle Shannon entropy is invariant under recoding (like the geometric cross-ratio). The English sentence and Mohawk word-sentence have different entropy per word but same total propositional information. Design principle: index the invariant structure, not the surface projection.

6.3 Verb Lexicon (April 2026)

Archive: Archive\projects\2026\04\Verb Lexicon\ GitHub: github.com/rwnq8/verb-lexicon

A dictionary of process-verbs rather than static-nouns. Core thesis: "English is a noun-heavy language... Because we lack the verbs to describe fluid, relational processes, we panic and invent nouns instead." Each entry describes a motion or pattern rather than an identity.

Relevance to NSG: The Verb Lexicon provides the conceptual vocabulary for semantic graph nodes that describe actions/processes rather than static entities. It treats language as encoding dynamics rather than states — directly aligned with the NSG's event-centered graph structure where the action node is the root.

7. Cognition

7.1 Ultrametric Cognition (April 2026)

Archive: Archive\projects\2026\04\Ultrametric Cognition\ (70+ files incl. Python simulations)

Constructs the cognitive state space as a Bruhat-Tits tree $\mathcal{T}_p$ over $\mathbb{Q}_p$, where:

Global consistency = $1$-cocycle condition $\delta\omega = 0$
Temporal sequence = Page-Wootters conditioning on biological oscillator phases
Phenomenological continuity = Monna map $\Phi: \mathbb{Z}_p \to [0,1]$

Derives four formal signatures: power-law reaction times, isosceles triplet geometries, clock-sequence dissociation, and projection uniformity.

Key Concepts

Concept	Formal Expression
Cognitive state space	$V(\mathcal{T}_p)$ — vertices of Bruhat-Tits tree
State	Distribution $\rho: V(\mathcal{T}_p) \to [0,1]$
Sensory boundary	$\partial\mathcal{T}_p \cong \mathbb{P}^1(\mathbb{Q}_p)$
Cocycle coherence	$\omega_{ij}: U_i \cap U_j \to \mathbb{R}$, $\delta\omega = 0$
Triadic rigidity	For $d_{ab} \leq d_{bc} \leq d_{ca}$, necessarily $d_{bc} = d_{ca}$

Relevance to NSG: The recursive chunking operation — "few become one" — is identified as a cognitive primitive. A polysynthetic word-sentence IS this operation externalized in language. The Ultrametric Cognition framework provides the cognitive science grounding for the claim that nested semantic trees are not merely a convenient representation but reflect the actual architecture of human thought.

8. Synthesis & Meta-Analysis

8.1 Ultrametric Geometry as Common Structure (May 18)

DOI: 10.5281/zenodo.20265907

Cross-domain synthesis across 5 domains: quantum error correction (L1-L2), spin glasses (L3), protein folding (L4), cosmology (L5), and cognition (L5). Organized around 5 integration points: triadic rigidity, resolution-dependence, bounded consilience (L1-L5 taxonomy), noun/verb distinction (ontic invariants vs. epistemic conventions), and ultrametric inequality as mathematical engine.

8.2 Convergence, Consilience, and the Hierarchical Architecture of Reality (May 20)

DOI: 10.5281/zenodo.20302276

Meta-analysis arguing that convergence (nature independently producing similar forms) and consilience (knowledge converging on same truths) are symmetric faces of a single deeper structure: a hierarchically organized reality shaped by attractors in possibility space. Examines 5 interdisciplinary physics cases. Addresses superdeterminism's epistemological challenge.

8.3 The Tree Is Real — Computational Validation (May 21)

DOI: 10.5281/zenodo.20325850

Eight-module computational pipeline:

Real-world taxonomies (biology, linguistics, physics): 649 triples, ALL ultrametric
Agent-based simulations on random ultrametric trees: convergence probability = 1
Renormalization group as canonical ultrametric flow: 32 distinct theories → single fixed point
Consilience simulation: bridge discovery requires shared conceptual vocabulary

8.4 The Tree at the Bottom of Thought (May 21)

DOI: 10.5281/zenodo.20329583

Synthesis essay tracing ultrametric branching from formal definition → physical manifestations (spin glasses, QCD, phylogenetics) → Bruhat-Tits geometry → Laws of Form distinction calculus → cognitive primitives (subitizing, chunking) → cross-linguistic essence. Argues the strong triangle condition is "the signature of hierarchical branching, appearing wherever things nest inside things."

9. Archived Projects (2025)

9.1 PILE OF BABEL (October 2025)

Archive: Archive\projects\2025\10\PILE OF BABEL\ (90+ files) Published: Obsidian\releases\2025\10\Pile of Babel.md (DOI available)

Title: "A Crisis of Conceptual Obscurantism and Rosetta Stone for Deciphering Physics, Deriving Reality from the Simple Arithmetic of the Circle."

Core thesis: Scientific language has become a "Tower of Babel" — incomprehensible jargon that obscures simple underlying concepts. The solution is a "Rosetta Stone Protocol" that deconstructs physics terminology into universal primitives (circle, integer, rotation, projection).

Architecture

Physics jargon → Circle/Integer primitives → Understanding

Key Concepts

Concept	Description
Terminology Crosswalk (0.1.1)	Table mapping equivalent concepts across domains: Hamiltonian = Rotation Generator, Hilbert Space = Map of Possibilities, Wavefunction = Pattern's Address
Crosswalk Mandate (0.0.5)	"Actively seek to identify and unify underlying concepts, even if they are presented with different terminology across domains"
Rosetta Stone Protocol (§2)	Systematic deconstruction: Deconstructing Dynamics (§2.1), Deconstructing State (§2.2), Deconstructing Spacetime (§2.3)
Universal Pattern Language (§3)	Foundational primitives: Circle ($S^1$), Integer ($\mathbb{Z}$). Core operations: Rotation as universal evolution, Projection as phenomenological emergence
Conceptual Compression Failure (§1.2)	Map-territory inversion, atrophy of geometric intuition
New Scholasticism (§1)	Terminological inflation as epistemic barrier, institutional moat, illusion of rigor

Direct Architectural Connection to NSG

PILE OF BABEL and NSG share the EXACT same "Rosetta Stone" architecture — a common representation beneath diverse surface forms:

PILE OF BABEL	NSG
Physics jargon → Circle/Integer primitives	Natural languages → Nested Semantic Graph
"Terminology Crosswalk" mapping equivalent concepts	Cross-linguistic semantic mapping
"Crosswalk Mandate" as operating principle	Crosswalk Mandate as design principle
Scientific discourse (terminology inflation)	Natural language (morphological diversity)

Key difference: PILE OF BABEL addresses scientific discourse (jargon within physics). NSG addresses natural language (morphology across human languages). Both are instances of the same Rosetta Stone architecture at different levels.

9.2 Semantic Observatory (September 2025)

Archive: Archive\projects\2025\09\Semantic Observatory\ (1 file)

Proposes a "Semantic Observatory Stack" (SOS) with 5 layers:

Substrate — Physical/computational base (GPU/TPU cluster in prototype)
Embedding — Constraint Field Compiler (CFC): ingests heterogeneous data into state vector $\mathbf{x}0$ and potential $\Phi{\text{CF}}(\mathbf{x})$
Evolution — Langevin dynamics solver: $d\mathbf{x}/dt = -\nabla\Phi_{\text{CF}}(\mathbf{x}) + \eta(t)$
Interrogation — Topological Analysis Toolkit (TAT): persistent homology, Fragility Index, Betti numbers
Navigation — VR interface rendering topological data as navigable landscape

Relevance to NSG: The 5-layer stack architecture is structurally analogous to the NSG's parsing pipeline. The "semantic field" concept ($\Phi$) and constraint potential formalism could provide mathematical tools for defining ultrametric distance on graph spaces.

9.3 Grammar of Interaction (September 2025)

Archive: Archive\projects\2025\09\Grammar of Interaction\ (2 files)

Formalizes a "grammar of interaction" for a relational model of physics using directed acyclic hypergraphs. Key components:

Vertices ($V$) = interaction events (specific instances of interaction operator $\hat{H}$)
Hyperedges ($E$) = quantum systems, representing causal histories
Production Rules = rules for growing the circuit graph

The Relational Quantum Circuit (RQC) formalism is structurally analogous to the NSG's node/edge/parsing architecture but applied to physics rather than linguistics.

9.4 SHEAF (October 2025)

Archive: Archive\projects\2025\10\SHEAF\ (8 files + screenshots)

Mathematical sheaf theory applied to unifying physics across scales. Uses derived categories, $\infty$-categories, and motivic formulations to establish equivalences between physical theories and sheaf structures. The most abstract version of the "common representation beneath diverse surface forms" pattern.

10. GitHub Repositories

Repository	Purpose	Status
`github.com/rwnq8/ultrametric-ai-poc`	Working Streamlit app: ultrametric attention, distinction calculus, cocycle verification	Active
`github.com/rwnq8/language-info-architecture`	Cross-linguistic Bayesian pipeline for Language-Info-Architecture paper	Active
`github.com/rwnq8/quantum-laws-of-form`	Distinction calculus implementation for quantum mechanics	Active
`github.com/rwnq8/verb-lexicon`	Verb lexicon for semantic parsing — dictionary of process verbs	Active
`github.com/QNFO/Q-PNA`	Q-PNA neural architecture specification and implementation	Active
`github.com/QNFO/ultrametric-error-confinement`	Ultrametric error confinement validation suite	Active

11. The Connection Map

11.1 The Architecture Stack (Complete)

┌──────────────────────────────────────────────────────────────┐
│  NESTED SEMANTIC GRAPH (THIS PROJECT)                         │
│  Search & Retrieval Architecture                              │
│  • Sub-graph matching via ultrametric tree alignment          │
│  • Ranking via ultrametric graph distance                     │
│  • Query parsing: surface language → semantic graph           │
│  • Python prototypes: parser, matcher, ranking engine          │
├──────────────────────────────────────────────────────────────┤
│  Q-PNA (DOI: 10.5281/zenodo.20287742)                        │
│  Neural Architecture — Encoding & Representation              │
│  • p-adic valuation encoding: token → prime product → vector │
│  • Ultrametric attention: 0 learned parameters               │
│  • Tree-walk optimization: discrete backpropagation           │
│  • Syntactic token calculus: formal verification              │
├──────────────────────────────────────────────────────────────┤
│  FEW BECOME ONE (DOI: 10.5281/zenodo.20328374)               │
│  Linguistic Argument — Why This Architecture                  │
│  • Polysynthetic challenge to English-centric infrastructure  │
│  • Recursive chunking as universal cognitive operation        │
│  • Nested semantic graph proposal (Section V)                 │
│  • Entropy Invariance Principle for cross-linguistic search   │
├──────────────────────────────────────────────────────────────┤
│  FOUNDATIONS (April-May 2026, all published)                  │
│  ┌─────────────────────────────────────────────────────────┐ │
│  │ Syntactic Token Calculus    Ultrametric Cognition       │ │
│  │ (Mark/Void, cross-ratio,    (Bruhat-Tits tree as        │ │
│  │  particles as normal forms)  cognitive state space)      │ │
│  ├─────────────────────────────────────────────────────────┤ │
│  │ Language-Info-Architecture  Tree Distance Cophenetic    │ │
│  │ (entropy gradient, mutual    (cophenetic distance =      │ │
│  │  exclusion, 22 languages)    ultrametric, 7 objections)  │ │
│  ├─────────────────────────────────────────────────────────┤ │
│  │ How Geometry Creates Memory  TREE OF FREQUENCIES        │ │
│  │ (Threshold Principle, Monna  (frequency as universal     │ │
│  │  projection, containers)     coordinate, tree geometry)  │ │
│  ├─────────────────────────────────────────────────────────┤ │
│  │ Quantum Laws of Form         Verb Lexicon               │ │
│  │ (distinction calculus for    (process-verbs, patterns    │ │
│  │  quantum mechanics)          vs. identities)             │ │
│  └─────────────────────────────────────────────────────────┘ │
├──────────────────────────────────────────────────────────────┤
│  SYNTHESIS & META-ANALYSIS (May 2026)                         │
│  • Ultrametric Geometry as Common Structure (5-domain)        │
│  • Convergence, Consilience (meta-analysis)                   │
│  • The Tree Is Real (computational validation, 649 triples)   │
│  • The Tree at the Bottom of Thought (synthesis essay)        │
├──────────────────────────────────────────────────────────────┤
│  HISTORICAL PRECEDENTS (2025)                                 │
│  • PILE OF BABEL (Rosetta Stone architecture)                 │
│  • Semantic Observatory (5-layer stack)                       │
│  • Grammar of Interaction (graph formalism)                   │
└──────────────────────────────────────────────────────────────┘

11.2 The Mathematical Thread

All projects converge on a single mathematical object — the ultrametric tree — with the strong triangle condition $d(x,z) \leq \max{d(x,y), d(y,z)}$ and its consequence, triadic rigidity (for any three points, the two largest distances are equal).

Domain	How the Tree Appears
Math	Cophenetic distance on rooted trees (Tree Cophenetic), Bruhat-Tits trees over $\mathbb{Q}_p$, cross-ratio invariance (STC)
Physics	Frequency hierarchy (TREE OF FREQUENCIES), spin glass energy landscapes, QCD parton showers, renormalization group flow, quantum error correction (Error Confinement)
Biology	Phylogenetic trees (The Tree Is Real)
Cognition	Cognitive state space as $\mathcal{T}_p$, recursive chunking (Ultrametric Cognition)
Language	Morphological trees, dependency trees, semantic scope hierarchies (Few Become One, Language-Info-Architecture)
AI	p-adic valuation encoding, ultrametric attention, distinction calculus (Q-PNA, ultrametric-ai-poc)

11.3 Dependency Graph

PILE OF BABEL (2025-10)
    └── Rosetta Stone architecture
         └── "Common representation beneath diverse surface forms"
              │
              ├── Syntactic Token Calculus (2026-04)
              │   ├── Quantum Laws of Form (2026-04)
              │   ├── Computational Syntax of Reality (2026-04)
              │   └── Q-PNA (2026-05) — token calculus verification layer
              │
              ├── Ultrametric Cognition (2026-04)
              │   └── Recursive chunking as cognitive primitive
              │        └── Few Become One (2026-05) — chunking in language
              │
              ├── TREE OF FREQUENCIES (2026-05-06)
              │   └── How Geometry Creates Memory (2026-05-06)
              │        ├── Tree Distance Cophenetic (2026-05-15)
              │        │   └── The Tree Is Real (2026-05-21)
              │        └── Validation of Ultrametric Error Confinement (2026-05-12)
              │
              ├── Language-Info-Architecture (2026-05-12)
              │   └── Few Become One (2026-05-22) — entropy invariance
              │
              ├── Symmetry as a Grammatical Function (2026-05-08)
              │   └── Ultrametric Geometry as Common Structure (2026-05-18)
              │        └── Convergence, Consilience (2026-05-20)
              │
              ├── ultrametric-ai-poc (2026-04)
              │   └── Q-PNA (2026-05) — evolved from PoC to full spec
              │
              └── Verb Lexicon (2026-04)
                   └── Few Become One (2026-05) — verb-centered semantics
                        └── NESTED SEMANTIC GRAPH (2026-05) — THIS PROJECT
                             └── Sub-graph matching search architecture

12. Gap Analysis: What the Nested Semantic Graph Project Contributes

12.1 What Has Been Done

Area	Status	Where
Mathematical foundation (ultrametric trees)	COMPLETE	Tree Cophenetic, STC, all physics papers
Cognitive grounding (recursive chunking)	COMPLETE	Ultrametric Cognition
Linguistic argument (polysynthetic challenge)	COMPLETE	Few Become One §I-IV
Conceptual proposal (nested semantic graph)	COMPLETE	Few Become One §V
Entropy invariance principle	COMPLETE	Language-Info-Architecture, Few Become One §V.E
Neural encoding architecture	COMPLETE	Q-PNA v2.0, ultrametric-ai-poc
Working PoC for attention	COMPLETE	ultrametric-ai-poc (Streamlit app)
Validation of ultrametric structure	COMPLETE	The Tree Is Real (649 triples)
Historical precedent	COMPLETE	PILE OF BABEL (2025)

12.2 What Has NOT Been Done — The NSG's Contribution

Gap	Status	NSG Task
Sub-graph matching search specification	NOT DONE	S2, S4 — Formal algorithms for matching query graphs against document graph corpus
Ultrametric graph distance computation	NOT DONE	S1, S4 — Graph-alignment lattice, edit distance generalization preserving strong triangle condition
Ranking mechanism	NOT DONE	S2, S4 — How to rank partial matches using ultrametric distance
Full pipeline architecture	NOT DONE	S5 — Component diagram: morphological analyzer → parser → encoder → index → query engine
Python prototypes	NOT DONE	S1, S4 — Parsing example sentences, building semantic trees, subgraph matching, ranking
Cross-linguistic example mapping	NOT DONE	S3 — English, Mohawk, Turkish mapped to SAME nested graph with linearization rules
Connection to Q-PNA encoding layer	NOT DONE	S5 — Specifying the interface: Q-PNA provides token encoding, NSG provides search
Query parsing specification	NOT DONE	S2 — How surface queries (English, Mohawk, visual) map to semantic graph queries
Evaluation framework	NOT DONE	BACKLOG P2 — Precision/recall metrics for sub-graph search
Large-scale implementation	NOT DONE	BACKLOG P3 — Production search engine

12.3 The Precise Contribution

The NSG project fills the engineering gap between Few Become One's conceptual argument and Q-PNA's neural implementation. It is the search and retrieval layer — the component that takes encoded semantic graphs and performs the actual matching that users care about:

User query (any language)
    │
    ▼
┌─────────────────────────────┐
│ QUERY PARSER (NSG — new)    │  ← Surface text → semantic graph
│ Morphological analysis      │
│ Semantic role labeling       │
│ Tree construction            │
└──────────┬──────────────────┘
           │
           ▼
┌─────────────────────────────┐
│ GRAPH ENCODER (Q-PNA)       │  ← Semantic graph → valuation vectors
│ p-adic valuation encoding   │     → Bruhat-Tits tree leaves
└──────────┬──────────────────┘
           │
           ▼
┌─────────────────────────────┐
│ SUB-GRAPH MATCHER (NSG)     │  ← Query subgraph matched against
│ Tree alignment lattice      │     document graph corpus
│ Ultrametric graph distance  │
└──────────┬──────────────────┘
           │
           ▼
┌─────────────────────────────┐
│ RANKING ENGINE (NSG)        │  ← Results ranked by ultrametric
│ Ultrametric cluster distance│     similarity to query
│ Threshold-based filtering   │
└──────────┬──────────────────┘
           │
           ▼
     Ranked results

13. Bibliography / Reference Index

Published Papers with DOIs (Chronological)

#	Paper	Date	DOI
1	TREE OF FREQUENCIES	2026-05-06	`10.5281/zenodo.20049051`
2	How Geometry Creates Memory	2026-05-06	`10.5281/zenodo.20061155`
3	Symmetry as a Grammatical Function	2026-05-08	`10.5281/zenodo.20089746`
4	Language as Information Architecture	2026-05-12	`10.5281/zenodo.20137616`
5	Validation of Ultrametric Error Confinement	2026-05-12	`10.5281/zenodo.20134944`
6	Tree Distance Cophenetic	2026-05-15	`10.5281/zenodo.20213043`
7	Ultrametric Geometry as Common Structure	2026-05-18	`10.5281/zenodo.20265907`
8	Q-PNA Research Specification v2.0	2026-05-19	`10.5281/zenodo.20287742`
9	Convergence, Consilience, and the Hierarchical Architecture of Reality	2026-05-20	`10.5281/zenodo.20302276`
10	The Tree Is Real	2026-05-21	`10.5281/zenodo.20325850`
11	The Tree at the Bottom of Thought	2026-05-21	`10.5281/zenodo.20329583`
12	Few Become One: Polysynthetic Communication and the Ultrametric Architecture of Language	2026-05-22	`10.5281/zenodo.20328374`

Archived Projects (Chronological)

Project	Archive	Files	Key Contribution
Semantic Observatory	`2025\09\`	1	5-layer stack, semantic field concept
Grammar of Interaction	`2025\09\`	2	Graph formalism, directed acyclic hypergraphs
PILE OF BABEL	`2025\10\`	90+	Rosetta Stone architecture, Crosswalk Mandate
SHEAF	`2025\10\`	8	Sheaf-theoretic unification
Syntactic Token Calculus v1→v3	`2026\04\`	7	Mark/Void, cross-ratio, particles as normal forms
Quantum Laws of Form	`2026\04\`	—	Distinction calculus for quantum mechanics
Ultrametric Cognition	`2026\04\`	70+	Cognitive state space as $\mathcal{T}_p$
Verb Lexicon	`2026\04\`	7	Process-verbs, patterns vs. identities
ultrametric-ai-poc	`2026\04\`	12	Working Streamlit app
Computational Syntax of Reality	`2026\04\`	—	STC ↔ physics bridge
polysynthetic-communication	`2026\05\`	—	Archive version of Few Become One
Language-Info-Architecture	`2026\05\`	—	Archive version
Q-PNA Research Specification v2.0	`2026\05\`	7-doc	Full project structure
Computational-Ultrametricity	`2026\05\`	—	Computational validation
ultrametric-game-of-life	`2026\05\`	—	Game of Life on trees

GitHub Repositories

Repository	Purpose
`github.com/rwnq8/ultrametric-ai-poc`	Working PoC for ultrametric AI
`github.com/rwnq8/language-info-architecture`	Language information architecture pipeline
`github.com/rwnq8/quantum-laws-of-form`	Distinction calculus implementation
`github.com/rwnq8/verb-lexicon`	Verb lexicon for semantic parsing
`github.com/QNFO/Q-PNA`	Q-PNA neural architecture
`github.com/QNFO/ultrametric-error-confinement`	Error confinement validation

Research Notes

Note	Date	Content
`Obsidian\notes\v1\2025\12\24\_25358055542.md`	Dec 2025	PANN concept — intrinsically interpretable AI via prime topology

14. Key Principles Distilled

From this comprehensive review, the following design principles can be extracted for the NSG project:

Index the invariant, not the projection. (Few Become One §V.E, PILE OF BABEL) — Shannon entropy is invariant under recoding. Search the semantic tree, not the surface words.
The Crosswalk Mandate. (PILE OF BABEL §0.0.5) — "Actively seek to identify and unify underlying concepts, even if they are presented with different terminology across domains."
Recursive chunking is universal. (Ultrametric Cognition, Few Become One §V.A) — What differs across languages is the level at which chunking is applied, not the operation itself.
Ultrametric containment guarantees precision. (How Geometry Creates Memory, Error Confinement) — The strong triangle condition geometrically confines perturbations below a threshold. In search: matching at depth $d$ guarantees that all relevant results are within the same ultrametric ball.
The tree is not a metaphor — it is a mathematical structure. (TREE OF FREQUENCIES, Tree Cophenetic, The Tree Is Real) — All claims about hierarchical organization should be mathematically verifiable.
Glass-box, not black-box. (Q-PNA, PANN, ultrametric-ai-poc) — Every decision should have a traceable audit trail through the tree.
"Few become one" is the generative operation. (STC, Ultrametric Cognition, Few Become One) — From the Mark to the Cosmos, the fundamental operation is the binding of distinctions into unified structures.

Internal Literature Review v0.1 — Four-pass due diligence completed 2026-05-22. 35+ archived projects, 12 published papers, 6 GitHub repos, 3 archival 2025 projects, 14 principles distilled.

FilesExpand file tree

0.1.md

Latest commit

History

0.1.md

File metadata and controls

Internal Literature Review: The Ultrametric-Language-AI Research Program

A Comprehensive Due Diligence Report for the Nested Semantic Graph Project

Executive Summary

1. Methodology

1.1 Search Strategy

1.2 Sources Searched

1.3 Search Terms

2. The Complete Development Arc: A Timeline

2.1 December 2025 — The Seed

2.2 April 2026 — Foundation Building

2.3 May 2026 — Rapid Publication Sequence

2.4 May 2026 — Parallel Archived Projects

3. Mathematical Foundations

3.1 The Syntactic Token Calculus (STC)

Core Primitives

Syntactic Operations

Three Reduction Rules

Key Theorems

Relevance to NSG

3.2 Quantum Laws of Form

3.3 Tree Distance Cophenetic (May 15)

4. Physics: The Tree as Fundamental Geometry

4.1 TREE OF FREQUENCIES (May 6)

4.2 How Geometry Creates Memory (May 6)

4.3 Symmetry as a Grammatical Function (May 8)

4.4 Validation of Ultrametric Error Confinement (May 12)

4.5 Bruhat-Tits Tree as a Unifying Geometric Object (May)

4.6 Earlier Ultrametric Physics (February–April 2026)

5. AI / Neural Architecture

5.1 PANN — P-Adic Neural Networks (December 2025)

5.2 Q-PNA Research Specification v2.0 (May 19)

Architecture Components

The Gauge Problem in Continuous AI

Relevance to NSG

5.3 ultrametric-ai-poc (April 2026)

5.4 Proof-of-Concept for Auditable Attention (April 2026)

6. Linguistics

6.1 Language as Information Architecture (May 12)

Key Findings

Relevance to NSG

6.2 Few Become One: Polysynthetic Communication and the Ultrametric Architecture of Language (May 22)

Structure

Section V — The Nested Semantic Graph Proposal (Detailed)

6.3 Verb Lexicon (April 2026)

7. Cognition

7.1 Ultrametric Cognition (April 2026)

Key Concepts

8. Synthesis & Meta-Analysis

8.1 Ultrametric Geometry as Common Structure (May 18)

8.2 Convergence, Consilience, and the Hierarchical Architecture of Reality (May 20)

8.3 The Tree Is Real — Computational Validation (May 21)

8.4 The Tree at the Bottom of Thought (May 21)

9. Archived Projects (2025)

9.1 PILE OF BABEL (October 2025)

Architecture

Key Concepts

Direct Architectural Connection to NSG

9.2 Semantic Observatory (September 2025)

9.3 Grammar of Interaction (September 2025)

9.4 SHEAF (October 2025)

10. GitHub Repositories

11. The Connection Map

11.1 The Architecture Stack (Complete)

11.2 The Mathematical Thread

11.3 Dependency Graph

12. Gap Analysis: What the Nested Semantic Graph Project Contributes

12.1 What Has Been Done

12.2 What Has NOT Been Done — The NSG's Contribution

12.3 The Precise Contribution

13. Bibliography / Reference Index

Published Papers with DOIs (Chronological)

Archived Projects (Chronological)

GitHub Repositories

Research Notes