universal-physics-tensor 0.45.2 → 0.47.0

package/dist/atlas/benchmark/baselines.d.ts

@@ -0,0 +1,64 @@
+/**
+ * Atlas Phase 5, S5.3 — the deterministic, in-tree BASELINE conditions and the
+ * recall-at-depth-k scorer.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §7.
+ *
+ * Each baseline ranks a reference corpus against a query. The pre-registered
+ * criterion is recall at depth 10 against embeddings, so a baseline is scored by
+ * whether the correct reference lands in its top k. Three baselines, in rising
+ * order of structure:
+ *
+ * - **text retrieval** — Jaccard overlap of lower-cased word tokens;
+ * - **symbol matching** — Jaccard overlap of the expression's symbol names;
+ * - **typed structural search** — exact agreement of the leakage key
+ *   (dimension-renamed normal form), then symbol overlap as the tie-break.
+ *
+ * **Every ranking is fully deterministic:** ties break on the reference id, so a
+ * rerun can never reorder a tie and move a result across the depth cut.
+ *
+ * Embeddings and LLM conditions run OUT OF PROCESS; `backend-shapes.ts` holds
+ * only their request and response shapes.
+ *
+ * @module atlas/benchmark/baselines
+ * @internal
+ */
+import type { ExprNode } from '../../dimensional/ast-types.js';
+/** One record a baseline can retrieve. @internal */
+export interface CorpusRecord {
+    readonly id: string;
+    readonly text: string;
+    readonly expr?: ExprNode;
+}
+/** A query: an item's text and, when it has one, its expression. @internal */
+export interface RetrievalQuery {
+    readonly text: string;
+    readonly expr?: ExprNode;
+}
+/** A ranking: reference ids, best first. @internal */
+export type Ranking = readonly string[];
+/** Baseline 1: text retrieval by word-token overlap. @internal */
+export declare function rankByTextOverlap(query: RetrievalQuery, corpus: readonly CorpusRecord[]): Ranking;
+/** Baseline 2: symbol matching by overlap of expression symbol names. @internal */
+export declare function rankBySymbolOverlap(query: RetrievalQuery, corpus: readonly CorpusRecord[]): Ranking;
+/**
+ * Baseline 3: typed structural search. A record whose leakage key equals the
+ * query's scores above every record that does not; symbol overlap orders within
+ * each tier. A query or record with no expression scores zero structurally.
+ *
+ * @internal
+ */
+export declare function rankByStructure(query: RetrievalQuery, corpus: readonly CorpusRecord[]): Ranking;
+/**
+ * Recall at depth k: the fraction of queries for which AT LEAST ONE correct
+ * reference appears in the top k of its ranking.
+ *
+ * A query with no ranking counts as a MISS, never as absent from the
+ * denominator: dropping it would raise recall by failing to answer. A query with
+ * no correct reference in `truth` is an error in the answer key, and throws.
+ *
+ * @throws Error if `truth` lists no correct reference for some query.
+ * @internal
+ */
+export declare function recallAtK(rankings: ReadonlyMap<string, Ranking>, truth: ReadonlyMap<string, readonly string[]>, k?: number): number;
+//# sourceMappingURL=baselines.d.ts.map

package/dist/atlas/benchmark/baselines.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"baselines.d.ts","sourceRoot":"","sources":["../../../src/atlas/benchmark/baselines.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAG/D,oDAAoD;AACpD,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;CAC1B;AAED,8EAA8E;AAC9E,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;CAC1B;AAED,sDAAsD;AACtD,MAAM,MAAM,OAAO,GAAG,SAAS,MAAM,EAAE,CAAC;AAqCxC,kEAAkE;AAClE,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,SAAS,YAAY,EAAE,GAAG,OAAO,CAGjG;AAED,mFAAmF;AACnF,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,SAAS,YAAY,EAAE,GAAG,OAAO,CAGnG;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,SAAS,YAAY,EAAE,GAAG,OAAO,CAO/F;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CACvB,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,EACtC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,EAC7C,CAAC,SAAK,GACL,MAAM,CASR"}

package/dist/atlas/benchmark/baselines.js

