universal-physics-tensor 10.0.0 → 12.0.0

package/dist/atlas/diffusion/numerics.js.map

@@ -1 +1 @@
-{"version":3,"file":"numerics.js","sourceRoot":"","sources":["../../../src/atlas/diffusion/numerics.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AAEjE;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IAC7D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC3E,CAAC;AAED,6EAA6E;AAC7E,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS;IACvC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAa,EAAE,CAAS,EAAE,CAAS;IAC1E,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC;IAClD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;AACnC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAY,EAAE,KAAa,EAAE,CAAS,EAAE,CAAS;IACjF,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACnC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzD,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;AAC/D,CAAC;AAwBD;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,EAAU;IACxE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa,EAAE,CAAc;IAC1D,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC;IAClC,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,QAAQ,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IACpD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;IACxC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC;IAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAEhD,IAAI,CAAC,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACjC,IAAI,IAAI,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACpC,wEAAwE;IACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,GAAG,EAAE,CAAC;QAChC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACT,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC;QAC5D,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QACb,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAE,CAAC;AACpB,CAAC;AAeD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAC9B,UAAkB,EAClB,CAAc,EACd,MAA8E;IAE9E,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,UAAU,CAAC;IAC5B,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,GAAW,EAAU,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnE,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxF,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CACnC,GAAW,EACX,CAAc,EACd,MAA8E,EAC9E,SAAS,GAAG,EAAE,EACd,KAAK,GAAG,IAAI;IAEZ,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC;IACnC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,SAAS,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,GAAG,GAAG,EAAE,CAAC;AAClB,CAAC;AAcD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAAkB,EAAE,CAAkB;IACrE,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IAC3B,MAAM,IAAI,GAAG,UAAU,GAAG,IAAI,CAAC;IAC/B,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC;IAC1D,MAAM,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC;IACvB,MAAM,GAAG,GAAG,cAAc,CACxB,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,EACzC,CAAC,CAAC,EAAE,CAAC,CAAC,EACN,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,EACd,EAAE,EAAE,EAAE,CAAC,EAAE,CACV,CAAC;IACF,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC;IAClC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC;IACzB,OAAO,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CAAC,GAAW,EAAE,CAAS,EAAE,CAAS;IACtE,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACxB,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACzB,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IAChC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,2BAA2B,CAAC,GAAW,EAAE,CAAS,EAAE,CAAS;IAC3E,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,GAAG,IAAI,IAAI;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IACnC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AACtC,CAAC;AAgBD;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CACjC,UAAkB,EAClB,CAAqB,EACrB,SAAgD;IAEhD,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC;IACnB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;IACtB,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IACzC,MAAM,IAAI,GAAG,UAAU,GAAG,CAAC,CAAC,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;IACtC,MAAM,EAAE,GAAG,IAAI,GAAG,KAAK,CAAC;IACxB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAChF,IAAI,CAAC,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACjC,IAAI,IAAI,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC9E,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IAClB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC;QACvF,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,0EAA0E;IAC1E,0EAA0E;IAC1E,iEAAiE;IACjE,MAAM,GAAG,GAAG,SAAS,IAAI,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAAE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACpF,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/**\n * Atlas Phase 4, S4.4 — the numerics behind the diffusion family's witnesses.\n *\n * Each function evaluates one claim at a RESOLUTION, so the numeric witness\n * runner can evaluate it twice and record how the error shrank. None of them\n * asserts an order of convergence; the runner reports the ratio and a reviewer\n * reads it (Phase 4 design note §2.3).\n *\n * @module atlas/diffusion/numerics\n */\n\nimport { solveODESystem } from '@danielsimonjr/mathts-functions';\n\n/**\n * The Gaussian solution of `∂c/∂t = D ∂²c/∂x²` from a point source of unit\n * mass, evaluated at `x`: `(4πDt)^{-1/2} exp(−x²/(4Dt))`.\n *\n * @internal\n */\nexport function diffusionKernel(x: number, t: number, D: number): number {\n  return Math.exp(-(x * x) / (4 * D * t)) / Math.sqrt(4 * Math.PI * D * t);\n}\n\n/** `ln C(n, k)` by summing logs — exact enough for the n ≤ 10⁵ used here. */\nfunction logBinomial(n: number, k: number): number {\n  let s = 0;\n  for (let i = 1; i <= k; i++) s += Math.log(n - k + i) - Math.log(i);\n  return s;\n}\n\n/**\n * WD1 — the probability DENSITY at the origin of a symmetric lattice random\n * walk after `steps` steps, under the closure `D = Δx²/(2Δt)` at fixed `D`\n * and `t`.\n *\n * With `Δt = t/steps` and `Δx = √(2DΔt)`, the walker sits at the origin with\n * probability `C(steps, steps/2)/2^steps`. Only every other site is reachable\n * after an even number of steps, so the probability is spread over a cell of\n * width `2Δx`, and the density is that probability divided by `2Δx`.\n * As `steps → ∞` it converges to {@link diffusionKernel}`(0, t, D)`.\n *\n * @param steps - the resolution; rounded up to the next even integer.\n * @internal\n */\nexport function randomWalkCentralDensity(steps: number, D: number, t: number): number {\n  const n = 2 * Math.ceil(steps / 2);\n  const dt = t / n;\n  const dx = Math.sqrt(2 * D * dt);\n  const logP = logBinomial(n, n / 2) - n * Math.LN2;\n  return Math.exp(logP) / (2 * dx);\n}\n\n/**\n * WD1b — the random walk's density at lattice site `site` after `steps` steps\n * (same closure and grid as {@link randomWalkCentralDensity}). Exactly zero\n * outside the light cone `|site| > steps` and on sites of the wrong parity.\n *\n * @internal\n */\nexport function randomWalkDensity(site: number, steps: number, D: number, t: number): number {\n  const n = 2 * Math.ceil(steps / 2);\n  if (Math.abs(site) > n || (site + n) % 2 !== 0) return 0;\n  const dx = Math.sqrt((2 * D * t) / n);\n  const k = (n + site) / 2;\n  return Math.exp(logBinomial(n, k) - n * Math.LN2) / (2 * dx);\n}\n\n/** Parameters of the WD2 heat-conduction fixture. @internal */\nexport interface HeatFixture {\n  /** Thermal conductivity κ. */\n  readonly kappa: number;\n  /** Density ρ. */\n  readonly rho: number;\n  /** Specific heat capacity c_p. */\n  readonly cp: number;\n  /** Initial Gaussian width parameter: `T(x, 0) = exp(−x²/(4 s0))`. */\n  readonly s0: number;\n  /** Final time. */\n  readonly tEnd: number;\n  /**\n   * Half-width of the domain. The edges are held at ZERO, not at the exact\n   * solution: the exact solution is the Fick side of the claim, and feeding it\n   * to the heat solver would leak the dictionary under test into the side that\n   * is supposed to be independent of it. The true edge value is below\n   * `exp(−halfWidth²/(4(s0 + D tEnd)))`, far under the tolerance.\n   */\n  readonly halfWidth: number;\n}\n\n/**\n * The exact solution of the DIFFUSION equation with coefficient `D` from the\n * WD2 initial condition: `√(s0/(s0 + D t)) · exp(−x²/(4(s0 + D t)))`.\n *\n * @internal\n */\nexport function gaussianSpread(x: number, t: number, D: number, s0: number): number {\n  const s = s0 + D * t;\n  return Math.sqrt(s0 / s) * Math.exp(-(x * x) / (4 * s));\n}\n\n/**\n * WD2 — the temperature at `x = 0, t = tEnd` from an explicit FTCS solution of\n * the HEAT equation `ρ c_p ∂T/∂t = κ ∂²T/∂x²` on `cells` intervals.\n *\n * The heat equation is solved in its OWN variables: the step uses `κ`, `ρ` and\n * `c_p`, never a pre-combined `D`. Comparing the result against\n * {@link gaussianSpread} with `D = κ/(ρ c_p)` is what tests the dictionary.\n * The mesh ratio `κΔt/(ρ c_p Δx²)` is held at or below 1/4, inside the FTCS\n * stability limit of 1/2, so refinement halves `Δx` and quarters `Δt`.\n *\n * @param cells - the resolution: the number of spatial intervals (made even so\n * `x = 0` is a node).\n * @internal\n */\nexport function heatFtcsCentre(cells: number, f: HeatFixture): number {\n  const nx = 2 * Math.ceil(cells / 2);\n  const dx = (2 * f.halfWidth) / nx;\n  const capacity = f.rho * f.cp;\n  const dtMax = (0.25 * capacity * dx * dx) / f.kappa;\n  const steps = Math.ceil(f.tEnd / dtMax);\n  const dt = f.tEnd / steps;\n  const r = (f.kappa * dt) / (capacity * dx * dx);\n\n  let u = new Float64Array(nx + 1);\n  let next = new Float64Array(nx + 1);\n  // The initial condition exp(−x²/(4 s0)) involves no diffusivity at all.\n  for (let i = 0; i <= nx; i++) {\n    const x = -f.halfWidth + i * dx;\n    u[i] = Math.exp(-(x * x) / (4 * f.s0));\n  }\n  u[0] = 0;\n  u[nx] = 0;\n  for (let n = 1; n <= steps; n++) {\n    for (let i = 1; i < nx; i++) {\n      next[i] = u[i]! + r * (u[i + 1]! - 2 * u[i]! + u[i - 1]!);\n    }\n    next[0] = 0;\n    next[nx] = 0;\n    [u, next] = [next, u];\n  }\n  return u[nx / 2]!;\n}\n\n/** Parameters of the WD3 Wick-rotation fixture. @internal */\nexport interface WickFixture {\n  readonly hbar: number;\n  readonly m: number;\n  /** Initial width of the α = 0 Gaussian. */\n  readonly s: number;\n  /** The point `(x, τ)` the residual is evaluated at. */\n  readonly x: number;\n  readonly tau: number;\n  /** Base finite-difference step; the resolution divides it. */\n  readonly h0: number;\n}\n\n/**\n * WD3 — the finite-difference residual `|∂_τ φ − (ħ/2m) ∂²_x φ|` of the\n * Wick-rotated free kernel `φ(x, τ)` (`witnesses/quantum-support.ts`, W5) at\n * one point, with step `h = h0/resolution` in both variables.\n *\n * The residual measures whether the Wick rotation `t = −iτ` of the free\n * Schrödinger equation really lands on the DIFFUSION equation with\n * `D = ħ/(2m)`. Its exact value is zero; the finite-difference estimate\n * approaches zero as `h` shrinks, and the runner records how fast.\n *\n * @internal\n */\nexport function wickHeatResidual(\n  resolution: number,\n  f: WickFixture,\n  kernel: (x: number, tau: number, s: number, hbar: number, m: number) => number,\n): number {\n  const h = f.h0 / resolution;\n  const phi = (x: number, tau: number): number => kernel(x, tau, f.s, f.hbar, f.m);\n  const dTau = (phi(f.x, f.tau + h) - phi(f.x, f.tau - h)) / (2 * h);\n  const dXX = (phi(f.x + h, f.tau) - 2 * phi(f.x, f.tau) + phi(f.x - h, f.tau)) / (h * h);\n  return Math.abs(dTau - (f.hbar / (2 * f.m)) * dXX);\n}\n\n/**\n * WD3b — `∫ φ(x, τ)² dx` of the Wick-rotated free kernel, by the trapezoid\n * rule over `[−halfWidth, halfWidth]`. The Schrödinger norm `∫|ψ|² dx` is\n * conserved; this one DECAYS with τ, which is the unitarity the continuation\n * does not preserve.\n *\n * @internal\n */\nexport function wickKernelSquaredNorm(\n  tau: number,\n  f: WickFixture,\n  kernel: (x: number, tau: number, s: number, hbar: number, m: number) => number,\n  halfWidth = 20,\n  cells = 4000,\n): number {\n  const dx = (2 * halfWidth) / cells;\n  let sum = 0;\n  for (let i = 0; i <= cells; i++) {\n    const v = kernel(-halfWidth + i * dx, tau, f.s, f.hbar, f.m);\n    sum += (i === 0 || i === cells ? 0.5 : 1) * v * v;\n  }\n  return sum * dx;\n}\n\n// ── Sprint 4 closure: Langevin, telegraph, steady state ────────────────────\n\n/** Parameters of the Langevin (Ornstein–Uhlenbeck) fixture. @internal */\nexport interface LangevinFixture {\n  /** Particle mass m. */\n  readonly m: number;\n  /** Friction coefficient γ (force per velocity). */\n  readonly gamma: number;\n  /** Thermal energy k_B T. */\n  readonly kT: number;\n}\n\n/**\n * WD4 — `⟨x²⟩(t) / (2Dt)` for the Langevin model `m v̇ = −γv + ξ`,\n * `⟨ξ(t)ξ(t′)⟩ = 2γ k_B T δ(t − t′)`, started from x = 0 with a thermalized\n * velocity, at `t = resolution · τ_p` where `τ_p = m/γ`.\n *\n * The second moments are integrated from the LANGEVIN model's own moment\n * equations, `d⟨x²⟩/dt = 2⟨xv⟩`, `d⟨xv⟩/dt = ⟨v²⟩ − (γ/m)⟨xv⟩`, with\n * `⟨v²⟩ = k_B T/m` held at equipartition, by `solveODESystem` with `dt` on a fine fixed grid. The\n * diffusion coefficient `D = k_B T/γ` (Einstein) enters only the DENOMINATOR:\n * the ratio tends to 1 in the diffusive regime `t ≫ τ_p`.\n *\n * @internal\n */\nexport function langevinMsdRatio(resolution: number, f: LangevinFixture): number {\n  const tauP = f.m / f.gamma;\n  const tEnd = resolution * tauP;\n  const v2 = f.kT / f.m;\n  const steps = Math.max(2000, Math.ceil(200 * resolution));\n  const h = tEnd / steps;\n  const sol = solveODESystem(\n    (_t, y) => [2 * y[1]!, v2 - y[1]! / tauP],\n    [0, 0],\n    [0, steps * h],\n    { dt: h },\n  );\n  const end = sol.y[sol.y.length - 1];\n  const x2 = end?.[0] ?? Number.NaN;\n  const D = f.kT / f.gamma;\n  return x2 / (2 * D * tEnd);\n}\n\n/**\n * The slow decay rate of a Fourier mode of the TELEGRAPH equation\n * `τ u_tt + u_t = D u_xx`, divided by the diffusion rate `D q²`:\n * `(1 − √(1 − 4ε)) / (2ε)` with `ε = τ D q²`. Tends to 1 as τ → 0; complex\n * (oscillatory) for `ε > 1/4`, where it returns NaN.\n *\n * @internal\n */\nexport function telegraphSlowRateRatio(tau: number, D: number, q: number): number {\n  const eps = tau * D * q * q;\n  if (eps === 0) return 1;\n  const disc = 1 - 4 * eps;\n  if (disc < 0) return Number.NaN;\n  return (1 - Math.sqrt(disc)) / (2 * eps);\n}\n\n/**\n * The oscillation frequency of a telegraph mode in its underdamped range,\n * divided by the undamped wave frequency `c q` with `c² = D/τ`:\n * `√(1 − 1/(4ε))`, `ε = τ D q²`. Tends to 1 as ε grows.\n *\n * @internal\n */\nexport function telegraphWaveFrequencyRatio(tau: number, D: number, q: number): number {\n  const eps = tau * D * q * q;\n  if (eps <= 0.25) return Number.NaN;\n  return Math.sqrt(1 - 1 / (4 * eps));\n}\n\n/** Parameters of the WD8 steady-state fixture. @internal */\nexport interface SteadyStateFixture {\n  /** Thermal diffusivity α (= κ/(ρ c_p)). */\n  readonly alpha: number;\n  /** Rod length ℓ. */\n  readonly ell: number;\n  /** End temperatures. */\n  readonly tLeft: number;\n  readonly tRight: number;\n  /** Base time; the resolution multiplies it. */\n  readonly t0: number;\n  readonly cells: number;\n}\n\n/**\n * WD8 — the largest deviation from the LINEAR steady profile (the Laplace\n * equation's solution) of an FTCS heat solution with fixed end temperatures,\n * started from a profile with a sin(πx/ℓ) bump, at `t = resolution · t0`.\n * Tends to zero as t → ∞: the steady state is the heat equation's attractor.\n * `reference` replaces the linear profile the deviation is measured against.\n *\n * @internal\n */\nexport function heatSteadyDeviation(\n  resolution: number,\n  f: SteadyStateFixture,\n  reference?: (i: number, cells: number) => number,\n): number {\n  const nx = f.cells;\n  const dx = f.ell / nx;\n  const dtMax = (0.25 * dx * dx) / f.alpha;\n  const tEnd = resolution * f.t0;\n  const steps = Math.ceil(tEnd / dtMax);\n  const dt = tEnd / steps;\n  const r = (f.alpha * dt) / (dx * dx);\n  const linear = (i: number): number => f.tLeft + ((f.tRight - f.tLeft) * i) / nx;\n  let u = new Float64Array(nx + 1);\n  let next = new Float64Array(nx + 1);\n  for (let i = 0; i <= nx; i++) u[i] = linear(i) + Math.sin((Math.PI * i) / nx);\n  next[0] = f.tLeft;\n  next[nx] = f.tRight;\n  for (let n = 0; n < steps; n++) {\n    for (let i = 1; i < nx; i++) next[i] = u[i]! + r * (u[i + 1]! - 2 * u[i]! + u[i - 1]!);\n    [u, next] = [next, u];\n  }\n  // The deviation is measured against `reference` when given — the negative\n  // control uses a WRONG steady state here — and against the linear Laplace\n  // profile otherwise. The solver itself never sees the reference.\n  const ref = reference ?? ((i: number) => linear(i));\n  let worst = 0;\n  for (let i = 0; i <= nx; i++) worst = Math.max(worst, Math.abs(u[i]! - ref(i, nx)));\n  return worst;\n}\n"]}
+{"version":3,"file":"numerics.js","sourceRoot":"","sources":["../../../src/atlas/diffusion/numerics.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,iCAAiC,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,wCAAwC,CAAC;AACtE,sGAAsG;AACtG,OAAO,EAAE,SAAS,EAAE,MAAM,+BAA+B,CAAC;AAE1D;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IAC7D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC3E,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAa,EAAE,CAAS,EAAE,CAAS;IAC1E,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC;IAChD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;AACnC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAY,EAAE,KAAa,EAAE,CAAS,EAAE,CAAS;IACjF,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACnC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzD,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;AAC7D,CAAC;AAwBD;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,EAAU;IACxE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa,EAAE,CAAc;IAC1D,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC;IAClC,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,QAAQ,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IACpD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;IACxC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC;IAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAEhD,IAAI,CAAC,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACjC,IAAI,IAAI,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACpC,wEAAwE;IACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,GAAG,EAAE,CAAC;QAChC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACT,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC;QAC5D,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QACb,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAE,CAAC;AACpB,CAAC;AAeD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAC9B,UAAkB,EAClB,CAAc,EACd,MAA8E;IAE9E,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,UAAU,CAAC;IAC5B,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,GAAW,EAAU,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnE,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxF,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CACnC,GAAW,EACX,CAAc,EACd,MAA8E,EAC9E,SAAS,GAAG,EAAE,EACd,KAAK,GAAG,IAAI;IAEZ,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC;IACnC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,SAAS,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACrH,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;AAC7B,CAAC;AAcD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAAkB,EAAE,CAAkB;IACrE,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IAC3B,MAAM,IAAI,GAAG,UAAU,GAAG,IAAI,CAAC;IAC/B,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC;IAC1D,MAAM,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC;IACvB,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;IACjG,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC;IAChC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC;IACzB,OAAO,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CAAC,GAAW,EAAE,CAAS,EAAE,CAAS;IACtE,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACxB,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACzB,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IAChC,wFAAwF;IACxF,mEAAmE;IACnE,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AACnC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,uBAAuB,CAAC,GAAW,EAAE,CAAS,EAAE,CAAS;IACvE,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACxB,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACzB,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IAChC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,2BAA2B,CAAC,GAAW,EAAE,CAAS,EAAE,CAAS;IAC3E,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,GAAG,IAAI,IAAI;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IACnC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AACtC,CAAC;AAgBD;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CACjC,UAAkB,EAClB,CAAqB,EACrB,SAAgD;IAEhD,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC;IACnB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;IACtB,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IACzC,MAAM,IAAI,GAAG,UAAU,GAAG,CAAC,CAAC,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;IACtC,MAAM,EAAE,GAAG,IAAI,GAAG,KAAK,CAAC;IACxB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAChF,IAAI,CAAC,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACjC,IAAI,IAAI,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC9E,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IAClB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC;QACvF,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,0EAA0E;IAC1E,0EAA0E;IAC1E,iEAAiE;IACjE,MAAM,GAAG,GAAG,SAAS,IAAI,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;QAAE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACpF,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/**\n * Atlas Phase 4, S4.4 — the numerics behind the diffusion family's witnesses.\n *\n * Each function evaluates one claim at a RESOLUTION, so the numeric witness\n * runner can evaluate it twice and record how the error shrank. None of them\n * asserts an order of convergence; the runner reports the ratio and a reviewer\n * reads it (Phase 4 design note §2.3).\n *\n * @module atlas/diffusion/numerics\n */\n\nimport { trapz } from '@danielsimonjr/mathts-functions';\nimport { integrateRK4 } from '../../numerical/null-ray-integrator.js';\n// `logChoose` is `ln C(n, k)` through MathTS `lgamma`, the one owner of the log binomial coefficient.\nimport { logChoose } from '../../numerical/statistics.js';\n\n/**\n * The Gaussian solution of `∂c/∂t = D ∂²c/∂x²` from a point source of unit\n * mass, evaluated at `x`: `(4πDt)^{-1/2} exp(−x²/(4Dt))`.\n *\n * @internal\n */\nexport function diffusionKernel(x: number, t: number, D: number): number {\n  return Math.exp(-(x * x) / (4 * D * t)) / Math.sqrt(4 * Math.PI * D * t);\n}\n\n/**\n * WD1 — the probability DENSITY at the origin of a symmetric lattice random\n * walk after `steps` steps, under the closure `D = Δx²/(2Δt)` at fixed `D`\n * and `t`.\n *\n * With `Δt = t/steps` and `Δx = √(2DΔt)`, the walker sits at the origin with\n * probability `C(steps, steps/2)/2^steps`. Only every other site is reachable\n * after an even number of steps, so the probability is spread over a cell of\n * width `2Δx`, and the density is that probability divided by `2Δx`.\n * As `steps → ∞` it converges to {@link diffusionKernel}`(0, t, D)`.\n *\n * @param steps - the resolution; rounded up to the next even integer.\n * @internal\n */\nexport function randomWalkCentralDensity(steps: number, D: number, t: number): number {\n  const n = 2 * Math.ceil(steps / 2);\n  const dt = t / n;\n  const dx = Math.sqrt(2 * D * dt);\n  const logP = logChoose(n, n / 2) - n * Math.LN2;\n  return Math.exp(logP) / (2 * dx);\n}\n\n/**\n * WD1b — the random walk's density at lattice site `site` after `steps` steps\n * (same closure and grid as {@link randomWalkCentralDensity}). Exactly zero\n * outside the light cone `|site| > steps` and on sites of the wrong parity.\n *\n * @internal\n */\nexport function randomWalkDensity(site: number, steps: number, D: number, t: number): number {\n  const n = 2 * Math.ceil(steps / 2);\n  if (Math.abs(site) > n || (site + n) % 2 !== 0) return 0;\n  const dx = Math.sqrt((2 * D * t) / n);\n  const k = (n + site) / 2;\n  return Math.exp(logChoose(n, k) - n * Math.LN2) / (2 * dx);\n}\n\n/** Parameters of the WD2 heat-conduction fixture. @internal */\nexport interface HeatFixture {\n  /** Thermal conductivity κ. */\n  readonly kappa: number;\n  /** Density ρ. */\n  readonly rho: number;\n  /** Specific heat capacity c_p. */\n  readonly cp: number;\n  /** Initial Gaussian width parameter: `T(x, 0) = exp(−x²/(4 s0))`. */\n  readonly s0: number;\n  /** Final time. */\n  readonly tEnd: number;\n  /**\n   * Half-width of the domain. The edges are held at ZERO, not at the exact\n   * solution: the exact solution is the Fick side of the claim, and feeding it\n   * to the heat solver would leak the dictionary under test into the side that\n   * is supposed to be independent of it. The true edge value is below\n   * `exp(−halfWidth²/(4(s0 + D tEnd)))`, far under the tolerance.\n   */\n  readonly halfWidth: number;\n}\n\n/**\n * The exact solution of the DIFFUSION equation with coefficient `D` from the\n * WD2 initial condition: `√(s0/(s0 + D t)) · exp(−x²/(4(s0 + D t)))`.\n *\n * @internal\n */\nexport function gaussianSpread(x: number, t: number, D: number, s0: number): number {\n  const s = s0 + D * t;\n  return Math.sqrt(s0 / s) * Math.exp(-(x * x) / (4 * s));\n}\n\n/**\n * WD2 — the temperature at `x = 0, t = tEnd` from an explicit FTCS solution of\n * the HEAT equation `ρ c_p ∂T/∂t = κ ∂²T/∂x²` on `cells` intervals.\n *\n * The heat equation is solved in its OWN variables: the step uses `κ`, `ρ` and\n * `c_p`, never a pre-combined `D`. Comparing the result against\n * {@link gaussianSpread} with `D = κ/(ρ c_p)` is what tests the dictionary.\n * The mesh ratio `κΔt/(ρ c_p Δx²)` is held at or below 1/4, inside the FTCS\n * stability limit of 1/2, so refinement halves `Δx` and quarters `Δt`.\n *\n * @param cells - the resolution: the number of spatial intervals (made even so\n * `x = 0` is a node).\n * @internal\n */\nexport function heatFtcsCentre(cells: number, f: HeatFixture): number {\n  const nx = 2 * Math.ceil(cells / 2);\n  const dx = (2 * f.halfWidth) / nx;\n  const capacity = f.rho * f.cp;\n  const dtMax = (0.25 * capacity * dx * dx) / f.kappa;\n  const steps = Math.ceil(f.tEnd / dtMax);\n  const dt = f.tEnd / steps;\n  const r = (f.kappa * dt) / (capacity * dx * dx);\n\n  let u = new Float64Array(nx + 1);\n  let next = new Float64Array(nx + 1);\n  // The initial condition exp(−x²/(4 s0)) involves no diffusivity at all.\n  for (let i = 0; i <= nx; i++) {\n    const x = -f.halfWidth + i * dx;\n    u[i] = Math.exp(-(x * x) / (4 * f.s0));\n  }\n  u[0] = 0;\n  u[nx] = 0;\n  for (let n = 1; n <= steps; n++) {\n    for (let i = 1; i < nx; i++) {\n      next[i] = u[i]! + r * (u[i + 1]! - 2 * u[i]! + u[i - 1]!);\n    }\n    next[0] = 0;\n    next[nx] = 0;\n    [u, next] = [next, u];\n  }\n  return u[nx / 2]!;\n}\n\n/** Parameters of the WD3 Wick-rotation fixture. @internal */\nexport interface WickFixture {\n  readonly hbar: number;\n  readonly m: number;\n  /** Initial width of the α = 0 Gaussian. */\n  readonly s: number;\n  /** The point `(x, τ)` the residual is evaluated at. */\n  readonly x: number;\n  readonly tau: number;\n  /** Base finite-difference step; the resolution divides it. */\n  readonly h0: number;\n}\n\n/**\n * WD3 — the finite-difference residual `|∂_τ φ − (ħ/2m) ∂²_x φ|` of the\n * Wick-rotated free kernel `φ(x, τ)` (`witnesses/quantum-support.ts`, W5) at\n * one point, with step `h = h0/resolution` in both variables.\n *\n * The residual measures whether the Wick rotation `t = −iτ` of the free\n * Schrödinger equation really lands on the DIFFUSION equation with\n * `D = ħ/(2m)`. Its exact value is zero; the finite-difference estimate\n * approaches zero as `h` shrinks, and the runner records how fast.\n *\n * @internal\n */\nexport function wickHeatResidual(\n  resolution: number,\n  f: WickFixture,\n  kernel: (x: number, tau: number, s: number, hbar: number, m: number) => number,\n): number {\n  const h = f.h0 / resolution;\n  const phi = (x: number, tau: number): number => kernel(x, tau, f.s, f.hbar, f.m);\n  const dTau = (phi(f.x, f.tau + h) - phi(f.x, f.tau - h)) / (2 * h);\n  const dXX = (phi(f.x + h, f.tau) - 2 * phi(f.x, f.tau) + phi(f.x - h, f.tau)) / (h * h);\n  return Math.abs(dTau - (f.hbar / (2 * f.m)) * dXX);\n}\n\n/**\n * WD3b — `∫ φ(x, τ)² dx` of the Wick-rotated free kernel, by the trapezoid\n * rule (MathTS `trapz` on the uniform grid, times its spacing) over\n * `[−halfWidth, halfWidth]`. The Schrödinger norm `∫|ψ|² dx` is conserved;\n * this one DECAYS with τ, which is the unitarity the continuation does not\n * preserve.\n *\n * @internal\n */\nexport function wickKernelSquaredNorm(\n  tau: number,\n  f: WickFixture,\n  kernel: (x: number, tau: number, s: number, hbar: number, m: number) => number,\n  halfWidth = 20,\n  cells = 4000,\n): number {\n  const dx = (2 * halfWidth) / cells;\n  const squares = Array.from({ length: cells + 1 }, (_, i) => kernel(-halfWidth + i * dx, tau, f.s, f.hbar, f.m) ** 2);\n  return trapz(squares) * dx;\n}\n\n// ── Sprint 4 closure: Langevin, telegraph, steady state ────────────────────\n\n/** Parameters of the Langevin (Ornstein–Uhlenbeck) fixture. @internal */\nexport interface LangevinFixture {\n  /** Particle mass m. */\n  readonly m: number;\n  /** Friction coefficient γ (force per velocity). */\n  readonly gamma: number;\n  /** Thermal energy k_B T. */\n  readonly kT: number;\n}\n\n/**\n * WD4 — `⟨x²⟩(t) / (2Dt)` for the Langevin model `m v̇ = −γv + ξ`,\n * `⟨ξ(t)ξ(t′)⟩ = 2γ k_B T δ(t − t′)`, started from x = 0 with a thermalized\n * velocity, at `t = resolution · τ_p` where `τ_p = m/γ`.\n *\n * The second moments are integrated from the LANGEVIN model's own moment\n * equations, `d⟨x²⟩/dt = 2⟨xv⟩`, `d⟨xv⟩/dt = ⟨v²⟩ − (γ/m)⟨xv⟩`, with\n * `⟨v²⟩ = k_B T/m` held at equipartition, by `integrateRK4` (MathTS `solveODESystem` with `dt`) on a fine fixed grid. The\n * diffusion coefficient `D = k_B T/γ` (Einstein) enters only the DENOMINATOR:\n * the ratio tends to 1 in the diffusive regime `t ≫ τ_p`.\n *\n * @internal\n */\nexport function langevinMsdRatio(resolution: number, f: LangevinFixture): number {\n  const tauP = f.m / f.gamma;\n  const tEnd = resolution * tauP;\n  const v2 = f.kT / f.m;\n  const steps = Math.max(2000, Math.ceil(200 * resolution));\n  const h = tEnd / steps;\n  const end = integrateRK4((_t, y) => [2 * y[1]!, v2 - y[1]! / tauP], [0, 0], 0, steps * h, steps);\n  const x2 = end[0] ?? Number.NaN;\n  const D = f.kT / f.gamma;\n  return x2 / (2 * D * tEnd);\n}\n\n/**\n * The slow decay rate of a Fourier mode of the TELEGRAPH equation\n * `τ u_tt + u_t = D u_xx`, divided by the diffusion rate `D q²`:\n * `(1 − √(1 − 4ε)) / (2ε)` with `ε = τ D q²`. Tends to 1 as τ → 0; complex\n * (oscillatory) for `ε > 1/4`, where it returns NaN.\n *\n * @internal\n */\nexport function telegraphSlowRateRatio(tau: number, D: number, q: number): number {\n  const eps = tau * D * q * q;\n  if (eps === 0) return 1;\n  const disc = 1 - 4 * eps;\n  if (disc < 0) return Number.NaN;\n  // `(1 − √(1 − 4ε))/(2ε)` is algebraically `2/(1 + √(1 − 4ε))`, which does not cancel as\n  // ε → 0 (the naive form was 26× the true `ratio − 1` at ε = 1e-9).\n  return 2 / (1 + Math.sqrt(disc));\n}\n\n/**\n * The slow-mode decay-rate EXCESS over diffusion, `telegraphSlowRateRatio − 1`,\n * as the cancellation-free `4ε / (1 + √(1 − 4ε))²` with `ε = τ D q²`: the\n * relative error `ab-telegraph-diffusion` states its bound in. Subtracting 1\n * from the ratio loses the leading digits as ε → 0 (at ε = 1e-9 the naive\n * difference was 8e-8 relative off), so the bridge reads this function.\n * NaN for ε > 1/4, as the ratio is.\n *\n * @internal\n */\nexport function telegraphSlowRateExcess(tau: number, D: number, q: number): number {\n  const eps = tau * D * q * q;\n  if (eps === 0) return 0;\n  const disc = 1 - 4 * eps;\n  if (disc < 0) return Number.NaN;\n  const s = 1 + Math.sqrt(disc);\n  return (4 * eps) / (s * s);\n}\n\n/**\n * The oscillation frequency of a telegraph mode in its underdamped range,\n * divided by the undamped wave frequency `c q` with `c² = D/τ`:\n * `√(1 − 1/(4ε))`, `ε = τ D q²`. Tends to 1 as ε grows.\n *\n * @internal\n */\nexport function telegraphWaveFrequencyRatio(tau: number, D: number, q: number): number {\n  const eps = tau * D * q * q;\n  if (eps <= 0.25) return Number.NaN;\n  return Math.sqrt(1 - 1 / (4 * eps));\n}\n\n/** Parameters of the WD8 steady-state fixture. @internal */\nexport interface SteadyStateFixture {\n  /** Thermal diffusivity α (= κ/(ρ c_p)). */\n  readonly alpha: number;\n  /** Rod length ℓ. */\n  readonly ell: number;\n  /** End temperatures. */\n  readonly tLeft: number;\n  readonly tRight: number;\n  /** Base time; the resolution multiplies it. */\n  readonly t0: number;\n  readonly cells: number;\n}\n\n/**\n * WD8 — the largest deviation from the LINEAR steady profile (the Laplace\n * equation's solution) of an FTCS heat solution with fixed end temperatures,\n * started from a profile with a sin(πx/ℓ) bump, at `t = resolution · t0`.\n * Tends to zero as t → ∞: the steady state is the heat equation's attractor.\n * `reference` replaces the linear profile the deviation is measured against.\n *\n * @internal\n */\nexport function heatSteadyDeviation(\n  resolution: number,\n  f: SteadyStateFixture,\n  reference?: (i: number, cells: number) => number,\n): number {\n  const nx = f.cells;\n  const dx = f.ell / nx;\n  const dtMax = (0.25 * dx * dx) / f.alpha;\n  const tEnd = resolution * f.t0;\n  const steps = Math.ceil(tEnd / dtMax);\n  const dt = tEnd / steps;\n  const r = (f.alpha * dt) / (dx * dx);\n  const linear = (i: number): number => f.tLeft + ((f.tRight - f.tLeft) * i) / nx;\n  let u = new Float64Array(nx + 1);\n  let next = new Float64Array(nx + 1);\n  for (let i = 0; i <= nx; i++) u[i] = linear(i) + Math.sin((Math.PI * i) / nx);\n  next[0] = f.tLeft;\n  next[nx] = f.tRight;\n  for (let n = 0; n < steps; n++) {\n    for (let i = 1; i < nx; i++) next[i] = u[i]! + r * (u[i + 1]! - 2 * u[i]! + u[i - 1]!);\n    [u, next] = [next, u];\n  }\n  // The deviation is measured against `reference` when given — the negative\n  // control uses a WRONG steady state here — and against the linear Laplace\n  // profile otherwise. The solver itself never sees the reference.\n  const ref = reference ?? ((i: number) => linear(i));\n  let worst = 0;\n  for (let i = 0; i <= nx; i++) worst = Math.max(worst, Math.abs(u[i]! - ref(i, nx)));\n  return worst;\n}\n"]}

