@monoes/monomindcli 2.7.12 → 2.7.14

package/dist/src/knowledge/eval/corpus.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Deterministic evaluation corpus.
+ *
+ * Reproducibility rules this file exists to enforce:
+ *  - The corpus is derived from git-tracked files only, so a clean checkout at
+ *    a given commit produces exactly the same document set.
+ *  - The list is sorted by path, so ordering never depends on filesystem walk
+ *    order (which differs between macOS and Linux).
+ *  - Every run records a corpusHash over (path, sha256) pairs. Two scoreboard
+ *    rows with different corpusHash values are NOT comparable.
+ *
+ * @module v1/cli/knowledge/eval/corpus
+ */
+export interface CorpusDoc {
+    /** Repo-relative POSIX path — the stable document id used in the golden set. */
+    id: string;
+    absPath: string;
+    bytes: number;
+    sha256: string;
+}
+export interface Corpus {
+    docs: CorpusDoc[];
+    corpusHash: string;
+    repoRoot: string;
+    /** Paths matched by the include rules but dropped, with the reason. */
+    excluded: Array<{
+        id: string;
+        reason: string;
+    }>;
+    /**
+     * Byte-identical documents collapsed to one content unit.
+     *
+     * This repo ships a verbatim mirror of `.claude/**` inside the CLI package
+     * (an npm-packaging requirement), so ~200 documents exist twice. Without
+     * this, a retriever that returns the identical twin of the gold document
+     * scores a MISS for returning the correct content — which measures path
+     * luck, not retrieval. Identical bytes are one document.
+     */
+    canonicalOf: Map<string, string>;
+    /** Number of distinct content units (<= docs.length). */
+    contentUnits: number;
+    duplicateGroups: number;
+    /** AppleDouble `._` resource forks found. Must be zero. */
+    appleDoubleCount: number;
+}
+/** AppleDouble resource forks. Per-SEGMENT anchored, so it catches
+ *  `docs/concepts/._memory.md` and not merely a leading dot at the repo root. */
+export declare const APPLEDOUBLE_RE: RegExp;
+/** The repository top level. Without this the corpus silently differs
+ *  depending on which subdirectory you ran from — and two scoreboard rows
+ *  would be incomparable for a reason nobody would think to check. */
+export declare function resolveRepoRoot(start: string): string;
+export declare function listTrackedFiles(repoRoot: string): string[];
+export declare function buildCorpus(startDir: string): Corpus;
+export declare function readDoc(doc: CorpusDoc): string;
+//# sourceMappingURL=corpus.d.ts.map

package/dist/src/knowledge/eval/corpus.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"corpus.d.ts","sourceRoot":"","sources":["../../../../src/knowledge/eval/corpus.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAOH,MAAM,WAAW,SAAS;IACxB,gFAAgF;IAChF,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,MAAM;IACrB,IAAI,EAAE,SAAS,EAAE,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,uEAAuE;IACvE,QAAQ,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAChD;;;;;;;;OAQG;IACH,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,yDAAyD;IACzD,YAAY,EAAE,MAAM,CAAC;IACrB,eAAe,EAAE,MAAM,CAAC;IACxB,2DAA2D;IAC3D,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAOD;iFACiF;AACjF,eAAO,MAAM,cAAc,QAAc,CAAC;AAc1C;;sEAEsE;AACtE,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAMrD;AAED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CAK3D;AAED,wBAAgB,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAyDpD;AAED,wBAAgB,OAAO,CAAC,GAAG,EAAE,SAAS,GAAG,MAAM,CAE9C"}

package/dist/src/knowledge/eval/corpus.js