@@ -0,0 +1,112 @@
+/**
+ * Atlas Phase 5, S5.3 — the deterministic, in-tree BASELINE conditions and the
+ * recall-at-depth-k scorer.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §7.
+ *
+ * Each baseline ranks a reference corpus against a query. The pre-registered
+ * criterion is recall at depth 10 against embeddings, so a baseline is scored by
+ * whether the correct reference lands in its top k. Three baselines, in rising
+ * order of structure:
+ *
+ * - **text retrieval** — Jaccard overlap of lower-cased word tokens;
+ * - **symbol matching** — Jaccard overlap of the expression's symbol names;
+ * - **typed structural search** — exact agreement of the leakage key
+ *   (dimension-renamed normal form), then symbol overlap as the tie-break.
+ *
+ * **Every ranking is fully deterministic:** ties break on the reference id, so a
+ * rerun can never reorder a tie and move a result across the depth cut.
+ *
+ * Embeddings and LLM conditions run OUT OF PROCESS; `backend-shapes.ts` holds
+ * only their request and response shapes.
+ *
+ * @module atlas/benchmark/baselines
+ * @internal
+ */
+import { leakageKey } from './leakage.js';
+const tokens = (text) => new Set(text
+    .toLowerCase()
+    .split(/[^\p{L}\p{N}]+/u)
+    .filter((t) => t.length > 0));
+const jaccard = (a, b) => {
+    if (a.size === 0 && b.size === 0)
+        return 0;
+    let inter = 0;
+    for (const x of a)
+        if (b.has(x))
+            inter++;
+    return inter / (a.size + b.size - inter);
+};
+function symbolNames(node, out = new Set()) {
+    if (node === undefined)
+        return out;
+    if (node.kind === 'symbol') {
+        // Numeric literals are not symbols a reader would match on.
+        if (!Number.isFinite(Number(node.name)))
+            out.add(node.name);
+        return out;
+    }
+    if (node.kind === 'op')
+        for (const a of node.args)
+            symbolNames(a, out);
+    else if (node.kind === 'transcendental' || node.kind === 'abs')
+        symbolNames(node.arg, out);
+    return out;
+}
+/** Rank by descending score, ties broken by ascending id — never by input order. */
+function rankBy(corpus, score) {
+    return corpus
+        .map((r) => ({ id: r.id, s: score(r) }))
+        .sort((a, b) => (b.s !== a.s ? b.s - a.s : a.id < b.id ? -1 : a.id > b.id ? 1 : 0))
+        .map((x) => x.id);
+}
+/** Baseline 1: text retrieval by word-token overlap. @internal */
+export function rankByTextOverlap(query, corpus) {
+    const q = tokens(query.text);
+    return rankBy(corpus, (r) => jaccard(q, tokens(r.text)));
+}
+/** Baseline 2: symbol matching by overlap of expression symbol names. @internal */
+export function rankBySymbolOverlap(query, corpus) {
+    const q = symbolNames(query.expr);
+    return rankBy(corpus, (r) => jaccard(q, symbolNames(r.expr)));
+}
+/**
+ * Baseline 3: typed structural search. A record whose leakage key equals the
+ * query's scores above every record that does not; symbol overlap orders within
+ * each tier. A query or record with no expression scores zero structurally.
+ *
+ * @internal
+ */
+export function rankByStructure(query, corpus) {
+    const qKey = query.expr === undefined ? undefined : leakageKey(query.expr);
+    const qSyms = symbolNames(query.expr);
+    return rankBy(corpus, (r) => {
+        const structural = qKey !== undefined && r.expr !== undefined && leakageKey(r.expr) === qKey ? 1 : 0;
+        return 2 * structural + jaccard(qSyms, symbolNames(r.expr));
+    });
+}
+/**
+ * Recall at depth k: the fraction of queries for which AT LEAST ONE correct
+ * reference appears in the top k of its ranking.
+ *
+ * A query with no ranking counts as a MISS, never as absent from the
+ * denominator: dropping it would raise recall by failing to answer. A query with
+ * no correct reference in `truth` is an error in the answer key, and throws.
+ *
+ * @throws Error if `truth` lists no correct reference for some query.
+ * @internal
+ */
+export function recallAtK(rankings, truth, k = 10) {
+    if (truth.size === 0)
+        return Number.NaN;
+    let hits = 0;
+    for (const [queryId, correct] of truth) {
+        if (correct.length === 0)
+            throw new Error(`recallAtK: no correct reference for ${queryId}`);
+        const top = (rankings.get(queryId) ?? []).slice(0, k);
+        if (correct.some((c) => top.includes(c)))
+            hits++;
+    }
+    return hits / truth.size;
+}
+//# sourceMappingURL=baselines.js.map

