@aligndottech/cli 0.49.0 → 0.51.0

package/dist/lib/local-relink.js

@@ -0,0 +1,171 @@
+/**
+ * `align local relink --detector v1`: re-type existing v0 links with the v1 detector, explicitly.
+ *
+ * Schema v12 stamped every existing link 'v0' and nothing re-types a link silently, so this is
+ * the one path that does. Its rules (review F1, F2, F5 of 2026-10-11):
+ * - The unit is the UNORDERED PAIR. However many v0 rows a pair carries, in either direction, it
+ *   is judged once, in one call, and appears once in that call. Pairs are grouped into calls by
+ *   the source of the pair's earliest row (the NEW DECISION; its partners are the candidates).
+ * - A pair a person has judged is never touched: any `local_judgements` row naming both
+ *   decisions (a `replaces` mark, a conflict verdict), a `mark:` link on the pair, or a
+ *   not-a-decision mark on either side. Judgements are read, not inferred from link ids, because
+ *   a mark written over an existing classifier row keeps that row's id.
+ * - A pair that already has a v1 row is skipped, so a second run does not pay for it again.
+ * - An omitted verdict (the model gave the pair no relationship, or the resolver refused the
+ *   edge) leaves the pair exactly as it is. Omission is not a verdict to apply.
+ * - Candidates carry status 'superseded' when a decision OTHER than the pair's source supersedes
+ *   them, so the prompt marks them RETIRED and the resolver refuses a verdict edge (R2: the
+ *   pair's own row does not count).
+ * - A pair carrying a supersedes is only changed by a conflict-family answer (R2); a
+ *   non-conflict type leaves it as it is.
+ * - Dry run (apply false) writes nothing. apply without replace adds a v1 row only where the
+ *   type is new for the pair; apply with replace swaps the pair's non-mark rows for the v1 row.
+ * - At most `maxCalls` calls; a failed call writes nothing for its group; a stopped provider ends
+ *   the run. `written` lists only what was written.
+ */
+import { DatabaseSync } from 'node:sqlite';
+import { buildV1SystemPrompt, buildV1UserPrompt, v1MaxTokens } from '../detector/relationship-prompt.js';
+import { createLocalDb } from './local-db.js';
+import { classifyCandidateSet } from './local-set-classifier.js';
+import { estimateTokens } from './token-estimate.js';
+const pairKey = (a, b) => (a < b ? `${a}\u0000${b}` : `${b}\u0000${a}`);
+/** What relink would do, from the graph alone. No model call. */
+export function planRelink(dbPath) {
+    createLocalDb(dbPath).close(); // migrate to v12 before reading detector_version
+    const raw = new DatabaseSync(dbPath);
+    let links;
+    let judged;
+    let notDecisions;
+    let rows;
+    try {
+        raw.exec('PRAGMA busy_timeout = 30000');
+        links = raw.prepare(`SELECT id, source_id AS sourceId, target_id AS targetId, relation, confidence, detector_version AS v FROM decision_links
+       WHERE source_id <> target_id
+         AND EXISTS (SELECT 1 FROM decisions s WHERE s.id = source_id) AND EXISTS (SELECT 1 FROM decisions t WHERE t.id = target_id)
+       ORDER BY rowid`).all();
+        const judgements = raw.prepare(`SELECT decision_id AS d, counterpart_id AS c, kind FROM local_judgements`).all();
+        judged = new Set(judgements.filter((j) => j.c !== null).map((j) => pairKey(j.d, j.c)));
+        notDecisions = new Set(judgements.filter((j) => j.kind === 'not_a_decision').map((j) => j.d));
+        rows = new Map(raw.prepare('SELECT id, title, summary, platform, decided_at FROM decisions').all().map((r) => [r.id, r]));
+    }
+    finally {
+        raw.close();
+    }
+    const blocked = new Set();
+    for (const l of links) {
+        const key = pairKey(l.sourceId, l.targetId);
+        if (l.v !== 'v0' || l.id.startsWith('mark:'))
+            blocked.add(key);
+    }
+    const pairs = new Map();
+    const skipped = new Set();
+    for (const l of links) {
+        const key = pairKey(l.sourceId, l.targetId);
+        if (blocked.has(key)) {
+            if (judged.has(key) || links.some((x) => x.id.startsWith('mark:') && pairKey(x.sourceId, x.targetId) === key))
+                skipped.add(key);
+            continue;
+        }
+        if (judged.has(key) || notDecisions.has(l.sourceId) || notDecisions.has(l.targetId)) {
+            skipped.add(key);
+            continue;
+        }
+        const seen = pairs.get(key);
+        if (seen) {
+            if (!seen.pair.relations.includes(l.relation))
+                seen.pair.relations.push(l.relation);
+            seen.pair.confidence = Math.max(seen.pair.confidence, l.confidence);
+        }
+        else {
+            pairs.set(key, { sourceId: l.sourceId, pair: { targetId: l.targetId, relations: [l.relation], confidence: l.confidence } });
+        }
+    }
+    const bySource = new Map();
+    for (const { sourceId, pair } of pairs.values())
+        bySource.set(sourceId, [...(bySource.get(sourceId) ?? []), pair]);
+    const groups = [...bySource.entries()].map(([sourceId, ps]) => ({ sourceId, pairs: ps.map((p) => ({ ...p, relations: [...p.relations].sort() })) }));
+    const decision = (id) => rows.get(id);
+    const supersessions = new Map();
+    for (const l of links) {
+        if (l.relation === 'supersedes' || l.relation === 'partially_supersedes')
+            supersessions.set(l.targetId, (supersessions.get(l.targetId) ?? new Set()).add(l.sourceId));
+    }
+    const supersededBy = (id) => supersessions.get(id) ?? new Set();
+    const system = estimateTokens(buildV1SystemPrompt());
+    let inputTokens = 0;
+    let maxOutputTokens = 0;
+    for (const g of groups) {
+        const out = v1MaxTokens(g.pairs.length);
+        inputTokens += system + estimateTokens(buildV1UserPrompt(subjectOf(decision(g.sourceId)), candidatesOf(g, decision, supersededBy), 1_000_000, out));
+        maxOutputTokens += out;
+    }
+    return { groups, decision, supersededBy, calls: groups.length, pairs: pairs.size, skippedJudged: skipped.size, inputTokens, maxOutputTokens };
+}
+function subjectOf(r) {
+    return { title: r.title, summary: r.summary, decidedAt: r.decided_at, platform: r.platform };
+}
+/** Re-review R2: a candidate is RETIRED only when a decision OTHER than this pair's source
+ *  supersedes it. The pair's own supersedes row is the thing under review; letting it mark the
+ *  candidate retired would make the resolver refuse the very edge that confirms it. */
+function candidatesOf(g, decision, supersededBy) {
+    return g.pairs.map((p) => {
+        const t = decision(p.targetId);
+        const retired = [...supersededBy(t.id)].some((s) => s !== g.sourceId);
+        return { id: t.id, title: t.title, summary: t.summary, similarity: p.confidence, platform: t.platform, decidedAt: t.decided_at, status: retired ? 'superseded' : null };
+    });
+}
+export async function relinkWithV1(dbPath, opts, classify = classifyCandidateSet) {
+    const plan = planRelink(dbPath);
+    const report = { calls: 0, remainingCalls: 0, proposed: [], written: [], unchanged: 0, omitted: 0, skippedJudged: plan.skippedJudged, keptSupersedes: 0, failed: 0 };
+    const db = opts.apply ? createLocalDb(dbPath) : null;
+    try {
+        for (const [gi, g] of plan.groups.entries()) {
+            if (report.calls >= opts.maxCalls) {
+                report.remainingCalls = plan.groups.length - gi;
+                break;
+            }
+            report.calls += 1;
+            const result = await classify(subjectOf(plan.decision(g.sourceId)), candidatesOf(g, plan.decision, plan.supersededBy));
+            if (!result.ok) {
+                report.failed += 1;
+                if (result.failure?.kind === 'provider_stopped') {
+                    report.stopped = `${result.failure.model} (${result.failure.provider}) stopped answering: ${result.failure.detail}`;
+                    report.remainingCalls = plan.groups.length - gi - 1;
+                    break;
+                }
+                continue;
+            }
+            g.pairs.forEach((p, i) => {
+                const verdict = result.verdicts[i];
+                if (verdict.relation === null) {
+                    report.omitted += 1;
+                    return;
+                }
+                // R2: a supersedes is only overturned by a conflict-family answer; anything else leaves it.
+                if (p.relations.includes('supersedes') && !['supersedes', 'conflicts_with', 'contradicts'].includes(verdict.relation)) {
+                    report.keptSupersedes += 1;
+                    return;
+                }
+                const change = { sourceId: g.sourceId, targetId: p.targetId, from: p.relations, to: verdict.relation };
+                const isNew = !p.relations.includes(verdict.relation);
+                if (isNew)
+                    report.proposed.push(change);
+                else
+                    report.unchanged += 1;
+                if (!db || (!opts.replace && !isNew))
+                    return;
+                const link = { sourceId: g.sourceId, targetId: p.targetId, relation: verdict.relation, confidence: verdict.confidence, detectorVersion: 'v1' };
+                if (opts.replace)
+                    db.replaceLink(link);
+                else
+                    db.insertLink(link);
+                report.written.push(change);
+            });
+        }
+    }
+    finally {
+        db?.close();
+    }
+    return report;
+}
+//# sourceMappingURL=local-relink.js.map