@@ -0,0 +1,126 @@
+/**
+ * Deterministic evaluation corpus.
+ *
+ * Reproducibility rules this file exists to enforce:
+ *  - The corpus is derived from git-tracked files only, so a clean checkout at
+ *    a given commit produces exactly the same document set.
+ *  - The list is sorted by path, so ordering never depends on filesystem walk
+ *    order (which differs between macOS and Linux).
+ *  - Every run records a corpusHash over (path, sha256) pairs. Two scoreboard
+ *    rows with different corpusHash values are NOT comparable.
+ *
+ * @module v1/cli/knowledge/eval/corpus
+ */
+import * as fs from 'node:fs';
+import * as path from 'node:path';
+import * as crypto from 'node:crypto';
+import { execFileSync } from 'node:child_process';
+/** Extensions the document pipeline can actually extract text from and that
+ *  carry prose. Source files are deliberately out: the golden set judges
+ *  document retrieval, and the code graph is a separate surface. */
+const CORPUS_EXTENSIONS = new Set(['.md']);
+/** AppleDouble resource forks. Per-SEGMENT anchored, so it catches
+ *  `docs/concepts/._memory.md` and not merely a leading dot at the repo root. */
+export const APPLEDOUBLE_RE = /(^|\/)\._/;
+/** Directories whose contents are generated, vendored, or per-machine state. */
+const EXCLUDE_PATTERNS = [
+    /(^|\/)node_modules\//,
+    /(^|\/)dist\//,
+    /(^|\/)\.monomind\//,
+    /(^|\/)coverage\//,
+    APPLEDOUBLE_RE, // exFAT resource-fork turds
+];
+/** Files too small to contain a retrievable answer. */
+const MIN_BYTES = 400;
+/** The repository top level. Without this the corpus silently differs
+ *  depending on which subdirectory you ran from — and two scoreboard rows
+ *  would be incomparable for a reason nobody would think to check. */
+export function resolveRepoRoot(start) {
+    try {
+        return execFileSync('git', ['-C', start, 'rev-parse', '--show-toplevel'], { encoding: 'utf8' }).trim();
+    }
+    catch {
+        return path.resolve(start);
+    }
+}
+export function listTrackedFiles(repoRoot) {
+    const out = execFileSync('git', ['-C', repoRoot, 'ls-files', '-z'], {
+        encoding: 'utf8', maxBuffer: 64 * 1024 * 1024,
+    });
+    return out.split('\0').filter(Boolean);
+}
+export function buildCorpus(startDir) {
+    const repoRoot = resolveRepoRoot(startDir);
+    const excluded = [];
+    const docs = [];
+    const tracked = listTrackedFiles(repoRoot).sort();
+    // Counted from the RAW tracked list, before any exclusion runs.
+    //
+    // This was a bug, caught by a deliberate-violation test: the count used to be
+    // derived from `docs`, which the exclusion pattern had already emptied of
+    // `._` files. It was therefore always 0, and the "hard failure" downstream
+    // could never fire — a silent filter wearing an assert's name. A guard with
+    // no reachable firing condition is an assumption, not a guard.
+    const appleDoubleCount = tracked.filter(rel => APPLEDOUBLE_RE.test(rel) && CORPUS_EXTENSIONS.has(path.extname(rel).toLowerCase())).length;
+    for (const rel of tracked) {
+        if (!CORPUS_EXTENSIONS.has(path.extname(rel).toLowerCase()))
+            continue;
+        if (EXCLUDE_PATTERNS.some(re => re.test(rel))) {
+            excluded.push({ id: rel, reason: 'excluded path' });
+            continue;
+        }
+        const abs = path.join(repoRoot, rel);
+        let stat;
+        try {
+            stat = fs.statSync(abs);
+        }
+        catch {
+            excluded.push({ id: rel, reason: 'unreadable' });
+            continue;
+        }
+        if (!stat.isFile())
+            continue;
+        if (stat.size < MIN_BYTES) {
+            excluded.push({ id: rel, reason: 'under ' + MIN_BYTES + ' bytes' });
+            continue;
+        }
+        const content = fs.readFileSync(abs);
+        docs.push({
+            id: rel,
+            absPath: abs,
+            bytes: stat.size,
+            sha256: crypto.createHash('sha256').update(content).digest('hex'),
+        });
+    }
+    // Collapse byte-identical documents. Canonical = shortest path, ties broken
+    // lexicographically, so the choice is deterministic and never depends on
+    // filesystem order.
+    const byHash = new Map();
+    for (const d of docs) {
+        const arr = byHash.get(d.sha256);
+        if (arr)
+            arr.push(d.id);
+        else
+            byHash.set(d.sha256, [d.id]);
+    }
+    const canonicalOf = new Map();
+    let duplicateGroups = 0;
+    for (const [, ids] of byHash) {
+        const canon = [...ids].sort((a, b) => a.length - b.length || a.localeCompare(b))[0];
+        for (const id of ids)
+            canonicalOf.set(id, canon);
+        if (ids.length > 1)
+            duplicateGroups++;
+    }
+    const h = crypto.createHash('sha256');
+    for (const d of docs)
+        h.update(d.id).update('\0').update(d.sha256).update('\n');
+    return {
+        docs, corpusHash: h.digest('hex').slice(0, 16), repoRoot, excluded,
+        canonicalOf, contentUnits: byHash.size, duplicateGroups, appleDoubleCount,
+    };
+}
+export function readDoc(doc) {
+    return fs.readFileSync(doc.absPath, 'utf8');
+}
+//# sourceMappingURL=corpus.js.map

