comisai 1.0.44 → 1.0.46

package/node_modules/@comis/agent/dist/rag/recall-provenance.js

@@ -1,6 +1,6 @@
 // SPDX-License-Identifier: Apache-2.0
 /**
- * applyProvenanceDownweighting — the DIST-03 post-fusion provenance down-weighting
+ * applyProvenanceDownweighting — the post-fusion provenance down-weighting
  * pass, extracted from memory-recall.ts (which crossed the 800-line cap when the
  * pass was added inline; mirrors the recall-causal-lane / recall-graph-spread-lane
  * extractions). PURE, synchronous, NON-DELETING helper.
@@ -9,7 +9,7 @@
  * (× {@link PROVENANCE_DOWNWEIGHT_FACTOR}) the same-conversation paired/source memories
  * the distilled summary subsumes — so the lossy summary does not double-count with its
  * own paired source rows in the recall budget. The memory is DEMOTED, never deleted:
- * it stays accessible, just ranked lower. CR-01 (Phase 173-05): the demotion RE-SORTS the
+ * it stays accessible, just ranked lower. The demotion RE-SORTS the
  * returned array by descending score (STABLE — index tiebreaker) so it is observable in
  * RANK, not merely in the `score` field — nothing downstream re-sorts (deduplicateResults
  * preserves order; the hybrid injector consumes the array in order), so without the re-sort
@@ -26,11 +26,11 @@
  * Architecture cut (agent↛memory): TYPE-only imports from @comis/core. This file NEVER
  * imports @comis/memory.
  *
- * LIVE AS OF PHASE 173 (C2): the caller's `provenanceStore` is now injected at the
- * composition root (setup-memory builds the concrete LcdProvenanceReadStore and threads it
- * to createMemoryRecall) and the distillation runner stamps the `summary:<id>` tag, so the
- * PROVENANCE-PRECISE branch is the primary selector. The helper itself is UNCHANGED — it
- * remains a byte-identical no-op when no lcd_distilled result is present.
+ * The caller's `provenanceStore` is injected at the composition root (setup-memory
+ * builds the concrete LcdProvenanceReadStore and threads it to createMemoryRecall) and
+ * the distillation runner stamps the `summary:<id>` tag, so the PROVENANCE-PRECISE
+ * branch is the primary selector. The helper remains a byte-identical no-op when no
+ * lcd_distilled result is present.
  *
  * @module
  */