package/dist/atlas/link-prediction.d.ts

@@ -13,7 +13,17 @@
  * - **structural predictor** — common neighbours in the remaining graph, ties
  *   broken by sharing the premise's family, then by id;
  * - **text baseline** — word-token overlap between the models' dynamics and
- *   state-space descriptions, ties broken by id.
+ *   state-space descriptions (`text-overlap.ts`), ties broken by id.
+ *
+ * **The recorded result stands.** The negative result (typed neighbourhood below text
+ * overlap on twenty trials; NOTES.md, "Link prediction is NEGATIVE") is reproduced by
+ * {@link runLinkPrediction} exactly as recorded and is not re-run for a better answer. What
+ * was added beside it, never inside it: a seeded percentile-bootstrap interval on every
+ * recall and MRR (MathTS `bootstrapCI`), a seeded permutation test on the two per-trial
+ * reciprocal-rank vectors (MathTS `permutationTest`, stated for what it is), and McNemar's
+ * exact p on the paired hits (`benchmark/stats.ts`). The Katz-index predictor
+ * ({@link runKatzLinkPrediction}) is a SEPARATE result: every record it returns carries
+ * `postHoc: true` and the label, and it is never a field of the recorded comparison.
  *
  * ⚠ **What this result cannot carry.** The graph is small (24 models, 22 pairs)
  * and was curated by the same agent that runs the test, in-distribution. It is a