package/dist/lib/local-relink.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-relink.js","sourceRoot":"","sources":["../../src/lib/local-relink.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,oCAAoC,CAAC;AACzG,OAAO,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,EAAE,oBAAoB,EAAqB,MAAM,2BAA2B,CAAC;AACpF,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAsCrD,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;AAEhG,iEAAiE;AACjE,MAAM,UAAU,UAAU,CAAC,MAAc;IACvC,aAAa,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,iDAAiD;IAChF,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,KAAiH,CAAC;IACtH,IAAI,MAAmB,CAAC;IACxB,IAAI,YAAyB,CAAC;IAC9B,IAAI,IAAsB,CAAC;IAC3B,IAAI,CAAC;QACH,GAAG,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;QACxC,KAAK,GAAG,GAAG,CAAC,OAAO,CACjB;;;sBAGgB,CACjB,CAAC,GAAG,EAA6B,CAAC;QACnC,MAAM,UAAU,GAAG,GAAG,CAAC,OAAO,CAAC,0EAA0E,CAAC,CAAC,GAAG,EAA0D,CAAC;QACzK,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC;QACxF,YAAY,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,gBAAgB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9F,IAAI,GAAG,IAAI,GAAG,CAAE,GAAG,CAAC,OAAO,CAAC,gEAAgE,CAAC,CAAC,GAAG,EAAuB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClJ,CAAC;YAAS,CAAC;QACT,GAAG,CAAC,KAAK,EAAE,CAAC;IACd,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjE,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAmD,CAAC;IACzE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChI,SAAS;QACX,CAAC;QACD,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACpH,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YACpF,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC;QACtE,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QAC9H,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAyB,CAAC;IAClD,KAAK,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,KAAK,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IACnH,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAErJ,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAmB,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;IACrD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,QAAQ,KAAK,YAAY,IAAI,CAAC,CAAC,QAAQ,KAAK,sBAAsB;YAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IACxK,CAAC;IACD,MAAM,YAAY,GAAG,CAAC,EAAU,EAAuB,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IAC7F,MAAM,MAAM,GAAG,cAAc,CAAC,mBAAmB,EAAE,CAAC,CAAC;IACrD,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACxC,WAAW,IAAI,MAAM,GAAG,cAAc,CAAC,iBAAiB,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAE,CAAC,EAAE,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,YAAY,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;QACrJ,eAAe,IAAI,GAAG,CAAC;IACzB,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,aAAa,EAAE,OAAO,CAAC,IAAI,EAAE,WAAW,EAAE,eAAe,EAAE,CAAC;AAChJ,CAAC;AAED,SAAS,SAAS,CAAC,CAAM;IACvB,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;AAC/F,CAAC;AAED;;uFAEuF;AACvF,SAAS,YAAY,CAAC,CAAQ,EAAE,QAAyC,EAAE,YAAiD;IAC1H,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACvB,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAE,CAAC;QAChC,MAAM,OAAO,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;QACtE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1K,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,MAAc,EAAE,IAAmB,EAAE,WAAwC,oBAAoB;IAClI,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,MAAM,GAAiB,EAAE,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACnL,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACrD,IAAI,CAAC;QACH,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAC5C,IAAI,MAAM,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAAC,MAAM,CAAC,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;gBAAC,MAAM;YAAC,CAAC;YAC9F,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;YAClB,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAE,CAAC,EAAE,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;YACxH,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;gBACf,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;gBACnB,IAAI,MAAM,CAAC,OAAO,EAAE,IAAI,KAAK,kBAAkB,EAAE,CAAC;oBAChD,MAAM,CAAC,OAAO,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,KAAK,MAAM,CAAC,OAAO,CAAC,QAAQ,wBAAwB,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;oBACpH,MAAM,CAAC,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE,GAAG,CAAC,CAAC;oBACpD,MAAM;gBACR,CAAC;gBACD,SAAS;YACX,CAAC;YACD,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;gBACpC,IAAI,OAAO,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;oBAAC,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC;oBAAC,OAAO;gBAAC,CAAC;gBAC/D,4FAA4F;gBAC5F,IAAI,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,YAAY,EAAE,gBAAgB,EAAE,aAAa,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACtH,MAAM,CAAC,cAAc,IAAI,CAAC,CAAC;oBAC3B,OAAO;gBACT,CAAC;gBACD,MAAM,MAAM,GAAiB,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,SAAS,EAAE,EAAE,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACrH,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBACtD,IAAI,KAAK;oBAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;;oBACnC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;gBAC3B,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC;oBAAE,OAAO;gBAC7C,MAAM,IAAI,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,eAAe,EAAE,IAAa,EAAE,CAAC;gBACxJ,IAAI,IAAI,CAAC,OAAO;oBAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;;oBAClC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBACzB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC9B,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;YAAS,CAAC;QACT,EAAE,EAAE,KAAK,EAAE,CAAC;IACd,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/lib/local-set-classifier.d.ts

