limen-ai 1.0.0

package/dist/learning/extractor/technique_extractor.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Limen — TechniqueExtractor Implementation
+ * Phase 4E-2b: Learning System Extraction Pipeline
+ *
+ * Implements the TechniqueExtractor interface from learning_types.ts.
+ * Four-step extraction algorithm per §29.3:
+ *   Step 1: Collect candidates (quality > 0.7, positive feedback)
+ *   Step 2: Generate proposal via LLM
+ *   Step 3: Deduplicate via cosine similarity (threshold 0.85)
+ *   Step 4: Store with provenance (I-03 audit, single transaction)
+ *
+ * S ref: S29.3 Steps 1-4, I-03 (audit), I-07 (agent isolation),
+ *        LI-01 (initial confidence 0.5), LI-13 (dedup threshold 0.85)
+ *
+ * Decisions:
+ *   D1: Local TF-IDF cosine for dedup (FO-004: upgrade to embeddings when IC-08 ships)
+ *   D2: LLM failure handling — validate all fields, clamp confidence to [0,1]
+ *   D3: Transaction boundary — LLM call outside transaction, store ops inside
+ *   D4: Duplicate reinforcement — EMA formula (0.8*old + 0.2*1.0) per S29.5
+ *   D5: collectCandidates — graceful empty (no interaction table exists yet)
+ */
+import type { TechniqueExtractor, TechniqueStore, LearningDeps } from '../interfaces/index.js';
+/**
+ * Compute cosine similarity between two texts using normalized term frequency vectors.
+ * Pure function. Deterministic. No external dependencies.
+ *
+ * Initial implementation: bag-of-words TF cosine (D1, approved 2026-03-13).
+ * FO-004: Replace with embedding-based similarity when IC-08 infrastructure ships.
+ * Upgrade path: swap this function, re-run contract tests, add semantic dedup tests.
+ *
+ * Accepted limitation: lexically different but semantically similar texts will
+ * not be flagged as duplicates. Not a spec violation — §29.3 permits pluggable
+ * similarity backends ("provider API or ONNX fallback").
+ *
+ * @param text1 First text to compare
+ * @param text2 Second text to compare
+ * @returns Cosine similarity in [0, 1]. 1.0 = identical, 0.0 = no overlap.
+ */
+export declare function computeSimilarity(text1: string, text2: string): number;
+/**
+ * Create a TechniqueExtractor implementation.
+ * Requires LearningDeps (for LlmGateway access) and TechniqueStore (for dedup + storage).
+ *
+ * @param deps Learning system dependencies (gateway for LLM calls)
+ * @param store TechniqueStore for dedup queries and technique creation
+ */
+export declare function createTechniqueExtractor(deps: LearningDeps, store: TechniqueStore): TechniqueExtractor;
+//# sourceMappingURL=technique_extractor.d.ts.map

package/dist/learning/extractor/technique_extractor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"technique_extractor.d.ts","sourceRoot":"","sources":["../../../src/learning/extractor/technique_extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,KAAK,EACV,kBAAkB,EAAE,cAAc,EAEN,YAAY,EACzC,MAAM,wBAAwB,CAAC;AA0ChC;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAuCtE;AAID;;;;;;GAMG;AACH,wBAAgB,wBAAwB,CACtC,IAAI,EAAE,YAAY,EAClB,KAAK,EAAE,cAAc,GACpB,kBAAkB,CAmTpB"}

package/dist/learning/extractor/technique_extractor.js

