@tangle-network/agent-eval 0.221.7 → 0.222.0

package/dist/{tree-DSqwJpL9.js → tree-DrIChF4a.js}

@@ -1,14 +1,14 @@
-import { a as hashCanonical, i as compareCodeUnits, r as canonicalString } from "./canonical-Dq2hOQ8L.js";
-import { a as medianInPlace, s as zQuantile } from "./internal-BTK91Bqt.js";
-import { t as mulberry32 } from "./random-DDDcC7YU.js";
-import { r as holm } from "./multiplicity-Sg0U7h8j.js";
-import { o as pairedSignTest, r as DECISION_PAIRED_DELTA_STATISTIC, t as mean } from "./mean-BbA_JCzW.js";
-import { i as pairedDeltaTest, r as minimumPairsForPairedDeltaTest } from "./paired-promotion-decision-D0SHb-ZL.js";
-import { A as normalizeSignedZero, D as searchEstimateMethod, O as searchPosterior, b as verifySearchClaim, d as rankingSplit, f as summarizeSamples, k as seedFromDigest, n as paretoFrontier, o as searchPolicyView, u as INSUFFICIENT_FROM, w as estimateNode } from "./pareto-BiBnQXAE.js";
-import { l as searchUnitScores } from "./search-ledger-CZRqtFbW.js";
-import { t as roundDecimal } from "./round-decimal-COrKglMh.js";
+import { a as hashCanonical, i as compareCodeUnits, r as canonicalString } from "./canonical-CicJlINA.js";
+import { a as medianInPlace, s as zQuantile } from "./internal-v6XfOeJW.js";
+import { t as mulberry32 } from "./random-DrzcgC7F.js";
+import { r as holm } from "./multiplicity-DAd4xaDC.js";
+import { o as pairedSignTest, r as DECISION_PAIRED_DELTA_STATISTIC, t as mean } from "./mean-CdDYG-us.js";
+import { i as pairedDeltaTest, r as minimumPairsForPairedDeltaTest } from "./paired-promotion-decision-FGvHA4p_.js";
+import { A as normalizeSignedZero, D as searchEstimateMethod, O as searchPosterior, b as verifySearchClaim, d as rankingSplit, f as summarizeSamples, k as seedFromDigest, n as paretoFrontier, o as searchPolicyView, u as INSUFFICIENT_FROM, w as estimateNode } from "./pareto-B9udAt2i.js";
+import { l as searchUnitScores } from "./search-ledger-BsVi-Ngv.js";
+import { t as roundDecimal } from "./round-decimal-ZmjAQPo1.js";
 import { defineInlineResource } from "@tangle-network/agent-interface";
