universal-physics-tensor 10.0.0 → 12.0.0

package/dist/composition/probe/fit.js

@@ -3,6 +3,8 @@
  *
  * @module composition/probe/fit
  */
+import { norm2, pairwiseDot } from '@danielsimonjr/mathts-core';
+import { ols } from '@danielsimonjr/mathts-functions';
 import { evalExpr } from '../expr-eval.js';
 import { DEFAULT_HOLDOUT_TOL } from './types.js';
 import { scalarDiscrepancy } from './residual.js';
@@ -22,6 +24,35 @@ function observed(rows) {
         return y;
     });
 }
+/** Root-mean-square additive discrepancy: core `norm2` of the residuals (the scaled, overflow-safe 2-norm) over √n. */
+function rmse(observedValues, predicted) {
+    const residuals = observedValues.map((obs, i) => scalarDiscrepancy(obs, predicted[i], 'additive'));
+    return norm2(residuals) / Math.sqrt(residuals.length);
+}
+/**
+ * The standard error of the least-squares prefactor: MathTS `ols` on the single
+ * column f with no intercept, the column scaled to order one first because
+ * `ols` tests singularity with an absolute 1e-15 (a column of 1e-9 is refused
+ * unscaled), then unscaled. The estimator is the one `pairwiseDot` ratio above
+ * gives, so the coefficient itself is not read back from here. Null below two
+ * finite rows (no residual degree of freedom) or when f is zero everywhere.
+ */
+function prefactorStderr(fs, ys) {
+    if (fs.length < 2)
+        return null;
+    const scale = fs.reduce((m, v) => Math.max(m, Math.abs(v)), 0);
+    if (!(scale > 0))
+        return null;
+    let fit;
+    try {
+        fit = ols(fs.map((v) => [v / scale]), [...ys], { intercept: false });
+    }
+    catch {
+        return null;
+    }
+    const se = fit.stderr[0];
+    return typeof se === 'number' && Number.isFinite(se) ? se / scale : null;
+}
 function predictorKey(row, observable) {
     const predictors = {};
     for (const [key, value] of Object.entries(row)) {
@@ -53,25 +84,20 @@ export function fitPrefactor(expr, exploratory, holdout, holdoutTol = DEFAULT_HO
     }
     const y = observed(exploratory);
     const f = predictions(expr, exploratory, 1);
-    let num = 0;
-    let den = 0;
-    for (let i = 0; i < y.length; i++) {
-        if (!Number.isFinite(f[i]))
-            continue;
-        num += f[i] * y[i];
-        den += f[i] * f[i];
-    }
-    const prefactor = den > 0 ? num / den : 1;
+    // The least-squares prefactor over the rows where the form is finite: c = f·y / f·f
+    // (core `pairwiseDot`, a pairwise sum).
+    const finite = f.map((v, i) => [v, y[i]]).filter(([v]) => Number.isFinite(v));
+    const fs = finite.map(([v]) => v);
+    const ys = finite.map(([, obs]) => obs);
+    const den = pairwiseDot(fs, fs);
+    const prefactor = den > 0 ? pairwiseDot(fs, ys) / den : 1;
+    const stderr = den > 0 ? prefactorStderr(fs, ys) : null;
     const pred = predictions(expr, exploratory, prefactor);
-    let acc = 0;
-    for (let i = 0; i < y.length; i++) {
-        const r = scalarDiscrepancy(y[i], pred[i], 'additive');
-        acc += r * r;
-    }
-    const exploratoryRmse = Math.sqrt(acc / y.length);
+    const exploratoryRmse = rmse(y, pred);
     if (!holdout || holdout.rows.length === 0) {
         return {
             prefactor,
+            prefactorStderr: stderr,
             exploratoryRmse,
             nExploratory: y.length,
             holdoutRmse: null,
@@ -81,16 +107,14 @@ export function fitPrefactor(expr, exploratory, holdout, holdoutTol = DEFAULT_HO
     }
     const yh = observed(holdout);
     const ph = predictions(expr, holdout, prefactor);
-    let hacc = 0;
-    for (let i = 0; i < yh.length; i++) {
-        const r = scalarDiscrepancy(yh[i], ph[i], 'additive');
-        hacc += r * r;
-    }
-    const holdoutRmse = Math.sqrt(hacc / yh.length);
-    const scale = Math.max(...yh.map(Math.abs), ...ph.map(Math.abs), 1e-12);
+    const holdoutRmse = rmse(yh, ph);
+    // A reduce, not `Math.max(...rows)`: a spread of a large holdout overflows the call stack.
+    const maxAbs = (m, v) => (Number.isFinite(v) ? Math.max(m, Math.abs(v)) : m);
+    const scale = ph.reduce(maxAbs, yh.reduce(maxAbs, 1e-12));
     const holdoutSupported = holdoutRmse <= holdoutTol * scale;
     return {
         prefactor,
+        prefactorStderr: stderr,
         exploratoryRmse,
         nExploratory: y.length,
         holdoutRmse,

package/dist/composition/probe/fit.js.map

@@ -1 +1 @@
-{"version":3,"file":"fit.js","sourceRoot":"","sources":["../../../src/composition/probe/fit.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,mBAAmB,EAAqB,MAAM,YAAY,CAAC;AACpE,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAW/C,SAAS,WAAW,CAAC,IAAc,EAAE,IAAkB,EAAE,SAAiB;IACxE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9B,OAAO,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,QAAQ,CAAC,IAAkB;IAClC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC3B,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,UAAU,CAAC,uCAAuC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,YAAY,CAAC,GAAqC,EAAE,UAAkB;IAC7E,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/C,IAAI,GAAG,KAAK,UAAU;YAAE,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAClD,CAAC;IACD,OAAO,aAAa,CAAC,UAAU,CAAC,CAAC;AACnC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAC1B,IAAc,EACd,WAAyB,EACzB,OAAiC,EACjC,UAAU,GAAG,mBAAmB;IAEhC,IAAI,WAAW,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;QAC3C,MAAM,IAAI,UAAU,CAAC,uDAAuD,WAAW,CAAC,IAAI,IAAI,CAAC,CAAC;IACpG,CAAC;IACD,IAAI,OAAO,EAAE,CAAC;QACZ,IAAI,OAAO,CAAC,IAAI,KAAK,oBAAoB,IAAI,OAAO,CAAC,IAAI,KAAK,sBAAsB,EAAE,CAAC;YACrF,MAAM,IAAI,UAAU,CAAC,sEAAsE,CAAC,CAAC;QAC/F,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACvF,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,EAAE,WAAW,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;gBAC5D,MAAM,IAAI,UAAU,CAAC,8CAA8C,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;IAC5C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAE,SAAS;QACrC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;IACvD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACvD,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAEhD,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5C,OAAO;YACL,SAAS;YACT,eAAe;YACf,YAAY,EAAE,CAAC,CAAC,MAAM;YACtB,WAAW,EAAE,IAAI;YACjB,QAAQ,EAAE,CAAC;YACX,gBAAgB,EAAE,KAAK;SACxB,CAAC;IACJ,CAAC;IACD,MAAM,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACjD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACtD,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;IAChD,MAAM,KAAK,GACT,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5D,MAAM,gBAAgB,GAAG,WAAW,IAAI,UAAU,GAAG,KAAK,CAAC;IAC3D,OAAO;QACL,SAAS;QACT,eAAe;QACf,YAAY,EAAE,CAAC,CAAC,MAAM;QACtB,WAAW;QACX,QAAQ,EAAE,EAAE,CAAC,MAAM;QACnB,gBAAgB;KACjB,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Prefactor fit + holdout evaluation. Generation never sees holdout rows.\n *\n * @module composition/probe/fit\n */\n\nimport type { ExprNode } from '../../dimensional/ast-types.js';\nimport { evalExpr } from '../expr-eval.js';\nimport { DEFAULT_HOLDOUT_TOL, type ProbeDataset } from './types.js';\nimport { scalarDiscrepancy } from './residual.js';\nimport { canonicalJson } from './serialize.js';\n\nexport interface FitResult {\n  readonly prefactor: number;\n  readonly exploratoryRmse: number;\n  readonly nExploratory: number;\n  readonly holdoutRmse: number | null;\n  readonly nHoldout: number;\n  readonly holdoutSupported: boolean;\n}\n\nfunction predictions(expr: ExprNode, rows: ProbeDataset, prefactor: number): number[] {\n  return rows.rows.map((row) => {\n    const y = evalExpr(expr, row);\n    return prefactor * y;\n  });\n}\n\nfunction observed(rows: ProbeDataset): number[] {\n  return rows.rows.map((row) => {\n    const y = row[rows.observable];\n    if (!Number.isFinite(y)) {\n      throw new RangeError(`fit: row missing finite observable '${rows.observable}'`);\n    }\n    return y;\n  });\n}\n\nfunction predictorKey(row: Readonly<Record<string, number>>, observable: string): string {\n  const predictors: Record<string, number> = {};\n  for (const [key, value] of Object.entries(row)) {\n    if (key !== observable) predictors[key] = value;\n  }\n  return canonicalJson(predictors);\n}\n\n/**\n * Least-squares prefactor c in y ≈ c · f(x) on exploratory data, then score\n * locked holdout. Holdout must not have been in the generation context.\n *\n * @internal\n */\nexport function fitPrefactor(\n  expr: ExprNode,\n  exploratory: ProbeDataset,\n  holdout: ProbeDataset | undefined,\n  holdoutTol = DEFAULT_HOLDOUT_TOL,\n): FitResult {\n  if (exploratory.role !== 'exploratory-fit') {\n    throw new RangeError(`fit: exploratory role must be exploratory-fit (got '${exploratory.role}')`);\n  }\n  if (holdout) {\n    if (holdout.role !== 'validation-holdout' && holdout.role !== 'external-replication') {\n      throw new RangeError(`fit: holdout role must be validation-holdout or external-replication`);\n    }\n    const holdKeys = new Set(holdout.rows.map((r) => predictorKey(r, holdout.observable)));\n    for (const row of exploratory.rows) {\n      if (holdKeys.has(predictorKey(row, exploratory.observable))) {\n        throw new RangeError('fit: holdout row leaked into exploratory set');\n      }\n    }\n  }\n  const y = observed(exploratory);\n  const f = predictions(expr, exploratory, 1);\n  let num = 0;\n  let den = 0;\n  for (let i = 0; i < y.length; i++) {\n    if (!Number.isFinite(f[i])) continue;\n    num += f[i] * y[i];\n    den += f[i] * f[i];\n  }\n  const prefactor = den > 0 ? num / den : 1;\n  const pred = predictions(expr, exploratory, prefactor);\n  let acc = 0;\n  for (let i = 0; i < y.length; i++) {\n    const r = scalarDiscrepancy(y[i], pred[i], 'additive');\n    acc += r * r;\n  }\n  const exploratoryRmse = Math.sqrt(acc / y.length);\n\n    if (!holdout || holdout.rows.length === 0) {\n    return {\n      prefactor,\n      exploratoryRmse,\n      nExploratory: y.length,\n      holdoutRmse: null,\n      nHoldout: 0,\n      holdoutSupported: false,\n    };\n  }\n  const yh = observed(holdout);\n  const ph = predictions(expr, holdout, prefactor);\n  let hacc = 0;\n  for (let i = 0; i < yh.length; i++) {\n    const r = scalarDiscrepancy(yh[i], ph[i], 'additive');\n    hacc += r * r;\n  }\n  const holdoutRmse = Math.sqrt(hacc / yh.length);\n  const scale =\n    Math.max(...yh.map(Math.abs), ...ph.map(Math.abs), 1e-12);\n  const holdoutSupported = holdoutRmse <= holdoutTol * scale;\n  return {\n    prefactor,\n    exploratoryRmse,\n    nExploratory: y.length,\n    holdoutRmse,\n    nHoldout: yh.length,\n    holdoutSupported,\n  };\n}\n"]}
+{"version":3,"file":"fit.js","sourceRoot":"","sources":["../../../src/composition/probe/fit.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAChE,OAAO,EAAE,GAAG,EAAE,MAAM,iCAAiC,CAAC;AAEtD,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,mBAAmB,EAAqB,MAAM,YAAY,CAAC;AACpE,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAkB/C,SAAS,WAAW,CAAC,IAAc,EAAE,IAAkB,EAAE,SAAiB;IACxE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9B,OAAO,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,QAAQ,CAAC,IAAkB;IAClC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC3B,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,UAAU,CAAC,uCAAuC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC;AAED,uHAAuH;AACvH,SAAS,IAAI,CAAC,cAAiC,EAAE,SAA4B;IAC3E,MAAM,SAAS,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAE,EAAE,UAAU,CAAC,CAAC,CAAC;IACpG,OAAO,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;AACxD,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,eAAe,CAAC,EAAqB,EAAE,EAAqB;IACnE,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/D,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,GAAG,CAAC;IACR,IAAI,CAAC;QACH,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;IACvE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,EAAE,GAAY,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,OAAO,OAAO,EAAE,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAC3E,CAAC;AAED,SAAS,YAAY,CAAC,GAAqC,EAAE,UAAkB;IAC7E,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/C,IAAI,GAAG,KAAK,UAAU;YAAE,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAClD,CAAC;IACD,OAAO,aAAa,CAAC,UAAU,CAAC,CAAC;AACnC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAC1B,IAAc,EACd,WAAyB,EACzB,OAAiC,EACjC,UAAU,GAAG,mBAAmB;IAEhC,IAAI,WAAW,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;QAC3C,MAAM,IAAI,UAAU,CAAC,uDAAuD,WAAW,CAAC,IAAI,IAAI,CAAC,CAAC;IACpG,CAAC;IACD,IAAI,OAAO,EAAE,CAAC;QACZ,IAAI,OAAO,CAAC,IAAI,KAAK,oBAAoB,IAAI,OAAO,CAAC,IAAI,KAAK,sBAAsB,EAAE,CAAC;YACrF,MAAM,IAAI,UAAU,CAAC,sEAAsE,CAAC,CAAC;QAC/F,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACvF,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,EAAE,WAAW,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;gBAC5D,MAAM,IAAI,UAAU,CAAC,8CAA8C,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;IAC5C,oFAAoF;IACpF,wCAAwC;IACxC,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,WAAW,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAChC,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACxD,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;IACvD,MAAM,eAAe,GAAG,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAEtC,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1C,OAAO;YACL,SAAS;YACT,eAAe,EAAE,MAAM;YACvB,eAAe;YACf,YAAY,EAAE,CAAC,CAAC,MAAM;YACtB,WAAW,EAAE,IAAI;YACjB,QAAQ,EAAE,CAAC;YACX,gBAAgB,EAAE,KAAK;SACxB,CAAC;IACJ,CAAC;IACD,MAAM,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACjD,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACjC,2FAA2F;IAC3F,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7F,MAAM,KAAK,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IAC1D,MAAM,gBAAgB,GAAG,WAAW,IAAI,UAAU,GAAG,KAAK,CAAC;IAC3D,OAAO;QACL,SAAS;QACT,eAAe,EAAE,MAAM;QACvB,eAAe;QACf,YAAY,EAAE,CAAC,CAAC,MAAM;QACtB,WAAW;QACX,QAAQ,EAAE,EAAE,CAAC,MAAM;QACnB,gBAAgB;KACjB,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Prefactor fit + holdout evaluation. Generation never sees holdout rows.\n *\n * @module composition/probe/fit\n */\n\nimport { norm2, pairwiseDot } from '@danielsimonjr/mathts-core';\nimport { ols } from '@danielsimonjr/mathts-functions';\nimport type { ExprNode } from '../../dimensional/ast-types.js';\nimport { evalExpr } from '../expr-eval.js';\nimport { DEFAULT_HOLDOUT_TOL, type ProbeDataset } from './types.js';\nimport { scalarDiscrepancy } from './residual.js';\nimport { canonicalJson } from './serialize.js';\n\n/** The prefactor fit of one candidate, with its exploratory and holdout errors. */\nexport interface FitResult {\n  readonly prefactor: number;\n  /**\n   * Standard error of the prefactor from the residual scatter of the exploratory rows\n   * (MathTS `ols`, one column, no intercept); null below two finite rows or when the\n   * form is zero on every row.\n   */\n  readonly prefactorStderr: number | null;\n  readonly exploratoryRmse: number;\n  readonly nExploratory: number;\n  readonly holdoutRmse: number | null;\n  readonly nHoldout: number;\n  readonly holdoutSupported: boolean;\n}\n\nfunction predictions(expr: ExprNode, rows: ProbeDataset, prefactor: number): number[] {\n  return rows.rows.map((row) => {\n    const y = evalExpr(expr, row);\n    return prefactor * y;\n  });\n}\n\nfunction observed(rows: ProbeDataset): number[] {\n  return rows.rows.map((row) => {\n    const y = row[rows.observable];\n    if (!Number.isFinite(y)) {\n      throw new RangeError(`fit: row missing finite observable '${rows.observable}'`);\n    }\n    return y;\n  });\n}\n\n/** Root-mean-square additive discrepancy: core `norm2` of the residuals (the scaled, overflow-safe 2-norm) over √n. */\nfunction rmse(observedValues: readonly number[], predicted: readonly number[]): number {\n  const residuals = observedValues.map((obs, i) => scalarDiscrepancy(obs, predicted[i]!, 'additive'));\n  return norm2(residuals) / Math.sqrt(residuals.length);\n}\n\n/**\n * The standard error of the least-squares prefactor: MathTS `ols` on the single\n * column f with no intercept, the column scaled to order one first because\n * `ols` tests singularity with an absolute 1e-15 (a column of 1e-9 is refused\n * unscaled), then unscaled. The estimator is the one `pairwiseDot` ratio above\n * gives, so the coefficient itself is not read back from here. Null below two\n * finite rows (no residual degree of freedom) or when f is zero everywhere.\n */\nfunction prefactorStderr(fs: readonly number[], ys: readonly number[]): number | null {\n  if (fs.length < 2) return null;\n  const scale = fs.reduce((m, v) => Math.max(m, Math.abs(v)), 0);\n  if (!(scale > 0)) return null;\n  let fit;\n  try {\n    fit = ols(fs.map((v) => [v / scale]), [...ys], { intercept: false });\n  } catch {\n    return null;\n  }\n  const se: unknown = fit.stderr[0];\n  return typeof se === 'number' && Number.isFinite(se) ? se / scale : null;\n}\n\nfunction predictorKey(row: Readonly<Record<string, number>>, observable: string): string {\n  const predictors: Record<string, number> = {};\n  for (const [key, value] of Object.entries(row)) {\n    if (key !== observable) predictors[key] = value;\n  }\n  return canonicalJson(predictors);\n}\n\n/**\n * Least-squares prefactor c in y ≈ c · f(x) on exploratory data, then score\n * locked holdout. Holdout must not have been in the generation context.\n *\n * @internal\n */\nexport function fitPrefactor(\n  expr: ExprNode,\n  exploratory: ProbeDataset,\n  holdout: ProbeDataset | undefined,\n  holdoutTol = DEFAULT_HOLDOUT_TOL,\n): FitResult {\n  if (exploratory.role !== 'exploratory-fit') {\n    throw new RangeError(`fit: exploratory role must be exploratory-fit (got '${exploratory.role}')`);\n  }\n  if (holdout) {\n    if (holdout.role !== 'validation-holdout' && holdout.role !== 'external-replication') {\n      throw new RangeError(`fit: holdout role must be validation-holdout or external-replication`);\n    }\n    const holdKeys = new Set(holdout.rows.map((r) => predictorKey(r, holdout.observable)));\n    for (const row of exploratory.rows) {\n      if (holdKeys.has(predictorKey(row, exploratory.observable))) {\n        throw new RangeError('fit: holdout row leaked into exploratory set');\n      }\n    }\n  }\n  const y = observed(exploratory);\n  const f = predictions(expr, exploratory, 1);\n  // The least-squares prefactor over the rows where the form is finite: c = f·y / f·f\n  // (core `pairwiseDot`, a pairwise sum).\n  const finite = f.map((v, i) => [v, y[i]!] as const).filter(([v]) => Number.isFinite(v));\n  const fs = finite.map(([v]) => v);\n  const ys = finite.map(([, obs]) => obs);\n  const den = pairwiseDot(fs, fs);\n  const prefactor = den > 0 ? pairwiseDot(fs, ys) / den : 1;\n  const stderr = den > 0 ? prefactorStderr(fs, ys) : null;\n  const pred = predictions(expr, exploratory, prefactor);\n  const exploratoryRmse = rmse(y, pred);\n\n  if (!holdout || holdout.rows.length === 0) {\n    return {\n      prefactor,\n      prefactorStderr: stderr,\n      exploratoryRmse,\n      nExploratory: y.length,\n      holdoutRmse: null,\n      nHoldout: 0,\n      holdoutSupported: false,\n    };\n  }\n  const yh = observed(holdout);\n  const ph = predictions(expr, holdout, prefactor);\n  const holdoutRmse = rmse(yh, ph);\n  // A reduce, not `Math.max(...rows)`: a spread of a large holdout overflows the call stack.\n  const maxAbs = (m: number, v: number) => (Number.isFinite(v) ? Math.max(m, Math.abs(v)) : m);\n  const scale = ph.reduce(maxAbs, yh.reduce(maxAbs, 1e-12));\n  const holdoutSupported = holdoutRmse <= holdoutTol * scale;\n  return {\n    prefactor,\n    prefactorStderr: stderr,\n    exploratoryRmse,\n    nExploratory: y.length,\n    holdoutRmse,\n    nHoldout: yh.length,\n    holdoutSupported,\n  };\n}\n"]}

package/dist/composition/probe/frontier.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"frontier.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/frontier.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAsB3E;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,WAAW,EAAE,CAmChF;AAED,kEAAkE;AAClE,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,WAAW,EAAE,CA2B7E;AAED,qEAAqE;AACrE,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,WAAW,EAAE,CAwB1E;AAMD,kEAAkE;AAClE,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,WAAW,EAAE,CAExE;AAED,6CAA6C;AAC7C,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,EAAE,EAAE,MAAM,GACT,WAAW,GAAG,SAAS,CAEzB;AAED;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CACpC,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,aAAa,CAAC,QAAQ,CAAC,EAC/B,SAAS,EAAE,aAAa,CAAC,WAAW,CAAC,EACrC,WAAW,CAAC,EAAE,YAAY,EAC1B,OAAO,CAAC,EAAE,YAAY,GACrB,aAAa,CA0Cf"}
+{"version":3,"file":"frontier.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/frontier.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAuB3E;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,WAAW,EAAE,CAmChF;AAED,kEAAkE;AAClE,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,WAAW,EAAE,CA2B7E;AAED,qEAAqE;AACrE,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,WAAW,EAAE,CAwB1E;AAMD,kEAAkE;AAClE,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,WAAW,EAAE,CAExE;AAED,6CAA6C;AAC7C,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,EAAE,EAAE,MAAM,GACT,WAAW,GAAG,SAAS,CAEzB;AAED;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CACpC,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,aAAa,CAAC,QAAQ,CAAC,EAC/B,SAAS,EAAE,aAAa,CAAC,WAAW,CAAC,EACrC,WAAW,CAAC,EAAE,YAAY,EAC1B,OAAO,CAAC,EAAE,YAAY,GACrB,aAAa,CA8Df"}

package/dist/composition/probe/frontier.js

@@ -7,6 +7,7 @@ import { proposeLinkCandidates, proposeOrphanConnectors } from '../bridge-analys
 import { predictMissingBridges } from '../bridge-prediction.js';
 import { QUANTITY_IDENTIFICATIONS } from '../compose.js';
 import { candidateId, candidateIdIfSlug } from '../adjudication.js';
+import { logDesign, logDesignRank, piStructure } from './power-law.js';
 const ALIAS_PAIRS = new Set(QUANTITY_IDENTIFICATIONS.map((id) => candidateId(id.from, id.to)));
 /**
  * Stable pair token. Slug pairs keep the ledger id. Other symbols are
@@ -143,32 +144,49 @@ export function problemFromResidualGap(gap, target, governing, exploratory, hold
     if (gap.kind === 'relation-link' || gap.kind === 'regime-transition') {
         throw new RangeError(`problemFromResidualGap: ${gap.kind} is not a Product B search target; use upt discover`);
     }
+    // Identifiability is the rank of the log-design [1, log π₁, …, log πₖ] over the exploratory
+    // rows (MathTS `matrixRank`), against the k + 1 parameters of a rational power law: a
+    // prefactor and one exponent per π-group of the governing set. The row count is kept under
+    // its own name; it is not a count of independent observations (six rows with c/d = (a/b)²
+    // on every one of them carry two).
     const nObs = exploratory?.rows.length ?? 0;
-    const nPar = 1;
-    const identifiable = nObs >= nPar && nObs > 0;
+    const { groups } = piStructure(target, governing);
+    const k = groups.length;
+    const nPar = 1 + k;
+    const design = nObs > 0 ? logDesign(groups, exploratory.rows) : { rows: [], used: 0, skipped: 0 };
+    const rank = logDesignRank(design);
+    const status = nObs === 0 ? 'unknown' : rank >= nPar ? 'identifiable' : 'partially-identifiable';
+    const parameters = k === 0 ? 'a prefactor' : `a prefactor and ${k} exponent(s)`;
+    const reasons = status === 'unknown'
+        ? ['no observations: identifiability not assessed']
+        : status === 'identifiable'
+            ? [`rank ${rank} of the log-design over ${design.used} usable row(s) of ${nObs}: ${parameters} identifiable`]
+            : [
+                `rank ${rank} of the log-design over ${design.used} usable row(s) of ${nObs} (${design.skipped} with a non-positive π-group), ` +
+                    `against ${nPar} parameters (${parameters}): the exponents are not all identifiable; the monomial prefactor is fit on the linear scale`,
+            ];
     const enriched = {
         ...gap,
         identifiability: {
             kind: 'parametric',
             parametric: {
-                status: identifiable ? 'identifiable' : nObs === 0 ? 'unknown' : 'non-identifiable',
-                rank: identifiable ? nPar : 0,
+                status,
+                rank,
                 nParameters: nPar,
-                nIndependentObservations: nObs,
-                reasons: identifiable
-                    ? [`${nObs} observations vs ${nPar} free prefactor`]
-                    : ['insufficient observations for a unique prefactor'],
+                nIndependentObservations: rank,
+                nObservations: nObs,
+                reasons,
             },
         },
         searchability: {
-            searchable: identifiable || nObs === 0,
-            reasons: identifiable
-                ? ['parametric rank sufficient for a monomial prefactor']
-                : nObs === 0
-                    ? ['no data — structural generation only; status will be insufficient-evidence']
-                    : ['non-identifiable — do not search'],
+            searchable: true,
+            reasons: status === 'unknown'
+                ? ['no data — structural generation only; status will be insufficient-evidence']
+                : status === 'identifiable'
+                    ? ['parametric rank sufficient for a monomial prefactor and the π-group exponents']
+                    : ['the monomial prefactor is identifiable; the power-law fit abstains by itself on a rank-deficient design'],
         },
-        status: identifiable || nObs === 0 ? 'searchable' : 'underdetermined',
+        status: 'searchable',
     };
     return {
         gap: enriched,

package/dist/composition/probe/frontier.js.map

@@ -1 +1 @@
-{"version":3,"file":"frontier.js","sourceRoot":"","sources":["../../../src/composition/probe/frontier.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,qBAAqB,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AACvF,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,EAAE,wBAAwB,EAAE,MAAM,eAAe,CAAC;AACzD,OAAO,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAIpE,MAAM,WAAW,GAAG,IAAI,GAAG,CACzB,wBAAwB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAClE,CAAC;AAEF;;;;GAIG;AACH,SAAS,YAAY,CAAC,CAAS,EAAE,CAAS;IACxC,MAAM,IAAI,GAAG,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxC,OAAO,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;AACjD,CAAC;AAED,SAAS,SAAS,CAAC,CAAS,EAAE,CAAS;IACrC,OAAO,WAAW,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AACzC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAA4B;IAC/D,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7C,MAAM,IAAI,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,IAAI,IAAI,KAAK,SAAS,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC1D,GAAG,CAAC,IAAI,CAAC;YACP,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,EAAE,eAAe;YACrB,YAAY,EAAE;gBACZ,EAAE,IAAI,EAAE,yBAAyB,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;gBAC5C,EAAE,IAAI,EAAE,yBAAyB,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;aAC7C;YACD,YAAY,EAAE,EAAE;YAChB,OAAO,EAAE,EAAE;YACX,WAAW,EAAE,EAAE;YACf,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC;YAC7B,QAAQ,EAAE;gBACR,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,EAAE;gBACzC,SAAS,EAAE,CAAC,gBAAgB,CAAC;aAC9B;YACD,eAAe,EAAE;gBACf,IAAI,EAAE,kBAAkB;gBACxB,UAAU,EAAE;oBACV,MAAM,EAAE,SAAS;oBACjB,OAAO,EAAE,CAAC,sDAAsD,CAAC;iBAClE;aACF;YACD,aAAa,EAAE;gBACb,UAAU,EAAE,KAAK;gBACjB,OAAO,EAAE,CAAC,mEAAmE,CAAC;aAC/E;YACD,MAAM,EAAE,YAAY;SACrB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,iBAAiB,CAAC,KAA4B;IAC5D,MAAM,MAAM,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAC;IAC9C,OAAO,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnC,EAAE,EAAE,WAAW,YAAY,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,YAAY,CAAC,EAAE;QAC/D,IAAI,EAAE,eAAwB;QAC9B,YAAY,EAAE;YACZ,EAAE,IAAI,EAAE,yBAAkC,EAAE,EAAE,EAAE,CAAC,CAAC,cAAc,EAAE;YAClE,EAAE,IAAI,EAAE,yBAAkC,EAAE,EAAE,EAAE,CAAC,CAAC,YAAY,EAAE;SACjE;QACD,YAAY,EAAE,EAAE;QAChB,OAAO,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,QAAQ,CAAC;QACnC,WAAW,EAAE,EAAE;QACf,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC;QAC7B,QAAQ,EAAE;YACR,OAAO,EAAE,UAAU,CAAC,CAAC,UAAU,eAAe,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,YAAY,EAAE;YAClF,SAAS,EAAE,CAAC,gBAAgB,CAAC;SAC9B;QACD,eAAe,EAAE;YACf,IAAI,EAAE,kBAA2B;YACjC,UAAU,EAAE,EAAE,MAAM,EAAE,SAAkB,EAAE,OAAO,EAAE,CAAC,qBAAqB,CAAC,EAAE;SAC7E;QACD,aAAa,EAAE;YACb,UAAU,EAAE,KAAK;YACjB,OAAO,EAAE,CAAC,0CAA0C,CAAC;SACtD;QACD,MAAM,EAAE,YAAqB;KAC9B,CAAC,CAAC,CAAC;AACN,CAAC;AAED,qEAAqE;AACrE,MAAM,UAAU,cAAc,CAAC,KAA4B;IACzD,MAAM,MAAM,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAC5C,OAAO,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACvC,EAAE,EAAE,aAAa,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE;QAClE,IAAI,EAAE,mBAA4B;QAClC,YAAY,EAAE,EAAE;QAChB,YAAY,EAAE,EAAE;QAChB,OAAO,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;QAC/B,WAAW,EAAE,EAAE;QACf,WAAW,EAAE,CAAC,mBAAmB,CAAC,CAAC,eAAe,EAAE,CAAC;QACrD,QAAQ,EAAE;YACR,OAAO,EAAE,qBAAqB,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,OAAO,QAAQ,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;YAC/E,SAAS,EAAE,CAAC,aAAa,CAAC;SAC3B;QACD,eAAe,EAAE;YACf,IAAI,EAAE,kBAA2B;YACjC,UAAU,EAAE,EAAE,MAAM,EAAE,SAAkB,EAAE,OAAO,EAAE,CAAC,iCAAiC,CAAC,EAAE;SACzF;QACD,aAAa,EAAE;YACb,UAAU,EAAE,KAAK;YACjB,OAAO,EAAE,CAAC,uEAAuE,CAAC;SACnF;QACD,MAAM,EAAE,YAAqB;KAC9B,CAAC,CAAC,CAAC;AACN,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS;IACzB,OAAO,CAAC,CAAC,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC3E,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,YAAY,CAAC,KAA4B;IACvD,OAAO,CAAC,GAAG,oBAAoB,CAAC,KAAK,CAAC,EAAE,GAAG,iBAAiB,CAAC,KAAK,CAAC,EAAE,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;AACjG,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,eAAe,CAC7B,KAA4B,EAC5B,EAAU;IAEV,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CACpC,GAAgB,EAChB,MAA+B,EAC/B,SAAqC,EACrC,WAA0B,EAC1B,OAAsB;IAEtB,IAAI,GAAG,CAAC,IAAI,KAAK,eAAe,IAAI,GAAG,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;QACrE,MAAM,IAAI,UAAU,CAClB,2BAA2B,GAAG,CAAC,IAAI,qDAAqD,CACzF,CAAC;IACJ,CAAC;IACD,MAAM,IAAI,GAAG,WAAW,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,CAAC,CAAC;IACf,MAAM,YAAY,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAgB;QAC5B,GAAG,GAAG;QACN,eAAe,EAAE;YACf,IAAI,EAAE,YAAY;YAClB,UAAU,EAAE;gBACV,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,kBAAkB;gBACnF,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,WAAW,EAAE,IAAI;gBACjB,wBAAwB,EAAE,IAAI;gBAC9B,OAAO,EAAE,YAAY;oBACnB,CAAC,CAAC,CAAC,GAAG,IAAI,oBAAoB,IAAI,iBAAiB,CAAC;oBACpD,CAAC,CAAC,CAAC,kDAAkD,CAAC;aACzD;SACF;QACD,aAAa,EAAE;YACb,UAAU,EAAE,YAAY,IAAI,IAAI,KAAK,CAAC;YACtC,OAAO,EAAE,YAAY;gBACnB,CAAC,CAAC,CAAC,qDAAqD,CAAC;gBACzD,CAAC,CAAC,IAAI,KAAK,CAAC;oBACV,CAAC,CAAC,CAAC,4EAA4E,CAAC;oBAChF,CAAC,CAAC,CAAC,kCAAkC,CAAC;SAC3C;QACD,MAAM,EAAE,YAAY,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,iBAAiB;KACtE,CAAC;IACF,OAAO;QACL,GAAG,EAAE,QAAQ;QACb,MAAM;QACN,SAAS;QACT,WAAW;QACX,OAAO;QACP,WAAW,EAAE,GAAG,CAAC,WAAW;QAC5B,WAAW,EAAE,GAAG,CAAC,WAAW;KAC7B,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Frontier scanners — wrap Product A surfaces; residual gaps are Product B.\n *\n * @module composition/probe/frontier\n */\n\nimport { proposeLinkCandidates, proposeOrphanConnectors } from '../bridge-analysis.js';\nimport { predictMissingBridges } from '../bridge-prediction.js';\nimport { QUANTITY_IDENTIFICATIONS } from '../compose.js';\nimport { candidateId, candidateIdIfSlug } from '../adjudication.js';\nimport type { BridgeEdge } from '../edge.js';\nimport type { FrontierGap, ProbeDataset, SearchProblem } from './types.js';\n\nconst ALIAS_PAIRS = new Set(\n  QUANTITY_IDENTIFICATIONS.map((id) => candidateId(id.from, id.to)),\n);\n\n/**\n * Stable pair token. Slug pairs keep the ledger id. Other symbols are\n * length-prefixed under `raw:` so a `~` inside a name cannot alias two\n * pairs, and the token cannot collide with a kebab `candidateId`.\n */\nfunction gapPairToken(a: string, b: string): string {\n  const slug = candidateIdIfSlug(a, b);\n  if (slug !== undefined) return slug;\n  const [x, y] = a <= b ? [a, b] : [b, a];\n  return `raw:${x.length}:${x}~${y.length}:${y}`;\n}\n\nfunction linkGapId(a: string, b: string): string {\n  return `fg-link-${gapPairToken(a, b)}`;\n}\n\n/**\n * Project Product A link candidates to `relation-link` gaps.\n * Registered quantity identifications are not gaps.\n *\n * @internal\n */\nexport function wrapRelationLinkGaps(edges: readonly BridgeEdge[]): FrontierGap[] {\n  const out: FrontierGap[] = [];\n  for (const c of proposeLinkCandidates(edges)) {\n    const slug = candidateIdIfSlug(c.a, c.b);\n    if (slug !== undefined && ALIAS_PAIRS.has(slug)) continue;\n    out.push({\n      id: linkGapId(c.a, c.b),\n      kind: 'relation-link',\n      participants: [\n        { kind: 'quantity-identification', id: c.a },\n        { kind: 'quantity-identification', id: c.b },\n      ],\n      observations: [],\n      regimes: [],\n      assumptions: [],\n      constraints: [`dim:${c.dim}`],\n      evidence: {\n        summary: `${c.a} ≟ ${c.b} share ${c.dim}`,\n        sourceIds: ['upt candidates'],\n      },\n      identifiability: {\n        kind: 'graph-structural',\n        parametric: {\n          status: 'unknown',\n          reasons: ['identification gaps are Product A — use upt discover'],\n        },\n      },\n      searchability: {\n        searchable: false,\n        reasons: ['relation-link gaps are reviewed by upt discover, not probe search'],\n      },\n      status: 'identified',\n    });\n  }\n  return out.sort((x, y) => x.id.localeCompare(y.id));\n}\n\n/** Isolated-bridge connectors as relation-link gaps. @internal */\nexport function wrapConnectorGaps(edges: readonly BridgeEdge[]): FrontierGap[] {\n  const report = proposeOrphanConnectors(edges);\n  return report.connectors.map((c) => ({\n    id: `fg-conn-${gapPairToken(c.orphanQuantity, c.coreQuantity)}`,\n    kind: 'relation-link' as const,\n    participants: [\n      { kind: 'quantity-identification' as const, id: c.orphanQuantity },\n      { kind: 'quantity-identification' as const, id: c.coreQuantity },\n    ],\n    observations: [],\n    regimes: [c.orphanEdge, c.coreEdge],\n    assumptions: [],\n    constraints: [`dim:${c.dim}`],\n    evidence: {\n      summary: `orphan ${c.orphanEdge} ≟ core via ${c.orphanQuantity}~${c.coreQuantity}`,\n      sourceIds: ['upt connectors'],\n    },\n    identifiability: {\n      kind: 'graph-structural' as const,\n      parametric: { status: 'unknown' as const, reasons: ['Product A connector'] },\n    },\n    searchability: {\n      searchable: false,\n      reasons: ['connectors are Product A review surfaces'],\n    },\n    status: 'identified' as const,\n  }));\n}\n\n/** Empty (scale×force) cells as regime-transition gaps. @internal */\nexport function wrapRegimeGaps(edges: readonly BridgeEdge[]): FrontierGap[] {\n  const report = predictMissingBridges(edges);\n  return report.predictions.map((p, i) => ({\n    id: `fg-regime-${i}-${hashSlug(p.regimeA)}-${hashSlug(p.regimeB)}`,\n    kind: 'regime-transition' as const,\n    participants: [],\n    observations: [],\n    regimes: [p.regimeA, p.regimeB],\n    assumptions: [],\n    constraints: [`sharedNeighbors:${p.sharedNeighbors}`],\n    evidence: {\n      summary: `empty regime pair ${p.regimeA} ↔ ${p.regimeB} via ${p.via.join(',')}`,\n      sourceIds: ['upt predict'],\n    },\n    identifiability: {\n      kind: 'graph-structural' as const,\n      parametric: { status: 'unknown' as const, reasons: ['structural triadic closure only'] },\n    },\n    searchability: {\n      searchable: false,\n      reasons: ['regime predictions are structural hypotheses, not expression searches'],\n    },\n    status: 'identified' as const,\n  }));\n}\n\nfunction hashSlug(s: string): string {\n  return s.replace(/[^a-z0-9]+/gi, '-').replace(/^-|-$/g, '').slice(0, 40);\n}\n\n/** Combined read-only frontier (Product A wrappers). @internal */\nexport function scanFrontier(edges: readonly BridgeEdge[]): FrontierGap[] {\n  return [...wrapRelationLinkGaps(edges), ...wrapConnectorGaps(edges), ...wrapRegimeGaps(edges)];\n}\n\n/** Look up a wrapped gap by id. @internal */\nexport function findFrontierGap(\n  edges: readonly BridgeEdge[],\n  id: string,\n): FrontierGap | undefined {\n  return scanFrontier(edges).find((g) => g.id === id);\n}\n\n/**\n * Build a Product B search problem for an unexplained-observation /\n * prediction-residual gap. Relation-link and regime-transition gaps are\n * refused; the error names `upt discover`.\n *\n * @internal\n */\nexport function problemFromResidualGap(\n  gap: FrontierGap,\n  target: SearchProblem['target'],\n  governing: SearchProblem['governing'],\n  exploratory?: ProbeDataset,\n  holdout?: ProbeDataset,\n): SearchProblem {\n  if (gap.kind === 'relation-link' || gap.kind === 'regime-transition') {\n    throw new RangeError(\n      `problemFromResidualGap: ${gap.kind} is not a Product B search target; use upt discover`,\n    );\n  }\n  const nObs = exploratory?.rows.length ?? 0;\n  const nPar = 1;\n  const identifiable = nObs >= nPar && nObs > 0;\n  const enriched: FrontierGap = {\n    ...gap,\n    identifiability: {\n      kind: 'parametric',\n      parametric: {\n        status: identifiable ? 'identifiable' : nObs === 0 ? 'unknown' : 'non-identifiable',\n        rank: identifiable ? nPar : 0,\n        nParameters: nPar,\n        nIndependentObservations: nObs,\n        reasons: identifiable\n          ? [`${nObs} observations vs ${nPar} free prefactor`]\n          : ['insufficient observations for a unique prefactor'],\n      },\n    },\n    searchability: {\n      searchable: identifiable || nObs === 0,\n      reasons: identifiable\n        ? ['parametric rank sufficient for a monomial prefactor']\n        : nObs === 0\n          ? ['no data — structural generation only; status will be insufficient-evidence']\n          : ['non-identifiable — do not search'],\n    },\n    status: identifiable || nObs === 0 ? 'searchable' : 'underdetermined',\n  };\n  return {\n    gap: enriched,\n    target,\n    governing,\n    exploratory,\n    holdout,\n    discrepancy: gap.discrepancy,\n    assumptions: gap.assumptions,\n  };\n}\n"]}
+{"version":3,"file":"frontier.js","sourceRoot":"","sources":["../../../src/composition/probe/frontier.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,qBAAqB,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AACvF,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,EAAE,wBAAwB,EAAE,MAAM,eAAe,CAAC;AACzD,OAAO,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAGpE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAEvE,MAAM,WAAW,GAAG,IAAI,GAAG,CACzB,wBAAwB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAClE,CAAC;AAEF;;;;GAIG;AACH,SAAS,YAAY,CAAC,CAAS,EAAE,CAAS;IACxC,MAAM,IAAI,GAAG,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxC,OAAO,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;AACjD,CAAC;AAED,SAAS,SAAS,CAAC,CAAS,EAAE,CAAS;IACrC,OAAO,WAAW,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AACzC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAA4B;IAC/D,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7C,MAAM,IAAI,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,IAAI,IAAI,KAAK,SAAS,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC1D,GAAG,CAAC,IAAI,CAAC;YACP,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,EAAE,eAAe;YACrB,YAAY,EAAE;gBACZ,EAAE,IAAI,EAAE,yBAAyB,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;gBAC5C,EAAE,IAAI,EAAE,yBAAyB,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;aAC7C;YACD,YAAY,EAAE,EAAE;YAChB,OAAO,EAAE,EAAE;YACX,WAAW,EAAE,EAAE;YACf,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC;YAC7B,QAAQ,EAAE;gBACR,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,EAAE;gBACzC,SAAS,EAAE,CAAC,gBAAgB,CAAC;aAC9B;YACD,eAAe,EAAE;gBACf,IAAI,EAAE,kBAAkB;gBACxB,UAAU,EAAE;oBACV,MAAM,EAAE,SAAS;oBACjB,OAAO,EAAE,CAAC,sDAAsD,CAAC;iBAClE;aACF;YACD,aAAa,EAAE;gBACb,UAAU,EAAE,KAAK;gBACjB,OAAO,EAAE,CAAC,mEAAmE,CAAC;aAC/E;YACD,MAAM,EAAE,YAAY;SACrB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,iBAAiB,CAAC,KAA4B;IAC5D,MAAM,MAAM,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAC;IAC9C,OAAO,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnC,EAAE,EAAE,WAAW,YAAY,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,YAAY,CAAC,EAAE;QAC/D,IAAI,EAAE,eAAwB;QAC9B,YAAY,EAAE;YACZ,EAAE,IAAI,EAAE,yBAAkC,EAAE,EAAE,EAAE,CAAC,CAAC,cAAc,EAAE;YAClE,EAAE,IAAI,EAAE,yBAAkC,EAAE,EAAE,EAAE,CAAC,CAAC,YAAY,EAAE;SACjE;QACD,YAAY,EAAE,EAAE;QAChB,OAAO,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,QAAQ,CAAC;QACnC,WAAW,EAAE,EAAE;QACf,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC;QAC7B,QAAQ,EAAE;YACR,OAAO,EAAE,UAAU,CAAC,CAAC,UAAU,eAAe,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,YAAY,EAAE;YAClF,SAAS,EAAE,CAAC,gBAAgB,CAAC;SAC9B;QACD,eAAe,EAAE;YACf,IAAI,EAAE,kBAA2B;YACjC,UAAU,EAAE,EAAE,MAAM,EAAE,SAAkB,EAAE,OAAO,EAAE,CAAC,qBAAqB,CAAC,EAAE;SAC7E;QACD,aAAa,EAAE;YACb,UAAU,EAAE,KAAK;YACjB,OAAO,EAAE,CAAC,0CAA0C,CAAC;SACtD;QACD,MAAM,EAAE,YAAqB;KAC9B,CAAC,CAAC,CAAC;AACN,CAAC;AAED,qEAAqE;AACrE,MAAM,UAAU,cAAc,CAAC,KAA4B;IACzD,MAAM,MAAM,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAC5C,OAAO,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACvC,EAAE,EAAE,aAAa,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE;QAClE,IAAI,EAAE,mBAA4B;QAClC,YAAY,EAAE,EAAE;QAChB,YAAY,EAAE,EAAE;QAChB,OAAO,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;QAC/B,WAAW,EAAE,EAAE;QACf,WAAW,EAAE,CAAC,mBAAmB,CAAC,CAAC,eAAe,EAAE,CAAC;QACrD,QAAQ,EAAE;YACR,OAAO,EAAE,qBAAqB,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,OAAO,QAAQ,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;YAC/E,SAAS,EAAE,CAAC,aAAa,CAAC;SAC3B;QACD,eAAe,EAAE;YACf,IAAI,EAAE,kBAA2B;YACjC,UAAU,EAAE,EAAE,MAAM,EAAE,SAAkB,EAAE,OAAO,EAAE,CAAC,iCAAiC,CAAC,EAAE;SACzF;QACD,aAAa,EAAE;YACb,UAAU,EAAE,KAAK;YACjB,OAAO,EAAE,CAAC,uEAAuE,CAAC;SACnF;QACD,MAAM,EAAE,YAAqB;KAC9B,CAAC,CAAC,CAAC;AACN,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS;IACzB,OAAO,CAAC,CAAC,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC3E,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,YAAY,CAAC,KAA4B;IACvD,OAAO,CAAC,GAAG,oBAAoB,CAAC,KAAK,CAAC,EAAE,GAAG,iBAAiB,CAAC,KAAK,CAAC,EAAE,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;AACjG,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,eAAe,CAC7B,KAA4B,EAC5B,EAAU;IAEV,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CACpC,GAAgB,EAChB,MAA+B,EAC/B,SAAqC,EACrC,WAA0B,EAC1B,OAAsB;IAEtB,IAAI,GAAG,CAAC,IAAI,KAAK,eAAe,IAAI,GAAG,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;QACrE,MAAM,IAAI,UAAU,CAClB,2BAA2B,GAAG,CAAC,IAAI,qDAAqD,CACzF,CAAC;IACJ,CAAC;IACD,4FAA4F;IAC5F,sFAAsF;IACtF,2FAA2F;IAC3F,0FAA0F;IAC1F,mCAAmC;IACnC,MAAM,IAAI,GAAG,WAAW,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IAC3C,MAAM,EAAE,MAAM,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAClD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IACnB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,WAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IACnG,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACnC,MAAM,MAAM,GACV,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,wBAAwB,CAAC;IACpF,MAAM,UAAU,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,mBAAmB,CAAC,cAAc,CAAC;IAChF,MAAM,OAAO,GACX,MAAM,KAAK,SAAS;QAClB,CAAC,CAAC,CAAC,+CAA+C,CAAC;QACnD,CAAC,CAAC,MAAM,KAAK,cAAc;YACzB,CAAC,CAAC,CAAC,QAAQ,IAAI,2BAA2B,MAAM,CAAC,IAAI,qBAAqB,IAAI,KAAK,UAAU,eAAe,CAAC;YAC7G,CAAC,CAAC;gBACE,QAAQ,IAAI,2BAA2B,MAAM,CAAC,IAAI,qBAAqB,IAAI,KAAK,MAAM,CAAC,OAAO,iCAAiC;oBAC7H,WAAW,IAAI,gBAAgB,UAAU,8FAA8F;aAC1I,CAAC;IACV,MAAM,QAAQ,GAAgB;QAC5B,GAAG,GAAG;QACN,eAAe,EAAE;YACf,IAAI,EAAE,YAAY;YAClB,UAAU,EAAE;gBACV,MAAM;gBACN,IAAI;gBACJ,WAAW,EAAE,IAAI;gBACjB,wBAAwB,EAAE,IAAI;gBAC9B,aAAa,EAAE,IAAI;gBACnB,OAAO;aACR;SACF;QACD,aAAa,EAAE;YACb,UAAU,EAAE,IAAI;YAChB,OAAO,EACL,MAAM,KAAK,SAAS;gBAClB,CAAC,CAAC,CAAC,4EAA4E,CAAC;gBAChF,CAAC,CAAC,MAAM,KAAK,cAAc;oBACzB,CAAC,CAAC,CAAC,+EAA+E,CAAC;oBACnF,CAAC,CAAC,CAAC,yGAAyG,CAAC;SACpH;QACD,MAAM,EAAE,YAAY;KACrB,CAAC;IACF,OAAO;QACL,GAAG,EAAE,QAAQ;QACb,MAAM;QACN,SAAS;QACT,WAAW;QACX,OAAO;QACP,WAAW,EAAE,GAAG,CAAC,WAAW;QAC5B,WAAW,EAAE,GAAG,CAAC,WAAW;KAC7B,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Frontier scanners — wrap Product A surfaces; residual gaps are Product B.\n *\n * @module composition/probe/frontier\n */\n\nimport { proposeLinkCandidates, proposeOrphanConnectors } from '../bridge-analysis.js';\nimport { predictMissingBridges } from '../bridge-prediction.js';\nimport { QUANTITY_IDENTIFICATIONS } from '../compose.js';\nimport { candidateId, candidateIdIfSlug } from '../adjudication.js';\nimport type { BridgeEdge } from '../edge.js';\nimport type { FrontierGap, ProbeDataset, SearchProblem } from './types.js';\nimport { logDesign, logDesignRank, piStructure } from './power-law.js';\n\nconst ALIAS_PAIRS = new Set(\n  QUANTITY_IDENTIFICATIONS.map((id) => candidateId(id.from, id.to)),\n);\n\n/**\n * Stable pair token. Slug pairs keep the ledger id. Other symbols are\n * length-prefixed under `raw:` so a `~` inside a name cannot alias two\n * pairs, and the token cannot collide with a kebab `candidateId`.\n */\nfunction gapPairToken(a: string, b: string): string {\n  const slug = candidateIdIfSlug(a, b);\n  if (slug !== undefined) return slug;\n  const [x, y] = a <= b ? [a, b] : [b, a];\n  return `raw:${x.length}:${x}~${y.length}:${y}`;\n}\n\nfunction linkGapId(a: string, b: string): string {\n  return `fg-link-${gapPairToken(a, b)}`;\n}\n\n/**\n * Project Product A link candidates to `relation-link` gaps.\n * Registered quantity identifications are not gaps.\n *\n * @internal\n */\nexport function wrapRelationLinkGaps(edges: readonly BridgeEdge[]): FrontierGap[] {\n  const out: FrontierGap[] = [];\n  for (const c of proposeLinkCandidates(edges)) {\n    const slug = candidateIdIfSlug(c.a, c.b);\n    if (slug !== undefined && ALIAS_PAIRS.has(slug)) continue;\n    out.push({\n      id: linkGapId(c.a, c.b),\n      kind: 'relation-link',\n      participants: [\n        { kind: 'quantity-identification', id: c.a },\n        { kind: 'quantity-identification', id: c.b },\n      ],\n      observations: [],\n      regimes: [],\n      assumptions: [],\n      constraints: [`dim:${c.dim}`],\n      evidence: {\n        summary: `${c.a} ≟ ${c.b} share ${c.dim}`,\n        sourceIds: ['upt candidates'],\n      },\n      identifiability: {\n        kind: 'graph-structural',\n        parametric: {\n          status: 'unknown',\n          reasons: ['identification gaps are Product A — use upt discover'],\n        },\n      },\n      searchability: {\n        searchable: false,\n        reasons: ['relation-link gaps are reviewed by upt discover, not probe search'],\n      },\n      status: 'identified',\n    });\n  }\n  return out.sort((x, y) => x.id.localeCompare(y.id));\n}\n\n/** Isolated-bridge connectors as relation-link gaps. @internal */\nexport function wrapConnectorGaps(edges: readonly BridgeEdge[]): FrontierGap[] {\n  const report = proposeOrphanConnectors(edges);\n  return report.connectors.map((c) => ({\n    id: `fg-conn-${gapPairToken(c.orphanQuantity, c.coreQuantity)}`,\n    kind: 'relation-link' as const,\n    participants: [\n      { kind: 'quantity-identification' as const, id: c.orphanQuantity },\n      { kind: 'quantity-identification' as const, id: c.coreQuantity },\n    ],\n    observations: [],\n    regimes: [c.orphanEdge, c.coreEdge],\n    assumptions: [],\n    constraints: [`dim:${c.dim}`],\n    evidence: {\n      summary: `orphan ${c.orphanEdge} ≟ core via ${c.orphanQuantity}~${c.coreQuantity}`,\n      sourceIds: ['upt connectors'],\n    },\n    identifiability: {\n      kind: 'graph-structural' as const,\n      parametric: { status: 'unknown' as const, reasons: ['Product A connector'] },\n    },\n    searchability: {\n      searchable: false,\n      reasons: ['connectors are Product A review surfaces'],\n    },\n    status: 'identified' as const,\n  }));\n}\n\n/** Empty (scale×force) cells as regime-transition gaps. @internal */\nexport function wrapRegimeGaps(edges: readonly BridgeEdge[]): FrontierGap[] {\n  const report = predictMissingBridges(edges);\n  return report.predictions.map((p, i) => ({\n    id: `fg-regime-${i}-${hashSlug(p.regimeA)}-${hashSlug(p.regimeB)}`,\n    kind: 'regime-transition' as const,\n    participants: [],\n    observations: [],\n    regimes: [p.regimeA, p.regimeB],\n    assumptions: [],\n    constraints: [`sharedNeighbors:${p.sharedNeighbors}`],\n    evidence: {\n      summary: `empty regime pair ${p.regimeA} ↔ ${p.regimeB} via ${p.via.join(',')}`,\n      sourceIds: ['upt predict'],\n    },\n    identifiability: {\n      kind: 'graph-structural' as const,\n      parametric: { status: 'unknown' as const, reasons: ['structural triadic closure only'] },\n    },\n    searchability: {\n      searchable: false,\n      reasons: ['regime predictions are structural hypotheses, not expression searches'],\n    },\n    status: 'identified' as const,\n  }));\n}\n\nfunction hashSlug(s: string): string {\n  return s.replace(/[^a-z0-9]+/gi, '-').replace(/^-|-$/g, '').slice(0, 40);\n}\n\n/** Combined read-only frontier (Product A wrappers). @internal */\nexport function scanFrontier(edges: readonly BridgeEdge[]): FrontierGap[] {\n  return [...wrapRelationLinkGaps(edges), ...wrapConnectorGaps(edges), ...wrapRegimeGaps(edges)];\n}\n\n/** Look up a wrapped gap by id. @internal */\nexport function findFrontierGap(\n  edges: readonly BridgeEdge[],\n  id: string,\n): FrontierGap | undefined {\n  return scanFrontier(edges).find((g) => g.id === id);\n}\n\n/**\n * Build a Product B search problem for an unexplained-observation /\n * prediction-residual gap. Relation-link and regime-transition gaps are\n * refused; the error names `upt discover`.\n *\n * @internal\n */\nexport function problemFromResidualGap(\n  gap: FrontierGap,\n  target: SearchProblem['target'],\n  governing: SearchProblem['governing'],\n  exploratory?: ProbeDataset,\n  holdout?: ProbeDataset,\n): SearchProblem {\n  if (gap.kind === 'relation-link' || gap.kind === 'regime-transition') {\n    throw new RangeError(\n      `problemFromResidualGap: ${gap.kind} is not a Product B search target; use upt discover`,\n    );\n  }\n  // Identifiability is the rank of the log-design [1, log π₁, …, log πₖ] over the exploratory\n  // rows (MathTS `matrixRank`), against the k + 1 parameters of a rational power law: a\n  // prefactor and one exponent per π-group of the governing set. The row count is kept under\n  // its own name; it is not a count of independent observations (six rows with c/d = (a/b)²\n  // on every one of them carry two).\n  const nObs = exploratory?.rows.length ?? 0;\n  const { groups } = piStructure(target, governing);\n  const k = groups.length;\n  const nPar = 1 + k;\n  const design = nObs > 0 ? logDesign(groups, exploratory!.rows) : { rows: [], used: 0, skipped: 0 };\n  const rank = logDesignRank(design);\n  const status: NonNullable<FrontierGap['identifiability']['parametric']>['status'] =\n    nObs === 0 ? 'unknown' : rank >= nPar ? 'identifiable' : 'partially-identifiable';\n  const parameters = k === 0 ? 'a prefactor' : `a prefactor and ${k} exponent(s)`;\n  const reasons =\n    status === 'unknown'\n      ? ['no observations: identifiability not assessed']\n      : status === 'identifiable'\n        ? [`rank ${rank} of the log-design over ${design.used} usable row(s) of ${nObs}: ${parameters} identifiable`]\n        : [\n            `rank ${rank} of the log-design over ${design.used} usable row(s) of ${nObs} (${design.skipped} with a non-positive π-group), ` +\n              `against ${nPar} parameters (${parameters}): the exponents are not all identifiable; the monomial prefactor is fit on the linear scale`,\n          ];\n  const enriched: FrontierGap = {\n    ...gap,\n    identifiability: {\n      kind: 'parametric',\n      parametric: {\n        status,\n        rank,\n        nParameters: nPar,\n        nIndependentObservations: rank,\n        nObservations: nObs,\n        reasons,\n      },\n    },\n    searchability: {\n      searchable: true,\n      reasons:\n        status === 'unknown'\n          ? ['no data — structural generation only; status will be insufficient-evidence']\n          : status === 'identifiable'\n            ? ['parametric rank sufficient for a monomial prefactor and the π-group exponents']\n            : ['the monomial prefactor is identifiable; the power-law fit abstains by itself on a rank-deficient design'],\n    },\n    status: 'searchable',\n  };\n  return {\n    gap: enriched,\n    target,\n    governing,\n    exploratory,\n    holdout,\n    discrepancy: gap.discrepancy,\n    assumptions: gap.assumptions,\n  };\n}\n"]}

package/dist/composition/probe/generator.d.ts

@@ -8,17 +8,44 @@ import type { ExprNode } from '../../dimensional/ast-types.js';
 import { type DimensionalDeterminationResult } from '../../dimensional/buckingham.js';
 import type { DimensionalVariableRef, SearchBudget, SearchProblem } from './types.js';
 import { type BudgetState } from './search-budget.js';
+import { type PowerLawFit } from './power-law.js';
+/** The power-law fit over the π-groups, re-exported beside the generator that emits it. */
+export { powerLawDetermination, powerLawWording, rationalizeExponent } from './power-law.js';
+/** The power-law fit's result types: the determination, one fitted exponent, and a recovered fit. */
+export type { PowerLawDetermination, PowerLawExponent, PowerLawFit } from './power-law.js';
+/** A candidate that a generator emits, before scoring and falsification. */
 export interface RawCandidate {
     readonly expression: ExprNode;
     readonly monomial: Readonly<Record<string, number>> | null;
     readonly originNote: string;
+    /** Set on a candidate the power-law fit produced: its exponents, their errors and R². */
+    readonly powerLaw?: PowerLawFit;
 }
-/** Build `Π governing^exp` as an `ExprNode`. @internal */
+/**
+ * Build `Π governing^exp` as an `ExprNode`: ONE product, negative exponents kept, names in
+ * code-unit order (`sort()`).
+ *
+ * This is not merged with `fromMonomial` (composition/proposed-bridges.ts), which writes a
+ * numerator over a denominator with positive exponents and orders names by `localeCompare`.
+ * The two trees differ for the same monomial (`Z·a^-0.5` against `Z/a^0.5`, and `Z` before `a`
+ * here, after it there), and both are printed (`upt probe` candidates, `upt discover --derive`
+ * proposals) and hashed, so one builder would move printed text. They share `symbolPower`, the
+ * one factor that is the same in both (tests/composition/monomial-builders.test.ts).
+ *
+ * @internal
+ */
 export declare function monomialToExpr(monomial: Readonly<Record<string, number>>, vars: readonly DimensionalVariableRef[]): ExprNode;
 /**
  * Yield dimensionally valid monomials for `problem`, honouring the budget.
  * Invalid typed constructions are skipped (never evaluated).
  *
+ * Two paths. The unique monomial of {@link nativeDetermination}, when there
+ * is one. Then, when the governing set leaves π-groups (the full determination
+ * is not unique) and the problem has exploratory rows, the rational power law
+ * over those groups that {@link powerLawDetermination} fits on THOSE ROWS
+ * ONLY; the holdout rows are never read here. A fit whose exponents all
+ * rationalise to 0 is the base monomial again and is kept once.
+ *
  * @internal
  */
 export declare function generateNative(problem: SearchProblem, state: BudgetState): Iterable<RawCandidate>;
@@ -35,6 +62,8 @@ export declare function nativeDetermination(problem: SearchProblem): {
     det: DimensionalDeterminationResult;
     unsearched: string[];
 };
+/** Whether a candidate is within the budget's AST depth and operator caps. @internal */
+export declare function withinAstCaps(node: ExprNode, budget: SearchBudget): boolean;
 /** Expose budget type for callers. @internal */
 export type { SearchBudget };
 //# sourceMappingURL=generator.d.ts.map

package/dist/composition/probe/generator.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"generator.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/generator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAG/D,OAAO,EAA2B,KAAK,8BAA8B,EAAE,MAAM,iCAAiC,CAAC;AAE/G,OAAO,KAAK,EAAE,sBAAsB,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AACtF,OAAO,EAAoB,KAAK,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAExE,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC;IAC9B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC;IAC3D,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,0DAA0D;AAC1D,wBAAgB,cAAc,CAC5B,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC1C,IAAI,EAAE,SAAS,sBAAsB,EAAE,GACtC,QAAQ,CAqBV;AAQD;;;;;GAKG;AACH,wBAAiB,cAAc,CAC7B,OAAO,EAAE,aAAa,EACtB,KAAK,EAAE,WAAW,GACjB,QAAQ,CAAC,YAAY,CAAC,CA4BxB;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,aAAa,GAAG;IAC3D,GAAG,EAAE,8BAA8B,CAAC;IACpC,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB,CAaA;AAyCD,gDAAgD;AAChD,YAAY,EAAE,YAAY,EAAE,CAAC"}
+{"version":3,"file":"generator.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/generator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAG/D,OAAO,EAA2B,KAAK,8BAA8B,EAAE,MAAM,iCAAiC,CAAC;AAG/G,OAAO,KAAK,EAAE,sBAAsB,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AACtF,OAAO,EAAoB,KAAK,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACxE,OAAO,EAAyB,KAAK,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAEzE,2FAA2F;AAC3F,OAAO,EAAE,qBAAqB,EAAE,eAAe,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAC7F,qGAAqG;AACrG,YAAY,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAE3F,4EAA4E;AAC5E,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC;IAC9B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC;IAC3D,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,yFAAyF;IACzF,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC;CACjC;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAC5B,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC1C,IAAI,EAAE,SAAS,sBAAsB,EAAE,GACtC,QAAQ,CAaV;AAgCD;;;;;;;;;;;;GAYG;AACH,wBAAiB,cAAc,CAC7B,OAAO,EAAE,aAAa,EACtB,KAAK,EAAE,WAAW,GACjB,QAAQ,CAAC,YAAY,CAAC,CAmBxB;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,aAAa,GAAG;IAC3D,GAAG,EAAE,8BAA8B,CAAC;IACpC,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB,CAYA;AAaD,wFAAwF;AACxF,wBAAgB,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,GAAG,OAAO,CAE3E;AA8BD,gDAAgD;AAChD,YAAY,EAAE,YAAY,EAAE,CAAC"}

package/dist/composition/probe/generator.js

@@ -5,11 +5,27 @@
  * @module composition/probe/generator
  */
 import { DIMENSIONLESS } from '../../dimensional/types.js';
-import { sym } from '../../dimensional/ast-builders.js';
+import { sym, symbolPower } from '../../dimensional/ast-builders.js';
 import { dimensionallyDetermines } from '../../dimensional/buckingham.js';
 import { validate } from '../../dimensional/validator.js';
+import { isDimensionless } from '../../dimensional/algebra.js';
 import { canEmitCandidate } from './search-budget.js';
-/** Build `Π governing^exp` as an `ExprNode`. @internal */
+import { powerLawDetermination } from './power-law.js';
+/** The power-law fit over the π-groups, re-exported beside the generator that emits it. */
+export { powerLawDetermination, powerLawWording, rationalizeExponent } from './power-law.js';
+/**
+ * Build `Π governing^exp` as an `ExprNode`: ONE product, negative exponents kept, names in
+ * code-unit order (`sort()`).
+ *
+ * This is not merged with `fromMonomial` (composition/proposed-bridges.ts), which writes a
+ * numerator over a denominator with positive exponents and orders names by `localeCompare`.
+ * The two trees differ for the same monomial (`Z·a^-0.5` against `Z/a^0.5`, and `Z` before `a`
+ * here, after it there), and both are printed (`upt probe` candidates, `upt discover --derive`
+ * proposals) and hashed, so one builder would move printed text. They share `symbolPower`, the
+ * one factor that is the same in both (tests/composition/monomial-builders.test.ts).
+ *
+ * @internal
+ */
 export function monomialToExpr(monomial, vars) {
     const byName = new Map(vars.map((v) => [v.name, v.dim]));
     const factors = [];
@@ -20,16 +36,7 @@ export function monomialToExpr(monomial, vars) {
         const dim = byName.get(name);
         if (!dim)
             throw new RangeError(`monomialToExpr: unknown variable '${name}'`);
-        const base = sym(name, dim);
-        if (exp === 1)
-            factors.push(base);
-        else {
-            factors.push({
-                kind: 'op',
-                op: '^',
-                args: [base, sym(String(exp), DIMENSIONLESS)],
-            });
-        }
+        factors.push(symbolPower(sym(name, dim), exp));
     }
     if (factors.length === 0)
         return sym('1', DIMENSIONLESS);
@@ -43,39 +50,51 @@ function* extraPrefactors(base) {
     yield { kind: 'op', op: '*', args: [sym('2pi', DIMENSIONLESS), base] };
 }
 /**
- * Yield dimensionally valid monomials for `problem`, honouring the budget.
- * Invalid typed constructions are skipped (never evaluated).
- *
- * @internal
+ * Yield `expr` and its registered prefactor variants that validate and fit the budget's
+ * depth and operator caps; `seen` keeps one copy of each construction across the paths.
  */
-export function* generateNative(problem, state) {
-    const { det } = nativeDetermination(problem);
-    if (!det.determined || !det.monomial)
-        return;
-    const expr = monomialToExpr(det.monomial, [problem.target, ...problem.governing]);
-    const seen = new Set();
+function* emitWithPrefactors(expr, monomial, originNote, powerLaw, state, seen) {
     for (const candidate of extraPrefactors(expr)) {
         if (!canEmitCandidate(state))
             return;
         if (validate(candidate).ok !== true)
             continue;
-        // Depth / operator caps
-        const depth = astDepth(candidate);
-        const ops = opCount(candidate);
-        if (depth > state.budget.maxAstDepth)
-            continue;
-        if (ops > state.budget.maxOperators)
+        if (!withinAstCaps(candidate, state.budget))
             continue;
         const key = JSON.stringify(candidate);
         if (seen.has(key))
             continue;
         seen.add(key);
         state.candidates += 1;
-        yield {
-            expression: candidate,
-            monomial: det.monomial,
-            originNote: det.reason,
-        };
+        yield { expression: candidate, monomial, originNote, ...(powerLaw ? { powerLaw } : {}) };
+    }
+}
+/**
+ * Yield dimensionally valid monomials for `problem`, honouring the budget.
+ * Invalid typed constructions are skipped (never evaluated).
+ *
+ * Two paths. The unique monomial of {@link nativeDetermination}, when there
+ * is one. Then, when the governing set leaves π-groups (the full determination
+ * is not unique) and the problem has exploratory rows, the rational power law
+ * over those groups that {@link powerLawDetermination} fits on THOSE ROWS
+ * ONLY; the holdout rows are never read here. A fit whose exponents all
+ * rationalise to 0 is the base monomial again and is kept once.
+ *
+ * @internal
+ */
+export function* generateNative(problem, state) {
+    const vars = [problem.target, ...problem.governing];
+    const seen = new Set();
+    const { det } = nativeDetermination(problem);
+    if (det.determined && det.monomial) {
+        yield* emitWithPrefactors(monomialToExpr(det.monomial, vars), det.monomial, det.reason, undefined, state, seen);
+    }
+    if ((problem.exploratory?.rows.length ?? 0) > 0) {
+        const pl = powerLawDetermination(problem);
+        if (pl.kind === 'fit') {
+            const note = `power-law: ${pl.exponents.map((e) => `${e.group}^(${e.rational.numerator}/${e.rational.denominator})`).join(' · ')}`;
+            yield* emitWithPrefactors(monomialToExpr(pl.monomial, vars), pl.monomial, note, pl, state, seen);
+        }
     }
     if (problem.baseline && problem.discrepancy) {
         yield* generateCorrections(problem, state, seen);
@@ -94,11 +113,10 @@ export function nativeDetermination(problem) {
     const det = dimensionallyDetermines(problem.target, problem.governing);
     if (det.determined)
         return { det, unsearched: [] };
-    const isDimensionless = (g) => Object.values(g.dim).every((e) => e === 0);
-    const dimless = problem.governing.filter(isDimensionless);
+    const dimless = problem.governing.filter((g) => isDimensionless(g.dim));
     if (dimless.length === 0)
         return { det, unsearched: [] };
-    const reduced = dimensionallyDetermines(problem.target, problem.governing.filter((g) => !isDimensionless(g)));
+    const reduced = dimensionallyDetermines(problem.target, problem.governing.filter((g) => !isDimensionless(g.dim)));
     return reduced.determined
         ? { det: reduced, unsearched: dimless.map((g) => g.name) }
         : { det, unsearched: [] };
@@ -115,6 +133,10 @@ function opCount(node) {
         return 1 + node.args.reduce((n, a) => n + opCount(a), 0);
     return 0;
 }
+/** Whether a candidate is within the budget's AST depth and operator caps. @internal */
+export function withinAstCaps(node, budget) {
+    return astDepth(node) <= budget.maxAstDepth && opCount(node) <= budget.maxOperators;
+}
 /**
  * Additive / relative corrections: search a monomial of the same dimension
  * as the observable to add to (or scale) the baseline.

package/dist/composition/probe/generator.js.map

@@ -1 +1 @@
-{"version":3,"file":"generator.js","sourceRoot":"","sources":["../../../src/composition/probe/generator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAC3D,OAAO,EAAE,GAAG,EAAE,MAAM,mCAAmC,CAAC;AACxD,OAAO,EAAE,uBAAuB,EAAuC,MAAM,iCAAiC,CAAC;AAC/G,OAAO,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAE1D,OAAO,EAAE,gBAAgB,EAAoB,MAAM,oBAAoB,CAAC;AAQxE,0DAA0D;AAC1D,MAAM,UAAU,cAAc,CAC5B,QAA0C,EAC1C,IAAuC;IAEvC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzD,MAAM,OAAO,GAAe,EAAE,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QAChD,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,GAAG,KAAK,CAAC;YAAE,SAAS;QACxB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,UAAU,CAAC,qCAAqC,IAAI,GAAG,CAAC,CAAC;QAC7E,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC5B,IAAI,GAAG,KAAK,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAC7B,CAAC;YACJ,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,IAAI;gBACV,EAAE,EAAE,GAAG;gBACP,IAAI,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,aAAa,CAAC,CAAC;aAC9C,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IACzD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;IAC5C,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAChD,CAAC;AAED,QAAQ,CAAC,CAAC,eAAe,CAAC,IAAc;IACtC,MAAM,IAAI,CAAC;IACX,8EAA8E;IAC9E,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;AACzE,CAAC;AAED;;;;;GAKG;AACH,MAAM,SAAS,CAAC,CAAC,cAAc,CAC7B,OAAsB,EACtB,KAAkB;IAElB,MAAM,EAAE,GAAG,EAAE,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAC7C,IAAI,CAAC,GAAG,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,QAAQ;QAAE,OAAO;IAE7C,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;IAClF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,SAAS,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;YAAE,OAAO;QACrC,IAAI,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,IAAI;YAAE,SAAS;QAC9C,wBAAwB;QACxB,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;QAC/B,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,WAAW;YAAE,SAAS;QAC/C,IAAI,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,YAAY;YAAE,SAAS;QAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;QACtB,MAAM;YACJ,UAAU,EAAE,SAAS;YACrB,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,UAAU,EAAE,GAAG,CAAC,MAAM;SACvB,CAAC;IACJ,CAAC;IAED,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;QAC5C,KAAK,CAAC,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IACnD,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAsB;IAIxD,MAAM,GAAG,GAAG,uBAAuB,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;IACvE,IAAI,GAAG,CAAC,UAAU;QAAE,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IACnD,MAAM,eAAe,GAAG,CAAC,CAAyB,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAClG,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;IAC1D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IACzD,MAAM,OAAO,GAAG,uBAAuB,CACrC,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CACrD,CAAC;IACF,OAAO,OAAO,CAAC,UAAU;QACvB,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;QAC1D,CAAC,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;AAC9B,CAAC;AAED,SAAS,QAAQ,CAAC,IAAc;IAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC3E,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzF,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,OAAO,CAAC,IAAc;IAC7B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjF,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;GAGG;AACH,QAAQ,CAAC,CAAC,mBAAmB,CAC3B,OAAsB,EACtB,KAAkB,EAClB,IAAiB;IAEjB,MAAM,IAAI,GAAG,OAAO,CAAC,WAAY,CAAC,IAAI,CAAC;IACvC,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,cAAc;QAAE,OAAO;IAClF,MAAM,EAAE,GAAG,EAAE,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAC7C,IAAI,CAAC,GAAG,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,QAAQ;QAAE,OAAO;IAC7C,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;QAAE,OAAO;IACrC,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;IAClF,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAS,CAAC;IACnC,MAAM,QAAQ,GACZ,IAAI,KAAK,UAAU;QACjB,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE;QACjD,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;IAChH,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,IAAI;QAAE,OAAO;IAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACrC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO;IAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACd,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;IACtB,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,IAAI,EAAE,EAAE,CAAC;AAC3F,CAAC","sourcesContent":["/**\n * Native bounded grammar enumerator — dimensional monomials via Buckingham-π.\n * Deterministic visit order; seed-independent.\n *\n * @module composition/probe/generator\n */\n\nimport type { ExprNode } from '../../dimensional/ast-types.js';\nimport { DIMENSIONLESS } from '../../dimensional/types.js';\nimport { sym } from '../../dimensional/ast-builders.js';\nimport { dimensionallyDetermines, type DimensionalDeterminationResult } from '../../dimensional/buckingham.js';\nimport { validate } from '../../dimensional/validator.js';\nimport type { DimensionalVariableRef, SearchBudget, SearchProblem } from './types.js';\nimport { canEmitCandidate, type BudgetState } from './search-budget.js';\n\nexport interface RawCandidate {\n  readonly expression: ExprNode;\n  readonly monomial: Readonly<Record<string, number>> | null;\n  readonly originNote: string;\n}\n\n/** Build `Π governing^exp` as an `ExprNode`. @internal */\nexport function monomialToExpr(\n  monomial: Readonly<Record<string, number>>,\n  vars: readonly DimensionalVariableRef[],\n): ExprNode {\n  const byName = new Map(vars.map((v) => [v.name, v.dim]));\n  const factors: ExprNode[] = [];\n  for (const name of Object.keys(monomial).sort()) {\n    const exp = monomial[name];\n    if (exp === 0) continue;\n    const dim = byName.get(name);\n    if (!dim) throw new RangeError(`monomialToExpr: unknown variable '${name}'`);\n    const base = sym(name, dim);\n    if (exp === 1) factors.push(base);\n    else {\n      factors.push({\n        kind: 'op',\n        op: '^',\n        args: [base, sym(String(exp), DIMENSIONLESS)],\n      });\n    }\n  }\n  if (factors.length === 0) return sym('1', DIMENSIONLESS);\n  if (factors.length === 1) return factors[0];\n  return { kind: 'op', op: '*', args: factors };\n}\n\nfunction* extraPrefactors(base: ExprNode): Iterable<ExprNode> {\n  yield base;\n  // Registered `2pi` leaf (same normalForm as `base` — dimensionless constant).\n  yield { kind: 'op', op: '*', args: [sym('2pi', DIMENSIONLESS), base] };\n}\n\n/**\n * Yield dimensionally valid monomials for `problem`, honouring the budget.\n * Invalid typed constructions are skipped (never evaluated).\n *\n * @internal\n */\nexport function* generateNative(\n  problem: SearchProblem,\n  state: BudgetState,\n): Iterable<RawCandidate> {\n  const { det } = nativeDetermination(problem);\n  if (!det.determined || !det.monomial) return;\n\n  const expr = monomialToExpr(det.monomial, [problem.target, ...problem.governing]);\n  const seen = new Set<string>();\n  for (const candidate of extraPrefactors(expr)) {\n    if (!canEmitCandidate(state)) return;\n    if (validate(candidate).ok !== true) continue;\n    // Depth / operator caps\n    const depth = astDepth(candidate);\n    const ops = opCount(candidate);\n    if (depth > state.budget.maxAstDepth) continue;\n    if (ops > state.budget.maxOperators) continue;\n    const key = JSON.stringify(candidate);\n    if (seen.has(key)) continue;\n    seen.add(key);\n    state.candidates += 1;\n    yield {\n      expression: candidate,\n      monomial: det.monomial,\n      originNote: det.reason,\n    };\n  }\n\n  if (problem.baseline && problem.discrepancy) {\n    yield* generateCorrections(problem, state, seen);\n  }\n}\n\n/**\n * The monomial the native enumerator searches, and the dimensionless inputs it\n * leaves out (persona finding C2). A dimensionless input makes the monomial\n * non-unique, since any f(θ0) can multiply it, and the enumerator used to\n * produce nothing. When the monomial over ALL inputs is not unique, it is taken\n * from the DIMENSIONED inputs; `unsearched` names the dimensionless ones whose\n * function is not searched.\n * @internal\n */\nexport function nativeDetermination(problem: SearchProblem): {\n  det: DimensionalDeterminationResult;\n  unsearched: string[];\n} {\n  const det = dimensionallyDetermines(problem.target, problem.governing);\n  if (det.determined) return { det, unsearched: [] };\n  const isDimensionless = (g: DimensionalVariableRef) => Object.values(g.dim).every((e) => e === 0);\n  const dimless = problem.governing.filter(isDimensionless);\n  if (dimless.length === 0) return { det, unsearched: [] };\n  const reduced = dimensionallyDetermines(\n    problem.target,\n    problem.governing.filter((g) => !isDimensionless(g)),\n  );\n  return reduced.determined\n    ? { det: reduced, unsearched: dimless.map((g) => g.name) }\n    : { det, unsearched: [] };\n}\n\nfunction astDepth(node: ExprNode): number {\n  if (node.kind === 'op') return 1 + Math.max(0, ...node.args.map(astDepth));\n  if (node.kind === 'transcendental' || node.kind === 'abs') return 1 + astDepth(node.arg);\n  return 1;\n}\n\nfunction opCount(node: ExprNode): number {\n  if (node.kind === 'op') return 1 + node.args.reduce((n, a) => n + opCount(a), 0);\n  return 0;\n}\n\n/**\n * Additive / relative corrections: search a monomial of the same dimension\n * as the observable to add to (or scale) the baseline.\n */\nfunction* generateCorrections(\n  problem: SearchProblem,\n  state: BudgetState,\n  seen: Set<string>,\n): Iterable<RawCandidate> {\n  const kind = problem.discrepancy!.kind;\n  if (kind !== 'additive' && kind !== 'relative' && kind !== 'standardized') return;\n  const { det } = nativeDetermination(problem);\n  if (!det.determined || !det.monomial) return;\n  if (!canEmitCandidate(state)) return;\n  const corr = monomialToExpr(det.monomial, [problem.target, ...problem.governing]);\n  const baseline = problem.baseline!;\n  const combined: ExprNode =\n    kind === 'additive'\n      ? { kind: 'op', op: '+', args: [baseline, corr] }\n      : { kind: 'op', op: '*', args: [baseline, { kind: 'op', op: '+', args: [sym('1', DIMENSIONLESS), corr] }] };\n  if (validate(combined).ok !== true) return;\n  const key = JSON.stringify(combined);\n  if (seen.has(key)) return;\n  seen.add(key);\n  state.candidates += 1;\n  yield { expression: combined, monomial: det.monomial, originNote: `correction:${kind}` };\n}\n\n/** Expose budget type for callers. @internal */\nexport type { SearchBudget };\n"]}
+{"version":3,"file":"generator.js","sourceRoot":"","sources":["../../../src/composition/probe/generator.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAC3D,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EAAE,uBAAuB,EAAuC,MAAM,iCAAiC,CAAC;AAC/G,OAAO,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAC1D,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAE/D,OAAO,EAAE,gBAAgB,EAAoB,MAAM,oBAAoB,CAAC;AACxE,OAAO,EAAE,qBAAqB,EAAoB,MAAM,gBAAgB,CAAC;AAEzE,2FAA2F;AAC3F,OAAO,EAAE,qBAAqB,EAAE,eAAe,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAa7F;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,cAAc,CAC5B,QAA0C,EAC1C,IAAuC;IAEvC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzD,MAAM,OAAO,GAAe,EAAE,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QAChD,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,GAAG,KAAK,CAAC;YAAE,SAAS;QACxB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,UAAU,CAAC,qCAAqC,IAAI,GAAG,CAAC,CAAC;QAC7E,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IACzD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;IAC5C,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAChD,CAAC;AAED,QAAQ,CAAC,CAAC,eAAe,CAAC,IAAc;IACtC,MAAM,IAAI,CAAC;IACX,8EAA8E;IAC9E,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,aAAa,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;AACzE,CAAC;AAED;;;GAGG;AACH,QAAQ,CAAC,CAAC,kBAAkB,CAC1B,IAAc,EACd,QAA0C,EAC1C,UAAkB,EAClB,QAAiC,EACjC,KAAkB,EAClB,IAAiB;IAEjB,KAAK,MAAM,SAAS,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;YAAE,OAAO;QACrC,IAAI,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,IAAI;YAAE,SAAS;QAC9C,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,KAAK,CAAC,MAAM,CAAC;YAAE,SAAS;QACtD,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;QACtB,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IAC3F,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,SAAS,CAAC,CAAC,cAAc,CAC7B,OAAsB,EACtB,KAAkB;IAElB,MAAM,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,EAAE,GAAG,EAAE,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAC7C,IAAI,GAAG,CAAC,UAAU,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QACnC,KAAK,CAAC,CAAC,kBAAkB,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IAClH,CAAC;IAED,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAChD,MAAM,EAAE,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,cAAc,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,QAAS,CAAC,SAAS,IAAI,CAAC,CAAC,QAAS,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACrI,KAAK,CAAC,CAAC,kBAAkB,CAAC,cAAc,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACnG,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;QAC5C,KAAK,CAAC,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IACnD,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAsB;IAIxD,MAAM,GAAG,GAAG,uBAAuB,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;IACvE,IAAI,GAAG,CAAC,UAAU;QAAE,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IACnD,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IACzD,MAAM,OAAO,GAAG,uBAAuB,CACrC,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CACzD,CAAC;IACF,OAAO,OAAO,CAAC,UAAU;QACvB,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;QAC1D,CAAC,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;AAC9B,CAAC;AAED,SAAS,QAAQ,CAAC,IAAc;IAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC3E,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzF,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,OAAO,CAAC,IAAc;IAC7B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjF,OAAO,CAAC,CAAC;AACX,CAAC;AAED,wFAAwF;AACxF,MAAM,UAAU,aAAa,CAAC,IAAc,EAAE,MAAoB;IAChE,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,WAAW,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC;AACtF,CAAC;AAED;;;GAGG;AACH,QAAQ,CAAC,CAAC,mBAAmB,CAC3B,OAAsB,EACtB,KAAkB,EAClB,IAAiB;IAEjB,MAAM,IAAI,GAAG,OAAO,CAAC,WAAY,CAAC,IAAI,CAAC;IACvC,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,cAAc;QAAE,OAAO;IAClF,MAAM,EAAE,GAAG,EAAE,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAC7C,IAAI,CAAC,GAAG,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,QAAQ;QAAE,OAAO;IAC7C,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;QAAE,OAAO;IACrC,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;IAClF,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAS,CAAC;IACnC,MAAM,QAAQ,GACZ,IAAI,KAAK,UAAU;QACjB,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE;QACjD,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;IAChH,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,IAAI;QAAE,OAAO;IAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACrC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO;IAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACd,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;IACtB,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,IAAI,EAAE,EAAE,CAAC;AAC3F,CAAC","sourcesContent":["/**\n * Native bounded grammar enumerator — dimensional monomials via Buckingham-π.\n * Deterministic visit order; seed-independent.\n *\n * @module composition/probe/generator\n */\n\nimport type { ExprNode } from '../../dimensional/ast-types.js';\nimport { DIMENSIONLESS } from '../../dimensional/types.js';\nimport { sym, symbolPower } from '../../dimensional/ast-builders.js';\nimport { dimensionallyDetermines, type DimensionalDeterminationResult } from '../../dimensional/buckingham.js';\nimport { validate } from '../../dimensional/validator.js';\nimport { isDimensionless } from '../../dimensional/algebra.js';\nimport type { DimensionalVariableRef, SearchBudget, SearchProblem } from './types.js';\nimport { canEmitCandidate, type BudgetState } from './search-budget.js';\nimport { powerLawDetermination, type PowerLawFit } from './power-law.js';\n\n/** The power-law fit over the π-groups, re-exported beside the generator that emits it. */\nexport { powerLawDetermination, powerLawWording, rationalizeExponent } from './power-law.js';\n/** The power-law fit's result types: the determination, one fitted exponent, and a recovered fit. */\nexport type { PowerLawDetermination, PowerLawExponent, PowerLawFit } from './power-law.js';\n\n/** A candidate that a generator emits, before scoring and falsification. */\nexport interface RawCandidate {\n  readonly expression: ExprNode;\n  readonly monomial: Readonly<Record<string, number>> | null;\n  readonly originNote: string;\n  /** Set on a candidate the power-law fit produced: its exponents, their errors and R². */\n  readonly powerLaw?: PowerLawFit;\n}\n\n/**\n * Build `Π governing^exp` as an `ExprNode`: ONE product, negative exponents kept, names in\n * code-unit order (`sort()`).\n *\n * This is not merged with `fromMonomial` (composition/proposed-bridges.ts), which writes a\n * numerator over a denominator with positive exponents and orders names by `localeCompare`.\n * The two trees differ for the same monomial (`Z·a^-0.5` against `Z/a^0.5`, and `Z` before `a`\n * here, after it there), and both are printed (`upt probe` candidates, `upt discover --derive`\n * proposals) and hashed, so one builder would move printed text. They share `symbolPower`, the\n * one factor that is the same in both (tests/composition/monomial-builders.test.ts).\n *\n * @internal\n */\nexport function monomialToExpr(\n  monomial: Readonly<Record<string, number>>,\n  vars: readonly DimensionalVariableRef[],\n): ExprNode {\n  const byName = new Map(vars.map((v) => [v.name, v.dim]));\n  const factors: ExprNode[] = [];\n  for (const name of Object.keys(monomial).sort()) {\n    const exp = monomial[name];\n    if (exp === 0) continue;\n    const dim = byName.get(name);\n    if (!dim) throw new RangeError(`monomialToExpr: unknown variable '${name}'`);\n    factors.push(symbolPower(sym(name, dim), exp));\n  }\n  if (factors.length === 0) return sym('1', DIMENSIONLESS);\n  if (factors.length === 1) return factors[0];\n  return { kind: 'op', op: '*', args: factors };\n}\n\nfunction* extraPrefactors(base: ExprNode): Iterable<ExprNode> {\n  yield base;\n  // Registered `2pi` leaf (same normalForm as `base` — dimensionless constant).\n  yield { kind: 'op', op: '*', args: [sym('2pi', DIMENSIONLESS), base] };\n}\n\n/**\n * Yield `expr` and its registered prefactor variants that validate and fit the budget's\n * depth and operator caps; `seen` keeps one copy of each construction across the paths.\n */\nfunction* emitWithPrefactors(\n  expr: ExprNode,\n  monomial: Readonly<Record<string, number>>,\n  originNote: string,\n  powerLaw: PowerLawFit | undefined,\n  state: BudgetState,\n  seen: Set<string>,\n): Iterable<RawCandidate> {\n  for (const candidate of extraPrefactors(expr)) {\n    if (!canEmitCandidate(state)) return;\n    if (validate(candidate).ok !== true) continue;\n    if (!withinAstCaps(candidate, state.budget)) continue;\n    const key = JSON.stringify(candidate);\n    if (seen.has(key)) continue;\n    seen.add(key);\n    state.candidates += 1;\n    yield { expression: candidate, monomial, originNote, ...(powerLaw ? { powerLaw } : {}) };\n  }\n}\n\n/**\n * Yield dimensionally valid monomials for `problem`, honouring the budget.\n * Invalid typed constructions are skipped (never evaluated).\n *\n * Two paths. The unique monomial of {@link nativeDetermination}, when there\n * is one. Then, when the governing set leaves π-groups (the full determination\n * is not unique) and the problem has exploratory rows, the rational power law\n * over those groups that {@link powerLawDetermination} fits on THOSE ROWS\n * ONLY; the holdout rows are never read here. A fit whose exponents all\n * rationalise to 0 is the base monomial again and is kept once.\n *\n * @internal\n */\nexport function* generateNative(\n  problem: SearchProblem,\n  state: BudgetState,\n): Iterable<RawCandidate> {\n  const vars = [problem.target, ...problem.governing];\n  const seen = new Set<string>();\n  const { det } = nativeDetermination(problem);\n  if (det.determined && det.monomial) {\n    yield* emitWithPrefactors(monomialToExpr(det.monomial, vars), det.monomial, det.reason, undefined, state, seen);\n  }\n\n  if ((problem.exploratory?.rows.length ?? 0) > 0) {\n    const pl = powerLawDetermination(problem);\n    if (pl.kind === 'fit') {\n      const note = `power-law: ${pl.exponents.map((e) => `${e.group}^(${e.rational!.numerator}/${e.rational!.denominator})`).join(' · ')}`;\n      yield* emitWithPrefactors(monomialToExpr(pl.monomial, vars), pl.monomial, note, pl, state, seen);\n    }\n  }\n\n  if (problem.baseline && problem.discrepancy) {\n    yield* generateCorrections(problem, state, seen);\n  }\n}\n\n/**\n * The monomial the native enumerator searches, and the dimensionless inputs it\n * leaves out (persona finding C2). A dimensionless input makes the monomial\n * non-unique, since any f(θ0) can multiply it, and the enumerator used to\n * produce nothing. When the monomial over ALL inputs is not unique, it is taken\n * from the DIMENSIONED inputs; `unsearched` names the dimensionless ones whose\n * function is not searched.\n * @internal\n */\nexport function nativeDetermination(problem: SearchProblem): {\n  det: DimensionalDeterminationResult;\n  unsearched: string[];\n} {\n  const det = dimensionallyDetermines(problem.target, problem.governing);\n  if (det.determined) return { det, unsearched: [] };\n  const dimless = problem.governing.filter((g) => isDimensionless(g.dim));\n  if (dimless.length === 0) return { det, unsearched: [] };\n  const reduced = dimensionallyDetermines(\n    problem.target,\n    problem.governing.filter((g) => !isDimensionless(g.dim)),\n  );\n  return reduced.determined\n    ? { det: reduced, unsearched: dimless.map((g) => g.name) }\n    : { det, unsearched: [] };\n}\n\nfunction astDepth(node: ExprNode): number {\n  if (node.kind === 'op') return 1 + Math.max(0, ...node.args.map(astDepth));\n  if (node.kind === 'transcendental' || node.kind === 'abs') return 1 + astDepth(node.arg);\n  return 1;\n}\n\nfunction opCount(node: ExprNode): number {\n  if (node.kind === 'op') return 1 + node.args.reduce((n, a) => n + opCount(a), 0);\n  return 0;\n}\n\n/** Whether a candidate is within the budget's AST depth and operator caps. @internal */\nexport function withinAstCaps(node: ExprNode, budget: SearchBudget): boolean {\n  return astDepth(node) <= budget.maxAstDepth && opCount(node) <= budget.maxOperators;\n}\n\n/**\n * Additive / relative corrections: search a monomial of the same dimension\n * as the observable to add to (or scale) the baseline.\n */\nfunction* generateCorrections(\n  problem: SearchProblem,\n  state: BudgetState,\n  seen: Set<string>,\n): Iterable<RawCandidate> {\n  const kind = problem.discrepancy!.kind;\n  if (kind !== 'additive' && kind !== 'relative' && kind !== 'standardized') return;\n  const { det } = nativeDetermination(problem);\n  if (!det.determined || !det.monomial) return;\n  if (!canEmitCandidate(state)) return;\n  const corr = monomialToExpr(det.monomial, [problem.target, ...problem.governing]);\n  const baseline = problem.baseline!;\n  const combined: ExprNode =\n    kind === 'additive'\n      ? { kind: 'op', op: '+', args: [baseline, corr] }\n      : { kind: 'op', op: '*', args: [baseline, { kind: 'op', op: '+', args: [sym('1', DIMENSIONLESS), corr] }] };\n  if (validate(combined).ok !== true) return;\n  const key = JSON.stringify(combined);\n  if (seen.has(key)) return;\n  seen.add(key);\n  state.candidates += 1;\n  yield { expression: combined, monomial: det.monomial, originNote: `correction:${kind}` };\n}\n\n/** Expose budget type for callers. @internal */\nexport type { SearchBudget };\n"]}

package/dist/composition/probe/index.d.ts

@@ -21,6 +21,10 @@ export { openManifest, closeManifest } from './run-manifest.js';
 export { canTransition, applyStatus, statusRank, ProbeCandidateStore } from './candidate-store.js';
 export { monomialToExpr, generateNative } from './generator.js';
 export type { RawCandidate } from './generator.js';
+/** The rational power law over the π-groups, and the log-design rank the frontier reads. */
+export { powerLawDetermination, powerLawWording, rationalizeExponent, piStructure, logDesign, logDesignRank } from './power-law.js';
+/** The power-law types: the determination, one fitted exponent, a recovered fit, the π-structure and the log-design. */
+export type { PowerLawDetermination, PowerLawExponent, PowerLawFit, PiStructure, LogDesign } from './power-law.js';
 export { wrapRelationLinkGaps, wrapConnectorGaps, wrapRegimeGaps, scanFrontier, findFrontierGap, problemFromResidualGap, } from './frontier.js';
 export { expressionSearchGaps, scanWithExpressionGaps } from './expression-gaps.js';
 export { fitPrefactor } from './fit.js';
@@ -31,14 +35,22 @@ export { compareToCorpus, corpusRelativeWording } from './corpus.js';
 export type { CorpusMatch, CorpusComparisonResult } from './corpus.js';
 export { checkDeclaredLimit, checkDeclaredLimits } from './limits.js';
 export type { LimitCheckResult } from './limits.js';
+/** What a declared-limit check found: held, failed, or undecided on too few evaluable rows. */
+export type { LimitOutcome } from './limits.js';
 export { runFalsification, DEFAULT_BATTERIES } from './falsify.js';
 export type { FalsifyInput, FalsifyResult } from './falsify.js';
 export { datasetFromRows, asDatasetSafe, loadDatasetFromJson, loadSplitDatasetsFromJson, loadDatasetFromCsv, loadSplitCsv, } from './dataset.js';
+/** The strict cell reader (a finite number or a decimal string, never a coercion) and the error a dataset raises by row and column. */
+export { readDatasetNumber, DatasetError } from './dataset.js';
 export type { SplitFileDatasets } from './dataset.js';
 export { suggestDiscriminatingPoint, parseDesignBounds } from './experiment-design.js';
 export type { DesignBounds, DesignSuggestion } from './experiment-design.js';
 export { detectMeanChangepoint, estimateScaleExponent, probeConservation, } from './structure.js';
 export type { ChangepointInput, ChangepointResult, ScaleSymmetryInput } from './structure.js';
+/** The scale-exponent result (slope, standard error, direct p) and the conservation verdict (slope against k·stdErr). */
+export type { ScaleExponentResult, ConservationResult } from './structure.js';
+/** The direct two-sided Student t tail the probes consume instead of MathTS's `2·(1 − CDF)`. */
+export { studentTwoSidedP } from './t-tail.js';
 export { runBackendWorker } from './backend-protocol.js';
 export type { BackendRequest, BackendCandidate, BackendResponse } from './backend-protocol.js';
 export { setRelationMetadata, getRelationMetadata, listRelationMetadata, clearRelationMetadata, } from './metadata.js';
@@ -51,4 +63,6 @@ export type { ProbeSearchOptions, ProbeSearchResult } from './pipeline.js';
 export { formatProbeReport, formatFrontierScan, formatFrontierGap } from './report.js';
 export { parseStudy, loadStudyFromJson, loadStudyFile, attachReplication, studyCsvToRaw, runProbeStudy, formatProbeStudy, chiSquareSurvival, fSurvival, effectiveSigma, StudyRefusal, } from './study.js';
 export type { ProbeStudy, ProbeStudyOptions, ProbeStudyResult, StudyVerdict, ReplicationOutcome, StudyRole, StudyProvenance, StudyObservation, StudyBaseline, SetTest, ModelTest, CandidateTest, StudyDesignSuggestion, StudyCorrection, StudyCorrectionReport, CorrectionStep, } from './study.js';
+/** One fitted correction coefficient with its standard error and, when declared, the reference it is compared with. */
+export type { CorrectionCoefficient } from './study.js';
 //# sourceMappingURL=index.d.ts.map