@@ -0,0 +1,357 @@
+/**
+ * Limen — TechniqueExtractor Implementation
+ * Phase 4E-2b: Learning System Extraction Pipeline
+ *
+ * Implements the TechniqueExtractor interface from learning_types.ts.
+ * Four-step extraction algorithm per §29.3:
+ *   Step 1: Collect candidates (quality > 0.7, positive feedback)
+ *   Step 2: Generate proposal via LLM
+ *   Step 3: Deduplicate via cosine similarity (threshold 0.85)
+ *   Step 4: Store with provenance (I-03 audit, single transaction)
+ *
+ * S ref: S29.3 Steps 1-4, I-03 (audit), I-07 (agent isolation),
+ *        LI-01 (initial confidence 0.5), LI-13 (dedup threshold 0.85)
+ *
+ * Decisions:
+ *   D1: Local TF-IDF cosine for dedup (FO-004: upgrade to embeddings when IC-08 ships)
+ *   D2: LLM failure handling — validate all fields, clamp confidence to [0,1]
+ *   D3: Transaction boundary — LLM call outside transaction, store ops inside
+ *   D4: Duplicate reinforcement — EMA formula (0.8*old + 0.2*1.0) per S29.5
+ *   D5: collectCandidates — graceful empty (no interaction table exists yet)
+ */
+import { DEDUP_SIMILARITY_THRESHOLD, INITIAL_CONFIDENCE_EXTRACTED, EMA_WEIGHT_OLD, EMA_WEIGHT_RECENT, } from '../interfaces/index.js';
+// ─── Constants ───
+const VALID_TECHNIQUE_TYPES = [
+    'prompt_fragment', 'decision_rule', 'rag_pattern',
+];
+/**
+ * System prompt for technique extraction via LLM.
+ * Per S29.3 Step 2: structured extraction with typed output schema.
+ */
+const EXTRACTION_SYSTEM_PROMPT = `You are a technique extraction engine for a cognitive operating system.
+Analyze the following interaction and extract a reusable technique that can improve future conversations.
+
+Respond ONLY with valid JSON matching this exact schema:
+{
+  "type": "prompt_fragment" | "decision_rule" | "rag_pattern",
+  "content": "the extracted technique text — must be actionable and specific",
+  "confidence": 0.0-1.0,
+  "applicability": "description of when and where this technique should be applied"
+}
+
+Type definitions:
+- prompt_fragment: A reusable text snippet to prepend/append to agent prompts
+- decision_rule: A conditional rule for routing, escalation, or response strategy
+- rag_pattern: A retrieval pattern for finding relevant context
+
+No explanation, no markdown fences, no commentary. Only the JSON object.`;
+// ─── Similarity Function (D1: Isolated Interface, FO-004) ───
+/**
+ * Compute cosine similarity between two texts using normalized term frequency vectors.
+ * Pure function. Deterministic. No external dependencies.
+ *
+ * Initial implementation: bag-of-words TF cosine (D1, approved 2026-03-13).
+ * FO-004: Replace with embedding-based similarity when IC-08 infrastructure ships.
+ * Upgrade path: swap this function, re-run contract tests, add semantic dedup tests.
+ *
+ * Accepted limitation: lexically different but semantically similar texts will
+ * not be flagged as duplicates. Not a spec violation — §29.3 permits pluggable
+ * similarity backends ("provider API or ONNX fallback").
+ *
+ * @param text1 First text to compare
+ * @param text2 Second text to compare
+ * @returns Cosine similarity in [0, 1]. 1.0 = identical, 0.0 = no overlap.
+ */
+export function computeSimilarity(text1, text2) {
+    const tokenize = (text) => text.toLowerCase().split(/\W+/).filter(t => t.length > 0);
+    const tokens1 = tokenize(text1);
+    const tokens2 = tokenize(text2);
+    if (tokens1.length === 0 || tokens2.length === 0)
+        return 0;
+    // Build normalized term frequency maps
+    const buildTf = (tokens) => {
+        const tf = new Map();
+        for (const t of tokens)
+            tf.set(t, (tf.get(t) ?? 0) + 1);
+        // Normalize by document length
+        for (const [term, count] of tf)
+            tf.set(term, count / tokens.length);
+        return tf;
+    };
+    const tf1 = buildTf(tokens1);
+    const tf2 = buildTf(tokens2);
+    // Cosine similarity: dot(v1, v2) / (|v1| * |v2|)
+    let dot = 0;
+    let mag1 = 0;
+    let mag2 = 0;
+    for (const [term, w1] of tf1) {
+        mag1 += w1 * w1;
+        const w2 = tf2.get(term) ?? 0;
+        dot += w1 * w2;
+    }
+    for (const [, w2] of tf2) {
+        mag2 += w2 * w2;
+    }
+    if (mag1 === 0 || mag2 === 0)
+        return 0;
+    return dot / (Math.sqrt(mag1) * Math.sqrt(mag2));
+}
+// ─── Factory ───
+/**
+ * Create a TechniqueExtractor implementation.
+ * Requires LearningDeps (for LlmGateway access) and TechniqueStore (for dedup + storage).
+ *
+ * @param deps Learning system dependencies (gateway for LLM calls)
+ * @param store TechniqueStore for dedup queries and technique creation
+ */
+export function createTechniqueExtractor(deps, store) {
+    // ─── Step 1: Collect Candidates (S29.3 Step 1) ───
+    /**
+     * Collect extraction candidates from recent interactions.
+     * Per S29.3 Step 1: filter by quality > 0.7 AND positive feedback.
+     *
+     * LEARNING-01: Wired to core_interactions table (migration v33).
+     * Queries interactions with quality_score > 0.7 and user_feedback = 'positive'.
+     * Respects tenant isolation via COALESCE pattern (FM-10).
+     * Returns max 50 results ordered by quality_score descending.
+     * Graceful degradation: returns empty array if table doesn't exist yet.
+     */
+    function collectCandidates(conn, ctx, agentId, sinceTimestamp) {
+        try {
+            const tenantId = ctx.tenantId ?? null;
+            const rows = conn.query(`SELECT id, agent_id, tenant_id, quality_score, user_feedback, user_input, assistant_output
+         FROM core_interactions
+         WHERE agent_id = ?
+           AND COALESCE(tenant_id, '__NULL__') = COALESCE(?, '__NULL__')
+           AND quality_score > 0.7
+           AND user_feedback = 'positive'
+           AND created_at > ?
+         ORDER BY quality_score DESC
+         LIMIT 50`, [agentId, tenantId, sinceTimestamp]);
+            const candidates = rows.map(row => ({
+                interactionId: row.id,
+                agentId: row.agent_id,
+                tenantId: (row.tenant_id ?? ''),
+                qualityScore: row.quality_score,
+                userFeedback: row.user_feedback,
+                conversationContext: `User: ${row.user_input}\nAssistant: ${row.assistant_output}`,
+            }));
+            return { ok: true, value: candidates };
+        }
+        catch (err) {
+            // F-S2-002 FIX: Only gracefully degrade for "no such table" errors.
+            // Any other query error must be surfaced as a Result error, not swallowed.
+            const message = err instanceof Error ? err.message : String(err);
+            if (message.includes('no such table')) {
+                // Graceful degradation: core_interactions table doesn't exist yet
+                // (e.g., migration not run). Return empty array per D5.
+                return { ok: true, value: [] };
+            }
+            return {
+                ok: false,
+                error: {
+                    code: 'LEARNING_QUERY_ERROR',
+                    message: `collectCandidates query failed: ${message}`,
+                    spec: 'S29.3',
+                },
+            };
+        }
+    }
+    // ─── Step 2: Generate Proposal (S29.3 Step 2) ───
+    /**
+     * Generate a technique proposal from an extraction candidate via LLM.
+     * Calls deps.gateway.request() with structured extraction prompt.
+     * Validates all response fields per D2 failure handling.
+     *
+     * Pattern derived from InferPipeline (src/api/infer/infer_pipeline.ts:234-266).
+     */
+    async function generateProposal(ctx, candidate) {
+        const conn = deps.getConnection();
+        const userContent = [
+            `Agent: ${candidate.agentId}`,
+            `Quality Score: ${candidate.qualityScore}`,
+            `User Feedback: ${candidate.userFeedback ?? 'none'}`,
+            `Conversation:`,
+            candidate.conversationContext,
+        ].join('\n');
+        const llmRequest = {
+            model: 'default',
+            messages: [{ role: 'user', content: userContent }],
+            maxTokens: 1024,
+            temperature: 0.3,
+            systemPrompt: EXTRACTION_SYSTEM_PROMPT,
+        };
+        // Call LLM gateway — same pattern as ChatPipeline/InferPipeline
+        const responseResult = await deps.gateway.request(conn, ctx, llmRequest);
+        if (!responseResult.ok) {
+            return {
+                ok: false,
+                error: {
+                    code: 'EXTRACTION_LLM_ERROR',
+                    message: `LLM gateway error: ${responseResult.error.message}`,
+                    spec: 'S29.3',
+                },
+            };
+        }
+        const response = responseResult.value;
+        // Extract text content from response (may be string or LlmContentBlock[])
+        const rawContent = typeof response.content === 'string'
+            ? response.content
+            : response.content
+                .filter((b) => b.type === 'text')
+                .map(b => b.text)
+                .join('');
+        // Parse JSON — D2: malformed JSON → EXTRACTION_PARSE_ERROR
+        let parsed;
+        try {
+            parsed = JSON.parse(rawContent);
+        }
+        catch {
+            return {
+                ok: false,
+                error: {
+                    code: 'EXTRACTION_PARSE_ERROR',
+                    message: `LLM returned malformed JSON: ${rawContent.slice(0, 200)}`,
+                    spec: 'S29.3',
+                },
+            };
+        }
+        const obj = parsed;
+        // Validate type — D2: invalid TechniqueType → EXTRACTION_INVALID_TYPE
+        if (!VALID_TECHNIQUE_TYPES.includes(obj.type)) {
+            return {
+                ok: false,
+                error: {
+                    code: 'EXTRACTION_INVALID_TYPE',
+                    message: `LLM returned invalid technique type: ${String(obj.type)}. Valid: ${VALID_TECHNIQUE_TYPES.join(', ')}`,
+                    spec: 'S29.1',
+                },
+            };
+        }
+        // Validate content — D2: empty content → EXTRACTION_EMPTY_CONTENT
+        if (typeof obj.content !== 'string' || obj.content.length === 0) {
+            return {
+                ok: false,
+                error: {
+                    code: 'EXTRACTION_EMPTY_CONTENT',
+                    message: 'LLM returned empty or non-string content',
+                    spec: 'S29.3',
+                },
+            };
+        }
+        // Validate applicability — must be non-empty string
+        if (typeof obj.applicability !== 'string' || obj.applicability.length === 0) {
+            return {
+                ok: false,
+                error: {
+                    code: 'EXTRACTION_EMPTY_APPLICABILITY',
+                    message: 'LLM returned empty or non-string applicability',
+                    spec: 'S29.3',
+                },
+            };
+        }
+        // D2: Clamp confidence to [0,1] — LLMs are imprecise
+        const rawConfidence = typeof obj.confidence === 'number' ? obj.confidence : 0.5;
+        const confidence = Math.max(0, Math.min(1, rawConfidence));
+        const proposal = {
+            type: obj.type,
+            content: obj.content,
+            confidence,
+            applicability: obj.applicability,
+        };
+        return { ok: true, value: proposal };
+    }
+    // ─── Step 3: Duplicate Check (S29.3 Step 3) ───
+    /**
+     * Check if a proposed technique content duplicates an existing active technique.
+     * Per S29.3 Step 3: cosine similarity > 0.85 = duplicate.
+     *
+     * D1: Uses local TF-IDF cosine via computeSimilarity() (FO-004: upgrade to embeddings).
+     * Compares against ALL active techniques for the specified agent.
+     * Scaling assumption: acceptable for <1000 active techniques per agent.
+     */
+    async function checkDuplicate(conn, agentId, tenantId, proposalContent) {
+        // Fetch all active techniques for this agent (I-07: agent-scoped)
+        const existingResult = store.getByAgent(conn, agentId, tenantId, 'active');
+        if (!existingResult.ok) {
+            return existingResult;
+        }
+        let bestSimilarity = 0;
+        let bestMatchId = null;
+        for (const technique of existingResult.value) {
+            const similarity = computeSimilarity(proposalContent, technique.content);
+            if (similarity > bestSimilarity) {
+                bestSimilarity = similarity;
+                bestMatchId = technique.id;
+            }
+        }
+        const isDuplicate = bestSimilarity >= DEDUP_SIMILARITY_THRESHOLD;
+        return {
+            ok: true,
+            value: {
+                isDuplicate,
+                existingTechniqueId: isDuplicate ? bestMatchId : null,
+                similarity: bestSimilarity,
+            },
+        };
+    }
+    // ─── Step 4: Extract and Store (S29.3 Step 4) ───
+    /**
+     * Full extraction pipeline: generate → dedup → store/reinforce.
+     *
+     * D3: LLM call (generateProposal) is OUTSIDE any transaction.
+     *     Store operations (create/update) use the store's transaction + audit (I-03).
+     *     Named assumption: if LLM succeeds but store fails, LLM compute is wasted,
+     *     but no orphan state exists.
+     *
+     * D4: Duplicate reinforcement uses EMA formula (0.8*old + 0.2*1.0) per S29.5.
+     *     Treats duplicate detection as positive signal (pattern reappeared = evidence of value).
+     *
+     * Returns: Technique if novel and stored, null if duplicate was reinforced.
+     */
+    async function extractAndStore(conn, ctx, candidate) {
+        // Step 2: Generate proposal via LLM
+        const proposalResult = await generateProposal(ctx, candidate);
+        if (!proposalResult.ok)
+            return proposalResult;
+        const proposal = proposalResult.value;
+        // Step 3: Check for duplicates against agent's active techniques
+        const dupResult = await checkDuplicate(conn, candidate.agentId, candidate.tenantId, proposal.content);
+        if (!dupResult.ok)
+            return dupResult;
+        if (dupResult.value.isDuplicate && dupResult.value.existingTechniqueId) {
+            // D4: Reinforce existing technique using EMA formula
+            // new_confidence = 0.8 * old + 0.2 * 1.0 (duplicate = positive signal)
+            const existingId = dupResult.value.existingTechniqueId;
+            const getResult = store.get(conn, existingId, candidate.tenantId, candidate.agentId);
+            if (getResult.ok) {
+                const reinforcedConfidence = EMA_WEIGHT_OLD * getResult.value.confidence + EMA_WEIGHT_RECENT * 1.0;
+                store.update(conn, ctx, existingId, candidate.tenantId, {
+                    confidence: Math.min(reinforcedConfidence, 1.0),
+                });
+            }
+            return { ok: true, value: null };
+        }
+        // Step 4: Store new technique with provenance
+        // sourceMemoryIds: candidate.interactionId traces back to originating interaction
+        // initialConfidence: 0.5 per S29.3 Step 4 (LI-01)
+        const createResult = store.create(conn, ctx, {
+            tenantId: candidate.tenantId,
+            agentId: candidate.agentId,
+            type: proposal.type,
+            content: proposal.content,
+            sourceMemoryIds: [candidate.interactionId],
+            initialConfidence: INITIAL_CONFIDENCE_EXTRACTED,
+        });
+        if (!createResult.ok)
+            return createResult;
+        return { ok: true, value: createResult.value };
+    }
+    return Object.freeze({
+        collectCandidates,
+        generateProposal,
+        checkDuplicate,
+        extractAndStore,
+    });
+}
+//# sourceMappingURL=technique_extractor.js.map