-//#region src/search/lenses/edit-credit-content.ts
+// src/search/lenses/edit-credit-content.ts
 function nodeContent(options, ref) {
 	const body = options.readArtifact(ref);
 	if (body === void 0) return {
@@ -189,8 +189,7 @@ function matches(a, b) {
 	}
 	return pairs.reverse();
 }
-//#endregion
-//#region src/search/lenses/edit-credit-contract.ts
+// src/search/lenses/edit-credit-contract.ts
 const CONFIDENCE = .95;
 const RESAMPLES = 2e3;
 const DESCRIPTIVE_FROM = minimumPairsForPairedDeltaTest(CONFIDENCE);
@@ -227,8 +226,7 @@ const EDIT_CREDIT_ESTIMATOR = {
 	uri: "npm:@tangle-network/agent-eval/search#editCredit",
 	revision: hashCanonical(CREDIT_DEFINITION)
 };
-//#endregion
-//#region src/search/lenses/edit-credit-lineage.ts
+// src/search/lenses/edit-credit-lineage.ts
 function lineageParents(state, edge, child, byId) {
 	const parents = [];
 	for (const parent of edge.parents) {
@@ -275,8 +273,7 @@ function appendTo(map, key, value) {
 function compareOrder(left, right) {
 	return left[0] - right[0] || left[1] - right[1];
 }
-//#endregion
-//#region src/search/lenses/edit-credit-skills.ts
+// src/search/lenses/edit-credit-skills.ts
 /** Turn linked reusable insert genes into inline skill resources. */
 function skills(genes, records, subject, split) {
 	const byGroup = /* @__PURE__ */ new Map();
@@ -311,8 +308,7 @@ function skills(genes, records, subject, split) {
 	}
 	return candidates;
 }
-//#endregion
-//#region src/search/lenses/edit-credit-statistics.ts
+// src/search/lenses/edit-credit-statistics.ts
 /** Paired gene contrasts, reusable-by-chance rates, and Holm-corrected interactions. */
 function pairedEstimate(input) {
 	const pairs = input.carrier.length;
@@ -530,8 +526,7 @@ function interactionEstimate(genes, steps, values, sign) {
 		synergy: sign * interaction > 0
 	};
 }
-//#endregion
-//#region src/search/lenses/edit-credit-text.ts
+// src/search/lenses/edit-credit-text.ts
 /** The lens as compact text: what `agent-eval search show --edit-credit`
 * prints and a proposer can read. */
 function editCreditText(result, options = {}) {
@@ -587,8 +582,7 @@ function formatEstimate(estimate) {
 	if (estimate.method === "descriptive") return `${delta}${interval} descriptive, sign p=${estimate.exactSignP === null ? "null" : estimate.exactSignP.toPrecision(3)} (${units})`;
 	return `${delta}${interval} bootstrap (${units})`;
 }
-//#endregion
-//#region src/search/lenses/edit-credit.ts
+// src/search/lenses/edit-credit.ts
 /**
 * The edit-credit lens. Pure: the result depends only on `state` and what
 * `readArtifact` returns for its references.
@@ -1010,8 +1004,7 @@ function memo(compute) {
 		return value;
 	};
 }
-//#endregion
-//#region src/search/lenses/front.ts
+// src/search/lenses/front.ts
 /**
 * `front(state, axes)`: the Pareto front over a node's score and its known
 * cost per cell, with room for caller-declared axes (search-tree-design §12).
@@ -1112,8 +1105,7 @@ function front(state, options = {}) {
 		}
 	};
 }
-//#endregion
-//#region src/search/lenses/geometry.ts
+// src/search/lenses/geometry.ts
 /** Attempts the kernel gives a retryable errored cell by default. */
 /**
 * Nodes whose screen finished, in registration order, root first: the
@@ -1167,8 +1159,7 @@ function positiveInteger(owner, name, value) {
 function plural(count, one, many = `${one}s`) {
 	return `${count} ${count === 1 ? one : many}`;
 }
-//#endregion
-//#region src/search/lenses/landscape-contract.ts
+// src/search/lenses/landscape-contract.ts
 const GRID_METHOD = "Gaussian-process regression (ordinary kriging) of node scores: a constant mean (generalized least squares), a squared-exponential covariance whose prior variance is the between-node variance of the scores minus their mean noise and whose length scale maximizes the marginal likelihood over 0.5, 1, 2 and 4 times the median nearest-neighbour distance, and each node's own noise variance (the pooled between-unit variance over its units shared with the root; the root is the reference at exactly 0); nodes with fewer than 2 shared units, and nodes decided invalid, are left out; a cell is null where the posterior variance exceeds half the prior variance, so the surface never extends past the nodes that support it; no surface is drawn unless the length scale raises the log-likelihood by 1 or more over independent node scores";
 /** Scored nodes a surface or a basin count needs: the library's minimum
 * sample for anything descriptive, as for units. */
@@ -1178,8 +1169,7 @@ const BASIN_METHOD = "0-dimensional persistence of node scores on the symmetric
 const BASIN_NODES = 2e3;
 /** Family-wise rate of a spurious basin on a flat landscape. */
 const BASIN_ALPHA = .05;
-//#endregion
-//#region src/search/lenses/landscape-basins.ts
+// src/search/lenses/landscape-basins.ts
 /** Persistent score peaks over a connected symmetric nearest-neighbour graph. */
 function graphBasins(records, scoredNodes, fullOf, space, pooledVariance, degreesOfFreedom) {
 	const empty = (reason) => ({
@@ -1360,8 +1350,7 @@ function euclidean(left, right) {
 	for (let d = 0; d < left.length; d++) sum += (left[d] - (right[d] ?? 0)) ** 2;
 	return Math.sqrt(sum);
 }
-//#endregion
-//#region src/search/lenses/landscape-embeddings.ts
+// src/search/lenses/landscape-embeddings.ts
 /** The default: edits recorded between two profiles along the lineage. */
 function lineageEdits() {
 	return {
@@ -1472,8 +1461,7 @@ function lineEditDistance(a, b) {
 	}
 	return max;
 }
-//#endregion
-//#region src/math/symmetric-eigen.ts
+// src/math/symmetric-eigen.ts
 const MAX_SWEEPS = 100;
 /** Eigenvalues and eigenvectors of a symmetric matrix, largest value first. */
 function symmetricEigen(matrix) {
@@ -1535,8 +1523,7 @@ function orient$1(vector) {
 	for (let index = 1; index < vector.length; index++) if (Math.abs(vector[index]) > Math.abs(vector[pivot]) + 1e-12) pivot = index;
 	return (vector[pivot] ?? 0) < 0 ? vector.map((value) => value === 0 ? 0 : -value) : vector;
 }
-//#endregion
-//#region src/search/lenses/landscape-placement.ts
+// src/search/lenses/landscape-placement.ts
 function placeNodes(nodes, index, rootNodeId, embed, landmarkCap, adjacency) {
 	const n = nodes.length;
 	const distancesFrom = distanceRows(nodes, embed, adjacency);
@@ -1697,8 +1684,7 @@ function distanceRows(nodes, embed, adjacency) {
 	}
 	return (from) => nodes.map((node, j) => j === from ? 0 : embed.distance(nodes[from], node));
 }
-//#endregion
-//#region src/math/cholesky.ts
+// src/math/cholesky.ts
 /**
 * Cholesky factorization and solves for small symmetric positive-definite
 * systems (Golub and Van Loan, Matrix Computations, 4th ed., §4.2), the
@@ -1757,8 +1743,7 @@ function choleskyBackward(lower, z) {
 	}
 	return x;
 }
-//#endregion
-//#region src/search/lenses/landscape-text.ts
+// src/search/lenses/landscape-text.ts
 /** Render the checked landscape data and its supported grid as compact text. */
 const SHADES = " .:-=+*#%@";
 /** The landscape as text for a terminal or a proposer's context: the same
@@ -1842,8 +1827,7 @@ function cellOf(grid, x, y) {
 	const r = Math.min(grid.rows - 1, Math.max(0, Math.floor((y - grid.y[0]) / (grid.y[1] - grid.y[0]) * grid.rows)));
 	return grid.values[r][c] === null ? null : r * grid.columns + c;
 }
-//#endregion
-//#region src/search/lenses/landscape-surface.ts
+// src/search/lenses/landscape-surface.ts
 /** Ordinary kriging of node improvements with observed unit noise and bounded support. */
 function krige(records, scored, variances, columns, surfaceNodes) {
 	if (scored.length < SURFACE_MIN_NODES) return {
@@ -2021,8 +2005,7 @@ function independentLogLikelihood(y, noise, priorVariance) {
 	}
 	return total;
 }
-//#endregion
-//#region src/search/lenses/plateau.ts
+// src/search/lenses/plateau.ts
 const PLATEAU_METHOD = `rise of the best improvement over the root across the last \`window\` accepted nodes (screened, no dodged unit, ${INSUFFICIENT_FROM} or more units shared with the root), divided by the best node's standard error sqrt(pooled variance / its shared units); an improvement is the mean per-unit gain over the root on shared units in the objective's direction, and the variance is the between-unit variance of those gains pooled over screened nodes with 2 or more shared units`;
 /**
 * The plateau score of a search. Nodes are taken in the view's screened
@@ -2146,8 +2129,7 @@ function draftOnPlateau(base, options = {}) {
 		}
 	};
 }
-//#endregion
-//#region src/search/lenses/landscape.ts
+// src/search/lenses/landscape.ts
 /**
 * The landscape lens: where each node sits in edit space, and how the score
 * varies over it.
@@ -2331,8 +2313,7 @@ function emptyData(split, direction, embed, reason, plateau) {
 		plateau
 	};
 }
-//#endregion
-//#region src/search/lenses/meta-search.ts
+// src/search/lenses/meta-search.ts
 /**
 * `metaSearch(searches)`: a search of searches (search-tree-design §12).
 *
@@ -2806,8 +2787,7 @@ function parentOf(state, byId) {
 	}
 	return null;
 }
-//#endregion
-//#region src/search/lenses/meta-search-text.ts
+// src/search/lenses/meta-search-text.ts
 /**
 * The lens as text, for an agent: the signal, every configuration best first
 * with its coverage and interval, and the forest of searches with contained
@@ -2915,8 +2895,7 @@ function formatNumber(value) {
 function formatSigned(value) {
 	return value > 0 ? `+${formatNumber(value)}` : formatNumber(value);
 }
-//#endregion
-//#region src/search/lenses/skill-manifold-contract.ts
+// src/search/lenses/skill-manifold-contract.ts
 const METHODS = {
 	identity: {
 		model: "masked matrix factorization: each observed per-unit mean is b_u + P_i·Q_u on standardized scores, fitted by alternating ridge least squares over observed cells only; missing cells are masked, never filled",
@@ -2931,8 +2910,7 @@ const METHODS = {
 		explained: "in-sample McFadden pseudo-R² of each rank over the rank-0 model (unit easiness only), on the fitted rows; it always grows with rank, which is why the intrinsic dimension is cross-validated"
 	}
 };
-//#endregion
-//#region src/search/lenses/skill-manifold-matrix.ts
+// src/search/lenses/skill-manifold-matrix.ts
 /**
 * Per-unit means of every node on `split`. Without a calibration, a unit is
 * modelled when 2 or more nodes scored it and a node when it scored 2 or more
@@ -3072,8 +3050,7 @@ function fnv1a(text) {
 	}
 	return hash >>> 0;
 }
-//#endregion
-//#region src/search/lenses/skill-manifold-model.ts
+// src/search/lenses/skill-manifold-model.ts
 /** Fit latent skills and place nodes on deterministic principal axes. */
 /** The prior precision on a unit's log-odds intercept: N(0, 10²), weak
 * enough to leave any observed pass rate alone and strong enough to keep a
@@ -3419,8 +3396,7 @@ function lowerInverse(lower) {
 	}
 	return inverse;
 }
-//#endregion
-//#region src/search/lenses/skill-manifold-selection.ts
+// src/search/lenses/skill-manifold-selection.ts
 /** Rank and batch units by posterior information about the leaders. */
 function nextUnits(matrix, fit, leaderRows, noiseVariance, ridge, batch, link) {
 	if (leaderRows.length < 2) return {
@@ -3525,8 +3501,7 @@ function nextUnits(matrix, fit, leaderRows, noiseVariance, ridge, batch, link) {
 		insufficient: null
 	};
 }
-//#endregion
-//#region src/search/lenses/skill-manifold-validation.ts
+// src/search/lenses/skill-manifold-validation.ts
 /** Choose the supported skill rank from held-out observed cells. */
 function crossValidate(matrix, cells, rankCap, folds, ridge, link) {
 	const rows = new Set(cells.map((cell) => cell.row)).size;
@@ -3589,8 +3564,7 @@ function crossValidate(matrix, cells, rankCap, folds, ridge, link) {
 		insufficient: null
 	};
 }
-//#endregion
-//#region src/search/lenses/skill-manifold.ts
+// src/search/lenses/skill-manifold.ts
 /**
 * The skill manifold of a search at rank `k` (`auto`: the cross-validated
 * intrinsic dimension, at least 1, and 1 when too few nodes cross-validate).
@@ -3920,8 +3894,7 @@ function dominantAxis(loading) {
 function fixedOrDash(value) {
 	return Number.isFinite(value) ? value.toFixed(3) : "–";
 }
-//#endregion
-//#region src/search/lenses/task-matrix.ts
+// src/search/lenses/task-matrix.ts
 const TASK_MATRIX_NODES = 200;
 const SPECIALIST_GAIN_METHOD = `per unit cluster, the best node's mean over the cluster's units minus the mean of the node means, in the objective's direction and the metric's units, among nodes not decided invalid that scored every unit of the cluster; reported from 2 such nodes and ${INSUFFICIENT_FROM} units; a point value with no interval: the largest of several noisy means exceeds their mean even when no node specializes, so read it against the spread of the node means`;
 function taskMatrix(state, options = {}) {
@@ -4093,8 +4066,7 @@ function toCluster(members) {
 		members: sorted
 	};
 }
-//#endregion
-//#region src/search/lenses/tree.ts
+// src/search/lenses/tree.ts
 function tree(state) {
 	const nodes = state.nodes();
 	const byId = new Map(nodes.map((node) => [node.nodeId, node]));
@@ -4138,7 +4110,6 @@ function tree(state) {
 		}
 	};
 }
-//#endregion
 export { vectorEmbedding as _, skillCalibration as a, editCreditText as b, META_SEARCH_SCORE_SOURCE as c, searchPolicyGenome as d, landscape as f, surfaceTextEdits as g, lineageEdits as h, nextUnitExtension as i, metaSearch as l, formatLandscape as m, taskMatrix as n, skillManifold as o, draftOnPlateau as p, formatSkillManifold as r, renderMetaSearchText as s, tree as t, metaSearchScore as u, front as v, editCredit as y };
 
-//# sourceMappingURL=tree-DSqwJpL9.js.map
+//# sourceMappingURL=tree-DrIChF4a.js.map