universal-physics-tensor 10.0.0 → 12.0.0

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EACL,cAAc,EACd,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,YAAY,CAAC;AACpB,YAAY,EACV,oBAAoB,EACpB,YAAY,EACZ,UAAU,EACV,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,eAAe,EACf,mBAAmB,EACnB,YAAY,EACZ,qBAAqB,EACrB,qBAAqB,EACrB,yBAAyB,EACzB,uBAAuB,EACvB,WAAW,EACX,WAAW,EACX,oBAAoB,EACpB,kBAAkB,EAClB,WAAW,EACX,oBAAoB,EACpB,iBAAiB,EACjB,oBAAoB,EACpB,oBAAoB,EACpB,0BAA0B,EAC1B,sBAAsB,EACtB,oBAAoB,EACpB,oBAAoB,EACpB,sBAAsB,EACtB,cAAc,EACd,YAAY,EACZ,aAAa,EACb,WAAW,EACX,kBAAkB,EAClB,eAAe,EACf,aAAa,EACb,oBAAoB,EACpB,mBAAmB,EACnB,wBAAwB,GACzB,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AACnG,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACpF,YAAY,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EACL,cAAc,EACd,aAAa,EACb,cAAc,EACd,aAAa,EACb,YAAY,EACZ,eAAe,GAChB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,iBAAiB,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AACnG,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChE,YAAY,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,cAAc,EACd,YAAY,EACZ,eAAe,EACf,sBAAsB,GACvB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AACpF,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AACxC,YAAY,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAC1C,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1D,YAAY,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AACpD,OAAO,EAAE,eAAe,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AACrE,YAAY,EAAE,WAAW,EAAE,sBAAsB,EAAE,MAAM,aAAa,CAAC;AACvE,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACtE,YAAY,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AACpD,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACnE,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAChE,OAAO,EACL,eAAe,EACf,aAAa,EACb,mBAAmB,EACnB,yBAAyB,EACzB,kBAAkB,EAClB,YAAY,GACb,MAAM,cAAc,CAAC;AACtB,YAAY,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACtD,OAAO,EAAE,0BAA0B,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AACvF,YAAY,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC7E,OAAO,EACL,qBAAqB,EACrB,qBAAqB,EACrB,iBAAiB,GAClB,MAAM,gBAAgB,CAAC;AACxB,YAAY,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAC9F,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,cAAc,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAC/F,OAAO,EACL,mBAAmB,EACnB,mBAAmB,EACnB,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,eAAe,CAAC;AACvB,yGAAyG;AACzG,OAAO,EAAE,eAAe,EAAE,yBAAyB,EAAE,qBAAqB,EAAE,uBAAuB,EAAE,aAAa,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAC3J,YAAY,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAChD,sEAAsE;AACtE,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAC/D,YAAY,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAC3E,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AACvF,OAAO,EACL,UAAU,EACV,iBAAiB,EACjB,aAAa,EACb,iBAAiB,EACjB,aAAa,EACb,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,SAAS,EACT,cAAc,EACd,YAAY,GACb,MAAM,YAAY,CAAC;AACpB,YAAY,EACV,UAAU,EACV,iBAAiB,EACjB,gBAAgB,EAChB,YAAY,EACZ,kBAAkB,EAClB,SAAS,EACT,eAAe,EACf,gBAAgB,EAChB,aAAa,EACb,OAAO,EACP,SAAS,EACT,aAAa,EACb,qBAAqB,EACrB,eAAe,EACf,qBAAqB,EACrB,cAAc,GACf,MAAM,YAAY,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EACL,cAAc,EACd,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,YAAY,CAAC;AACpB,YAAY,EACV,oBAAoB,EACpB,YAAY,EACZ,UAAU,EACV,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,eAAe,EACf,mBAAmB,EACnB,YAAY,EACZ,qBAAqB,EACrB,qBAAqB,EACrB,yBAAyB,EACzB,uBAAuB,EACvB,WAAW,EACX,WAAW,EACX,oBAAoB,EACpB,kBAAkB,EAClB,WAAW,EACX,oBAAoB,EACpB,iBAAiB,EACjB,oBAAoB,EACpB,oBAAoB,EACpB,0BAA0B,EAC1B,sBAAsB,EACtB,oBAAoB,EACpB,oBAAoB,EACpB,sBAAsB,EACtB,cAAc,EACd,YAAY,EACZ,aAAa,EACb,WAAW,EACX,kBAAkB,EAClB,eAAe,EACf,aAAa,EACb,oBAAoB,EACpB,mBAAmB,EACnB,wBAAwB,GACzB,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AACnG,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACpF,YAAY,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EACL,cAAc,EACd,aAAa,EACb,cAAc,EACd,aAAa,EACb,YAAY,EACZ,eAAe,GAChB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,iBAAiB,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AACnG,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChE,YAAY,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AACnD,4FAA4F;AAC5F,OAAO,EAAE,qBAAqB,EAAE,eAAe,EAAE,mBAAmB,EAAE,WAAW,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AACpI,wHAAwH;AACxH,YAAY,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AACnH,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,cAAc,EACd,YAAY,EACZ,eAAe,EACf,sBAAsB,GACvB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AACpF,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AACxC,YAAY,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAC1C,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1D,YAAY,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AACpD,OAAO,EAAE,eAAe,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AACrE,YAAY,EAAE,WAAW,EAAE,sBAAsB,EAAE,MAAM,aAAa,CAAC;AACvE,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACtE,YAAY,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AACpD,+FAA+F;AAC/F,YAAY,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACnE,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAChE,OAAO,EACL,eAAe,EACf,aAAa,EACb,mBAAmB,EACnB,yBAAyB,EACzB,kBAAkB,EAClB,YAAY,GACb,MAAM,cAAc,CAAC;AACtB,uIAAuI;AACvI,OAAO,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC/D,YAAY,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACtD,OAAO,EAAE,0BAA0B,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AACvF,YAAY,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC7E,OAAO,EACL,qBAAqB,EACrB,qBAAqB,EACrB,iBAAiB,GAClB,MAAM,gBAAgB,CAAC;AACxB,YAAY,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAC9F,yHAAyH;AACzH,YAAY,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAC9E,gGAAgG;AAChG,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,cAAc,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAC/F,OAAO,EACL,mBAAmB,EACnB,mBAAmB,EACnB,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,eAAe,CAAC;AACvB,yGAAyG;AACzG,OAAO,EAAE,eAAe,EAAE,yBAAyB,EAAE,qBAAqB,EAAE,uBAAuB,EAAE,aAAa,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAC3J,YAAY,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAChD,sEAAsE;AACtE,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAC/D,YAAY,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAC3E,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AACvF,OAAO,EACL,UAAU,EACV,iBAAiB,EACjB,aAAa,EACb,iBAAiB,EACjB,aAAa,EACb,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,SAAS,EACT,cAAc,EACd,YAAY,GACb,MAAM,YAAY,CAAC;AACpB,YAAY,EACV,UAAU,EACV,iBAAiB,EACjB,gBAAgB,EAChB,YAAY,EACZ,kBAAkB,EAClB,SAAS,EACT,eAAe,EACf,gBAAgB,EAChB,aAAa,EACb,OAAO,EACP,SAAS,EACT,aAAa,EACb,qBAAqB,EACrB,eAAe,EACf,qBAAqB,EACrB,cAAc,GACf,MAAM,YAAY,CAAC;AACpB,uHAAuH;AACvH,YAAY,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC"}