package/dist/learning/extractor/technique_extractor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"technique_extractor.js","sourceRoot":"","sources":["../../../src/learning/extractor/technique_extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAWH,OAAO,EACL,0BAA0B,EAC1B,4BAA4B,EAC5B,cAAc,EACd,iBAAiB,GAClB,MAAM,wBAAwB,CAAC;AAEhC,oBAAoB;AAEpB,MAAM,qBAAqB,GAA6B;IACtD,iBAAiB,EAAE,eAAe,EAAE,aAAa;CAClD,CAAC;AAEF;;;GAGG;AACH,MAAM,wBAAwB,GAAG;;;;;;;;;;;;;;;;yEAgBwC,CAAC;AAE1E,+DAA+D;AAE/D;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa,EAAE,KAAa;IAC5D,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAY,EAAE,CAC1C,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE5D,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAEhC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE3D,uCAAuC;IACvC,MAAM,OAAO,GAAG,CAAC,MAAgB,EAAuB,EAAE;QACxD,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,+BAA+B;QAC/B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE;YAAE,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QACpE,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IAEF,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC7B,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAE7B,iDAAiD;IACjD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,IAAI,EAAE,GAAG,EAAE,CAAC;QAChB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;IACjB,CAAC;IAED,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;QACzB,IAAI,IAAI,EAAE,GAAG,EAAE,CAAC;IAClB,CAAC;IAED,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEvC,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,kBAAkB;AAElB;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CACtC,IAAkB,EAClB,KAAqB;IAGrB,oDAAoD;IAEpD;;;;;;;;;OASG;IACH,SAAS,iBAAiB,CACxB,IAAwB,EACxB,GAAqB,EACrB,OAAgB,EAChB,cAAsB;QAEtB,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,IAAI,IAAI,CAAC;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CASrB;;;;;;;;kBAQU,EACV,CAAC,OAAO,EAAE,QAAQ,EAAE,cAAc,CAAC,CACpC,CAAC;YAEF,MAAM,UAAU,GAA0B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACzD,aAAa,EAAE,GAAG,CAAC,EAAE;gBACrB,OAAO,EAAE,GAAG,CAAC,QAAmB;gBAChC,QAAQ,EAAE,CAAC,GAAG,CAAC,SAAS,IAAI,EAAE,CAAa;gBAC3C,YAAY,EAAE,GAAG,CAAC,aAAa;gBAC/B,YAAY,EAAE,GAAG,CAAC,aAAiD;gBACnE,mBAAmB,EAAE,SAAS,GAAG,CAAC,UAAU,gBAAgB,GAAG,CAAC,gBAAgB,EAAE;aACnF,CAAC,CAAC,CAAC;YAEJ,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;QACzC,CAAC;QAAC,OAAO,GAAY,EAAE,CAAC;YACtB,oEAAoE;YACpE,2EAA2E;YAC3E,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjE,IAAI,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAC,EAAE,CAAC;gBACtC,kEAAkE;gBAClE,wDAAwD;gBACxD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YACjC,CAAC;YACD,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE;oBACL,IAAI,EAAE,sBAAsB;oBAC5B,OAAO,EAAE,mCAAmC,OAAO,EAAE;oBACrD,IAAI,EAAE,OAAO;iBACd;aACF,CAAC;QACJ,CAAC;IACH,CAAC;IAED,mDAAmD;IAEnD;;;;;;OAMG;IACH,KAAK,UAAU,gBAAgB,CAC7B,GAAqB,EACrB,SAA8B;QAE9B,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAElC,MAAM,WAAW,GAAG;YAClB,UAAU,SAAS,CAAC,OAAO,EAAE;YAC7B,kBAAkB,SAAS,CAAC,YAAY,EAAE;YAC1C,kBAAkB,SAAS,CAAC,YAAY,IAAI,MAAM,EAAE;YACpD,eAAe;YACf,SAAS,CAAC,mBAAmB;SAC9B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,MAAM,UAAU,GAAe;YAC7B,KAAK,EAAE,SAAS;YAChB,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAe,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;YAC3D,SAAS,EAAE,IAAI;YACf,WAAW,EAAE,GAAG;YAChB,YAAY,EAAE,wBAAwB;SACvC,CAAC;QAEF,gEAAgE;QAChE,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;QAEzE,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC;YACvB,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE;oBACL,IAAI,EAAE,sBAAsB;oBAC5B,OAAO,EAAE,sBAAsB,cAAc,CAAC,KAAK,CAAC,OAAO,EAAE;oBAC7D,IAAI,EAAE,OAAO;iBACd;aACF,CAAC;QACJ,CAAC;QAED,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC;QAEtC,0EAA0E;QAC1E,MAAM,UAAU,GAAG,OAAO,QAAQ,CAAC,OAAO,KAAK,QAAQ;YACrD,CAAC,CAAC,QAAQ,CAAC,OAAO;YAClB,CAAC,CAAE,QAAQ,CAAC,OAAsC;iBAC7C,MAAM,CAAC,CAAC,CAAC,EAAyD,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;iBACvF,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;iBAChB,IAAI,CAAC,EAAE,CAAC,CAAC;QAEhB,2DAA2D;QAC3D,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAClC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE;oBACL,IAAI,EAAE,wBAAwB;oBAC9B,OAAO,EAAE,gCAAgC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;oBACnE,IAAI,EAAE,OAAO;iBACd;aACF,CAAC;QACJ,CAAC;QAED,MAAM,GAAG,GAAG,MAAiC,CAAC;QAE9C,sEAAsE;QACtE,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAqB,CAAC,EAAE,CAAC;YAC/D,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE;oBACL,IAAI,EAAE,yBAAyB;oBAC/B,OAAO,EAAE,wCAAwC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;oBAC/G,IAAI,EAAE,OAAO;iBACd;aACF,CAAC;QACJ,CAAC;QAED,kEAAkE;QAClE,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChE,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE;oBACL,IAAI,EAAE,0BAA0B;oBAChC,OAAO,EAAE,0CAA0C;oBACnD,IAAI,EAAE,OAAO;iBACd;aACF,CAAC;QACJ,CAAC;QAED,oDAAoD;QACpD,IAAI,OAAO,GAAG,CAAC,aAAa,KAAK,QAAQ,IAAI,GAAG,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5E,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE;oBACL,IAAI,EAAE,gCAAgC;oBACtC,OAAO,EAAE,gDAAgD;oBACzD,IAAI,EAAE,OAAO;iBACd;aACF,CAAC;QACJ,CAAC;QAED,qDAAqD;QACrD,MAAM,aAAa,GAAG,OAAO,GAAG,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC;QAChF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;QAE3D,MAAM,QAAQ,GAAsB;YAClC,IAAI,EAAE,GAAG,CAAC,IAAqB;YAC/B,OAAO,EAAE,GAAG,CAAC,OAAiB;YAC9B,UAAU;YACV,aAAa,EAAE,GAAG,CAAC,aAAuB;SAC3C,CAAC;QAEF,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IACvC,CAAC;IAED,iDAAiD;IAEjD;;;;;;;OAOG;IACH,KAAK,UAAU,cAAc,CAC3B,IAAwB,EACxB,OAAgB,EAChB,QAAkB,EAClB,eAAuB;QAEvB,kEAAkE;QAClE,MAAM,cAAc,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC3E,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC;YACvB,OAAO,cAA8C,CAAC;QACxD,CAAC;QAED,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,WAAW,GAAuB,IAAI,CAAC;QAE3C,KAAK,MAAM,SAAS,IAAI,cAAc,CAAC,KAAK,EAAE,CAAC;YAC7C,MAAM,UAAU,GAAG,iBAAiB,CAAC,eAAe,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC;YACzE,IAAI,UAAU,GAAG,cAAc,EAAE,CAAC;gBAChC,cAAc,GAAG,UAAU,CAAC;gBAC5B,WAAW,GAAG,SAAS,CAAC,EAAE,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,MAAM,WAAW,GAAG,cAAc,IAAI,0BAA0B,CAAC;QAEjE,OAAO;YACL,EAAE,EAAE,IAAI;YACR,KAAK,EAAE;gBACL,WAAW;gBACX,mBAAmB,EAAE,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI;gBACrD,UAAU,EAAE,cAAc;aAC3B;SACF,CAAC;IACJ,CAAC;IAED,mDAAmD;IAEnD;;;;;;;;;;;;OAYG;IACH,KAAK,UAAU,eAAe,CAC5B,IAAwB,EACxB,GAAqB,EACrB,SAA8B;QAE9B,oCAAoC;QACpC,MAAM,cAAc,GAAG,MAAM,gBAAgB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAC9D,IAAI,CAAC,cAAc,CAAC,EAAE;YAAE,OAAO,cAAc,CAAC;QAC9C,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC;QAEtC,iEAAiE;QACjE,MAAM,SAAS,GAAG,MAAM,cAAc,CACpC,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,OAAO,CAC9D,CAAC;QACF,IAAI,CAAC,SAAS,CAAC,EAAE;YAAE,OAAO,SAAS,CAAC;QAEpC,IAAI,SAAS,CAAC,KAAK,CAAC,WAAW,IAAI,SAAS,CAAC,KAAK,CAAC,mBAAmB,EAAE,CAAC;YACvE,qDAAqD;YACrD,uEAAuE;YACvE,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,mBAAmB,CAAC;YACvD,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,EAAE,SAAS,CAAC,QAAQ,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC;YACrF,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC;gBACjB,MAAM,oBAAoB,GAAG,cAAc,GAAG,SAAS,CAAC,KAAK,CAAC,UAAU,GAAG,iBAAiB,GAAG,GAAG,CAAC;gBACnG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,SAAS,CAAC,QAAQ,EAAE;oBACtD,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,GAAG,CAAC;iBAChD,CAAC,CAAC;YACL,CAAC;YACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACnC,CAAC;QAED,8CAA8C;QAC9C,kFAAkF;QAClF,kDAAkD;QAClD,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE;YAC3C,QAAQ,EAAE,SAAS,CAAC,QAAQ;YAC5B,OAAO,EAAE,SAAS,CAAC,OAAO;YAC1B,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,eAAe,EAAE,CAAC,SAAS,CAAC,aAAa,CAAC;YAC1C,iBAAiB,EAAE,4BAA4B;SAChD,CAAC,CAAC;QAEH,IAAI,CAAC,YAAY,CAAC,EAAE;YAAE,OAAO,YAAY,CAAC;QAC1C,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC,KAAK,EAAE,CAAC;IACjD,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,iBAAiB;QACjB,gBAAgB;QAChB,cAAc;QACd,eAAe;KAChB,CAAC,CAAC;AACL,CAAC"}

