{"version":"2026-05-13.path-family.v1","generatedAt":"2026-05-13T06:59:20.133Z","contract":"Seed global concept registry for the Path family. TheoremPath is the formal spine; domain sites provide applied, contest, professional, linguistic, philosophical, or humanities treatments.","count":20,"concepts":[{"id":"proof.induction","name":"Induction","aliases":["mathematical induction","strong induction","inductive proof"],"canonicalSite":"theorempath","canonicalSlug":"basic-logic-and-proof-techniques","domains":["theorempath","dsapath","ioipath","imopath","putnampath"],"tags":["proof","recursion","dynamic programming"],"conceptType":"proof-technique","importance":5,"theoremPathCentrality":5,"canonicalUrl":"https://theorempath.com/topics/basic-logic-and-proof-techniques","treatments":[{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"canonical-treatment","url":"https://theorempath.com/topics/basic-logic-and-proof-techniques"},{"site":"dsapath","siteName":"DSAPath","origin":"https://dsapath.com","relation":"domain-treatment","url":"https://dsapath.com/concepts/proof.induction"},{"site":"ioipath","siteName":"IOIPath","origin":"https://ioipath.com","relation":"domain-treatment","url":"https://ioipath.com/concepts/proof.induction"},{"site":"imopath","siteName":"IMOPath","origin":"https://imopath.com","relation":"domain-treatment","url":"https://imopath.com/concepts/proof.induction"},{"site":"putnampath","siteName":"PutnamPath","origin":"https://putnampath.com","relation":"domain-treatment","url":"https://putnampath.com/concepts/proof.induction"}]},{"id":"proof.invariants","name":"Invariants","aliases":["invariant","loop invariant","state invariant"],"canonicalSite":"theorempath","canonicalSlug":"basic-logic-and-proof-techniques","domains":["theorempath","dsapath","ioipath","imopath","putnampath"],"tags":["proof","algorithms","contest"],"conceptType":"proof-technique","importance":5,"theoremPathCentrality":4,"canonicalUrl":"https://theorempath.com/topics/basic-logic-and-proof-techniques","treatments":[{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"canonical-treatment","url":"https://theorempath.com/topics/basic-logic-and-proof-techniques"},{"site":"dsapath","siteName":"DSAPath","origin":"https://dsapath.com","relation":"domain-treatment","url":"https://dsapath.com/concepts/proof.invariants"},{"site":"ioipath","siteName":"IOIPath","origin":"https://ioipath.com","relation":"domain-treatment","url":"https://ioipath.com/concepts/proof.invariants"},{"site":"imopath","siteName":"IMOPath","origin":"https://imopath.com","relation":"domain-treatment","url":"https://imopath.com/concepts/proof.invariants"},{"site":"putnampath","siteName":"PutnamPath","origin":"https://putnampath.com","relation":"domain-treatment","url":"https://putnampath.com/concepts/proof.invariants"}]},{"id":"probability.bayes_theorem","name":"Bayes' theorem","aliases":["Bayes theorem","Bayesian updating","posterior updating"],"canonicalSite":"theorempath","canonicalSlug":"bayes-theorem","domains":["theorempath","probabilitypath","statisticspath","actuarypath","philosophypath","linguisticspath"],"tags":["probability","inference","epistemology"],"conceptType":"theorem","importance":5,"theoremPathCentrality":5,"canonicalUrl":"https://theorempath.com/topics/bayes-theorem","treatments":[{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"canonical-treatment","url":"https://theorempath.com/topics/bayes-theorem"},{"site":"probabilitypath","siteName":"ProbabilityPath","origin":"https://probabilitypath.com","relation":"domain-treatment","url":"https://probabilitypath.com/concepts/probability.bayes_theorem"},{"site":"statisticspath","siteName":"StatisticsPath","origin":"https://statisticspath.com","relation":"domain-treatment","url":"https://statisticspath.com/concepts/probability.bayes_theorem"},{"site":"actuarypath","siteName":"ActuaryPath","origin":"https://actuarypath.com","relation":"domain-treatment","url":"https://actuarypath.com/concepts/probability.bayes_theorem"},{"site":"philosophypath","siteName":"PhilosophyPath","origin":"https://philosophypath.com","relation":"domain-treatment","url":"https://philosophypath.com/concepts/probability.bayes_theorem"},{"site":"linguisticspath","siteName":"LinguisticsPath","origin":"https://linguisticspath.com","relation":"domain-treatment","url":"https://linguisticspath.com/concepts/probability.bayes_theorem"}]},{"id":"probability.conditional_expectation","name":"Conditional expectation","aliases":["conditional mean","tower property","iterated expectation"],"canonicalSite":"theorempath","canonicalSlug":"conditional-expectation","domains":["theorempath","probabilitypath","statisticspath","actuarypath"],"tags":["probability","statistics","risk"],"conceptType":"definition","importance":5,"theoremPathCentrality":5,"canonicalUrl":"https://theorempath.com/topics/conditional-expectation","treatments":[{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"canonical-treatment","url":"https://theorempath.com/topics/conditional-expectation"},{"site":"probabilitypath","siteName":"ProbabilityPath","origin":"https://probabilitypath.com","relation":"domain-treatment","url":"https://probabilitypath.com/concepts/probability.conditional_expectation"},{"site":"statisticspath","siteName":"StatisticsPath","origin":"https://statisticspath.com","relation":"domain-treatment","url":"https://statisticspath.com/concepts/probability.conditional_expectation"},{"site":"actuarypath","siteName":"ActuaryPath","origin":"https://actuarypath.com","relation":"domain-treatment","url":"https://actuarypath.com/concepts/probability.conditional_expectation"}]},{"id":"stochastic.markov_chains","name":"Markov chains","aliases":["Markov chain","transition matrix","Markov process"],"canonicalSite":"theorempath","canonicalSlug":"markov-chains","domains":["theorempath","probabilitypath","statisticspath","actuarypath","systemdesignpath","linguisticspath"],"tags":["stochastic processes","state transitions","models"],"conceptType":"model","importance":5,"theoremPathCentrality":5,"canonicalUrl":"https://theorempath.com/topics/markov-chains","treatments":[{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"canonical-treatment","url":"https://theorempath.com/topics/markov-chains"},{"site":"probabilitypath","siteName":"ProbabilityPath","origin":"https://probabilitypath.com","relation":"domain-treatment","url":"https://probabilitypath.com/concepts/stochastic.markov_chains"},{"site":"statisticspath","siteName":"StatisticsPath","origin":"https://statisticspath.com","relation":"domain-treatment","url":"https://statisticspath.com/concepts/stochastic.markov_chains"},{"site":"actuarypath","siteName":"ActuaryPath","origin":"https://actuarypath.com","relation":"domain-treatment","url":"https://actuarypath.com/concepts/stochastic.markov_chains"},{"site":"systemdesignpath","siteName":"SystemDesignPath","origin":"https://systemdesignpath.com","relation":"domain-treatment","url":"https://systemdesignpath.com/concepts/stochastic.markov_chains"},{"site":"linguisticspath","siteName":"LinguisticsPath","origin":"https://linguisticspath.com","relation":"domain-treatment","url":"https://linguisticspath.com/concepts/stochastic.markov_chains"}]},{"id":"information.entropy","name":"Entropy","aliases":["Shannon entropy","information entropy","uncertainty"],"canonicalSite":"theorempath","canonicalSlug":"entropy-cross-entropy-and-kl-divergence","domains":["theorempath","probabilitypath","statisticspath","linguisticspath","systemdesignpath"],"tags":["information theory","probability","compression"],"conceptType":"definition","importance":5,"theoremPathCentrality":5,"canonicalUrl":"https://theorempath.com/topics/entropy-cross-entropy-and-kl-divergence","treatments":[{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"canonical-treatment","url":"https://theorempath.com/topics/entropy-cross-entropy-and-kl-divergence"},{"site":"probabilitypath","siteName":"ProbabilityPath","origin":"https://probabilitypath.com","relation":"domain-treatment","url":"https://probabilitypath.com/concepts/information.entropy"},{"site":"statisticspath","siteName":"StatisticsPath","origin":"https://statisticspath.com","relation":"domain-treatment","url":"https://statisticspath.com/concepts/information.entropy"},{"site":"linguisticspath","siteName":"LinguisticsPath","origin":"https://linguisticspath.com","relation":"domain-treatment","url":"https://linguisticspath.com/concepts/information.entropy"},{"site":"systemdesignpath","siteName":"SystemDesignPath","origin":"https://systemdesignpath.com","relation":"domain-treatment","url":"https://systemdesignpath.com/concepts/information.entropy"}]},{"id":"calculus.taylor_expansion","name":"Taylor expansion","aliases":["Taylor theorem","Taylor series","Taylor approximation"],"canonicalSite":"theorempath","canonicalSlug":"calculus-foundations","domains":["theorempath","calculuspath","putnampath","cudapath"],"tags":["calculus","approximation","error"],"conceptType":"theorem","importance":5,"theoremPathCentrality":5,"canonicalUrl":"https://theorempath.com/topics/calculus-foundations","treatments":[{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"canonical-treatment","url":"https://theorempath.com/topics/calculus-foundations"},{"site":"calculuspath","siteName":"CalculusPath","origin":"https://calculuspath.com","relation":"domain-treatment","url":"https://calculuspath.com/concepts/calculus.taylor_expansion"},{"site":"putnampath","siteName":"PutnamPath","origin":"https://putnampath.com","relation":"domain-treatment","url":"https://putnampath.com/concepts/calculus.taylor_expansion"},{"site":"cudapath","siteName":"CUDAPath","origin":"https://cudapath.com","relation":"domain-treatment","url":"https://cudapath.com/concepts/calculus.taylor_expansion"}]},{"id":"analysis.compactness","name":"Compactness","aliases":["compact set","Heine-Borel","extreme value theorem"],"canonicalSite":"theorempath","canonicalSlug":"compactness-and-heine-borel","domains":["theorempath","putnampath","philosophypath"],"tags":["analysis","existence","optimization"],"conceptType":"theorem","importance":4,"theoremPathCentrality":5,"canonicalUrl":"https://theorempath.com/topics/compactness-and-heine-borel","treatments":[{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"canonical-treatment","url":"https://theorempath.com/topics/compactness-and-heine-borel"},{"site":"putnampath","siteName":"PutnamPath","origin":"https://putnampath.com","relation":"domain-treatment","url":"https://putnampath.com/concepts/analysis.compactness"},{"site":"philosophypath","siteName":"PhilosophyPath","origin":"https://philosophypath.com","relation":"domain-treatment","url":"https://philosophypath.com/concepts/analysis.compactness"}]},{"id":"linear_algebra.eigenvalues","name":"Eigenvalues","aliases":["eigenvectors","spectral decomposition","diagonalization"],"canonicalSite":"theorempath","canonicalSlug":"spectral-theory-foundations","domains":["theorempath","putnampath","statisticspath","cudapath"],"tags":["linear algebra","spectral theory"],"conceptType":"definition","importance":5,"theoremPathCentrality":5,"canonicalUrl":"https://theorempath.com/topics/spectral-theory-foundations","treatments":[{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"canonical-treatment","url":"https://theorempath.com/topics/spectral-theory-foundations"},{"site":"putnampath","siteName":"PutnamPath","origin":"https://putnampath.com","relation":"domain-treatment","url":"https://putnampath.com/concepts/linear_algebra.eigenvalues"},{"site":"statisticspath","siteName":"StatisticsPath","origin":"https://statisticspath.com","relation":"domain-treatment","url":"https://statisticspath.com/concepts/linear_algebra.eigenvalues"},{"site":"cudapath","siteName":"CUDAPath","origin":"https://cudapath.com","relation":"domain-treatment","url":"https://cudapath.com/concepts/linear_algebra.eigenvalues"}]},{"id":"graph.shortest_paths.dijkstra","name":"Dijkstra's algorithm","aliases":["Dijkstra","nonnegative shortest paths"],"canonicalSite":"dsapath","canonicalSlug":"dijkstra","domains":["dsapath","ioipath","theorempath"],"tags":["graphs","priority queues","shortest paths"],"conceptType":"algorithm","importance":5,"theoremPathCentrality":2,"canonicalUrl":"https://dsapath.com/topics/dijkstra","treatments":[{"site":"dsapath","siteName":"DSAPath","origin":"https://dsapath.com","relation":"canonical-treatment","url":"https://dsapath.com/topics/dijkstra"},{"site":"ioipath","siteName":"IOIPath","origin":"https://ioipath.com","relation":"domain-treatment","url":"https://ioipath.com/concepts/graph.shortest_paths.dijkstra"},{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"domain-treatment","url":"https://theorempath.com/concepts/graph.shortest_paths.dijkstra"}]},{"id":"data_structure.segment_tree","name":"Segment tree","aliases":["range tree","lazy segment tree"],"canonicalSite":"dsapath","canonicalSlug":"segment-tree","domains":["dsapath","ioipath"],"tags":["data structures","range queries"],"conceptType":"data-structure","importance":4,"theoremPathCentrality":1,"canonicalUrl":"https://dsapath.com/topics/segment-tree","treatments":[{"site":"dsapath","siteName":"DSAPath","origin":"https://dsapath.com","relation":"canonical-treatment","url":"https://dsapath.com/topics/segment-tree"},{"site":"ioipath","siteName":"IOIPath","origin":"https://ioipath.com","relation":"domain-treatment","url":"https://ioipath.com/concepts/data_structure.segment_tree"}]},{"id":"parallel.prefix_scan","name":"Prefix scan","aliases":["scan","prefix sums","parallel scan"],"canonicalSite":"dsapath","canonicalSlug":"prefix-sums","domains":["dsapath","ioipath","cudapath","theorempath"],"tags":["parallel algorithms","arrays","associativity"],"conceptType":"algorithm","importance":5,"theoremPathCentrality":3,"canonicalUrl":"https://dsapath.com/topics/prefix-sums","treatments":[{"site":"dsapath","siteName":"DSAPath","origin":"https://dsapath.com","relation":"canonical-treatment","url":"https://dsapath.com/topics/prefix-sums"},{"site":"ioipath","siteName":"IOIPath","origin":"https://ioipath.com","relation":"domain-treatment","url":"https://ioipath.com/concepts/parallel.prefix_scan"},{"site":"cudapath","siteName":"CUDAPath","origin":"https://cudapath.com","relation":"domain-treatment","url":"https://cudapath.com/concepts/parallel.prefix_scan"},{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"domain-treatment","url":"https://theorempath.com/concepts/parallel.prefix_scan"}]},{"id":"systems.littles_law","name":"Little's Law","aliases":["L = lambda W","queueing law","in-flight requests"],"canonicalSite":"systemdesignpath","canonicalSlug":"littles-law","domains":["systemdesignpath","probabilitypath","theorempath"],"tags":["queueing","capacity","latency"],"conceptType":"theorem","importance":5,"theoremPathCentrality":3,"canonicalUrl":"https://systemdesignpath.com/topics/littles-law","treatments":[{"site":"systemdesignpath","siteName":"SystemDesignPath","origin":"https://systemdesignpath.com","relation":"canonical-treatment","url":"https://systemdesignpath.com/topics/littles-law"},{"site":"probabilitypath","siteName":"ProbabilityPath","origin":"https://probabilitypath.com","relation":"domain-treatment","url":"https://probabilitypath.com/concepts/systems.littles_law"},{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"domain-treatment","url":"https://theorempath.com/concepts/systems.littles_law"}]},{"id":"systems.idempotency","name":"Idempotency","aliases":["idempotent operation","idempotency key","safe retry"],"canonicalSite":"systemdesignpath","canonicalSlug":"idempotency","domains":["systemdesignpath","dsapath","theorempath"],"tags":["distributed systems","retries","functions"],"conceptType":"design-pattern","importance":5,"theoremPathCentrality":2,"canonicalUrl":"https://systemdesignpath.com/topics/idempotency","treatments":[{"site":"systemdesignpath","siteName":"SystemDesignPath","origin":"https://systemdesignpath.com","relation":"canonical-treatment","url":"https://systemdesignpath.com/topics/idempotency"},{"site":"dsapath","siteName":"DSAPath","origin":"https://dsapath.com","relation":"domain-treatment","url":"https://dsapath.com/concepts/systems.idempotency"},{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"domain-treatment","url":"https://theorempath.com/concepts/systems.idempotency"}]},{"id":"gpu.memory_coalescing","name":"CUDA memory coalescing","aliases":["coalesced access","warp memory transactions"],"canonicalSite":"cudapath","canonicalSlug":"memory-coalescing","domains":["cudapath","dsapath","theorempath"],"tags":["cuda","memory","performance"],"conceptType":"method","importance":5,"theoremPathCentrality":1,"canonicalUrl":"https://cudapath.com/topics/memory-coalescing","treatments":[{"site":"cudapath","siteName":"CUDAPath","origin":"https://cudapath.com","relation":"canonical-treatment","url":"https://cudapath.com/topics/memory-coalescing"},{"site":"dsapath","siteName":"DSAPath","origin":"https://dsapath.com","relation":"domain-treatment","url":"https://dsapath.com/concepts/gpu.memory_coalescing"},{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"domain-treatment","url":"https://theorempath.com/concepts/gpu.memory_coalescing"}]},{"id":"olympiad.extremal_principle","name":"Extremal principle","aliases":["minimal counterexample","maximal object","extreme object"],"canonicalSite":"imopath","canonicalSlug":"extremal-principle","domains":["imopath","putnampath","theorempath"],"tags":["contest math","proof technique"],"conceptType":"proof-technique","importance":5,"theoremPathCentrality":3,"canonicalUrl":"https://imopath.com/topics/extremal-principle","treatments":[{"site":"imopath","siteName":"IMOPath","origin":"https://imopath.com","relation":"canonical-treatment","url":"https://imopath.com/topics/extremal-principle"},{"site":"putnampath","siteName":"PutnamPath","origin":"https://putnampath.com","relation":"domain-treatment","url":"https://putnampath.com/concepts/olympiad.extremal_principle"},{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"domain-treatment","url":"https://theorempath.com/concepts/olympiad.extremal_principle"}]},{"id":"olympiad.double_counting","name":"Double counting","aliases":["count two ways","incidence counting"],"canonicalSite":"imopath","canonicalSlug":"double-counting","domains":["imopath","putnampath","theorempath"],"tags":["combinatorics","proof technique"],"conceptType":"proof-technique","importance":5,"theoremPathCentrality":3,"canonicalUrl":"https://imopath.com/topics/double-counting","treatments":[{"site":"imopath","siteName":"IMOPath","origin":"https://imopath.com","relation":"canonical-treatment","url":"https://imopath.com/topics/double-counting"},{"site":"putnampath","siteName":"PutnamPath","origin":"https://putnampath.com","relation":"domain-treatment","url":"https://putnampath.com/concepts/olympiad.double_counting"},{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"domain-treatment","url":"https://theorempath.com/concepts/olympiad.double_counting"}]},{"id":"language.context_free_grammar","name":"Context-free grammar","aliases":["CFG","phrase structure grammar","formal grammar"],"canonicalSite":"linguisticspath","canonicalSlug":"context-free-grammars","domains":["linguisticspath","theorempath","dsapath","computationpath"],"tags":["formal languages","syntax","parsing"],"conceptType":"linguistic-concept","importance":4,"theoremPathCentrality":3,"canonicalUrl":"https://linguisticspath.com/topics/context-free-grammars","treatments":[{"site":"linguisticspath","siteName":"LinguisticsPath","origin":"https://linguisticspath.com","relation":"canonical-treatment","url":"https://linguisticspath.com/topics/context-free-grammars"},{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"domain-treatment","url":"https://theorempath.com/concepts/language.context_free_grammar"},{"site":"dsapath","siteName":"DSAPath","origin":"https://dsapath.com","relation":"domain-treatment","url":"https://dsapath.com/concepts/language.context_free_grammar"},{"site":"computationpath","siteName":"ComputationPath","origin":"https://computationpath.com","relation":"domain-treatment","url":"https://computationpath.com/concepts/language.context_free_grammar"}]},{"id":"philosophy.bayesian_epistemology","name":"Bayesian epistemology","aliases":["belief updating","confirmation theory","Bayesian confirmation"],"canonicalSite":"philosophypath","canonicalSlug":"bayesian-epistemology","domains":["philosophypath","probabilitypath","statisticspath"],"tags":["epistemology","probability","decision theory"],"conceptType":"philosophical-concept","importance":4,"theoremPathCentrality":2,"canonicalUrl":"https://philosophypath.com/topics/bayesian-epistemology","treatments":[{"site":"philosophypath","siteName":"PhilosophyPath","origin":"https://philosophypath.com","relation":"canonical-treatment","url":"https://philosophypath.com/topics/bayesian-epistemology"},{"site":"probabilitypath","siteName":"ProbabilityPath","origin":"https://probabilitypath.com","relation":"domain-treatment","url":"https://probabilitypath.com/concepts/philosophy.bayesian_epistemology"},{"site":"statisticspath","siteName":"StatisticsPath","origin":"https://statisticspath.com","relation":"domain-treatment","url":"https://statisticspath.com/concepts/philosophy.bayesian_epistemology"}]},{"id":"classics.euclid_elements","name":"Euclid's Elements","aliases":["Elements","Euclidean geometry","axiomatic geometry"],"canonicalSite":"classicspath","canonicalSlug":"euclids-elements","domains":["classicspath","theorempath","philosophypath"],"tags":["geometry","history of mathematics","axioms"],"conceptType":"text","importance":3,"theoremPathCentrality":2,"canonicalUrl":"https://classicspath.com/topics/euclids-elements","treatments":[{"site":"classicspath","siteName":"ClassicsPath","origin":"https://classicspath.com","relation":"canonical-treatment","url":"https://classicspath.com/topics/euclids-elements"},{"site":"theorempath","siteName":"TheoremPath","origin":"https://theorempath.com","relation":"domain-treatment","url":"https://theorempath.com/concepts/classics.euclid_elements"},{"site":"philosophypath","siteName":"PhilosophyPath","origin":"https://philosophypath.com","relation":"domain-treatment","url":"https://philosophypath.com/concepts/classics.euclid_elements"}]}]}