universal-physics-tensor 9.0.0 → 11.0.0

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

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

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

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

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"power-law.js","sourceRoot":"","sources":["../../../src/composition/probe/power-law.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,iCAAiC,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,uBAAuB,EAAgB,MAAM,iCAAiC,CAAC;AAuCtG,kEAAkE;AAClE,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAC;AAQ1C;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAS,EAAE,GAAW,EAAE,MAAM,GAAG,wBAAwB;IAC1F,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAClD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YACnD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpG,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,CAAS,EAAE,GAAW,EAAE,MAAM,GAAG,wBAAwB;IAC3F,MAAM,GAAG,GAAG,kBAAkB,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IAC/C,OAAO,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAC3C,CAAC;AAED,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS;IAC/B,OAAO,CAAC,KAAK,CAAC;QAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AASD;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,MAA8B,EAAE,SAA4C;IACtG,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAC9D,MAAM,MAAM,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC;IAChD,MAAM,WAAW,GAA6B,EAAE,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,YAAY,CAAC,CAAC,GAAG,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC;YAAE,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,GAAG,GAAG,uBAAuB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACzD,MAAM,IAAI,GAA2B,EAAE,CAAC;IACxC,IAAI,GAAG,CAAC,UAAU,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,SAAS;YAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IAC1B,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAChC,CAAC;AAED,iFAAiF;AACjF,SAAS,aAAa,CAAC,SAA2C,EAAE,GAAmB;IACrF,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAClD,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACtB,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QACpB,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,GAAG,CAAC;QAChC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACd,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAUD,gGAAgG;AAChG,MAAM,UAAU,SAAS,CAAC,MAA0B,EAAE,IAA+B;IACnF,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/D,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACnD,OAAO,IAAI,CAAC,CAAC;YACb,SAAS;QACX,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC;AAClD,CAAC;AAED,0HAA0H;AAC1H,SAAS,YAAY,CAAC,IAAoC;IACxD,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;IAC/B,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3G,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AAC5B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,MAAiB;IAC7C,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACvC,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7C,MAAM,CAAC,GAAY,UAAU,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,SAAS,CAAC,sCAAsC,CAAC,CAAC;IAC/G,OAAO,CAAC,CAAC;AACX,CAAC;AAED,qEAAqE;AACrE,SAAS,QAAQ,CAAC,GAAY,EAAE,CAAS;IACvC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,MAAM,CAAC,GAAY,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1B,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAChE,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CAAC,OAAsB;IAC1D,MAAM,IAAI,GAAG,uBAAuB,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;IACxE,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACpB,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,2FAA2F,EAAE,CAAC;IACzI,CAAC;IACD,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,WAAW,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;IACxE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,qEAAqE,EAAE,CAAC;IACnH,CAAC;IACD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,sEAAsE,EAAE,CAAC;IACpH,CAAC;IACD,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC;IAC7C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,mDAAmD,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;IACtH,CAAC;IACD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,MAAM,CAAC,GAAe,EAAE,CAAC;IACzB,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/D,IAAI,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACvI,OAAO,IAAI,CAAC,CAAC;YACb,SAAS;QACX,CAAC;QACD,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,OAAO,GAAG,CAAC,MAAc,EAAyB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC;IAC9H,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACjB,OAAO,OAAO,CAAC,QAAQ,IAAI,gEAAgE,CAAC,wDAAwD,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/J,CAAC;IACD,8FAA8F;IAC9F,+FAA+F;IAC/F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,iFAAiF;QACjF,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;QAC5E,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;QAC5E,IAAI,EAAE,GAAG,EAAE,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC/D,OAAO,OAAO,CAAC,WAAW,MAAM,CAAC,CAAC,CAAE,CAAC,OAAO,0EAA0E,CAAC,CAAC;QAC1H,CAAC;IACH,CAAC;IACD,6FAA6F;IAC7F,4FAA4F;IAC5F,2FAA2F;IAC3F,4FAA4F;IAC5F,uGAAuG;IACvG,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC3C,IAAI,GAAG,CAAC;IACR,IAAI,CAAC;QACH,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC/C,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,OAAO,CAAC,8CAA+C,CAAW,CAAC,OAAO,uCAAuC,CAAC,CAAC;IAC5H,CAAC;IACD,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,EAAE,GAAG,OAAO,GAAG,CAAC,EAAE,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACjF,IAAI,YAAY,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI;QAAE,OAAO,OAAO,CAAC,8CAA8C,CAAC,CAAC;IACzG,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI;YAAE,OAAO,OAAO,CAAC,0EAA0E,MAAM,CAAC,CAAC,CAAE,CAAC,OAAO,EAAE,CAAC,CAAC;QAC9I,MAAM,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QAChC,MAAM,MAAM,GAAG,EAAE,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QAC/B,6FAA6F;QAC7F,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,IAAI,GAAG,kBAAkB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACrD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACzB,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,QAAQ,GAAG,CAAC,GAAG,MAAM,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC3J,MAAM,KAAK,GAAG,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;QACtE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,OAAO,CAAC,mBAAmB,KAAK,CAAC,OAAO,OAAO,KAAK,oDAAoD,wBAAwB,EAAE,CAAC,CAAC;QAC7I,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClI,OAAO,OAAO,CACZ,mBAAmB,KAAK,CAAC,OAAO,OAAO,KAAK,2BAA2B,IAAI,CAAC,MAAM,iCAAiC,wBAAwB,KAAK,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,oCAAoC,CACxN,CAAC;QACJ,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAA2B,EAAE,GAAG,IAAI,EAAE,CAAC;IACrD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,QAAS,CAAC,SAAS,GAAG,CAAC,CAAC,QAAS,CAAC,WAAW,CAAC;QAC1D,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACtG,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AACzG,CAAC;AAED,gGAAgG;AAChG,MAAM,UAAU,eAAe,CAAC,EAAyB;IACvD,IAAI,EAAE,CAAC,IAAI,KAAK,gBAAgB;QAAE,OAAO,IAAI,CAAC;IAC9C,IAAI,EAAE,CAAC,IAAI,KAAK,WAAW;QAAE,OAAO,2CAA2C,EAAE,CAAC,MAAM,EAAE,CAAC;IAC3F,MAAM,KAAK,GAAG,EAAE,CAAC,SAAS;SACvB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACT,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,QAAS,CAAC;QACrD,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,OAAO,IAAI,CAAC,CAAC,KAAK,MAAM,IAAI,UAAU,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC;IAClG,CAAC,CAAC;SACD,IAAI,CAAC,KAAK,CAAC,CAAC;IACf,OAAO,+CAA+C,KAAK,UAAU,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,KAAK,UAAU,EAAE,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,WAAW,yBAAyB,CAAC,CAAC,CAAC,EAAE,sDAAsD,wBAAwB,uBAAuB,CAAC;AAChS,CAAC","sourcesContent":["/**\n * Power-law discovery over the Buckingham π-groups (proposal 8 of\n * docs/planning/2026-10-15-map-maker-discoverer-proposals.md).\n *\n * When the governing variables leave k ≥ 1 dimensionless groups, dimensional\n * analysis fixes the target only as `base · F(π₁, …, πₖ)` for an unknown F.\n * This module fits the one family a monomial search can state, F = C Π πₖ^{aₖ}:\n * `log(y/base) = log C + Σ aₖ log πₖ` by MathTS `ols` on the exploratory rows,\n * reads the coefficients and their standard errors back, and rationalises each\n * aₖ that lies within 2·stderr of a fraction with denominator ≤ 6 (a bounded\n * scan, not `Fraction.fromNumber`, whose continued fraction can exceed its\n * cap). An exponent that is not such a fraction is a NEGATIVE RESULT stated in\n * the abstention, not a candidate with a decimal exponent.\n *\n * The fit reads `problem.exploratory` only: the holdout rows are never seen\n * here, exactly as `fit.ts` never fits them.\n *\n * @internal\n */\n\nimport { matrixRank, ols } from '@danielsimonjr/mathts-functions';\nimport { buckinghamPi, dimensionallyDetermines, type PiGroup } from '../../dimensional/buckingham.js';\nimport type { DimensionalVariableRef, ObservationRow, SearchProblem } from './types.js';\n\n/** One fitted π-group exponent: the estimate, its standard error, the 2σ interval and the fraction chosen in it. @internal */\nexport interface PowerLawExponent {\n  /** The π-group's display form, e.g. `a · b^-1`. */\n  readonly group: string;\n  /** The π-group's integer exponent per variable. */\n  readonly exponents: Readonly<Record<string, number>>;\n  readonly estimate: number;\n  readonly stderr: number;\n  /** estimate ± 2·stderr. */\n  readonly interval: readonly [number, number];\n  /** The fraction with the smallest denominator ≤ 6 inside the interval; null when there is none. */\n  readonly rational: { readonly numerator: number; readonly denominator: number } | null;\n}\n\n/** A recovered rational power law: `monomial` is base + Σ (pₖ/qₖ)·πₖ per variable. @internal */\nexport interface PowerLawFit {\n  readonly kind: 'fit';\n  /** The base monomial of the target over a maximal dimensionally independent subset of the governing set. */\n  readonly base: Readonly<Record<string, number>>;\n  readonly exponents: readonly PowerLawExponent[];\n  /** log C of the fit (the prefactor is refit on the linear scale by the pipeline, like any candidate's). */\n  readonly logPrefactor: number;\n  readonly r2: number;\n  /** Rows the fit used: a positive finite observation, base and every π. */\n  readonly nRows: number;\n  readonly skippedRows: number;\n  /** The combined exponent per governing variable, rational values as numbers. */\n  readonly monomial: Readonly<Record<string, number>>;\n}\n\n/** The outcome of {@link powerLawDetermination}. @internal */\nexport type PowerLawDetermination =\n  | PowerLawFit\n  | { readonly kind: 'not-applicable'; readonly reason: string }\n  | { readonly kind: 'abstained'; readonly reason: string; readonly nRows: number; readonly skippedRows: number };\n\n/** The largest denominator the exponent scan admits. @internal */\nexport const MAX_EXPONENT_DENOMINATOR = 6;\n\n/** A reduced fraction. @internal */\nexport interface Rational {\n  readonly numerator: number;\n  readonly denominator: number;\n}\n\n/**\n * Every distinct reduced fraction p/q with q ≤ `maxDen` within `tol` of `x`,\n * in order of denominator (so 1/2 comes before 2/3). Empty when none is near;\n * more than one when the tolerance is too wide to tell them apart. @internal\n */\nexport function rationalCandidates(x: number, tol: number, maxDen = MAX_EXPONENT_DENOMINATOR): Rational[] {\n  if (!Number.isFinite(x) || !(tol >= 0)) return [];\n  const out: Rational[] = [];\n  for (let d = 1; d <= maxDen; d++) {\n    const lo = Math.ceil((x - tol) * d);\n    const hi = Math.floor((x + tol) * d);\n    for (let n = lo; n <= hi; n++) {\n      const g = gcd(Math.abs(n), d);\n      const r = { numerator: n / g, denominator: d / g };\n      if (!out.some((o) => o.numerator === r.numerator && o.denominator === r.denominator)) out.push(r);\n    }\n  }\n  return out;\n}\n\n/**\n * The one fraction p/q with q ≤ `maxDen` within `tol` of `x`, or null when\n * there is none or more than one (an estimate whose interval holds two\n * admissible fractions does not determine either). @internal\n */\nexport function rationalizeExponent(x: number, tol: number, maxDen = MAX_EXPONENT_DENOMINATOR): Rational | null {\n  const all = rationalCandidates(x, tol, maxDen);\n  return all.length === 1 ? all[0]! : null;\n}\n\nfunction gcd(a: number, b: number): number {\n  while (b !== 0) [a, b] = [b, a % b];\n  return a === 0 ? 1 : a;\n}\n\n/** The π-groups of the governing set and the target's base monomial over a maximal dimensionally independent subset. @internal */\nexport interface PiStructure {\n  readonly groups: readonly PiGroup[];\n  /** Null when the target's dimension is not in the span of the governing variables. */\n  readonly base: Readonly<Record<string, number>> | null;\n}\n\n/**\n * The π-groups among the governing variables (MathTS `rationalNullspace`\n * through {@link buckinghamPi}) and the base monomial: the unique monomial of\n * the target over the first maximal dimensionally independent subset of the\n * governing set, in declared order. @internal\n */\nexport function piStructure(target: DimensionalVariableRef, governing: readonly DimensionalVariableRef[]): PiStructure {\n  if (governing.length === 0) return { groups: [], base: null };\n  const groups = buckinghamPi(governing).piGroups;\n  const independent: DimensionalVariableRef[] = [];\n  for (const g of governing) {\n    if (buckinghamPi([...independent, g]).piGroupCount === 0) independent.push(g);\n  }\n  const det = dimensionallyDetermines(target, independent);\n  const base: Record<string, number> = {};\n  if (det.determined && det.monomial) {\n    for (const g of governing) base[g.name] = det.monomial[g.name] ?? 0;\n    return { groups, base };\n  }\n  return { groups, base: null };\n}\n\n/** `Π row[name]^exp` over the non-zero exponents; NaN when a name is missing. */\nfunction monomialValue(exponents: Readonly<Record<string, number>>, row: ObservationRow): number {\n  let v = 1;\n  for (const [name, e] of Object.entries(exponents)) {\n    if (e === 0) continue;\n    const x = row[name];\n    if (x === undefined) return NaN;\n    v *= x ** e;\n  }\n  return v;\n}\n\n/** The log-design of a set of rows: `[1, log π₁, …, log πₖ]` per usable row. @internal */\nexport interface LogDesign {\n  readonly rows: readonly (readonly number[])[];\n  /** Rows where every π-group is positive and finite. */\n  readonly used: number;\n  readonly skipped: number;\n}\n\n/** The log-design matrix over the rows where every π-group is positive and finite. @internal */\nexport function logDesign(groups: readonly PiGroup[], rows: readonly ObservationRow[]): LogDesign {\n  const out: number[][] = [];\n  let skipped = 0;\n  for (const row of rows) {\n    const pis = groups.map((g) => monomialValue(g.exponents, row));\n    if (!pis.every((p) => Number.isFinite(p) && p > 0)) {\n      skipped += 1;\n      continue;\n    }\n    out.push([1, ...pis.map((p) => Math.log(p))]);\n  }\n  return { rows: out, used: out.length, skipped };\n}\n\n/** Each column divided by its largest magnitude (a zero column stays zero): order one, as `ols` and `matrixRank` need. */\nfunction scaleColumns(rows: readonly (readonly number[])[]): { scaled: number[][]; scales: number[] } {\n  const k = rows[0]?.length ?? 0;\n  const scales = Array.from({ length: k }, (_, j) => rows.reduce((m, r) => Math.max(m, Math.abs(r[j]!)), 0));\n  const scaled = rows.map((r) => r.map((v, j) => (scales[j]! > 0 ? v / scales[j]! : 0)));\n  return { scaled, scales };\n}\n\n/**\n * The rank of a log-design (MathTS `matrixRank`, whose tolerance is an absolute\n * 1e-10, so the columns are scaled to order one first). 0 for no rows. @internal\n */\nexport function logDesignRank(design: LogDesign): number {\n  if (design.rows.length === 0) return 0;\n  const { scaled } = scaleColumns(design.rows);\n  const r: unknown = matrixRank(scaled);\n  if (typeof r !== 'number' || !Number.isInteger(r)) throw new TypeError('matrixRank did not return an integer');\n  return r;\n}\n\n/** A finite number read back from a MathTS result array, or null. */\nfunction numberAt(arr: unknown, i: number): number | null {\n  if (!Array.isArray(arr)) return null;\n  const v: unknown = arr[i];\n  return typeof v === 'number' && Number.isFinite(v) ? v : null;\n}\n\n/**\n * Fit `log(y/base) = log C + Σ aₖ log πₖ` on the exploratory rows and\n * rationalise the exponents (module docs). Not applicable when the governing\n * set already fixes the target (the unique-monomial path searches that), when\n * it leaves no π-group, or when the target is outside its span. Abstains, with\n * the reason, without exploratory rows, below k + 2 usable rows, when a\n * π-group does not vary, when the log-design is collinear, or when an exponent\n * is not within 2σ of a fraction with denominator ≤ 6. @internal\n */\nexport function powerLawDetermination(problem: SearchProblem): PowerLawDetermination {\n  const full = dimensionallyDetermines(problem.target, problem.governing);\n  if (full.determined) {\n    return { kind: 'not-applicable', reason: 'the governing set fixes the target up to a constant; the unique-monomial path searches it' };\n  }\n  const { groups, base } = piStructure(problem.target, problem.governing);\n  if (groups.length === 0) {\n    return { kind: 'not-applicable', reason: 'the governing set leaves no dimensionless group to raise to a power' };\n  }\n  if (base === null) {\n    return { kind: 'not-applicable', reason: \"the target's dimension is not in the span of the governing variables\" };\n  }\n  const rows = problem.exploratory?.rows ?? [];\n  if (rows.length === 0) {\n    return { kind: 'abstained', reason: 'no exploratory rows: the power-law fit needs data', nRows: 0, skippedRows: 0 };\n  }\n  const k = groups.length;\n  const X: number[][] = [];\n  const ylog: number[] = [];\n  let skipped = 0;\n  for (const row of rows) {\n    const y = row[problem.target.name];\n    const b = monomialValue(base, row);\n    const pis = groups.map((g) => monomialValue(g.exponents, row));\n    if (!(y !== undefined && Number.isFinite(y) && y > 0 && Number.isFinite(b) && b > 0) || !pis.every((p) => Number.isFinite(p) && p > 0)) {\n      skipped += 1;\n      continue;\n    }\n    X.push(pis.map((p) => Math.log(p)));\n    ylog.push(Math.log(y / b));\n  }\n  const used = X.length;\n  const abstain = (reason: string): PowerLawDetermination => ({ kind: 'abstained', reason, nRows: used, skippedRows: skipped });\n  if (used < k + 2) {\n    return abstain(`only ${used} usable row(s) (positive observation, base and π-groups) for ${k} exponent(s) and a prefactor; the fit needs at least ${k + 2}`);\n  }\n  // A π-group whose log spreads by no more than round-off (1e-12 of its magnitude, or absolute)\n  // does not vary: a/b with b = a is 1 up to an ulp, and that ulp is not an exponent's evidence.\n  for (let j = 0; j < k; j++) {\n    // Reductions, not spreads: a spread of a large row set overflows the call stack.\n    const lo = X.reduce((m, r) => Math.min(m, r[j]!), Number.POSITIVE_INFINITY);\n    const hi = X.reduce((m, r) => Math.max(m, r[j]!), Number.NEGATIVE_INFINITY);\n    if (hi - lo <= 1e-12 * Math.max(1, Math.abs(hi), Math.abs(lo))) {\n      return abstain(`π-group ${groups[j]!.formula} does not vary over the usable rows, so its exponent is not identifiable`);\n    }\n  }\n  // Columns scaled to order one. History: before @danielsimonjr/mathts-functions 0.68.4, `ols`\n  // tested singularity with an absolute 1e-15, so a column of log π of magnitude 1e-9 read as\n  // collinear unscaled. From 0.68.4 (installed) `ols` equilibrates the design itself, and an\n  // unscaled 1e-9 column fits without throwing. The scaling stays, because it also conditions\n  // `matrixRank` (logDesignRank, which scales the same way). Coefficients and errors are unscaled after.\n  const { scaled, scales } = scaleColumns(X);\n  let fit;\n  try {\n    fit = ols(scaled, ylog, { intercept: true });\n  } catch (e) {\n    return abstain(`the log-design is collinear over the rows (${(e as Error).message}); the exponents are not identifiable`);\n  }\n  const logPrefactor = numberAt(fit.coefficients, 0);\n  const r2 = typeof fit.r2 === 'number' && Number.isFinite(fit.r2) ? fit.r2 : null;\n  if (logPrefactor === null || r2 === null) return abstain('ols did not return a finite intercept and R²');\n  const exponents: PowerLawExponent[] = [];\n  for (let j = 0; j < k; j++) {\n    const c = numberAt(fit.coefficients, j + 1);\n    const se = numberAt(fit.stderr, j + 1);\n    if (c === null || se === null) return abstain(`ols did not return a finite coefficient and standard error for π-group ${groups[j]!.formula}`);\n    const estimate = c / scales[j]!;\n    const stderr = se / scales[j]!;\n    // Noise-free rows give stderr 0; a representation tolerance keeps 0.5000000000000001 at 1/2.\n    const tol = Math.max(2 * stderr, 1e-9 * Math.max(1, Math.abs(estimate)));\n    const near = rationalCandidates(estimate, tol);\n    const rational = near.length === 1 ? near[0]! : null;\n    const group = groups[j]!;\n    exponents.push({ group: group.formula, exponents: group.exponents, estimate, stderr, interval: [estimate - 2 * stderr, estimate + 2 * stderr], rational });\n    const value = `${estimate.toPrecision(4)} ± ${stderr.toPrecision(2)}`;\n    if (near.length === 0) {\n      return abstain(`the exponent of ${group.formula} is ${value}, not within 2σ of a fraction with denominator ≤ ${MAX_EXPONENT_DENOMINATOR}`);\n    }\n    if (near.length > 1) {\n      const list = near.slice(0, 4).map((r) => (r.denominator === 1 ? `${r.numerator}` : `${r.numerator}/${r.denominator}`)).join(', ');\n      return abstain(\n        `the exponent of ${group.formula} is ${value}: its 2σ interval holds ${near.length} fractions with denominator ≤ ${MAX_EXPONENT_DENOMINATOR} (${list}${near.length > 4 ? ', …' : ''}), so the rows do not determine it`,\n      );\n    }\n  }\n  const monomial: Record<string, number> = { ...base };\n  for (const e of exponents) {\n    const a = e.rational!.numerator / e.rational!.denominator;\n    for (const [name, p] of Object.entries(e.exponents)) monomial[name] = (monomial[name] ?? 0) + a * p;\n  }\n  return { kind: 'fit', base, exponents, logPrefactor, r2, nRows: used, skippedRows: skipped, monomial };\n}\n\n/** One line for a run's wording: what the power-law fit found or why it abstained. @internal */\nexport function powerLawWording(pl: PowerLawDetermination): string | null {\n  if (pl.kind === 'not-applicable') return null;\n  if (pl.kind === 'abstained') return `no power law from the exploratory rows: ${pl.reason}`;\n  const terms = pl.exponents\n    .map((e) => {\n      const { numerator: p, denominator: q } = e.rational!;\n      const frac = q === 1 ? `${p}` : `${p}/${q}`;\n      return `(${e.group})^(${frac}) [a = ${e.estimate.toPrecision(3)} ± ${e.stderr.toPrecision(2)}]`;\n    })\n    .join(' · ');\n  return `power law from the exploratory rows: base · ${terms}; R² = ${pl.r2.toPrecision(4)} on ${pl.nRows} row(s)${pl.skippedRows > 0 ? ` (${pl.skippedRows} skipped: non-positive)` : ''}; each exponent is the fraction with denominator ≤ ${MAX_EXPONENT_DENOMINATOR} within 2σ of the fit`;\n}\n"]}

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