package/dist/learning/harness/learning_harness.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Limen — Learning System (S29) Harness
+ * Phase 4E-2f: All 10 Subsystems REAL
+ *
+ * 10/10 subsystems are REAL implementations. Zero stubs.
+ *
+ * S ref: S29, Amendment 2 Control 3 (Executable Contract, Interface-First)
+ *
+ * Wiring history:
+ *   4E-2a: TechniqueStore (real)
+ *   4E-2b: TechniqueExtractor (real)
+ *   4E-2c: TechniqueApplicator (real)
+ *   4E-2d: EffectivenessTracker + RetirementEvaluator (real)
+ *   4E-2e: QuarantineManager + CrossAgentTransfer + OverSpecializationDetector + ColdStartManager (real)
+ *   4E-2f: LearningCycleOrchestrator (real) — FINAL
+ */
+import type { LearningSystem, LearningDeps } from '../interfaces/index.js';
+export declare class NotImplementedError extends Error {
+    constructor(method: string);
+}
+/**
+ * Create the LearningSystem with all 10 implemented subsystems.
+ * 10/10 real. Zero stubs. §29 complete.
+ */
+export declare function createLearningSystem(deps: LearningDeps): LearningSystem;
+//# sourceMappingURL=learning_harness.d.ts.map

package/dist/learning/harness/learning_harness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"learning_harness.d.ts","sourceRoot":"","sources":["../../../src/learning/harness/learning_harness.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EACV,cAAc,EACd,YAAY,EACb,MAAM,wBAAwB,CAAC;AAchC,qBAAa,mBAAoB,SAAQ,KAAK;gBAChC,MAAM,EAAE,MAAM;CAI3B;AAID;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,YAAY,GAAG,cAAc,CAmBvE"}