@@ -0,0 +1,36 @@
+import { callChatDetailed, type LlmFailure } from './local-llm.js';
+import { type ClassifierFailureReason } from './local-relationship-classifier.js';
+export interface SetSubject {
+    title: string;
+    summary: string;
+    /** null for a proposed change: nothing has decided it yet, so the resolver refuses supersedes. */
+    decidedAt: string | null;
+    platform?: string | null;
+}
+export interface SetCandidate {
+    id: string;
+    title: string;
+    summary: string;
+    similarity: number;
+    platform?: string | null;
+    decidedAt: string | null;
+    status?: string | null;
+}
+export interface SetVerdict {
+    /** The edge to write, or null when the model gave this candidate no relationship. */
+    relation: string | null;
+    confidence: number;
+    reason?: string;
+}
+export type SetOutcome = {
+    ok: true;
+    verdicts: SetVerdict[];
+} | {
+    ok: false;
+    reason: ClassifierFailureReason;
+    failure?: LlmFailure;
+};
+type Call = typeof callChatDetailed;
+export declare function classifyCandidateSet(subject: SetSubject, candidates: readonly SetCandidate[], call?: Call): Promise<SetOutcome>;
+export {};
+//# sourceMappingURL=local-set-classifier.d.ts.map

package/dist/lib/local-set-classifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-set-classifier.d.ts","sourceRoot":"","sources":["../../src/lib/local-set-classifier.ts"],"names":[],"mappings":"AAmBA,OAAO,EAAE,gBAAgB,EAAE,KAAK,UAAU,EAAE,MAAM,gBAAgB,CAAC;AACnE,OAAO,EAAE,KAAK,uBAAuB,EAAiB,MAAM,oCAAoC,CAAC;AAEjG,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,kGAAkG;IAClG,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1B;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACxB;AAED,MAAM,WAAW,UAAU;IACzB,qFAAqF;IACrF,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,MAAM,UAAU,GAClB;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,QAAQ,EAAE,UAAU,EAAE,CAAA;CAAE,GACpC;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,uBAAuB,CAAC;IAAC,OAAO,CAAC,EAAE,UAAU,CAAA;CAAE,CAAC;AAEzE,KAAK,IAAI,GAAG,OAAO,gBAAgB,CAAC;AA0BpC,wBAAsB,oBAAoB,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,YAAY,EAAE,EAAE,IAAI,GAAE,IAAuB,GAAG,OAAO,CAAC,UAAU,CAAC,CA+BvJ"}