@@ -45,7 +45,7 @@ export const SUMMARY_TAG_PREFIX = "summary:";
  */
 export const PROVENANCE_DOWNWEIGHT_FACTOR = 0.5;
 /**
- * POST-FUSION PROVENANCE DOWN-WEIGHTING (DIST-03, read-side).
+ * POST-FUSION PROVENANCE DOWN-WEIGHTING (read-side).
  *
  * Given the post-MMR ranked candidates, when one or more carries the `lcd_distilled`
  * tag, demote the same-conversation paired memories the distilled summary subsumes.
@@ -54,18 +54,18 @@ export const PROVENANCE_DOWNWEIGHT_FACTOR = 0.5;
  *  1. PROVENANCE-PRECISE (load-bearing `getProvenanceForSummary`): for any distilled
  *     summary that carries a `summary:<id>` tag, query the provenance read store for
  *     that summaryId and down-weight the returned `memoryId`s that appear in `ranked`.
- *     PRIMARY as of 173-04 (the distillation runner stamps the tag).
- *  2. SESSION HEURISTIC (FALLBACK ONLY — IN-03, Phase 173-05): down-weight every
+ *     PRIMARY selector (the distillation runner stamps the tag).
+ *  2. SESSION HEURISTIC (FALLBACK ONLY): down-weight every
  *     NON-distilled candidate sharing the distilled summary's `source.sessionKey`. This is
  *     over-broad (it cannot distinguish a legitimately-distinct same-session memory from a
  *     genuinely-subsumed one — neither MemorySource nor the provenance row carries the
  *     covered time range), so it is GATED behind the ABSENCE of a usable `summary:<id>` tag:
  *     when branch (1) can select precisely it OWNS the selection and branch (2) is SKIPPED;
  *     the heuristic fires only for a distilled row that has no precise tag (older rows / a
- *     write that skipped it). This stops the now-effective re-sort (CR-01) from suppressing
+ *     write that skipped it). This stops the re-sort from suppressing
  *     legitimately-distinct same-session recall.
  *
- * W6 PRECEDENCE FIX: `candidateIsDistilled` is computed as a SEPARATE boolean BEFORE
+ * PRECEDENCE GUARD: `candidateIsDistilled` is computed as a SEPARATE boolean BEFORE
  * the `&&`-chain, so the predicate `candidate.id !== summary.id && !candidateIsDistilled`
  * is unambiguous — the distilled summary itself, and any OTHER lcd_distilled entry, are
  * NEVER added to the down-weight set (the `&&`/`||` precedence trap cannot fire).
@@ -73,7 +73,7 @@ export const PROVENANCE_DOWNWEIGHT_FACTOR = 0.5;
  * @param ranked          The post-MMR scored candidates (NOT mutated; a new array is
  *                        returned only when ≥1 candidate is down-weighted).
  * @param provenanceStore The injected provenance read port (the caller proved it defined).
- * @param scope           The (tenant, agent)-scoped ContextStoreScope for the R4 read.
+ * @param scope           The (tenant, agent)-scoped ContextStoreScope for the provenance read.
  */
 export function applyProvenanceDownweighting(ranked, provenanceStore, scope) {
     const isDistilled = (r) => Array.isArray(r.entry.tags) && r.entry.tags.includes(LCD_DISTILLED_TAG);
@@ -84,7 +84,7 @@ export function applyProvenanceDownweighting(ranked, provenanceStore, scope) {
     const downweightSet = new Set();
     for (const summary of distilledSummaries) {
         // (1) PROVENANCE-PRECISE — only when the distilled summary carries its summaryId tag.
-        //     This is the PRIMARY selector as of 173-04: the distillation runner now stamps
+        //     This is the PRIMARY selector: the distillation runner stamps
         //     `summary:<id>`, so a precise provenance read links the EXACT subsumed rows.
         const summaryTag = (summary.entry.tags ?? []).find((t) => t.startsWith(SUMMARY_TAG_PREFIX));
         const summaryId = summaryTag !== undefined ? summaryTag.slice(SUMMARY_TAG_PREFIX.length) : "";
@@ -94,7 +94,7 @@ export function applyProvenanceDownweighting(ranked, provenanceStore, scope) {
             const linkedMemoryIds = new Set(rows.map((row) => row.memoryId));
             for (const candidate of ranked) {
                 const candidateIsDistilled = isDistilled(candidate);
-                // Same W6-safe predicate: never the summary itself, never another distilled row.
+                // Same precedence-safe predicate: never the summary itself, never another distilled row.
                 if (candidate.entry.id !== summary.entry.id &&
                     !candidateIsDistilled &&
                     linkedMemoryIds.has(candidate.entry.id)) {
@@ -103,12 +103,12 @@ export function applyProvenanceDownweighting(ranked, provenanceStore, scope) {
             }
         }
         // (2) SESSION HEURISTIC — same-conversation paired rows (the covered conversation).
-        //     IN-03 SCOPING (Phase 173-05): this branch down-weights EVERY non-distilled
+        //     SCOPING: this branch down-weights EVERY non-distilled
         //     candidate sharing the summary's sessionKey, which over-demotes a long-lived
         //     session (it cannot tell a legitimately-distinct same-session memory from a
         //     genuinely-subsumed one — neither the MemorySource nor the provenance row
-        //     carries the summary's covered time range to scope it precisely). Now that the
-        //     pass is EFFECTIVE (CR-01 re-sort below makes the demotion change rank), that
+        //     carries the summary's covered time range to scope it precisely). Because the
+        //     pass is EFFECTIVE (the re-sort below makes the demotion change rank), that
         //     over-reach would suppress relevant recall. So branch (2) is GATED behind the
         //     ABSENCE of a usable `summary:<id>` tag: when branch (1) can select precisely it
         //     OWNS the selection; the heuristic only fires as the fallback for a distilled
@@ -118,7 +118,7 @@ export function applyProvenanceDownweighting(ranked, provenanceStore, scope) {
         const sourceSessionKey = summary.entry.source?.sessionKey;
         if (sourceSessionKey !== undefined && sourceSessionKey.length > 0) {
             for (const candidate of ranked) {
-                // W6 FIX: compute candidateIsDistilled as a SEPARATE boolean first, then the
+                // Compute candidateIsDistilled as a SEPARATE boolean first, then the
                 // fully-parenthesized predicate — the distilled summary itself (and any other
                 // lcd_distilled entry) is excluded unambiguously.
                 const candidateIsDistilled = isDistilled(candidate);
@@ -138,11 +138,11 @@ export function applyProvenanceDownweighting(ranked, provenanceStore, scope) {
     const downweighted = ranked.map((r) => downweightSet.has(r.entry.id)
         ? { ...r, score: (r.score ?? 1.0) * PROVENANCE_DOWNWEIGHT_FACTOR }
         : r);
-    // CR-01 (Phase 173-05): the demotion must be observable in RANK, not just the `score`
-    // field. The down-weighting previously changed `score` but PRESERVED array position,
+    // The demotion must be observable in RANK, not just the `score`
+    // field. Changing `score` alone would PRESERVE array position,
     // and nothing downstream re-sorts (deduplicateResults preserves order; the hybrid
-    // injector consumes the array IN ORDER) — so a halved row kept its exact slot and the
-    // "don't double-count the lossy summary" intent was a no-op for ranking. Re-sort by
+    // injector consumes the array IN ORDER) — a halved row would keep its exact slot and the
+    // "don't double-count the lossy summary" intent would be a no-op for ranking. Re-sort by
     // DESCENDING score so the demoted rows actually sink. The sort is STABLE (index
     // tiebreaker) — it mirrors how scoreWithBreakdown/fuse establish rank and keeps the
     // relative order of equal-scored (incl. non-down-weighted) rows identical to the input.

package/node_modules/@comis/agent/dist/rag/recall-record.d.ts

@@ -49,10 +49,10 @@ export interface RecallLaneCounts {
     vector: number;
     entity: number;
     /** Temporal-spread lane candidate count (append-only). 0 when the lane is
-     *  off / not pushed (default) — byte-identical to before this plan. */
+     *  off / not pushed (default) — the record shape is unchanged by the lane. */
     temporal: number;
     /** Causal one-hop lane candidate count (append-only). 0 when the lane is
-     *  off / not pushed (default) — byte-identical to before this plan. */
+     *  off / not pushed (default) — the record shape is unchanged by the lane. */
     causal: number;
 }
 /**
@@ -80,7 +80,7 @@ export interface RecallObservations {
     durationMs: number;
     /** Reasoning-tree provenance: each cited claim → its recalled id →
      *  its sourceIds. IDS ONLY (redaction-safe). Absent/empty on every non-dialectic recall,
-     *  so the on-disk line stays byte-identical to before this plan (omitted by buildRecallRecord). */
+     *  so the on-disk line carries no citations cluster (omitted by buildRecallRecord). */
     citations?: RecallCitationChain[];
 }
 /**

package/node_modules/@comis/agent/dist/rag/recall-record.js

@@ -59,8 +59,8 @@ export function buildRecallRecord(obs) {
     if (obs.degradations.length > 0)
         record.degradations = obs.degradations;
     // Reasoning-tree provenance — each cited claim → its recalled id → its sourceIds.
-    // Added ONLY when present + non-empty so the default (non-dialectic) recall line is
-    // byte-identical to before this plan. The chain is IDS ONLY (no memory body).
+    // Added ONLY when present + non-empty so the default (non-dialectic) recall line
+    // carries no citations cluster. The chain is IDS ONLY (no memory body).
     if (obs.citations && obs.citations.length > 0)
         record.citations = obs.citations;
     return record;

package/node_modules/@comis/agent/dist/rag/recall-security-prefilter.d.ts

@@ -1,16 +1,16 @@
 /**
- * prefilterLanes — the RETR-04 pre-fusion security gate, extracted from memory-recall.ts
+ * prefilterLanes — the pre-fusion security gate, extracted from memory-recall.ts
  * (which is at the 800-line cap; mirrors the recall-provenance / recall-causal-lane
  * extractions). PURE, synchronous helper.
  *
- * RETR-04 / design §17 S6: the unified arbiter (Plan 03) ranks LTM T3/T4 candidates
+ * The unified arbiter ranks LTM T3/T4 candidates
  * against history by FUSED rank. A trust-excluded OR sub-floor memory must NEVER be
- * resurrected by a high fused rank, so BOTH the trust filter and the R3 baseFloor run
+ * resurrected by a high fused rank, so BOTH the trust filter and the baseFloor run
  * UPSTREAM of `fuse()` — on each candidate lane's results BEFORE fusion — not only on the
  * post-fusion ranked list. The downstream trust filter + baseFloor in memory-recall.ts are
  * RETAINED as defense in depth.
  *
- * Why baseFloor MUST be pre-fuse (RESEARCH Pitfall 2, proven by a bypass-attempt test):
+ * Why baseFloor MUST be pre-fuse (proven by a bypass-attempt test):
  * `fuse()` re-normalizes scores to the RRF rank scale, so a sub-floor candidate that is
  * rank-1 in its lanes emerges with a HIGH fused `score`. The downstream baseFloor reads
  * `ScoreBreakdown.base` (= the post-fuse `result.score`), which the inflation lifts above
@@ -21,12 +21,12 @@
  *
  * DEFAULT-OFF BYTE-IDENTITY: when every lane result is already trust-allowed AND the floor
  * is 0 (frontier/mid recency-first, unconfigured), each lane's results array is returned
- * UNCHANGED (same reference, same order), so fuse() sees exactly the lanes it saw pre-patch
- * and the fused output is byte-identical (LOCKED #2). A lane is rebuilt only when the gate
+ * UNCHANGED (same reference, same order), so fuse() sees exactly the lanes it would see
+ * without the gate and the fused output is byte-identical. A lane is rebuilt only when the gate
  * actually drops an entry (a disallowed trust level, or — when a floor is enforced — a
  * sub-floor score).
  *
- * CONTENT-FREE OBSERVABILITY (§2.7): the helper returns the dropped entry IDS only (never
+ * CONTENT-FREE OBSERVABILITY (AGENTS.md §2.7): the helper returns the dropped entry IDS only (never
  * content or query text), so the caller's recall trace can record the upstream DROP count /
  * ids the same way the downstream trust filter captures `trustFilteredIds`.
  *
@@ -39,7 +39,7 @@ import type { TrustLevel, ComisLogger } from "@comis/core";
 import type { FusionLane } from "./fuse.js";
 import type { ScoreBreakdown } from "./score.js";
 /**
- * R3 base-score floor decision (T-153-poison mitigation), FAIL-CLOSED (WR-02).
+ * Base-score floor decision (poisoned-memory mitigation), FAIL-CLOSED.
  *
  * A memory survives the floor ONLY when its recorded pre-boost `breakdown.base`
  * is at or above `baseFloor` (boundary inclusive). A memory with NO breakdown
@@ -57,25 +57,25 @@ import type { ScoreBreakdown } from "./score.js";
  */
 export declare function passesBaseFloor(breakdown: ScoreBreakdown | undefined, baseFloor: number): boolean;
 /**
- * RETR-04 / WR-02 (Phase 173): the class-default base floor enforced when the unified
+ * The class-default base floor enforced when the unified
  * arbiter is active (relevanceFirst) and the operator left baseFloor UNCONFIGURED (0).
  *
  * Mirrors SMALL_NANO_DEFAULT_BASE_FLOOR in scaffold-defaults.ts (the resolver already
  * resolves small/nano to 0.15; this is the recall gate's own fail-closed floor so an
  * unconfigured 0 reaching the gate under the arbiter is NEVER silently skipped). Kept in
- * sync with the resolver via the Phase-153 poison fixture (base=0.12 dropped, 0.40 kept).
+ * sync with the resolver via the shared poison fixture (base=0.12 dropped, 0.40 kept).
  */
 export declare const RELEVANCE_FIRST_DEFAULT_BASE_FLOOR: 0.15;
 /**
- * Resolve the effective R3 base floor (WR-02 fail-closed, arbiter-scoped). Pure.
+ * Resolve the effective base floor (fail-closed, arbiter-scoped). Pure.
  *
  * Precedence:
  *   • explicit operator floor (configuredBaseFloor > 0) → always wins (every class);
  *   • relevanceFirst (arbiter active) AND unconfigured (0) → the class default 0.15
- *     (an arbiter that ranks LTM against history needs the floor enforced — the WR-02
- *     fail-open closure, design §17 S6);
- *   • otherwise (frontier/mid recency-first, unconfigured) → 0 (filter skipped,
- *     byte-identical to v2.14, LOCKED #2).
+ *     (an arbiter that ranks LTM against history needs the floor enforced — an
+ *     unconfigured 0 must not silently disable the security gate);
+ *   • otherwise (frontier/mid recency-first, unconfigured) → 0 (filter skipped —
+ *     the un-gated pipeline, byte-identical).
  *
  * @returns the floor to enforce; `0` means "no floor — skip the filter".
  */
@@ -123,7 +123,7 @@ export interface PrefilterAccumulator {
  */
 export declare function gateLanes(lanes: FusionLane[], allowed: ReadonlySet<TrustLevel>, baseFloor: number, acc: PrefilterAccumulator): FusionLane[];
 /**
- * §2.7 instrumentation for the new pre-fusion security boundary — CONTENT-FREE (counts +
+ * Boundary instrumentation (AGENTS.md §2.7) for the pre-fusion security gate — CONTENT-FREE (counts +
  * booleans only, NEVER memory bodies or query text). DEBUG (N-per-recall internal stage),
  * emitted only when the gate actually dropped a candidate so a clean corpus stays silent.
  * Makes a pre-fusion poisoning drop diagnosable from logs alone.

package/node_modules/@comis/agent/dist/rag/recall-security-prefilter.js

@@ -1,17 +1,17 @@
 // SPDX-License-Identifier: Apache-2.0
 /**
- * prefilterLanes — the RETR-04 pre-fusion security gate, extracted from memory-recall.ts
+ * prefilterLanes — the pre-fusion security gate, extracted from memory-recall.ts
  * (which is at the 800-line cap; mirrors the recall-provenance / recall-causal-lane
  * extractions). PURE, synchronous helper.
  *
- * RETR-04 / design §17 S6: the unified arbiter (Plan 03) ranks LTM T3/T4 candidates
+ * The unified arbiter ranks LTM T3/T4 candidates
  * against history by FUSED rank. A trust-excluded OR sub-floor memory must NEVER be
- * resurrected by a high fused rank, so BOTH the trust filter and the R3 baseFloor run
+ * resurrected by a high fused rank, so BOTH the trust filter and the baseFloor run
  * UPSTREAM of `fuse()` — on each candidate lane's results BEFORE fusion — not only on the
  * post-fusion ranked list. The downstream trust filter + baseFloor in memory-recall.ts are
  * RETAINED as defense in depth.
  *
- * Why baseFloor MUST be pre-fuse (RESEARCH Pitfall 2, proven by a bypass-attempt test):
+ * Why baseFloor MUST be pre-fuse (proven by a bypass-attempt test):
  * `fuse()` re-normalizes scores to the RRF rank scale, so a sub-floor candidate that is
  * rank-1 in its lanes emerges with a HIGH fused `score`. The downstream baseFloor reads
  * `ScoreBreakdown.base` (= the post-fuse `result.score`), which the inflation lifts above
@@ -22,12 +22,12 @@
  *
  * DEFAULT-OFF BYTE-IDENTITY: when every lane result is already trust-allowed AND the floor
  * is 0 (frontier/mid recency-first, unconfigured), each lane's results array is returned
- * UNCHANGED (same reference, same order), so fuse() sees exactly the lanes it saw pre-patch
- * and the fused output is byte-identical (LOCKED #2). A lane is rebuilt only when the gate
+ * UNCHANGED (same reference, same order), so fuse() sees exactly the lanes it would see
+ * without the gate and the fused output is byte-identical. A lane is rebuilt only when the gate
  * actually drops an entry (a disallowed trust level, or — when a floor is enforced — a
  * sub-floor score).
  *
- * CONTENT-FREE OBSERVABILITY (§2.7): the helper returns the dropped entry IDS only (never
+ * CONTENT-FREE OBSERVABILITY (AGENTS.md §2.7): the helper returns the dropped entry IDS only (never
  * content or query text), so the caller's recall trace can record the upstream DROP count /
  * ids the same way the downstream trust filter captures `trustFilteredIds`.
  *
@@ -37,7 +37,7 @@
  * @module
  */
 /**
- * R3 base-score floor decision (T-153-poison mitigation), FAIL-CLOSED (WR-02).
+ * Base-score floor decision (poisoned-memory mitigation), FAIL-CLOSED.
  *
  * A memory survives the floor ONLY when its recorded pre-boost `breakdown.base`
  * is at or above `baseFloor` (boundary inclusive). A memory with NO breakdown
@@ -57,25 +57,25 @@ export function passesBaseFloor(breakdown, baseFloor) {
     return breakdown !== undefined && breakdown.base >= baseFloor;
 }
 /**
- * RETR-04 / WR-02 (Phase 173): the class-default base floor enforced when the unified
+ * The class-default base floor enforced when the unified
  * arbiter is active (relevanceFirst) and the operator left baseFloor UNCONFIGURED (0).
  *
  * Mirrors SMALL_NANO_DEFAULT_BASE_FLOOR in scaffold-defaults.ts (the resolver already
  * resolves small/nano to 0.15; this is the recall gate's own fail-closed floor so an
  * unconfigured 0 reaching the gate under the arbiter is NEVER silently skipped). Kept in
- * sync with the resolver via the Phase-153 poison fixture (base=0.12 dropped, 0.40 kept).
+ * sync with the resolver via the shared poison fixture (base=0.12 dropped, 0.40 kept).
  */
 export const RELEVANCE_FIRST_DEFAULT_BASE_FLOOR = 0.15;
 /**
- * Resolve the effective R3 base floor (WR-02 fail-closed, arbiter-scoped). Pure.
+ * Resolve the effective base floor (fail-closed, arbiter-scoped). Pure.
  *
  * Precedence:
  *   • explicit operator floor (configuredBaseFloor > 0) → always wins (every class);
  *   • relevanceFirst (arbiter active) AND unconfigured (0) → the class default 0.15
- *     (an arbiter that ranks LTM against history needs the floor enforced — the WR-02
- *     fail-open closure, design §17 S6);
- *   • otherwise (frontier/mid recency-first, unconfigured) → 0 (filter skipped,
- *     byte-identical to v2.14, LOCKED #2).
+ *     (an arbiter that ranks LTM against history needs the floor enforced — an
+ *     unconfigured 0 must not silently disable the security gate);
+ *   • otherwise (frontier/mid recency-first, unconfigured) → 0 (filter skipped —
+ *     the un-gated pipeline, byte-identical).
  *
  * @returns the floor to enforce; `0` means "no floor — skip the filter".
  */
@@ -147,7 +147,7 @@ export function gateLanes(lanes, allowed, baseFloor, acc) {
     return result.lanes;
 }
 /**
- * §2.7 instrumentation for the new pre-fusion security boundary — CONTENT-FREE (counts +
+ * Boundary instrumentation (AGENTS.md §2.7) for the pre-fusion security gate — CONTENT-FREE (counts +
  * booleans only, NEVER memory bodies or query text). DEBUG (N-per-recall internal stage),
  * emitted only when the gate actually dropped a candidate so a clean corpus stays silent.
  * Makes a pre-fusion poisoning drop diagnosable from logs alone.

package/node_modules/@comis/agent/dist/rag/recall-types.d.ts

@@ -86,7 +86,7 @@ export interface MemoryRecallDeps {
      */
     pinnedStore?: MemoryPinnedStore;
     /**
-     * Optional LCD provenance read store (DIST-03). When present AND a selected recall
+     * Optional LCD provenance read store. When present AND a selected recall
      * result carries the "lcd_distilled" tag, the post-fusion provenance pass (after
      * mmrRerank, before observability capture) down-weights same-conversation paired
      * memories whose covered range overlaps the distilled summary's (score multiplier
@@ -97,7 +97,7 @@ export interface MemoryRecallDeps {
      * Absent / no lcd_distilled result → NO-OP (byte-identical; getProvenanceForSummary is
      * never called). A FAILED pass is NON-FATAL (WARN + recall results unaffected). DEFAULT-OFF.
      *
-     * INJECTED AT THE COMPOSITION ROOT IN PHASE 173 (C2): the daemon builds the concrete
+     * INJECTED AT THE COMPOSITION ROOT: the daemon builds the concrete
      * LcdProvenanceReadStore (setup-memory's buildProvenanceReadStore) and threads it here,
      * and the distillation runner stamps the `summary:<id>` tag — so the precise-provenance
      * branch is the primary selector. The pass is live but stays a byte-identical no-op when
@@ -244,26 +244,27 @@ export interface MemoryRecallConfig {
         synonyms: boolean;
         temporalParse: boolean;
     };
-    /** Minimum BASE relevance score (pre-boost) for memory injection (R3 floor).
+    /** Minimum BASE relevance score (pre-boost) for memory injection.
      *  Filter runs AFTER scoreWithBreakdown() (breakdownById populated) and BEFORE
      *  trust-filter. Gates on ScoreBreakdown.base — NOT on r.score (the boosted value).
      *  Fallback: if a memory has no breakdown entry, gates on r.score (safe degrade).
-     *  Default=0 (absent or 0) → no filtering (byte-identical to the pre-R3 path).
+     *  Default=0 (absent or 0) → no filtering (byte-identical to the un-floored path).
      *  Optional so a caller predating the field leaves it absent → no floor applied.
      *
-     *  WR-02 (Phase 173): when {@link MemoryRecallConfig.relevanceFirst} is true, an
+     *  When {@link MemoryRecallConfig.relevanceFirst} is true, an
      *  UNCONFIGURED floor (0) is NOT silently skipped — it is enforced at the class
      *  default (see RELEVANCE_FIRST_DEFAULT_BASE_FLOOR in memory-recall.ts). See that
      *  field's doc. */
     baseFloor?: number;
     /**
-     * RETR-04 / WR-02 (Phase 173): the unified-arbiter-active signal (from
+     * The unified-arbiter-active signal (from
      * ScaffoldDefaults.relevanceFirst). When `true` (small/nano relevance-first), the
      * recall path ranks LTM T3/T4 candidates relevance-first and the baseFloor gate is
      * FAIL-CLOSED: an unconfigured floor (0) resolves to the class default and the filter
-     * runs — an arbiter that ranks LTM against history needs the floor enforced (design
-     * §17 S6). When `false`/absent (frontier/mid recency-first, the default), the gate
-     * keeps the legacy `> 0` skip → byte-identical to v2.14 (LOCKED #2). Optional so a
+     * runs — an arbiter that ranks LTM against history needs the floor enforced. When
+     * `false`/absent (frontier/mid recency-first, the default), the gate
+     * skips the filter for an unconfigured floor (0) → no floor enforced (byte-identical).
+     * Optional so a
      * caller predating the field leaves it absent → off (recency-first, byte-identical).
      */
     relevanceFirst?: boolean;

package/node_modules/@comis/agent/dist/rag/relevance-scorer.d.ts

@@ -1,16 +1,16 @@
 /**
- * RETR-01 — the single shared `RelevanceScorer` primitive.
+ * The single shared `RelevanceScorer` primitive.
  *
  * A PURE ranking primitive that BOTH the recall path (memory-recall.ts) and the
- * assembly path (lcd-assembler.ts, via the Plan-03 margin arbiter) call. This is NOT a
+ * assembly path (lcd-assembler.ts, via the margin arbiter) call. This is NOT a
  * path merge — recall (the `P` budget) and assembly (the `H` budget) stay SEPARATE code
- * paths and share only this primitive (design §11.4/§14.5 reject the full P/H merge).
+ * paths and share only this primitive (a full P/H merge is deliberately rejected).
  *
  * The scorer does two things:
  *
  *   1. {@link buildRelevanceQuery} — builds the relevance query from the newest-weighted
  *      rolling window of the last ~3 user turns + the GoalAnchor bias term when present
- *      (the design's ONE focus-bias mechanism, §6.1/§6.6). Tokenizes + stopwords; a turn
+ *      (GoalAnchor is the ONE focus-bias mechanism). Tokenizes + stopwords; a turn
  *      with < ~2 content terms is `degraded` (low-signal).
  *
  *   2. {@link scoreRelevance} — fuses the provided candidate lanes by RRF (it REUSES
@@ -20,7 +20,7 @@
  *      preserved). On a `degraded` (low-signal) query the scorer does NOT reorder — it
  *      returns the caller's input order (a deterministic recency-first signal) and logs
  *      `relevance_query_degraded` CONTENT-FREE (a term count + a boolean, NEVER the query
- *      text). The floor stands alone (LOCKED #3): no embeddings/reranker/KG/prompt-cache →
+ *      text). The floor stands alone: no embeddings/reranker/KG/prompt-cache →
  *      pure BM25 + RRF, deterministic recency-first fallback.
  *
  * Architecture cut (agent↛memory): like {@link fuse} and rag/score.ts, this module is the
@@ -48,18 +48,18 @@ export interface RelevanceQuery {
     degraded: boolean;
 }
 /**
- * YAGNI-EXCEPTION / ORPHAN NOTE (WR-03, Phase 174-04). `buildRelevanceQuery` has no production
+ * YAGNI-EXCEPTION / ORPHAN NOTE. `buildRelevanceQuery` has no production
  * caller today: the recall path builds its own FTS query, and the assembly arbiter REPLICATES
  * the tokenize+stopword locally in `lcd-arbiter-seam.buildAssemblyRelevanceQuery` to honor the
- * I2 context-engine ↮ rag cut (the engine must not import this module). It is RETAINED — fully
+ * context-engine ↮ rag cut (the engine must not import this module). It is RETAINED — fully
  * test-covered (relevance-scorer.test.ts) — as the query builder a future cross-tier LTM/KG
  * allocator will consume when assembly fetches cross-session candidate lanes. It is NOT on the
  * `@comis/agent` public barrel, so the public-export-consumers gate does not fire; this comment
- * is the YAGNI-exception record (the §2.3 informed-exception, the `reduceFleetWindow` precedent).
+ * is the YAGNI-exception record (the AGENTS.md §2.3 informed-exception, the `reduceFleetWindow` precedent).
  *
  * Build the relevance query from the newest-weighted rolling window of the last ~3 user
- * turns + the GoalAnchor bias term when present (design §6.1/§6.6 — GoalAnchor IS the
- * focus-bias, one mechanism).
+ * turns + the GoalAnchor bias term when present (GoalAnchor IS the
+ * focus-bias — one mechanism).
  *
  * Newest-weighting: the most-recent turn's terms come FIRST and an older turn never displaces
  * a newer one (the window is the last {@link RELEVANCE_TURN_WINDOW} turns, processed
@@ -68,7 +68,7 @@ export interface RelevanceQuery {
  * result is `degraded` when fewer than {@link MIN_CONTENT_TERMS} content terms remain.
  *
  * Pure + total: an empty / whitespace / stopword-only input simply yields `{ terms: [],
- * degraded: true }` (never throws). The caller (recall or the Plan-03 arbiter) supplies
+ * degraded: true }` (never throws). The caller (recall or the assembly arbiter) supplies
  * whatever it has — recall has the user message turns; assembly threads the GoalAnchor text.
  *
  * @param userTurns - User-role turn texts in chronological order (oldest first). Only the

package/node_modules/@comis/agent/dist/rag/relevance-scorer.js

@@ -1,17 +1,17 @@
 // SPDX-License-Identifier: Apache-2.0
 /**
- * RETR-01 — the single shared `RelevanceScorer` primitive.
+ * The single shared `RelevanceScorer` primitive.
  *
  * A PURE ranking primitive that BOTH the recall path (memory-recall.ts) and the
- * assembly path (lcd-assembler.ts, via the Plan-03 margin arbiter) call. This is NOT a
+ * assembly path (lcd-assembler.ts, via the margin arbiter) call. This is NOT a
  * path merge — recall (the `P` budget) and assembly (the `H` budget) stay SEPARATE code
- * paths and share only this primitive (design §11.4/§14.5 reject the full P/H merge).
+ * paths and share only this primitive (a full P/H merge is deliberately rejected).
  *
  * The scorer does two things:
  *
  *   1. {@link buildRelevanceQuery} — builds the relevance query from the newest-weighted
  *      rolling window of the last ~3 user turns + the GoalAnchor bias term when present
- *      (the design's ONE focus-bias mechanism, §6.1/§6.6). Tokenizes + stopwords; a turn
+ *      (GoalAnchor is the ONE focus-bias mechanism). Tokenizes + stopwords; a turn
  *      with < ~2 content terms is `degraded` (low-signal).
  *
  *   2. {@link scoreRelevance} — fuses the provided candidate lanes by RRF (it REUSES
@@ -21,7 +21,7 @@
  *      preserved). On a `degraded` (low-signal) query the scorer does NOT reorder — it
  *      returns the caller's input order (a deterministic recency-first signal) and logs
  *      `relevance_query_degraded` CONTENT-FREE (a term count + a boolean, NEVER the query
- *      text). The floor stands alone (LOCKED #3): no embeddings/reranker/KG/prompt-cache →
+ *      text). The floor stands alone: no embeddings/reranker/KG/prompt-cache →
  *      pure BM25 + RRF, deterministic recency-first fallback.
  *
  * Architecture cut (agent↛memory): like {@link fuse} and rag/score.ts, this module is the
@@ -41,15 +41,15 @@
  */
 import { fuse } from "./fuse.js";
 /**
- * The number of most-recent user turns the relevance query draws from (design §6.1:
- * "the newest-weighted rolling window of the last ~3 user turns"). Comis chat turns are
+ * The number of most-recent user turns the relevance query draws from (the
+ * newest-weighted rolling window). Comis chat turns are
  * short + deictic, so a small window keeps the query focused on the live intent.
  */
 const RELEVANCE_TURN_WINDOW = 3;
 /**
  * The minimum number of CONTENT terms (after stopwording) for a query to carry signal.
  * Below this the turn is `degraded` (low-signal) and the scorer falls back to recency-first.
- * "<~2 content terms" (design §6.1) → the boundary is `< 2`.
+ * Fewer than two content terms carries no usable retrieval signal → the boundary is `< 2`.
  */
 const MIN_CONTENT_TERMS = 2;
 /**
@@ -98,18 +98,18 @@ function tokenize(text) {
         .filter((t) => t.length > 0);
 }
 /**
- * YAGNI-EXCEPTION / ORPHAN NOTE (WR-03, Phase 174-04). `buildRelevanceQuery` has no production
+ * YAGNI-EXCEPTION / ORPHAN NOTE. `buildRelevanceQuery` has no production
  * caller today: the recall path builds its own FTS query, and the assembly arbiter REPLICATES
  * the tokenize+stopword locally in `lcd-arbiter-seam.buildAssemblyRelevanceQuery` to honor the
- * I2 context-engine ↮ rag cut (the engine must not import this module). It is RETAINED — fully
+ * context-engine ↮ rag cut (the engine must not import this module). It is RETAINED — fully
  * test-covered (relevance-scorer.test.ts) — as the query builder a future cross-tier LTM/KG
  * allocator will consume when assembly fetches cross-session candidate lanes. It is NOT on the
  * `@comis/agent` public barrel, so the public-export-consumers gate does not fire; this comment
- * is the YAGNI-exception record (the §2.3 informed-exception, the `reduceFleetWindow` precedent).
+ * is the YAGNI-exception record (the AGENTS.md §2.3 informed-exception, the `reduceFleetWindow` precedent).
  *
  * Build the relevance query from the newest-weighted rolling window of the last ~3 user
- * turns + the GoalAnchor bias term when present (design §6.1/§6.6 — GoalAnchor IS the
- * focus-bias, one mechanism).
+ * turns + the GoalAnchor bias term when present (GoalAnchor IS the
+ * focus-bias — one mechanism).
  *
  * Newest-weighting: the most-recent turn's terms come FIRST and an older turn never displaces
  * a newer one (the window is the last {@link RELEVANCE_TURN_WINDOW} turns, processed
@@ -118,7 +118,7 @@ function tokenize(text) {
  * result is `degraded` when fewer than {@link MIN_CONTENT_TERMS} content terms remain.
  *
  * Pure + total: an empty / whitespace / stopword-only input simply yields `{ terms: [],
- * degraded: true }` (never throws). The caller (recall or the Plan-03 arbiter) supplies
+ * degraded: true }` (never throws). The caller (recall or the assembly arbiter) supplies
  * whatever it has — recall has the user message turns; assembly threads the GoalAnchor text.
  *
  * @param userTurns - User-role turn texts in chronological order (oldest first). Only the
@@ -197,8 +197,8 @@ function recencyFirst(lanes) {
  */
 export function scoreRelevance(lanes, query, opts) {
     if (query.degraded) {
-        // Content-free observability (§2.7): the FACT of the fallback only — a term COUNT + a
-        // boolean. NEVER the query text or any input turn string (the T-173-02-01 mitigation).
+        // Content-free observability (AGENTS.md §2.7): the FACT of the fallback only — a term COUNT
+        // + a boolean. NEVER the query text or any input turn string (they can carry user content).
         opts?.logger?.debug({
             agentId: opts.agentId,
             step: "relevance-scorer",