package/dist/learning/harness/learning_harness.js

@@ -0,0 +1,58 @@
+/**
+ * Limen — Learning System (S29) Harness
+ * Phase 4E-2f: All 10 Subsystems REAL
+ *
+ * 10/10 subsystems are REAL implementations. Zero stubs.
+ *
+ * S ref: S29, Amendment 2 Control 3 (Executable Contract, Interface-First)
+ *
+ * Wiring history:
+ *   4E-2a: TechniqueStore (real)
+ *   4E-2b: TechniqueExtractor (real)
+ *   4E-2c: TechniqueApplicator (real)
+ *   4E-2d: EffectivenessTracker + RetirementEvaluator (real)
+ *   4E-2e: QuarantineManager + CrossAgentTransfer + OverSpecializationDetector + ColdStartManager (real)
+ *   4E-2f: LearningCycleOrchestrator (real) — FINAL
+ */
+import { createTechniqueStore } from '../store/technique_store.js';
+import { createTechniqueExtractor } from '../extractor/technique_extractor.js';
+import { createTechniqueApplicator } from '../applicator/technique_applicator.js';
+import { createEffectivenessTracker } from '../tracker/effectiveness_tracker.js';
+import { createRetirementEvaluator } from '../retirement/retirement_evaluator.js';
+import { createQuarantineManager } from '../quarantine/quarantine_manager.js';
+import { createCrossAgentTransfer } from '../transfer/cross_agent_transfer.js';
+import { createOverSpecializationDetector } from '../specialization/over_specialization_detector.js';
+import { createColdStartManager } from '../cold_start/cold_start_manager.js';
+import { createLearningCycleOrchestrator } from '../cycle/learning_cycle_orchestrator.js';
+// ─── Error Type (retained for test backward compatibility) ───
+export class NotImplementedError extends Error {
+    constructor(method) {
+        super(`NOT_IMPLEMENTED: LearningSystem.${method}`);
+        this.name = 'NotImplementedError';
+    }
+}
+// ─── Factory ───
+/**
+ * Create the LearningSystem with all 10 implemented subsystems.
+ * 10/10 real. Zero stubs. §29 complete.
+ */
+export function createLearningSystem(deps) {
+    const store = createTechniqueStore(deps);
+    const extractor = createTechniqueExtractor(deps, store);
+    const tracker = createEffectivenessTracker(deps, store);
+    const retirement = createRetirementEvaluator(deps);
+    const specialization = createOverSpecializationDetector(store);
+    return Object.freeze({
+        store,
+        extractor,
+        applicator: createTechniqueApplicator(deps, store),
+        tracker,
+        retirement,
+        quarantine: createQuarantineManager(deps, store),
+        transfer: createCrossAgentTransfer(deps, store),
+        specialization,
+        coldStart: createColdStartManager(store),
+        cycle: createLearningCycleOrchestrator(deps, store, extractor, tracker, retirement, specialization),
+    });
+}
+//# sourceMappingURL=learning_harness.js.map

