Atlas
The TheoremPath knowledge graph. Every page is a node. Every prerequisite is an edge. Use the quick-trace chips to run the grounding algorithm: it follows prerequisite edges in reverse to find the shortest path from any topic down to a foundational one.
600 topics4395 prerequisite edges0A axioms → 5 frontier
Try a grounding traceFollows prerequisite edges in reverse to reach a foundation.
35 nodes · 150 edges
Domains
foundationsprobabilitylearning theoryoptimizationml methodsdeep learningnlp foundationsreinforcement learningai safetymethodologydecision theoryapplied mathsystems
grounding pathfocused neighborsNode size ∝ degreeScroll to zoom · drag to pan