package/dist/atlas/benchmark/baselines.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"baselines.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/baselines.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAkB1C,MAAM,MAAM,GAAG,CAAC,IAAY,EAAe,EAAE,CAC3C,IAAI,GAAG,CACL,IAAI;KACD,WAAW,EAAE;KACb,KAAK,CAAC,iBAAiB,CAAC;KACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC/B,CAAC;AAEJ,MAAM,OAAO,GAAG,CAAC,CAAsB,EAAE,CAAsB,EAAU,EAAE;IACzE,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,KAAK,EAAE,CAAC;IACzC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;AAC3C,CAAC,CAAC;AAEF,SAAS,WAAW,CAAC,IAA0B,EAAE,GAAG,GAAG,IAAI,GAAG,EAAU;IACtE,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IACnC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,4DAA4D;QAC5D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5D,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI;YAAE,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;SAClE,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3F,OAAO,GAAG,CAAC;AACb,CAAC;AAED,oFAAoF;AACpF,SAAS,MAAM,CAAC,MAA+B,EAAE,KAAkC;IACjF,OAAO,MAAM;SACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACvC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClF,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACtB,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,iBAAiB,CAAC,KAAqB,EAAE,MAA+B;IACtF,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7B,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,mBAAmB,CAAC,KAAqB,EAAE,MAA+B;IACxF,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,KAAqB,EAAE,MAA+B;IACpF,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC3E,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACtC,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE;QAC1B,MAAM,UAAU,GAAG,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrG,OAAO,CAAC,GAAG,UAAU,GAAG,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CACvB,QAAsC,EACtC,KAA6C,EAC7C,CAAC,GAAG,EAAE;IAEN,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IACxC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,KAAK,EAAE,CAAC;QACvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,OAAO,EAAE,CAAC,CAAC;QAC5F,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAE,IAAI,EAAE,CAAC;IACnD,CAAC;IACD,OAAO,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;AAC3B,CAAC"}

package/dist/atlas/benchmark/leakage.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Atlas Phase 5, S5.1 — leakage checks for the invalid-bridge benchmark.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §3.
+ *
+ * ## Why not `normalForm` directly
+ *
+ * The plan said renamed-variable variants "are detected as the same item by
+ * normal form". `normalForm` keys symbols by NAME, so `x/t` and `y/s` do not
+ * collide (measured). {@link leakageKey} therefore renames every DIMENSIONED
+ * symbol to its dimension signature first. That over-merges genuinely different
+ * quantities of one dimension, which is the SAFE direction for leakage: a false
+ * collision is flagged and reviewed, a missed one contaminates the study.
+ *
+ * @module atlas/benchmark/leakage
+ * @internal
+ */
+import type { ExprNode } from '../../dimensional/ast-types.js';
+import type { BenchmarkItem } from './types.js';
+/**
+ * The key under which two items count as the same claim: the normal form of the
+ * expression after renaming dimensioned symbols by dimension.
+ *
+ * @internal
+ */
+export declare function leakageKey(expr: ExprNode): string;
+/** A pair of items that share a leakage key. @internal */
+export interface LeakageCollision {
+    readonly key: string;
+    readonly ids: readonly string[];
+    /** The splits the colliding items sit in. More than one ⇒ LEAKAGE. */
+    readonly splits: readonly string[];
+}
+/**
+ * Group items by leakage key and report every group whose members span MORE THAN
+ * ONE split. Such a group means the held-out split contains a claim the
+ * in-distribution split already shows, under the same or different names.
+ *
+ * @internal
+ */
+export declare function findCrossSplitLeakage(items: readonly BenchmarkItem[]): LeakageCollision[];
+/** A renamed-variable variant that violates the same-split or same-key rule. @internal */
+export interface VariantProblem {
+    readonly id: string;
+    readonly of: string;
+    readonly problem: 'missing-original' | 'different-split' | 'not-same-claim';
+}
+/**
+ * Check every `renamedVariant` link: the original exists, sits in the SAME split,
+ * and genuinely has the same leakage key (a "variant" that is a different claim
+ * is mislabelled, and the label would hide a real item).
+ *
+ * @internal
+ */
+export declare function checkRenamedVariants(items: readonly BenchmarkItem[]): VariantProblem[];
+//# sourceMappingURL=leakage.d.ts.map

