{"version":"2026-05-13.path-family.v1","generatedAt":"2026-09-03T15:06:46.828Z","contract":"Typed Path-family graph. Store many edges internally; render only high-confidence, pedagogically meaningful links.","policy":{"center":"TheoremPath is the canonical formal spine.","visibleLinkRule":"A visible cross-site link must have descriptive anchor text, a one-sentence reason, confidence >= 0.75, a meaningful relation, and a render location other than hidden-graph-only.","renderLocationLimits":{"prerequisites":5,"body":3,"next-steps":5,"related-paths":3,"references":3,"hidden-graph-only":0},"topicContract":{"fields":["site","slug","title","subtitle","layer","tier","module","estimatedMinutes","prerequisites","leadsTo","companionLabs","diagnosticItems","teaches","assesses","misconceptions","failureModes","canonicalSources","appliedSources","diagrams","katexConcepts","exercises","seo"],"requiredSections":["Why this matters","Prerequisites","Core idea","Formal / technical statement","Worked example","Common failure modes","Diagnostic check","Practice","Diagram or lab","References","Next topics"]},"qaChecklist":{"structure":["Has title, subtitle, layer, tier, module, and estimated time.","Has direct prerequisites and next topics.","Has canonical references.","Has visible content matching JSON-LD."],"pedagogy":["Opens with the practical reason the topic matters.","Explains the core idea before formalism.","Includes a worked example.","Includes common misconceptions.","Includes diagnostics mapped to prerequisite gaps."],"rigor":["Does not overclaim.","Defines notation.","States assumptions.","Uses KaTeX for formulas.","Distinguishes theorem, heuristic, rule of thumb, and empirical benchmark."],"retrieval":["Unique title and meta description.","Stable canonical URL.","JSON-LD graph present.","BreadcrumbList present.","LearningResource metadata present.","Internal links to prerequisites and leads-to pages.","References include canonical sources."]}},"sites":[{"id":"theorempath","name":"TheoremPath","canonicalHost":"theorempath.com","origin":"https://theorempath.com","tier":0,"ring":"canonical-spine","status":"live-monolith","canonicalFocus":"Formal definitions, theorem statements, proof obligations, assumptions, and mathematical generalizations.","linkGuidance":"Link out only when the application genuinely clarifies the formal object.","visibleLinkBudget":{"min":8,"max":14}},{"id":"dsapath","name":"DSAPath","canonicalHost":"www.dsapath.com","origin":"https://www.dsapath.com","tier":1,"ring":"technical-professional","status":"live-monolith","canonicalFocus":"Implementation-first data structures, algorithms, complexity, and common coding failure modes.","linkGuidance":"Link to TheoremPath for proof foundations and to IOIPath/SystemDesignPath/CUDAPath for genuine applications.","visibleLinkBudget":{"min":6,"max":12}},{"id":"probabilitypath","name":"ProbabilityPath","canonicalHost":"probabilitypath.com","origin":"https://probabilitypath.com","tier":1,"ring":"technical-professional","status":"planned","canonicalFocus":"Random variables, distributions, stochastic processes, expectation intuition, and applied probability models.","linkGuidance":"Bridge TheoremPath formalism to StatisticsPath, ActuaryPath, SystemDesignPath, and PhilosophyPath only where probability changes decisions.","visibleLinkBudget":{"min":6,"max":12}},{"id":"statisticspath","name":"StatisticsPath","canonicalHost":"statisticspath.com","origin":"https://statisticspath.com","tier":1,"ring":"technical-professional","status":"planned","canonicalFocus":"Inference, estimation, uncertainty quantification, regression, diagnostics, and model checking.","linkGuidance":"Link to TheoremPath for assumptions and proofs, ProbabilityPath for random structure, and ActuaryPath for professional use.","visibleLinkBudget":{"min":6,"max":12}},{"id":"economicspath","name":"EconomicsPath","canonicalHost":"www.economicspath.com","origin":"https://www.economicspath.com","tier":1,"ring":"technical-professional","status":"planned","canonicalFocus":"Academic economics with econometrics as the load-bearing track: identification, causal designs, policy interpretation, and ML-era econometric methods.","linkGuidance":"Cross-link to TheoremPath for technical probability, statistics, optimization, and ML machinery; keep EconomicsPath focused on economic interpretation and named identifying assumptions.","visibleLinkBudget":{"min":6,"max":12}},{"id":"calculuspath","name":"CalculusPath","canonicalHost":"calculuspath.com","origin":"https://calculuspath.com","tier":1,"ring":"technical-professional","status":"planned","canonicalFocus":"Learner-facing limits, derivatives, integrals, series, approximations, and computational calculus.","linkGuidance":"Keep pages computational and applied; link to TheoremPath when a rigorous analysis theorem is doing the work.","visibleLinkBudget":{"min":6,"max":12}},{"id":"geometrypath","name":"GeometryPath","canonicalHost":"geometrypath.com","origin":"https://geometrypath.com","tier":1,"ring":"technical-professional","status":"planned","canonicalFocus":"Geometry as structure: Euclidean proof, topology, manifolds, curvature, information geometry, optimal transport, and geometric ML.","linkGuidance":"Keep as a TheoremPath geometry sub-vertical until the corpus is deep enough; link to TheoremPath for ML-facing applications and to ProofsPath for olympiad technique.","visibleLinkBudget":{"min":5,"max":10}},{"id":"actuarypath","name":"ActuaryPath","canonicalHost":"actuarypath.com","origin":"https://actuarypath.com","tier":1,"ring":"technical-professional","status":"external-project","canonicalFocus":"Actuarial exams, risk, life contingencies, loss models, credibility, reserving, pricing, and professional judgment.","linkGuidance":"Use ProbabilityPath, StatisticsPath, CalculusPath, and TheoremPath as foundations; avoid thin exam-note clones.","visibleLinkBudget":{"min":6,"max":10}},{"id":"systemdesignpath","name":"SystemDesignPath","canonicalHost":"systemdesignpath.com","origin":"https://systemdesignpath.com","tier":1,"ring":"technical-professional","status":"planned","canonicalFocus":"Production architecture, constraints, trade-offs, reliability, observability, security, cost, and operations.","linkGuidance":"Link to math only where it improves a design decision; do not write interview-template fluff.","visibleLinkBudget":{"min":5,"max":9}},{"id":"cudapath","name":"CUDAPath","canonicalHost":"cudapath.com","origin":"https://cudapath.com","tier":1,"ring":"technical-professional","status":"planned","canonicalFocus":"Profiler-driven CUDA and GPU programming from C++/systems foundations to high-performance kernels.","linkGuidance":"Tie performance claims to official docs or measured benchmarks; never claim an optimization is universally faster.","visibleLinkBudget":{"min":6,"max":10}},{"id":"ioipath","name":"IOIPath","canonicalHost":"ioipath.com","origin":"https://ioipath.com","tier":1,"ring":"contest-excellence","status":"planned","canonicalFocus":"IOI-style algorithmic modeling, constraints, correctness proofs, C++ implementation, subtasks, testing, and contest execution.","linkGuidance":"Depend on DSAPath for implementation primitives and TheoremPath for proof structure; keep broader CP topics labeled as out-of-scope when needed.","visibleLinkBudget":{"min":6,"max":10}},{"id":"putnampath","name":"PutnamPath","canonicalHost":"putnampath.com","origin":"https://putnampath.com","tier":1,"ring":"contest-excellence","status":"planned","canonicalFocus":"Undergraduate proof-contest synthesis across analysis, algebra, combinatorics, number theory, linear algebra, and probability.","linkGuidance":"Link to TheoremPath for theorem depth and IMOPath for elementary proof moves; avoid copying official problem statements.","visibleLinkBudget":{"min":6,"max":10}},{"id":"imopath","name":"IMOPath","canonicalHost":"imopath.com","origin":"https://imopath.com","tier":1,"ring":"contest-excellence","status":"planned","canonicalFocus":"Proof-first olympiad technique graph from fundamentals to shortlist-level synthesis.","linkGuidance":"Teach recognition, false starts, clean proof writing, and original exposition; avoid trick lists.","visibleLinkBudget":{"min":6,"max":10}},{"id":"philosophypath","name":"PhilosophyPath","canonicalHost":"www.philosophypath.com","origin":"https://www.philosophypath.com","tier":2,"ring":"conceptual-bridge","status":"live-monolith","canonicalFocus":"Logic, epistemology, decision theory, philosophy of language, ethics, and philosophy of science/math.","linkGuidance":"Use serious bridges through logic, probability interpretation, causality, semantics, and argumentation.","visibleLinkBudget":{"min":5,"max":9}},{"id":"linguisticspath","name":"LinguisticsPath","canonicalHost":"linguisticspath.com","origin":"https://linguisticspath.com","tier":2,"ring":"conceptual-bridge","status":"live-monolith","canonicalFocus":"Syntax, semantics, phonology, pragmatics, formal grammars, and NLP-adjacent language theory.","linkGuidance":"Bridge to technical pages through formal language, parsing, semantics, probability, and information theory.","visibleLinkBudget":{"min":5,"max":9}},{"id":"classicspath","name":"ClassicsPath","canonicalHost":"www.classicspath.com","origin":"https://www.classicspath.com","tier":3,"ring":"humanities-edge","status":"live-monolith","canonicalFocus":"Ancient texts, ancient languages, rhetoric, ancient philosophy/science, and Greco-Roman intellectual history.","linkGuidance":"Connect lightly through Euclid, Aristotle, rhetoric, philology, and history of science; do not force technical links.","visibleLinkBudget":{"min":3,"max":7}},{"id":"literaturepath","name":"LiteraturePath","canonicalHost":"www.literaturepath.com","origin":"https://www.literaturepath.com","tier":3,"ring":"humanities-edge","status":"live-monolith","canonicalFocus":"Literary works, narrative, genres, rhetoric, interpretation, criticism, and cultural literacy.","linkGuidance":"Connect through rhetoric, semantics, pragmatics, interpretation, and philosophy of language; keep technical links rare.","visibleLinkBudget":{"min":3,"max":7}},{"id":"computationpath","name":"ComputationPath","canonicalHost":"www.computationpath.com","origin":"https://www.computationpath.com","tier":2,"ring":"technical-professional","status":"live-monolith","canonicalFocus":"Computing foundations, machines, logic, systems primitives, and CS theory outside the main ML curriculum.","linkGuidance":"Use as the CS-foundations bridge where DSAPath would be too implementation-heavy.","visibleLinkBudget":{"min":5,"max":9}},{"id":"pedagogypath","name":"PedagogyPath","canonicalHost":"www.pedagogypath.com","origin":"https://www.pedagogypath.com","tier":2,"ring":"internal-support","status":"live-monolith","canonicalFocus":"Adaptive learning, psychometrics, tutoring systems, FSRS, IRT, BKT, and curriculum engineering.","linkGuidance":"Use for learning-system design and diagnostics, not as generic education commentary.","visibleLinkBudget":{"min":4,"max":8}},{"id":"proofspath","name":"ProofsPath","canonicalHost":"www.proofspath.com","origin":"https://www.proofspath.com","tier":2,"ring":"contest-excellence","status":"legacy-bridge","canonicalFocus":"Current proof-technique bridge for induction, inequalities, and olympiad-style moves until IMOPath becomes the dedicated domain.","linkGuidance":"Keep useful pages, but assign future olympiad contest ownership to IMOPath and formal proof ownership to TheoremPath.","visibleLinkBudget":{"min":4,"max":8}}],"matrix":{"theorempath":{"dsapath":"M","probabilitypath":"M","statisticspath":"M","economicspath":"M","calculuspath":"M","geometrypath":"M","actuarypath":"M","systemdesignpath":"M","cudapath":"L","ioipath":"L","putnampath":"M","imopath":"M","philosophypath":"L","linguisticspath":"L","classicspath":"L","literaturepath":"L"},"dsapath":{"theorempath":"H","probabilitypath":"M","statisticspath":"M","calculuspath":"L","geometrypath":"L","systemdesignpath":"M","cudapath":"M","ioipath":"H","putnampath":"L","imopath":"L","philosophypath":"L","linguisticspath":"M","classicspath":"X","literaturepath":"X"},"probabilitypath":{"theorempath":"H","dsapath":"L","statisticspath":"H","economicspath":"H","calculuspath":"M","actuarypath":"H","systemdesignpath":"M","putnampath":"M","philosophypath":"M","linguisticspath":"M"},"statisticspath":{"theorempath":"H","probabilitypath":"H","economicspath":"H","calculuspath":"M","geometrypath":"L","actuarypath":"H","systemdesignpath":"M","philosophypath":"M","linguisticspath":"M"},"economicspath":{"theorempath":"H","probabilitypath":"H","statisticspath":"H","calculuspath":"M","actuarypath":"M","philosophypath":"M"},"calculuspath":{"theorempath":"H","probabilitypath":"M","statisticspath":"M","economicspath":"M","geometrypath":"M","actuarypath":"H","cudapath":"M","putnampath":"M"},"geometrypath":{"theorempath":"H","calculuspath":"H","statisticspath":"M","probabilitypath":"L","cudapath":"L","putnampath":"L","imopath":"M","proofspath":"M","computationpath":"M","classicspath":"L"},"actuarypath":{"theorempath":"H","probabilitypath":"H","statisticspath":"H","calculuspath":"H","geometrypath":"X","systemdesignpath":"M","putnampath":"L","philosophypath":"L"},"systemdesignpath":{"theorempath":"M","dsapath":"H","probabilitypath":"M","statisticspath":"M","calculuspath":"L","actuarypath":"M","cudapath":"L","ioipath":"L","philosophypath":"L","linguisticspath":"L"},"cudapath":{"theorempath":"H","dsapath":"H","probabilitypath":"L","statisticspath":"L","calculuspath":"M","geometrypath":"L","systemdesignpath":"L","ioipath":"L"},"ioipath":{"theorempath":"M","dsapath":"H","probabilitypath":"L","imopath":"M","putnampath":"L"},"putnampath":{"theorempath":"H","probabilitypath":"M","statisticspath":"M","calculuspath":"M","actuarypath":"L","imopath":"H","philosophypath":"M","linguisticspath":"L","classicspath":"L"},"imopath":{"theorempath":"H","dsapath":"L","probabilitypath":"L","geometrypath":"M","ioipath":"M","putnampath":"M","philosophypath":"L","classicspath":"L"},"philosophypath":{"theorempath":"H","probabilitypath":"M","statisticspath":"M","actuarypath":"L","systemdesignpath":"L","putnampath":"M","imopath":"L","linguisticspath":"H","classicspath":"M","literaturepath":"M"},"linguisticspath":{"theorempath":"M","dsapath":"M","probabilitypath":"M","statisticspath":"M","systemdesignpath":"L","putnampath":"L","philosophypath":"H","classicspath":"M","literaturepath":"M"},"classicspath":{"theorempath":"M","putnampath":"L","imopath":"L","philosophypath":"H","linguisticspath":"M","literaturepath":"H"},"literaturepath":{"theorempath":"L","statisticspath":"L","philosophypath":"H","linguisticspath":"H","classicspath":"H"},"computationpath":{"theorempath":"H","dsapath":"H","linguisticspath":"M","philosophypath":"M"},"pedagogypath":{"theorempath":"M","statisticspath":"M","systemdesignpath":"L"},"proofspath":{"theorempath":"H","imopath":"H","putnampath":"M"}},"concepts":[{"id":"proof.induction","name":"Induction","canonicalSite":"theorempath","canonicalSlug":"basic-logic-and-proof-techniques","canonicalUrl":"https://theorempath.com/topics/basic-logic-and-proof-techniques","domains":["theorempath","dsapath","ioipath","imopath","putnampath"],"conceptType":"proof-technique","importance":5,"theoremPathCentrality":5},{"id":"proof.invariants","name":"Invariants","canonicalSite":"theorempath","canonicalSlug":"basic-logic-and-proof-techniques","canonicalUrl":"https://theorempath.com/topics/basic-logic-and-proof-techniques","domains":["theorempath","dsapath","ioipath","imopath","putnampath"],"conceptType":"proof-technique","importance":5,"theoremPathCentrality":4},{"id":"probability.bayes_theorem","name":"Bayes' theorem","canonicalSite":"theorempath","canonicalSlug":"bayes-theorem","canonicalUrl":"https://theorempath.com/topics/bayes-theorem","domains":["theorempath","probabilitypath","statisticspath","actuarypath","philosophypath","linguisticspath"],"conceptType":"theorem","importance":5,"theoremPathCentrality":5},{"id":"probability.conditional_expectation","name":"Conditional expectation","canonicalSite":"theorempath","canonicalSlug":"conditional-expectation","canonicalUrl":"https://theorempath.com/topics/conditional-expectation","domains":["theorempath","probabilitypath","statisticspath","actuarypath"],"conceptType":"definition","importance":5,"theoremPathCentrality":5},{"id":"stochastic.markov_chains","name":"Markov chains","canonicalSite":"theorempath","canonicalSlug":"markov-chains","canonicalUrl":"https://theorempath.com/topics/markov-chains","domains":["theorempath","probabilitypath","statisticspath","actuarypath","systemdesignpath","linguisticspath"],"conceptType":"model","importance":5,"theoremPathCentrality":5},{"id":"information.entropy","name":"Entropy","canonicalSite":"theorempath","canonicalSlug":"entropy-cross-entropy-and-kl-divergence","canonicalUrl":"https://theorempath.com/topics/entropy-cross-entropy-and-kl-divergence","domains":["theorempath","probabilitypath","statisticspath","linguisticspath","systemdesignpath"],"conceptType":"definition","importance":5,"theoremPathCentrality":5},{"id":"calculus.taylor_expansion","name":"Taylor expansion","canonicalSite":"theorempath","canonicalSlug":"calculus-foundations","canonicalUrl":"https://theorempath.com/topics/calculus-foundations","domains":["theorempath","calculuspath","putnampath","cudapath"],"conceptType":"theorem","importance":5,"theoremPathCentrality":5},{"id":"calculus.chain_rule","name":"Chain rule","canonicalSite":"calculuspath","canonicalSlug":"chain-rule","canonicalUrl":"https://calculuspath.com/topics/chain-rule","domains":["calculuspath","theorempath","dsapath","cudapath"],"conceptType":"theorem","importance":5,"theoremPathCentrality":5},{"id":"calculus.gradient","name":"Gradient","canonicalSite":"calculuspath","canonicalSlug":"gradient-and-directional-derivative","canonicalUrl":"https://calculuspath.com/topics/gradient-and-directional-derivative","domains":["calculuspath","theorempath","statisticspath","cudapath"],"conceptType":"definition","importance":5,"theoremPathCentrality":4},{"id":"calculus.change_of_variables","name":"Change of variables","canonicalSite":"calculuspath","canonicalSlug":"integration-and-change-of-variables","canonicalUrl":"https://calculuspath.com/topics/integration-and-change-of-variables","domains":["calculuspath","probabilitypath","statisticspath","theorempath"],"conceptType":"method","importance":5,"theoremPathCentrality":4},{"id":"geometry.manifolds","name":"Manifolds","canonicalSite":"geometrypath","canonicalSlug":"what-is-a-manifold","canonicalUrl":"https://geometrypath.com/topics/what-is-a-manifold","domains":["geometrypath","theorempath","calculuspath"],"conceptType":"definition","importance":5,"theoremPathCentrality":4},{"id":"geometry.riemannian_metric","name":"Riemannian metric","canonicalSite":"geometrypath","canonicalSlug":"riemannian-metric","canonicalUrl":"https://geometrypath.com/topics/riemannian-metric","domains":["geometrypath","theorempath","statisticspath"],"conceptType":"definition","importance":4,"theoremPathCentrality":4},{"id":"geometry.information_geometry","name":"Information geometry","canonicalSite":"theorempath","canonicalSlug":"information-geometry","canonicalUrl":"https://theorempath.com/topics/information-geometry","domains":["theorempath","geometrypath","statisticspath"],"conceptType":"model","importance":4,"theoremPathCentrality":5},{"id":"pedagogy.retrieval_practice","name":"Retrieval practice","canonicalSite":"pedagogypath","canonicalSlug":"retrieval-practice","canonicalUrl":"https://www.pedagogypath.com/topics/retrieval-practice","domains":["pedagogypath","theorempath"],"conceptType":"method","importance":5,"theoremPathCentrality":1},{"id":"pedagogy.spaced_repetition","name":"Spaced repetition","canonicalSite":"pedagogypath","canonicalSlug":"fsrs-spaced-repetition-for-educators","canonicalUrl":"https://www.pedagogypath.com/topics/fsrs-spaced-repetition-for-educators","domains":["pedagogypath","theorempath"],"conceptType":"method","importance":5,"theoremPathCentrality":1},{"id":"pedagogy.knowledge_tracing","name":"Knowledge tracing","canonicalSite":"pedagogypath","canonicalSlug":"bayesian-knowledge-tracing-for-educators","canonicalUrl":"https://www.pedagogypath.com/topics/bayesian-knowledge-tracing-for-educators","domains":["pedagogypath","theorempath","statisticspath"],"conceptType":"model","importance":5,"theoremPathCentrality":2},{"id":"psychometrics.item_response_theory","name":"Item response theory","canonicalSite":"pedagogypath","canonicalSlug":"item-response-theory-for-educators","canonicalUrl":"https://www.pedagogypath.com/topics/item-response-theory-for-educators","domains":["pedagogypath","statisticspath","theorempath"],"conceptType":"model","importance":5,"theoremPathCentrality":2},{"id":"analysis.compactness","name":"Compactness","canonicalSite":"theorempath","canonicalSlug":"compactness-and-heine-borel","canonicalUrl":"https://theorempath.com/topics/compactness-and-heine-borel","domains":["theorempath","putnampath","philosophypath"],"conceptType":"theorem","importance":4,"theoremPathCentrality":5},{"id":"linear_algebra.eigenvalues","name":"Eigenvalues","canonicalSite":"theorempath","canonicalSlug":"spectral-theory-foundations","canonicalUrl":"https://theorempath.com/topics/spectral-theory-foundations","domains":["theorempath","putnampath","statisticspath","cudapath"],"conceptType":"definition","importance":5,"theoremPathCentrality":5},{"id":"graph.shortest_paths.dijkstra","name":"Dijkstra's algorithm","canonicalSite":"dsapath","canonicalSlug":"dijkstra","canonicalUrl":"https://www.dsapath.com/topics/dijkstra","domains":["dsapath","ioipath","theorempath"],"conceptType":"algorithm","importance":5,"theoremPathCentrality":2},{"id":"data_structure.segment_tree","name":"Segment tree","canonicalSite":"dsapath","canonicalSlug":"segment-tree","canonicalUrl":"https://www.dsapath.com/topics/segment-tree","domains":["dsapath","ioipath"],"conceptType":"data-structure","importance":4,"theoremPathCentrality":1},{"id":"parallel.prefix_scan","name":"Prefix scan","canonicalSite":"dsapath","canonicalSlug":"prefix-sums","canonicalUrl":"https://www.dsapath.com/topics/prefix-sums","domains":["dsapath","ioipath","cudapath","theorempath"],"conceptType":"algorithm","importance":5,"theoremPathCentrality":3},{"id":"systems.littles_law","name":"Little's Law","canonicalSite":"systemdesignpath","canonicalSlug":"littles-law","canonicalUrl":"https://systemdesignpath.com/topics/littles-law","domains":["systemdesignpath","probabilitypath","theorempath"],"conceptType":"theorem","importance":5,"theoremPathCentrality":3},{"id":"systems.idempotency","name":"Idempotency","canonicalSite":"systemdesignpath","canonicalSlug":"idempotency","canonicalUrl":"https://systemdesignpath.com/topics/idempotency","domains":["systemdesignpath","dsapath","theorempath"],"conceptType":"design-pattern","importance":5,"theoremPathCentrality":2},{"id":"gpu.memory_coalescing","name":"CUDA memory coalescing","canonicalSite":"cudapath","canonicalSlug":"memory-coalescing","canonicalUrl":"https://cudapath.com/topics/memory-coalescing","domains":["cudapath","dsapath","theorempath"],"conceptType":"method","importance":5,"theoremPathCentrality":1},{"id":"olympiad.extremal_principle","name":"Extremal principle","canonicalSite":"imopath","canonicalSlug":"extremal-principle","canonicalUrl":"https://imopath.com/topics/extremal-principle","domains":["imopath","putnampath","theorempath"],"conceptType":"proof-technique","importance":5,"theoremPathCentrality":3},{"id":"olympiad.double_counting","name":"Double counting","canonicalSite":"imopath","canonicalSlug":"double-counting","canonicalUrl":"https://imopath.com/topics/double-counting","domains":["imopath","putnampath","theorempath"],"conceptType":"proof-technique","importance":5,"theoremPathCentrality":3},{"id":"language.context_free_grammar","name":"Context-free grammar","canonicalSite":"linguisticspath","canonicalSlug":"context-free-grammars","canonicalUrl":"https://linguisticspath.com/topics/context-free-grammars","domains":["linguisticspath","theorempath","dsapath","computationpath"],"conceptType":"linguistic-concept","importance":4,"theoremPathCentrality":3},{"id":"philosophy.bayesian_epistemology","name":"Bayesian epistemology","canonicalSite":"philosophypath","canonicalSlug":"bayesian-epistemology","canonicalUrl":"https://www.philosophypath.com/topics/bayesian-epistemology","domains":["philosophypath","probabilitypath","statisticspath"],"conceptType":"philosophical-concept","importance":4,"theoremPathCentrality":2},{"id":"classics.euclid_elements","name":"Euclid's Elements","canonicalSite":"classicspath","canonicalSlug":"euclids-elements","canonicalUrl":"https://www.classicspath.com/topics/euclids-elements","domains":["classicspath","theorempath","philosophypath"],"conceptType":"text","importance":3,"theoremPathCentrality":2}],"edges":[{"id":"theorempath--basic-logic-and-proof-techniques--implementation-version--dsapath--dynamic-programming","fromSite":"theorempath","fromSlug":"basic-logic-and-proof-techniques","toSite":"dsapath","toSlug":"dynamic-programming","relation":"implementation-version","anchorText":"dynamic programming correctness","reason":"Dynamic programming uses induction and invariants as implementation-level proof obligations.","strength":5,"requiredForUnderstanding":false,"renderLocation":"related-paths","source":"curriculum-spec","confidence":0.95,"visibleEligible":true},{"id":"dsapath--dynamic-programming--proof-foundation--theorempath--basic-logic-and-proof-techniques","fromSite":"dsapath","fromSlug":"dynamic-programming","toSite":"theorempath","toSlug":"basic-logic-and-proof-techniques","relation":"proof-foundation","anchorText":"inductive proof structure","reason":"The correctness argument for DP recurrences relies on induction over states or subproblem size.","strength":5,"requiredForUnderstanding":true,"renderLocation":"prerequisites","source":"curriculum-spec","confidence":0.95,"visibleEligible":true},{"id":"ioipath--dijkstra-shortest-paths--implementation-version--dsapath--priority-queues","fromSite":"ioipath","fromSlug":"dijkstra-shortest-paths","toSite":"dsapath","toSlug":"priority-queues","relation":"implementation-version","anchorText":"priority queue implementation details","reason":"The IOI solution depends on heap-based extract-min behavior and stale-entry handling.","strength":5,"requiredForUnderstanding":true,"renderLocation":"prerequisites","source":"curriculum-spec","confidence":0.95,"visibleEligible":false},{"id":"ioipath--dijkstra-shortest-paths--proof-foundation--theorempath--basic-logic-and-proof-techniques","fromSite":"ioipath","fromSlug":"dijkstra-shortest-paths","toSite":"theorempath","toSlug":"basic-logic-and-proof-techniques","relation":"proof-foundation","anchorText":"settled-node invariant","reason":"The correctness proof uses an invariant over settled nodes and nonnegative edge weights.","strength":4,"requiredForUnderstanding":false,"renderLocation":"body","source":"curriculum-spec","confidence":0.9,"visibleEligible":false},{"id":"cudapath--parallel-prefix-scan--implementation-version--dsapath--prefix-sums","fromSite":"cudapath","fromSlug":"parallel-prefix-scan","toSite":"dsapath","toSlug":"prefix-sums","relation":"implementation-version","anchorText":"sequential prefix sums","reason":"CUDA scan pages should contrast the parallel algorithm with the sequential DSA primitive.","strength":4,"requiredForUnderstanding":true,"renderLocation":"prerequisites","source":"curriculum-spec","confidence":0.9,"visibleEligible":false},{"id":"cudapath--parallel-prefix-scan--formal-foundation--theorempath--associativity-and-monoids","fromSite":"cudapath","fromSlug":"parallel-prefix-scan","toSite":"theorempath","toSlug":"associativity-and-monoids","relation":"formal-foundation","anchorText":"associativity requirement","reason":"Parallel scan correctness depends on the operation being associative.","strength":4,"requiredForUnderstanding":true,"renderLocation":"body","source":"curriculum-spec","confidence":0.9,"visibleEligible":true},{"id":"systemdesignpath--littles-law--probabilistic-application--probabilitypath--queueing-intuition","fromSite":"systemdesignpath","fromSlug":"littles-law","toSite":"probabilitypath","toSlug":"queueing-intuition","relation":"probabilistic-application","anchorText":"queueing intuition","reason":"Little's Law is easier to use when arrival rate, waiting time, and in-flight work are separated.","strength":4,"requiredForUnderstanding":true,"renderLocation":"prerequisites","source":"curriculum-spec","confidence":0.9,"visibleEligible":false},{"id":"systemdesignpath--availability--probabilistic-application--probabilitypath--independent-events","fromSite":"systemdesignpath","fromSlug":"availability","toSite":"probabilitypath","toSlug":"independent-events","relation":"probabilistic-application","anchorText":"independent event assumptions","reason":"Availability calculations are often wrong when independence assumptions are unstated.","strength":5,"requiredForUnderstanding":true,"renderLocation":"prerequisites","source":"curriculum-spec","confidence":0.92,"visibleEligible":false},{"id":"actuarypath--credibility-theory--formal-foundation--theorempath--conditional-expectation","fromSite":"actuarypath","fromSlug":"credibility-theory","toSite":"theorempath","toSlug":"conditional-expectation","relation":"formal-foundation","anchorText":"conditional expectation","reason":"Credibility theory relies on conditional expectation and variance decomposition.","strength":5,"requiredForUnderstanding":true,"renderLocation":"prerequisites","source":"curriculum-spec","confidence":0.95,"visibleEligible":true},{"id":"putnampath--compactness-putnam--formal-foundation--theorempath--compactness-and-heine-borel","fromSite":"putnampath","fromSlug":"compactness-putnam","toSite":"theorempath","toSlug":"compactness-and-heine-borel","relation":"formal-foundation","anchorText":"Heine-Borel and extreme-value theorem","reason":"The Putnam page should teach recognition while TheoremPath owns the exact theorem and assumptions.","strength":5,"requiredForUnderstanding":true,"renderLocation":"prerequisites","source":"curriculum-spec","confidence":0.95,"visibleEligible":true},{"id":"putnampath--extremal-principle--contest-application--imopath--extremal-principle","fromSite":"putnampath","fromSlug":"extremal-principle","toSite":"imopath","toSlug":"extremal-principle","relation":"contest-application","anchorText":"elementary extremal principle","reason":"Putnam versions often reuse the same minimal-counterexample move introduced in olympiad training.","strength":4,"requiredForUnderstanding":false,"renderLocation":"related-paths","source":"curriculum-spec","confidence":0.9,"visibleEligible":false},{"id":"linguisticspath--context-free-grammars--implementation-version--dsapath--parsing-algorithms","fromSite":"linguisticspath","fromSlug":"context-free-grammars","toSite":"dsapath","toSlug":"parsing-algorithms","relation":"implementation-version","anchorText":"parsing algorithms","reason":"Formal grammar pages should point to implementation-level parsing when the learner needs algorithms.","strength":4,"requiredForUnderstanding":false,"renderLocation":"related-paths","source":"curriculum-spec","confidence":0.88,"visibleEligible":true},{"id":"classicspath--euclids-elements--historical-context--theorempath--axiomatic-geometry","fromSite":"classicspath","fromSlug":"euclids-elements","toSite":"theorempath","toSlug":"axiomatic-geometry","relation":"historical-context","anchorText":"axiomatic geometry","reason":"Euclid is a historically explicit bridge into axiomatic mathematical method.","strength":4,"requiredForUnderstanding":false,"renderLocation":"body","source":"curriculum-spec","confidence":0.88,"visibleEligible":false},{"id":"calculuspath--chain-rule--formal-foundation--theorempath--vector-calculus-chain-rule","fromSite":"calculuspath","fromSlug":"chain-rule","toSite":"theorempath","toSlug":"vector-calculus-chain-rule","relation":"formal-foundation","anchorText":"multivariable chain rule for backpropagation","reason":"CalculusPath teaches the computational rule while TheoremPath owns the ML-facing chain-rule proof obligation.","strength":5,"requiredForUnderstanding":true,"renderLocation":"body","source":"curriculum-spec","confidence":0.95,"visibleEligible":true},{"id":"calculuspath--gradient-and-directional-derivative--applied-version--theorempath--gradient-descent-variants","fromSite":"calculuspath","fromSlug":"gradient-and-directional-derivative","toSite":"theorempath","toSlug":"gradient-descent-variants","relation":"applied-version","anchorText":"gradient descent variants","reason":"The natural downstream use of gradients for ML learners is optimization by descent methods.","strength":4,"requiredForUnderstanding":false,"renderLocation":"next-steps","source":"curriculum-spec","confidence":0.9,"visibleEligible":true},{"id":"calculuspath--taylor-series-with-remainder--formal-foundation--theorempath--taylor-expansion","fromSite":"calculuspath","fromSlug":"taylor-series-with-remainder","toSite":"theorempath","toSlug":"taylor-expansion","relation":"formal-foundation","anchorText":"Taylor expansion with controlled error","reason":"TheoremPath carries the approximation and error-control framing used by statistics and optimization pages.","strength":5,"requiredForUnderstanding":true,"renderLocation":"body","source":"curriculum-spec","confidence":0.95,"visibleEligible":true},{"id":"geometrypath--information-geometry--formal-foundation--theorempath--information-geometry","fromSite":"geometrypath","fromSlug":"information-geometry","toSite":"theorempath","toSlug":"information-geometry","relation":"formal-foundation","anchorText":"information geometry for ML and statistics","reason":"TheoremPath currently owns the published ML-facing treatment until GeometryPath has a standalone corpus.","strength":5,"requiredForUnderstanding":true,"renderLocation":"prerequisites","source":"curriculum-spec","confidence":0.95,"visibleEligible":true},{"id":"geometrypath--riemannian-metric--calculus-prerequisite--calculuspath--gradient-and-directional-derivative","fromSite":"geometrypath","fromSlug":"riemannian-metric","toSite":"calculuspath","toSlug":"gradient-and-directional-derivative","relation":"calculus-prerequisite","anchorText":"gradients and directional derivatives","reason":"Riemannian geometry upgrades calculus from Euclidean tangent vectors to metric-dependent tangent-space inner products.","strength":4,"requiredForUnderstanding":true,"renderLocation":"prerequisites","source":"curriculum-spec","confidence":0.9,"visibleEligible":false},{"id":"geometrypath--what-is-a-manifold--advanced-generalization--theorempath--non-euclidean-and-hyperbolic-geometry","fromSite":"geometrypath","fromSlug":"what-is-a-manifold","toSite":"theorempath","toSlug":"non-euclidean-and-hyperbolic-geometry","relation":"advanced-generalization","anchorText":"non-Euclidean and hyperbolic geometry","reason":"The existing TheoremPath page is the current bridge from geometric structure to ML representation questions.","strength":3,"requiredForUnderstanding":false,"renderLocation":"related-paths","source":"curriculum-spec","confidence":0.85,"visibleEligible":true},{"id":"pedagogypath--the-theorempath-pedagogy-thesis--applied-version--theorempath--methodology","fromSite":"pedagogypath","fromSlug":"the-theorempath-pedagogy-thesis","toSite":"theorempath","toSlug":"methodology","relation":"applied-version","anchorText":"TheoremPath methodology","reason":"The pedagogy thesis explains why the production learning system uses prerequisite maps, diagnostics, and review scheduling.","strength":5,"requiredForUnderstanding":false,"renderLocation":"body","source":"curriculum-spec","confidence":0.95,"visibleEligible":false},{"id":"pedagogypath--item-response-theory-for-educators--formal-foundation--theorempath--fisher-information","fromSite":"pedagogypath","fromSlug":"item-response-theory-for-educators","toSite":"theorempath","toSlug":"fisher-information","relation":"formal-foundation","anchorText":"Fisher information","reason":"IRT item curves and information functions are easiest to ground through Fisher-information geometry.","strength":4,"requiredForUnderstanding":false,"renderLocation":"body","source":"curriculum-spec","confidence":0.9,"visibleEligible":false},{"id":"pedagogypath--bayesian-knowledge-tracing-for-educators--formal-foundation--theorempath--bayes-theorem","fromSite":"pedagogypath","fromSlug":"bayesian-knowledge-tracing-for-educators","toSite":"theorempath","toSlug":"bayes-theorem","relation":"formal-foundation","anchorText":"Bayes' theorem","reason":"BKT is an applied Bayesian update over hidden mastery state.","strength":5,"requiredForUnderstanding":true,"renderLocation":"prerequisites","source":"curriculum-spec","confidence":0.95,"visibleEligible":true},{"id":"literaturepath--metaphor--linguistic-context--linguisticspath--semantics-and-pragmatics","fromSite":"literaturepath","fromSlug":"metaphor","toSite":"linguisticspath","toSlug":"semantics-and-pragmatics","relation":"linguistic-context","anchorText":"semantics and pragmatics","reason":"Metaphor has a genuine language-theory treatment through meaning and use.","strength":4,"requiredForUnderstanding":false,"renderLocation":"related-paths","source":"curriculum-spec","confidence":0.86,"visibleEligible":false},{"id":"systemdesignpath--microservices--sibling-treatment--literaturepath--narrative-structure","fromSite":"systemdesignpath","fromSlug":"microservices","toSite":"literaturepath","toSlug":"narrative-structure","relation":"sibling-treatment","anchorText":"narrative structure","reason":"Keyword-only example retained as a hidden negative control; it should never render visibly.","strength":1,"requiredForUnderstanding":false,"renderLocation":"hidden-graph-only","source":"agent-suggested","confidence":0.4,"visibleEligible":false}],"launchSpecs":[{"site":"systemdesignpath","positioning":"SystemDesignPath is a production-first system design curriculum: constraints, trade-offs, scaling, reliability, data, cost, and operations.","launchTarget":{"topicPages":50,"caseStudies":6,"diagnostics":1},"canonicalReferences":[],"appliedReferences":[],"linkingPlan":[],"pedagogyPlan":[],"sourcePolicy":["Use Designing Data-Intensive Applications for data-system trade-offs.","Use the Google SRE books for SLOs, monitoring, toil, incidents, and reliability practice.","Use AWS Well-Architected and Azure Architecture Center for cloud-pattern trade-offs.","Date any pricing or vendor-behavior claims and mark them vendor-specific."],"modules":[{"layer":0,"module":"Engineering Foundations","goal":"Give learners the vocabulary and math needed to reason about systems.","topics":["Latency, throughput, and capacity","Little's Law","Availability and reliability","Back-of-the-envelope estimation","APIs and data models","HTTP, DNS, TLS, TCP"]},{"layer":1,"module":"Core Building Blocks","goal":"Understand the primitives used in almost every system.","topics":["Load balancers","Caches","Relational databases","Indexes","Object storage","Message queues","Search indexes","CDNs"]},{"layer":2,"module":"Distributed Systems Mechanics","goal":"Teach why systems break and what trade-offs actually mean.","topics":["Replication","Partitioning and sharding","Consistency models","Quorums","Transactions","Idempotency","Retries and backoff","Clock and ordering problems"]},{"layer":3,"module":"Architecture Patterns","goal":"Teach reusable designs and when not to use them.","topics":["Event-driven architecture","CQRS","Saga pattern","Outbox pattern","Rate limiting","Circuit breakers","Bulkheads"]},{"layer":4,"module":"Production Readiness","goal":"Turn diagrams into operable systems.","topics":["SLOs and SLIs","Observability","Incident response","Capacity planning","Security design review","Cost modeling","Disaster recovery"]},{"layer":5,"module":"Case Studies and Design Reviews","goal":"Build real design judgment.","topics":["Design a URL shortener","Design a distributed cache","Design a payment system","Design a notification system","Production readiness review"]}],"priorityTopics":[{"slug":"latency-throughput-capacity","title":"Latency, Throughput, and Capacity","layer":0,"tier":1,"prerequisites":[],"katex":["throughput = \\frac{requests}{second}"],"diagram":"Request timeline with queueing, service time, and response time","exercise":"Estimate required servers for a workload."},{"slug":"littles-law","title":"Little's Law for System Design","layer":0,"tier":1,"prerequisites":["latency-throughput-capacity"],"katex":["L = \\lambda W"],"diagram":"Queue with arrivals, waiting, and in-flight requests","exercise":"Estimate concurrent requests from RPS and latency."},{"slug":"availability","title":"Availability and Reliability","layer":0,"tier":1,"prerequisites":["probability-basics"],"katex":["A = \\frac{MTBF}{MTBF + MTTR}"],"diagram":"Failure and recovery timeline","exercise":"Compare downtime budgets for 99.9%, 99.99%, and 99.999%."},{"slug":"caching","title":"Caching","layer":1,"tier":1,"prerequisites":["latency-throughput-capacity"],"katex":["E[T] = hT_{cache} + (1-h)T_{origin}"],"diagram":"Cache-aside read path","exercise":"Design cache keys, TTLs, invalidation, and stampede protection."},{"slug":"idempotency","title":"Idempotency","layer":2,"tier":1,"prerequisites":["http-apis","retries"],"katex":["f(f(x)) = f(x)"],"diagram":"Client retry with idempotency key","exercise":"Design idempotent payment creation."},{"slug":"slo-sli-error-budget","title":"SLOs, SLIs, and Error Budgets","layer":4,"tier":1,"prerequisites":["availability","observability-basics"],"katex":["error\\ budget = 1 - SLO"],"diagram":"User journey -> SLI -> SLO -> alert","exercise":"Define SLOs for an API and background job."}]},{"site":"cudapath","positioning":"CUDAPath is a rigorous, profiler-driven path from C++/systems fundamentals to high-performance GPU kernels.","launchTarget":{"topicPages":40,"labs":8,"diagnostics":1},"canonicalReferences":[],"appliedReferences":[],"linkingPlan":[],"pedagogyPlan":[],"sourcePolicy":["Use NVIDIA CUDA Programming Guide, CUDA Best Practices Guide, and Nsight Compute documentation as the canonical spine.","Every performance claim must be tied to official docs, a measured local benchmark, or a clearly labeled illustrative example.","State hardware, CUDA version, problem size, memory layout, and measurement method for benchmarks."],"modules":[{"layer":0,"module":"Systems and C++ Foundations","goal":"Give learners enough systems/C++ knowledge to write and reason about kernels.","topics":["C++ pointers, arrays, alignment, and aliasing","Row-major layout and multidimensional indexing","Floating-point arithmetic and numerical error","Parallel decomposition"]},{"layer":1,"module":"CUDA Programming Model","goal":"Understand the execution model before optimizing anything.","topics":["Host vs device execution","Kernels, grids, blocks, threads","Thread indexing formulas","Warps and SIMT execution","Device memory allocation and transfers"]},{"layer":2,"module":"Memory Systems and Throughput","goal":"Teach the real bottleneck: moving data efficiently.","topics":["Global memory access patterns","Memory coalescing","Shared memory","Bank conflicts","Registers and local memory spills","Arithmetic intensity and roofline thinking"]},{"layer":3,"module":"Kernel Patterns","goal":"Teach reusable GPU algorithm patterns.","topics":["Parallel reduction","Prefix scan","Tiled matrix multiplication","Convolution and stencil kernels","Warp-level primitives"]},{"layer":4,"module":"Profiling and Optimization","goal":"Move learners from guessing to measurement.","topics":["Nsight Systems vs Nsight Compute","Occupancy vs achieved occupancy","Memory throughput diagnosis","Warp divergence diagnosis","Benchmark hygiene"]},{"layer":5,"module":"Applied GPU Engineering","goal":"Connect CUDA to real production and ML/HPC workloads.","topics":["Custom PyTorch CUDA extensions","cuBLAS and cuDNN baselines","Tensor Cores and mixed precision","Streams and overlapping copy/compute","CUDA graphs"]}],"priorityTopics":[{"slug":"cuda-thread-indexing","title":"CUDA Thread Indexing","layer":1,"tier":1,"prerequisites":["row-major-layout","integer-arithmetic"],"katex":["i = blockIdx.x \\cdot blockDim.x + threadIdx.x"],"diagram":"Grid -> block -> thread hierarchy","lab":"Write vector add and verify each thread owns one element."},{"slug":"memory-coalescing","title":"Memory Coalescing","layer":2,"tier":1,"prerequisites":["cuda-memory-hierarchy","warps-and-simt"],"diagram":"Warp accessing contiguous vs strided addresses","lab":"Benchmark contiguous, stride-2, and stride-32 loads."},{"slug":"parallel-reduction","title":"Parallel Reduction","layer":3,"tier":1,"prerequisites":["shared-memory","synchronization","warps-and-simt"],"diagram":"Tree reduction inside a block","lab":"Implement naive, shared-memory, and warp-level reduction."},{"slug":"roofline-model","title":"Roofline Model for CUDA Kernels","layer":3,"tier":2,"prerequisites":["memory-throughput","floating-point-throughput"],"katex":["P \\le \\min(P_{peak}, I \\cdot B_{peak})"],"diagram":"Arithmetic intensity vs attainable performance","lab":"Classify vector add, reduction, and matmul."},{"slug":"nsight-compute-first-profile","title":"First Nsight Compute Profile","layer":4,"tier":1,"prerequisites":["cuda-kernels","memory-coalescing"],"diagram":"Kernel -> metrics -> bottleneck hypothesis -> next experiment","lab":"Profile vector add and identify memory throughput limit."}]},{"site":"ioipath","positioning":"IOIPath is a rigorous path from programming fundamentals to IOI-level algorithmic problem solving: constraints, models, proofs, implementations, subtasks, and contest execution.","launchTarget":{"topicPages":45,"labs":12,"exercises":80,"diagnostics":1},"canonicalReferences":[],"appliedReferences":[],"linkingPlan":[],"pedagogyPlan":[],"sourcePolicy":["Use the official IOI syllabus as the canonical scope authority.","Use official IOI contest archives for practice references.","Use CP-Algorithms, CSES, and USACO Guide as applied references, not syllabus authority.","Mark broader CP topics as out-of-scope when they are excluded or outside focus for IOI."],"modules":[{"layer":0,"module":"Programming and Contest Mechanics","goal":"Make students able to implement correct programs under contest constraints.","topics":["C++ contest setup","Fast input/output","Integer types and overflow","Testing small cases and random stress tests","Reading constraints and inferring complexity"]},{"layer":1,"module":"Core Algorithmic Moves","goal":"Teach the first transformations from brute force to accepted solution.","topics":["Prefix sums","Binary search on answer","Two pointers","Greedy algorithms","Exchange arguments","Divide and conquer"]},{"layer":2,"module":"Data Structures for IOI","goal":"Use data structures as contest tools.","topics":["Priority queues","Disjoint set union","Fenwick trees","Segment trees","Lazy propagation","Coordinate compression"]},{"layer":3,"module":"Graph Algorithms and Trees","goal":"Build the graph toolkit that appears repeatedly in IOI tasks.","topics":["BFS and DFS","Topological ordering","Shortest paths","Minimum spanning trees","Lowest common ancestor","Tree DP"]},{"layer":4,"module":"Dynamic Programming and Optimization","goal":"Train state design, transition design, proof, and compression.","topics":["DP states and transitions","Knapsack DP","LIS and sequence DP","Tree DP","Bitmask DP","DP with data structures"]},{"layer":5,"module":"IOI-Level Synthesis","goal":"Handle unfamiliar tasks with models, subtasks, proofs, and implementation-risk control.","topics":["Subtask-driven discovery","Partial scoring strategy","Interactive and grader-based tasks","Stress testing","Mock IOI day strategy"]}],"priorityTopics":[{"slug":"constraint-reading","title":"Reading Constraints to Infer Complexity","layer":0,"tier":1,"prerequisites":["big-o-basics","loops-and-arrays"],"katex":["10^5 \\Rightarrow O(n \\log n) \\text{ is usually plausible}","10^3 \\Rightarrow O(n^2) \\text{ may be plausible}"],"diagram":"Input size -> candidate complexity -> algorithm family","lab":"Given 20 task constraints, predict acceptable complexity before solving."},{"slug":"binary-search-on-answer","title":"Binary Search on Answer","layer":1,"tier":1,"prerequisites":["binary-search","monotonic-predicates"],"katex":["P(x)=\\text{true} \\Rightarrow P(y)=\\text{true for all } y\\ge x"],"diagram":"False false false true true true decision boundary","lab":"Solve minimum feasible capacity with a monotone checker."},{"slug":"disjoint-set-union","title":"Disjoint Set Union","layer":2,"tier":1,"prerequisites":["sets","trees"],"katex":["find(x)","union(a,b)"],"diagram":"Forest with parent pointers and path compression","lab":"Maintain connected components under edge insertions."},{"slug":"dijkstra-shortest-paths","title":"Dijkstra's Algorithm","layer":3,"tier":1,"prerequisites":["graphs","priority-queues","greedy-exchange-arguments"],"katex":["dist[v] = \\min_{p:s\\to v} w(p)"],"diagram":"Settled nodes, frontier, priority queue","lab":"Implement Dijkstra and test against Bellman-Ford on small graphs."},{"slug":"dp-state-design","title":"Dynamic Programming State Design","layer":4,"tier":1,"prerequisites":["recursion","induction","arrays"],"katex":["dp[state] = \\min_{prev \\to state} dp[prev] + cost(prev,state)"],"diagram":"State graph with transitions","lab":"Convert recursive recurrence to bottom-up DP."}]},{"site":"putnampath","positioning":"PutnamPath is a proof-first undergraduate problem-solving graph: from olympiad-style moves to analysis, algebra, linear algebra, combinatorics, number theory, and probability under Putnam constraints.","launchTarget":{"topicPages":50,"exercises":120,"diagnostics":1},"canonicalReferences":[],"appliedReferences":[],"linkingPlan":[],"pedagogyPlan":[],"sourcePolicy":["Use the MAA Putnam archive as canonical for official problems and solutions.","Link to official year/problem identifiers; do not copy official problems or solutions in full.","Use Putnam and Beyond, Engel, and Zeitz as secondary pedagogy sources.","Make session strategy configurable because the official format changed for 2026."],"modules":[{"layer":0,"module":"Proof Language and Contest Technique","goal":"Make students able to write complete, compact, rigorous contest proofs.","topics":["Direct proof","Contradiction and contrapositive","Strong induction","Extremal principle","Invariants and monovariants","Casework discipline"]},{"layer":1,"module":"Core Undergraduate Objects","goal":"Build fluency with the objects that Putnam problems actually use.","topics":["Integers and congruences","Polynomials","Sequences and series","Matrices and linear maps","Finite probability spaces"]},{"layer":2,"module":"Theorem Bank","goal":"Make standard undergraduate theorems usable under contest pressure.","topics":["Intermediate value theorem","Mean value theorem","Taylor expansion with remainder","Cauchy-Schwarz","Eigenvalues and diagonalization","Generating functions"]},{"layer":3,"module":"Putnam Problem-Solving Moves","goal":"Teach recognition and transformation, not theorem memorization.","topics":["Look at small cases","Strengthen the induction hypothesis","Exploit symmetry","Use compactness to force extrema","Find the equality case first"]},{"layer":4,"module":"Domain Synthesis","goal":"Handle mixed Putnam problems that combine several areas.","topics":["Analysis and inequalities","Linear algebra and combinatorics","Number theory and polynomials","Probability and expectation"]},{"layer":5,"module":"Putnam Readiness","goal":"Train scoring, proof compression, session strategy, and postmortem review.","topics":["A1/B1 first-solve strategy","Partial-credit proof fragments","Writing a 10-point solution","Mock session review"]}],"priorityTopics":[{"slug":"putnam-proof-writing","title":"Putnam Proof Writing","layer":0,"tier":1,"prerequisites":["direct-proof","contradiction"],"diagram":"Claim -> justification -> conclusion -> no hidden gap","practice":"Rewrite incomplete arguments into full-score solutions."},{"slug":"compactness-putnam","title":"Compactness in Putnam Problems","layer":2,"tier":2,"prerequisites":["sequences-and-limits","continuity"],"katex":["K \\subset \\mathbb R^n \\text{ compact} \\Rightarrow f(K) \\text{ attains max/min}"],"diagram":"Closed bounded set with continuous function attaining extrema","practice":"Existence and extremal-value problems."},{"slug":"eigenvalues-diagonalization","title":"Eigenvalues and Diagonalization","layer":2,"tier":1,"prerequisites":["linear-maps-and-change-of-basis","polynomials"],"katex":["Av=\\lambda v","A=PDP^{-1}"],"diagram":"Matrix action decomposed along eigenvectors","practice":"Powers of matrices, recurrences, and invariant subspaces."},{"slug":"expectation-method","title":"Linearity of Expectation and the Probabilistic Method","layer":3,"tier":2,"prerequisites":["finite-probability","random-variables"],"katex":["\\mathbb E\\left[\\sum_i X_i\\right]=\\sum_i\\mathbb E[X_i]"],"diagram":"Random construction -> expected value -> existence","practice":"Existence proofs without constructing the object."}]},{"site":"imopath","positioning":"IMOPath is a proof-first olympiad training graph from contest fundamentals to shortlist-level synthesis.","launchTarget":{"topicPages":50,"exercises":80,"diagnostics":1},"canonicalReferences":[],"appliedReferences":[],"linkingPlan":[],"pedagogyPlan":[],"sourcePolicy":["Use the official IMO archive as the primary contest source.","Use Evan Chen and Yufei Zhao as high-quality secondary pedagogy references.","Write original exposition and do not copy long official solutions."],"modules":[{"layer":0,"module":"Proof and Problem Language","goal":"Build proof fluency before hard techniques.","topics":["Direct proof","Proof by contradiction","Induction","Extremal principle","Invariants and monovariants","Pigeonhole principle"]},{"layer":1,"module":"Core Domains","goal":"Give the four olympiad pillars clean foundations.","topics":["Inequalities","Functional equations","Divisibility","Congruences","Euclidean geometry foundations","Counting and double counting"]},{"layer":2,"module":"Standard Lemma Bank","goal":"Make common tools recallable and usable.","topics":["Vieta jumping","LTE and valuations","Fermat, Euler, Wilson","AM-GM, Cauchy, Jensen","Ceva and Menelaus","Power of a point"]},{"layer":3,"module":"Problem-Solving Techniques","goal":"Teach move selection, not just theorem recall.","topics":["Bounding and equality cases","Transformations and substitutions","Descent","Auxiliary constructions","Local-to-global arguments"]},{"layer":4,"module":"Mixed Olympiad Synthesis","goal":"Train contest-level recognition and proof construction.","topics":["Algebra-number theory hybrids","Geometry inequality hybrids","Functional equation strategy","Shortlist problem deconstruction"]},{"layer":5,"module":"IMO Readiness","goal":"Simulate real contest demands and train judgment.","topics":["Problem ordering under time pressure","Partial progress strategy","Writing official-style solutions","Common proof gaps"]}],"priorityTopics":[{"slug":"proof-by-induction","title":"Proof by Induction","layer":0,"tier":1,"prerequisites":["direct-proof"],"katex":["P(1)","P(n) \\Rightarrow P(n+1)"],"diagram":"Domino chain of implications","practice":"Prove divisibility, inequalities, and recurrence claims."},{"slug":"extremal-principle","title":"Extremal Principle","layer":0,"tier":1,"prerequisites":["proof-by-contradiction"],"diagram":"Choose minimal/maximal object -> derive impossible smaller/larger object","practice":"Geometry, graph, and number theory examples."},{"slug":"modular-arithmetic","title":"Modular Arithmetic","layer":1,"tier":1,"prerequisites":["divisibility"],"katex":["a \\equiv b \\pmod n"],"diagram":"Integer line wrapped into residue classes","practice":"Congruence manipulation and obstruction finding."},{"slug":"ceva-menelaus","title":"Ceva and Menelaus","layer":2,"tier":1,"prerequisites":["triangle-ratios","directed-lengths"],"katex":["\\frac{BD}{DC}\\frac{CE}{EA}\\frac{AF}{FB}=1"],"diagram":"Triangle cevians and transversals","practice":"Concurrency and collinearity problems."}]},{"site":"economicspath","positioning":"EconomicsPath presents economics as a methodological field with econometrics as the spine: identification under named assumptions, the credibility revolution and its modern machine-learning extension, policy-relevant subfields, and the history of economic thought that ties them together.","launchTarget":{"topicPages":70,"exercises":250,"diagnostics":1},"canonicalReferences":["Wooldridge, Econometric Analysis of Cross Section and Panel Data.","Hayashi, Econometrics.","Hansen, Econometrics.","Angrist and Pischke, Mostly Harmless Econometrics.","Angrist and Pischke, Mastering 'Metrics.","Mas-Colell, Whinston, and Green, Microeconomic Theory.","Romer, Advanced Macroeconomics.","Hamilton, Time Series Analysis.","Fudenberg and Tirole, Game Theory.","Kahneman, Thinking, Fast and Slow."],"appliedReferences":[],"linkingPlan":["EconomicsPath owns economic interpretation, identification strategy, policy context, and named assumptions.","TheoremPath owns the technical machinery for probability, statistics, optimization, and machine-learning theory.","ProbabilityPath and StatisticsPath receive mathematical-prerequisite links; PhilosophyPath receives methodology and rational-choice framing links.","Do not duplicate TheoremPath technical pages. Link to them when the math is load-bearing."],"pedagogyPlan":["Default register is first-year graduate, with Layer-0 pages used as reference surfaces rather than the editorial center.","Every causal page names the estimand, population, identifying assumption, and threats to identification before discussing estimates.","Every coefficient discussion distinguishes estimand from estimator.","No page gives investment recommendations, portfolio advice, trading strategies, or partisan policy advocacy."],"sourcePolicy":["Anchor methods pages in graduate econometrics texts and peer-reviewed methods papers.","Use named programs only for PhD-training claims; never generalize from a single department page.","Date 2026 research-frontier claims and cite primary sources.","Keep finance content academic: asset-pricing research is in scope, retail advice is out."],"modules":[{"layer":0,"module":"Economic Reference Layer","goal":"Give learners precise language for high-search economics concepts without becoming a popular-economics blog.","topics":["What is economics?","Supply and demand","GDP and national accounts","Inflation and unemployment","Public goods and externalities","Comparative advantage"]},{"layer":1,"module":"Credibility-Revolution Methods","goal":"Teach causal identification as the central methodological question in applied economics.","topics":["Instrumental variables","Regression discontinuity","Difference-in-differences","Synthetic control","Randomized controlled trials","External validity"]},{"layer":2,"module":"Econometrics and Machine Learning","goal":"Bridge modern ML methods into econometric interpretation without blurring causality and prediction.","topics":["Double-debiased ML","Causal forests","Heterogeneous treatment effects","High-dimensional synthetic control","Text as data in economics","Forecasting with ML"]},{"layer":3,"module":"Core Fields","goal":"Map micro, macro, public, labor, development, trade, IO, health, urban, and environmental economics.","topics":["Microeconomics overview","Macroeconomics overview","Public economics","Labor economics","Development economics","Industrial organization"]},{"layer":4,"module":"Behavior and Institutions","goal":"Cover behavioral, experimental, institutional, ecological, feminist, Marxian, and post-Keynesian research programs with source discipline.","topics":["Behavioral economics","Experimental economics","Institutions","Post-Keynesian economics","Ecological economics","History of economic thought"]},{"layer":5,"module":"Graduate Companion","goal":"Help serious learners read economics papers, build field lists, and understand doctoral-training milestones without claiming to replace them.","topics":["Reading economics papers","Replicating empirical papers","Field reading lists","Comprehensive exams","Dissertation proposals","Job-market overview"]}],"priorityTopics":[{"slug":"instrumental-variables","title":"Instrumental Variables","layer":1,"tier":1,"prerequisites":["linear-regression","causal-identification"],"katex":["E[Z\\varepsilon]=0","Cov(Z, X) \\ne 0"],"diagram":"Instrument shifts treatment but affects outcome only through treatment","exercise":"State relevance, exclusion, monotonicity, and the estimand before interpreting an IV estimate.","crossSiteLinks":{"theorempath":["linear-regression","causal-inference"]}},{"slug":"regression-discontinuity-design","title":"Regression Discontinuity Design","layer":1,"tier":1,"prerequisites":["local-linear-regression","causal-identification"],"diagram":"Outcome on both sides of a treatment cutoff with a local jump","exercise":"Compare sharp and fuzzy RD assumptions near the cutoff."},{"slug":"difference-in-differences","title":"Difference-in-Differences","layer":1,"tier":1,"prerequisites":["panel-data","counterfactual-trends"],"katex":["\\Delta Y_{treated}-\\Delta Y_{control}"],"diagram":"Treatment and control trends before and after policy adoption","exercise":"Name the parallel-trends assumption and two ways it can fail."},{"slug":"synthetic-control-method","title":"Synthetic Control Method","layer":1,"tier":1,"prerequisites":["panel-data","convex-combinations"],"diagram":"Weighted donor pool matching a treated unit before intervention","exercise":"Explain what pre-treatment fit can and cannot justify."},{"slug":"the-credibility-revolution-overview","title":"The Credibility Revolution","layer":1,"tier":1,"prerequisites":["causal-identification"],"diagram":"RCT, IV, RD, DiD, and synthetic-control designs around an estimand","practice":"Classify an empirical paper by its identification strategy."},{"slug":"double-debiased-ml-for-economists","title":"Double-Debiased ML for Economists","layer":2,"tier":1,"prerequisites":["orthogonalization","causal-identification"],"katex":["\\psi(W;\\theta,\\eta)","\\partial_\\eta E[\\psi(W;\\theta_0,\\eta_0)] = 0"],"diagram":"Nuisance models feeding an orthogonal score","exercise":"Separate the nuisance-prediction task from the target causal parameter.","crossSiteLinks":{"theorempath":["double-debiased-machine-learning"]}},{"slug":"causal-forests-explained","title":"Causal Forests Explained","layer":2,"tier":1,"prerequisites":["random-forests","heterogeneous-treatment-effects"],"diagram":"Feature splits designed to estimate treatment-effect heterogeneity","practice":"Distinguish prediction of outcomes from estimation of conditional treatment effects."},{"slug":"gdp-explained","title":"GDP Explained","layer":0,"tier":2,"prerequisites":[],"katex":["Y = C + I + G + NX"],"diagram":"Expenditure components flowing into national output","exercise":"Classify transactions as consumption, investment, government spending, or net exports."},{"slug":"external-validity-in-economics","title":"External Validity in Economics","layer":1,"tier":1,"prerequisites":["estimands","treatment-effects"],"diagram":"Study population, target population, and transfer conditions","practice":"Name why a clean local estimate may not identify the policy target elsewhere."},{"slug":"what-is-an-economics-phd-comprehensive-exam","title":"What Is an Economics PhD Comprehensive Exam?","layer":1,"tier":2,"prerequisites":["graduate-micro","graduate-macro","graduate-econometrics"],"diagram":"Coursework, comprehensive exam, field sequence, dissertation proposal","exercise":"Compare comp-exam requirements across named programs without overgeneralizing."}]},{"site":"calculuspath","positioning":"CalculusPath is a rigorous but learner-facing path from limits and derivatives to multivariable calculus, vector calculus, series, ODEs, and the real-analysis on-ramp needed by TheoremPath, ProbabilityPath, StatisticsPath, ActuaryPath, and CUDAPath.","launchTarget":{"topicPages":45,"exercises":500,"diagnostics":1},"canonicalReferences":["Apostol, Calculus, Volumes 1-2.","Spivak, Calculus.","Stewart, Calculus: Early Transcendentals.","Thomas, Weir, Hass, Thomas' Calculus.","Marsden and Tromba, Vector Calculus.","Hubbard and Hubbard, Vector Calculus, Linear Algebra, and Differential Forms.","Abbott, Understanding Analysis.","Rudin, Principles of Mathematical Analysis.","Boyce and DiPrima, Elementary Differential Equations and Boundary Value Problems.","Paul's Online Notes as an open applied reference, never as the only authority."],"appliedReferences":[],"linkingPlan":["CalculusPath owns computational and learner-facing calculus; TheoremPath owns rigorous theorem statements and ML-theory uses.","The first visible cross-links should target chain rule, gradients, Hessians, Taylor expansion, integration/change of variables, and vector calculus for backpropagation and optimization.","ActuaryPath links to interest, annuities, survival integrals, and hazard-rate calculus; StatisticsPath links to likelihood derivatives and Fisher information.","GeometryPath receives vector-calculus and differential-forms handoffs only when the geometric structure is genuinely load-bearing."],"pedagogyPlan":["Every topic starts with a worked computational example, then gives the formal statement, then a diagnostic that maps common errors to prerequisite gaps.","Question pools are generated as original problems; AP/CLEP/IB/A-Level questions are cited only by source and never reproduced.","Adaptive practice should use mastery bands for derivative rules, integration methods, multivariable notation, and convergence tests before moving to mixed problems."],"sourcePolicy":["Cite textbook chapter/section where the standard theorem or technique is introduced.","Use TheoremPath links for epsilon-delta, compactness, convergence, optimization, and measure-theory depth.","Do not copy standardized exam questions or textbook exercises.","Separate computational rules of thumb from theorem-level claims."],"modules":[{"layer":0,"module":"Functions, Limits, and Notation","goal":"Establish the language of functions, limits, continuity, and rates before differentiation.","topics":["Functions and graphs","Limit laws","One-sided limits","Continuity","Epsilon-delta proofs","Asymptotic notation for calculus"]},{"layer":1,"module":"Derivatives and Local Linearization","goal":"Make derivatives feel like local linear models, not symbol games.","topics":["Derivative definition","Product, quotient, and chain rules","Implicit differentiation","Inverse functions","Taylor approximation","Optimization in one variable"]},{"layer":2,"module":"Integration and Accumulation","goal":"Connect antiderivatives, area, change of variables, and accumulation models.","topics":["Riemann sums","Fundamental theorem of calculus","Substitution","Integration by parts","Improper integrals","Numerical integration"]},{"layer":3,"module":"Sequences, Series, and Approximation","goal":"Teach convergence and approximation with enough rigor for analysis and probability.","topics":["Sequences and monotone convergence","Series convergence tests","Power series","Taylor series with remainder","Uniform convergence intuition"]},{"layer":4,"module":"Multivariable Calculus","goal":"Prepare learners for optimization, statistics, ML, and differential geometry.","topics":["Partial derivatives","Gradient and directional derivative","Jacobian and Hessian","Multivariable chain rule","Constrained optimization and Lagrange multipliers","Change of variables"]},{"layer":5,"module":"Vector Calculus and ODE On-Ramp","goal":"Bridge calculus to geometry, physics, dynamical systems, and ML models.","topics":["Line integrals","Divergence and curl","Green's theorem","Stokes' theorem","Divergence theorem","First-order ODEs"]}],"priorityTopics":[{"slug":"chain-rule","title":"The Chain Rule","layer":1,"tier":1,"prerequisites":["derivative-definition","function-composition"],"katex":["(f \\circ g)'(x)=f'(g(x))g'(x)"],"diagram":"Input -> inner function -> outer function -> rate propagation","exercise":"Differentiate nested elementary functions and explain the inner-rate factor.","crossSiteLinks":{"theorempath":["vector-calculus-chain-rule"]}},{"slug":"gradient-and-directional-derivative","title":"Gradient and Directional Derivatives","layer":4,"tier":1,"prerequisites":["partial-derivatives","vectors"],"katex":["D_u f(x)=\\nabla f(x)\\cdot u"],"diagram":"Level curves with gradient normal to the curve","exercise":"Compute steepest-ascent direction and compare with coordinate partials.","crossSiteLinks":{"theorempath":["gradient-descent-variants","matrix-calculus"]}},{"slug":"taylor-series-with-remainder","title":"Taylor Series with Remainder","layer":3,"tier":1,"prerequisites":["derivatives","sequences-and-series"],"katex":["f(x)=\\sum_{k=0}^{n}\\frac{f^{(k)}(a)}{k!}(x-a)^k+R_n(x)"],"diagram":"Function approximated by local polynomial plus error band","exercise":"Approximate exponential and bound the remainder.","crossSiteLinks":{"theorempath":["taylor-expansion"]}},{"slug":"integration-and-change-of-variables","title":"Integration and Change of Variables","layer":2,"tier":1,"prerequisites":["fundamental-theorem-of-calculus","substitution"],"katex":["\\int_a^b f(g(x))g'(x)\\,dx=\\int_{g(a)}^{g(b)} f(u)\\,du"],"diagram":"Domain interval remapped through substitution","exercise":"Use substitution to compute probability-density integrals."},{"slug":"lagrange-multipliers","title":"Lagrange Multipliers","layer":4,"tier":2,"prerequisites":["gradient-and-directional-derivative","level-sets"],"katex":["\\nabla f(x)=\\lambda \\nabla g(x)"],"diagram":"Objective contours tangent to a constraint curve","exercise":"Solve a constrained maximum and identify regularity assumptions.","crossSiteLinks":{"theorempath":["projected-gradient-descent"]}}]},{"site":"geometrypath","positioning":"GeometryPath is the path-network sub-vertical for geometry as structure: Euclidean proof, topology, manifolds, Riemannian geometry, information geometry, optimal transport geometry, and geometric ML.","launchTarget":{"topicPages":30,"labs":6,"diagnostics":1},"canonicalReferences":["Euclid, Elements.","Hilbert, Foundations of Geometry.","Coxeter, Introduction to Geometry.","Munkres, Topology.","Hatcher, Algebraic Topology.","do Carmo, Differential Geometry of Curves and Surfaces.","Lee, Introduction to Smooth Manifolds.","Lee, Riemannian Manifolds: An Introduction to Curvature.","Spivak, A Comprehensive Introduction to Differential Geometry.","Amari and Nagaoka, Methods of Information Geometry.","Villani, Optimal Transport: Old and New.","Bronstein, Bruna, Cohen, and Velickovic, Geometric Deep Learning."],"appliedReferences":[],"linkingPlan":["Until standalone launch, GeometryPath is represented by TheoremPath geometry hubs plus the path-family graph.","TheoremPath owns ML-facing information geometry, optimal transport, and manifold learning pages until the standalone corpus exists.","ProofsPath owns olympiad proof technique; GeometryPath owns the geometric object and structure.","AlgebraPath receives Lie-group and homological-algebra depth; ComputationPath receives homotopy-type-theory and computational topology handoffs."],"pedagogyPlan":["Every geometry page needs a diagram unless the page is purely historical or bibliographic.","Introduce the object visually first, then state the invariant or theorem, then show how coordinates can mislead.","Interactive labs should be lazy-loaded and limited to high-value cases: tangent plane, geodesic, curvature, hyperbolic model, and Fisher metric."],"sourcePolicy":["Use textbook chapter/section citations for classical geometry and topology.","Use original diagrams or generated SVG/Canvas; never copy textbook figures.","State chart, smoothness, regularity, and metric assumptions before applying manifold or Riemannian results.","Label ML-facing geometry as application unless the page proves the geometric theorem directly."],"modules":[{"layer":0,"module":"Euclidean and Axiomatic Geometry","goal":"Ground geometry in constructions, congruence, similarity, and proof.","topics":["Euclid's Elements as method","Axioms and incidence","Congruence and similarity","Circle geometry","Transformations"]},{"layer":1,"module":"Coordinates, Vectors, and Curves","goal":"Connect synthetic geometry to analytic and computational representations.","topics":["Coordinate systems","Vectors and affine spaces","Curves and parametrization","Arc length and curvature","Implicit curves"]},{"layer":2,"module":"Topology Basics","goal":"Teach continuity, connectedness, compactness, and holes before manifolds.","topics":["Open and closed sets","Connectedness","Compactness","Fundamental group","Covering spaces"]},{"layer":3,"module":"Manifolds and Differential Geometry","goal":"Introduce charts, tangent spaces, vector fields, differential forms, and maps.","topics":["Manifolds and charts","Tangent spaces","Vector fields","Differential forms","Lie groups as manifolds"]},{"layer":4,"module":"Riemannian Geometry","goal":"Teach metrics, geodesics, connections, and curvature with ML/physics links.","topics":["Riemannian metrics","Geodesics","Connections","Curvature","Gradient flow on manifolds"]},{"layer":5,"module":"Geometry for ML and Statistics","goal":"Connect geometry to information, transport, equivariance, and representation.","topics":["Information geometry","Optimal transport geometry","Manifold learning","Equivariant deep learning","Hyperbolic embeddings"]}],"priorityTopics":[{"slug":"what-is-a-manifold","title":"What Is a Manifold?","layer":3,"tier":1,"prerequisites":["open-sets","coordinate-systems"],"diagram":"Local coordinate chart pasted onto a curved surface","exercise":"Classify circle, sphere, graph of a function, and crossing lines as manifolds or non-manifolds.","crossSiteLinks":{"theorempath":["non-euclidean-and-hyperbolic-geometry"]}},{"slug":"tangent-space","title":"Tangent Spaces","layer":3,"tier":1,"prerequisites":["what-is-a-manifold","vectors"],"katex":["T_pM"],"diagram":"Tangent plane attached at a point on a surface","exercise":"Compute the tangent space to a level set from a gradient constraint."},{"slug":"riemannian-metric","title":"Riemannian Metrics","layer":4,"tier":1,"prerequisites":["tangent-space","inner-products"],"katex":["g_p(u,v)"],"diagram":"Metric ellipses changing over a surface","exercise":"Compare Euclidean and non-Euclidean path lengths under a position-dependent metric."},{"slug":"information-geometry","title":"Information Geometry","layer":5,"tier":2,"prerequisites":["riemannian-metric","fisher-information"],"katex":["g_{ij}(\\theta)=\\mathbb E_\\theta[\\partial_i\\log p_\\theta(X)\\partial_j\\log p_\\theta(X)]"],"diagram":"Statistical model as a curved parameter manifold","exercise":"Compute the Fisher metric for a one-parameter Bernoulli family.","crossSiteLinks":{"theorempath":["information-geometry","fisher-information"]}}]},{"site":"pedagogypath","positioning":"PedagogyPath is the source-grounded account of how the Path family teaches: cognitive load, retrieval practice, spacing, prerequisite DAGs, FSRS review, BKT mastery, IRT calibration, diagnostics, and intelligent tutoring systems.","launchTarget":{"topicPages":50,"diagnostics":1},"canonicalReferences":["Sweller, Cognitive Load During Problem Solving.","Sweller, van Merrienboer, and Paas, Cognitive Architecture and Instructional Design.","Roediger and Karpicke, Test-Enhanced Learning.","Cepeda et al., Distributed Practice in Verbal Recall Tasks.","Dunlosky et al., Improving Students' Learning With Effective Learning Techniques.","Corbett and Anderson, Knowledge Tracing.","Anderson, Corbett, Koedinger, and Pelletier, Cognitive Tutors.","Lord, Applications of Item Response Theory to Practical Testing Problems.","Embretson and Reise, Item Response Theory for Psychologists.","Rasch, Probabilistic Models for Some Intelligence and Attainment Tests.","Pelanek, Bayesian Knowledge Tracing, Logistic Models, and Beyond.","Polya, How to Solve It.","Bruner, The Process of Education.","Vygotsky, Mind in Society.","Whitehead, The Aims of Education.","Lakatos, Proofs and Refutations."],"appliedReferences":[],"linkingPlan":["PedagogyPath links to TheoremPath for the mathematical machinery behind BKT, IRT, likelihoods, Bayes' rule, and adaptive diagnostics.","PedagogyPath links to ProofsPath for proof-writing heuristics and to PhilosophyPath for figures whose philosophical treatment lives elsewhere.","TheoremPath method and onboarding pages link back to PedagogyPath only after the learner has chosen educator/curriculum goals or has enough activity evidence to make the cross-site link useful."],"pedagogyPlan":["Use method pages for empirical findings, figure pages for educational thinkers, comparison pages for contested methods, and essay pages for TheoremPath architecture.","Every empirical claim must name the study or meta-analysis and state boundary conditions.","Avoid learning-styles, left-brain/right-brain, and generic study-hack framing."],"sourcePolicy":["Prefer peer-reviewed cognitive-science and psychometrics literature over blogs or vendor material.","Separate empirical findings from TheoremPath product choices and from philosophical interpretation.","No clinical, IEP, or individualized educational advice.","No vendor endorsements."],"modules":[{"layer":0,"module":"Foundational Figures","goal":"Read major educational figures through teaching practice while leaving philosophy as such to PhilosophyPath.","topics":["Plato as teacher","Polya and How to Solve It","Dewey on experience and education","Whitehead's rhythm of education","Vygotsky and the zone of proximal development"]},{"layer":1,"module":"Cognitive Science of Learning","goal":"Ground practical instructional choices in empirical learning science.","topics":["Cognitive load theory","Retrieval practice","The spacing effect","Interleaving versus blocking","Worked-example effect"]},{"layer":2,"module":"Curriculum Design","goal":"Translate learning science into sequence, prerequisite structure, diagnostics, and review.","topics":["Prerequisite mapping as a DAG","Scope and sequence","Threshold concepts","Backward design","Diagnostic design"]},{"layer":3,"module":"Assessment Theory","goal":"Explain psychometric machinery for educators without hiding assumptions.","topics":["Item response theory for educators","Rasch model for educators","Classical test theory","Validity and reliability","Bayesian knowledge tracing"]},{"layer":4,"module":"Computational Pedagogy","goal":"Connect adaptive engines, spaced repetition, ITS, and learning analytics to real constraints.","topics":["FSRS spaced repetition","Intelligent tutoring systems","Learning analytics","AI tutors evidence and limits","BKT versus IRT versus FSRS"]},{"layer":5,"module":"Path-Family Pedagogy","goal":"Document why the Path family is built as prerequisite graphs plus source-grounded topic pages.","topics":["The TheoremPath pedagogy thesis","Proof-writing pedagogy","Mathematics pedagogy overview","Programming pedagogy overview"]}],"priorityTopics":[{"slug":"the-theorempath-pedagogy-thesis","title":"The TheoremPath Pedagogy Thesis","layer":5,"tier":1,"prerequisites":[],"diagram":"Prerequisite DAG -> diagnostic -> review scheduler -> mastery model","practice":"Audit a topic page and identify which pedagogical pillar each section serves.","crossSiteLinks":{"theorempath":["methodology"]}},{"slug":"fsrs-spaced-repetition-for-educators","title":"FSRS: Spaced Repetition for Educators","layer":4,"tier":1,"prerequisites":["retrieval-practice","the-spacing-effect"],"katex":["R(t)=e^{-t/S}"],"diagram":"Difficulty, stability, retrievability update loop","practice":"Classify when spaced repetition is the right tool and when a worked problem is required instead."},{"slug":"item-response-theory-for-educators","title":"Item Response Theory for Educators","layer":3,"tier":1,"prerequisites":["probability","logistic-functions"],"katex":["P(X=1\\mid \\theta)=\\frac{1}{1+e^{-(\\theta-b)}}"],"diagram":"Item characteristic curve with ability and difficulty","practice":"Interpret a difficult item, a discriminating item, and a misfit item.","crossSiteLinks":{"theorempath":["fisher-information","cramer-rao-bound"]}}]}]}