package/dist/learning/harness/learning_harness.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"learning_harness.js","sourceRoot":"","sources":["../../../src/learning/harness/learning_harness.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAMH,OAAO,EAAE,oBAAoB,EAAE,MAAM,6BAA6B,CAAC;AACnE,OAAO,EAAE,wBAAwB,EAAE,MAAM,qCAAqC,CAAC;AAC/E,OAAO,EAAE,yBAAyB,EAAE,MAAM,uCAAuC,CAAC;AAClF,OAAO,EAAE,0BAA0B,EAAE,MAAM,qCAAqC,CAAC;AACjF,OAAO,EAAE,yBAAyB,EAAE,MAAM,uCAAuC,CAAC;AAClF,OAAO,EAAE,uBAAuB,EAAE,MAAM,qCAAqC,CAAC;AAC9E,OAAO,EAAE,wBAAwB,EAAE,MAAM,qCAAqC,CAAC;AAC/E,OAAO,EAAE,gCAAgC,EAAE,MAAM,mDAAmD,CAAC;AACrG,OAAO,EAAE,sBAAsB,EAAE,MAAM,qCAAqC,CAAC;AAC7E,OAAO,EAAE,+BAA+B,EAAE,MAAM,yCAAyC,CAAC;AAE1F,gEAAgE;AAEhE,MAAM,OAAO,mBAAoB,SAAQ,KAAK;IAC5C,YAAY,MAAc;QACxB,KAAK,CAAC,mCAAmC,MAAM,EAAE,CAAC,CAAC;QACnD,IAAI,CAAC,IAAI,GAAG,qBAAqB,CAAC;IACpC,CAAC;CACF;AAED,kBAAkB;AAElB;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAkB;IACrD,MAAM,KAAK,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,wBAAwB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,0BAA0B,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACxD,MAAM,UAAU,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;IACnD,MAAM,cAAc,GAAG,gCAAgC,CAAC,KAAK,CAAC,CAAC;IAE/D,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,KAAK;QACL,SAAS;QACT,UAAU,EAAE,yBAAyB,CAAC,IAAI,EAAE,KAAK,CAAC;QAClD,OAAO;QACP,UAAU;QACV,UAAU,EAAE,uBAAuB,CAAC,IAAI,EAAE,KAAK,CAAC;QAChD,QAAQ,EAAE,wBAAwB,CAAC,IAAI,EAAE,KAAK,CAAC;QAC/C,cAAc;QACd,SAAS,EAAE,sBAAsB,CAAC,KAAK,CAAC;QACxC,KAAK,EAAE,+BAA+B,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,cAAc,CAAC;KACpG,CAAC,CAAC;AACL,CAAC"}

