universal-physics-tensor 10.0.0 → 12.0.0

package/dist/composition/probe/run-manifest.d.ts

@@ -10,6 +10,7 @@ import type { DiscoveryBackendDescriptor, DiscoveryRunManifest, SearchBudget, Se
  * @internal
  */
 export { captureEnvironment } from '../canonical-json.js';
+/** The inputs from which openManifest builds one discovery run manifest. */
 export interface ManifestDraft {
     readonly runId: string;
     readonly repositoryCommit: string;

package/dist/composition/probe/run-manifest.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"run-manifest.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/run-manifest.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EACV,0BAA0B,EAC1B,oBAAoB,EACpB,YAAY,EACZ,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAIpB;;;;GAIG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,aAAa,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,QAAQ,CAAC,kBAAkB,CAAC,EAAE,SAAS,0BAA0B,EAAE,CAAC;IACpE,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;IACjE,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,QAAQ,CAAC,YAAY,CAAC,EAAE,YAAY,CAAC;IACrC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,gFAAgF;AAChF,wBAAgB,YAAY,CAAC,KAAK,EAAE,aAAa,GAAG,oBAAoB,CA0BvE;AAED,uEAAuE;AACvE,wBAAgB,aAAa,CAC3B,IAAI,EAAE,oBAAoB,EAC1B,UAAU,EAAE,gBAAgB,EAC5B,WAAW,SAA2B,GACrC,oBAAoB,CAEtB"}
+{"version":3,"file":"run-manifest.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/run-manifest.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EACV,0BAA0B,EAC1B,oBAAoB,EACpB,YAAY,EACZ,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAIpB;;;;GAIG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D,4EAA4E;AAC5E,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,aAAa,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,QAAQ,CAAC,kBAAkB,CAAC,EAAE,SAAS,0BAA0B,EAAE,CAAC;IACpE,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;IACjE,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,QAAQ,CAAC,YAAY,CAAC,EAAE,YAAY,CAAC;IACrC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,gFAAgF;AAChF,wBAAgB,YAAY,CAAC,KAAK,EAAE,aAAa,GAAG,oBAAoB,CA0BvE;AAED,uEAAuE;AACvE,wBAAgB,aAAa,CAC3B,IAAI,EAAE,oBAAoB,EAC1B,UAAU,EAAE,gBAAgB,EAC5B,WAAW,SAA2B,GACrC,oBAAoB,CAEtB"}

package/dist/composition/probe/run-manifest.js.map

@@ -1 +1 @@
-{"version":3,"file":"run-manifest.js","sourceRoot":"","sources":["../../../src/composition/probe/run-manifest.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAQH,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACxF,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAEzE;;;;GAIG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAc1D,gFAAgF;AAChF,MAAM,UAAU,YAAY,CAAC,KAAoB;IAC/C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,UAAU,CAAC,mDAAmD,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO;QACL,aAAa,EAAE,cAAc;QAC7B,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;QACxC,WAAW,EAAE,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC;QACzC,aAAa,EAAE,KAAK,CAAC,aAAa,IAAI,EAAE;QACxC,kBAAkB,EAAE,KAAK,CAAC,kBAAkB,IAAI;YAC9C;gBACE,eAAe,EAAE,GAAG;gBACpB,SAAS,EAAE,QAAQ;gBACnB,cAAc,EAAE,cAAc;gBAC9B,YAAY,EAAE,CAAC,oBAAoB,CAAC;gBACpC,aAAa,EAAE,KAAK;aACrB;SACF;QACD,WAAW,EAAE,KAAK,CAAC,WAAW,IAAI,EAAE;QACpC,UAAU,EAAE,KAAK,CAAC,UAAU,IAAI,EAAE,WAAW,EAAE,mBAAmB,EAAE;QACpE,WAAW,EAAE,kBAAkB,EAAE;QACjC,YAAY,EAAE,KAAK,CAAC,YAAY,IAAI,qBAAqB;QACzD,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACtD,cAAc,EAAE,EAAE;KACnB,CAAC;AACJ,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,aAAa,CAC3B,IAA0B,EAC1B,UAA4B,EAC5B,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;IAEtC,OAAO,EAAE,GAAG,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;AAC9C,CAAC","sourcesContent":["/**\n * Discovery-run manifest construction (schema v0).\n *\n * @module composition/probe/run-manifest\n */\n\nimport type {\n  DiscoveryBackendDescriptor,\n  DiscoveryRunManifest,\n  SearchBudget,\n  SearchStopReason,\n} from './types.js';\nimport { DEFAULT_HOLDOUT_TOL, DEFAULT_SEARCH_BUDGET, SCHEMA_VERSION } from './types.js';\nimport { captureEnvironment, hashCanonical } from '../canonical-json.js';\n\n/**\n * Capture host environment.\n *\n * @internal\n */\nexport { captureEnvironment } from '../canonical-json.js';\n\nexport interface ManifestDraft {\n  readonly runId: string;\n  readonly repositoryCommit: string;\n  readonly problem: unknown;\n  readonly datasetHashes?: readonly string[];\n  readonly backendDescriptors?: readonly DiscoveryBackendDescriptor[];\n  readonly randomSeeds?: Readonly<Record<string, string | number>>;\n  readonly tolerances?: Readonly<Record<string, number>>;\n  readonly searchBudget?: SearchBudget;\n  readonly startedAt?: string;\n}\n\n/** Open a run manifest (completedAt / stopReason filled at close). @internal */\nexport function openManifest(draft: ManifestDraft): DiscoveryRunManifest {\n  if (!draft.runId.startsWith('dr-')) {\n    throw new RangeError(`openManifest: runId must start with 'dr-' (got '${draft.runId}')`);\n  }\n  return {\n    schemaVersion: SCHEMA_VERSION,\n    runId: draft.runId,\n    repositoryCommit: draft.repositoryCommit,\n    problemHash: hashCanonical(draft.problem),\n    datasetHashes: draft.datasetHashes ?? [],\n    backendDescriptors: draft.backendDescriptors ?? [\n      {\n        protocolVersion: '0',\n        backendId: 'native',\n        backendVersion: SCHEMA_VERSION,\n        capabilities: ['grammar-enumerator'],\n        deterministic: 'yes',\n      },\n    ],\n    randomSeeds: draft.randomSeeds ?? {},\n    tolerances: draft.tolerances ?? { holdoutRmse: DEFAULT_HOLDOUT_TOL },\n    environment: captureEnvironment(),\n    searchBudget: draft.searchBudget ?? DEFAULT_SEARCH_BUDGET,\n    startedAt: draft.startedAt ?? new Date().toISOString(),\n    nondeterminism: [],\n  };\n}\n\n/** Close a manifest with stop reason and completion time. @internal */\nexport function closeManifest(\n  open: DiscoveryRunManifest,\n  stopReason: SearchStopReason,\n  completedAt = new Date().toISOString(),\n): DiscoveryRunManifest {\n  return { ...open, stopReason, completedAt };\n}\n"]}
+{"version":3,"file":"run-manifest.js","sourceRoot":"","sources":["../../../src/composition/probe/run-manifest.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAQH,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACxF,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAEzE;;;;GAIG;AACH,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAe1D,gFAAgF;AAChF,MAAM,UAAU,YAAY,CAAC,KAAoB;IAC/C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,UAAU,CAAC,mDAAmD,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO;QACL,aAAa,EAAE,cAAc;QAC7B,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;QACxC,WAAW,EAAE,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC;QACzC,aAAa,EAAE,KAAK,CAAC,aAAa,IAAI,EAAE;QACxC,kBAAkB,EAAE,KAAK,CAAC,kBAAkB,IAAI;YAC9C;gBACE,eAAe,EAAE,GAAG;gBACpB,SAAS,EAAE,QAAQ;gBACnB,cAAc,EAAE,cAAc;gBAC9B,YAAY,EAAE,CAAC,oBAAoB,CAAC;gBACpC,aAAa,EAAE,KAAK;aACrB;SACF;QACD,WAAW,EAAE,KAAK,CAAC,WAAW,IAAI,EAAE;QACpC,UAAU,EAAE,KAAK,CAAC,UAAU,IAAI,EAAE,WAAW,EAAE,mBAAmB,EAAE;QACpE,WAAW,EAAE,kBAAkB,EAAE;QACjC,YAAY,EAAE,KAAK,CAAC,YAAY,IAAI,qBAAqB;QACzD,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACtD,cAAc,EAAE,EAAE;KACnB,CAAC;AACJ,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,aAAa,CAC3B,IAA0B,EAC1B,UAA4B,EAC5B,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;IAEtC,OAAO,EAAE,GAAG,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;AAC9C,CAAC","sourcesContent":["/**\n * Discovery-run manifest construction (schema v0).\n *\n * @module composition/probe/run-manifest\n */\n\nimport type {\n  DiscoveryBackendDescriptor,\n  DiscoveryRunManifest,\n  SearchBudget,\n  SearchStopReason,\n} from './types.js';\nimport { DEFAULT_HOLDOUT_TOL, DEFAULT_SEARCH_BUDGET, SCHEMA_VERSION } from './types.js';\nimport { captureEnvironment, hashCanonical } from '../canonical-json.js';\n\n/**\n * Capture host environment.\n *\n * @internal\n */\nexport { captureEnvironment } from '../canonical-json.js';\n\n/** The inputs from which openManifest builds one discovery run manifest. */\nexport interface ManifestDraft {\n  readonly runId: string;\n  readonly repositoryCommit: string;\n  readonly problem: unknown;\n  readonly datasetHashes?: readonly string[];\n  readonly backendDescriptors?: readonly DiscoveryBackendDescriptor[];\n  readonly randomSeeds?: Readonly<Record<string, string | number>>;\n  readonly tolerances?: Readonly<Record<string, number>>;\n  readonly searchBudget?: SearchBudget;\n  readonly startedAt?: string;\n}\n\n/** Open a run manifest (completedAt / stopReason filled at close). @internal */\nexport function openManifest(draft: ManifestDraft): DiscoveryRunManifest {\n  if (!draft.runId.startsWith('dr-')) {\n    throw new RangeError(`openManifest: runId must start with 'dr-' (got '${draft.runId}')`);\n  }\n  return {\n    schemaVersion: SCHEMA_VERSION,\n    runId: draft.runId,\n    repositoryCommit: draft.repositoryCommit,\n    problemHash: hashCanonical(draft.problem),\n    datasetHashes: draft.datasetHashes ?? [],\n    backendDescriptors: draft.backendDescriptors ?? [\n      {\n        protocolVersion: '0',\n        backendId: 'native',\n        backendVersion: SCHEMA_VERSION,\n        capabilities: ['grammar-enumerator'],\n        deterministic: 'yes',\n      },\n    ],\n    randomSeeds: draft.randomSeeds ?? {},\n    tolerances: draft.tolerances ?? { holdoutRmse: DEFAULT_HOLDOUT_TOL },\n    environment: captureEnvironment(),\n    searchBudget: draft.searchBudget ?? DEFAULT_SEARCH_BUDGET,\n    startedAt: draft.startedAt ?? new Date().toISOString(),\n    nondeterminism: [],\n  };\n}\n\n/** Close a manifest with stop reason and completion time. @internal */\nexport function closeManifest(\n  open: DiscoveryRunManifest,\n  stopReason: SearchStopReason,\n  completedAt = new Date().toISOString(),\n): DiscoveryRunManifest {\n  return { ...open, stopReason, completedAt };\n}\n"]}

package/dist/composition/probe/scalar-search.d.ts

@@ -0,0 +1,50 @@
+/**
+ * MathTS scalar-search trees as UPT probe candidates (plan task P5).
+ *
+ * `scalarNodeToExpr` converts a MathTS `ScalarNode` to a UPT `ExprNode`.
+ * `dimensionToRational` converts a UPT `Dimension` to the MathTS
+ * `SiDimensionVector` that the search's `dimensions` filter reads.
+ *
+ * @module composition/probe/scalar-search
+ */
+import { type ScalarNode, type ScalarOperator } from '@danielsimonjr/mathts-expression';
+import type { SiDimensionVector } from '@danielsimonjr/mathts-core';
+import type { ExprNode } from '../../dimensional/validator.js';
+import type { Dimension } from '../../dimensional/types.js';
+import type { RawCandidate } from './generator.js';
+import type { SearchProblem } from './types.js';
+/** A MathTS `ScalarNode` as a UPT `ExprNode`; a symbol takes its governing variable's dimension. @throws Error on an unknown symbol or a function with no UPT form. @internal */
+export declare function scalarNodeToExpr(node: ScalarNode, variables: ReadonlyMap<string, Dimension>): ExprNode;
+/** A UPT `Dimension` as a MathTS `SiDimensionVector`, by key in BIPM order `[L, M, T, I, Θ, N, J]`. @throws RangeError on an exponent that does not rationalize. @internal */
+export declare function dimensionToRational(dim: Dimension): SiDimensionVector;
+/** The scalar-search grammar lists a function with no UPT form: a caller error, not an abstention. @internal */
+export declare class UnsupportedScalarFunctionError extends Error {
+    constructor(name: string);
+}
+/** Options of the opt-in MathTS scalar search (plan task P5). @internal */
+export interface ProbeScalarSearchOptions {
+    /** Seed of the MathTS random stream. */
+    readonly seed: number;
+    /** Cap on tree evaluations. */
+    readonly maxEvaluations: number;
+    /** Binary operators of the grammar. */
+    readonly binary: readonly ScalarOperator[];
+    /** Unary functions of the grammar, by MathTS input name. Default none. */
+    readonly unary?: readonly string[];
+    /** Largest tree size. Default 7. */
+    readonly maxSize?: number;
+}
+/** The `originNote` and the backend id of a scalar-search candidate. @internal */
+export declare const SCALAR_SEARCH_ORIGIN = "mathts-scalar-search";
+/**
+ * Runs MathTS `runScalarSearch` over the exploratory rows, structure only (no fitted
+ * parameters), and converts each front tree to a raw probe candidate. A front tree with no
+ * UPT form is skipped and counted in the note.
+ * @throws Error when the grammar lists a function with no UPT form.
+ * @internal
+ */
+export declare function scalarSearchCandidates(problem: SearchProblem, opts: ProbeScalarSearchOptions, budgetMs: number): Promise<{
+    readonly raws: readonly RawCandidate[];
+    readonly note?: string;
+}>;
+//# sourceMappingURL=scalar-search.d.ts.map

package/dist/composition/probe/scalar-search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scalar-search.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/scalar-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAGL,KAAK,UAAU,EACf,KAAK,cAAc,EACpB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,KAAK,EAAY,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAG9E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAE5D,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAgChD,iLAAiL;AACjL,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,UAAU,EAChB,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,GACxC,QAAQ,CAoBV;AAQD,8KAA8K;AAC9K,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,SAAS,GAAG,iBAAiB,CAUrE;AAED,gHAAgH;AAChH,qBAAa,8BAA+B,SAAQ,KAAK;IACvD,YAAY,IAAI,EAAE,MAAM,EAGvB;CACF;AAED,2EAA2E;AAC3E,MAAM,WAAW,wBAAwB;IACvC,wCAAwC;IACxC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,+BAA+B;IAC/B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,uCAAuC;IACvC,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,CAAC;IAC3C,0EAA0E;IAC1E,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,oCAAoC;IACpC,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,kFAAkF;AAClF,eAAO,MAAM,oBAAoB,yBAAyB,CAAC;AA4B3D;;;;;;GAMG;AACH,wBAAsB,sBAAsB,CAC1C,OAAO,EAAE,aAAa,EACtB,IAAI,EAAE,wBAAwB,EAC9B,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,YAAY,EAAE,CAAC;IAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,CAmD7E"}

package/dist/composition/probe/scalar-search.js

@@ -0,0 +1,169 @@
+/**
+ * MathTS scalar-search trees as UPT probe candidates (plan task P5).
+ *
+ * `scalarNodeToExpr` converts a MathTS `ScalarNode` to a UPT `ExprNode`.
+ * `dimensionToRational` converts a UPT `Dimension` to the MathTS
+ * `SiDimensionVector` that the search's `dimensions` filter reads.
+ *
+ * @module composition/probe/scalar-search
+ */
+import { SCALAR_FUNCTION_LOWERING, } from '@danielsimonjr/mathts-expression';
+import { runScalarSearch } from '@danielsimonjr/mathts-functions';
+import { rationalize } from '../rational-exponent.js';
+const ZERO_DIMENSION = { L: 0, M: 0, T: 0, I: 0, Theta: 0, N: 0, J: 0 };
+const UPT_TRANSCENDENTAL_NAMES = new Set([
+    'exp', 'ln', 'log2', 'log10', 'sin', 'cos', 'tan', 'sinh', 'cosh', 'tanh',
+]);
+function isTranscendentalFn(name) {
+    return UPT_TRANSCENDENTAL_NAMES.has(name);
+}
+/**
+ * The inverse of MathTS `SCALAR_FUNCTION_LOWERING`, restricted to the UPT
+ * transcendental names. The table is not one-to-one (`log` and `log10` both
+ * lower to `log10`), so an input name equal to its lowered name wins.
+ */
+const TRANSCENDENTAL_BY_LOWERED = (() => {
+    const inverse = new Map();
+    for (const [inputName, loweredName] of Object.entries(SCALAR_FUNCTION_LOWERING)) {
+        if (!isTranscendentalFn(inputName))
+            continue;
+        if (!inverse.has(loweredName) || inputName === loweredName)
+            inverse.set(loweredName, inputName);
+    }
+    return inverse;
+})();
+function literal(name) {
+    return { kind: 'symbol', name, dim: ZERO_DIMENSION };
+}
+/** A MathTS `ScalarNode` as a UPT `ExprNode`; a symbol takes its governing variable's dimension. @throws Error on an unknown symbol or a function with no UPT form. @internal */
+export function scalarNodeToExpr(node, variables) {
+    switch (node.kind) {
+        case 'number':
+            return literal(String(node.value));
+        case 'symbol': {
+            const dim = variables.get(node.name);
+            if (dim === undefined)
+                throw new Error(`scalar search: unknown symbol '${node.name}'`);
+            return { kind: 'symbol', name: node.name, dim };
+        }
+        case 'op':
+            return { kind: 'op', op: node.op, args: node.args.map((a) => scalarNodeToExpr(a, variables)) };
+        case 'call': {
+            const arg = scalarNodeToExpr(node.arg, variables);
+            if (node.fn === 'abs')
+                return { kind: 'abs', arg };
+            if (node.fn === 'sqrt')
+                return { kind: 'op', op: '^', args: [arg, literal('0.5')] };
+            const fn = TRANSCENDENTAL_BY_LOWERED.get(node.fn);
+            if (fn === undefined)
+                throw new Error(`scalar search: function '${node.fn}' has no UPT form`);
+            return { kind: 'transcendental', fn, arg };
+        }
+    }
+}
+function rationalAxis(axis, value) {
+    const f = rationalize(value);
+    if (f === undefined)
+        throw new RangeError(`scalar search: dimension ${axis} = ${value} is not rational`);
+    return f;
+}
+/** A UPT `Dimension` as a MathTS `SiDimensionVector`, by key in BIPM order `[L, M, T, I, Θ, N, J]`. @throws RangeError on an exponent that does not rationalize. @internal */
+export function dimensionToRational(dim) {
+    return [
+        rationalAxis('L', dim.L),
+        rationalAxis('M', dim.M),
+        rationalAxis('T', dim.T),
+        rationalAxis('I', dim.I),
+        rationalAxis('Theta', dim.Theta),
+        rationalAxis('N', dim.N),
+        rationalAxis('J', dim.J),
+    ];
+}
+/** The scalar-search grammar lists a function with no UPT form: a caller error, not an abstention. @internal */
+export class UnsupportedScalarFunctionError extends Error {
+    constructor(name) {
+        super(`scalar search: function '${name}' has no UPT form`);
+        this.name = 'UnsupportedScalarFunctionError';
+    }
+}
+/** The `originNote` and the backend id of a scalar-search candidate. @internal */
+export const SCALAR_SEARCH_ORIGIN = 'mathts-scalar-search';
+/** MathTS input names whose lowered form has a UPT form, read from the same table the converter reads. */
+const UNARY_WITH_UPT_FORM = new Set(Object.entries(SCALAR_FUNCTION_LOWERING)
+    .filter(([, lowered]) => TRANSCENDENTAL_BY_LOWERED.has(lowered) || lowered === 'abs' || lowered === 'sqrt')
+    .map(([input]) => input));
+function isLoweringKey(name) {
+    return Object.prototype.hasOwnProperty.call(SCALAR_FUNCTION_LOWERING, name);
+}
+function loweredName(name) {
+    if (!isLoweringKey(name))
+        throw new Error(`scalar search: unknown function '${name}'`);
+    return SCALAR_FUNCTION_LOWERING[name];
+}
+function column(rows, name) {
+    return Float64Array.from(rows, (row) => {
+        const v = row[name];
+        if (v === undefined)
+            throw new RangeError(`scalar search: a row has no '${name}'`);
+        return v;
+    });
+}
+/**
+ * Runs MathTS `runScalarSearch` over the exploratory rows, structure only (no fitted
+ * parameters), and converts each front tree to a raw probe candidate. A front tree with no
+ * UPT form is skipped and counted in the note.
+ * @throws Error when the grammar lists a function with no UPT form.
+ * @internal
+ */
+export async function scalarSearchCandidates(problem, opts, budgetMs) {
+    const unary = opts.unary ?? [];
+    for (const name of unary) {
+        if (!UNARY_WITH_UPT_FORM.has(name))
+            throw new UnsupportedScalarFunctionError(name);
+    }
+    const data = problem.exploratory;
+    if (data === undefined || data.rows.length === 0) {
+        return { raws: [], note: 'scalar search did not run: no exploratory data' };
+    }
+    const rows = data.rows;
+    const names = problem.governing.map((g) => g.name);
+    const columns = {};
+    for (const name of names)
+        columns[name] = column(rows, name);
+    const symbols = {};
+    for (const g of problem.governing)
+        symbols[g.name] = dimensionToRational(g.dim);
+    const grammar = {
+        variables: names,
+        parameters: [],
+        binary: opts.binary,
+        unary: unary.map(loweredName),
+        maxSize: opts.maxSize ?? 7,
+    };
+    const result = await runScalarSearch({ variables: names, columns, observed: column(rows, data.observable), parameters: [] }, {
+        seed: opts.seed,
+        grammar,
+        maxEvaluations: opts.maxEvaluations,
+        signal: AbortSignal.timeout(Math.max(1, Math.floor(budgetMs))),
+        dimensions: { symbols, target: dimensionToRational(problem.target.dim) },
+    });
+    const variables = new Map(problem.governing.map((g) => [g.name, g.dim]));
+    const raws = [];
+    let skipped = 0;
+    for (const entry of result.front) {
+        try {
+            raws.push({ expression: scalarNodeToExpr(entry.item, variables), monomial: null, originNote: SCALAR_SEARCH_ORIGIN });
+        }
+        catch {
+            skipped += 1;
+        }
+    }
+    const notes = [];
+    if (result.stopReason !== 'max-evaluations') {
+        notes.push(`scalar search stopped: ${result.stopReason} after ${result.evaluations} evaluation(s)`);
+    }
+    if (skipped > 0)
+        notes.push(`scalar search: ${skipped} front tree(s) had no UPT form`);
+    return notes.length > 0 ? { raws, note: notes.join('; ') } : { raws };
+}
+//# sourceMappingURL=scalar-search.js.map

package/dist/composition/probe/scalar-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scalar-search.js","sourceRoot":"","sources":["../../../src/composition/probe/scalar-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EACL,wBAAwB,GAIzB,MAAM,kCAAkC,CAAC;AAE1C,OAAO,EAAE,eAAe,EAAE,MAAM,iCAAiC,CAAC;AAIlE,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAMtD,MAAM,cAAc,GAAc,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AAEnF,MAAM,wBAAwB,GAAwB,IAAI,GAAG,CAAC;IAC5D,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAC1E,CAAC,CAAC;AAEH,SAAS,kBAAkB,CAAC,IAAY;IACtC,OAAO,wBAAwB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,MAAM,yBAAyB,GAA0C,CAAC,GAAG,EAAE;IAC7E,MAAM,OAAO,GAAG,IAAI,GAAG,EAA4B,CAAC;IACpD,KAAK,MAAM,CAAC,SAAS,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,wBAAwB,CAAC,EAAE,CAAC;QAChF,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC;YAAE,SAAS;QAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,SAAS,KAAK,WAAW;YAAE,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAClG,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC,EAAE,CAAC;AAEL,SAAS,OAAO,CAAC,IAAY;IAC3B,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,cAAc,EAAE,CAAC;AACvD,CAAC;AAED,iLAAiL;AACjL,MAAM,UAAU,gBAAgB,CAC9B,IAAgB,EAChB,SAAyC;IAEzC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACrC,KAAK,QAAQ,EAAE,CAAC;YACd,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,GAAG,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACvF,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC;QAClD,CAAC;QACD,KAAK,IAAI;YACP,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC;QACjG,KAAK,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,GAAG,gBAAgB,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;YAClD,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;YACnD,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM;gBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACpF,MAAM,EAAE,GAAG,yBAAyB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClD,IAAI,EAAE,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;YAC9F,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;QAC7C,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,IAAY,EAAE,KAAa;IAC/C,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IAC7B,IAAI,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,UAAU,CAAC,4BAA4B,IAAI,MAAM,KAAK,kBAAkB,CAAC,CAAC;IACzG,OAAO,CAAC,CAAC;AACX,CAAC;AAED,8KAA8K;AAC9K,MAAM,UAAU,mBAAmB,CAAC,GAAc;IAChD,OAAO;QACL,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,YAAY,CAAC,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC;QAChC,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;KACzB,CAAC;AACJ,CAAC;AAED,gHAAgH;AAChH,MAAM,OAAO,8BAA+B,SAAQ,KAAK;IACvD,YAAY,IAAY;QACtB,KAAK,CAAC,4BAA4B,IAAI,mBAAmB,CAAC,CAAC;QAC3D,IAAI,CAAC,IAAI,GAAG,gCAAgC,CAAC;IAC/C,CAAC;CACF;AAgBD,kFAAkF;AAClF,MAAM,CAAC,MAAM,oBAAoB,GAAG,sBAAsB,CAAC;AAE3D,0GAA0G;AAC1G,MAAM,mBAAmB,GAAwB,IAAI,GAAG,CACtD,MAAM,CAAC,OAAO,CAAC,wBAAwB,CAAC;KACrC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,yBAAyB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,MAAM,CAAC;KAC1G,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAC3B,CAAC;AAIF,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC;AAC9E,CAAC;AAED,SAAS,WAAW,CAAC,IAAY;IAC/B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,IAAI,GAAG,CAAC,CAAC;IACvF,OAAO,wBAAwB,CAAC,IAAI,CAAC,CAAC;AACxC,CAAC;AAED,SAAS,MAAM,CAAC,IAAiD,EAAE,IAAY;IAC7E,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE;QACrC,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QACpB,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM,IAAI,UAAU,CAAC,gCAAgC,IAAI,GAAG,CAAC,CAAC;QACnF,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,OAAsB,EACtB,IAA8B,EAC9B,QAAgB;IAEhB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,8BAA8B,CAAC,IAAI,CAAC,CAAC;IACrF,CAAC;IACD,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,CAAC;IACjC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjD,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,gDAAgD,EAAE,CAAC;IAC9E,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAEvB,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnD,MAAM,OAAO,GAAiC,EAAE,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7D,MAAM,OAAO,GAAsC,EAAE,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,SAAS;QAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChF,MAAM,OAAO,GAAkB;QAC7B,SAAS,EAAE,KAAK;QAChB,UAAU,EAAE,EAAE;QACd,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC;QAC7B,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,CAAC;KAC3B,CAAC;IAEF,MAAM,MAAM,GAAG,MAAM,eAAe,CAClC,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,EACtF;QACE,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,OAAO;QACP,cAAc,EAAE,IAAI,CAAC,cAAc;QACnC,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC9D,UAAU,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,mBAAmB,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;KACzE,CACF,CAAC;IAEF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzE,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QACjC,IAAI,CAAC;YACH,IAAI,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,gBAAgB,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,oBAAoB,EAAE,CAAC,CAAC;QACvH,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,MAAM,CAAC,UAAU,KAAK,iBAAiB,EAAE,CAAC;QAC5C,KAAK,CAAC,IAAI,CAAC,0BAA0B,MAAM,CAAC,UAAU,UAAU,MAAM,CAAC,WAAW,gBAAgB,CAAC,CAAC;IACtG,CAAC;IACD,IAAI,OAAO,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,kBAAkB,OAAO,gCAAgC,CAAC,CAAC;IACvF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;AACxE,CAAC","sourcesContent":["/**\n * MathTS scalar-search trees as UPT probe candidates (plan task P5).\n *\n * `scalarNodeToExpr` converts a MathTS `ScalarNode` to a UPT `ExprNode`.\n * `dimensionToRational` converts a UPT `Dimension` to the MathTS\n * `SiDimensionVector` that the search's `dimensions` filter reads.\n *\n * @module composition/probe/scalar-search\n */\n\nimport {\n  SCALAR_FUNCTION_LOWERING,\n  type ScalarGrammar,\n  type ScalarNode,\n  type ScalarOperator,\n} from '@danielsimonjr/mathts-expression';\nimport type { Fraction, SiDimensionVector } from '@danielsimonjr/mathts-core';\nimport { runScalarSearch } from '@danielsimonjr/mathts-functions';\n\nimport type { ExprNode } from '../../dimensional/validator.js';\nimport type { Dimension } from '../../dimensional/types.js';\nimport { rationalize } from '../rational-exponent.js';\nimport type { RawCandidate } from './generator.js';\nimport type { SearchProblem } from './types.js';\n\ntype TranscendentalFn = Extract<ExprNode, { kind: 'transcendental' }>['fn'];\n\nconst ZERO_DIMENSION: Dimension = { L: 0, M: 0, T: 0, I: 0, Theta: 0, N: 0, J: 0 };\n\nconst UPT_TRANSCENDENTAL_NAMES: ReadonlySet<string> = new Set([\n  'exp', 'ln', 'log2', 'log10', 'sin', 'cos', 'tan', 'sinh', 'cosh', 'tanh',\n]);\n\nfunction isTranscendentalFn(name: string): name is TranscendentalFn {\n  return UPT_TRANSCENDENTAL_NAMES.has(name);\n}\n\n/**\n * The inverse of MathTS `SCALAR_FUNCTION_LOWERING`, restricted to the UPT\n * transcendental names. The table is not one-to-one (`log` and `log10` both\n * lower to `log10`), so an input name equal to its lowered name wins.\n */\nconst TRANSCENDENTAL_BY_LOWERED: ReadonlyMap<string, TranscendentalFn> = (() => {\n  const inverse = new Map<string, TranscendentalFn>();\n  for (const [inputName, loweredName] of Object.entries(SCALAR_FUNCTION_LOWERING)) {\n    if (!isTranscendentalFn(inputName)) continue;\n    if (!inverse.has(loweredName) || inputName === loweredName) inverse.set(loweredName, inputName);\n  }\n  return inverse;\n})();\n\nfunction literal(name: string): ExprNode {\n  return { kind: 'symbol', name, dim: ZERO_DIMENSION };\n}\n\n/** A MathTS `ScalarNode` as a UPT `ExprNode`; a symbol takes its governing variable's dimension. @throws Error on an unknown symbol or a function with no UPT form. @internal */\nexport function scalarNodeToExpr(\n  node: ScalarNode,\n  variables: ReadonlyMap<string, Dimension>,\n): ExprNode {\n  switch (node.kind) {\n    case 'number':\n      return literal(String(node.value));\n    case 'symbol': {\n      const dim = variables.get(node.name);\n      if (dim === undefined) throw new Error(`scalar search: unknown symbol '${node.name}'`);\n      return { kind: 'symbol', name: node.name, dim };\n    }\n    case 'op':\n      return { kind: 'op', op: node.op, args: node.args.map((a) => scalarNodeToExpr(a, variables)) };\n    case 'call': {\n      const arg = scalarNodeToExpr(node.arg, variables);\n      if (node.fn === 'abs') return { kind: 'abs', arg };\n      if (node.fn === 'sqrt') return { kind: 'op', op: '^', args: [arg, literal('0.5')] };\n      const fn = TRANSCENDENTAL_BY_LOWERED.get(node.fn);\n      if (fn === undefined) throw new Error(`scalar search: function '${node.fn}' has no UPT form`);\n      return { kind: 'transcendental', fn, arg };\n    }\n  }\n}\n\nfunction rationalAxis(axis: string, value: number): Fraction {\n  const f = rationalize(value);\n  if (f === undefined) throw new RangeError(`scalar search: dimension ${axis} = ${value} is not rational`);\n  return f;\n}\n\n/** A UPT `Dimension` as a MathTS `SiDimensionVector`, by key in BIPM order `[L, M, T, I, Θ, N, J]`. @throws RangeError on an exponent that does not rationalize. @internal */\nexport function dimensionToRational(dim: Dimension): SiDimensionVector {\n  return [\n    rationalAxis('L', dim.L),\n    rationalAxis('M', dim.M),\n    rationalAxis('T', dim.T),\n    rationalAxis('I', dim.I),\n    rationalAxis('Theta', dim.Theta),\n    rationalAxis('N', dim.N),\n    rationalAxis('J', dim.J),\n  ];\n}\n\n/** The scalar-search grammar lists a function with no UPT form: a caller error, not an abstention. @internal */\nexport class UnsupportedScalarFunctionError extends Error {\n  constructor(name: string) {\n    super(`scalar search: function '${name}' has no UPT form`);\n    this.name = 'UnsupportedScalarFunctionError';\n  }\n}\n\n/** Options of the opt-in MathTS scalar search (plan task P5). @internal */\nexport interface ProbeScalarSearchOptions {\n  /** Seed of the MathTS random stream. */\n  readonly seed: number;\n  /** Cap on tree evaluations. */\n  readonly maxEvaluations: number;\n  /** Binary operators of the grammar. */\n  readonly binary: readonly ScalarOperator[];\n  /** Unary functions of the grammar, by MathTS input name. Default none. */\n  readonly unary?: readonly string[];\n  /** Largest tree size. Default 7. */\n  readonly maxSize?: number;\n}\n\n/** The `originNote` and the backend id of a scalar-search candidate. @internal */\nexport const SCALAR_SEARCH_ORIGIN = 'mathts-scalar-search';\n\n/** MathTS input names whose lowered form has a UPT form, read from the same table the converter reads. */\nconst UNARY_WITH_UPT_FORM: ReadonlySet<string> = new Set(\n  Object.entries(SCALAR_FUNCTION_LOWERING)\n    .filter(([, lowered]) => TRANSCENDENTAL_BY_LOWERED.has(lowered) || lowered === 'abs' || lowered === 'sqrt')\n    .map(([input]) => input),\n);\n\ntype LoweredFn = (typeof SCALAR_FUNCTION_LOWERING)[keyof typeof SCALAR_FUNCTION_LOWERING];\n\nfunction isLoweringKey(name: string): name is keyof typeof SCALAR_FUNCTION_LOWERING {\n  return Object.prototype.hasOwnProperty.call(SCALAR_FUNCTION_LOWERING, name);\n}\n\nfunction loweredName(name: string): LoweredFn {\n  if (!isLoweringKey(name)) throw new Error(`scalar search: unknown function '${name}'`);\n  return SCALAR_FUNCTION_LOWERING[name];\n}\n\nfunction column(rows: readonly Readonly<Record<string, number>>[], name: string): Float64Array {\n  return Float64Array.from(rows, (row) => {\n    const v = row[name];\n    if (v === undefined) throw new RangeError(`scalar search: a row has no '${name}'`);\n    return v;\n  });\n}\n\n/**\n * Runs MathTS `runScalarSearch` over the exploratory rows, structure only (no fitted\n * parameters), and converts each front tree to a raw probe candidate. A front tree with no\n * UPT form is skipped and counted in the note.\n * @throws Error when the grammar lists a function with no UPT form.\n * @internal\n */\nexport async function scalarSearchCandidates(\n  problem: SearchProblem,\n  opts: ProbeScalarSearchOptions,\n  budgetMs: number,\n): Promise<{ readonly raws: readonly RawCandidate[]; readonly note?: string }> {\n  const unary = opts.unary ?? [];\n  for (const name of unary) {\n    if (!UNARY_WITH_UPT_FORM.has(name)) throw new UnsupportedScalarFunctionError(name);\n  }\n  const data = problem.exploratory;\n  if (data === undefined || data.rows.length === 0) {\n    return { raws: [], note: 'scalar search did not run: no exploratory data' };\n  }\n  const rows = data.rows;\n\n  const names = problem.governing.map((g) => g.name);\n  const columns: Record<string, Float64Array> = {};\n  for (const name of names) columns[name] = column(rows, name);\n  const symbols: Record<string, SiDimensionVector> = {};\n  for (const g of problem.governing) symbols[g.name] = dimensionToRational(g.dim);\n  const grammar: ScalarGrammar = {\n    variables: names,\n    parameters: [],\n    binary: opts.binary,\n    unary: unary.map(loweredName),\n    maxSize: opts.maxSize ?? 7,\n  };\n\n  const result = await runScalarSearch(\n    { variables: names, columns, observed: column(rows, data.observable), parameters: [] },\n    {\n      seed: opts.seed,\n      grammar,\n      maxEvaluations: opts.maxEvaluations,\n      signal: AbortSignal.timeout(Math.max(1, Math.floor(budgetMs))),\n      dimensions: { symbols, target: dimensionToRational(problem.target.dim) },\n    },\n  );\n\n  const variables = new Map(problem.governing.map((g) => [g.name, g.dim]));\n  const raws: RawCandidate[] = [];\n  let skipped = 0;\n  for (const entry of result.front) {\n    try {\n      raws.push({ expression: scalarNodeToExpr(entry.item, variables), monomial: null, originNote: SCALAR_SEARCH_ORIGIN });\n    } catch {\n      skipped += 1;\n    }\n  }\n  const notes: string[] = [];\n  if (result.stopReason !== 'max-evaluations') {\n    notes.push(`scalar search stopped: ${result.stopReason} after ${result.evaluations} evaluation(s)`);\n  }\n  if (skipped > 0) notes.push(`scalar search: ${skipped} front tree(s) had no UPT form`);\n  return notes.length > 0 ? { raws, note: notes.join('; ') } : { raws };\n}\n"]}

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

@@ -7,6 +7,7 @@ import type { ProbeCandidateRecord, ScoreVector } from './types.js';
 import type { FalsifyResult } from './falsify.js';
 /** Build a score vector. @internal */
 export declare function scoreCandidate(record: ProbeCandidateRecord, empirical?: number, corpusDistance?: number, falsification?: FalsifyResult): ScoreVector;
+/** One probe candidate with its scores and whether it is on the Pareto front. */
 export interface RankedCandidate {
     readonly record: ProbeCandidateRecord;
     readonly scores: ScoreVector;

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

@@ -1 +1 @@
-{"version":3,"file":"scoring.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/scoring.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACpE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AA2BlD,sCAAsC;AACtC,wBAAgB,cAAc,CAC5B,MAAM,EAAE,oBAAoB,EAC5B,SAAS,SAAI,EACb,cAAc,SAAI,EAClB,aAAa,CAAC,EAAE,aAAa,GAC5B,WAAW,CAWb;AAkBD,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IACtC,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;CAC1B;AAED,0EAA0E;AAC1E,wBAAgB,UAAU,CACxB,KAAK,EAAE,SAAS;IAAE,MAAM,EAAE,oBAAoB,CAAC;IAAC,MAAM,EAAE,WAAW,CAAA;CAAE,EAAE,GACtE,eAAe,EAAE,CASnB"}
+{"version":3,"file":"scoring.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/scoring.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACpE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AA2BlD,sCAAsC;AACtC,wBAAgB,cAAc,CAC5B,MAAM,EAAE,oBAAoB,EAC5B,SAAS,SAAI,EACb,cAAc,SAAI,EAClB,aAAa,CAAC,EAAE,aAAa,GAC5B,WAAW,CAWb;AAkBD,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,MAAM,EAAE,oBAAoB,CAAC;IACtC,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;CAC1B;AAED,0EAA0E;AAC1E,wBAAgB,UAAU,CACxB,KAAK,EAAE,SAAS;IAAE,MAAM,EAAE,oBAAoB,CAAC;IAAC,MAAM,EAAE,WAAW,CAAA;CAAE,EAAE,GACtE,eAAe,EAAE,CASnB"}

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

@@ -1 +1 @@
-{"version":3,"file":"scoring.js","sourceRoot":"","sources":["../../../src/composition/probe/scoring.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,SAAS,OAAO,CAAC,CAAS;IACxB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,MAA4B,EAAE,aAAwC;IAC1F,IAAI,aAAa,KAAK,SAAS,IAAI,aAAa,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpE,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC;QAChF,OAAO,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC;IAC/C,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,KAAK,mBAAmB;QAC1C,MAAM,CAAC,MAAM,KAAK,wBAAwB;QAC1C,MAAM,CAAC,MAAM,KAAK,wBAAwB;QAC1C,CAAC,CAAC,GAAG;QACL,CAAC,CAAC,GAAG,CAAC;AACV,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,cAAc,CAC5B,MAA4B,EAC5B,SAAS,GAAG,CAAC,EACb,cAAc,GAAG,CAAC,EAClB,aAA6B;IAE7B,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC,oBAAoB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACvD,OAAO;QACL,QAAQ;QACR,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC;QAC7B,SAAS;QACT,cAAc,EAAE,OAAO,CAAC,cAAc,CAAC;QACvC,UAAU;KACX,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,CAAc,EAAE,CAAc;IAC/C,MAAM,IAAI,GAA0B;QAClC,UAAU;QACV,WAAW;QACX,WAAW;QACX,gBAAgB;QAChB,YAAY;KACb,CAAC;IACF,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;YAAE,OAAO,KAAK,CAAC;QACtC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;YAAE,MAAM,GAAG,IAAI,CAAC;IACzC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAQD,0EAA0E;AAC1E,MAAM,UAAU,UAAU,CACxB,KAAuE;IAEvE,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACZ,GAAG,EAAE;QACL,MAAM,EAAE,CAAC,KAAK,CAAC,IAAI,CACjB,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAClF;KACF,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AACnG,CAAC","sourcesContent":["/**\n * Pareto scoring for probe candidates. Does not touch `VettedCandidate.score`.\n *\n * @module composition/probe/scoring\n */\n\nimport type { ProbeCandidateRecord, ScoreVector } from './types.js';\nimport type { FalsifyResult } from './falsify.js';\n\nfunction clamp01(x: number): number {\n  if (!Number.isFinite(x)) return 0;\n  return Math.min(1, Math.max(0, x));\n}\n\n/**\n * Robustness is what the falsification batteries recorded: the fraction of\n * the batteries that ran and passed (an `inconclusive` battery did not pass).\n * It is not read from the status label: a survivor awaiting expert review\n * was once scored 1 by its label alone, while two of the five listed\n * batteries could never fail (9.0.0 audit §4 Low). Without a falsification\n * record only the holdout stage is known: 0.7 past the holdout, 0.2 before.\n */\nfunction robustnessOf(record: ProbeCandidateRecord, falsification: FalsifyResult | undefined): number {\n  if (falsification !== undefined && falsification.records.length > 0) {\n    const passed = falsification.records.filter((r) => r.outcome === 'pass').length;\n    return passed / falsification.records.length;\n  }\n  return record.status === 'heldout-supported' ||\n    record.status === 'falsification-survivor' ||\n    record.status === 'expert-review-required'\n    ? 0.7\n    : 0.2;\n}\n\n/** Build a score vector. @internal */\nexport function scoreCandidate(\n  record: ProbeCandidateRecord,\n  empirical = 0,\n  corpusDistance = 1,\n  falsification?: FalsifyResult,\n): ScoreVector {\n  const parsimony = clamp01(1 / (1 + record.complexity.astNodes / 8));\n  const validity = record.fingerprint.dimensionalSignature === 'invalid' ? 0 : 1;\n  const robustness = robustnessOf(record, falsification);\n  return {\n    validity,\n    empirical: clamp01(empirical),\n    parsimony,\n    corpusDistance: clamp01(corpusDistance),\n    robustness,\n  };\n}\n\nfunction dominates(a: ScoreVector, b: ScoreVector): boolean {\n  const keys: (keyof ScoreVector)[] = [\n    'validity',\n    'empirical',\n    'parsimony',\n    'corpusDistance',\n    'robustness',\n  ];\n  let better = false;\n  for (const k of keys) {\n    if (a[k] < b[k] - 1e-12) return false;\n    if (a[k] > b[k] + 1e-12) better = true;\n  }\n  return better;\n}\n\nexport interface RankedCandidate {\n  readonly record: ProbeCandidateRecord;\n  readonly scores: ScoreVector;\n  readonly pareto: boolean;\n}\n\n/** Pareto front (non-dominated) plus the rest, stable by id. @internal */\nexport function rankPareto(\n  items: readonly { record: ProbeCandidateRecord; scores: ScoreVector }[],\n): RankedCandidate[] {\n  return items\n    .map((it) => ({\n      ...it,\n      pareto: !items.some(\n        (other) => other.record.id !== it.record.id && dominates(other.scores, it.scores),\n      ),\n    }))\n    .sort((a, b) => Number(b.pareto) - Number(a.pareto) || a.record.id.localeCompare(b.record.id));\n}\n"]}
+{"version":3,"file":"scoring.js","sourceRoot":"","sources":["../../../src/composition/probe/scoring.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,SAAS,OAAO,CAAC,CAAS;IACxB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,MAA4B,EAAE,aAAwC;IAC1F,IAAI,aAAa,KAAK,SAAS,IAAI,aAAa,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpE,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC;QAChF,OAAO,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC;IAC/C,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,KAAK,mBAAmB;QAC1C,MAAM,CAAC,MAAM,KAAK,wBAAwB;QAC1C,MAAM,CAAC,MAAM,KAAK,wBAAwB;QAC1C,CAAC,CAAC,GAAG;QACL,CAAC,CAAC,GAAG,CAAC;AACV,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,cAAc,CAC5B,MAA4B,EAC5B,SAAS,GAAG,CAAC,EACb,cAAc,GAAG,CAAC,EAClB,aAA6B;IAE7B,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC,oBAAoB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACvD,OAAO;QACL,QAAQ;QACR,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC;QAC7B,SAAS;QACT,cAAc,EAAE,OAAO,CAAC,cAAc,CAAC;QACvC,UAAU;KACX,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,CAAc,EAAE,CAAc;IAC/C,MAAM,IAAI,GAA0B;QAClC,UAAU;QACV,WAAW;QACX,WAAW;QACX,gBAAgB;QAChB,YAAY;KACb,CAAC;IACF,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;YAAE,OAAO,KAAK,CAAC;QACtC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;YAAE,MAAM,GAAG,IAAI,CAAC;IACzC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AASD,0EAA0E;AAC1E,MAAM,UAAU,UAAU,CACxB,KAAuE;IAEvE,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACZ,GAAG,EAAE;QACL,MAAM,EAAE,CAAC,KAAK,CAAC,IAAI,CACjB,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAClF;KACF,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AACnG,CAAC","sourcesContent":["/**\n * Pareto scoring for probe candidates. Does not touch `VettedCandidate.score`.\n *\n * @module composition/probe/scoring\n */\n\nimport type { ProbeCandidateRecord, ScoreVector } from './types.js';\nimport type { FalsifyResult } from './falsify.js';\n\nfunction clamp01(x: number): number {\n  if (!Number.isFinite(x)) return 0;\n  return Math.min(1, Math.max(0, x));\n}\n\n/**\n * Robustness is what the falsification batteries recorded: the fraction of\n * the batteries that ran and passed (an `inconclusive` battery did not pass).\n * It is not read from the status label: a survivor awaiting expert review\n * was once scored 1 by its label alone, while two of the five listed\n * batteries could never fail (9.0.0 audit §4 Low). Without a falsification\n * record only the holdout stage is known: 0.7 past the holdout, 0.2 before.\n */\nfunction robustnessOf(record: ProbeCandidateRecord, falsification: FalsifyResult | undefined): number {\n  if (falsification !== undefined && falsification.records.length > 0) {\n    const passed = falsification.records.filter((r) => r.outcome === 'pass').length;\n    return passed / falsification.records.length;\n  }\n  return record.status === 'heldout-supported' ||\n    record.status === 'falsification-survivor' ||\n    record.status === 'expert-review-required'\n    ? 0.7\n    : 0.2;\n}\n\n/** Build a score vector. @internal */\nexport function scoreCandidate(\n  record: ProbeCandidateRecord,\n  empirical = 0,\n  corpusDistance = 1,\n  falsification?: FalsifyResult,\n): ScoreVector {\n  const parsimony = clamp01(1 / (1 + record.complexity.astNodes / 8));\n  const validity = record.fingerprint.dimensionalSignature === 'invalid' ? 0 : 1;\n  const robustness = robustnessOf(record, falsification);\n  return {\n    validity,\n    empirical: clamp01(empirical),\n    parsimony,\n    corpusDistance: clamp01(corpusDistance),\n    robustness,\n  };\n}\n\nfunction dominates(a: ScoreVector, b: ScoreVector): boolean {\n  const keys: (keyof ScoreVector)[] = [\n    'validity',\n    'empirical',\n    'parsimony',\n    'corpusDistance',\n    'robustness',\n  ];\n  let better = false;\n  for (const k of keys) {\n    if (a[k] < b[k] - 1e-12) return false;\n    if (a[k] > b[k] + 1e-12) better = true;\n  }\n  return better;\n}\n\n/** One probe candidate with its scores and whether it is on the Pareto front. */\nexport interface RankedCandidate {\n  readonly record: ProbeCandidateRecord;\n  readonly scores: ScoreVector;\n  readonly pareto: boolean;\n}\n\n/** Pareto front (non-dominated) plus the rest, stable by id. @internal */\nexport function rankPareto(\n  items: readonly { record: ProbeCandidateRecord; scores: ScoreVector }[],\n): RankedCandidate[] {\n  return items\n    .map((it) => ({\n      ...it,\n      pareto: !items.some(\n        (other) => other.record.id !== it.record.id && dominates(other.scores, it.scores),\n      ),\n    }))\n    .sort((a, b) => Number(b.pareto) - Number(a.pareto) || a.record.id.localeCompare(b.record.id));\n}\n"]}

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

@@ -1,51 +1,116 @@
 /**
- * Cheap structure probes: regime changepoint, scale symmetry, conserved dQ/dt.
+ * Cheap structure probes as TESTS: a regime changepoint, a scale symmetry, a
+ * conserved dQ/dt. Each verdict is scale-free: the same series scaled by 1e6
+ * or by 1e-6 gets the same answer, because every threshold is in units of
+ * the series' own scatter, never in the units of y.
  *
  * Task-0 style: recover a synthetic signal or honestly abstain. Never flips
  * `axes.ts` `gated`.
  *
  * @internal
  */
+/** A series sampled at `x` with values `y`, scanned for a step in its mean. @internal */
 export interface ChangepointInput {
     readonly x: readonly number[];
     readonly y: readonly number[];
+    /** Significance level of the permutation test; default 0.01. */
+    readonly alpha?: number;
+    /** Permutation resamples of the null; default 999. */
+    readonly resamples?: number;
+    /** Seed of the permutation null (MathTS `permutationTest`); default 20261015, never the clock. */
+    readonly seed?: number;
 }
+/** The best split of {@link detectMeanChangepoint}, its tests, or an abstention with its reason. @internal */
 export interface ChangepointResult {
+    /** The split index (the right segment starts here) when the step is significant; null otherwise. */
     readonly index: number | null;
+    /** |Welch t| at the best split: the step in units of its own standard error (scale-free). */
     readonly score: number;
+    /** μ_right − μ_left at the best split, in the units of y; null when nothing was scanned. */
+    readonly meanDifference: number | null;
+    /** MathTS `studentTTest` at the best split: the Welch t and its degrees of freedom. */
+    readonly tStatistic: number | null;
+    readonly degreesOfFreedom: number | null;
+    /**
+     * The direct two-sided Welch p at the best split (one split, as if chosen in advance; not
+     * corrected for the scan over splits, which is what `pPermutation` is for).
+     */
+    readonly pWelch: number | null;
+    /** P(max over splits of |t| ≥ observed) under a seeded permutation of the series. */
+    readonly pPermutation: number | null;
     readonly abstained: boolean;
     readonly reason?: string;
 }
 /**
- * Two-mean changepoint: scan split index maximizing |μ_left − μ_right|.
- * Abstains on short series or when the best split is weaker than `minScore`.
+ * Two-mean changepoint as a test. The best split maximises Welch's t over
+ * the splits that leave at least two samples on each side; MathTS
+ * `studentTTest` gives the t, the degrees of freedom and the direct p at that
+ * split. Because the split was CHOSEN by the scan, that p is not the test:
+ * the verdict is the seeded permutation null (MathTS `permutationTest`) of
+ * the maximum over splits, flagged when `pPermutation < alpha` (default
+ * 0.01). Every quantity is in units of the series' scatter, so a series and
+ * its copy scaled by any factor get one verdict. Abstains below six samples.
  *
  * @internal
  */
-export declare function detectMeanChangepoint(input: ChangepointInput, minScore?: number): ChangepointResult;
+export declare function detectMeanChangepoint(input: ChangepointInput): ChangepointResult;
+/** Positive samples `(x, y)` whose log-log slope is the scale exponent. @internal */
 export interface ScaleSymmetryInput {
     readonly x: readonly number[];
     readonly y: readonly number[];
 }
+/** The log-log slope with its standard error and the direct two-sided p of slope = 0. @internal */
+export interface ScaleExponentResult {
+    readonly exponent: number | null;
+    /** Standard error of the slope (MathTS `linearRegression.stdErr`). */
+    readonly stdErr: number | null;
+    /** P(|T_{n−2}| ≥ |exponent/stdErr|), the direct tail ({@link studentTwoSidedP}); null below n = 3. */
+    readonly pValue: number | null;
+    /** The positive pairs the fit used. */
+    readonly n: number;
+    readonly abstained: boolean;
+    readonly reason?: string;
+}
 /**
- * Ordinary-least-squares log-log slope. Abstains if x or y are non-positive.
+ * Ordinary-least-squares log-log slope, MathTS `linearRegression` on the
+ * logs, with its standard error. The p-value is NOT the one MathTS reports
+ * (`2·(1 − CDF)`, which rounds a far tail to 0): it is the direct t tail from
+ * `betainc`. Abstains if x or y are non-positive, or when the log-x spread
+ * (core `sumSquaredDeviations`, times n: the normal-equation denominator)
+ * is degenerate.
  *
  * @internal
  */
-export declare function estimateScaleExponent(input: ScaleSymmetryInput): {
-    exponent: number | null;
-    abstained: boolean;
-    reason?: string;
-};
+export declare function estimateScaleExponent(input: ScaleSymmetryInput): ScaleExponentResult;
+/** The verdict of {@link probeConservation}: no drift in q beyond k standard errors of its slope. @internal */
+export interface ConservationResult {
+    readonly conserved: boolean;
+    /** Mean |dq/dt| from MathTS `gradient` (second-order central differences inside, one-sided at the ends). */
+    readonly meanAbsRate: number;
+    /** The slope of MathTS `linearRegression(t, q)` and its standard error. */
+    readonly slope: number | null;
+    readonly stdErr: number | null;
+    /** The multiple of the standard error a drift must exceed to count. */
+    readonly k: number;
+    readonly abstained: boolean;
+    readonly reason?: string;
+}
 /**
- * Finite-difference conservation probe: mean |ΔQ/Δt| ≈ 0.
+ * Conservation probe as a test: q is conserved when the linear drift
+ * `slope` of `linearRegression(t, q)` satisfies |slope| ≤ k·stdErr. The
+ * standard error comes from the residual scatter of the same series, so the
+ * verdict is scale-free. k = 3 by default: a drift within three standard
+ * errors is not distinguishable from none at the series' own noise (a
+ * two-sided 0.27% under Gaussian residuals), the usual working threshold
+ * for "no effect seen". The test sees a linear drift only; a quantity that
+ * oscillates without drifting passes. The mean |dq/dt| is reported beside
+ * the verdict from MathTS `gradient` (second order inside the series), not
+ * from first-order forward differences, and never decides it. Abstains below
+ * three samples or when t is not strictly increasing.
  *
  * @internal
  */
-export declare function probeConservation(q: readonly number[], t: readonly number[], atol?: number): {
-    conserved: boolean;
-    meanAbsRate: number;
-    abstained: boolean;
-    reason?: string;
-};
+export declare function probeConservation(q: readonly number[], t: readonly number[], opts?: {
+    readonly k?: number;
+}): ConservationResult;
 //# sourceMappingURL=structure.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"structure.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/structure.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9B,QAAQ,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC/B;AAED,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,gBAAgB,EACvB,QAAQ,SAAM,GACb,iBAAiB,CAsBnB;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9B,QAAQ,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC/B;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,kBAAkB,GAAG;IAChE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,SAAS,EAAE,OAAO,CAAC;IACnB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,CAyBA;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,CAAC,EAAE,SAAS,MAAM,EAAE,EACpB,CAAC,EAAE,SAAS,MAAM,EAAE,EACpB,IAAI,SAAO,GACV;IAAE,SAAS,EAAE,OAAO,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAiBlF"}
+{"version":3,"file":"structure.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/structure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAOH,yFAAyF;AACzF,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9B,QAAQ,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9B,gEAAgE;IAChE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,sDAAsD;IACtD,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,kGAAkG;IAClG,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,8GAA8G;AAC9G,MAAM,WAAW,iBAAiB;IAChC,oGAAoG;IACpG,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,6FAA6F;IAC7F,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,4FAA4F;IAC5F,QAAQ,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IACvC,uFAAuF;IACvF,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAC;IACzC;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,qFAAqF;IACrF,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AA2CD;;;;;;;;;;;GAWG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,gBAAgB,GAAG,iBAAiB,CAuChF;AAED,qFAAqF;AACrF,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9B,QAAQ,CAAC,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC/B;AAED,mGAAmG;AACnG,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,sEAAsE;IACtE,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,sGAAsG;IACtG,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,uCAAuC;IACvC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;;GASG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,kBAAkB,GAAG,mBAAmB,CAgBpF;AAED,+GAA+G;AAC/G,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,4GAA4G;IAC5G,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,2EAA2E;IAC3E,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,uEAAuE;IACvE,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,iBAAiB,CAC/B,CAAC,EAAE,SAAS,MAAM,EAAE,EACpB,CAAC,EAAE,SAAS,MAAM,EAAE,EACpB,IAAI,GAAE;IAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAA;CAAO,GACjC,kBAAkB,CAkBpB"}