package/dist/composition/probe/index.js

@@ -18,6 +18,8 @@ export { scalarDiscrepancy, rmse, ResidualError } from './residual.js';
 export { openManifest, closeManifest } from './run-manifest.js';
 export { canTransition, applyStatus, statusRank, ProbeCandidateStore } from './candidate-store.js';
 export { monomialToExpr, generateNative } from './generator.js';
+/** The rational power law over the π-groups, and the log-design rank the frontier reads. */
+export { powerLawDetermination, powerLawWording, rationalizeExponent, piStructure, logDesign, logDesignRank } from './power-law.js';
 export { wrapRelationLinkGaps, wrapConnectorGaps, wrapRegimeGaps, scanFrontier, findFrontierGap, problemFromResidualGap, } from './frontier.js';
 export { expressionSearchGaps, scanWithExpressionGaps } from './expression-gaps.js';
 export { fitPrefactor } from './fit.js';
@@ -26,8 +28,12 @@ export { compareToCorpus, corpusRelativeWording } from './corpus.js';
 export { checkDeclaredLimit, checkDeclaredLimits } from './limits.js';
 export { runFalsification, DEFAULT_BATTERIES } from './falsify.js';
 export { datasetFromRows, asDatasetSafe, loadDatasetFromJson, loadSplitDatasetsFromJson, loadDatasetFromCsv, loadSplitCsv, } from './dataset.js';
+/** The strict cell reader (a finite number or a decimal string, never a coercion) and the error a dataset raises by row and column. */
+export { readDatasetNumber, DatasetError } from './dataset.js';
 export { suggestDiscriminatingPoint, parseDesignBounds } from './experiment-design.js';
 export { detectMeanChangepoint, estimateScaleExponent, probeConservation, } from './structure.js';