package/dist/learning/interfaces/index.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Limen — Learning System (S29) Public Interface Barrel
+ * Phase 4E-1: Executable Contract
+ */
+export type { TechniqueId, TechniqueType, TechniqueStatus, OutcomeClassification, LearningCycleTrigger, RetirementReason, QuarantineResolution, Technique, TechniqueCreateInput, TechniqueUpdateInput, TechniqueApplication, TechniqueProposal, ExtractionCandidate, DuplicateCheckResult, RetirementDecision, QuarantineEntry, TransferRequest, TransferResult, ColdStartTemplate, ColdStartTechniqueEntry, SpecializationMetrics, LearningCycleResult, TechniqueStore, TechniqueExtractor, TechniqueApplicator, EffectivenessTracker, RetirementEvaluator, QuarantineManager, CrossAgentTransfer, OverSpecializationDetector, ColdStartManager, LearningCycleOrchestrator, LearningSystem, LearningDeps, } from './learning_types.js';
+export { INITIAL_CONFIDENCE_EXTRACTED, INITIAL_CONFIDENCE_COLD_START, CONFIDENCE_RESET_TRANSFER, CONFIDENCE_RESET_REACTIVATION, EMA_WEIGHT_OLD, EMA_WEIGHT_RECENT, SUCCESS_RATE_WINDOW, RETIREMENT_MIN_APPLICATIONS_SUCCESS, RETIREMENT_MIN_APPLICATIONS_CONFIDENCE, RETIREMENT_THRESHOLD_SUCCESS_RATE, RETIREMENT_THRESHOLD_CONFIDENCE, RETIREMENT_STALENESS_DAYS, EXTRACTION_QUALITY_THRESHOLD, DEDUP_SIMILARITY_THRESHOLD, MAX_CONTEXT_WINDOW_RATIO, OVERSPECIALIZATION_THRESHOLD, DEFAULT_CYCLE_INTERVAL_MS, TRANSFER_MIN_CONFIDENCE, TRANSFER_MIN_SUCCESS_RATE, TRANSFER_MIN_APPLICATIONS, HITL_CONFIDENCE, LEARNING_PERMISSIONS, } from './learning_types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/learning/interfaces/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/learning/interfaces/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,YAAY,EAEV,WAAW,EAEX,aAAa,EACb,eAAe,EACf,qBAAqB,EACrB,oBAAoB,EACpB,gBAAgB,EAChB,oBAAoB,EAEpB,SAAS,EACT,oBAAoB,EACpB,oBAAoB,EACpB,oBAAoB,EACpB,iBAAiB,EACjB,mBAAmB,EACnB,oBAAoB,EACpB,kBAAkB,EAClB,eAAe,EACf,eAAe,EACf,cAAc,EACd,iBAAiB,EACjB,uBAAuB,EACvB,qBAAqB,EACrB,mBAAmB,EAEnB,cAAc,EACd,kBAAkB,EAClB,mBAAmB,EACnB,oBAAoB,EACpB,mBAAmB,EACnB,iBAAiB,EACjB,kBAAkB,EAClB,0BAA0B,EAC1B,gBAAgB,EAChB,yBAAyB,EAEzB,cAAc,EACd,YAAY,GACb,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EAEL,4BAA4B,EAC5B,6BAA6B,EAC7B,yBAAyB,EACzB,6BAA6B,EAC7B,cAAc,EACd,iBAAiB,EACjB,mBAAmB,EACnB,mCAAmC,EACnC,sCAAsC,EACtC,iCAAiC,EACjC,+BAA+B,EAC/B,yBAAyB,EACzB,4BAA4B,EAC5B,0BAA0B,EAC1B,wBAAwB,EACxB,4BAA4B,EAC5B,yBAAyB,EAEzB,uBAAuB,EACvB,yBAAyB,EACzB,yBAAyB,EAEzB,eAAe,EAEf,oBAAoB,GACrB,MAAM,qBAAqB,CAAC"}