package/dist/src/knowledge/eval/corpus.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"corpus.js","sourceRoot":"","sources":["../../../../src/knowledge/eval/corpus.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAC;AACtC,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAiClD;;oEAEoE;AACpE,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AAE3C;iFACiF;AACjF,MAAM,CAAC,MAAM,cAAc,GAAG,WAAW,CAAC;AAE1C,gFAAgF;AAChF,MAAM,gBAAgB,GAAG;IACvB,sBAAsB;IACtB,cAAc;IACd,oBAAoB;IACpB,kBAAkB;IAClB,cAAc,EAAU,4BAA4B;CACrD,CAAC;AAEF,uDAAuD;AACvD,MAAM,SAAS,GAAG,GAAG,CAAC;AAEtB;;sEAEsE;AACtE,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,IAAI,CAAC;QACH,OAAO,YAAY,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,WAAW,EAAE,iBAAiB,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACzG,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;AACH,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,QAAgB;IAC/C,MAAM,GAAG,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE;QAClE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI;KAC9C,CAAC,CAAC;IACH,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;AACzC,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,QAAgB;IAC1C,MAAM,QAAQ,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAA0C,EAAE,CAAC;IAC3D,MAAM,IAAI,GAAgB,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;IAElD,gEAAgE;IAChE,EAAE;IACF,8EAA8E;IAC9E,0EAA0E;IAC1E,2EAA2E;IAC3E,4EAA4E;IAC5E,+DAA+D;IAC/D,MAAM,gBAAgB,GAAG,OAAO,CAAC,MAAM,CACrC,GAAG,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAC1F,CAAC,MAAM,CAAC;IAET,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;YAAE,SAAS;QACtE,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACjH,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,IAAc,CAAC;QACnB,IAAI,CAAC;YAAC,IAAI,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACtG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAAE,SAAS;QAC7B,IAAI,IAAI,CAAC,IAAI,GAAG,SAAS,EAAE,CAAC;YAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,GAAG,SAAS,GAAG,QAAQ,EAAE,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QAC7G,MAAM,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC;YACR,EAAE,EAAE,GAAG;YACP,OAAO,EAAE,GAAG;YACZ,KAAK,EAAE,IAAI,CAAC,IAAI;YAChB,MAAM,EAAE,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;SAClE,CAAC,CAAC;IACL,CAAC;IAED,4EAA4E;IAC5E,yEAAyE;IACzE,oBAAoB;IACpB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,GAAG;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;;YAAM,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7D,CAAC;IACD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,KAAK,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,KAAK,MAAM,EAAE,IAAI,GAAG;YAAE,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACjD,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;YAAE,eAAe,EAAE,CAAC;IACxC,CAAC;IAED,MAAM,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAEhF,OAAO;QACL,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,QAAQ,EAAE,QAAQ;QAClE,WAAW,EAAE,YAAY,EAAE,MAAM,CAAC,IAAI,EAAE,eAAe,EAAE,gBAAgB;KAC1E,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,GAAc;IACpC,OAAO,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;AAC9C,CAAC"}

package/dist/src/knowledge/eval/golden-set.d.ts