+/** The direct two-sided Student t tail the probes consume instead of MathTS's `2·(1 − CDF)`. */
+export { studentTwoSidedP } from './t-tail.js';
 export { runBackendWorker } from './backend-protocol.js';
 export { setRelationMetadata, getRelationMetadata, listRelationMetadata, clearRelationMetadata, } from './metadata.js';
 /** The problem-file readers and the error a file that is not a problem file raises, naming its field. */

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

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/composition/probe/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EACL,cAAc,EACd,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,YAAY,CAAC;AAyCpB,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AACnG,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEpF,OAAO,EACL,cAAc,EACd,aAAa,EACb,cAAc,EACd,aAAa,EACb,YAAY,EACZ,eAAe,GAChB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,iBAAiB,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AACnG,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEhE,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,cAAc,EACd,YAAY,EACZ,eAAe,EACf,sBAAsB,GACvB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AACpF,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAExC,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1D,OAAO,EAAE,eAAe,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AAErE,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAEtE,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAEnE,OAAO,EACL,eAAe,EACf,aAAa,EACb,mBAAmB,EACnB,yBAAyB,EACzB,kBAAkB,EAClB,YAAY,GACb,MAAM,cAAc,CAAC;AAEtB,OAAO,EAAE,0BAA0B,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAEvF,OAAO,EACL,qBAAqB,EACrB,qBAAqB,EACrB,iBAAiB,GAClB,MAAM,gBAAgB,CAAC;AAExB,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEzD,OAAO,EACL,mBAAmB,EACnB,mBAAmB,EACnB,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,eAAe,CAAC;AACvB,yGAAyG;AACzG,OAAO,EAAE,eAAe,EAAE,yBAAyB,EAAE,qBAAqB,EAAE,uBAAuB,EAAE,aAAa,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAE3J,sEAAsE;AACtE,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAE/D,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AACvF,OAAO,EACL,UAAU,EACV,iBAAiB,EACjB,aAAa,EACb,iBAAiB,EACjB,aAAa,EACb,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,SAAS,EACT,cAAc,EACd,YAAY,GACb,MAAM,YAAY,CAAC","sourcesContent":["/**\n * Experimental Product B barrel — expression / residual search.\n *\n * Import via `universal-physics-tensor/probe`. Not re-exported from the\n * root `universal-physics-tensor` entry. Orthogonal to Product A\n * (`upt discover` / `VettedCandidate`).\n *\n * All symbols are `@internal`: the subpath exists for CLI and experiments,\n * not as a stability contract.\n *\n * @module composition/probe\n */\n\nexport {\n  SCHEMA_VERSION,\n  PROBE_SCHEMA_VERSION,\n  DEFAULT_SEARCH_BUDGET,\n} from './types.js';\nexport type {\n  ProbeCandidateStatus,\n  RelationKind,\n  AuditState,\n  DiscrepancyKind,\n  DatasetRole,\n  SearchStopReason,\n  FrontierGapKind,\n  IdentifiabilityKind,\n  SearchBudget,\n  DiscrepancyDefinition,\n  ScientificRelationRef,\n  IdentifiabilityAssessment,\n  SearchabilityAssessment,\n  GapEvidence,\n  FrontierGap,\n  ProbeCandidateOrigin,\n  ProbeCandidateBody,\n  StatusEvent,\n  CandidateFingerprint,\n  ComplexityMetrics,\n  ProbeCandidateRecord,\n  ProbeRejectionRecord,\n  DiscoveryBackendDescriptor,\n  EnvironmentFingerprint,\n  NondeterminismSource,\n  DiscoveryRunManifest,\n  DimensionalVariableRef,\n  ObservationRow,\n  ProbeDataset,\n  SearchProblem,\n  ScoreVector,\n  EvidenceAssessment,\n  EvidenceProfile,\n  DeclaredLimit,\n  FalsificationBattery,\n  FalsificationRecord,\n  ScientificRelationRecord,\n} from './types.js';\n\nexport { canonicalJson, sha256Hex, hashCanonical, captureEnvironment } from '../canonical-json.js';\nexport { openBudget, budgetStopReason, canEmitCandidate } from './search-budget.js';\nexport type { BudgetState } from './search-budget.js';\nexport {\n  bodyExpression,\n  countAstNodes,\n  countOperators,\n  maxPowerOrder,\n  complexityOf,\n  fingerprintExpr,\n} from './fingerprint.js';\nexport { scalarDiscrepancy, rmse, ResidualError } from './residual.js';\nexport { openManifest, closeManifest } from './run-manifest.js';\nexport { canTransition, applyStatus, statusRank, ProbeCandidateStore } from './candidate-store.js';\nexport { monomialToExpr, generateNative } from './generator.js';\nexport type { RawCandidate } from './generator.js';\nexport {\n  wrapRelationLinkGaps,\n  wrapConnectorGaps,\n  wrapRegimeGaps,\n  scanFrontier,\n  findFrontierGap,\n  problemFromResidualGap,\n} from './frontier.js';\nexport { expressionSearchGaps, scanWithExpressionGaps } from './expression-gaps.js';\nexport { fitPrefactor } from './fit.js';\nexport type { FitResult } from './fit.js';\nexport { scoreCandidate, rankPareto } from './scoring.js';\nexport type { RankedCandidate } from './scoring.js';\nexport { compareToCorpus, corpusRelativeWording } from './corpus.js';\nexport type { CorpusMatch, CorpusComparisonResult } from './corpus.js';\nexport { checkDeclaredLimit, checkDeclaredLimits } from './limits.js';\nexport type { LimitCheckResult } from './limits.js';\nexport { runFalsification, DEFAULT_BATTERIES } from './falsify.js';\nexport type { FalsifyInput, FalsifyResult } from './falsify.js';\nexport {\n  datasetFromRows,\n  asDatasetSafe,\n  loadDatasetFromJson,\n  loadSplitDatasetsFromJson,\n  loadDatasetFromCsv,\n  loadSplitCsv,\n} from './dataset.js';\nexport type { SplitFileDatasets } from './dataset.js';\nexport { suggestDiscriminatingPoint, parseDesignBounds } from './experiment-design.js';\nexport type { DesignBounds, DesignSuggestion } from './experiment-design.js';\nexport {\n  detectMeanChangepoint,\n  estimateScaleExponent,\n  probeConservation,\n} from './structure.js';\nexport type { ChangepointInput, ChangepointResult, ScaleSymmetryInput } from './structure.js';\nexport { runBackendWorker } from './backend-protocol.js';\nexport type { BackendRequest, BackendCandidate, BackendResponse } from './backend-protocol.js';\nexport {\n  setRelationMetadata,\n  getRelationMetadata,\n  listRelationMetadata,\n  clearRelationMetadata,\n} from './metadata.js';\n/** The problem-file readers and the error a file that is not a problem file raises, naming its field. */\nexport { makeResidualGap, loadSearchProblemFromJson, searchProblemFromFile, resolveObservationsPath, parseExprJson, ProblemFileError } from './problem.js';\nexport type { ProblemFile } from './problem.js';\n/** The search pipeline and the argv a Node worker is spawned with. */\nexport { runProbeSearch, nodeWorkerArgv } from './pipeline.js';\nexport type { ProbeSearchOptions, ProbeSearchResult } from './pipeline.js';\nexport { formatProbeReport, formatFrontierScan, formatFrontierGap } from './report.js';\nexport {\n  parseStudy,\n  loadStudyFromJson,\n  loadStudyFile,\n  attachReplication,\n  studyCsvToRaw,\n  runProbeStudy,\n  formatProbeStudy,\n  chiSquareSurvival,\n  fSurvival,\n  effectiveSigma,\n  StudyRefusal,\n} from './study.js';\nexport type {\n  ProbeStudy,\n  ProbeStudyOptions,\n  ProbeStudyResult,\n  StudyVerdict,\n  ReplicationOutcome,\n  StudyRole,\n  StudyProvenance,\n  StudyObservation,\n  StudyBaseline,\n  SetTest,\n  ModelTest,\n  CandidateTest,\n  StudyDesignSuggestion,\n  StudyCorrection,\n  StudyCorrectionReport,\n  CorrectionStep,\n} from './study.js';\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/composition/probe/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EACL,cAAc,EACd,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,YAAY,CAAC;AAyCpB,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AACnG,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEpF,OAAO,EACL,cAAc,EACd,aAAa,EACb,cAAc,EACd,aAAa,EACb,YAAY,EACZ,eAAe,GAChB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,iBAAiB,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AACnG,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEhE,4FAA4F;AAC5F,OAAO,EAAE,qBAAqB,EAAE,eAAe,EAAE,mBAAmB,EAAE,WAAW,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAGpI,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,cAAc,EACd,YAAY,EACZ,eAAe,EACf,sBAAsB,GACvB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AACpF,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAExC,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1D,OAAO,EAAE,eAAe,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AAErE,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAItE,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAEnE,OAAO,EACL,eAAe,EACf,aAAa,EACb,mBAAmB,EACnB,yBAAyB,EACzB,kBAAkB,EAClB,YAAY,GACb,MAAM,cAAc,CAAC;AACtB,uIAAuI;AACvI,OAAO,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAE/D,OAAO,EAAE,0BAA0B,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAEvF,OAAO,EACL,qBAAqB,EACrB,qBAAqB,EACrB,iBAAiB,GAClB,MAAM,gBAAgB,CAAC;AAIxB,gGAAgG;AAChG,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEzD,OAAO,EACL,mBAAmB,EACnB,mBAAmB,EACnB,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,eAAe,CAAC;AACvB,yGAAyG;AACzG,OAAO,EAAE,eAAe,EAAE,yBAAyB,EAAE,qBAAqB,EAAE,uBAAuB,EAAE,aAAa,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAE3J,sEAAsE;AACtE,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAE/D,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AACvF,OAAO,EACL,UAAU,EACV,iBAAiB,EACjB,aAAa,EACb,iBAAiB,EACjB,aAAa,EACb,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,SAAS,EACT,cAAc,EACd,YAAY,GACb,MAAM,YAAY,CAAC","sourcesContent":["/**\n * Experimental Product B barrel — expression / residual search.\n *\n * Import via `universal-physics-tensor/probe`. Not re-exported from the\n * root `universal-physics-tensor` entry. Orthogonal to Product A\n * (`upt discover` / `VettedCandidate`).\n *\n * All symbols are `@internal`: the subpath exists for CLI and experiments,\n * not as a stability contract.\n *\n * @module composition/probe\n */\n\nexport {\n  SCHEMA_VERSION,\n  PROBE_SCHEMA_VERSION,\n  DEFAULT_SEARCH_BUDGET,\n} from './types.js';\nexport type {\n  ProbeCandidateStatus,\n  RelationKind,\n  AuditState,\n  DiscrepancyKind,\n  DatasetRole,\n  SearchStopReason,\n  FrontierGapKind,\n  IdentifiabilityKind,\n  SearchBudget,\n  DiscrepancyDefinition,\n  ScientificRelationRef,\n  IdentifiabilityAssessment,\n  SearchabilityAssessment,\n  GapEvidence,\n  FrontierGap,\n  ProbeCandidateOrigin,\n  ProbeCandidateBody,\n  StatusEvent,\n  CandidateFingerprint,\n  ComplexityMetrics,\n  ProbeCandidateRecord,\n  ProbeRejectionRecord,\n  DiscoveryBackendDescriptor,\n  EnvironmentFingerprint,\n  NondeterminismSource,\n  DiscoveryRunManifest,\n  DimensionalVariableRef,\n  ObservationRow,\n  ProbeDataset,\n  SearchProblem,\n  ScoreVector,\n  EvidenceAssessment,\n  EvidenceProfile,\n  DeclaredLimit,\n  FalsificationBattery,\n  FalsificationRecord,\n  ScientificRelationRecord,\n} from './types.js';\n\nexport { canonicalJson, sha256Hex, hashCanonical, captureEnvironment } from '../canonical-json.js';\nexport { openBudget, budgetStopReason, canEmitCandidate } from './search-budget.js';\nexport type { BudgetState } from './search-budget.js';\nexport {\n  bodyExpression,\n  countAstNodes,\n  countOperators,\n  maxPowerOrder,\n  complexityOf,\n  fingerprintExpr,\n} from './fingerprint.js';\nexport { scalarDiscrepancy, rmse, ResidualError } from './residual.js';\nexport { openManifest, closeManifest } from './run-manifest.js';\nexport { canTransition, applyStatus, statusRank, ProbeCandidateStore } from './candidate-store.js';\nexport { monomialToExpr, generateNative } from './generator.js';\nexport type { RawCandidate } from './generator.js';\n/** The rational power law over the π-groups, and the log-design rank the frontier reads. */\nexport { powerLawDetermination, powerLawWording, rationalizeExponent, piStructure, logDesign, logDesignRank } from './power-law.js';\n/** The power-law types: the determination, one fitted exponent, a recovered fit, the π-structure and the log-design. */\nexport type { PowerLawDetermination, PowerLawExponent, PowerLawFit, PiStructure, LogDesign } from './power-law.js';\nexport {\n  wrapRelationLinkGaps,\n  wrapConnectorGaps,\n  wrapRegimeGaps,\n  scanFrontier,\n  findFrontierGap,\n  problemFromResidualGap,\n} from './frontier.js';\nexport { expressionSearchGaps, scanWithExpressionGaps } from './expression-gaps.js';\nexport { fitPrefactor } from './fit.js';\nexport type { FitResult } from './fit.js';\nexport { scoreCandidate, rankPareto } from './scoring.js';\nexport type { RankedCandidate } from './scoring.js';\nexport { compareToCorpus, corpusRelativeWording } from './corpus.js';\nexport type { CorpusMatch, CorpusComparisonResult } from './corpus.js';\nexport { checkDeclaredLimit, checkDeclaredLimits } from './limits.js';\nexport type { LimitCheckResult } from './limits.js';\n/** What a declared-limit check found: held, failed, or undecided on too few evaluable rows. */\nexport type { LimitOutcome } from './limits.js';\nexport { runFalsification, DEFAULT_BATTERIES } from './falsify.js';\nexport type { FalsifyInput, FalsifyResult } from './falsify.js';\nexport {\n  datasetFromRows,\n  asDatasetSafe,\n  loadDatasetFromJson,\n  loadSplitDatasetsFromJson,\n  loadDatasetFromCsv,\n  loadSplitCsv,\n} from './dataset.js';\n/** The strict cell reader (a finite number or a decimal string, never a coercion) and the error a dataset raises by row and column. */\nexport { readDatasetNumber, DatasetError } from './dataset.js';\nexport type { SplitFileDatasets } from './dataset.js';\nexport { suggestDiscriminatingPoint, parseDesignBounds } from './experiment-design.js';\nexport type { DesignBounds, DesignSuggestion } from './experiment-design.js';\nexport {\n  detectMeanChangepoint,\n  estimateScaleExponent,\n  probeConservation,\n} from './structure.js';\nexport type { ChangepointInput, ChangepointResult, ScaleSymmetryInput } from './structure.js';\n/** The scale-exponent result (slope, standard error, direct p) and the conservation verdict (slope against k·stdErr). */\nexport type { ScaleExponentResult, ConservationResult } from './structure.js';\n/** The direct two-sided Student t tail the probes consume instead of MathTS's `2·(1 − CDF)`. */\nexport { studentTwoSidedP } from './t-tail.js';\nexport { runBackendWorker } from './backend-protocol.js';\nexport type { BackendRequest, BackendCandidate, BackendResponse } from './backend-protocol.js';\nexport {\n  setRelationMetadata,\n  getRelationMetadata,\n  listRelationMetadata,\n  clearRelationMetadata,\n} from './metadata.js';\n/** The problem-file readers and the error a file that is not a problem file raises, naming its field. */\nexport { makeResidualGap, loadSearchProblemFromJson, searchProblemFromFile, resolveObservationsPath, parseExprJson, ProblemFileError } from './problem.js';\nexport type { ProblemFile } from './problem.js';\n/** The search pipeline and the argv a Node worker is spawned with. */\nexport { runProbeSearch, nodeWorkerArgv } from './pipeline.js';\nexport type { ProbeSearchOptions, ProbeSearchResult } from './pipeline.js';\nexport { formatProbeReport, formatFrontierScan, formatFrontierGap } from './report.js';\nexport {\n  parseStudy,\n  loadStudyFromJson,\n  loadStudyFile,\n  attachReplication,\n  studyCsvToRaw,\n  runProbeStudy,\n  formatProbeStudy,\n  chiSquareSurvival,\n  fSurvival,\n  effectiveSigma,\n  StudyRefusal,\n} from './study.js';\nexport type {\n  ProbeStudy,\n  ProbeStudyOptions,\n  ProbeStudyResult,\n  StudyVerdict,\n  ReplicationOutcome,\n  StudyRole,\n  StudyProvenance,\n  StudyObservation,\n  StudyBaseline,\n  SetTest,\n  ModelTest,\n  CandidateTest,\n  StudyDesignSuggestion,\n  StudyCorrection,\n  StudyCorrectionReport,\n  CorrectionStep,\n} from './study.js';\n/** One fitted correction coefficient with its standard error and, when declared, the reference it is compared with. */\nexport type { CorrectionCoefficient } from './study.js';\n"]}

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