package/dist/learning/interfaces/index.js

@@ -0,0 +1,10 @@
+export { 
+// Constants
+INITIAL_CONFIDENCE_EXTRACTED, INITIAL_CONFIDENCE_COLD_START, CONFIDENCE_RESET_TRANSFER, CONFIDENCE_RESET_REACTIVATION, EMA_WEIGHT_OLD, EMA_WEIGHT_RECENT, SUCCESS_RATE_WINDOW, RETIREMENT_MIN_APPLICATIONS_SUCCESS, RETIREMENT_MIN_APPLICATIONS_CONFIDENCE, RETIREMENT_THRESHOLD_SUCCESS_RATE, RETIREMENT_THRESHOLD_CONFIDENCE, RETIREMENT_STALENESS_DAYS, EXTRACTION_QUALITY_THRESHOLD, DEDUP_SIMILARITY_THRESHOLD, MAX_CONTEXT_WINDOW_RATIO, OVERSPECIALIZATION_THRESHOLD, DEFAULT_CYCLE_INTERVAL_MS, 
+// Phase 4E-R1: Transfer qualification (BRK-S29-002)
+TRANSFER_MIN_CONFIDENCE, TRANSFER_MIN_SUCCESS_RATE, TRANSFER_MIN_APPLICATIONS, 
+// Phase 4E-R1: HITL confidence (DEC-4E-003)
+HITL_CONFIDENCE, 
+// Phase 4E-R1: RBAC permissions (BRK-S29-013)
+LEARNING_PERMISSIONS, } from './learning_types.js';
+//# sourceMappingURL=index.js.map

package/dist/learning/interfaces/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/learning/interfaces/index.ts"],"names":[],"mappings":"AA8CA,OAAO;AACL,YAAY;AACZ,4BAA4B,EAC5B,6BAA6B,EAC7B,yBAAyB,EACzB,6BAA6B,EAC7B,cAAc,EACd,iBAAiB,EACjB,mBAAmB,EACnB,mCAAmC,EACnC,sCAAsC,EACtC,iCAAiC,EACjC,+BAA+B,EAC/B,yBAAyB,EACzB,4BAA4B,EAC5B,0BAA0B,EAC1B,wBAAwB,EACxB,4BAA4B,EAC5B,yBAAyB;AACzB,oDAAoD;AACpD,uBAAuB,EACvB,yBAAyB,EACzB,yBAAyB;AACzB,4CAA4C;AAC5C,eAAe;AACf,8CAA8C;AAC9C,oBAAoB,GACrB,MAAM,qBAAqB,CAAC"}