universal-physics-tensor 10.0.0 → 11.0.0

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

@@ -1 +1 @@
-{"version":3,"file":"limits.js","sourceRoot":"","sources":["../../../src/composition/probe/limits.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAU3C;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAChC,IAAc,EACd,OAAqB,EACrB,SAAiB,EACjB,KAAoB,EACpB,YAAqB;IAErB,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,OAAO;YACL,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,MAAM,EAAE,IAAI;YACZ,aAAa,EAAE,YAAY;YAC3B,KAAK,EAAE,KAAK;YACZ,MAAM,EAAE,sCAAsC,KAAK,CAAC,EAAE,EAAE;SACzD,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;QAC/B,IAAI,SAAiB,CAAC;QACtB,IAAI,CAAC;YACH,SAAS,GAAG,SAAS,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9C,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,QAAQ,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,SAAS;QAC5F,MAAM,GAAG,GAAG,SAAS,GAAG,QAAQ,CAAC;QACjC,KAAK,IAAI,GAAG,GAAG,GAAG,CAAC;QACnB,CAAC,IAAI,CAAC,CAAC;IACT,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACvE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CACpB,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAChE,KAAK,CACN,CAAC;IACF,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,GAAG,GAAG,KAAK,CAAC;IAC5D,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,YAAY,CAAC;IACtC,OAAO;QACL,EAAE,EAAE,KAAK,CAAC,EAAE;QACZ,MAAM;QACN,aAAa,EAAE,YAAY;QAC3B,KAAK;QACL,MAAM,EAAE,MAAM;YACZ,CAAC,CAAC,SAAS,KAAK,CAAC,EAAE,eAAe,IAAI,GAAG;YACzC,CAAC,CAAC,SAAS,KAAK,CAAC,EAAE,iBAAiB,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,+CAA+C,CAAC,CAAC,CAAC,mCAAmC,EAAE;KAC9I,CAAC;AACJ,CAAC;AAED,0CAA0C;AAC1C,MAAM,UAAU,mBAAmB,CACjC,IAAc,EACd,OAAiC,EACjC,SAAiB,EACjB,MAAgC,EAChC,cAAc,GAAqC,EAAE;IAErD,MAAM,IAAI,GAAG,OAAO,IAAI;QACtB,EAAE,EAAE,OAAO;QACX,IAAI,EAAE,oBAA6B;QACnC,IAAI,EAAE,EAAE;QACR,UAAU,EAAE,EAAE;QACd,aAAa,EAAE,GAAG;KACnB,CAAC;IACF,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC1B,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,CACrD,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,CACpC,CAAC;QACF,OAAO,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * Declared-limit checks for probe candidates.\n *\n * A failed limit is **not automatically fatal**. It is fatal only when the\n * candidate claims the domain in which the limit fails.\n *\n * @internal\n */\n\nimport type { ExprNode } from '../../dimensional/ast-types.js';\nimport type { DeclaredLimit, ProbeDataset } from './types.js';\nimport { evalExpr } from '../expr-eval.js';\n\nexport interface LimitCheckResult {\n  readonly id: string;\n  readonly passed: boolean;\n  readonly claimedDomain: boolean;\n  readonly fatal: boolean;\n  readonly detail: string;\n}\n\n/**\n * Evaluate `prefactor · expr` RMSE on `dataset`. When the candidate does not\n * claim `limit.regime`, a failure is recorded but not fatal.\n *\n * @internal\n */\nexport function checkDeclaredLimit(\n  expr: ExprNode,\n  dataset: ProbeDataset,\n  prefactor: number,\n  limit: DeclaredLimit,\n  claimsDomain: boolean,\n): LimitCheckResult {\n  if (dataset.rows.length === 0) {\n    return {\n      id: limit.id,\n      passed: true,\n      claimedDomain: claimsDomain,\n      fatal: false,\n      detail: `no observations for declared-limit ${limit.id}`,\n    };\n  }\n  let sumSq = 0;\n  let n = 0;\n  for (const row of dataset.rows) {\n    let predicted: number;\n    try {\n      predicted = prefactor * evalExpr(expr, row);\n    } catch {\n      continue;\n    }\n    const observed = row[dataset.observable];\n    if (!Number.isFinite(predicted) || observed == null || !Number.isFinite(observed)) continue;\n    const err = predicted - observed;\n    sumSq += err * err;\n    n += 1;\n  }\n  const rmse = n === 0 ? Number.POSITIVE_INFINITY : Math.sqrt(sumSq / n);\n  const scale = Math.max(\n    ...dataset.rows.map((r) => Math.abs(r[dataset.observable] ?? 0)),\n    1e-12,\n  );\n  const passed = Number.isFinite(rmse) && rmse <= 0.5 * scale;\n  const fatal = !passed && claimsDomain;\n  return {\n    id: limit.id,\n    passed,\n    claimedDomain: claimsDomain,\n    fatal,\n    detail: passed\n      ? `limit ${limit.id} held (rmse=${rmse})`\n      : `limit ${limit.id} failed (rmse=${rmse})${fatal ? ' — fatal because candidate claims this domain' : ' — not fatal (domain not claimed)'}`,\n  };\n}\n\n/** Run every declared limit. @internal */\nexport function checkDeclaredLimits(\n  expr: ExprNode,\n  dataset: ProbeDataset | undefined,\n  prefactor: number,\n  limits: readonly DeclaredLimit[],\n  claimedRegimes: Readonly<Record<string, string>> = {},\n): readonly LimitCheckResult[] {\n  const rows = dataset ?? {\n    id: 'empty',\n    role: 'falsification-only' as const,\n    rows: [],\n    observable: '',\n    schemaVersion: '0',\n  };\n  return limits.map((limit) => {\n    const claimsDomain = Object.entries(limit.regime).every(\n      ([k, v]) => claimedRegimes[k] === v,\n    );\n    return checkDeclaredLimit(expr, rows, prefactor, limit, claimsDomain);\n  });\n}\n"]}
+{"version":3,"file":"limits.js","sourceRoot":"","sources":["../../../src/composition/probe/limits.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,4BAA4B,CAAC;AAGnD,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAmB3C;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,kBAAkB,CAChC,IAAc,EACd,OAAqB,EACrB,SAAiB,EACjB,KAAoB,EACpB,YAAqB;IAErB,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,OAAO;YACL,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,MAAM,EAAE,IAAI;YACZ,OAAO,EAAE,MAAM;YACf,SAAS,EAAE,CAAC;YACZ,OAAO,EAAE,CAAC;YACV,aAAa,EAAE,YAAY;YAC3B,KAAK,EAAE,KAAK;YACZ,MAAM,EAAE,sCAAsC,KAAK,CAAC,EAAE,EAAE;SACzD,CAAC;IACJ,CAAC;IACD,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;QAC/B,IAAI,SAAiB,CAAC;QACtB,IAAI,CAAC;YACH,SAAS,GAAG,SAAS,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC,CAAC;YACb,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YACxF,OAAO,IAAI,CAAC,CAAC;YACb,SAAS;QACX,CAAC;QACD,SAAS,CAAC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,CAAC;IACvC,CAAC;IACD,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC;IACnC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;IAClC,IAAI,SAAS,KAAK,CAAC,IAAI,OAAO,GAAG,SAAS,EAAE,CAAC;QAC3C,OAAO;YACL,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,MAAM,EAAE,KAAK;YACb,OAAO,EAAE,WAAW;YACpB,SAAS;YACT,OAAO;YACP,aAAa,EAAE,YAAY;YAC3B,KAAK,EAAE,KAAK;YACZ,MAAM,EAAE,SAAS,KAAK,CAAC,EAAE,eAAe,OAAO,OAAO,KAAK,iCAAiC,SAAS,+BAA+B;SACrI,CAAC;IACJ,CAAC;IACD,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACrD,2FAA2F;IAC3F,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACzC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAChC,OAAO,CAAC,KAAK,SAAS,IAAI,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;IAC9E,CAAC,EAAE,KAAK,CAAC,CAAC;IACV,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,GAAG,GAAG,KAAK,CAAC;IAC5D,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,YAAY,CAAC;IACtC,MAAM,IAAI,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,SAAS,OAAO,KAAK,UAAU,OAAO,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IACzF,OAAO;QACL,EAAE,EAAE,KAAK,CAAC,EAAE;QACZ,MAAM;QACN,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;QACnC,SAAS;QACT,OAAO;QACP,aAAa,EAAE,YAAY;QAC3B,KAAK;QACL,MAAM,EAAE,MAAM;YACZ,CAAC,CAAC,SAAS,KAAK,CAAC,EAAE,eAAe,IAAI,IAAI,IAAI,EAAE;YAChD,CAAC,CAAC,SAAS,KAAK,CAAC,EAAE,iBAAiB,IAAI,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,+CAA+C,CAAC,CAAC,CAAC,mCAAmC,EAAE;KACrJ,CAAC;AACJ,CAAC;AAED,0CAA0C;AAC1C,MAAM,UAAU,mBAAmB,CACjC,IAAc,EACd,OAAiC,EACjC,SAAiB,EACjB,MAAgC,EAChC,cAAc,GAAqC,EAAE;IAErD,MAAM,IAAI,GAAG,OAAO,IAAI;QACtB,EAAE,EAAE,OAAO;QACX,IAAI,EAAE,oBAA6B;QACnC,IAAI,EAAE,EAAE;QACR,UAAU,EAAE,EAAE;QACd,aAAa,EAAE,GAAG;KACnB,CAAC;IACF,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC1B,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,CACrD,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,CACpC,CAAC;QACF,OAAO,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * Declared-limit checks for probe candidates.\n *\n * A failed limit is **not automatically fatal**. It is fatal only when the\n * candidate claims the domain in which the limit fails. A limit whose rows\n * the candidate mostly could not be evaluated on is **undecided**, which is\n * neither a pass nor a failure and is never fatal.\n *\n * @internal\n */\n\nimport { norm2 } from '@danielsimonjr/mathts-core';\nimport type { ExprNode } from '../../dimensional/ast-types.js';\nimport type { DeclaredLimit, ProbeDataset } from './types.js';\nimport { evalExpr } from '../expr-eval.js';\n\n/** What a limit check found: the limit held, failed, or could not be decided on these rows. @internal */\nexport type LimitOutcome = 'held' | 'failed' | 'undecided';\n\nexport interface LimitCheckResult {\n  readonly id: string;\n  /** `outcome === 'held'`. */\n  readonly passed: boolean;\n  readonly outcome: LimitOutcome;\n  /** Rows the candidate was evaluated on (finite prediction and a finite observation). */\n  readonly evaluated: number;\n  /** Rows the candidate threw on, or predicted a non-finite value for, or that have no finite observation. */\n  readonly skipped: number;\n  readonly claimedDomain: boolean;\n  readonly fatal: boolean;\n  readonly detail: string;\n}\n\n/**\n * Evaluate `prefactor · expr` RMSE on `dataset`. When the candidate does not\n * claim `limit.regime`, a failure is recorded but not fatal.\n *\n * A row the candidate throws on, or predicts a non-finite value for, is\n * skipped and COUNTED. When more rows were skipped than evaluated (or none\n * could be evaluated), the outcome is `undecided`: a candidate that throws on\n * nine rows of ten is not judged on the tenth. That threshold, skipped >\n * evaluated, is a choice stated here, not a measured one.\n *\n * The pass rule is LOOSE by design: the limit holds when the RMSE over the\n * evaluated rows is at most half the largest |observation| of the dataset. It\n * catches a candidate that is wrong by its own scale in a regime, not one that\n * is wrong by a few percent; the holdout tolerance is the quantitative test.\n * The RMSE is core `norm2` of the residuals over √n (overflow-safe), so a\n * residual of 1e200 is a number, not `Infinity`.\n *\n * @internal\n */\nexport function checkDeclaredLimit(\n  expr: ExprNode,\n  dataset: ProbeDataset,\n  prefactor: number,\n  limit: DeclaredLimit,\n  claimsDomain: boolean,\n): LimitCheckResult {\n  if (dataset.rows.length === 0) {\n    return {\n      id: limit.id,\n      passed: true,\n      outcome: 'held',\n      evaluated: 0,\n      skipped: 0,\n      claimedDomain: claimsDomain,\n      fatal: false,\n      detail: `no observations for declared-limit ${limit.id}`,\n    };\n  }\n  const residuals: number[] = [];\n  let skipped = 0;\n  for (const row of dataset.rows) {\n    let predicted: number;\n    try {\n      predicted = prefactor * evalExpr(expr, row);\n    } catch {\n      skipped += 1;\n      continue;\n    }\n    const observed = row[dataset.observable];\n    if (!Number.isFinite(predicted) || observed === undefined || !Number.isFinite(observed)) {\n      skipped += 1;\n      continue;\n    }\n    residuals.push(predicted - observed);\n  }\n  const evaluated = residuals.length;\n  const total = dataset.rows.length;\n  if (evaluated === 0 || skipped > evaluated) {\n    return {\n      id: limit.id,\n      passed: false,\n      outcome: 'undecided',\n      evaluated,\n      skipped,\n      claimedDomain: claimsDomain,\n      fatal: false,\n      detail: `limit ${limit.id} undecided: ${skipped} of ${total} rows could not be evaluated (${evaluated} could); not judged on so few`,\n    };\n  }\n  const rmse = norm2(residuals) / Math.sqrt(evaluated);\n  // A reduce, not `Math.max(...rows)`: a spread of a large dataset overflows the call stack.\n  const scale = dataset.rows.reduce((m, r) => {\n    const v = r[dataset.observable];\n    return v !== undefined && Number.isFinite(v) ? Math.max(m, Math.abs(v)) : m;\n  }, 1e-12);\n  const passed = Number.isFinite(rmse) && rmse <= 0.5 * scale;\n  const fatal = !passed && claimsDomain;\n  const rows = skipped > 0 ? ` on ${evaluated} of ${total} rows (${skipped} skipped)` : '';\n  return {\n    id: limit.id,\n    passed,\n    outcome: passed ? 'held' : 'failed',\n    evaluated,\n    skipped,\n    claimedDomain: claimsDomain,\n    fatal,\n    detail: passed\n      ? `limit ${limit.id} held (rmse=${rmse})${rows}`\n      : `limit ${limit.id} failed (rmse=${rmse})${rows}${fatal ? ' — fatal because candidate claims this domain' : ' — not fatal (domain not claimed)'}`,\n  };\n}\n\n/** Run every declared limit. @internal */\nexport function checkDeclaredLimits(\n  expr: ExprNode,\n  dataset: ProbeDataset | undefined,\n  prefactor: number,\n  limits: readonly DeclaredLimit[],\n  claimedRegimes: Readonly<Record<string, string>> = {},\n): readonly LimitCheckResult[] {\n  const rows = dataset ?? {\n    id: 'empty',\n    role: 'falsification-only' as const,\n    rows: [],\n    observable: '',\n    schemaVersion: '0',\n  };\n  return limits.map((limit) => {\n    const claimsDomain = Object.entries(limit.regime).every(\n      ([k, v]) => claimedRegimes[k] === v,\n    );\n    return checkDeclaredLimit(expr, rows, prefactor, limit, claimsDomain);\n  });\n}\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"pipeline.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,OAAO,KAAK,EACV,oBAAoB,EACpB,oBAAoB,EACpB,YAAY,EACZ,aAAa,EACb,gBAAgB,EAChB,oBAAoB,EACrB,MAAM,YAAY,CAAC;AAKpB,OAAO,EAIL,KAAK,sBAAsB,EAC5B,MAAM,aAAa,CAAC;AACrB,OAAO,EAAgB,KAAK,SAAS,EAAE,MAAM,UAAU,CAAC;AACxD,OAAO,EAAoB,KAAK,aAAa,EAAE,MAAM,cAAc,CAAC;AAIpE,OAAO,EAA8B,KAAK,eAAe,EAAE,MAAM,cAAc,CAAC;AAGhF,uEAAuE;AACvE,eAAO,MAAM,kBAAkB,sEAAsE,CAAC;AAEtG;;;GAGG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAEhE;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC;IAC/B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,CAAC;IACxC,QAAQ,CAAC,UAAU,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACrD,QAAQ,CAAC,MAAM,EAAE,SAAS,eAAe,EAAE,CAAC;IAC5C,QAAQ,CAAC,UAAU,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACrD,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;IACnD,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC;IACjE,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,sBAAsB,CAAC,CAAC,CAAC;IAClE;;;OAGG;IACH,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;IACrE,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,UAAU,EAAE,gBAAgB,CAAC;CACvC;AA8GD;;;;GAIG;AACH,wBAAsB,cAAc,CAClC,OAAO,EAAE,aAAa,EACtB,IAAI,GAAE,kBAAuB,GAC5B,OAAO,CAAC,iBAAiB,CAAC,CA+S5B"}
+{"version":3,"file":"pipeline.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,OAAO,KAAK,EACV,oBAAoB,EACpB,oBAAoB,EACpB,YAAY,EACZ,aAAa,EACb,gBAAgB,EAChB,oBAAoB,EACrB,MAAM,YAAY,CAAC;AAKpB,OAAO,EAIL,KAAK,sBAAsB,EAC5B,MAAM,aAAa,CAAC;AACrB,OAAO,EAAgB,KAAK,SAAS,EAAE,MAAM,UAAU,CAAC;AACxD,OAAO,EAAoB,KAAK,aAAa,EAAE,MAAM,cAAc,CAAC;AAIpE,OAAO,EAA8B,KAAK,eAAe,EAAE,MAAM,cAAc,CAAC;AAGhF,uEAAuE;AACvE,eAAO,MAAM,kBAAkB,sEAAsE,CAAC;AAEtG;;;GAGG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAEhE;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC;IAC/B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,CAAC;IACxC,QAAQ,CAAC,UAAU,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACrD,QAAQ,CAAC,MAAM,EAAE,SAAS,eAAe,EAAE,CAAC;IAC5C,QAAQ,CAAC,UAAU,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACrD,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;IACnD,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC;IACjE,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,sBAAsB,CAAC,CAAC,CAAC;IAClE;;;OAGG;IACH,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;IACrE,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,UAAU,EAAE,gBAAgB,CAAC;CACvC;AA8GD;;;;GAIG;AACH,wBAAsB,cAAc,CAClC,OAAO,EAAE,aAAa,EACtB,IAAI,GAAE,kBAAuB,GAC5B,OAAO,CAAC,iBAAiB,CAAC,CAqT5B"}

package/dist/composition/probe/pipeline.js

@@ -12,7 +12,7 @@ import { validate } from '../../dimensional/validator.js';
 import { equals } from '../../dimensional/algebra.js';
 import { DEFAULT_HOLDOUT_TOL, DEFAULT_SEARCH_BUDGET, SCHEMA_VERSION } from './types.js';
 import { openBudget, budgetStopReason } from './search-budget.js';
-import { generateNative, nativeDetermination } from './generator.js';
+import { generateNative, nativeDetermination, powerLawDetermination, powerLawWording } from './generator.js';
 import { fingerprintExpr, complexityOf, bodyExpression } from './fingerprint.js';
 import { compareToCorpus, corpusPrefactorNotes, corpusRelativeWording, } from './corpus.js';
 import { fitPrefactor } from './fit.js';
@@ -147,8 +147,14 @@ export async function runProbeSearch(problem, opts = {}) {
     const { unsearched } = nativeDetermination(problem);
     if (unsearched.length > 0) {
         wording.push(`the monomial is taken from the dimensioned inputs; an unknown function of the ` +
-            `dimensionless input(s) {${unsearched.join(', ')}} is not searched`);
+            `dimensionless input(s) {${unsearched.join(', ')}} is not searched as such`);
     }
+    // What the power-law fit over the π-groups found on the exploratory rows, or why it abstained
+    // (a negative result is a result); the generator ran the same fit to emit its candidate.
+    const powerLaw = hasAnyData(problem) ? powerLawDetermination(problem) : null;
+    const powerLawNote = powerLaw ? powerLawWording(powerLaw) : null;
+    if (powerLawNote !== null)
+        wording.push(powerLawNote);
     for (const raw of generateNative(problem, state)) {
         raws.push(raw);
         const stop = budgetStopReason(state);
@@ -303,7 +309,7 @@ export async function runProbeSearch(problem, opts = {}) {
         if (known) {
             // Equivalent up to a constant is not equal: compare the fitted constant
             // with the corpus one where the corpus records it (persona finding L7).
-            prefactorNotes[rec.id] = corpusPrefactorNotes(corp, bodyExpression(rec.body), fit.prefactor, opts.holdoutTol ?? DEFAULT_HOLDOUT_TOL);
+            prefactorNotes[rec.id] = corpusPrefactorNotes(corp, bodyExpression(rec.body), fit.prefactor, opts.holdoutTol ?? DEFAULT_HOLDOUT_TOL, fit.prefactorStderr);
             rec = applyStatus(rec, 'equivalent-known', corpusRelativeWording(corp), runId, at);
             store.replace(rec);
             continue;
@@ -352,7 +358,7 @@ export async function runProbeSearch(problem, opts = {}) {
         wording.push(det.determined
             ? 'enumerator produced no dimensionally valid candidates'
             : `the target is not a unique monomial of the inputs (${det.reason}); ` +
-                'the native enumerator searches unique monomials only');
+                'the native enumerator searches unique monomials and, with exploratory rows, a rational power law of the π-groups');
     }
     else if (hasAnyData(problem) &&
         all.every((c) => c.status === 'rejected' ||

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

@@ -1 +1 @@
-{"version":3,"file":"pipeline.js","sourceRoot":"","sources":["../../../src/composition/probe/pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAC1D,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AAStD,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACxF,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAoB,MAAM,oBAAoB,CAAC;AACpF,OAAO,EAAE,cAAc,EAAE,mBAAmB,EAAqB,MAAM,gBAAgB,CAAC;AACxF,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AACjF,OAAO,EACL,eAAe,EACf,oBAAoB,EACpB,qBAAqB,GAEtB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,YAAY,EAAkB,MAAM,UAAU,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAsB,MAAM,cAAc,CAAC;AACpE,OAAO,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AACxE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,UAAU,EAAwB,MAAM,cAAc,CAAC;AAChF,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEzD,uEAAuE;AACvE,MAAM,CAAC,MAAM,kBAAkB,GAAG,mEAAmE,CAAC;AAEtG;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc;IAC3C,OAAO,CAAC,OAAO,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AACpC,CAAC;AA6BD,SAAS,OAAO,CACd,OAAsB,EACtB,IAAwB,EACxB,MAAwB,EACxB,OAA0B;IAE1B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,qBAAqB,CAAC;IACpD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;IAC/E,MAAM,IAAI,GAAG,YAAY,CAAC;QACxB,KAAK;QACL,gBAAgB,EAAE,IAAI,CAAC,gBAAgB,IAAI,SAAS;QACpD,OAAO;QACP,YAAY,EAAE,MAAM;QACpB,SAAS,EAAE,IAAI,CAAC,GAAG;KACpB,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IACvD,OAAO;QACL,QAAQ;QACR,UAAU,EAAE,EAAE;QACd,MAAM,EAAE,EAAE;QACV,UAAU,EAAE,EAAE;QACd,IAAI,EAAE,EAAE;QACR,cAAc,EAAE,EAAE;QAClB,MAAM,EAAE,EAAE;QACV,cAAc,EAAE,EAAE;QAClB,OAAO;QACP,UAAU,EAAE,MAAM;KACnB,CAAC;AACJ,CAAC;AAED,SAAS,IAAI,CAAC,OAAsB;IAClC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,eAAe,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;QACrF,OAAO;YACL,EAAE,EAAE,KAAK;YACT,OAAO,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,mEAAmE;SAChG,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC;QAC1C,OAAO;YACL,EAAE,EAAE,KAAK;YACT,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,uBAAuB;SACjF,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,UAAU,EAAE,MAAM,KAAK,kBAAkB,EAAE,CAAC;QAC1E,OAAO;YACL,EAAE,EAAE,KAAK;YACT,OAAO,EACL,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,iCAAiC;SACjG,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAgC,EAAE,IAAY;IACtE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;QAC5B,KAAK,IAAI;YACP,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9D,KAAK,UAAU;YACb,OAAO,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QACrF,KAAK,YAAY;YACf,OAAO,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC7E,KAAK,gBAAgB,CAAC;QACtB,KAAK,KAAK,CAAC;QACX,KAAK,aAAa;YAChB,OAAO,gBAAgB,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1C,KAAK,wBAAwB;YAC3B,OAAO,CACL,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC;gBACvC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC;gBAClC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAClC,CAAC;QACJ;YACE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CACpB,IAAgC,EAChC,OAAsB,EACtB,KAAa,EACb,EAAU,EACV,MAAsC,EACtC,GAAW;IAEX,MAAM,EAAE,GAAG,eAAe,CACxB,IAAI,EACJ,OAAO,CAAC,eAAe,IAAI,EAAE,EAC7B,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CACtC,CAAC;IACF,OAAO;QACL,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;QAClD,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;QACrB,IAAI,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,UAAU,EAAE,IAAI,EAAE;QAC/C,MAAM;QACN,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,EAAE;QACtC,MAAM,EAAE,WAAW;QACnB,aAAa,EAAE;YACb,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE;SACnE;QACD,WAAW,EAAE,EAAE;QACf,WAAW,EAAE,EAAE;QACf,UAAU,EAAE,YAAY,CAAC,IAAI,CAAC;QAC9B,aAAa,EAAE,cAAc;KAC9B,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,OAAsB,EACtB,IAAI,GAAuB,EAAE;IAE7B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9B,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;QAChB,OAAO,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,kBAAkB,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,qBAAqB,CAAC;IACpD,MAAM,KAAK,GAAgB,UAAU,CAAC,MAAM,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,aAAa,CAAC;QAC9C,GAAG,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;QACnB,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI;QAC3B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;KAChD,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;IAClB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAChD,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,IAAI,cAAc,CAAC;IAC3D,MAAM,KAAK,GAAG,IAAI,mBAAmB,EAAE,CAAC;IACxC,MAAM,IAAI,GAA8B,EAAE,CAAC;IAC3C,MAAM,cAAc,GAAkC,EAAE,CAAC;IACzD,MAAM,MAAM,GAA2C,EAAE,CAAC;IAC1D,MAAM,cAAc,GAA6B,EAAE,CAAC;IACpD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,MAAM,EAAE,UAAU,EAAE,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IACpD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,OAAO,CAAC,IAAI,CACV,gFAAgF;YAC9E,2BAA2B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CACtE,CAAC;IACJ,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,IAAI;YAAE,MAAM;IAClB,CAAC;IAED,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAChF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,cAAc,GAAG,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;QACjG,MAAM,OAAO,GAAG,MAAM,gBAAgB,CACpC,IAAI,CAAC,WAAW,EAChB;YACE,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;YACzB,QAAQ,EAAE,WAAW;YACrB,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAC/C,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI;SAC5B,EACD,EAAE,SAAS,EAAE,WAAW,EAAE,CAC3B,CAAC;QACF,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,sBAAsB,OAAO,CAAC,KAAK,IAAI,eAAe,EAAE,CAAC,CAAC;QACzE,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,IAAI,gBAAgB,CAAC,KAAK,CAAC;oBAAE,MAAM;gBACnC,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;gBACtB,IAAI,CAAC,IAAI,CAAC;oBACR,UAAU,EAAE,CAAC,CAAC,UAAU;oBACxB,QAAQ,EAAE,IAAI;oBACd,UAAU,EAAE,kBAAkB;iBAC/B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAG,YAAY,CAAC;QACxB,KAAK;QACL,gBAAgB,EAAE,IAAI,CAAC,gBAAgB,IAAI,SAAS;QACpD,OAAO;QACP,aAAa,EAAE;YACb,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACpE,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SAC7D;QACD,UAAU,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,UAAU,IAAI,mBAAmB,EAAE;QACnE,YAAY,EAAE,MAAM;QACpB,SAAS,EAAE,EAAE;QACb,kBAAkB,EAAE,IAAI,CAAC,WAAW;YAClC,CAAC,CAAC;gBACE;oBACE,eAAe,EAAE,GAAG;oBACpB,SAAS,EAAE,QAAQ;oBACnB,cAAc,EAAE,cAAc;oBAC9B,YAAY,EAAE,CAAC,oBAAoB,CAAC;oBACpC,aAAa,EAAE,KAAK;iBACrB;gBACD;oBACE,eAAe,EAAE,GAAG;oBACpB,SAAS,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC;oBACrC,cAAc,EAAE,UAAU;oBAC1B,YAAY,EAAE,CAAC,kBAAkB,CAAC;oBAClC,aAAa,EAAE,SAAS;iBACzB;aACF;YACH,CAAC,CAAC,SAAS;KACd,CAAC,CAAC;IAEH,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,IAAI;YAAE,MAAM;QAEhB,MAAM,MAAM,GAAmC,GAAG,CAAC,UAAU,KAAK,kBAAkB;YAClF,CAAC,CAAC,EAAE,IAAI,EAAE,kBAAkB,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE;YAC5D,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;QAC1C,GAAG,IAAI,CAAC,CAAC;QACT,IAAI,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACzE,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,gBAAgB,CAAC;YAAE,SAAS;QAC7D,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,gBAAgB,CAAC,CAAC;QAC/C,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEf,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAChD,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,sCAAsC,OAAO,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YAC5G,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,iBAAiB,CAAC;gBACtB,WAAW,EAAE,GAAG,CAAC,WAAW;gBAC5B,MAAM,EAAE,qCAAqC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE;gBAClE,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;gBACvB,SAAS,EAAE,EAAE;aACd,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,iBAAiB,KAAK,IAAI,EAAE,CAAC;YAC1C,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,uBAAuB,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACvE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,iBAAiB,CAAC;gBACtB,WAAW,EAAE,GAAG,CAAC,WAAW;gBAC5B,MAAM,EAAE,uBAAuB;gBAC/B,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;gBACvB,SAAS,EAAE,EAAE;aACd,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAiB,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YACrD,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,sDAAsD,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACtG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,iBAAiB,CAAC;gBACtB,WAAW,EAAE,GAAG,CAAC,WAAW;gBAC5B,MAAM,EAAE,2BAA2B;gBACnC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;gBACvB,SAAS,EAAE,EAAE;aACd,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,oBAAoB,EAAE,eAAe,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACzE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEnB,MAAM,IAAI,GAAG,eAAe,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC,CAAC;QACtE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAE5D,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,GAAG,GAAG,WAAW,CACf,GAAG,EACH,KAAK,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,uBAAuB,EACpD,KAAK,CAAC,CAAC,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,6BAA6B,EACnE,KAAK,EACL,EAAE,CACH,CAAC;YACF,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QAED,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;QACvB,IAAI,GAAc,CAAC;QACnB,IAAI,CAAC;YACH,GAAG,GAAG,YAAY,CAChB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EACxB,OAAO,CAAC,WAAY,EACpB,OAAO,CAAC,OAAO,EACf,IAAI,CAAC,UAAU,IAAI,mBAAmB,CACvC,CAAC;QACJ,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,GAAG,GAAG,WAAW,CACf,GAAG,EACH,UAAU,EACV,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAChD,KAAK,EACL,EAAE,CACH,CAAC;YACF,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QACnB,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,iBAAiB,EAAE,oBAAoB,GAAG,CAAC,eAAe,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAChG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEnB,IAAI,CAAC,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1D,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,uBAAuB,EAAE,yBAAyB,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACtF,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,CAAC;YAC1B,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,gBAAgB,GAAG,CAAC,WAAW,oBAAoB,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACnG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,iBAAiB,CAAC;gBACtB,WAAW,EAAE,GAAG,CAAC,WAAW;gBAC5B,MAAM,EAAE,gBAAgB,GAAG,CAAC,WAAW,EAAE;gBACzC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;gBACvB,SAAS,EAAE,EAAE;aACd,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,mBAAmB,EAAE,gBAAgB,GAAG,CAAC,WAAW,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAC1F,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEnB,IAAI,KAAK,EAAE,CAAC;YACV,wEAAwE;YACxE,wEAAwE;YACxE,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,oBAAoB,CAC3C,IAAI,EACJ,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EACxB,GAAG,CAAC,SAAS,EACb,IAAI,CAAC,UAAU,IAAI,mBAAmB,CACvC,CAAC;YACF,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,kBAAkB,EAAE,qBAAqB,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACnF,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QAED,MAAM,GAAG,GAAG,gBAAgB,CAAC;YAC3B,IAAI,EAAE,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC;YAC9B,OAAO,EAAE,OAAO,CAAC,OAAO;YACxB,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,cAAc,EAAE,OAAO,CAAC,cAAc;YACtC,MAAM,EAAE,OAAO,CAAC,MAAM;SACvB,CAAC,CAAC;QACH,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QAC7B,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAClB,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,WAAW,EAAE,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YAChI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,wBAAwB,EAAE,4BAA4B,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAC1F,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,wBAAwB,EAAE,2CAA2C,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACzG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAED,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;IACxB,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,GAAG;YACb,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,eAAe,CAAC;YAC/B,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,kBAAkB;gBACpC,CAAC,CAAC,GAAG;gBACL,CAAC,CAAC,CAAC,CAAC;QACR,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,8EAA8E;QAC9E,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;IAC1F,CAAC,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IAElC,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAC3C,IAAI,UAA4B,CAAC;IACjC,IAAI,UAAU,EAAE,CAAC;QACf,UAAU,GAAG,UAAU,CAAC;IAC1B,CAAC;SAAM,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,UAAU,GAAG,uBAAuB,CAAC;QACrC,wEAAwE;QACxE,+DAA+D;QAC/D,MAAM,EAAE,GAAG,EAAE,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;QAC7C,OAAO,CAAC,IAAI,CACV,GAAG,CAAC,UAAU;YACZ,CAAC,CAAC,uDAAuD;YACzD,CAAC,CAAC,sDAAsD,GAAG,CAAC,MAAM,KAAK;gBACnE,sDAAsD,CAC7D,CAAC;IACJ,CAAC;SAAM,IACL,UAAU,CAAC,OAAO,CAAC;QACnB,GAAG,CAAC,KAAK,CACP,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,MAAM,KAAK,UAAU;YACvB,CAAC,CAAC,MAAM,KAAK,WAAW;YACxB,CAAC,CAAC,MAAM,KAAK,uBAAuB,CACvC,EACD,CAAC;QACD,UAAU,GAAG,uBAAuB,CAAC;QACrC,OAAO,CAAC,IAAI,CACV,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC;YACrC,CAAC,CAAC,+CAA+C;YACjD,CAAC,CAAC,kBAAkB,CACvB,CAAC;IACJ,CAAC;SAAM,CAAC;QACN,UAAU,GAAG,iBAAiB,CAAC;IACjC,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,aAAa,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAC/E,UAAU,EAAE,GAAG;QACf,MAAM;QACN,UAAU,EAAE,KAAK,CAAC,aAAa,EAAE;QACjC,IAAI;QACJ,cAAc;QACd,MAAM;QACN,cAAc;QACd,OAAO;QACP,UAAU;KACX,CAAC;AACJ,CAAC;AAED,SAAS,UAAU,CAAC,OAAsB;IACxC,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AACrD,CAAC","sourcesContent":["/**\n * Product B search orchestrator.\n *\n * Identifiability gate → native enumerator → fingerprint dedup → corpus\n * comparison → validate → exploratory fit (never holdout) → holdout →\n * falsify → Pareto. Relation-link / regime gaps abstain (`non-identifiable`)\n * and tell the caller to use `upt discover`.\n *\n * @internal\n */\n\nimport { validate } from '../../dimensional/validator.js';\nimport { equals } from '../../dimensional/algebra.js';\nimport type {\n  ProbeCandidateRecord,\n  ProbeRejectionRecord,\n  SearchBudget,\n  SearchProblem,\n  SearchStopReason,\n  DiscoveryRunManifest,\n} from './types.js';\nimport { DEFAULT_HOLDOUT_TOL, DEFAULT_SEARCH_BUDGET, SCHEMA_VERSION } from './types.js';\nimport { openBudget, budgetStopReason, type BudgetState } from './search-budget.js';\nimport { generateNative, nativeDetermination, type RawCandidate } from './generator.js';\nimport { fingerprintExpr, complexityOf, bodyExpression } from './fingerprint.js';\nimport {\n  compareToCorpus,\n  corpusPrefactorNotes,\n  corpusRelativeWording,\n  type CorpusComparisonResult,\n} from './corpus.js';\nimport { fitPrefactor, type FitResult } from './fit.js';\nimport { runFalsification, type FalsifyResult } from './falsify.js';\nimport { applyStatus, ProbeCandidateStore } from './candidate-store.js';\nimport { openManifest, closeManifest } from './run-manifest.js';\nimport { hashCanonical } from './serialize.js';\nimport { scoreCandidate, rankPareto, type RankedCandidate } from './scoring.js';\nimport { runBackendWorker } from './backend-protocol.js';\n\n/** Stop wording when the problem carried no holdout rows. @internal */\nexport const NO_HOLDOUT_WORDING = 'no holdout observations: no candidate was tested on withheld data';\n\n/**\n * The argv that runs a Node script as an NDJSON worker: this process's own Node, then the script.\n * @internal\n */\nexport function nodeWorkerArgv(script: string): readonly string[] {\n  return [process.execPath, script];\n}\n\nexport interface ProbeSearchOptions {\n  readonly budget?: SearchBudget;\n  readonly runId?: string;\n  readonly repositoryCommit?: string;\n  readonly holdoutTol?: number;\n  readonly backendArgv?: readonly string[];\n  readonly corpusVersion?: string;\n  readonly now?: string;\n}\n\nexport interface ProbeSearchResult {\n  readonly manifest: DiscoveryRunManifest;\n  readonly candidates: readonly ProbeCandidateRecord[];\n  readonly ranked: readonly RankedCandidate[];\n  readonly rejections: readonly ProbeRejectionRecord[];\n  readonly fits: Readonly<Record<string, FitResult>>;\n  readonly falsifications: Readonly<Record<string, FalsifyResult>>;\n  readonly corpus: Readonly<Record<string, CorpusComparisonResult>>;\n  /**\n   * For a candidate equivalent to a corpus relation, the fitted prefactor\n   * against that relation's prefactor (see `corpusPrefactorNotes`).\n   */\n  readonly prefactorNotes: Readonly<Record<string, readonly string[]>>;\n  readonly wording: readonly string[];\n  readonly stopReason: SearchStopReason;\n}\n\nfunction abstain(\n  problem: SearchProblem,\n  opts: ProbeSearchOptions,\n  reason: SearchStopReason,\n  wording: readonly string[],\n): ProbeSearchResult {\n  const budget = opts.budget ?? DEFAULT_SEARCH_BUDGET;\n  const runId = opts.runId ?? `dr-${hashCanonical(problem.gap.id).slice(0, 12)}`;\n  const open = openManifest({\n    runId,\n    repositoryCommit: opts.repositoryCommit ?? 'unknown',\n    problem,\n    searchBudget: budget,\n    startedAt: opts.now,\n  });\n  const manifest = closeManifest(open, reason, opts.now);\n  return {\n    manifest,\n    candidates: [],\n    ranked: [],\n    rejections: [],\n    fits: {},\n    falsifications: {},\n    corpus: {},\n    prefactorNotes: {},\n    wording,\n    stopReason: reason,\n  };\n}\n\nfunction gate(problem: SearchProblem): { ok: true } | { ok: false; wording: string } {\n  if (problem.gap.kind === 'relation-link' || problem.gap.kind === 'regime-transition') {\n    return {\n      ok: false,\n      wording: `${problem.gap.kind} gaps are Product A — use \\`upt discover\\`, not \\`upt probe run\\``,\n    };\n  }\n  if (!problem.gap.searchability.searchable) {\n    return {\n      ok: false,\n      wording: problem.gap.searchability.reasons.join('; ') || 'gap is not searchable',\n    };\n  }\n  if (problem.gap.identifiability.parametric?.status === 'non-identifiable') {\n    return {\n      ok: false,\n      wording:\n        problem.gap.identifiability.parametric.reasons.join('; ') || 'parametrically non-identifiable',\n    };\n  }\n  return { ok: true };\n}\n\nfunction referencesSymbol(expr: RawCandidate['expression'], name: string): boolean {\n  switch (expr.kind) {\n    case 'symbol':\n      return expr.name === name;\n    case 'op':\n      return expr.args.some((arg) => referencesSymbol(arg, name));\n    case 'integral':\n      return referencesSymbol(expr.over, name) || referencesSymbol(expr.integrand, name);\n    case 'derivative':\n      return referencesSymbol(expr.of, name) || referencesSymbol(expr.wrt, name);\n    case 'transcendental':\n    case 'abs':\n    case 'dirac-delta':\n      return referencesSymbol(expr.arg, name);\n    case 'variational-derivative':\n      return (\n        referencesSymbol(expr.functional, name) ||\n        referencesSymbol(expr.field, name) ||\n        referencesSymbol(expr.over, name)\n      );\n    default:\n      return false;\n  }\n}\n\nfunction makeGenerated(\n  expr: RawCandidate['expression'],\n  problem: SearchProblem,\n  runId: string,\n  at: string,\n  origin: ProbeCandidateRecord['origin'],\n  seq: number,\n): ProbeCandidateRecord {\n  const fp = fingerprintExpr(\n    expr,\n    problem.regimeSignature ?? '',\n    (problem.assumptions ?? []).join('|'),\n  );\n  return {\n    id: `h-${seq}-${fp.canonicalAstHash.slice(0, 10)}`,\n    gapId: problem.gap.id,\n    body: { kind: 'scalar-expr', expression: expr },\n    origin,\n    assumptions: problem.assumptions ?? [],\n    status: 'generated',\n    statusHistory: [\n      { at, from: 'none', to: 'generated', reason: 'enumerator', runId },\n    ],\n    evaluations: [],\n    fingerprint: fp,\n    complexity: complexityOf(expr),\n    schemaVersion: SCHEMA_VERSION,\n  };\n}\n\n/**\n * Run a bounded Product B search. Never mutates Product A catalogs.\n *\n * @internal\n */\nexport async function runProbeSearch(\n  problem: SearchProblem,\n  opts: ProbeSearchOptions = {},\n): Promise<ProbeSearchResult> {\n  const blocked = gate(problem);\n  if (!blocked.ok) {\n    return abstain(problem, opts, 'non-identifiable', [blocked.wording]);\n  }\n\n  const budget = opts.budget ?? DEFAULT_SEARCH_BUDGET;\n  const state: BudgetState = openBudget(budget);\n  const runId = opts.runId ?? `dr-${hashCanonical({\n    gap: problem.gap.id,\n    target: problem.target.name,\n    governing: problem.governing.map((g) => g.name),\n  }).slice(0, 12)}`;\n  const at = opts.now ?? new Date().toISOString();\n  const corpusVersion = opts.corpusVersion ?? SCHEMA_VERSION;\n  const store = new ProbeCandidateStore();\n  const fits: Record<string, FitResult> = {};\n  const falsifications: Record<string, FalsifyResult> = {};\n  const corpus: Record<string, CorpusComparisonResult> = {};\n  const prefactorNotes: Record<string, string[]> = {};\n  const wording: string[] = [];\n  const seenHash = new Set<string>();\n  let seq = 0;\n\n  const raws: RawCandidate[] = [];\n  const { unsearched } = nativeDetermination(problem);\n  if (unsearched.length > 0) {\n    wording.push(\n      `the monomial is taken from the dimensioned inputs; an unknown function of the ` +\n        `dimensionless input(s) {${unsearched.join(', ')}} is not searched`,\n    );\n  }\n  for (const raw of generateNative(problem, state)) {\n    raws.push(raw);\n    const stop = budgetStopReason(state);\n    if (stop) break;\n  }\n\n  if (opts.backendArgv && opts.backendArgv.length > 0 && !budgetStopReason(state)) {\n    const remainingMs = Math.max(1, budget.maxWallClockMs - (performance.now() - state.startedAtMs));\n    const backend = await runBackendWorker(\n      opts.backendArgv,\n      {\n        problemId: problem.gap.id,\n        budgetMs: remainingMs,\n        variables: problem.governing.map((g) => g.name),\n        target: problem.target.name,\n      },\n      { timeoutMs: remainingMs },\n    );\n    if (!backend.ok) {\n      wording.push(`backend abstained: ${backend.error ?? 'unknown error'}`);\n    } else {\n      for (const c of backend.candidates) {\n        if (budgetStopReason(state)) break;\n        state.candidates += 1;\n        raws.push({\n          expression: c.expression,\n          monomial: null,\n          originNote: 'external-backend',\n        });\n      }\n    }\n  }\n\n  const open = openManifest({\n    runId,\n    repositoryCommit: opts.repositoryCommit ?? 'unknown',\n    problem,\n    datasetHashes: [\n      ...(problem.exploratory ? [hashCanonical(problem.exploratory)] : []),\n      ...(problem.holdout ? [hashCanonical(problem.holdout)] : []),\n    ],\n    tolerances: { holdoutRmse: opts.holdoutTol ?? DEFAULT_HOLDOUT_TOL },\n    searchBudget: budget,\n    startedAt: at,\n    backendDescriptors: opts.backendArgv\n      ? [\n          {\n            protocolVersion: '0',\n            backendId: 'native',\n            backendVersion: SCHEMA_VERSION,\n            capabilities: ['grammar-enumerator'],\n            deterministic: 'yes',\n          },\n          {\n            protocolVersion: '0',\n            backendId: opts.backendArgv.join(' '),\n            backendVersion: 'external',\n            capabilities: ['external-backend'],\n            deterministic: 'unknown',\n          },\n        ]\n      : undefined,\n  });\n\n  for (const raw of raws) {\n    const stop = budgetStopReason(state);\n    if (stop) break;\n\n    const origin: ProbeCandidateRecord['origin'] = raw.originNote === 'external-backend'\n      ? { kind: 'external-backend', backendId: 'external', runId }\n      : { kind: 'grammar-enumerator', runId };\n    seq += 1;\n    let rec = makeGenerated(raw.expression, problem, runId, at, origin, seq);\n    if (seenHash.has(rec.fingerprint.canonicalAstHash)) continue;\n    seenHash.add(rec.fingerprint.canonicalAstHash);\n    store.put(rec);\n\n    const expr = bodyExpression(rec.body);\n    if (referencesSymbol(expr, problem.target.name)) {\n      rec = applyStatus(rec, 'rejected', `candidate reads target observable '${problem.target.name}'`, runId, at);\n      store.replace(rec);\n      store.rememberRejection({\n        fingerprint: rec.fingerprint,\n        reason: `target-observable self-reference: ${problem.target.name}`,\n        context: problem.gap.id,\n        timestamp: at,\n      });\n      continue;\n    }\n\n    const v = validate(expr);\n    if (!v.ok || v.inferredDimension === null) {\n      rec = applyStatus(rec, 'rejected', 'dimensionally invalid', runId, at);\n      store.replace(rec);\n      store.rememberRejection({\n        fingerprint: rec.fingerprint,\n        reason: 'dimensionally invalid',\n        context: problem.gap.id,\n        timestamp: at,\n      });\n      continue;\n    }\n    if (!equals(v.inferredDimension, problem.target.dim)) {\n      rec = applyStatus(rec, 'rejected', 'candidate dimension does not match target observable', runId, at);\n      store.replace(rec);\n      store.rememberRejection({\n        fingerprint: rec.fingerprint,\n        reason: 'target-dimension mismatch',\n        context: problem.gap.id,\n        timestamp: at,\n      });\n      continue;\n    }\n    rec = applyStatus(rec, 'structurally-valid', 'validate() ok', runId, at);\n    store.replace(rec);\n\n    const corp = compareToCorpus(bodyExpression(rec.body), corpusVersion);\n    corpus[rec.id] = corp;\n    wording.push(corpusRelativeWording(corp));\n    const known = corp.algebraicMatches.length > 0;\n    const hasData = (problem.exploratory?.rows.length ?? 0) > 0;\n\n    if (!hasData) {\n      rec = applyStatus(\n        rec,\n        known ? 'equivalent-known' : 'insufficient-evidence',\n        known ? corpusRelativeWording(corp) : 'no exploratory observations',\n        runId,\n        at,\n      );\n      store.replace(rec);\n      continue;\n    }\n\n    state.evaluations += 1;\n    let fit: FitResult;\n    try {\n      fit = fitPrefactor(\n        bodyExpression(rec.body),\n        problem.exploratory!,\n        problem.holdout,\n        opts.holdoutTol ?? DEFAULT_HOLDOUT_TOL,\n      );\n    } catch (err) {\n      rec = applyStatus(\n        rec,\n        'rejected',\n        err instanceof Error ? err.message : String(err),\n        runId,\n        at,\n      );\n      store.replace(rec);\n      continue;\n    }\n    fits[rec.id] = fit;\n    rec = applyStatus(rec, 'empirically-fit', `exploratory RMSE ${fit.exploratoryRmse}`, runId, at);\n    store.replace(rec);\n\n    if (!problem.holdout || problem.holdout.rows.length === 0) {\n      rec = applyStatus(rec, 'insufficient-evidence', 'no holdout observations', runId, at);\n      store.replace(rec);\n      continue;\n    }\n    if (!fit.holdoutSupported) {\n      rec = applyStatus(rec, 'rejected', `holdout RMSE ${fit.holdoutRmse} exceeds tolerance`, runId, at);\n      store.replace(rec);\n      store.rememberRejection({\n        fingerprint: rec.fingerprint,\n        reason: `holdout RMSE ${fit.holdoutRmse}`,\n        context: problem.gap.id,\n        timestamp: at,\n      });\n      continue;\n    }\n\n    rec = applyStatus(rec, 'heldout-supported', `holdout RMSE ${fit.holdoutRmse}`, runId, at);\n    store.replace(rec);\n\n    if (known) {\n      // Equivalent up to a constant is not equal: compare the fitted constant\n      // with the corpus one where the corpus records it (persona finding L7).\n      prefactorNotes[rec.id] = corpusPrefactorNotes(\n        corp,\n        bodyExpression(rec.body),\n        fit.prefactor,\n        opts.holdoutTol ?? DEFAULT_HOLDOUT_TOL,\n      );\n      rec = applyStatus(rec, 'equivalent-known', corpusRelativeWording(corp), runId, at);\n      store.replace(rec);\n      continue;\n    }\n\n    const fal = runFalsification({\n      expr: bodyExpression(rec.body),\n      dataset: problem.holdout,\n      prefactor: fit.prefactor,\n      claimedRegimes: problem.claimedRegimes,\n      limits: problem.limits,\n    });\n    falsifications[rec.id] = fal;\n    if (!fal.survived) {\n      rec = applyStatus(rec, 'falsified', fal.records.filter((r) => r.outcome === 'fail').map((r) => r.detail).join('; '), runId, at);\n      store.replace(rec);\n      continue;\n    }\n    rec = applyStatus(rec, 'falsification-survivor', 'all fatal batteries passed', runId, at);\n    rec = applyStatus(rec, 'expert-review-required', 'survived batteries; human review required', runId, at);\n    store.replace(rec);\n  }\n\n  const all = store.all();\n  const scored = all.map((record) => {\n    const fit = fits[record.id];\n    const emp = fit\n      ? 1 / (1 + fit.exploratoryRmse)\n      : record.status === 'equivalent-known'\n        ? 0.5\n        : 0;\n    const corp = corpus[record.id];\n    const dist = corp && corp.algebraicMatches.length > 0 ? 0 : 1;\n    // Robustness is read from the batteries this record ran, not from its status.\n    return { record, scores: scoreCandidate(record, emp, dist, falsifications[record.id]) };\n  });\n  const ranked = rankPareto(scored);\n\n  const budgetStop = budgetStopReason(state);\n  let stopReason: SearchStopReason;\n  if (budgetStop) {\n    stopReason = budgetStop;\n  } else if (all.length === 0) {\n    stopReason = 'no-credible-candidate';\n    // Say WHY (persona finding C2): \"no dimensionally valid candidates\" was\n    // printed even when the real reason was a non-unique monomial.\n    const { det } = nativeDetermination(problem);\n    wording.push(\n      det.determined\n        ? 'enumerator produced no dimensionally valid candidates'\n        : `the target is not a unique monomial of the inputs (${det.reason}); ` +\n            'the native enumerator searches unique monomials only',\n    );\n  } else if (\n    hasAnyData(problem) &&\n    all.every(\n      (c) =>\n        c.status === 'rejected' ||\n        c.status === 'falsified' ||\n        c.status === 'insufficient-evidence',\n    )\n  ) {\n    stopReason = 'no-credible-candidate';\n    wording.push(\n      (problem.holdout?.rows.length ?? 0) > 0\n        ? 'no candidate survived holdout / falsification'\n        : NO_HOLDOUT_WORDING,\n    );\n  } else {\n    stopReason = 'exhausted-space';\n  }\n\n  return {\n    manifest: closeManifest(open, stopReason, opts.now ?? new Date().toISOString()),\n    candidates: all,\n    ranked,\n    rejections: store.rejectionList(),\n    fits,\n    falsifications,\n    corpus,\n    prefactorNotes,\n    wording,\n    stopReason,\n  };\n}\n\nfunction hasAnyData(problem: SearchProblem): boolean {\n  return (problem.exploratory?.rows.length ?? 0) > 0;\n}\n"]}
+{"version":3,"file":"pipeline.js","sourceRoot":"","sources":["../../../src/composition/probe/pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAC1D,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AAStD,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACxF,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAoB,MAAM,oBAAoB,CAAC;AACpF,OAAO,EAAE,cAAc,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,eAAe,EAAqB,MAAM,gBAAgB,CAAC;AAChI,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AACjF,OAAO,EACL,eAAe,EACf,oBAAoB,EACpB,qBAAqB,GAEtB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,YAAY,EAAkB,MAAM,UAAU,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAsB,MAAM,cAAc,CAAC;AACpE,OAAO,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AACxE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,UAAU,EAAwB,MAAM,cAAc,CAAC;AAChF,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEzD,uEAAuE;AACvE,MAAM,CAAC,MAAM,kBAAkB,GAAG,mEAAmE,CAAC;AAEtG;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc;IAC3C,OAAO,CAAC,OAAO,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AACpC,CAAC;AA6BD,SAAS,OAAO,CACd,OAAsB,EACtB,IAAwB,EACxB,MAAwB,EACxB,OAA0B;IAE1B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,qBAAqB,CAAC;IACpD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;IAC/E,MAAM,IAAI,GAAG,YAAY,CAAC;QACxB,KAAK;QACL,gBAAgB,EAAE,IAAI,CAAC,gBAAgB,IAAI,SAAS;QACpD,OAAO;QACP,YAAY,EAAE,MAAM;QACpB,SAAS,EAAE,IAAI,CAAC,GAAG;KACpB,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IACvD,OAAO;QACL,QAAQ;QACR,UAAU,EAAE,EAAE;QACd,MAAM,EAAE,EAAE;QACV,UAAU,EAAE,EAAE;QACd,IAAI,EAAE,EAAE;QACR,cAAc,EAAE,EAAE;QAClB,MAAM,EAAE,EAAE;QACV,cAAc,EAAE,EAAE;QAClB,OAAO;QACP,UAAU,EAAE,MAAM;KACnB,CAAC;AACJ,CAAC;AAED,SAAS,IAAI,CAAC,OAAsB;IAClC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,eAAe,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;QACrF,OAAO;YACL,EAAE,EAAE,KAAK;YACT,OAAO,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,mEAAmE;SAChG,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC;QAC1C,OAAO;YACL,EAAE,EAAE,KAAK;YACT,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,uBAAuB;SACjF,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,UAAU,EAAE,MAAM,KAAK,kBAAkB,EAAE,CAAC;QAC1E,OAAO;YACL,EAAE,EAAE,KAAK;YACT,OAAO,EACL,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,iCAAiC;SACjG,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAgC,EAAE,IAAY;IACtE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;QAC5B,KAAK,IAAI;YACP,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9D,KAAK,UAAU;YACb,OAAO,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QACrF,KAAK,YAAY;YACf,OAAO,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC7E,KAAK,gBAAgB,CAAC;QACtB,KAAK,KAAK,CAAC;QACX,KAAK,aAAa;YAChB,OAAO,gBAAgB,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1C,KAAK,wBAAwB;YAC3B,OAAO,CACL,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC;gBACvC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC;gBAClC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAClC,CAAC;QACJ;YACE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CACpB,IAAgC,EAChC,OAAsB,EACtB,KAAa,EACb,EAAU,EACV,MAAsC,EACtC,GAAW;IAEX,MAAM,EAAE,GAAG,eAAe,CACxB,IAAI,EACJ,OAAO,CAAC,eAAe,IAAI,EAAE,EAC7B,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CACtC,CAAC;IACF,OAAO;QACL,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;QAClD,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;QACrB,IAAI,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,UAAU,EAAE,IAAI,EAAE;QAC/C,MAAM;QACN,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,EAAE;QACtC,MAAM,EAAE,WAAW;QACnB,aAAa,EAAE;YACb,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE;SACnE;QACD,WAAW,EAAE,EAAE;QACf,WAAW,EAAE,EAAE;QACf,UAAU,EAAE,YAAY,CAAC,IAAI,CAAC;QAC9B,aAAa,EAAE,cAAc;KAC9B,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,OAAsB,EACtB,IAAI,GAAuB,EAAE;IAE7B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9B,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;QAChB,OAAO,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,kBAAkB,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,qBAAqB,CAAC;IACpD,MAAM,KAAK,GAAgB,UAAU,CAAC,MAAM,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,aAAa,CAAC;QAC9C,GAAG,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;QACnB,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI;QAC3B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;KAChD,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;IAClB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAChD,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,IAAI,cAAc,CAAC;IAC3D,MAAM,KAAK,GAAG,IAAI,mBAAmB,EAAE,CAAC;IACxC,MAAM,IAAI,GAA8B,EAAE,CAAC;IAC3C,MAAM,cAAc,GAAkC,EAAE,CAAC;IACzD,MAAM,MAAM,GAA2C,EAAE,CAAC;IAC1D,MAAM,cAAc,GAA6B,EAAE,CAAC;IACpD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,MAAM,EAAE,UAAU,EAAE,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IACpD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,OAAO,CAAC,IAAI,CACV,gFAAgF;YAC9E,2BAA2B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,2BAA2B,CAC9E,CAAC;IACJ,CAAC;IACD,8FAA8F;IAC9F,yFAAyF;IACzF,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7E,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACjE,IAAI,YAAY,KAAK,IAAI;QAAE,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACtD,KAAK,MAAM,GAAG,IAAI,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,IAAI;YAAE,MAAM;IAClB,CAAC;IAED,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAChF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,cAAc,GAAG,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;QACjG,MAAM,OAAO,GAAG,MAAM,gBAAgB,CACpC,IAAI,CAAC,WAAW,EAChB;YACE,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;YACzB,QAAQ,EAAE,WAAW;YACrB,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAC/C,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI;SAC5B,EACD,EAAE,SAAS,EAAE,WAAW,EAAE,CAC3B,CAAC;QACF,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,sBAAsB,OAAO,CAAC,KAAK,IAAI,eAAe,EAAE,CAAC,CAAC;QACzE,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,IAAI,gBAAgB,CAAC,KAAK,CAAC;oBAAE,MAAM;gBACnC,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;gBACtB,IAAI,CAAC,IAAI,CAAC;oBACR,UAAU,EAAE,CAAC,CAAC,UAAU;oBACxB,QAAQ,EAAE,IAAI;oBACd,UAAU,EAAE,kBAAkB;iBAC/B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAG,YAAY,CAAC;QACxB,KAAK;QACL,gBAAgB,EAAE,IAAI,CAAC,gBAAgB,IAAI,SAAS;QACpD,OAAO;QACP,aAAa,EAAE;YACb,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACpE,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SAC7D;QACD,UAAU,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,UAAU,IAAI,mBAAmB,EAAE;QACnE,YAAY,EAAE,MAAM;QACpB,SAAS,EAAE,EAAE;QACb,kBAAkB,EAAE,IAAI,CAAC,WAAW;YAClC,CAAC,CAAC;gBACE;oBACE,eAAe,EAAE,GAAG;oBACpB,SAAS,EAAE,QAAQ;oBACnB,cAAc,EAAE,cAAc;oBAC9B,YAAY,EAAE,CAAC,oBAAoB,CAAC;oBACpC,aAAa,EAAE,KAAK;iBACrB;gBACD;oBACE,eAAe,EAAE,GAAG;oBACpB,SAAS,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC;oBACrC,cAAc,EAAE,UAAU;oBAC1B,YAAY,EAAE,CAAC,kBAAkB,CAAC;oBAClC,aAAa,EAAE,SAAS;iBACzB;aACF;YACH,CAAC,CAAC,SAAS;KACd,CAAC,CAAC;IAEH,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,IAAI;YAAE,MAAM;QAEhB,MAAM,MAAM,GAAmC,GAAG,CAAC,UAAU,KAAK,kBAAkB;YAClF,CAAC,CAAC,EAAE,IAAI,EAAE,kBAAkB,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE;YAC5D,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;QAC1C,GAAG,IAAI,CAAC,CAAC;QACT,IAAI,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACzE,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,gBAAgB,CAAC;YAAE,SAAS;QAC7D,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,gBAAgB,CAAC,CAAC;QAC/C,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEf,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAChD,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,sCAAsC,OAAO,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YAC5G,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,iBAAiB,CAAC;gBACtB,WAAW,EAAE,GAAG,CAAC,WAAW;gBAC5B,MAAM,EAAE,qCAAqC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE;gBAClE,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;gBACvB,SAAS,EAAE,EAAE;aACd,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,iBAAiB,KAAK,IAAI,EAAE,CAAC;YAC1C,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,uBAAuB,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACvE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,iBAAiB,CAAC;gBACtB,WAAW,EAAE,GAAG,CAAC,WAAW;gBAC5B,MAAM,EAAE,uBAAuB;gBAC/B,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;gBACvB,SAAS,EAAE,EAAE;aACd,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAiB,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YACrD,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,sDAAsD,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACtG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,iBAAiB,CAAC;gBACtB,WAAW,EAAE,GAAG,CAAC,WAAW;gBAC5B,MAAM,EAAE,2BAA2B;gBACnC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;gBACvB,SAAS,EAAE,EAAE;aACd,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,oBAAoB,EAAE,eAAe,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACzE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEnB,MAAM,IAAI,GAAG,eAAe,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC,CAAC;QACtE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAE5D,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,GAAG,GAAG,WAAW,CACf,GAAG,EACH,KAAK,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,uBAAuB,EACpD,KAAK,CAAC,CAAC,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,6BAA6B,EACnE,KAAK,EACL,EAAE,CACH,CAAC;YACF,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QAED,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;QACvB,IAAI,GAAc,CAAC;QACnB,IAAI,CAAC;YACH,GAAG,GAAG,YAAY,CAChB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EACxB,OAAO,CAAC,WAAY,EACpB,OAAO,CAAC,OAAO,EACf,IAAI,CAAC,UAAU,IAAI,mBAAmB,CACvC,CAAC;QACJ,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,GAAG,GAAG,WAAW,CACf,GAAG,EACH,UAAU,EACV,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAChD,KAAK,EACL,EAAE,CACH,CAAC;YACF,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QACnB,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,iBAAiB,EAAE,oBAAoB,GAAG,CAAC,eAAe,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAChG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEnB,IAAI,CAAC,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1D,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,uBAAuB,EAAE,yBAAyB,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACtF,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,CAAC;YAC1B,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,gBAAgB,GAAG,CAAC,WAAW,oBAAoB,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACnG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,KAAK,CAAC,iBAAiB,CAAC;gBACtB,WAAW,EAAE,GAAG,CAAC,WAAW;gBAC5B,MAAM,EAAE,gBAAgB,GAAG,CAAC,WAAW,EAAE;gBACzC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE;gBACvB,SAAS,EAAE,EAAE;aACd,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,mBAAmB,EAAE,gBAAgB,GAAG,CAAC,WAAW,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAC1F,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEnB,IAAI,KAAK,EAAE,CAAC;YACV,wEAAwE;YACxE,wEAAwE;YACxE,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,oBAAoB,CAC3C,IAAI,EACJ,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EACxB,GAAG,CAAC,SAAS,EACb,IAAI,CAAC,UAAU,IAAI,mBAAmB,EACtC,GAAG,CAAC,eAAe,CACpB,CAAC;YACF,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,kBAAkB,EAAE,qBAAqB,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACnF,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QAED,MAAM,GAAG,GAAG,gBAAgB,CAAC;YAC3B,IAAI,EAAE,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC;YAC9B,OAAO,EAAE,OAAO,CAAC,OAAO;YACxB,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,cAAc,EAAE,OAAO,CAAC,cAAc;YACtC,MAAM,EAAE,OAAO,CAAC,MAAM;SACvB,CAAC,CAAC;QACH,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QAC7B,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAClB,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,WAAW,EAAE,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YAChI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,wBAAwB,EAAE,4BAA4B,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAC1F,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,wBAAwB,EAAE,2CAA2C,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACzG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAED,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;IACxB,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,GAAG;YACb,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,eAAe,CAAC;YAC/B,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,kBAAkB;gBACpC,CAAC,CAAC,GAAG;gBACL,CAAC,CAAC,CAAC,CAAC;QACR,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,8EAA8E;QAC9E,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;IAC1F,CAAC,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IAElC,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAC3C,IAAI,UAA4B,CAAC;IACjC,IAAI,UAAU,EAAE,CAAC;QACf,UAAU,GAAG,UAAU,CAAC;IAC1B,CAAC;SAAM,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,UAAU,GAAG,uBAAuB,CAAC;QACrC,wEAAwE;QACxE,+DAA+D;QAC/D,MAAM,EAAE,GAAG,EAAE,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;QAC7C,OAAO,CAAC,IAAI,CACV,GAAG,CAAC,UAAU;YACZ,CAAC,CAAC,uDAAuD;YACzD,CAAC,CAAC,sDAAsD,GAAG,CAAC,MAAM,KAAK;gBACnE,kHAAkH,CACzH,CAAC;IACJ,CAAC;SAAM,IACL,UAAU,CAAC,OAAO,CAAC;QACnB,GAAG,CAAC,KAAK,CACP,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,MAAM,KAAK,UAAU;YACvB,CAAC,CAAC,MAAM,KAAK,WAAW;YACxB,CAAC,CAAC,MAAM,KAAK,uBAAuB,CACvC,EACD,CAAC;QACD,UAAU,GAAG,uBAAuB,CAAC;QACrC,OAAO,CAAC,IAAI,CACV,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC;YACrC,CAAC,CAAC,+CAA+C;YACjD,CAAC,CAAC,kBAAkB,CACvB,CAAC;IACJ,CAAC;SAAM,CAAC;QACN,UAAU,GAAG,iBAAiB,CAAC;IACjC,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,aAAa,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAC/E,UAAU,EAAE,GAAG;QACf,MAAM;QACN,UAAU,EAAE,KAAK,CAAC,aAAa,EAAE;QACjC,IAAI;QACJ,cAAc;QACd,MAAM;QACN,cAAc;QACd,OAAO;QACP,UAAU;KACX,CAAC;AACJ,CAAC;AAED,SAAS,UAAU,CAAC,OAAsB;IACxC,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AACrD,CAAC","sourcesContent":["/**\n * Product B search orchestrator.\n *\n * Identifiability gate → native enumerator → fingerprint dedup → corpus\n * comparison → validate → exploratory fit (never holdout) → holdout →\n * falsify → Pareto. Relation-link / regime gaps abstain (`non-identifiable`)\n * and tell the caller to use `upt discover`.\n *\n * @internal\n */\n\nimport { validate } from '../../dimensional/validator.js';\nimport { equals } from '../../dimensional/algebra.js';\nimport type {\n  ProbeCandidateRecord,\n  ProbeRejectionRecord,\n  SearchBudget,\n  SearchProblem,\n  SearchStopReason,\n  DiscoveryRunManifest,\n} from './types.js';\nimport { DEFAULT_HOLDOUT_TOL, DEFAULT_SEARCH_BUDGET, SCHEMA_VERSION } from './types.js';\nimport { openBudget, budgetStopReason, type BudgetState } from './search-budget.js';\nimport { generateNative, nativeDetermination, powerLawDetermination, powerLawWording, type RawCandidate } from './generator.js';\nimport { fingerprintExpr, complexityOf, bodyExpression } from './fingerprint.js';\nimport {\n  compareToCorpus,\n  corpusPrefactorNotes,\n  corpusRelativeWording,\n  type CorpusComparisonResult,\n} from './corpus.js';\nimport { fitPrefactor, type FitResult } from './fit.js';\nimport { runFalsification, type FalsifyResult } from './falsify.js';\nimport { applyStatus, ProbeCandidateStore } from './candidate-store.js';\nimport { openManifest, closeManifest } from './run-manifest.js';\nimport { hashCanonical } from './serialize.js';\nimport { scoreCandidate, rankPareto, type RankedCandidate } from './scoring.js';\nimport { runBackendWorker } from './backend-protocol.js';\n\n/** Stop wording when the problem carried no holdout rows. @internal */\nexport const NO_HOLDOUT_WORDING = 'no holdout observations: no candidate was tested on withheld data';\n\n/**\n * The argv that runs a Node script as an NDJSON worker: this process's own Node, then the script.\n * @internal\n */\nexport function nodeWorkerArgv(script: string): readonly string[] {\n  return [process.execPath, script];\n}\n\nexport interface ProbeSearchOptions {\n  readonly budget?: SearchBudget;\n  readonly runId?: string;\n  readonly repositoryCommit?: string;\n  readonly holdoutTol?: number;\n  readonly backendArgv?: readonly string[];\n  readonly corpusVersion?: string;\n  readonly now?: string;\n}\n\nexport interface ProbeSearchResult {\n  readonly manifest: DiscoveryRunManifest;\n  readonly candidates: readonly ProbeCandidateRecord[];\n  readonly ranked: readonly RankedCandidate[];\n  readonly rejections: readonly ProbeRejectionRecord[];\n  readonly fits: Readonly<Record<string, FitResult>>;\n  readonly falsifications: Readonly<Record<string, FalsifyResult>>;\n  readonly corpus: Readonly<Record<string, CorpusComparisonResult>>;\n  /**\n   * For a candidate equivalent to a corpus relation, the fitted prefactor\n   * against that relation's prefactor (see `corpusPrefactorNotes`).\n   */\n  readonly prefactorNotes: Readonly<Record<string, readonly string[]>>;\n  readonly wording: readonly string[];\n  readonly stopReason: SearchStopReason;\n}\n\nfunction abstain(\n  problem: SearchProblem,\n  opts: ProbeSearchOptions,\n  reason: SearchStopReason,\n  wording: readonly string[],\n): ProbeSearchResult {\n  const budget = opts.budget ?? DEFAULT_SEARCH_BUDGET;\n  const runId = opts.runId ?? `dr-${hashCanonical(problem.gap.id).slice(0, 12)}`;\n  const open = openManifest({\n    runId,\n    repositoryCommit: opts.repositoryCommit ?? 'unknown',\n    problem,\n    searchBudget: budget,\n    startedAt: opts.now,\n  });\n  const manifest = closeManifest(open, reason, opts.now);\n  return {\n    manifest,\n    candidates: [],\n    ranked: [],\n    rejections: [],\n    fits: {},\n    falsifications: {},\n    corpus: {},\n    prefactorNotes: {},\n    wording,\n    stopReason: reason,\n  };\n}\n\nfunction gate(problem: SearchProblem): { ok: true } | { ok: false; wording: string } {\n  if (problem.gap.kind === 'relation-link' || problem.gap.kind === 'regime-transition') {\n    return {\n      ok: false,\n      wording: `${problem.gap.kind} gaps are Product A — use \\`upt discover\\`, not \\`upt probe run\\``,\n    };\n  }\n  if (!problem.gap.searchability.searchable) {\n    return {\n      ok: false,\n      wording: problem.gap.searchability.reasons.join('; ') || 'gap is not searchable',\n    };\n  }\n  if (problem.gap.identifiability.parametric?.status === 'non-identifiable') {\n    return {\n      ok: false,\n      wording:\n        problem.gap.identifiability.parametric.reasons.join('; ') || 'parametrically non-identifiable',\n    };\n  }\n  return { ok: true };\n}\n\nfunction referencesSymbol(expr: RawCandidate['expression'], name: string): boolean {\n  switch (expr.kind) {\n    case 'symbol':\n      return expr.name === name;\n    case 'op':\n      return expr.args.some((arg) => referencesSymbol(arg, name));\n    case 'integral':\n      return referencesSymbol(expr.over, name) || referencesSymbol(expr.integrand, name);\n    case 'derivative':\n      return referencesSymbol(expr.of, name) || referencesSymbol(expr.wrt, name);\n    case 'transcendental':\n    case 'abs':\n    case 'dirac-delta':\n      return referencesSymbol(expr.arg, name);\n    case 'variational-derivative':\n      return (\n        referencesSymbol(expr.functional, name) ||\n        referencesSymbol(expr.field, name) ||\n        referencesSymbol(expr.over, name)\n      );\n    default:\n      return false;\n  }\n}\n\nfunction makeGenerated(\n  expr: RawCandidate['expression'],\n  problem: SearchProblem,\n  runId: string,\n  at: string,\n  origin: ProbeCandidateRecord['origin'],\n  seq: number,\n): ProbeCandidateRecord {\n  const fp = fingerprintExpr(\n    expr,\n    problem.regimeSignature ?? '',\n    (problem.assumptions ?? []).join('|'),\n  );\n  return {\n    id: `h-${seq}-${fp.canonicalAstHash.slice(0, 10)}`,\n    gapId: problem.gap.id,\n    body: { kind: 'scalar-expr', expression: expr },\n    origin,\n    assumptions: problem.assumptions ?? [],\n    status: 'generated',\n    statusHistory: [\n      { at, from: 'none', to: 'generated', reason: 'enumerator', runId },\n    ],\n    evaluations: [],\n    fingerprint: fp,\n    complexity: complexityOf(expr),\n    schemaVersion: SCHEMA_VERSION,\n  };\n}\n\n/**\n * Run a bounded Product B search. Never mutates Product A catalogs.\n *\n * @internal\n */\nexport async function runProbeSearch(\n  problem: SearchProblem,\n  opts: ProbeSearchOptions = {},\n): Promise<ProbeSearchResult> {\n  const blocked = gate(problem);\n  if (!blocked.ok) {\n    return abstain(problem, opts, 'non-identifiable', [blocked.wording]);\n  }\n\n  const budget = opts.budget ?? DEFAULT_SEARCH_BUDGET;\n  const state: BudgetState = openBudget(budget);\n  const runId = opts.runId ?? `dr-${hashCanonical({\n    gap: problem.gap.id,\n    target: problem.target.name,\n    governing: problem.governing.map((g) => g.name),\n  }).slice(0, 12)}`;\n  const at = opts.now ?? new Date().toISOString();\n  const corpusVersion = opts.corpusVersion ?? SCHEMA_VERSION;\n  const store = new ProbeCandidateStore();\n  const fits: Record<string, FitResult> = {};\n  const falsifications: Record<string, FalsifyResult> = {};\n  const corpus: Record<string, CorpusComparisonResult> = {};\n  const prefactorNotes: Record<string, string[]> = {};\n  const wording: string[] = [];\n  const seenHash = new Set<string>();\n  let seq = 0;\n\n  const raws: RawCandidate[] = [];\n  const { unsearched } = nativeDetermination(problem);\n  if (unsearched.length > 0) {\n    wording.push(\n      `the monomial is taken from the dimensioned inputs; an unknown function of the ` +\n        `dimensionless input(s) {${unsearched.join(', ')}} is not searched as such`,\n    );\n  }\n  // What the power-law fit over the π-groups found on the exploratory rows, or why it abstained\n  // (a negative result is a result); the generator ran the same fit to emit its candidate.\n  const powerLaw = hasAnyData(problem) ? powerLawDetermination(problem) : null;\n  const powerLawNote = powerLaw ? powerLawWording(powerLaw) : null;\n  if (powerLawNote !== null) wording.push(powerLawNote);\n  for (const raw of generateNative(problem, state)) {\n    raws.push(raw);\n    const stop = budgetStopReason(state);\n    if (stop) break;\n  }\n\n  if (opts.backendArgv && opts.backendArgv.length > 0 && !budgetStopReason(state)) {\n    const remainingMs = Math.max(1, budget.maxWallClockMs - (performance.now() - state.startedAtMs));\n    const backend = await runBackendWorker(\n      opts.backendArgv,\n      {\n        problemId: problem.gap.id,\n        budgetMs: remainingMs,\n        variables: problem.governing.map((g) => g.name),\n        target: problem.target.name,\n      },\n      { timeoutMs: remainingMs },\n    );\n    if (!backend.ok) {\n      wording.push(`backend abstained: ${backend.error ?? 'unknown error'}`);\n    } else {\n      for (const c of backend.candidates) {\n        if (budgetStopReason(state)) break;\n        state.candidates += 1;\n        raws.push({\n          expression: c.expression,\n          monomial: null,\n          originNote: 'external-backend',\n        });\n      }\n    }\n  }\n\n  const open = openManifest({\n    runId,\n    repositoryCommit: opts.repositoryCommit ?? 'unknown',\n    problem,\n    datasetHashes: [\n      ...(problem.exploratory ? [hashCanonical(problem.exploratory)] : []),\n      ...(problem.holdout ? [hashCanonical(problem.holdout)] : []),\n    ],\n    tolerances: { holdoutRmse: opts.holdoutTol ?? DEFAULT_HOLDOUT_TOL },\n    searchBudget: budget,\n    startedAt: at,\n    backendDescriptors: opts.backendArgv\n      ? [\n          {\n            protocolVersion: '0',\n            backendId: 'native',\n            backendVersion: SCHEMA_VERSION,\n            capabilities: ['grammar-enumerator'],\n            deterministic: 'yes',\n          },\n          {\n            protocolVersion: '0',\n            backendId: opts.backendArgv.join(' '),\n            backendVersion: 'external',\n            capabilities: ['external-backend'],\n            deterministic: 'unknown',\n          },\n        ]\n      : undefined,\n  });\n\n  for (const raw of raws) {\n    const stop = budgetStopReason(state);\n    if (stop) break;\n\n    const origin: ProbeCandidateRecord['origin'] = raw.originNote === 'external-backend'\n      ? { kind: 'external-backend', backendId: 'external', runId }\n      : { kind: 'grammar-enumerator', runId };\n    seq += 1;\n    let rec = makeGenerated(raw.expression, problem, runId, at, origin, seq);\n    if (seenHash.has(rec.fingerprint.canonicalAstHash)) continue;\n    seenHash.add(rec.fingerprint.canonicalAstHash);\n    store.put(rec);\n\n    const expr = bodyExpression(rec.body);\n    if (referencesSymbol(expr, problem.target.name)) {\n      rec = applyStatus(rec, 'rejected', `candidate reads target observable '${problem.target.name}'`, runId, at);\n      store.replace(rec);\n      store.rememberRejection({\n        fingerprint: rec.fingerprint,\n        reason: `target-observable self-reference: ${problem.target.name}`,\n        context: problem.gap.id,\n        timestamp: at,\n      });\n      continue;\n    }\n\n    const v = validate(expr);\n    if (!v.ok || v.inferredDimension === null) {\n      rec = applyStatus(rec, 'rejected', 'dimensionally invalid', runId, at);\n      store.replace(rec);\n      store.rememberRejection({\n        fingerprint: rec.fingerprint,\n        reason: 'dimensionally invalid',\n        context: problem.gap.id,\n        timestamp: at,\n      });\n      continue;\n    }\n    if (!equals(v.inferredDimension, problem.target.dim)) {\n      rec = applyStatus(rec, 'rejected', 'candidate dimension does not match target observable', runId, at);\n      store.replace(rec);\n      store.rememberRejection({\n        fingerprint: rec.fingerprint,\n        reason: 'target-dimension mismatch',\n        context: problem.gap.id,\n        timestamp: at,\n      });\n      continue;\n    }\n    rec = applyStatus(rec, 'structurally-valid', 'validate() ok', runId, at);\n    store.replace(rec);\n\n    const corp = compareToCorpus(bodyExpression(rec.body), corpusVersion);\n    corpus[rec.id] = corp;\n    wording.push(corpusRelativeWording(corp));\n    const known = corp.algebraicMatches.length > 0;\n    const hasData = (problem.exploratory?.rows.length ?? 0) > 0;\n\n    if (!hasData) {\n      rec = applyStatus(\n        rec,\n        known ? 'equivalent-known' : 'insufficient-evidence',\n        known ? corpusRelativeWording(corp) : 'no exploratory observations',\n        runId,\n        at,\n      );\n      store.replace(rec);\n      continue;\n    }\n\n    state.evaluations += 1;\n    let fit: FitResult;\n    try {\n      fit = fitPrefactor(\n        bodyExpression(rec.body),\n        problem.exploratory!,\n        problem.holdout,\n        opts.holdoutTol ?? DEFAULT_HOLDOUT_TOL,\n      );\n    } catch (err) {\n      rec = applyStatus(\n        rec,\n        'rejected',\n        err instanceof Error ? err.message : String(err),\n        runId,\n        at,\n      );\n      store.replace(rec);\n      continue;\n    }\n    fits[rec.id] = fit;\n    rec = applyStatus(rec, 'empirically-fit', `exploratory RMSE ${fit.exploratoryRmse}`, runId, at);\n    store.replace(rec);\n\n    if (!problem.holdout || problem.holdout.rows.length === 0) {\n      rec = applyStatus(rec, 'insufficient-evidence', 'no holdout observations', runId, at);\n      store.replace(rec);\n      continue;\n    }\n    if (!fit.holdoutSupported) {\n      rec = applyStatus(rec, 'rejected', `holdout RMSE ${fit.holdoutRmse} exceeds tolerance`, runId, at);\n      store.replace(rec);\n      store.rememberRejection({\n        fingerprint: rec.fingerprint,\n        reason: `holdout RMSE ${fit.holdoutRmse}`,\n        context: problem.gap.id,\n        timestamp: at,\n      });\n      continue;\n    }\n\n    rec = applyStatus(rec, 'heldout-supported', `holdout RMSE ${fit.holdoutRmse}`, runId, at);\n    store.replace(rec);\n\n    if (known) {\n      // Equivalent up to a constant is not equal: compare the fitted constant\n      // with the corpus one where the corpus records it (persona finding L7).\n      prefactorNotes[rec.id] = corpusPrefactorNotes(\n        corp,\n        bodyExpression(rec.body),\n        fit.prefactor,\n        opts.holdoutTol ?? DEFAULT_HOLDOUT_TOL,\n        fit.prefactorStderr,\n      );\n      rec = applyStatus(rec, 'equivalent-known', corpusRelativeWording(corp), runId, at);\n      store.replace(rec);\n      continue;\n    }\n\n    const fal = runFalsification({\n      expr: bodyExpression(rec.body),\n      dataset: problem.holdout,\n      prefactor: fit.prefactor,\n      claimedRegimes: problem.claimedRegimes,\n      limits: problem.limits,\n    });\n    falsifications[rec.id] = fal;\n    if (!fal.survived) {\n      rec = applyStatus(rec, 'falsified', fal.records.filter((r) => r.outcome === 'fail').map((r) => r.detail).join('; '), runId, at);\n      store.replace(rec);\n      continue;\n    }\n    rec = applyStatus(rec, 'falsification-survivor', 'all fatal batteries passed', runId, at);\n    rec = applyStatus(rec, 'expert-review-required', 'survived batteries; human review required', runId, at);\n    store.replace(rec);\n  }\n\n  const all = store.all();\n  const scored = all.map((record) => {\n    const fit = fits[record.id];\n    const emp = fit\n      ? 1 / (1 + fit.exploratoryRmse)\n      : record.status === 'equivalent-known'\n        ? 0.5\n        : 0;\n    const corp = corpus[record.id];\n    const dist = corp && corp.algebraicMatches.length > 0 ? 0 : 1;\n    // Robustness is read from the batteries this record ran, not from its status.\n    return { record, scores: scoreCandidate(record, emp, dist, falsifications[record.id]) };\n  });\n  const ranked = rankPareto(scored);\n\n  const budgetStop = budgetStopReason(state);\n  let stopReason: SearchStopReason;\n  if (budgetStop) {\n    stopReason = budgetStop;\n  } else if (all.length === 0) {\n    stopReason = 'no-credible-candidate';\n    // Say WHY (persona finding C2): \"no dimensionally valid candidates\" was\n    // printed even when the real reason was a non-unique monomial.\n    const { det } = nativeDetermination(problem);\n    wording.push(\n      det.determined\n        ? 'enumerator produced no dimensionally valid candidates'\n        : `the target is not a unique monomial of the inputs (${det.reason}); ` +\n            'the native enumerator searches unique monomials and, with exploratory rows, a rational power law of the π-groups',\n    );\n  } else if (\n    hasAnyData(problem) &&\n    all.every(\n      (c) =>\n        c.status === 'rejected' ||\n        c.status === 'falsified' ||\n        c.status === 'insufficient-evidence',\n    )\n  ) {\n    stopReason = 'no-credible-candidate';\n    wording.push(\n      (problem.holdout?.rows.length ?? 0) > 0\n        ? 'no candidate survived holdout / falsification'\n        : NO_HOLDOUT_WORDING,\n    );\n  } else {\n    stopReason = 'exhausted-space';\n  }\n\n  return {\n    manifest: closeManifest(open, stopReason, opts.now ?? new Date().toISOString()),\n    candidates: all,\n    ranked,\n    rejections: store.rejectionList(),\n    fits,\n    falsifications,\n    corpus,\n    prefactorNotes,\n    wording,\n    stopReason,\n  };\n}\n\nfunction hasAnyData(problem: SearchProblem): boolean {\n  return (problem.exploratory?.rows.length ?? 0) > 0;\n}\n"]}

package/dist/composition/probe/power-law.d.ts

@@ -0,0 +1,121 @@
+/**
+ * Power-law discovery over the Buckingham π-groups (proposal 8 of
+ * docs/planning/2026-10-15-map-maker-discoverer-proposals.md).
+ *
+ * When the governing variables leave k ≥ 1 dimensionless groups, dimensional
+ * analysis fixes the target only as `base · F(π₁, …, πₖ)` for an unknown F.
+ * This module fits the one family a monomial search can state, F = C Π πₖ^{aₖ}:
+ * `log(y/base) = log C + Σ aₖ log πₖ` by MathTS `ols` on the exploratory rows,
+ * reads the coefficients and their standard errors back, and rationalises each
+ * aₖ that lies within 2·stderr of a fraction with denominator ≤ 6 (a bounded
+ * scan, not `Fraction.fromNumber`, whose continued fraction can exceed its
+ * cap). An exponent that is not such a fraction is a NEGATIVE RESULT stated in
+ * the abstention, not a candidate with a decimal exponent.
+ *
+ * The fit reads `problem.exploratory` only: the holdout rows are never seen
+ * here, exactly as `fit.ts` never fits them.
+ *
+ * @internal
+ */
+import { type PiGroup } from '../../dimensional/buckingham.js';
+import type { DimensionalVariableRef, ObservationRow, SearchProblem } from './types.js';
+/** One fitted π-group exponent: the estimate, its standard error, the 2σ interval and the fraction chosen in it. @internal */
+export interface PowerLawExponent {
+    /** The π-group's display form, e.g. `a · b^-1`. */
+    readonly group: string;
+    /** The π-group's integer exponent per variable. */
+    readonly exponents: Readonly<Record<string, number>>;
+    readonly estimate: number;
+    readonly stderr: number;
+    /** estimate ± 2·stderr. */
+    readonly interval: readonly [number, number];
+    /** The fraction with the smallest denominator ≤ 6 inside the interval; null when there is none. */
+    readonly rational: {
+        readonly numerator: number;
+        readonly denominator: number;
+    } | null;
+}
+/** A recovered rational power law: `monomial` is base + Σ (pₖ/qₖ)·πₖ per variable. @internal */
+export interface PowerLawFit {
+    readonly kind: 'fit';
+    /** The base monomial of the target over a maximal dimensionally independent subset of the governing set. */
+    readonly base: Readonly<Record<string, number>>;
+    readonly exponents: readonly PowerLawExponent[];
+    /** log C of the fit (the prefactor is refit on the linear scale by the pipeline, like any candidate's). */
+    readonly logPrefactor: number;
+    readonly r2: number;
+    /** Rows the fit used: a positive finite observation, base and every π. */
+    readonly nRows: number;
+    readonly skippedRows: number;
+    /** The combined exponent per governing variable, rational values as numbers. */
+    readonly monomial: Readonly<Record<string, number>>;
+}
+/** The outcome of {@link powerLawDetermination}. @internal */
+export type PowerLawDetermination = PowerLawFit | {
+    readonly kind: 'not-applicable';
+    readonly reason: string;
+} | {
+    readonly kind: 'abstained';
+    readonly reason: string;
+    readonly nRows: number;
+    readonly skippedRows: number;
+};
+/** The largest denominator the exponent scan admits. @internal */
+export declare const MAX_EXPONENT_DENOMINATOR = 6;
+/** A reduced fraction. @internal */
+export interface Rational {
+    readonly numerator: number;
+    readonly denominator: number;
+}
+/**
+ * Every distinct reduced fraction p/q with q ≤ `maxDen` within `tol` of `x`,
+ * in order of denominator (so 1/2 comes before 2/3). Empty when none is near;
+ * more than one when the tolerance is too wide to tell them apart. @internal
+ */
+export declare function rationalCandidates(x: number, tol: number, maxDen?: number): Rational[];
+/**
+ * The one fraction p/q with q ≤ `maxDen` within `tol` of `x`, or null when
+ * there is none or more than one (an estimate whose interval holds two
+ * admissible fractions does not determine either). @internal
+ */
+export declare function rationalizeExponent(x: number, tol: number, maxDen?: number): Rational | null;
+/** The π-groups of the governing set and the target's base monomial over a maximal dimensionally independent subset. @internal */
+export interface PiStructure {
+    readonly groups: readonly PiGroup[];
+    /** Null when the target's dimension is not in the span of the governing variables. */
+    readonly base: Readonly<Record<string, number>> | null;
+}
+/**
+ * The π-groups among the governing variables (MathTS `rationalNullspace`
+ * through {@link buckinghamPi}) and the base monomial: the unique monomial of
+ * the target over the first maximal dimensionally independent subset of the
+ * governing set, in declared order. @internal
+ */
+export declare function piStructure(target: DimensionalVariableRef, governing: readonly DimensionalVariableRef[]): PiStructure;
+/** The log-design of a set of rows: `[1, log π₁, …, log πₖ]` per usable row. @internal */
+export interface LogDesign {
+    readonly rows: readonly (readonly number[])[];
+    /** Rows where every π-group is positive and finite. */
+    readonly used: number;
+    readonly skipped: number;
+}
+/** The log-design matrix over the rows where every π-group is positive and finite. @internal */
+export declare function logDesign(groups: readonly PiGroup[], rows: readonly ObservationRow[]): LogDesign;
+/**
+ * The rank of a log-design (MathTS `matrixRank`, whose tolerance is an absolute
+ * 1e-10, so the columns are scaled to order one first). 0 for no rows. @internal
+ */
+export declare function logDesignRank(design: LogDesign): number;
+/**
+ * Fit `log(y/base) = log C + Σ aₖ log πₖ` on the exploratory rows and
+ * rationalise the exponents (module docs). Not applicable when the governing
+ * set already fixes the target (the unique-monomial path searches that), when
+ * it leaves no π-group, or when the target is outside its span. Abstains, with
+ * the reason, without exploratory rows, below k + 2 usable rows, when a
+ * π-group does not vary, when the log-design is collinear, or when an exponent
+ * is not within 2σ of a fraction with denominator ≤ 6. @internal
+ */
+export declare function powerLawDetermination(problem: SearchProblem): PowerLawDetermination;
+/** One line for a run's wording: what the power-law fit found or why it abstained. @internal */
+export declare function powerLawWording(pl: PowerLawDetermination): string | null;
+//# sourceMappingURL=power-law.d.ts.map

package/dist/composition/probe/power-law.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"power-law.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/power-law.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAGH,OAAO,EAAyC,KAAK,OAAO,EAAE,MAAM,iCAAiC,CAAC;AACtG,OAAO,KAAK,EAAE,sBAAsB,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAExF,8HAA8H;AAC9H,MAAM,WAAW,gBAAgB;IAC/B,mDAAmD;IACnD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,mDAAmD;IACnD,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACrD,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,2BAA2B;IAC3B,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7C,mGAAmG;IACnG,QAAQ,CAAC,QAAQ,EAAE;QAAE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;CACxF;AAED,gGAAgG;AAChG,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;IACrB,4GAA4G;IAC5G,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAChD,QAAQ,CAAC,SAAS,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAChD,2GAA2G;IAC3G,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,0EAA0E;IAC1E,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,gFAAgF;IAChF,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CACrD;AAED,8DAA8D;AAC9D,MAAM,MAAM,qBAAqB,GAC7B,WAAW,GACX;IAAE,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAC5D;IAAE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;CAAE,CAAC;AAElH,kEAAkE;AAClE,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAE1C,oCAAoC;AACpC,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC9B;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,SAA2B,GAAG,QAAQ,EAAE,CAaxG;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,SAA2B,GAAG,QAAQ,GAAG,IAAI,CAG9G;AAOD,kIAAkI;AAClI,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,CAAC;IACpC,sFAAsF;IACtF,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC;CACxD;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,sBAAsB,EAAE,SAAS,EAAE,SAAS,sBAAsB,EAAE,GAAG,WAAW,CAcrH;AAcD,0FAA0F;AAC1F,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAAC;IAC9C,uDAAuD;IACvD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED,gGAAgG;AAChG,wBAAgB,SAAS,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE,EAAE,IAAI,EAAE,SAAS,cAAc,EAAE,GAAG,SAAS,CAYhG;AAUD;;;GAGG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,SAAS,GAAG,MAAM,CAMvD;AASD;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,aAAa,GAAG,qBAAqB,CA2FnF;AAED,gGAAgG;AAChG,wBAAgB,eAAe,CAAC,EAAE,EAAE,qBAAqB,GAAG,MAAM,GAAG,IAAI,CAWxE"}

package/dist/composition/probe/power-law.js

@@ -0,0 +1,255 @@
+/**
+ * Power-law discovery over the Buckingham π-groups (proposal 8 of
+ * docs/planning/2026-10-15-map-maker-discoverer-proposals.md).
+ *
+ * When the governing variables leave k ≥ 1 dimensionless groups, dimensional
+ * analysis fixes the target only as `base · F(π₁, …, πₖ)` for an unknown F.
+ * This module fits the one family a monomial search can state, F = C Π πₖ^{aₖ}:
+ * `log(y/base) = log C + Σ aₖ log πₖ` by MathTS `ols` on the exploratory rows,
+ * reads the coefficients and their standard errors back, and rationalises each
+ * aₖ that lies within 2·stderr of a fraction with denominator ≤ 6 (a bounded
+ * scan, not `Fraction.fromNumber`, whose continued fraction can exceed its
+ * cap). An exponent that is not such a fraction is a NEGATIVE RESULT stated in
+ * the abstention, not a candidate with a decimal exponent.
+ *
+ * The fit reads `problem.exploratory` only: the holdout rows are never seen
+ * here, exactly as `fit.ts` never fits them.
+ *
+ * @internal
+ */
+import { matrixRank, ols } from '@danielsimonjr/mathts-functions';
+import { buckinghamPi, dimensionallyDetermines } from '../../dimensional/buckingham.js';
+/** The largest denominator the exponent scan admits. @internal */
+export const MAX_EXPONENT_DENOMINATOR = 6;
+/**
+ * Every distinct reduced fraction p/q with q ≤ `maxDen` within `tol` of `x`,
+ * in order of denominator (so 1/2 comes before 2/3). Empty when none is near;
+ * more than one when the tolerance is too wide to tell them apart. @internal
+ */
+export function rationalCandidates(x, tol, maxDen = MAX_EXPONENT_DENOMINATOR) {
+    if (!Number.isFinite(x) || !(tol >= 0))
+        return [];
+    const out = [];
+    for (let d = 1; d <= maxDen; d++) {
+        const lo = Math.ceil((x - tol) * d);
+        const hi = Math.floor((x + tol) * d);
+        for (let n = lo; n <= hi; n++) {
+            const g = gcd(Math.abs(n), d);
+            const r = { numerator: n / g, denominator: d / g };
+            if (!out.some((o) => o.numerator === r.numerator && o.denominator === r.denominator))
+                out.push(r);
+        }
+    }
+    return out;
+}
+/**
+ * The one fraction p/q with q ≤ `maxDen` within `tol` of `x`, or null when
+ * there is none or more than one (an estimate whose interval holds two
+ * admissible fractions does not determine either). @internal
+ */
+export function rationalizeExponent(x, tol, maxDen = MAX_EXPONENT_DENOMINATOR) {
+    const all = rationalCandidates(x, tol, maxDen);
+    return all.length === 1 ? all[0] : null;
+}
+function gcd(a, b) {
+    while (b !== 0)
+        [a, b] = [b, a % b];
+    return a === 0 ? 1 : a;
+}
+/**
+ * The π-groups among the governing variables (MathTS `rationalNullspace`
+ * through {@link buckinghamPi}) and the base monomial: the unique monomial of
+ * the target over the first maximal dimensionally independent subset of the
+ * governing set, in declared order. @internal
+ */
+export function piStructure(target, governing) {
+    if (governing.length === 0)
+        return { groups: [], base: null };
+    const groups = buckinghamPi(governing).piGroups;
+    const independent = [];
+    for (const g of governing) {
+        if (buckinghamPi([...independent, g]).piGroupCount === 0)
+            independent.push(g);
+    }
+    const det = dimensionallyDetermines(target, independent);
+    const base = {};
+    if (det.determined && det.monomial) {
+        for (const g of governing)
+            base[g.name] = det.monomial[g.name] ?? 0;
+        return { groups, base };
+    }
+    return { groups, base: null };
+}
+/** `Π row[name]^exp` over the non-zero exponents; NaN when a name is missing. */
+function monomialValue(exponents, row) {
+    let v = 1;
+    for (const [name, e] of Object.entries(exponents)) {
+        if (e === 0)
+            continue;
+        const x = row[name];
+        if (x === undefined)
+            return NaN;
+        v *= x ** e;
+    }
+    return v;
+}
+/** The log-design matrix over the rows where every π-group is positive and finite. @internal */
+export function logDesign(groups, rows) {
+    const out = [];
+    let skipped = 0;
+    for (const row of rows) {
+        const pis = groups.map((g) => monomialValue(g.exponents, row));
+        if (!pis.every((p) => Number.isFinite(p) && p > 0)) {
+            skipped += 1;
+            continue;
+        }
+        out.push([1, ...pis.map((p) => Math.log(p))]);
+    }
+    return { rows: out, used: out.length, skipped };
+}
+/** Each column divided by its largest magnitude (a zero column stays zero): order one, as `ols` and `matrixRank` need. */
+function scaleColumns(rows) {
+    const k = rows[0]?.length ?? 0;
+    const scales = Array.from({ length: k }, (_, j) => rows.reduce((m, r) => Math.max(m, Math.abs(r[j])), 0));
+    const scaled = rows.map((r) => r.map((v, j) => (scales[j] > 0 ? v / scales[j] : 0)));
+    return { scaled, scales };
+}
+/**
+ * The rank of a log-design (MathTS `matrixRank`, whose tolerance is an absolute
+ * 1e-10, so the columns are scaled to order one first). 0 for no rows. @internal
+ */
+export function logDesignRank(design) {
+    if (design.rows.length === 0)
+        return 0;
+    const { scaled } = scaleColumns(design.rows);
+    const r = matrixRank(scaled);
+    if (typeof r !== 'number' || !Number.isInteger(r))
+        throw new TypeError('matrixRank did not return an integer');
+    return r;
+}
+/** A finite number read back from a MathTS result array, or null. */
+function numberAt(arr, i) {
+    if (!Array.isArray(arr))
+        return null;
+    const v = arr[i];
+    return typeof v === 'number' && Number.isFinite(v) ? v : null;
+}
+/**
+ * Fit `log(y/base) = log C + Σ aₖ log πₖ` on the exploratory rows and
+ * rationalise the exponents (module docs). Not applicable when the governing
+ * set already fixes the target (the unique-monomial path searches that), when
+ * it leaves no π-group, or when the target is outside its span. Abstains, with
+ * the reason, without exploratory rows, below k + 2 usable rows, when a
+ * π-group does not vary, when the log-design is collinear, or when an exponent
+ * is not within 2σ of a fraction with denominator ≤ 6. @internal
+ */
+export function powerLawDetermination(problem) {
+    const full = dimensionallyDetermines(problem.target, problem.governing);
+    if (full.determined) {
+        return { kind: 'not-applicable', reason: 'the governing set fixes the target up to a constant; the unique-monomial path searches it' };
+    }
+    const { groups, base } = piStructure(problem.target, problem.governing);
+    if (groups.length === 0) {
+        return { kind: 'not-applicable', reason: 'the governing set leaves no dimensionless group to raise to a power' };
+    }
+    if (base === null) {
+        return { kind: 'not-applicable', reason: "the target's dimension is not in the span of the governing variables" };
+    }
+    const rows = problem.exploratory?.rows ?? [];
+    if (rows.length === 0) {
+        return { kind: 'abstained', reason: 'no exploratory rows: the power-law fit needs data', nRows: 0, skippedRows: 0 };
+    }
+    const k = groups.length;
+    const X = [];
+    const ylog = [];
+    let skipped = 0;
+    for (const row of rows) {
+        const y = row[problem.target.name];
+        const b = monomialValue(base, row);
+        const pis = groups.map((g) => monomialValue(g.exponents, row));
+        if (!(y !== undefined && Number.isFinite(y) && y > 0 && Number.isFinite(b) && b > 0) || !pis.every((p) => Number.isFinite(p) && p > 0)) {
+            skipped += 1;
+            continue;
+        }
+        X.push(pis.map((p) => Math.log(p)));
+        ylog.push(Math.log(y / b));
+    }
+    const used = X.length;
+    const abstain = (reason) => ({ kind: 'abstained', reason, nRows: used, skippedRows: skipped });
+    if (used < k + 2) {
+        return abstain(`only ${used} usable row(s) (positive observation, base and π-groups) for ${k} exponent(s) and a prefactor; the fit needs at least ${k + 2}`);
+    }
+    // A π-group whose log spreads by no more than round-off (1e-12 of its magnitude, or absolute)
+    // does not vary: a/b with b = a is 1 up to an ulp, and that ulp is not an exponent's evidence.
+    for (let j = 0; j < k; j++) {
+        // Reductions, not spreads: a spread of a large row set overflows the call stack.
+        const lo = X.reduce((m, r) => Math.min(m, r[j]), Number.POSITIVE_INFINITY);
+        const hi = X.reduce((m, r) => Math.max(m, r[j]), Number.NEGATIVE_INFINITY);
+        if (hi - lo <= 1e-12 * Math.max(1, Math.abs(hi), Math.abs(lo))) {
+            return abstain(`π-group ${groups[j].formula} does not vary over the usable rows, so its exponent is not identifiable`);
+        }
+    }
+    // Columns scaled to order one. History: before @danielsimonjr/mathts-functions 0.68.4, `ols`
+    // tested singularity with an absolute 1e-15, so a column of log π of magnitude 1e-9 read as
+    // collinear unscaled. From 0.68.4 (installed) `ols` equilibrates the design itself, and an
+    // unscaled 1e-9 column fits without throwing. The scaling stays, because it also conditions
+    // `matrixRank` (logDesignRank, which scales the same way). Coefficients and errors are unscaled after.
+    const { scaled, scales } = scaleColumns(X);
+    let fit;
+    try {
+        fit = ols(scaled, ylog, { intercept: true });
+    }
+    catch (e) {
+        return abstain(`the log-design is collinear over the rows (${e.message}); the exponents are not identifiable`);
+    }
+    const logPrefactor = numberAt(fit.coefficients, 0);
+    const r2 = typeof fit.r2 === 'number' && Number.isFinite(fit.r2) ? fit.r2 : null;
+    if (logPrefactor === null || r2 === null)
+        return abstain('ols did not return a finite intercept and R²');
+    const exponents = [];
+    for (let j = 0; j < k; j++) {
+        const c = numberAt(fit.coefficients, j + 1);
+        const se = numberAt(fit.stderr, j + 1);
+        if (c === null || se === null)
+            return abstain(`ols did not return a finite coefficient and standard error for π-group ${groups[j].formula}`);
+        const estimate = c / scales[j];
+        const stderr = se / scales[j];
+        // Noise-free rows give stderr 0; a representation tolerance keeps 0.5000000000000001 at 1/2.
+        const tol = Math.max(2 * stderr, 1e-9 * Math.max(1, Math.abs(estimate)));
+        const near = rationalCandidates(estimate, tol);
+        const rational = near.length === 1 ? near[0] : null;
+        const group = groups[j];
+        exponents.push({ group: group.formula, exponents: group.exponents, estimate, stderr, interval: [estimate - 2 * stderr, estimate + 2 * stderr], rational });
+        const value = `${estimate.toPrecision(4)} ± ${stderr.toPrecision(2)}`;
+        if (near.length === 0) {
+            return abstain(`the exponent of ${group.formula} is ${value}, not within 2σ of a fraction with denominator ≤ ${MAX_EXPONENT_DENOMINATOR}`);
+        }
+        if (near.length > 1) {
+            const list = near.slice(0, 4).map((r) => (r.denominator === 1 ? `${r.numerator}` : `${r.numerator}/${r.denominator}`)).join(', ');
+            return abstain(`the exponent of ${group.formula} is ${value}: its 2σ interval holds ${near.length} fractions with denominator ≤ ${MAX_EXPONENT_DENOMINATOR} (${list}${near.length > 4 ? ', …' : ''}), so the rows do not determine it`);
+        }
+    }
+    const monomial = { ...base };
+    for (const e of exponents) {
+        const a = e.rational.numerator / e.rational.denominator;
+        for (const [name, p] of Object.entries(e.exponents))
+            monomial[name] = (monomial[name] ?? 0) + a * p;
+    }
+    return { kind: 'fit', base, exponents, logPrefactor, r2, nRows: used, skippedRows: skipped, monomial };
+}
+/** One line for a run's wording: what the power-law fit found or why it abstained. @internal */
+export function powerLawWording(pl) {
+    if (pl.kind === 'not-applicable')
+        return null;
+    if (pl.kind === 'abstained')
+        return `no power law from the exploratory rows: ${pl.reason}`;
+    const terms = pl.exponents
+        .map((e) => {
+        const { numerator: p, denominator: q } = e.rational;
+        const frac = q === 1 ? `${p}` : `${p}/${q}`;
+        return `(${e.group})^(${frac}) [a = ${e.estimate.toPrecision(3)} ± ${e.stderr.toPrecision(2)}]`;
+    })
+        .join(' · ');
+    return `power law from the exploratory rows: base · ${terms}; R² = ${pl.r2.toPrecision(4)} on ${pl.nRows} row(s)${pl.skippedRows > 0 ? ` (${pl.skippedRows} skipped: non-positive)` : ''}; each exponent is the fraction with denominator ≤ ${MAX_EXPONENT_DENOMINATOR} within 2σ of the fit`;
+}
+//# sourceMappingURL=power-law.js.map