@@ -2,15 +2,26 @@
  * Declared-limit checks for probe candidates.
  *
  * A failed limit is **not automatically fatal**. It is fatal only when the
- * candidate claims the domain in which the limit fails.
+ * candidate claims the domain in which the limit fails. A limit whose rows
+ * the candidate mostly could not be evaluated on is **undecided**, which is
+ * neither a pass nor a failure and is never fatal.
  *
  * @internal
  */
 import type { ExprNode } from '../../dimensional/ast-types.js';
 import type { DeclaredLimit, ProbeDataset } from './types.js';
+/** What a limit check found: the limit held, failed, or could not be decided on these rows. @internal */
+export type LimitOutcome = 'held' | 'failed' | 'undecided';
+/** The outcome of one declared-limit check, and whether it is fatal. */
 export interface LimitCheckResult {
     readonly id: string;
+    /** `outcome === 'held'`. */
     readonly passed: boolean;
+    readonly outcome: LimitOutcome;
+    /** Rows the candidate was evaluated on (finite prediction and a finite observation). */
+    readonly evaluated: number;
+    /** Rows the candidate threw on, or predicted a non-finite value for, or that have no finite observation. */
+    readonly skipped: number;
     readonly claimedDomain: boolean;
     readonly fatal: boolean;
     readonly detail: string;
@@ -19,6 +30,19 @@ export interface LimitCheckResult {
  * Evaluate `prefactor · expr` RMSE on `dataset`. When the candidate does not
  * claim `limit.regime`, a failure is recorded but not fatal.
  *
+ * A row the candidate throws on, or predicts a non-finite value for, is
+ * skipped and COUNTED. When more rows were skipped than evaluated (or none
+ * could be evaluated), the outcome is `undecided`: a candidate that throws on
+ * nine rows of ten is not judged on the tenth. That threshold, skipped >
+ * evaluated, is a choice stated here, not a measured one.
+ *
+ * The pass rule is LOOSE by design: the limit holds when the RMSE over the
+ * evaluated rows is at most half the largest |observation| of the dataset. It
+ * catches a candidate that is wrong by its own scale in a regime, not one that
+ * is wrong by a few percent; the holdout tolerance is the quantitative test.
+ * The RMSE is core `norm2` of the residuals over √n (overflow-safe), so a
+ * residual of 1e200 is a number, not `Infinity`.
+ *
  * @internal
  */
 export declare function checkDeclaredLimit(expr: ExprNode, dataset: ProbeDataset, prefactor: number, limit: DeclaredLimit, claimsDomain: boolean): LimitCheckResult;

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

@@ -1 +1 @@
-{"version":3,"file":"limits.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/limits.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAG9D,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,YAAY,EACrB,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,aAAa,EACpB,YAAY,EAAE,OAAO,GACpB,gBAAgB,CAyClB;AAED,0CAA0C;AAC1C,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,YAAY,GAAG,SAAS,EACjC,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,SAAS,aAAa,EAAE,EAChC,cAAc,GAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAM,GACpD,SAAS,gBAAgB,EAAE,CAc7B"}
+{"version":3,"file":"limits.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/limits.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAG9D,yGAAyG;AACzG,MAAM,MAAM,YAAY,GAAG,MAAM,GAAG,QAAQ,GAAG,WAAW,CAAC;AAE3D,wEAAwE;AACxE,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,4BAA4B;IAC5B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC;IAC/B,wFAAwF;IACxF,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,4GAA4G;IAC5G,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,YAAY,EACrB,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,aAAa,EACpB,YAAY,EAAE,OAAO,GACpB,gBAAgB,CAiElB;AAED,0CAA0C;AAC1C,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,YAAY,GAAG,SAAS,EACjC,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,SAAS,aAAa,EAAE,EAChC,cAAc,GAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAM,GACpD,SAAS,gBAAgB,EAAE,CAc7B"}

package/dist/composition/probe/limits.js

@@ -2,15 +2,31 @@
  * Declared-limit checks for probe candidates.
  *
  * A failed limit is **not automatically fatal**. It is fatal only when the
- * candidate claims the domain in which the limit fails.
+ * candidate claims the domain in which the limit fails. A limit whose rows
+ * the candidate mostly could not be evaluated on is **undecided**, which is
+ * neither a pass nor a failure and is never fatal.
  *
  * @internal
  */
+import { norm2 } from '@danielsimonjr/mathts-core';
 import { evalExpr } from '../expr-eval.js';
 /**
  * Evaluate `prefactor · expr` RMSE on `dataset`. When the candidate does not
  * claim `limit.regime`, a failure is recorded but not fatal.
  *
+ * A row the candidate throws on, or predicts a non-finite value for, is
+ * skipped and COUNTED. When more rows were skipped than evaluated (or none
+ * could be evaluated), the outcome is `undecided`: a candidate that throws on
+ * nine rows of ten is not judged on the tenth. That threshold, skipped >
+ * evaluated, is a choice stated here, not a measured one.
+ *
+ * The pass rule is LOOSE by design: the limit holds when the RMSE over the
+ * evaluated rows is at most half the largest |observation| of the dataset. It
+ * catches a candidate that is wrong by its own scale in a regime, not one that
+ * is wrong by a few percent; the holdout tolerance is the quantitative test.
+ * The RMSE is core `norm2` of the residuals over √n (overflow-safe), so a
+ * residual of 1e200 is a number, not `Infinity`.
+ *
  * @internal
  */
 export function checkDeclaredLimit(expr, dataset, prefactor, limit, claimsDomain) {
@@ -18,40 +34,66 @@ export function checkDeclaredLimit(expr, dataset, prefactor, limit, claimsDomain
         return {
             id: limit.id,
             passed: true,
+            outcome: 'held',
+            evaluated: 0,
+            skipped: 0,
             claimedDomain: claimsDomain,
             fatal: false,
             detail: `no observations for declared-limit ${limit.id}`,
         };
     }
-    let sumSq = 0;
-    let n = 0;
+    const residuals = [];
+    let skipped = 0;
     for (const row of dataset.rows) {
         let predicted;
         try {
             predicted = prefactor * evalExpr(expr, row);
         }
         catch {
+            skipped += 1;
             continue;
         }
         const observed = row[dataset.observable];
-        if (!Number.isFinite(predicted) || observed == null || !Number.isFinite(observed))
+        if (!Number.isFinite(predicted) || observed === undefined || !Number.isFinite(observed)) {
+            skipped += 1;
             continue;
-        const err = predicted - observed;
-        sumSq += err * err;
-        n += 1;
+        }
+        residuals.push(predicted - observed);
+    }
+    const evaluated = residuals.length;
+    const total = dataset.rows.length;
+    if (evaluated === 0 || skipped > evaluated) {
+        return {
+            id: limit.id,
+            passed: false,
+            outcome: 'undecided',
+            evaluated,
+            skipped,
+            claimedDomain: claimsDomain,
+            fatal: false,
+            detail: `limit ${limit.id} undecided: ${skipped} of ${total} rows could not be evaluated (${evaluated} could); not judged on so few`,
+        };
     }
-    const rmse = n === 0 ? Number.POSITIVE_INFINITY : Math.sqrt(sumSq / n);
-    const scale = Math.max(...dataset.rows.map((r) => Math.abs(r[dataset.observable] ?? 0)), 1e-12);
+    const rmse = norm2(residuals) / Math.sqrt(evaluated);
+    // A reduce, not `Math.max(...rows)`: a spread of a large dataset overflows the call stack.
+    const scale = dataset.rows.reduce((m, r) => {
+        const v = r[dataset.observable];
+        return v !== undefined && Number.isFinite(v) ? Math.max(m, Math.abs(v)) : m;
+    }, 1e-12);
     const passed = Number.isFinite(rmse) && rmse <= 0.5 * scale;
     const fatal = !passed && claimsDomain;
+    const rows = skipped > 0 ? ` on ${evaluated} of ${total} rows (${skipped} skipped)` : '';
     return {
         id: limit.id,
         passed,
+        outcome: passed ? 'held' : 'failed',
+        evaluated,
+        skipped,
         claimedDomain: claimsDomain,
         fatal,
         detail: passed
-            ? `limit ${limit.id} held (rmse=${rmse})`
-            : `limit ${limit.id} failed (rmse=${rmse})${fatal ? ' — fatal because candidate claims this domain' : ' — not fatal (domain not claimed)'}`,
+            ? `limit ${limit.id} held (rmse=${rmse})${rows}`
+            : `limit ${limit.id} failed (rmse=${rmse})${rows}${fatal ? ' — fatal because candidate claims this domain' : ' — not fatal (domain not claimed)'}`,
     };
 }
 /** Run every declared limit. @internal */

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;AAoB3C;;;;;;;;;;;;;;;;;;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\n/** The outcome of one declared-limit check, and whether it is fatal. */\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

@@ -13,6 +13,7 @@ import { type CorpusComparisonResult } from './corpus.js';
 import { type FitResult } from './fit.js';
 import { type FalsifyResult } from './falsify.js';
 import { type RankedCandidate } from './scoring.js';
+import { type ProbeScalarSearchOptions } from './scalar-search.js';
 /** Stop wording when the problem carried no holdout rows. @internal */
 export declare const NO_HOLDOUT_WORDING = "no holdout observations: no candidate was tested on withheld data";
 /**
@@ -20,15 +21,19 @@ export declare const NO_HOLDOUT_WORDING = "no holdout observations: no candidate
  * @internal
  */
 export declare function nodeWorkerArgv(script: string): readonly string[];
+/** The optional settings of one probe search: budget, run id, backend and corpus version. */
 export interface ProbeSearchOptions {
     readonly budget?: SearchBudget;
     readonly runId?: string;
     readonly repositoryCommit?: string;
     readonly holdoutTol?: number;
     readonly backendArgv?: readonly string[];
+    /** Opt-in MathTS scalar-search candidate source (plan task P5). Absent: the search does not run. */
+    readonly scalarSearch?: ProbeScalarSearchOptions;
     readonly corpusVersion?: string;
     readonly now?: string;
 }
+/** The outcome of one probe search: its manifest, candidates, rankings and stop reason. */
 export interface ProbeSearchResult {
     readonly manifest: DiscoveryRunManifest;
     readonly candidates: readonly ProbeCandidateRecord[];

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,EAEV,oBAAoB,EACpB,oBAAoB,EACpB,YAAY,EACZ,aAAa,EACb,gBAAgB,EAChB,oBAAoB,EACrB,MAAM,YAAY,CAAC;AAYpB,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;AAEhF,OAAO,EAIL,KAAK,wBAAwB,EAC9B,MAAM,oBAAoB,CAAC;AAE5B,uEAAuE;AACvE,eAAO,MAAM,kBAAkB,sEAAsE,CAAC;AAEtG;;;GAGG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAEhE;AAED,6FAA6F;AAC7F,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,oGAAoG;IACpG,QAAQ,CAAC,YAAY,CAAC,EAAE,wBAAwB,CAAC;IACjD,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,2FAA2F;AAC3F,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;AAkJD;;;;GAIG;AACH,wBAAsB,cAAc,CAClC,OAAO,EAAE,aAAa,EACtB,IAAI,GAAE,kBAAuB,GAC5B,OAAO,CAAC,iBAAiB,CAAC,CAuT5B"}

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, withinAstCaps, } from './generator.js';
 import { fingerprintExpr, complexityOf, bodyExpression } from './fingerprint.js';
 import { compareToCorpus, corpusPrefactorNotes, corpusRelativeWording, } from './corpus.js';
 import { fitPrefactor } from './fit.js';
@@ -22,6 +22,7 @@ import { openManifest, closeManifest } from './run-manifest.js';
 import { hashCanonical } from './serialize.js';
 import { scoreCandidate, rankPareto } from './scoring.js';
 import { runBackendWorker } from './backend-protocol.js';
+import { SCALAR_SEARCH_ORIGIN, scalarSearchCandidates, UnsupportedScalarFunctionError, } from './scalar-search.js';
 /** Stop wording when the problem carried no holdout rows. @internal */
 export const NO_HOLDOUT_WORDING = 'no holdout observations: no candidate was tested on withheld data';
 /**
@@ -116,6 +117,42 @@ function makeGenerated(expr, problem, runId, at, origin, seq) {
         schemaVersion: SCHEMA_VERSION,
     };
 }
+/**
+ * The manifest's backend list: the native enumerator, then each opted-in source.
+ * `undefined` when no source is opted in, so a default run's manifest is unchanged.
+ */
+function backendDescriptorsFor(opts) {
+    if (!opts.backendArgv && !opts.scalarSearch)
+        return undefined;
+    const list = [
+        {
+            protocolVersion: '0',
+            backendId: 'native',
+            backendVersion: SCHEMA_VERSION,
+            capabilities: ['grammar-enumerator'],
+            deterministic: 'yes',
+        },
+    ];
+    if (opts.backendArgv) {
+        list.push({
+            protocolVersion: '0',
+            backendId: opts.backendArgv.join(' '),
+            backendVersion: 'external',
+            capabilities: ['external-backend'],
+            deterministic: 'unknown',
+        });
+    }
+    if (opts.scalarSearch) {
+        list.push({
+            protocolVersion: '0',
+            backendId: SCALAR_SEARCH_ORIGIN,
+            backendVersion: 'mathts-functions',
+            capabilities: ['scalar-search'],
+            deterministic: 'seeded',
+        });
+    }
+    return list;
+}
 /**
  * Run a bounded Product B search. Never mutates Product A catalogs.
  *
@@ -147,8 +184,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);
@@ -179,6 +222,27 @@ export async function runProbeSearch(problem, opts = {}) {
             }
         }
     }
+    if (opts.scalarSearch && !budgetStopReason(state)) {
+        const remainingMs = Math.max(1, budget.maxWallClockMs - (performance.now() - state.startedAtMs));
+        try {
+            const found = await scalarSearchCandidates(problem, opts.scalarSearch, remainingMs);
+            if (found.note !== undefined)
+                wording.push(found.note);
+            for (const raw of found.raws) {
+                if (budgetStopReason(state))
+                    break;
+                if (!withinAstCaps(raw.expression, budget))
+                    continue;
+                state.candidates += 1;
+                raws.push(raw);
+            }
+        }
+        catch (err) {
+            if (err instanceof UnsupportedScalarFunctionError)
+                throw err;
+            wording.push(`scalar search abstained: ${err instanceof Error ? err.message : String(err)}`);
+        }
+    }
     const open = openManifest({
         runId,
         repositoryCommit: opts.repositoryCommit ?? 'unknown',
@@ -190,24 +254,7 @@ export async function runProbeSearch(problem, opts = {}) {
         tolerances: { holdoutRmse: opts.holdoutTol ?? DEFAULT_HOLDOUT_TOL },
         searchBudget: budget,
         startedAt: at,
-        backendDescriptors: opts.backendArgv
-            ? [
-                {
-                    protocolVersion: '0',
-                    backendId: 'native',
-                    backendVersion: SCHEMA_VERSION,
-                    capabilities: ['grammar-enumerator'],
-                    deterministic: 'yes',
-                },
-                {
-                    protocolVersion: '0',
-                    backendId: opts.backendArgv.join(' '),
-                    backendVersion: 'external',
-                    capabilities: ['external-backend'],
-                    deterministic: 'unknown',
-                },
-            ]
-            : undefined,
+        backendDescriptors: backendDescriptorsFor(opts),
     });
     for (const raw of raws) {
         const stop = budgetStopReason(state);
@@ -215,7 +262,9 @@ export async function runProbeSearch(problem, opts = {}) {
             break;
         const origin = raw.originNote === 'external-backend'
             ? { kind: 'external-backend', backendId: 'external', runId }
-            : { kind: 'grammar-enumerator', runId };
+            : raw.originNote === SCALAR_SEARCH_ORIGIN
+                ? { kind: 'external-backend', backendId: SCALAR_SEARCH_ORIGIN, runId }
+                : { kind: 'grammar-enumerator', runId };
         seq += 1;
         let rec = makeGenerated(raw.expression, problem, runId, at, origin, seq);
         if (seenHash.has(rec.fingerprint.canonicalAstHash))
@@ -259,7 +308,7 @@ export async function runProbeSearch(problem, opts = {}) {
         }
         rec = applyStatus(rec, 'structurally-valid', 'validate() ok', runId, at);
         store.replace(rec);
-        const corp = compareToCorpus(bodyExpression(rec.body), corpusVersion);
+        const corp = compareToCorpus(bodyExpression(rec.body), corpusVersion, at);
         corpus[rec.id] = corp;
         wording.push(corpusRelativeWording(corp));
         const known = corp.algebraicMatches.length > 0;
@@ -303,7 +352,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 +401,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' ||