package/dist/lib/local-set-classifier.js

@@ -0,0 +1,81 @@
+/**
+ * The v1 local relationship classifier (ALIGN_DETECTOR=v1): ONE model call per check over every
+ * candidate, using the shared detector prompt (src/detector), parsed with the shared contract, and
+ * with `incompatible` resolved to `supersedes` or `conflicts_with` by the deterministic resolver,
+ * never by the model's own label.
+ *
+ * Authorship: the local graph stores no author per decision, so every side is passed with
+ * author null. The resolver reads null as UNKNOWN, and two unknown authors are never the same
+ * author, so the same-author supersession rule cannot fire locally; only a replacement claim
+ * that agrees with the clock can earn `supersedes`. Standing is also null on both sides, which
+ * the resolver treats as equal.
+ *
+ * A candidate the model omits, or whose entry fails the contract, gets `relation: null`: it was
+ * judged and has no typed relationship. A whole-call failure is reported once, for the set.
+ */
+import { DETERMINISTIC_TEMPERATURE } from '@aligndottech/connector-core';
+import { parseRelationshipItem } from '../detector/relationship-contract.js';
+import { buildV1SystemPrompt, buildV1UserPrompt, v1MaxTokens } from '../detector/relationship-prompt.js';
+import { NEW_DECISION_REF, resolveSimilarItem } from '../detector/similar-item.js';
+import { callChatDetailed } from './local-llm.js';
+import { failureReason } from './local-relationship-classifier.js';
+/** The `similar` array from the model's answer, or null when there is none to read. */
+function similarEntries(text) {
+    const start = text.indexOf('{');
+    const end = text.lastIndexOf('}');
+    if (start < 0 || end <= start)
+        return null;
+    let obj;
+    try {
+        obj = JSON.parse(text.slice(start, end + 1));
+    }
+    catch {
+        return null;
+    }
+    if (typeof obj !== 'object' || obj === null)
+        return null;
+    const record = obj;
+    const rel = record['relationships'];
+    const similar = typeof rel === 'object' && rel !== null ? rel['similar'] : record['similar'];
+    return Array.isArray(similar) ? similar : null;
+}
+/** 1-based ordinal as printed in the prompt, as a number or a digit string; anything else is null. */
+function ordinal(value, count) {
+    const n = typeof value === 'number' ? value : typeof value === 'string' && /^\d+$/.test(value.trim()) ? Number(value) : NaN;
+    return Number.isInteger(n) && n >= 1 && n <= count ? n : null;
+}
+export async function classifyCandidateSet(subject, candidates, call = callChatDetailed) {
+    if (!candidates.length)
+        return { ok: true, verdicts: [] };
+    const maxTokens = v1MaxTokens(candidates.length);
+    const result = await call(buildV1SystemPrompt(), (windowTokens) => buildV1UserPrompt(subject, candidates, windowTokens, maxTokens), { temperature: DETERMINISTIC_TEMPERATURE, maxTokens });
+    if (!result.ok)
+        return { ok: false, reason: failureReason(result.failure), failure: result.failure };
+    const entries = similarEntries(result.text);
+    if (entries === null)
+        return { ok: false, reason: 'classifier_unparseable' };
+    const verdicts = candidates.map((c) => ({ relation: null, confidence: c.similarity }));
+    const seen = new Set();
+    const newSide = { id: NEW_DECISION_REF, decidedAt: subject.decidedAt, author: null };
+    for (const entry of entries) {
+        if (typeof entry !== 'object' || entry === null)
+            continue;
+        const ref = ordinal(entry['decision_ref'], candidates.length);
+        if (ref === null || seen.has(ref))
+            continue;
+        seen.add(ref);
+        // The shared schema asks for "reasons": [...]; the contract parser reads one "reason" string.
+        const raw = entry;
+        const reasons = Array.isArray(raw['reasons']) ? raw['reasons'].filter((r) => typeof r === 'string') : [];
+        const item = parseRelationshipItem(JSON.stringify(raw['reason'] === undefined && reasons.length ? { ...raw, reason: reasons.join('; ') } : raw), 'v1Candidate');
+        if (item === null)
+            continue;
+        const c = candidates[ref - 1];
+        const resolved = resolveSimilarItem(item, newSide, { id: c.id, decidedAt: c.decidedAt, author: null, status: c.status ?? null });
+        if (resolved === null)
+            continue;
+        verdicts[ref - 1] = { relation: resolved.type, confidence: resolved.confidence, ...(resolved.reason ? { reason: resolved.reason } : {}) };
+    }
+    return { ok: true, verdicts };
+}
+//# sourceMappingURL=local-set-classifier.js.map