package/dist/atlas/benchmark/leakage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"leakage.d.ts","sourceRoot":"","sources":["../../../src/atlas/benchmark/leakage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAE/D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AA2BhD;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAEjD;AAED,0DAA0D;AAC1D,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,sEAAsE;IACtE,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;CACpC;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,GAAG,gBAAgB,EAAE,CAczF;AAED,0FAA0F;AAC1F,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,kBAAkB,GAAG,iBAAiB,GAAG,gBAAgB,CAAC;CAC7E;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,GAAG,cAAc,EAAE,CAetF"}

package/dist/atlas/benchmark/leakage.js

@@ -0,0 +1,100 @@
+/**
+ * Atlas Phase 5, S5.1 — leakage checks for the invalid-bridge benchmark.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §3.
+ *
+ * ## Why not `normalForm` directly
+ *
+ * The plan said renamed-variable variants "are detected as the same item by
+ * normal form". `normalForm` keys symbols by NAME, so `x/t` and `y/s` do not
+ * collide (measured). {@link leakageKey} therefore renames every DIMENSIONED
+ * symbol to its dimension signature first. That over-merges genuinely different
+ * quantities of one dimension, which is the SAFE direction for leakage: a false
+ * collision is flagged and reviewed, a missed one contaminates the study.
+ *
+ * @module atlas/benchmark/leakage
+ * @internal
+ */
+import { normalForm } from '../../canonical/normal-form.js';
+const isDimensionless = (d) => d.L === 0 && d.M === 0 && d.T === 0 && d.I === 0 && d.Theta === 0 && d.N === 0 && d.J === 0;
+const dimensionName = (d) => `dim[${d.L},${d.M},${d.T},${d.I},${d.Theta},${d.N},${d.J}]`;
+/**
+ * Rename every dimensioned symbol leaf to its dimension signature. Dimensionless
+ * leaves keep their names: `normalForm` already drops recognised constants and
+ * tags unknown dimensionless stubs, and a numeric literal must stay a literal.
+ */
+function renameByDimension(node) {
+    if (node.kind === 'symbol') {
+        return isDimensionless(node.dim) ? node : { ...node, name: dimensionName(node.dim) };
+    }
+    if (node.kind === 'op')
+        return { ...node, args: node.args.map(renameByDimension) };
+    if (node.kind === 'transcendental' || node.kind === 'abs') {
+        return { ...node, arg: renameByDimension(node.arg) };
+    }
+    // Other arms (integral, derivative, tensor nodes) are compared as normalForm
+    // compares them — structurally, names included. Stated, not hidden: a renamed
+    // variant INSIDE an integral is not caught by this key.
+    return node;
+}
+/**
+ * The key under which two items count as the same claim: the normal form of the
+ * expression after renaming dimensioned symbols by dimension.
+ *
+ * @internal
+ */
+export function leakageKey(expr) {
+    return normalForm(renameByDimension(expr));
+}
+/**
+ * Group items by leakage key and report every group whose members span MORE THAN
+ * ONE split. Such a group means the held-out split contains a claim the
+ * in-distribution split already shows, under the same or different names.
+ *
+ * @internal
+ */
+export function findCrossSplitLeakage(items) {
+    const groups = new Map();
+    for (const item of items) {
+        const key = leakageKey(item.expr);
+        const bucket = groups.get(key);
+        if (bucket === undefined)
+            groups.set(key, [item]);
+        else
+            bucket.push(item);
+    }
+    const out = [];
+    for (const [key, bucket] of groups) {
+        const splits = [...new Set(bucket.map((i) => i.split))].sort();
+        if (splits.length > 1)
+            out.push({ key, ids: bucket.map((i) => i.id), splits });
+    }
+    return out;
+}
+/**
+ * Check every `renamedVariant` link: the original exists, sits in the SAME split,
+ * and genuinely has the same leakage key (a "variant" that is a different claim
+ * is mislabelled, and the label would hide a real item).
+ *
+ * @internal
+ */
+export function checkRenamedVariants(items) {
+    const byId = new Map(items.map((i) => [i.id, i]));
+    const out = [];
+    for (const item of items) {
+        if (item.renamedVariant === undefined)
+            continue;
+        const original = byId.get(item.renamedVariant);
+        if (original === undefined) {
+            out.push({ id: item.id, of: item.renamedVariant, problem: 'missing-original' });
+        }
+        else if (original.split !== item.split) {
+            out.push({ id: item.id, of: item.renamedVariant, problem: 'different-split' });
+        }
+        else if (leakageKey(original.expr) !== leakageKey(item.expr)) {
+            out.push({ id: item.id, of: item.renamedVariant, problem: 'not-same-claim' });
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=leakage.js.map

package/dist/atlas/benchmark/leakage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"leakage.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/leakage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAK5D,MAAM,eAAe,GAAG,CAAC,CAAY,EAAW,EAAE,CAChD,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAE9F,MAAM,aAAa,GAAG,CAAC,CAAY,EAAU,EAAE,CAC7C,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;AAE9D;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,IAAc;IACvC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,OAAO,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACvF,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE,CAAC;IACnF,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC1D,OAAO,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACvD,CAAC;IACD,6EAA6E;IAC7E,8EAA8E;IAC9E,wDAAwD;IACxD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,IAAc;IACvC,OAAO,UAAU,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC;AAC7C,CAAC;AAUD;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAA+B;IACnE,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,MAAM,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;;YAC7C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IACD,MAAM,GAAG,GAAuB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/D,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;IACjF,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AASD;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAA+B;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS;YAAE,SAAS;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC/C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,cAAc,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC,CAAC;QAClF,CAAC;aAAM,IAAI,QAAQ,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YACzC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,cAAc,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC,CAAC;QACjF,CAAC;aAAM,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/D,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,cAAc,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC,CAAC;QAChF,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/atlas/benchmark/loader.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Atlas Phase 5, S5.1 — load and validate benchmark items.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §0, §2.
+ *
+ * This module reads the PUBLIC half of a benchmark directory and nothing else.
+ * The answers live in a sibling half that no `src/` file may read;
+ * `tests/atlas/benchmark.test.ts` holds the import guard, with a positive
+ * control proving the guard can fire.
+ *
+ * **The loader enforces the one part of the independence rule that code CAN
+ * enforce: a frozen item whose `authorship` is not `'independent'` is refused.**
+ * Whether the author really was independent is a fact about people, recorded in
+ * the pre-registration note and checked by review.
+ *
+ * @module atlas/benchmark/loader
+ * @internal
+ */
+import type { BenchmarkItem } from './types.js';
+/** One reason an item set is not admissible. @internal */
+export interface ItemProblem {
+    readonly id: string;
+    readonly problem: string;
+}
+/**
+ * Validate an item set against the schema and the rules that make it a benchmark.
+ *
+ * @param items - the items, as parsed.
+ * @param frozen - true for the frozen set (authorship must be `'independent'`),
+ * false for the contested staging area (authorship must be `'contested-draft'`).
+ * @returns every problem found; empty means admissible. Never throws, so a
+ * caller sees ALL problems at once rather than the first.
+ * @internal
+ */
+export declare function validateItems(items: readonly BenchmarkItem[], frozen: boolean): ItemProblem[];
+/** Thrown when a benchmark directory holds an inadmissible item set. @internal */
+export declare class BenchmarkAdmissionError extends Error {
+    readonly problems: readonly ItemProblem[];
+    constructor(problems: readonly ItemProblem[]);
+}
+/**
+ * Load the FROZEN items from `<benchmarkDir>/public/items.json`.
+ *
+ * @throws BenchmarkAdmissionError when any item is inadmissible — a frozen set
+ * with one contested draft in it is not a smaller benchmark, it is a broken one.
+ * @internal
+ */
+export declare function loadFrozenItems(benchmarkDir: string): BenchmarkItem[];
+/**
+ * Load the CONTESTED drafts from `<benchmarkDir>/contested/items.json`. These are
+ * never scored; they wait for an independent author to accept or rewrite them.
+ *
+ * @internal
+ */
+export declare function loadContestedDrafts(benchmarkDir: string): BenchmarkItem[];
+//# sourceMappingURL=loader.d.ts.map

package/dist/atlas/benchmark/loader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"loader.d.ts","sourceRoot":"","sources":["../../../src/atlas/benchmark/loader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAKH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEhD,0DAA0D;AAC1D,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,EAAE,MAAM,EAAE,OAAO,GAAG,WAAW,EAAE,CA0B7F;AAED,kFAAkF;AAClF,qBAAa,uBAAwB,SAAQ,KAAK;IACpC,QAAQ,CAAC,QAAQ,EAAE,SAAS,WAAW,EAAE;IAArD,YAAqB,QAAQ,EAAE,SAAS,WAAW,EAAE,EAMpD;CACF;AAQD;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,YAAY,EAAE,MAAM,GAAG,aAAa,EAAE,CAKrE;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,YAAY,EAAE,MAAM,GAAG,aAAa,EAAE,CAKzE"}

package/dist/atlas/benchmark/loader.js

@@ -0,0 +1,104 @@
+/**
+ * Atlas Phase 5, S5.1 — load and validate benchmark items.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §0, §2.
+ *
+ * This module reads the PUBLIC half of a benchmark directory and nothing else.
+ * The answers live in a sibling half that no `src/` file may read;
+ * `tests/atlas/benchmark.test.ts` holds the import guard, with a positive
+ * control proving the guard can fire.
+ *
+ * **The loader enforces the one part of the independence rule that code CAN
+ * enforce: a frozen item whose `authorship` is not `'independent'` is refused.**
+ * Whether the author really was independent is a fact about people, recorded in
+ * the pre-registration note and checked by review.
+ *
+ * @module atlas/benchmark/loader
+ * @internal
+ */
+import { readFileSync } from 'node:fs';
+import { join } from 'node:path';
+import { HELD_OUT_FAMILY } from './types.js';
+/**
+ * Validate an item set against the schema and the rules that make it a benchmark.
+ *
+ * @param items - the items, as parsed.
+ * @param frozen - true for the frozen set (authorship must be `'independent'`),
+ * false for the contested staging area (authorship must be `'contested-draft'`).
+ * @returns every problem found; empty means admissible. Never throws, so a
+ * caller sees ALL problems at once rather than the first.
+ * @internal
+ */
+export function validateItems(items, frozen) {
+    const problems = [];
+    const seen = new Set();
+    for (const item of items) {
+        const p = (problem) => {
+            problems.push({ id: item.id, problem });
+        };
+        if (seen.has(item.id))
+            p('duplicate id');
+        seen.add(item.id);
+        const wanted = frozen ? 'independent' : 'contested-draft';
+        if (item.authorship !== wanted) {
+            p(`authorship '${item.authorship}' where the ${frozen ? 'frozen' : 'contested'} set requires '${wanted}'`);
+        }
+        // The answer lives in the scorer half. A public item that carries it would
+        // hand the key to any condition that reads the public file.
+        if ('kind' in item || 'failureKind' in item) {
+            p('the public half carries the answer (kind/failureKind); it belongs in scorer/labels.json');
+        }
+        if ((item.family === HELD_OUT_FAMILY) !== (item.split === 'held-out')) {
+            p(`the held-out split is exactly the '${HELD_OUT_FAMILY}' family; got family '${item.family}' in split '${item.split}'`);
+        }
+        if (item.premises.length === 0)
+            p('no premises');
+        if (item.source.trim() === '')
+            p('no source');
+    }
+    return problems;
+}
+/** Thrown when a benchmark directory holds an inadmissible item set. @internal */
+export class BenchmarkAdmissionError extends Error {
+    problems;
+    constructor(problems) {
+        super(`benchmark items are not admissible: ${problems
+            .map((p) => `${p.id}: ${p.problem}`)
+            .join('; ')}`);
+        this.problems = problems;
+    }
+}
+function readItems(file) {
+    const parsed = JSON.parse(readFileSync(file, 'utf-8'));
+    if (!Array.isArray(parsed))
+        throw new Error(`${file}: expected a JSON array of items`);
+    return parsed;
+}
+/**
+ * Load the FROZEN items from `<benchmarkDir>/public/items.json`.
+ *
+ * @throws BenchmarkAdmissionError when any item is inadmissible — a frozen set
+ * with one contested draft in it is not a smaller benchmark, it is a broken one.
+ * @internal
+ */
+export function loadFrozenItems(benchmarkDir) {
+    const items = readItems(join(benchmarkDir, 'public', 'items.json'));
+    const problems = validateItems(items, true);
+    if (problems.length > 0)
+        throw new BenchmarkAdmissionError(problems);
+    return items;
+}
+/**
+ * Load the CONTESTED drafts from `<benchmarkDir>/contested/items.json`. These are
+ * never scored; they wait for an independent author to accept or rewrite them.
+ *
+ * @internal
+ */
+export function loadContestedDrafts(benchmarkDir) {
+    const items = readItems(join(benchmarkDir, 'contested', 'items.json'));
+    const problems = validateItems(items, false);
+    if (problems.length > 0)
+        throw new BenchmarkAdmissionError(problems);
+    return items;
+}
+//# sourceMappingURL=loader.js.map

package/dist/atlas/benchmark/loader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"loader.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/loader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAS7C;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAAC,KAA+B,EAAE,MAAe;IAC5E,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,OAAe,EAAQ,EAAE;YAClC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;QAC1C,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,cAAc,CAAC,CAAC;QACzC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAElB,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,iBAAiB,CAAC;QAC1D,IAAI,IAAI,CAAC,UAAU,KAAK,MAAM,EAAE,CAAC;YAC/B,CAAC,CAAC,eAAe,IAAI,CAAC,UAAU,eAAe,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,kBAAkB,MAAM,GAAG,CAAC,CAAC;QAC7G,CAAC;QACD,2EAA2E;QAC3E,4DAA4D;QAC5D,IAAI,MAAM,IAAI,IAAI,IAAI,aAAa,IAAI,IAAI,EAAE,CAAC;YAC5C,CAAC,CAAC,yFAAyF,CAAC,CAAC;QAC/F,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,UAAU,CAAC,EAAE,CAAC;YACtE,CAAC,CAAC,sCAAsC,eAAe,yBAAyB,IAAI,CAAC,MAAM,eAAe,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAC3H,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,CAAC,CAAC,aAAa,CAAC,CAAC;QACjD,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE;YAAE,CAAC,CAAC,WAAW,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,kFAAkF;AAClF,MAAM,OAAO,uBAAwB,SAAQ,KAAK;IAC3B,QAAQ;IAA7B,YAAqB,QAAgC;QACnD,KAAK,CACH,uCAAuC,QAAQ;aAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;aACnC,IAAI,CAAC,IAAI,CAAC,EAAE,CAChB,CAAC;wBALiB,QAAQ;IAM7B,CAAC;CACF;AAED,SAAS,SAAS,CAAC,IAAY;IAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,CAAY,CAAC;IAClE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,kCAAkC,CAAC,CAAC;IACvF,OAAO,MAAyB,CAAC;AACnC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,YAAoB;IAClD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;IACpE,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC5C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrE,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,YAAoB;IACtD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC,CAAC;IACvE,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC7C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrE,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/atlas/benchmark/run-atlas.d.ts

@@ -0,0 +1,72 @@
+/**
+ * Atlas Phase 5, S5.2 — the ATLAS condition of the invalid-bridge benchmark.
+ *
+ * Design note: `docs/planning/Atlas-Phase-5-Design.md` §6.
+ *
+ * For each item the runner applies three atlas instruments — the applicability
+ * checker (S4.1), the composition table (S3) and the regime check (S2) — and
+ * emits `accept`, `reject` or `abstain`.
+ *
+ * ## The decision rule, and why accept is the HARDEST outcome to reach
+ *
+ * - **reject** when an instrument DEMONSTRABLY fires: a blocking applicability
+ *   finding, a chain OVERCLAIMED as an exact equivalence, a structural analogy
+ *   promoted to an equivalence, or a regime inequality checked and violated.
+ * - **accept** only when EVERY ENABLED instrument RAN and CLEARED: side conditions were
+ *   stated, the applicability checker found nothing, the regime was supplied and
+ *   every inequality was checked and held, and any claimed chain agrees with the
+ *   table. At least one instrument must have RUN: an item that no enabled
+ *   instrument applies to abstains, because nothing cleared it. S4.1 already fixed the principle: an empty finding list means "no rule
+ *   fired", which is weaker than "valid". An item that leaves a check unrun has
+ *   not been cleared by it.
+ * - **abstain** otherwise. Abstention is a first-class outcome and is preferred
+ *   to a wrong accept (ROADMAP Phase 5, pre-stated criteria).
+ *
+ * The failure kind a rejection names is a MAPPING from the rule that fired, and
+ * it is only as good as that mapping: a dimensional inconsistency is reported as
+ * `notation-collision` because that is its commonest cause, not because the rule
+ * can see notation. The scorer grades "rejected" and "named the right kind"
+ * separately, so an imperfect mapping costs the second score only.
+ *
+ * @module atlas/benchmark/run-atlas
+ * @internal
+ */
+import type { BenchmarkItem, FailureKind } from './types.js';
+/** What the atlas condition concluded about one item. @internal */
+export interface AtlasVerdict {
+    readonly itemId: string;
+    readonly outcome: 'accept' | 'reject' | 'abstain';
+    /** Present on a reject when the rule that fired maps to a failure kind. */
+    readonly detectedFailure?: FailureKind;
+    /** Every reason, in rule order — including the unrun checks behind an abstention. */
+    readonly reasons: readonly string[];
+}
+/**
+ * Which instruments a run uses — the S6.2 ablation. The four named
+ * configurations in {@link ABLATION_CONFIGS} are CUMULATIVE.
+ *
+ * @internal
+ */
+export interface AtlasRunConfig {
+    /** The composition table over relation types. */
+    readonly types: boolean;
+    /** Side-condition rules: unguarded / zero divisors, squaring. */
+    readonly assumptions: boolean;
+    /** Dimensional consistency and convention agreement. */
+    readonly dimensionsAndConventions: boolean;
+    /** The regime check at the use site. */
+    readonly regimes: boolean;
+}
+/** Every instrument on: the atlas condition as scored. @internal */
+export declare const FULL_CONFIG: AtlasRunConfig;
+/** The four cumulative ablation configurations, in the plan's order. @internal */
+export declare const ABLATION_CONFIGS: ReadonlyArray<readonly [string, AtlasRunConfig]>;
+/**
+ * Run the atlas condition on one item. Pure and deterministic; never throws.
+ *
+ * @internal
+ */
+export declare function runAtlasOnItem(item: BenchmarkItem, config?: AtlasRunConfig): AtlasVerdict;
+/** Run the atlas condition over a set of items, in order. @internal */
+export declare function runAtlasCondition(items: readonly BenchmarkItem[], config?: AtlasRunConfig): AtlasVerdict[];
+//# sourceMappingURL=run-atlas.d.ts.map

package/dist/atlas/benchmark/run-atlas.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"run-atlas.d.ts","sourceRoot":"","sources":["../../../src/atlas/benchmark/run-atlas.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAOH,OAAO,KAAK,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE7D,mEAAmE;AACnE,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,CAAC;IAClD,2EAA2E;IAC3E,QAAQ,CAAC,eAAe,CAAC,EAAE,WAAW,CAAC;IACvC,qFAAqF;IACrF,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AAED;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B,iDAAiD;IACjD,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,iEAAiE;IACjE,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,wDAAwD;IACxD,QAAQ,CAAC,wBAAwB,EAAE,OAAO,CAAC;IAC3C,wCAAwC;IACxC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;CAC3B;AAED,oEAAoE;AACpE,eAAO,MAAM,WAAW,EAAE,cAKzB,CAAC;AAEF,kFAAkF;AAClF,eAAO,MAAM,gBAAgB,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,cAAc,CAAC,CAK7E,CAAC;AA6CF;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,GAAE,cAA4B,GAAG,YAAY,CAoHtG;AAED,uEAAuE;AACvE,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,SAAS,aAAa,EAAE,EAC/B,MAAM,GAAE,cAA4B,GACnC,YAAY,EAAE,CAEhB"}