@@ -9,6 +9,14 @@ import type { DiscrepancyDefinition, FrontierGap, FrontierGapKind, SearchProblem
 export declare function isGapKind(s: string): s is FrontierGapKind;
 /** Residual / unexplained-observation gap template. @internal */
 export declare function makeResidualGap(id: string, summary: string, kind?: FrontierGapKind): FrontierGap;
+/**
+ * A JSON file that is not a search-problem file, or not an expression file: a field it must carry
+ * is missing or holds a value of another kind. The message names the field; it never reports what
+ * a JavaScript engine said on reading it. @internal
+ */
+export declare class ProblemFileError extends Error {
+    constructor(message: string);
+}
 export interface ProblemFile {
     readonly gap?: {
         readonly id?: string;
@@ -42,6 +50,9 @@ export declare function loadSearchProblemFromJson(path: string): SearchProblem;
 export declare function resolveObservationsPath(raw: Pick<ProblemFile, 'observationsPath'>, source?: string): string | null;
 /** Build a SearchProblem from an already-parsed problem file. @internal */
 export declare function searchProblemFromFile(raw: ProblemFile, source?: string): SearchProblem;
-/** Load an ExprNode from a JSON file (`{expression}` wrapper or bare node). @internal */
+/**
+ * Load an ExprNode from a JSON file (`{expression}` wrapper or bare node). The node shape is
+ * checked recursively; a file that is not an expression raises {@link ProblemFileError}. @internal
+ */
 export declare function parseExprJson(path: string): ExprNode;
 //# sourceMappingURL=problem.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"problem.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/problem.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,KAAK,EAEV,qBAAqB,EACrB,WAAW,EACX,eAAe,EAEf,aAAa,EACd,MAAM,YAAY,CAAC;AAIpB,gGAAgG;AAChG,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,IAAI,eAAe,CAazD;AAED,iEAAiE;AACjE,wBAAgB,eAAe,CAC7B,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,MAAM,EACf,IAAI,GAAE,eAA2C,GAChD,WAAW,CAuBb;AAMD,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,GAAG,CAAC,EAAE;QACb,QAAQ,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;QACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QACvB,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;KAC3B,CAAC;IACF,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IACjE,QAAQ,CAAC,SAAS,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC/E,QAAQ,CAAC,WAAW,CAAC,EAAE,OAAO,CAAC;IAC/B,QAAQ,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,qBAAqB,CAAC;IAC7C,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;IAC1C,QAAQ,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D,QAAQ,CAAC,qBAAqB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACpD;AAED,yFAAyF;AACzF,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,CAGrE;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,EAAE,kBAAkB,CAAC,EAAE,MAAM,SAAW,GAAG,MAAM,GAAG,IAAI,CAKpH;AAED,2EAA2E;AAC3E,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,WAAW,EAAE,MAAM,SAAW,GAAG,aAAa,CAoCxF;AAiCD,yFAAyF;AACzF,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,CAYpD"}
+{"version":3,"file":"problem.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/problem.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,KAAK,EAEV,qBAAqB,EACrB,WAAW,EACX,eAAe,EAEf,aAAa,EACd,MAAM,YAAY,CAAC;AAIpB,gGAAgG;AAChG,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,IAAI,eAAe,CAazD;AAED,iEAAiE;AACjE,wBAAgB,eAAe,CAC7B,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,MAAM,EACf,IAAI,GAAE,eAA2C,GAChD,WAAW,CAuBb;AAED;;;;GAIG;AACH,qBAAa,gBAAiB,SAAQ,KAAK;IACzC,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAiCD,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,GAAG,CAAC,EAAE;QACb,QAAQ,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;QACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QACvB,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;KAC3B,CAAC;IACF,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IACjE,QAAQ,CAAC,SAAS,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC/E,QAAQ,CAAC,WAAW,CAAC,EAAE,OAAO,CAAC;IAC/B,QAAQ,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC;IAC7B,QAAQ,CAAC,WAAW,CAAC,EAAE,qBAAqB,CAAC;IAC7C,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;IAC1C,QAAQ,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D,QAAQ,CAAC,qBAAqB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACpD;AAED,yFAAyF;AACzF,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,CAGrE;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,EAAE,kBAAkB,CAAC,EAAE,MAAM,SAAW,GAAG,MAAM,GAAG,IAAI,CAKpH;AAED,2EAA2E;AAC3E,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,WAAW,EAAE,MAAM,SAAW,GAAG,aAAa,CAiExF;AA+ID;;;GAGG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,CAOpD"}