@@ -21,7 +31,9 @@
  * discovery claim, not a hub or gap claim, and not evidence about physics the
  * atlas does not contain. ROADMAP Phase 6 asks for it as a hypothesis test, and
  * that is its whole scope. Product A (`src/composition/discovery.ts`) is not
- * touched: a test pins that nothing under `src/atlas/` imports it.
+ * touched: a test pins that nothing under `src/atlas/` imports it, and the Katz
+ * predictor is not wired into discovery, whose candidates are in different
+ * components by construction (every path score there is 0).
  *
  * @module atlas/link-prediction
  * @internal
@@ -38,6 +50,41 @@ export interface LinkPredictionTrial {
     /** How many candidates the conclusion competed against. */
     readonly candidates: number;
 }
+/** A percentile-bootstrap interval with the point estimate it brackets (MathTS `bootstrapCI`). @internal */
+export interface BootstrapInterval {
+    readonly estimate: number;
+    readonly lower: number;
+    readonly upper: number;
+    /** The confidence level, 0.95. */
+    readonly confidence: number;
+}
+/** The seeded intervals of the recorded comparison. @internal */
+export interface LinkPredictionIntervals {
+    /** The seed every resample used; stated so the interval is reproducible. */
+    readonly seed: number;
+    readonly resamples: number;
+    readonly structuralRecall: BootstrapInterval;
+    readonly textRecall: BootstrapInterval;
+    readonly structuralMrr: BootstrapInterval;
+    readonly textMrr: BootstrapInterval;
+}
+/** The seeded permutation test on the two per-trial reciprocal-rank vectors. @internal */
+export interface ReciprocalRankPermutation {
+    /** Mean structural reciprocal rank minus mean text reciprocal rank (the observed MRR difference). */
+    readonly statistic: number;
+    /** Two-tailed p from MathTS `permutationTest`. */
+    readonly pValue: number;
+    readonly seed: number;
+    readonly resamples: number;
+    /**
+     * What the test is. MathTS has no paired permutation: `permutationTest` pools the two vectors
+     * and re-splits them, so the trial pairing is not kept and the null is looser than a sign-flip
+     * test's. The paired test on the hits is `mcnemarExactP`.
+     */
+    readonly kind: typeof PERMUTATION_KIND;
+}
+/** The statement of the permutation test's kind, so no reader takes it for a paired test. @internal */
+export declare const PERMUTATION_KIND: 'two-sample permutation of the reciprocal-rank vectors (pooled re-split; the pairing is not kept)';
 /** The whole leave-one-bridge-out run. @internal */
 export interface LinkPredictionResult {
     readonly k: number;
@@ -59,13 +106,69 @@ export interface LinkPredictionResult {
     /** Mean reciprocal rank of the held-out conclusion. */
     readonly structuralMrr: number;
     readonly textMrr: number;
+    /** Seeded bootstrap intervals on the four numbers above. */
+    readonly intervals: LinkPredictionIntervals;
+    /** The seeded permutation test on the per-trial reciprocal ranks. */
+    readonly permutation: ReciprocalRankPermutation;
+    /** McNemar's exact p on the paired hit table (both, structural only, text only, neither). */
+    readonly mcnemarExactP: number;
+}
+/** The label every Katz record carries. @internal */
+export declare const POST_HOC_LABEL: 'post hoc: added after the negative result was recorded';
+/** One held-out pair under the Katz-index predictor. @internal */
+export interface KatzTrial {
+    readonly bridgeId: string;
+    readonly premise: string;
+    readonly conclusion: string;
+    /** 1-based rank of the held-out conclusion by Katz index; Infinity when it was not a candidate. */
+    readonly katzRank: number;
+    /** The Katz index K[premise][conclusion] = ((I − βA)⁻¹ − I)[premise][conclusion]; 0 when no path. */
+    readonly katzScore: number;
+    readonly candidates: number;
+    /** This trial's attenuation β = 1/(2·max degree) of its own held-out graph. */
+    readonly beta: number;
+    readonly postHoc: true;
+}
+/** The Katz-index run: a separate, post-hoc result, never merged into the recorded comparison. @internal */
+export interface KatzLinkPredictionResult {
+    readonly postHoc: true;
+    readonly label: typeof POST_HOC_LABEL;
+    readonly k: number;
+    /**
+     * `[min, max]` of the trials' attenuations. Each held-out graph has its own maximum degree, so
+     * β = 1/(2·max degree) is per trial (`KatzTrial.beta`), each below its graph's spectral bound
+     * 1/λ_max since λ_max ≤ max degree. The result once reported one β, the last trial's.
+     */
+    readonly betaRange: readonly [number, number];
+    readonly trials: readonly KatzTrial[];
+    readonly stillConnected: number;
+    readonly katzHits: number;
+    readonly katzMrr: number;
+    readonly chanceRecall: number;
+    readonly intervals: {
+        readonly seed: number;
+        readonly resamples: number;
+        readonly recall: BootstrapInterval;
+        readonly mrr: BootstrapInterval;
+    };
 }
 /**
- * Run leave-one-bridge-out link prediction over the families' model graph.
+ * Run leave-one-bridge-out link prediction over the families' model graph. The recorded
+ * comparison (structural against text), with its seeded intervals and paired statistics.
  *
  * @param families - the atlas families (normally `ATLAS_FAMILIES`).
  * @param k - the depth a hit must fall within (10, as pre-registered for recall).
  * @internal
  */
 export declare function runLinkPrediction(families: readonly AtlasFamily[], k?: number): LinkPredictionResult;
+/**
+ * The Katz-index predictor, SEPARATE from the recorded comparison and labelled post hoc: it was
+ * added after the negative result was recorded, so its numbers are exploratory and are never
+ * merged into that result. Ranks each candidate by K[premise][candidate] (paths of every length,
+ * attenuated by β per step), ties by id. Not wired into discovery (`src/composition/`): Product A
+ * candidates are in different components by construction, so every path score there is 0.
+ *
+ * @internal
+ */
+export declare function runKatzLinkPrediction(families: readonly AtlasFamily[], k?: number): KatzLinkPredictionResult;
 //# sourceMappingURL=link-prediction.d.ts.map

package/dist/atlas/link-prediction.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"link-prediction.d.ts","sourceRoot":"","sources":["../../src/atlas/link-prediction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAG/C,2EAA2E;AAC3E,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,qFAAqF;IACrF,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,2DAA2D;IAC3D,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,oDAAoD;AACpD,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,MAAM,EAAE,SAAS,mBAAmB,EAAE,CAAC;IAChD;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;;;;OAIG;IACH,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,uDAAuD;IACvD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAsBD;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,SAAS,WAAW,EAAE,EAAE,CAAC,SAAK,GAAG,oBAAoB,CAkEhG"}
+{"version":3,"file":"link-prediction.d.ts","sourceRoot":"","sources":["../../src/atlas/link-prediction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AAGH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAO/C,2EAA2E;AAC3E,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,qFAAqF;IACrF,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,2DAA2D;IAC3D,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,4GAA4G;AAC5G,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,kCAAkC;IAClC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,iEAAiE;AACjE,MAAM,WAAW,uBAAuB;IACtC,4EAA4E;IAC5E,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,gBAAgB,EAAE,iBAAiB,CAAC;IAC7C,QAAQ,CAAC,UAAU,EAAE,iBAAiB,CAAC;IACvC,QAAQ,CAAC,aAAa,EAAE,iBAAiB,CAAC;IAC1C,QAAQ,CAAC,OAAO,EAAE,iBAAiB,CAAC;CACrC;AAED,0FAA0F;AAC1F,MAAM,WAAW,yBAAyB;IACxC,qGAAqG;IACrG,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,kDAAkD;IAClD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE,OAAO,gBAAgB,CAAC;CACxC;AAED,uGAAuG;AACvG,eAAO,MAAM,gBAAgB,EAC3B,kGAA2G,CAAC;AAE9G,oDAAoD;AACpD,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,MAAM,EAAE,SAAS,mBAAmB,EAAE,CAAC;IAChD;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;;;;OAIG;IACH,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,uDAAuD;IACvD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,4DAA4D;IAC5D,QAAQ,CAAC,SAAS,EAAE,uBAAuB,CAAC;IAC5C,qEAAqE;IACrE,QAAQ,CAAC,WAAW,EAAE,yBAAyB,CAAC;IAChD,6FAA6F;IAC7F,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED,qDAAqD;AACrD,eAAO,MAAM,cAAc,EAAG,wDAAiE,CAAC;AAEhG,kEAAkE;AAClE,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,mGAAmG;IACnG,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,qGAAqG;IACrG,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,+EAA+E;IAC/E,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC;CACxB;AAED,4GAA4G;AAC5G,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,OAAO,cAAc,CAAC;IACtC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB;;;;OAIG;IACH,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9C,QAAQ,CAAC,MAAM,EAAE,SAAS,SAAS,EAAE,CAAC;IACtC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,SAAS,EAAE;QAClB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC;QACnC,QAAQ,CAAC,GAAG,EAAE,iBAAiB,CAAC;KACjC,CAAC;CACH;AA0ED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,SAAS,WAAW,EAAE,EAAE,CAAC,SAAK,GAAG,oBAAoB,CAyEhG;AA0CD;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,SAAS,WAAW,EAAE,EAAE,CAAC,SAAK,GAAG,wBAAwB,CAmCxG"}

package/dist/atlas/link-prediction.js

@@ -13,7 +13,17 @@
  * - **structural predictor** — common neighbours in the remaining graph, ties
  *   broken by sharing the premise's family, then by id;
  * - **text baseline** — word-token overlap between the models' dynamics and
- *   state-space descriptions, ties broken by id.
+ *   state-space descriptions (`text-overlap.ts`), ties broken by id.
+ *
+ * **The recorded result stands.** The negative result (typed neighbourhood below text
+ * overlap on twenty trials; NOTES.md, "Link prediction is NEGATIVE") is reproduced by
+ * {@link runLinkPrediction} exactly as recorded and is not re-run for a better answer. What
+ * was added beside it, never inside it: a seeded percentile-bootstrap interval on every
+ * recall and MRR (MathTS `bootstrapCI`), a seeded permutation test on the two per-trial
+ * reciprocal-rank vectors (MathTS `permutationTest`, stated for what it is), and McNemar's
+ * exact p on the paired hits (`benchmark/stats.ts`). The Katz-index predictor
+ * ({@link runKatzLinkPrediction}) is a SEPARATE result: every record it returns carries
+ * `postHoc: true` and the label, and it is never a field of the recorded comparison.
  *
  * ⚠ **What this result cannot carry.** The graph is small (24 models, 22 pairs)
  * and was curated by the same agent that runs the test, in-distribution. It is a
@@ -21,50 +31,35 @@
  * discovery claim, not a hub or gap claim, and not evidence about physics the
  * atlas does not contain. ROADMAP Phase 6 asks for it as a hypothesis test, and
  * that is its whole scope. Product A (`src/composition/discovery.ts`) is not
- * touched: a test pins that nothing under `src/atlas/` imports it.
+ * touched: a test pins that nothing under `src/atlas/` imports it, and the Katz
+ * predictor is not wired into discovery, whose candidates are in different
+ * components by construction (every path score there is 0).
  *
  * @module atlas/link-prediction
  * @internal
  */
-const tokens = (text) => new Set(text.toLowerCase().split(/[^\p{L}\p{N}]+/u).filter((t) => t.length > 0));
-const jaccard = (a, b) => {
-    if (a.size === 0 && b.size === 0)
-        return 0;
-    let inter = 0;
-    for (const x of a)
-        if (b.has(x))
-            inter++;
-    return inter / (a.size + b.size - inter);
-};
-/** Rank candidates by descending score list (lexicographic), then ascending id. */
-function rank(candidates, score) {
-    return [...candidates].sort((x, y) => {
-        const sx = score(x);
-        const sy = score(y);
-        for (let i = 0; i < sx.length; i++)
-            if (sx[i] !== sy[i])
-                return sy[i] - sx[i];
-        return x < y ? -1 : x > y ? 1 : 0;
-    });
-}
-/**
- * Run leave-one-bridge-out link prediction over the families' model graph.
- *
- * @param families - the atlas families (normally `ATLAS_FAMILIES`).
- * @param k - the depth a hit must fall within (10, as pre-registered for recall).
- * @internal
- */
-export function runLinkPrediction(families, k = 10) {
+import { bootstrapCI, inv, permutationTest } from '@danielsimonjr/mathts-functions';
+import { jaccard, rankBy, tokens } from './text-overlap.js';
+import { mcnemar } from './benchmark/stats.js';
+import { meanOf } from '../numerical/statistics.js';
+/** The statement of the permutation test's kind, so no reader takes it for a paired test. @internal */
+export const PERMUTATION_KIND = 'two-sample permutation of the reciprocal-rank vectors (pooled re-split; the pairing is not kept)';
+/** The label every Katz record carries. @internal */
+export const POST_HOC_LABEL = 'post hoc: added after the negative result was recorded';
+/** The one seed every resample in this module uses, and the resample count. Stated, not hidden. */
+const RESAMPLE_SEED = 20260924;
+const RESAMPLES = 10000;
+/** Every held-out query of the families, and the pairs excluded as still connected. */
+function holdOuts(families) {
     const models = new Map();
     for (const f of families)
         for (const m of f.models)
             models.set(m.id, m);
     const bridges = families.flatMap((f) => f.bridges);
     const edgesOf = (b) => b.premises.map((p) => [p, b.conclusion]);
-    const trials = [];
+    const queries = [];
     let stillConnected = 0;
     for (const held of bridges) {
-        // The graph WITHOUT the held-out bridge.
         const adj = new Map();
         for (const id of models.keys())
             adj.set(id, new Set());
@@ -77,8 +72,8 @@ export function runLinkPrediction(families, k = 10) {
             }
         }
         for (const [premise, conclusion] of edgesOf(held)) {
-            const pModel = models.get(premise);
-            if (pModel === undefined)
+            const premiseModel = models.get(premise);
+            if (premiseModel === undefined)
                 continue;
             const neighbours = adj.get(premise) ?? new Set();
             if (neighbours.has(conclusion)) {
@@ -86,43 +81,194 @@ export function runLinkPrediction(families, k = 10) {
                 continue;
             }
             const candidates = [...models.keys()].filter((id) => id !== premise && !neighbours.has(id));
-            const common = (id) => {
-                let n = 0;
-                for (const x of adj.get(id) ?? [])
-                    if (neighbours.has(x))
-                        n++;
-                return n;
-            };
-            const structural = rank(candidates, (id) => [common(id), models.get(id).family === pModel.family ? 1 : 0]);
-            const pText = tokens(`${pModel.dynamics} ${pModel.stateSpace}`);
-            const text = rank(candidates, (id) => {
-                const m = models.get(id);
-                return [jaccard(pText, tokens(`${m.dynamics} ${m.stateSpace}`))];
-            });
-            const at = (list) => {
-                const i = list.indexOf(conclusion);
-                return i < 0 ? Number.POSITIVE_INFINITY : i + 1;
-            };
-            trials.push({
-                bridgeId: held.id,
-                premise,
-                conclusion,
-                structuralRank: at(structural),
-                textRank: at(text),
-                candidates: candidates.length,
-            });
+            queries.push({ held, premise, conclusion, premiseModel, adj, candidates });
         }
     }
-    const mean = (xs) => (xs.length === 0 ? Number.NaN : xs.reduce((a, b) => a + b, 0) / xs.length);
+    return { models, queries, stillConnected };
+}
+/** 1-based position of `id` in a ranking; Infinity when absent. */
+const rankOf = (list, id) => {
+    const i = list.indexOf(id);
+    return i < 0 ? Number.POSITIVE_INFINITY : i + 1;
+};
+/** Seeded percentile bootstrap of the mean of per-trial values (a 0/1 hit, or a reciprocal rank). */
+function bootstrapMean(values) {
+    const ci = bootstrapCI([...values], (sample) => meanOf(sample), {
+        confidence: 0.95,
+        resamples: RESAMPLES,
+        seed: RESAMPLE_SEED,
+    });
+    return { estimate: ci.estimate, lower: ci.lower, upper: ci.upper, confidence: ci.confidence };
+}
+/** The mean of a trial statistic; NaN with no trials, as the recorded result always read it. */
+const meanOrNaN = (xs) => (xs.length === 0 ? Number.NaN : meanOf(xs));
+/**
+ * Run leave-one-bridge-out link prediction over the families' model graph. The recorded
+ * comparison (structural against text), with its seeded intervals and paired statistics.
+ *
+ * @param families - the atlas families (normally `ATLAS_FAMILIES`).
+ * @param k - the depth a hit must fall within (10, as pre-registered for recall).
+ * @internal
+ */
+export function runLinkPrediction(families, k = 10) {
+    const { models, queries, stillConnected } = holdOuts(families);
+    const trials = queries.map((q) => {
+        const neighbours = q.adj.get(q.premise) ?? new Set();
+        const common = (id) => {
+            let n = 0;
+            for (const x of q.adj.get(id) ?? [])
+                if (neighbours.has(x))
+                    n++;
+            return n;
+        };
+        const structural = rankBy(q.candidates, (id) => [common(id), models.get(id).family === q.premiseModel.family ? 1 : 0]);
+        const pText = tokens(`${q.premiseModel.dynamics} ${q.premiseModel.stateSpace}`);
+        const text = rankBy(q.candidates, (id) => {
+            const m = models.get(id);
+            return [jaccard(pText, tokens(`${m.dynamics} ${m.stateSpace}`))];
+        });
+        return {
+            bridgeId: q.held.id,
+            premise: q.premise,
+            conclusion: q.conclusion,
+            structuralRank: rankOf(structural, q.conclusion),
+            textRank: rankOf(text, q.conclusion),
+            candidates: q.candidates.length,
+        };
+    });
+    const structuralHit = trials.map((t) => (t.structuralRank <= k ? 1 : 0));
+    const textHit = trials.map((t) => (t.textRank <= k ? 1 : 0));
+    const structuralRR = trials.map((t) => 1 / t.structuralRank);
+    const textRR = trials.map((t) => 1 / t.textRank);
+    // The paired hit table: both, structural only, text only, neither.
+    let a = 0;
+    let b = 0;
+    let c = 0;
+    let d = 0;
+    trials.forEach((_, i) => {
+        if (structuralHit[i] && textHit[i])
+            a++;
+        else if (structuralHit[i])
+            b++;
+        else if (textHit[i])
+            c++;
+        else
+            d++;
+    });
+    const permuted = permutationTest(structuralRR, textRR, (x, y) => meanOrNaN(x) - meanOrNaN(y), {
+        resamples: RESAMPLES,
+        seed: RESAMPLE_SEED,
+    });
+    return {
+        k,
+        trials,
+        stillConnected,
+        structuralHits: structuralHit.reduce((acc, x) => acc + x, 0),
+        textHits: textHit.reduce((acc, x) => acc + x, 0),
+        chanceRecall: meanOrNaN(trials.map((t) => Math.min(k, t.candidates) / t.candidates)),
+        structuralMrr: meanOrNaN(structuralRR),
+        textMrr: meanOrNaN(textRR),
+        intervals: {
+            seed: RESAMPLE_SEED,
+            resamples: RESAMPLES,
+            structuralRecall: bootstrapMean(structuralHit),
+            textRecall: bootstrapMean(textHit),
+            structuralMrr: bootstrapMean(structuralRR),
+            textMrr: bootstrapMean(textRR),
+        },
+        permutation: {
+            statistic: permuted.statistic,
+            pValue: permuted.pValue,
+            seed: RESAMPLE_SEED,
+            resamples: RESAMPLES,
+            kind: PERMUTATION_KIND,
+        },
+        mcnemarExactP: mcnemar({ a, b, c, d }).exactP,
+    };
+}
+/** A square number matrix of order n, read back from MathTS `inv`, which types its result `unknown`. */
+function squareMatrix(value, n) {
+    if (!Array.isArray(value) || value.length !== n) {
+        throw new TypeError(`inv did not return a ${n}×${n} matrix`);
+    }
+    for (const row of value) {
+        if (!Array.isArray(row) || row.length !== n || !row.every((x) => typeof x === 'number' && Number.isFinite(x))) {
+            throw new TypeError(`inv did not return a ${n}×${n} matrix of finite numbers`);
+        }
+    }
+    return value;
+}
+/**
+ * The Katz index of the graph without the held-out bridge: K = (I − βA)⁻¹ − I through MathTS
+ * `inv`, with β = 1/(2·max degree). The largest eigenvalue of a 0/1 adjacency is at most the
+ * maximum degree, so β is below the spectral bound 1/λ_max and the series Σ βˡ Aˡ converges.
+ * A graph with no edge has K = 0 everywhere, and β is stated as 0.5 (there is nothing to attenuate).
+ */
+function katzIndex(adj, ids) {
+    const n = ids.length;
+    const index = new Map(ids.map((id, i) => [id, i]));
+    const A = Array.from({ length: n }, () => new Array(n).fill(0));
+    let maxDegree = 0;
+    for (const [u, neighbours] of adj) {
+        const i = index.get(u);
+        if (i === undefined)
+            continue;
+        maxDegree = Math.max(maxDegree, neighbours.size);
+        for (const v of neighbours) {
+            const j = index.get(v);
+            if (j !== undefined)
+                A[i][j] = 1;
+        }
+    }
+    const beta = maxDegree === 0 ? 0.5 : 1 / (2 * maxDegree);
+    const M = A.map((row, i) => row.map((x, j) => (i === j ? 1 : 0) - beta * x));
+    const inverse = squareMatrix(inv(M), n);
+    const K = inverse.map((row, i) => row.map((x, j) => (i === j ? x - 1 : x)));
+    return { K, beta };
+}
+/**
+ * The Katz-index predictor, SEPARATE from the recorded comparison and labelled post hoc: it was
+ * added after the negative result was recorded, so its numbers are exploratory and are never
+ * merged into that result. Ranks each candidate by K[premise][candidate] (paths of every length,
+ * attenuated by β per step), ties by id. Not wired into discovery (`src/composition/`): Product A
+ * candidates are in different components by construction, so every path score there is 0.
+ *
+ * @internal
+ */
+export function runKatzLinkPrediction(families, k = 10) {
+    const { models, queries, stillConnected } = holdOuts(families);
+    const ids = [...models.keys()];
+    const index = new Map(ids.map((id, i) => [id, i]));
+    const trials = queries.map((q) => {
+        const katz = katzIndex(q.adj, ids);
+        const p = index.get(q.premise);
+        const score = (id) => katz.K[p][index.get(id)];
+        const ranked = rankBy(q.candidates, (id) => [score(id)]);
+        return {
+            bridgeId: q.held.id,
+            premise: q.premise,
+            conclusion: q.conclusion,
+            katzRank: rankOf(ranked, q.conclusion),
+            katzScore: q.candidates.includes(q.conclusion) ? score(q.conclusion) : 0,
+            candidates: q.candidates.length,
+            beta: katz.beta,
+            postHoc: true,
+        };
+    });
+    const betas = trials.map((t) => t.beta);
+    const hit = trials.map((t) => (t.katzRank <= k ? 1 : 0));
+    const rr = trials.map((t) => 1 / t.katzRank);
     return {
+        postHoc: true,
+        label: POST_HOC_LABEL,
         k,
+        betaRange: betas.length === 0 ? [Number.NaN, Number.NaN] : [Math.min(...betas), Math.max(...betas)],
         trials,
         stillConnected,
-        structuralHits: trials.filter((t) => t.structuralRank <= k).length,
-        textHits: trials.filter((t) => t.textRank <= k).length,
-        chanceRecall: mean(trials.map((t) => Math.min(k, t.candidates) / t.candidates)),
-        structuralMrr: mean(trials.map((t) => 1 / t.structuralRank)),
-        textMrr: mean(trials.map((t) => 1 / t.textRank)),
+        katzHits: hit.reduce((acc, x) => acc + x, 0),
+        katzMrr: meanOrNaN(rr),
+        chanceRecall: meanOrNaN(trials.map((t) => Math.min(k, t.candidates) / t.candidates)),
+        intervals: { seed: RESAMPLE_SEED, resamples: RESAMPLES, recall: bootstrapMean(hit), mrr: bootstrapMean(rr) },
     };
 }
 //# sourceMappingURL=link-prediction.js.map