package/dist/lib/local-set-classifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-set-classifier.js","sourceRoot":"","sources":["../../src/lib/local-set-classifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAAE,yBAAyB,EAAE,MAAM,8BAA8B,CAAC;AACzE,OAAO,EAAE,qBAAqB,EAAE,MAAM,sCAAsC,CAAC;AAC7E,OAAO,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,oCAAoC,CAAC;AACzG,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACnF,OAAO,EAAE,gBAAgB,EAAmB,MAAM,gBAAgB,CAAC;AACnE,OAAO,EAAgC,aAAa,EAAE,MAAM,oCAAoC,CAAC;AAiCjG,uFAAuF;AACvF,SAAS,cAAc,CAAC,IAAY;IAClC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,KAAK,GAAG,CAAC,IAAI,GAAG,IAAI,KAAK;QAAE,OAAO,IAAI,CAAC;IAC3C,IAAI,GAAY,CAAC;IACjB,IAAI,CAAC;QACH,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACzD,MAAM,MAAM,GAAG,GAA8B,CAAC;IAC9C,MAAM,GAAG,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC;IACpC,MAAM,OAAO,GAAG,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,CAAC,CAAC,CAAE,GAA+B,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC1H,OAAO,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;AACjD,CAAC;AAED,sGAAsG;AACtG,SAAS,OAAO,CAAC,KAAc,EAAE,KAAa;IAC5C,MAAM,CAAC,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAC5H,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAChE,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,oBAAoB,CAAC,OAAmB,EAAE,UAAmC,EAAE,OAAa,gBAAgB;IAChI,IAAI,CAAC,UAAU,CAAC,MAAM;QAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IAC1D,MAAM,SAAS,GAAG,WAAW,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,MAAM,IAAI,CACvB,mBAAmB,EAAE,EACrB,CAAC,YAAoB,EAAE,EAAE,CAAC,iBAAiB,CAAC,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,SAAS,CAAC,EACzF,EAAE,WAAW,EAAE,yBAAyB,EAAE,SAAS,EAAE,CACtD,CAAC;IACF,IAAI,CAAC,MAAM,CAAC,EAAE;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC;IACrG,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,wBAAwB,EAAE,CAAC;IAE7E,MAAM,QAAQ,GAAiB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IACrG,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,OAAO,GAAG,EAAE,EAAE,EAAE,gBAAgB,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IACrF,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;YAAE,SAAS;QAC1D,MAAM,GAAG,GAAG,OAAO,CAAE,KAAiC,CAAC,cAAc,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QAC3F,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,8FAA8F;QAC9F,MAAM,GAAG,GAAG,KAAgC,CAAC;QAC7C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtH,MAAM,IAAI,GAAG,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,SAAS,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,aAAa,CAAC,CAAC;QAChK,IAAI,IAAI,KAAK,IAAI;YAAE,SAAS;QAC5B,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,GAAG,CAAC,CAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,kBAAkB,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC,CAAC;QACjI,IAAI,QAAQ,KAAK,IAAI;YAAE,SAAS;QAChC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IAC5I,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC"}

package/dist/lib/local-snapshot-loader.d.ts

@@ -0,0 +1,29 @@
+export interface SnapshotDecision {
+    id: string;
+    title: string;
+    summary: string;
+    source_url: string | null;
+    platform: string;
+    decided_at: string | null;
+    repo?: string | null;
+}
+export interface SnapshotLink {
+    source_id: string;
+    target_id: string;
+    relation: string;
+    confidence: number;
+}
+export interface Snapshot {
+    snapshot: string;
+    decisions: SnapshotDecision[];
+    links?: SnapshotLink[];
+}
+export declare function loadSnapshot(s: Snapshot, dbPath: string, opts: {
+    links: boolean;
+    realDbPath?: string;
+    alsoRefuse?: readonly string[];
+}): {
+    decisions: number;
+    links: number;
+};
+//# sourceMappingURL=local-snapshot-loader.d.ts.map

package/dist/lib/local-snapshot-loader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-snapshot-loader.d.ts","sourceRoot":"","sources":["../../src/lib/local-snapshot-loader.ts"],"names":[],"mappings":"AAoBA,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB;AAED,MAAM,WAAW,YAAY;IAAG,SAAS,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE;AAE5G,MAAM,WAAW,QAAQ;IAAG,QAAQ,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,gBAAgB,EAAE,CAAC;IAAC,KAAK,CAAC,EAAE,YAAY,EAAE,CAAA;CAAE;AAuCrG,wBAAgB,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAAC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,GAAG;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CA4B7K"}

package/dist/lib/local-snapshot-loader.js

