Typed mathematical infrastructure
Research Graph
Definitions, objects, theorems, conjectures, claim boundaries, and open problems share one source-governed graph. Papers are views into that graph, not isolated silos.
Structural emphasis
Load-bearing is curated, not counted.
The archive marks a small set of load-bearing nodes, bridges, and firewalls from the source audit. Raw graph degree is shown only as a navigation-density metric: a highly connected node is not automatically a deeper theorem or a more important idea.
Mature comparison-valued root for admissible transport.
5 in · 2 out
Retains source-certified comparison groupoids before representability.
3 in · 0 out
Carries admissible continuation before ordinary functorial representation is earned.
5 in · 5 out
Keeps complete-ground identity separate from Gauss and Klauder projections.
5 in · 0 out
Carries full physical cargo across admitted refinement with typed status accounting.
2 in · 2 out
Turns coherent certified continuation into the Grothendieck fibration.
1 in · 3 out
Tracks the complete ground across carrier changes without asserting global operator equality.
1 in · 1 out
Encodes the orbit-floor mechanism connecting observer energy to invariant spectral data.
2 in · 2 out
Transfers the height floor to an invariant orbit threshold under the stated covariance hypotheses.
2 in · 3 out
Prevents finite coercivity from being silently promoted to invariant mass.
1 in · 3 out
Prevents coherent continuation from being silently rendered as an ordinary functor.
1 in · 1 out
Prevents lineage from being confused with literal global projection equality.
2 in · 0 out