A five-layer computable graph architecture makes domain an explicit first-class parameter, yielding domain-scoped pruning, substrate-agnostic operations, and transparent inference with reliability conditions C1-C4.
This is an algebraically grounded bound, not an external counter
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Domain-Contextualized Inference: A Computable Graph Architecture for Explicit-Domain Reasoning
A five-layer computable graph architecture makes domain an explicit first-class parameter, yielding domain-scoped pruning, substrate-agnostic operations, and transparent inference with reliability conditions C1-C4.