@@ -0,0 +1,108 @@
+/**
+ * Load a frozen JSON snapshot into a THROWAWAY local graph (shared detector plan, Phase B).
+ *
+ * No user command reaches this: it is driven by scripts/load-local-snapshot.ts, so a benchmark
+ * can build a local graph from the same decisions the hosted arm reads. It keeps each decision's
+ * id, decided_at and platform exactly (ingestBatch re-extracts and cannot), and imports the
+ * snapshot's links only when asked, stamped detector_version 'snapshot' so `align local relink`
+ * (which reads v0 rows only) never re-types them and a count by version separates them.
+ *
+ * It never writes the user's real graph: it refuses a path that already exists (a dangling
+ * symlink included), and any path that lands on the default or the configured local.db, through
+ * symlinks; it validates the whole snapshot before creating any file.
+ */
+import { lstatSync, readlinkSync, realpathSync } from 'node:fs';
+import { basename, dirname, resolve } from 'node:path';
+import { DatabaseSync } from 'node:sqlite';
+import { RELATIONSHIP_CONTRACT } from '../detector/relationship-contract.js';
+import { createLocalDb } from './local-db.js';
+import { getLocalDbPath } from './local-mode.js';
+function validate(s, withLinks) {
+    if (!s.decisions.length)
+        throw new Error('The snapshot holds no decisions; refusing to write an empty graph.');
+    const ids = new Set();
+    for (const d of s.decisions) {
+        if (ids.has(d.id))
+            throw new Error(`The snapshot has a duplicate id "${d.id}".`);
+        ids.add(d.id);
+    }
+    if (!withLinks)
+        return;
+    const types = RELATIONSHIP_CONTRACT.types;
+    for (const l of s.links ?? []) {
+        for (const id of [l.source_id, l.target_id])
+            if (!ids.has(id))
+                throw new Error(`A snapshot link names "${id}", which the snapshot does not hold.`);
+        if (!types.includes(l.relation))
+            throw new Error(`A snapshot link has relation "${l.relation}", which is not in the contract vocabulary.`);
+    }
+}
+/**
+ * Where a path really lands, without requiring it to exist (review F9): the parent directory's
+ * realpath plus the name, following a symlink at the name even when it dangles, so a link to a
+ * real graph that has not been created yet still resolves to that graph's location.
+ */
+function landsAt(p, hops = 0) {
+    const abs = resolve(p);
+    let parent;
+    try {
+        parent = realpathSync(dirname(abs));
+    }
+    catch {
+        parent = dirname(abs);
+    }
+    const here = resolve(parent, basename(abs));
+    if (hops < 40) {
+        try {
+            if (lstatSync(here).isSymbolicLink())
+                return landsAt(resolve(parent, readlinkSync(here)), hops + 1);
+        }
+        catch { /* nothing there: here is where it lands */ }
+    }
+    return here;
+}
+function occupied(p) {
+    try {
+        lstatSync(p);
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+export function loadSnapshot(s, dbPath, opts) {
+    const target = landsAt(dbPath);
+    for (const real of [opts.realDbPath ?? getLocalDbPath(), ...(opts.alsoRefuse ?? [])]) {
+        if (target === landsAt(real))
+            throw new Error(`${dbPath} is the real local graph; load a snapshot into a throwaway path instead.`);
+    }
+    // lstat, not exists: a dangling symlink is occupied too.
+    if (occupied(dbPath) || occupied(target))
+        throw new Error(`${dbPath} already exists; the loader only writes a new, throwaway graph.`);
+    validate(s, opts.links);
+    createLocalDb(dbPath).close(); // creates and migrates the schema
+    const db = new DatabaseSync(dbPath);
+    try {
+        db.exec('BEGIN IMMEDIATE');
+        const insertDecision = db.prepare('INSERT INTO decisions (id, title, summary, source_url, platform, decided_at, repo) VALUES (?, ?, ?, ?, ?, ?, ?)');
+        for (const d of s.decisions)
+            insertDecision.run(d.id, d.title, d.summary, d.source_url, d.platform, d.decided_at, d.repo ?? null);
+        let links = 0;
+        if (opts.links) {
+            const insertLink = db.prepare(`INSERT OR IGNORE INTO decision_links (id, source_id, target_id, relation, confidence, detector_version) VALUES (?, ?, ?, ?, ?, 'snapshot')`);
+            for (const [i, l] of (s.links ?? []).entries())
+                links += Number(insertLink.run(`snapshot:${i}`, l.source_id, l.target_id, l.relation, l.confidence).changes);
+        }
+        db.exec('COMMIT');
+        return { decisions: s.decisions.length, links };
+    }
+    catch (err) {
+        if (db.isTransaction)
+            db.exec('ROLLBACK');
+        throw err;
+    }
+    finally {
+        db.close();
+    }
+}
+//# sourceMappingURL=local-snapshot-loader.js.map

package/dist/lib/local-snapshot-loader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-snapshot-loader.js","sourceRoot":"","sources":["../../src/lib/local-snapshot-loader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,qBAAqB,EAAE,MAAM,sCAAsC,CAAC;AAC7E,OAAO,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAgBjD,SAAS,QAAQ,CAAC,CAAW,EAAE,SAAkB;IAC/C,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,oEAAoE,CAAC,CAAC;IAC/G,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;QAC5B,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACjF,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAChB,CAAC;IACD,IAAI,CAAC,SAAS;QAAE,OAAO;IACvB,MAAM,KAAK,GAAsB,qBAAqB,CAAC,KAAK,CAAC;IAC7D,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;QAC9B,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,EAAE,sCAAsC,CAAC,CAAC;QACnJ,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC,QAAQ,6CAA6C,CAAC,CAAC;IAC7I,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,OAAO,CAAC,CAAS,EAAE,IAAI,GAAG,CAAC;IAClC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,MAAc,CAAC;IACnB,IAAI,CAAC;QAAC,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAAC,CAAC;IAC7E,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC;QACd,IAAI,CAAC;YACH,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,cAAc,EAAE;gBAAE,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;QACtG,CAAC;QAAC,MAAM,CAAC,CAAC,2CAA2C,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS;IACzB,IAAI,CAAC;QAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAAC,OAAO,IAAI,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,KAAK,CAAC;IAAC,CAAC;AAC5D,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,CAAW,EAAE,MAAc,EAAE,IAA6E;IACrI,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,cAAc,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;QACrF,IAAI,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,GAAG,MAAM,0EAA0E,CAAC,CAAC;IACrI,CAAC;IACD,yDAAyD;IACzD,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,MAAM,iEAAiE,CAAC,CAAC;IACtI,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAExB,aAAa,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,kCAAkC;IACjE,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;IACpC,IAAI,CAAC;QACH,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAC3B,MAAM,cAAc,GAAG,EAAE,CAAC,OAAO,CAAC,iHAAiH,CAAC,CAAC;QACrJ,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS;YAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;QAClI,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,MAAM,UAAU,GAAG,EAAE,CAAC,OAAO,CAAC,4IAA4I,CAAC,CAAC;YAC5K,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE;gBAAE,KAAK,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC;QAC/J,CAAC;QACD,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAClB,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC;IAClD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,EAAE,CAAC,aAAa;YAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1C,MAAM,GAAG,CAAC;IACZ,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;AACH,CAAC"}

package/dist/lib/local-thresholds.d.ts

@@ -0,0 +1,70 @@
+/**
+ * The similarity thresholds the local graph ranks and links with. Moved verbatim out of
+ * local-gateway-client.ts (which re-exports every name, so no importer changes) so the link
+ * pass can use them without importing the client that calls it.
+ */
+/**
+ * Cosine floor for linking two decisions as related on ingest.
+ *
+ * Named CONFLICT_THRESHOLD until ALI-503, which was the same category error as the code
+ * it governed: the value decides similarity, and similarity is not opposition. The
+ * classifier prompt in local-relationship-classifier.ts says so directly - "high textual
+ * similarity alone is NOT a conflict" - and the link written here is `relates` because an
+ * embedding cannot tell agreement from opposition. Only a classifier reading both can, and
+ * its verdict is never persisted as a link.
+ */
+export declare const SIMILARITY_THRESHOLD = 0.65;
+/**
+ * Relevance floor for align_ask / align_search.
+ *
+ * Was an inline 0.1, the only unnamed threshold in this file and less than a quarter of
+ * its neighbours. It let align_ask answer "what happens when the brain service is down"
+ * with two unrelated decisions at 0.18 and 0.14 - noise the agent had to recognise by
+ * reading the decimals itself, and an audience cannot.
+ *
+ * 0.25 matches the gateway's own /decisions/smart-search floor, so the same question gets
+ * the same relevance bar in local and cloud mode. Lower than the 0.45 used for relatedness
+ * on purpose: search is a human asking a natural-language question, where a looser match is
+ * still worth showing, while relatedness is machinery acting on its own.
+ *
+ * An honest empty result is the point. "The graph has nothing on this" is a better answer
+ * than two wrong decisions, because the caller can act on it.
+ */
+export declare const SEARCH_THRESHOLD = 0.25;
+/**
+ * Candidate floor for ADJUDICATION - the path that then pays an LLM per candidate.
+ *
+ * Deliberately higher than the retrieval floor below, because this surface is expensive in
+ * three ways the hook is not: up to 5 sequential calls to the user's own provider, ~11s of
+ * latency, and an exit code. A keyless CI runner that gets `no-context` today exits 0; the
+ * moment retrieval finds anything it gets `unknown` and exits 2. And the classifier cannot
+ * reject a candidate - its vocabulary is ten positive relations with no "unrelated" - so a
+ * loose candidate that reaches it is reported rather than filtered.
+ *
+ * Deliberately NOT recalibrated with the retrieval floor. Measured on the corpus, 0.30 would
+ * recover four more related pairs here too, and that trade is a separate decision with a
+ * separate blast radius (see relatedness-calibration.test.ts).
+ */
+export declare const RELATES_THRESHOLD = 0.45;
+/**
+ * Candidate floor for RETRIEVAL ONLY (`depth: 'related'`, the agent editor hook).
+ *
+ * Measured, not chosen. Against fixtures/relatedness-corpus.json: 0.45 recovered 3 of 8 related
+ * pairs, 0.30 recovers 7 of 8, and neither admits a single unrelated pair. 0.25 scores the same
+ * 7 of 8, so the tie-break is margin over the worst false positive (0.2051): 0.30 clears it by
+ * 0.095 against 0.25's 0.045.
+ *
+ * 0.30 is also where this constant sat until commit 0cbef08 raised it to 0.45 inside a rename,
+ * unmentioned and unmeasured. So this is a revert with evidence attached rather than a new
+ * guess, and the evidence is a test that fails if the corpus stops supporting it.
+ *
+ * Safe to be looser here precisely because this path is cheap and honest: it returns above
+ * Stage 2, so it makes no provider call, and what the hook prints declines to assert anything
+ * ("related by content search and have NOT been adjudicated"). That is the same posture as
+ * `align search`, which has run at 0.25 all along - as has MCP `align_get_related_decisions`.
+ */
+export declare const RETRIEVAL_RELATES_THRESHOLD = 0.3;
+export declare const RELATED_TOP_K = 3;
+export declare const RELATED_FLOOR = 0.45;
+export declare const DRIFT_THRESHOLD = 0.5;
+//# sourceMappingURL=local-thresholds.d.ts.map

package/dist/lib/local-thresholds.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-thresholds.d.ts","sourceRoot":"","sources":["../../src/lib/local-thresholds.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;;;;;GASG;AACH,eAAO,MAAM,oBAAoB,OAAO,CAAC;AACzC;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,gBAAgB,OAAO,CAAC;AACrC;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,iBAAiB,OAAO,CAAC;AAEtC;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,2BAA2B,MAAM,CAAC;AAQ/C,eAAO,MAAM,aAAa,IAAI,CAAC;AAC/B,eAAO,MAAM,aAAa,OAAoB,CAAC;AAI/C,eAAO,MAAM,eAAe,MAAM,CAAC"}

package/dist/lib/local-thresholds.js

@@ -0,0 +1,79 @@
+/**
+ * The similarity thresholds the local graph ranks and links with. Moved verbatim out of
+ * local-gateway-client.ts (which re-exports every name, so no importer changes) so the link
+ * pass can use them without importing the client that calls it.
+ */
+/**
+ * Cosine floor for linking two decisions as related on ingest.
+ *
+ * Named CONFLICT_THRESHOLD until ALI-503, which was the same category error as the code
+ * it governed: the value decides similarity, and similarity is not opposition. The
+ * classifier prompt in local-relationship-classifier.ts says so directly - "high textual
+ * similarity alone is NOT a conflict" - and the link written here is `relates` because an
+ * embedding cannot tell agreement from opposition. Only a classifier reading both can, and
+ * its verdict is never persisted as a link.
+ */
+export const SIMILARITY_THRESHOLD = 0.65;
+/**
+ * Relevance floor for align_ask / align_search.
+ *
+ * Was an inline 0.1, the only unnamed threshold in this file and less than a quarter of
+ * its neighbours. It let align_ask answer "what happens when the brain service is down"
+ * with two unrelated decisions at 0.18 and 0.14 - noise the agent had to recognise by
+ * reading the decimals itself, and an audience cannot.
+ *
+ * 0.25 matches the gateway's own /decisions/smart-search floor, so the same question gets
+ * the same relevance bar in local and cloud mode. Lower than the 0.45 used for relatedness
+ * on purpose: search is a human asking a natural-language question, where a looser match is
+ * still worth showing, while relatedness is machinery acting on its own.
+ *
+ * An honest empty result is the point. "The graph has nothing on this" is a better answer
+ * than two wrong decisions, because the caller can act on it.
+ */
+export const SEARCH_THRESHOLD = 0.25;
+/**
+ * Candidate floor for ADJUDICATION - the path that then pays an LLM per candidate.
+ *
+ * Deliberately higher than the retrieval floor below, because this surface is expensive in
+ * three ways the hook is not: up to 5 sequential calls to the user's own provider, ~11s of
+ * latency, and an exit code. A keyless CI runner that gets `no-context` today exits 0; the
+ * moment retrieval finds anything it gets `unknown` and exits 2. And the classifier cannot
+ * reject a candidate - its vocabulary is ten positive relations with no "unrelated" - so a
+ * loose candidate that reaches it is reported rather than filtered.
+ *
+ * Deliberately NOT recalibrated with the retrieval floor. Measured on the corpus, 0.30 would
+ * recover four more related pairs here too, and that trade is a separate decision with a
+ * separate blast radius (see relatedness-calibration.test.ts).
+ */
+export const RELATES_THRESHOLD = 0.45;
+/**
+ * Candidate floor for RETRIEVAL ONLY (`depth: 'related'`, the agent editor hook).
+ *
+ * Measured, not chosen. Against fixtures/relatedness-corpus.json: 0.45 recovered 3 of 8 related
+ * pairs, 0.30 recovers 7 of 8, and neither admits a single unrelated pair. 0.25 scores the same
+ * 7 of 8, so the tie-break is margin over the worst false positive (0.2051): 0.30 clears it by
+ * 0.095 against 0.25's 0.045.
+ *
+ * 0.30 is also where this constant sat until commit 0cbef08 raised it to 0.45 inside a rename,
+ * unmentioned and unmeasured. So this is a revert with evidence attached rather than a new
+ * guess, and the evidence is a test that fails if the corpus stops supporting it.
+ *
+ * Safe to be looser here precisely because this path is cheap and honest: it returns above
+ * Stage 2, so it makes no provider call, and what the hook prints declines to assert anything
+ * ("related by content search and have NOT been adjudicated"). That is the same posture as
+ * `align search`, which has run at 0.25 all along - as has MCP `align_get_related_decisions`.
+ */
+export const RETRIEVAL_RELATES_THRESHOLD = 0.3;
+// ALI-785: the ABSOLUTE floor above is unreachable for cross-register pairs on
+// MiniLM-L6 - measured on a 403-decision six-source corpus, near-duplicates score
+// ~0.95, genuine cross-tool paraphrases 0.45-0.62, background noise 0.28-0.40, and
+// 0 of 1,729 links crossed a platform. So linking also takes each item's top few
+// neighbours RELATIVE to its own ranking, floored where the noise band ends. 0.45 is
+// the adjudication floor the product already uses elsewhere; text-cleaning schemes
+// were lab-tested first and moved nothing (title+cleaned scored 0.274 vs 0.286 raw).
+export const RELATED_TOP_K = 3;
+export const RELATED_FLOOR = RELATES_THRESHOLD;
+// Below this similarity between a decision and new content, the content is
+// considered to have drifted from the decision.
+export const DRIFT_THRESHOLD = 0.5;
+//# sourceMappingURL=local-thresholds.js.map

package/dist/lib/local-thresholds.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-thresholds.js","sourceRoot":"","sources":["../../src/lib/local-thresholds.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,IAAI,CAAC;AACzC;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,CAAC;AACrC;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAEtC;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,GAAG,CAAC;AAC/C,+EAA+E;AAC/E,kFAAkF;AAClF,mFAAmF;AACnF,iFAAiF;AACjF,qFAAqF;AACrF,mFAAmF;AACnF,qFAAqF;AACrF,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAC/B,MAAM,CAAC,MAAM,aAAa,GAAG,iBAAiB,CAAC;AAE/C,2EAA2E;AAC3E,gDAAgD;AAChD,MAAM,CAAC,MAAM,eAAe,GAAG,GAAG,CAAC"}