@@ -0,0 +1,62 @@
+/**
+ * The local golden set: query -> relevant document id pairs.
+ *
+ * CONSTRUCTION RULES (enforced by the harness, not just by good intentions):
+ *  1. Every `relevant` id is a repo-relative path that must exist in the
+ *     deterministic corpus. Unknown ids are a hard failure, never a silent skip.
+ *  2. Queries are written in DIFFERENT vocabulary from the source document —
+ *     the wording a person would use months later having forgotten the doc's
+ *     own terms. Pairs whose query turns out to be near-verbatim in the target
+ *     are removed automatically by `assessTriviality` and reported.
+ *  3. Relevance is pinned to LIVE documents: the eval store is rebuilt from the
+ *     corpus with exactly one ingest per document, so it contains no superseded
+ *     versions at all. Deleting dead rows from the user's store (backlog item 4)
+ *     therefore cannot move these numbers.
+ *  4. Ambiguous targets are avoided. Where several near-identical documents
+ *     could each legitimately answer, either the query is sharpened or all
+ *     acceptable documents are listed in `relevant`.
+ *
+ * @module v1/cli/knowledge/eval/golden-set
+ */
+export interface GoldenPair {
+    id: string;
+    query: string;
+    /** Repo-relative paths. A hit on ANY counts for hit-rate; recall uses all. */
+    relevant: string[];
+    /** Free-form grouping for slice reporting. */
+    tags?: string[];
+}
+/**
+ * v1 of the set. Authored 2026-07-28 by `benchmark-engineer` against documents
+ * read at authoring time. Growing this set is ongoing work; the count is
+ * reported honestly by the harness rather than padded with near-duplicates.
+ */
+export declare const GOLDEN_SET: GoldenPair[];
+export type Split = 'dev' | 'test';
+/** Share of pairs assigned to the sealed test split. */
+export declare const TEST_SHARE = 0.3;
+/** Identifies the assignment scheme. Bump this whenever assignment changes:
+ *  numbers measured under different schemes are not comparable, and the
+ *  regression suite uses this to say so instead of inventing a regression. */
+export declare const SPLIT_SCHEME = "hash-threshold-v2";
+/**
+ * Stratified 70/30 dev/test split, STABLE UNDER GROWTH.
+ *
+ * The assignment is a pure function of the pair's own id — `pairHash(id) <
+ * TEST_SHARE` — so adding pairs never moves an existing pair between splits.
+ *
+ * The first version ranked pairs within their tag group and took the lowest
+ * 30%, which gave an exact 70/30 per tag but was NOT stable: appending one
+ * pair to a group re-ranked it and silently reassigned existing pairs. Growing
+ * the set would have quietly moved queries out of the sealed half and into the
+ * tunable one, which is the seal failing open — and it would have done so with
+ * no visible symptom at all.
+ *
+ * Stratification survives because the hash is uniform and independent of the
+ * tag, so each tag group lands near 30% on average rather than exactly. That
+ * is the right trade: an approximate stratification that cannot leak beats an
+ * exact one that can.
+ */
+export declare function assignSplits(pairs?: GoldenPair[]): Map<string, Split>;
+export declare function pairsForSplit(split: Split | 'all', pairs?: GoldenPair[]): GoldenPair[];
+//# sourceMappingURL=golden-set.d.ts.map

package/dist/src/knowledge/eval/golden-set.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"golden-set.d.ts","sourceRoot":"","sources":["../../../../src/knowledge/eval/golden-set.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,8CAA8C;IAC9C,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;;;GAIG;AACH,eAAO,MAAM,UAAU,EAAE,UAAU,EAwHlC,CAAC;AAsBF,MAAM,MAAM,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC;AASnC,wDAAwD;AACxD,eAAO,MAAM,UAAU,MAAM,CAAC;AAE9B;;8EAE8E;AAC9E,eAAO,MAAM,YAAY,sBAAsB,CAAC;AAEhD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,YAAY,CAAC,KAAK,GAAE,UAAU,EAAe,GAAG,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAIjF;AAED,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,GAAE,UAAU,EAAe,GAAG,UAAU,EAAE,CAIlG"}