@thanh01.pmt/domain-kit 0.4.0 → 0.6.0

package/dist/pipeline/index.cjs

@@ -1,936 +1,316 @@
 'use strict';
 
-var zod = require('zod');
 var fs = require('fs');
 var path = require('path');
 var child_process = require('child_process');
 var os = require('os');
+var zod = require('zod');
 
-var __defProp = Object.defineProperty;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __esm = (fn, res) => function __init() {
-  return fn && (res = (0, fn[__getOwnPropNames(fn)[0]])(fn = 0)), res;
-};
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, { get: all[name], enumerable: true });
-};
-function validateCurriculumFeed(feed) {
-  const parsed = CurriculumFeedSchema.parse(feed);
-  const ids = new Set(parsed.learning_nodes.map((n) => n.id));
-  if (ids.size !== parsed.learning_nodes.length) {
-    throw new Error("curriculum feed contains duplicate node ids");
-  }
-  for (const e of parsed.dependency_edges) {
-    if (!ids.has(e.from) || !ids.has(e.to)) {
-      throw new Error("curriculum feed edge " + e.from + " -> " + e.to + " references unknown node");
-    }
-    if (e.from === e.to) throw new Error("curriculum feed self-loop edge on " + e.from);
+// src/parsers/swift.ts
+var IMPORT_RE = /^import\s+(\w+)/gm;
+var TYPE_RE = /\b(class|struct|enum|protocol)\s+(\w+)(?:\s*:\s*([^{]+))?/g;
+var FUNC_RE = /\bfunc\s+(\w+)\s*\(([^)]*)\)(?:\s*->\s*([^{]+))?/g;
+var WRAPPER_RE = /@(State|Binding|ObservedObject|StateObject|Published|Environment|EnvironmentObject|AppStorage|SceneStorage|FocusState|Observable)\b/g;
+var FRAMEWORK_USAGE_RE = /\b(URLSession|URLRequest|JSONSerialization|JSONDecoder|JSONEncoder|Task|DispatchQueue|Timer|NotificationCenter|UserDefaults|FileManager|Bundle)\b/g;
+function parseSwiftFile(filepath, content) {
+  const result = {
+    imports: [],
+    types: [],
+    functions: [],
+    property_wrappers: [],
+    error_handling: [],
+    frameworks_used: []
+  };
+  let match;
+  while ((match = IMPORT_RE.exec(content)) !== null) {
+    result.imports.push(match[1]);
   }
-  for (const g of parsed.suggested_groupings) {
-    for (const id of g.node_ids) {
-      if (!ids.has(id)) throw new Error("grouping " + g.id + " references unknown node " + id);
+  const fwSeen = /* @__PURE__ */ new Set();
+  while ((match = FRAMEWORK_USAGE_RE.exec(content)) !== null) {
+    if (!fwSeen.has(match[1])) {
+      fwSeen.add(match[1]);
+      result.frameworks_used.push(match[1]);
     }
   }
-  for (const ph of parsed.phases) {
-    for (const id of ph.node_ids) {
-      if (!ids.has(id)) throw new Error("phase " + ph.id + " references unknown node " + id);
-    }
+  while ((match = TYPE_RE.exec(content)) !== null) {
+    const conforms = (match[3] || "").split(",").map((p) => p.trim()).filter(Boolean);
+    result.types.push({
+      kind: match[1],
+      name: match[2],
+      conforms_to: conforms,
+      file: filepath
+    });
   }
-  const phaseIds = parsed.phases.map((p) => p.id);
-  if (new Set(phaseIds).size !== phaseIds.length) throw new Error("curriculum feed contains duplicate phase ids");
-  if (parsed.phases.length > 0) {
-    const phaseIndexOf = /* @__PURE__ */ new Map();
-    parsed.phases.forEach((p, i) => {
-      for (const id of p.node_ids) phaseIndexOf.set(id, i);
+  while ((match = FUNC_RE.exec(content)) !== null) {
+    const name = match[1];
+    if (name.startsWith("_")) continue;
+    result.functions.push({
+      name,
+      params: (match[2] || "").trim(),
+      returns: (match[3] || "").trim(),
+      file: filepath
     });
-    for (const e of parsed.dependency_edges) {
-      const fromIdx = phaseIndexOf.get(e.from);
-      const toIdx = phaseIndexOf.get(e.to);
-      if (fromIdx === void 0 || toIdx === void 0) continue;
-      if (fromIdx > toIdx) {
-        throw new Error(
-          "curriculum feed teaching-order violation: prerequisite " + e.from + " (phase " + (fromIdx + 1) + ") is scheduled AFTER its consumer " + e.to + " (phase " + (toIdx + 1) + ")"
-        );
-      }
+  }
+  const wrapperSet = /* @__PURE__ */ new Set();
+  while ((match = WRAPPER_RE.exec(content)) !== null) {
+    wrapperSet.add(match[1]);
+  }
+  result.property_wrappers = Array.from(wrapperSet);
+  if (content.includes("do {") || content.includes("do{")) {
+    result.error_handling.push("do-catch");
+  }
+  if (content.includes("throws")) {
+    result.error_handling.push("throws");
+  }
+  if (content.includes("Result<")) {
+    result.error_handling.push("Result type");
+  }
+  if (content.includes("try?")) {
+    result.error_handling.push("try?");
+  }
+  if (content.includes("try!")) {
+    result.error_handling.push("try!");
+  }
+  return result;
+}
+function mergeSwiftResults(results) {
+  const merged = {
+    imports: [],
+    types: [],
+    functions: [],
+    property_wrappers: [],
+    error_handling: [],
+    frameworks_used: []
+  };
+  const importCounts = /* @__PURE__ */ new Map();
+  const wrapperCounts = /* @__PURE__ */ new Map();
+  const errorCounts = /* @__PURE__ */ new Map();
+  const frameworkSet = /* @__PURE__ */ new Set();
+  for (const r of results) {
+    for (const imp of r.imports) {
+      importCounts.set(imp, (importCounts.get(imp) || 0) + 1);
+    }
+    merged.types.push(...r.types);
+    merged.functions.push(...r.functions);
+    for (const w of r.property_wrappers) {
+      wrapperCounts.set(w, (wrapperCounts.get(w) || 0) + 1);
+    }
+    for (const e of r.error_handling) {
+      errorCounts.set(e, (errorCounts.get(e) || 0) + 1);
+    }
+    for (const fw of r.frameworks_used) {
+      frameworkSet.add(fw);
     }
   }
-  return parsed;
+  merged.imports = Array.from(importCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 20).map(([mod, count]) => mod);
+  merged.property_wrappers = Array.from(wrapperCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 10).map(([w]) => w);
+  merged.error_handling = Array.from(errorCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 10).map(([p]) => p);
+  merged.frameworks_used = Array.from(frameworkSet).sort();
+  merged.types = merged.types.slice(0, 100);
+  merged.functions = merged.functions.slice(0, 100);
+  return merged;
 }
-var FeedKeywordsSchema, FeedScaffoldCandidateSchema, FeedNodeSchema, FeedEdgeSchema, FeedGroupingSchema, FeedPhaseSchema, CurriculumFeedSchema;
-var init_curriculumFeedSchema = __esm({
-  "src/schemas/curriculumFeedSchema.ts"() {
-    FeedKeywordsSchema = zod.z.object({
-      all: zod.z.array(zod.z.string()).default([]),
-      new: zod.z.array(zod.z.string()).default([]),
-      prerequisite: zod.z.array(zod.z.string()).default([])
-    });
-    FeedScaffoldCandidateSchema = zod.z.object({
-      item: zod.z.string(),
-      reason: zod.z.string().default(""),
-      minutes_saved: zod.z.number().int().nonnegative().default(0),
-      suggest: zod.z.enum(["provide_full", "provide_partial", "provide_reference"]).default("provide_full")
-    });
-    FeedNodeSchema = zod.z.object({
-      id: zod.z.string().min(1),
-      kind: zod.z.enum(["skill", "concept", "product_step"]),
-      name: zod.z.string().min(1),
-      concept_codes: zod.z.array(zod.z.string()).default([]),
-      keywords: FeedKeywordsSchema,
-      estimated_minutes: zod.z.number().int().nonnegative(),
-      bloom_hint: zod.z.enum(["Remember", "Understand", "Apply", "Analyze", "Evaluate", "Create"]).nullable().default(null),
-      depth_hint: zod.z.enum(["ulo", "cio", "sio"]).nullable().default(null),
-      completion_level: zod.z.enum(["mvp", "standard", "stretch"]).default("standard"),
-      scaffolding: zod.z.object({
-        scaffold_candidates: zod.z.array(FeedScaffoldCandidateSchema).default([]),
-        core_value_minutes: zod.z.number().int().nonnegative().default(0)
-      }).default({ scaffold_candidates: [], core_value_minutes: 0 }),
-      references: zod.z.array(zod.z.object({ file: zod.z.string().min(1), evidence: zod.z.string().default("") })).default([]),
-      feature_id: zod.z.string().nullable().default(null),
-      concept_ref: zod.z.string().nullable().default(null),
-      // P52/T2.1: outcome.user_visible projected from the ProjectGraph step — the
-      // tangible checkpoint the session-cutting planner aims for (empty when the
-      // step declares no user-visible result). Concepts carry '' by default.
-      user_visible_deliverable: zod.z.string().default(""),
-      // P52/T3.1 — depth-reconcile inputs (optional/defaulted so old feeds
-      // validate unchanged):
-      // • depth_variants: minutes to teach this node at each depth level.
-      //  ULO (know-it-exists) ≤ CIO (mechanism) ≤ SIO (implementation). All 3
-      //   required so a downgrade never turns an anchor teach into a zero.
-      // • depth_scaffold_candidates: parallel to scaffold_candidates but
-      //   acts on DEPTH (e.g. SIO→CIO) instead of lesson time.
-      // • is_core: concept is a Master-Tree core concept — reconciler must
-      //   never downgrade it; escalate instead.
-      depth_variants: zod.z.object({ ulo: zod.z.number().int().nonnegative(), cio: zod.z.number().int().nonnegative(), sio: zod.z.number().int().nonnegative() }).optional(),
-      depth_scaffold_candidates: zod.z.array(zod.z.object({
-        from_depth: zod.z.enum(["ulo", "cio", "sio"]),
-        to_depth: zod.z.enum(["ulo", "cio", "sio"]),
-        minutes_saved: zod.z.number().int().nonnegative(),
-        reason: zod.z.string().default("")
-      })).optional(),
-      is_core: zod.z.boolean().default(false),
-      // Progressive-completion bookkeeping (feed v2, additive):
-      // phase_id = development phase that introduces/uses this node;
-      // introduce_aspect = how the phase teaches a concept node (first intro, advanced
-      // revisit, or preview — a light ULO awareness pass that is NOT the introduction).
-      phase_id: zod.z.string().default(""),
-      introduce_aspect: zod.z.enum(["new", "advanced", "preview"]).nullable().default(null)
-    });
-    FeedEdgeSchema = zod.z.object({
-      from: zod.z.string().min(1),
-      to: zod.z.string().min(1),
-      kind: zod.z.enum(["knowledge", "task"]),
-      reason: zod.z.string().default("")
-    });
-    FeedGroupingSchema = zod.z.object({
-      id: zod.z.string().min(1),
-      name: zod.z.string().min(1),
-      node_ids: zod.z.array(zod.z.string()).min(1),
-      rationale: zod.z.string().default("")
+
+// src/parsers/typescript.ts
+var IMPORT_RE2 = /import\s+.*?from\s+['"]([^'"]+)['"]/g;
+var TYPE_RE2 = /\b(interface|type|class|enum)\s+(\w+)/g;
+var FUNC_RE2 = /\bfunction\s+(\w+)\s*\(([^)]*)\)/g;
+var ARROW_RE = /\bconst\s+(\w+)\s*=\s*\([^)]*\)\s*(?::\s*\w+)?\s*=>/g;
+function parseTsFile(filepath, content) {
+  const result = {
+    imports: [],
+    types: [],
+    functions: [],
+    error_handling: []
+  };
+  let match;
+  while ((match = IMPORT_RE2.exec(content)) !== null) {
+    result.imports.push(match[1]);
+  }
+  while ((match = TYPE_RE2.exec(content)) !== null) {
+    result.types.push({
+      kind: match[1],
+      name: match[2],
+      file: filepath
     });
-    FeedPhaseSchema = zod.z.object({
-      id: zod.z.string().min(1),
-      order: zod.z.number().int().positive(),
-      name: zod.z.string().min(1),
-      product_completion: zod.z.string().min(1),
-      node_ids: zod.z.array(zod.z.string()).min(1)
+  }
+  while ((match = FUNC_RE2.exec(content)) !== null) {
+    result.functions.push({
+      name: match[1],
+      params: (match[2] || "").trim(),
+      file: filepath
     });
-    CurriculumFeedSchema = zod.z.object({
-      schema_version: zod.z.literal(2),
-      source: zod.z.object({
-        graph_type: zod.z.enum(["project_graph", "knowledge_graph", "hybrid_graph"]),
-        warnings: zod.z.array(zod.z.string()).default([]),
-        hallucination_count: zod.z.number().int().nonnegative().default(0)
-      }),
-      learning_nodes: zod.z.array(FeedNodeSchema).min(1, "curriculum feed must contain at least one learning node"),
-      dependency_edges: zod.z.array(FeedEdgeSchema).default([]),
-      suggested_groupings: zod.z.array(FeedGroupingSchema).default([]),
-      // Progressive completion phases (cross-feature). When non-empty, these — not
-      // suggested_groupings — define the teaching sequence and unit structure.
-      phases: zod.z.array(FeedPhaseSchema).default([])
+  }
+  while ((match = ARROW_RE.exec(content)) !== null) {
+    result.functions.push({
+      name: match[1],
+      params: "",
+      file: filepath
     });
   }
-});
-
-// src/feed/curriculumFeedEmitter.ts
-var curriculumFeedEmitter_exports = {};
-__export(curriculumFeedEmitter_exports, {
-  emitCurriculumFeed: () => emitCurriculumFeed
-});
-function stepMinutes(step) {
-  const effort = step.effort ?? {};
-  return Math.max(0, Math.round(num(effort.estimated_minutes, num(step.estimated_minutes, 45))));
-}
-function pushWarning(opts, message) {
-  (opts.warnings ?? (opts.warnings = [])).push(message);
+  if (content.includes("try {") || content.includes("try{")) {
+    result.error_handling.push("try-catch");
+  }
+  if (content.includes("Promise")) {
+    result.error_handling.push("Promise");
+  }
+  if (content.includes(".catch(")) {
+    result.error_handling.push(".catch()");
+  }
+  return result;
 }
-function newKeywordsInOrder(nodes) {
-  const seen = /* @__PURE__ */ new Set();
-  for (const n of nodes) {
-    const all = n.keywords.all;
-    n.keywords.new = [];
-    n.keywords.prerequisite = [];
-    for (const k of all) {
-      if (seen.has(k)) n.keywords.prerequisite.push(k);
-      else n.keywords.new.push(k);
-      seen.add(k);
+function mergeTsResults(results) {
+  const merged = {
+    imports: [],
+    types: [],
+    functions: [],
+    error_handling: []
+  };
+  const importCounts = /* @__PURE__ */ new Map();
+  const errorCounts = /* @__PURE__ */ new Map();
+  for (const r of results) {
+    for (const imp of r.imports) {
+      importCounts.set(imp, (importCounts.get(imp) || 0) + 1);
+    }
+    merged.types.push(...r.types);
+    merged.functions.push(...r.functions);
+    for (const e of r.error_handling) {
+      errorCounts.set(e, (errorCounts.get(e) || 0) + 1);
     }
   }
+  merged.imports = Array.from(importCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 20).map(([mod]) => mod);
+  merged.error_handling = Array.from(errorCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 10).map(([p]) => p);
+  merged.types = merged.types.slice(0, 100);
+  merged.functions = merged.functions.slice(0, 100);
+  return merged;
 }
-function feedNodeFromStep(step, featureId) {
-  const id = str(step.id);
-  return {
-    id,
-    kind: "product_step",
-    name: str(step.name, id),
-    concept_codes: strs(step.concept_codes),
-    keywords: { all: strs(step.keywords), new: [], prerequisite: [] },
-    estimated_minutes: stepMinutes(step),
-    bloom_hint: "Apply",
-    depth_hint: null,
-    completion_level: "standard",
-    scaffolding: { scaffold_candidates: [], core_value_minutes: stepMinutes(step) },
-    references: arr(step.files).map((f) => ({ file: str(f), evidence: "step file" })).filter((f) => f.file),
-    feature_id: featureId,
-    concept_ref: null,
-    // P52/T2.1: carry the step's tangible outcome so the planner can cut
-    // sessions at user-visible checkpoints instead of raw minute counts.
-    user_visible_deliverable: str(step.outcome?.user_visible),
-    is_core: false,
-    phase_id: "",
-    introduce_aspect: null
+
+// src/parsers/python.ts
+var IMPORT_RE3 = /^(?:import|from)\s+(\w+)/gm;
+var CLASS_RE = /\bclass\s+(\w+)(?:\s*\(([^)]+)\))?/g;
+var FUNC_RE3 = /\bdef\s+(\w+)\s*\(([^)]*)\)/g;
+var DOCSTRING_RE = /"""([^"]{20,300})"""/g;
+function parsePythonFile(filepath, content) {
+  const result = {
+    imports: [],
+    types: [],
+    functions: [],
+    docstrings: [],
+    error_handling: []
   };
-}
-function deriveConceptDepthHint(concept) {
-  const explicit = str(concept.depth_hint);
-  if (explicit === "ulo" || explicit === "cio" || explicit === "sio") return explicit;
-  const sio = arr(concept.sio);
-  const prereqs = strs(concept.prerequisites);
-  const pts = arr(concept.problem_types);
-  const hasHighBloom = pts.some((p) => {
-    const b = str(p.bloom_level);
-    return b === "Apply" || b === "Analyze" || b === "Evaluate" || b === "Create";
-  });
-  if (sio.length >= 2 || hasHighBloom) return "sio";
-  if (str(concept.cio) || prereqs.length >= 1) return "cio";
-  return "ulo";
-}
-function deriveDepthInputs(minutes, depth) {
-  const ulo = Math.max(5, Math.round(minutes * 0.35));
-  const cio = Math.max(ulo + 5, Math.round(minutes * 0.65));
-  const sio = Math.max(cio + 5, minutes);
-  const variants = { ulo, cio, sio };
-  const candidates = [];
-  if (depth === "sio") {
-    candidates.push({ from_depth: "sio", to_depth: "cio", minutes_saved: sio - cio, reason: "SIO implementation practice deferred \u2014 CIO mechanism suffices for downstream consumers" });
-  }
-  if (depth === "cio" || depth === "sio") {
-    candidates.push({ from_depth: depth, to_depth: "ulo", minutes_saved: (depth === "sio" ? sio : cio) - ulo, reason: "Mechanism deferred \u2014 ULO awareness suffices (know-it-exists); never below the ULO floor" });
+  let match;
+  while ((match = IMPORT_RE3.exec(content)) !== null) {
+    result.imports.push(match[1]);
   }
-  return { depth_variants: variants, depth_scaffold_candidates: candidates };
-}
-function feedNodeFromConcept(concept) {
-  const id = str(concept.id);
-  const pts = arr(concept.problem_types).map((p) => str(p.bloom_level, "Understand")).filter((b) => b in BLOOM_RANK).sort((a, b) => BLOOM_RANK[a] - BLOOM_RANK[b]);
-  const topBloom = pts[pts.length - 1] ?? "Understand";
-  const rawRefs = arr(concept.references);
-  const references = rawRefs.length > 0 ? rawRefs.map((r) => ({ file: str(r.file, "syllabus.md"), evidence: str(r.evidence, str(concept.name)) })).filter((r) => r.file) : [{ file: "syllabus.md", evidence: str(concept.category ? `Topic under category ${str(concept.category)}` : str(concept.name), id) }];
-  const problemScaffolds = arr(concept.problem_types).map((pt) => ({
-    item: str(pt.name, "Problem type"),
-    reason: str(pt.description, "Formative practice check"),
-    minutes_saved: num(pt.estimated_minutes, 10),
-    suggest: "provide_partial"
-  }));
-  return {
-    id,
-    kind: "concept",
-    name: str(concept.name, id),
-    concept_codes: [str(concept.code) || id].filter(Boolean),
-    keywords: { all: strs(concept.keywords), new: [], prerequisite: [] },
-    estimated_minutes: Math.max(0, Math.round(num(concept.estimated_minutes, 15))),
-    bloom_hint: topBloom,
-    depth_hint: deriveConceptDepthHint(concept),
-    completion_level: "standard",
-    scaffolding: {
-      scaffold_candidates: problemScaffolds,
-      core_value_minutes: Math.max(0, Math.round(num(concept.estimated_minutes, 15)))
-    },
-    references,
-    feature_id: null,
-    concept_ref: id,
-    user_visible_deliverable: "",
-    // concepts are taught, not shipped — checkpoints live on product steps
-    ...deriveDepthInputs(Math.max(0, Math.round(num(concept.estimated_minutes, 15))), deriveConceptDepthHint(concept)),
-    is_core: false,
-    phase_id: "",
-    introduce_aspect: null
-  };
-}
-function addFeatureGroup(f, fid, nodes, edges, groupings) {
-  const steps = arr(f.steps);
-  const stepIds = [];
-  let prev = "";
-  for (let i = 0; i < steps.length; i++) {
-    const stepNode = feedNodeFromStep(steps[i], fid);
-    if (!stepNode.id) continue;
-    stepIds.push(stepNode.id);
-    nodes.push(stepNode);
-    if (prev) edges.push({ from: prev, to: stepNode.id, kind: "task", reason: "feature build order" });
-    prev = stepNode.id;
+  while ((match = DOCSTRING_RE.exec(content)) !== null) {
+    const firstSentence = match[1].trim().split("\n")[0].slice(0, 120);
+    if (firstSentence.length > 15) {
+      result.docstrings.push(firstSentence);
+    }
   }
-  for (const dep of strs(f.depends_on)) {
-    const depFirst = nodes.find((n) => n.feature_id === dep);
-    if (depFirst && stepIds[0]) edges.push({ from: depFirst.id, to: stepIds[0], kind: "task", reason: "feature depends_on " + dep });
+  while ((match = CLASS_RE.exec(content)) !== null) {
+    const bases = (match[2] || "").split(",").map((b) => b.trim()).filter(Boolean);
+    result.types.push({
+      kind: "class",
+      name: match[1],
+      bases,
+      file: filepath
+    });
   }
-  if (stepIds.length > 0) groupings.push({ id: "G-" + fid, name: str(f.name, fid), node_ids: stepIds, rationale: str(f.description, "") });
-  return stepIds;
-}
-function emitFromHybrid(hybrid, opts) {
-  const nodes = [];
-  const edges = [];
-  const groupings = [];
-  const pg = hybrid.project_graph ?? {};
-  const kg = hybrid.knowledge_graph ?? {};
-  const rawPhases = arr(hybrid.phases).filter((p) => str(p.id));
-  const features = arr(pg.features);
-  const conceptRecs = arr(kg.concepts);
-  const conceptById = new Map(conceptRecs.map((c) => [str(c.id), c]));
-  if (rawPhases.length === 0) {
-    for (const c of conceptRecs) {
-      const node = feedNodeFromConcept(c);
-      nodes.push(node);
-      for (const p of strs(c.prerequisites)) edges.push({ from: p, to: node.id, kind: "knowledge", reason: "concept prerequisite" });
-    }
-    features.forEach((f, fi) => addFeatureGroup(f, str(f.id, "F" + pad22(fi + 1)), nodes, edges, groupings));
-    linkHybridKnowledgeEdges(hybrid, nodes, edges);
-    newKeywordsInOrder(nodes);
-    return validateCurriculumFeed({
-      schema_version: 2,
-      source: { graph_type: "hybrid_graph", warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },
-      learning_nodes: nodes,
-      dependency_edges: edges,
-      suggested_groupings: groupings,
-      phases: []
+  while ((match = FUNC_RE3.exec(content)) !== null) {
+    const name = match[1];
+    if (name.startsWith("__") && name.endsWith("__")) continue;
+    result.functions.push({
+      name,
+      params: (match[2] || "").trim(),
+      file: filepath
     });
   }
-  const featureOrder = /* @__PURE__ */ new Map();
-  features.forEach((f, fi) => featureOrder.set(str(f.id, "F" + pad22(fi + 1)), fi));
-  const stepIdsByFeature = /* @__PURE__ */ new Map();
-  for (const f of features) {
-    const fid = str(f.id);
-    stepIdsByFeature.set(fid, arr(f.steps).map((s) => str(s.id)).filter(Boolean));
+  if (content.includes("try:")) {
+    result.error_handling.push("try-except");
   }
-  const emitCtx = [];
-  const emittedConcepts = /* @__PURE__ */ new Set();
-  const previewsEmitted = /* @__PURE__ */ new Set();
-  const linkList = arr(hybrid.links);
-  for (const rp of rawPhases) {
-    const pid = str(rp.id);
-    const order = num(rp.order, emitCtx.length + 1);
-    const conceptOrder = [];
-    const intros = arr(rp.introduces);
-    const news = intros.filter((i) => str(i.aspect, "new") === "new");
-    const advanced = intros.filter((i) => str(i.aspect) === "advanced");
-    const previews = intros.filter((i) => str(i.aspect) === "preview");
-    for (const intro of [...news, ...advanced, ...previews]) {
-      const cid = str(intro.concept_id);
-      const c = conceptById.get(cid);
-      if (!c) {
-        throw new Error("Phase " + pid + " introduces unknown concept " + cid + " - fail-closed");
-      }
-      if (str(intro.aspect, "new") === "advanced" && !emittedConcepts.has(cid)) {
-        throw new Error("Phase " + pid + " advanced-revisits concept " + cid + " that was never emitted - fail-closed");
-      }
-      if (str(intro.aspect, "new") === "preview") {
-        if (emittedConcepts.has(cid)) {
-          throw new Error("Phase " + pid + " previews concept " + cid + " that was already introduced - preview must precede the anchor teach - fail-closed");
-        }
-        if (previewsEmitted.has(cid)) {
-          throw new Error("Phase " + pid + " duplicate preview of concept " + cid + " - fail-closed");
-        }
-        const pidIdx = rawPhases.findIndex((rp2) => str(rp2.id) === pid);
-        const anchorIdx = rawPhases.findIndex((rp2) => arr(rp2.introduces).some((i2) => str(i2.concept_id) === cid && str(i2.aspect, "new") !== "preview"));
-        if (anchorIdx < 0) {
-          throw new Error("Phase " + pid + " previews concept " + cid + " that is never fully introduced in any phase - fail-closed");
-        }
-        if (pidIdx >= anchorIdx) {
-          throw new Error("Phase " + pid + " previews concept " + cid + " whose anchor introduction is not in a LATER phase - fail-closed");
-        }
-        previewsEmitted.add(cid);
-        const prevNode = feedNodeFromConcept(c);
-        prevNode.id = cid + "__PREV" + pad22(order);
-        prevNode.name = str(c.name, cid) + " (preview)";
-        prevNode.phase_id = pid;
-        prevNode.introduce_aspect = "preview";
-        prevNode.estimated_minutes = Math.max(5, Math.round(prevNode.estimated_minutes * 0.25));
-        prevNode.depth_hint = "ulo";
-        prevNode.bloom_hint = "Understand";
-        prevNode.concept_codes = [str(c.code) || cid];
-        prevNode.keywords = { all: strs(c.keywords), new: [], prerequisite: [] };
-        prevNode.scaffolding = { scaffold_candidates: [], core_value_minutes: 0 };
-        prevNode.depth_variants = { ulo: prevNode.estimated_minutes, cio: prevNode.estimated_minutes, sio: prevNode.estimated_minutes };
-        prevNode.depth_scaffold_candidates = [];
-        nodes.push(prevNode);
-        conceptOrder.push(prevNode.id);
-        continue;
-      }
-      if (!emittedConcepts.has(cid)) {
-        const node = feedNodeFromConcept(c);
-        node.phase_id = pid;
-        node.introduce_aspect = "new";
-        nodes.push(node);
-        for (const p of strs(c.prerequisites)) {
-          if (!emittedConcepts.has(p)) {
-            throw new Error("Concept " + cid + " (phase " + pid + ") has prerequisite " + p + " that is not introduced in an earlier phase - fail-closed");
-          }
-          edges.push({ from: p, to: cid, kind: "knowledge", reason: "concept prerequisite" });
-        }
-        emittedConcepts.add(cid);
-        conceptOrder.push(cid);
-      } else {
-        const revisitId = cid + "__ADV" + pad22(order);
-        const node = feedNodeFromConcept(c);
-        node.id = revisitId;
-        node.name = str(c.name, cid) + " (advanced)";
-        node.phase_id = pid;
-        node.introduce_aspect = "advanced";
-        node.depth_scaffold_candidates = [{ from_depth: "sio", to_depth: "cio", minutes_saved: Math.round(node.estimated_minutes * 0.3), reason: "advanced revisit may drop to CIO recap without breaking first-teach chain" }];
-        node.estimated_minutes = Math.max(15, Math.round(node.estimated_minutes * 0.5));
-        node.concept_codes = [str(c.code) || cid];
-        edges.push({ from: cid, to: revisitId, kind: "knowledge", reason: "advanced revisit of " + cid + " at phase " + pid });
-        nodes.push(node);
-        conceptOrder.push(revisitId);
-      }
-    }
-    const featureIds = strs(rp.feature_ids).filter((fid) => featureOrder.has(fid)).sort((a, b) => featureOrder.get(a) - featureOrder.get(b));
-    emitCtx.push({ id: pid, order, name: str(rp.name, pid), productCompletion: str(rp.product_completion), conceptOrder, featureIds });
+  if (content.includes("raise")) {
+    result.error_handling.push("raise");
   }
-  for (const l of linkList) {
-    const cid = str(l.concept_id);
-    if (cid && conceptById.has(cid) && !emittedConcepts.has(cid)) {
-      throw new Error("Concept " + cid + " is consumed by links but never introduced in any phase - fail-closed");
+  return result;
+}
+function mergePythonResults(results) {
+  const merged = {
+    imports: [],
+    types: [],
+    functions: [],
+    docstrings: [],
+    error_handling: []
+  };
+  const importCounts = /* @__PURE__ */ new Map();
+  const errorCounts = /* @__PURE__ */ new Map();
+  for (const r of results) {
+    for (const imp of r.imports) {
+      importCounts.set(imp, (importCounts.get(imp) || 0) + 1);
     }
-  }
-  const seenFeatures = new Set(emitCtx.flatMap((e) => e.featureIds));
-  const missingFeatures = features.map((f) => str(f.id)).filter((fid) => fid && !seenFeatures.has(fid));
-  if (missingFeatures.length > 0) {
-    throw new Error("Features not covered by any phase: " + missingFeatures.join(", ") + " - fail-closed");
-  }
-  const phaseNodeIds = [];
-  for (const ctx of emitCtx) {
-    const ids = [...ctx.conceptOrder];
-    for (const fid of ctx.featureIds) {
-      const f = features.find((x) => str(x.id) === fid);
-      const stepIds = addFeatureGroup(f, fid, nodes, edges, groupings);
-      for (const sid of stepIds) {
-        const node = nodes.find((n) => n.id === sid);
-        node.phase_id = ctx.id;
-      }
-      ids.push(...stepIds);
+    merged.types.push(...r.types);
+    merged.functions.push(...r.functions);
+    merged.docstrings.push(...r.docstrings);
+    for (const e of r.error_handling) {
+      errorCounts.set(e, (errorCounts.get(e) || 0) + 1);
     }
-    phaseNodeIds.push(ids);
   }
-  const placed = new Set(phaseNodeIds.flat());
-  const orderedNodes = [];
-  for (const ids of phaseNodeIds) {
-    for (const id of ids) {
-      const n = nodes.find((x) => x.id === id);
-      if (n) orderedNodes.push(n);
-    }
-  }
-  for (const n of nodes) if (!placed.has(n.id)) orderedNodes.push(n);
-  nodes.length = 0;
-  nodes.push(...orderedNodes);
-  const edgeSeen = new Set(edges.map((e) => e.from + ">" + e.to));
-  const pushEdge = (from, to, reason) => {
-    const key = from + ">" + to;
-    if (edgeSeen.has(key)) return;
-    edgeSeen.add(key);
-    edges.push({ from, to, kind: "knowledge", reason });
-  };
-  for (const l of linkList) {
-    const cid = str(l.concept_id);
-    const fid = str(l.feature_id);
-    if (!conceptById.has(cid)) continue;
-    const firstStep = (stepIdsByFeature.get(fid) || [])[0];
-    if (!firstStep) continue;
-    const depth = str(l.depth, "cio");
-    const anchorNode = nodes.find((n2) => n2.kind === "concept" && n2.concept_ref === cid && n2.introduce_aspect === "new");
-    const stepNode = nodes.find((n2) => n2.id === firstStep);
-    const anchorPhaseIdx = anchorNode ? emitCtx.findIndex((c2) => c2.id === anchorNode.phase_id) : -1;
-    const stepPhaseIdx = stepNode ? emitCtx.findIndex((c2) => c2.id === stepNode.phase_id) : -1;
-    if (emitCtx.length > 0 && anchorPhaseIdx > stepPhaseIdx) {
-      pushWarning(opts, "hybrid link drift: concept " + cid + " is fully taught in a later phase than consumer " + firstStep + " (a preview covers the dependency)");
-      continue;
-    }
-    pushEdge(cid, firstStep, str(l.relationship, "hybrid link") + " [" + depth + "]");
-    for (const n of nodes) {
-      if (n.kind === "concept" && n.concept_ref === cid && n.introduce_aspect === "advanced" && n.phase_id === str(l.phase_id)) {
-        pushEdge(n.id, firstStep, "advanced application [" + depth + "]");
-      }
-    }
-  }
-  newKeywordsInOrder(nodes);
-  const feedOrder = new Map(nodes.map((n, i) => [n.id, i]));
-  const introducer = /* @__PURE__ */ new Map();
-  for (const n of nodes) for (const k of n.keywords?.new ?? []) {
-    const key = k.toLowerCase();
-    if (!introducer.has(key)) introducer.set(key, n.id);
-  }
-  for (const n of nodes) {
-    for (const k of n.keywords?.prerequisite ?? []) {
-      const src = introducer.get(k.toLowerCase());
-      if (!src || src === n.id) continue;
-      const srcNode = nodes.find((x) => x.id === src);
-      const phaseOf = (id) => {
-        const n2 = nodes.find((x) => x.id === id);
-        return n2 ? emitCtx.findIndex((c) => c.id === n2.phase_id) : -1;
-      };
-      const conceptOvertaken = n.kind === "concept" && srcNode?.kind === "product_step";
-      const fromPhase = phaseOf(src);
-      const toPhase = phaseOf(n.id);
-      if (conceptOvertaken || emitCtx.length > 0 && fromPhase > toPhase) {
-        pushWarning(
-          opts,
-          "keyword-order drift: introducer " + src + " sits in a later phase than consumer " + n.id + ' (keyword "' + k + '") \u2014 host should move the introducer earlier'
-        );
-        continue;
-      }
-      if (feedOrder.get(src) < feedOrder.get(n.id)) pushEdge(src, n.id, "keyword prerequisite [" + k + "]");
-    }
-  }
-  const phases = emitCtx.map((ctx, i) => ({
-    id: ctx.id,
-    order: ctx.order,
-    name: ctx.name,
-    product_completion: ctx.productCompletion || "Phase " + (i + 1) + " deliverable",
-    node_ids: phaseNodeIds[i]
-  }));
-  return validateCurriculumFeed({
-    schema_version: 2,
-    source: { graph_type: "hybrid_graph", warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },
-    learning_nodes: nodes,
-    dependency_edges: edges,
-    suggested_groupings: groupings,
-    phases
-  });
-}
-function linkHybridKnowledgeEdges(hybrid, nodes, edges, setStepHints) {
-  const conceptIds = new Set(nodes.filter((n) => n.kind === "concept").map((n) => n.concept_ref || n.id));
-  for (const l of arr(hybrid.links)) {
-    const conceptId = str(l.concept_id);
-    const featureId = str(l.feature_id);
-    if (!conceptIds.has(conceptId)) continue;
-    const depth = str(l.depth, "cio");
-    const firstStep = nodes.find((n) => n.feature_id === featureId);
-    if (firstStep) {
-      edges.push({ from: conceptId, to: firstStep.id, kind: "knowledge", reason: str(l.relationship, "hybrid link") + " [" + depth + "]" });
-      if (!firstStep.depth_hint) {
-        firstStep.depth_hint = ["ulo", "cio", "sio"].includes(depth) ? depth : "cio";
-      }
-    }
-  }
-}
-function emitFromKnowledge(kg, opts) {
-  const nodes = [];
-  const edges = [];
-  const groupings = [];
-  const conceptIds = new Set(arr(kg.concepts).map((c) => str(c.id)));
-  for (const c of arr(kg.concepts)) {
-    const node = feedNodeFromConcept(c);
-    nodes.push(node);
-    for (const p of strs(c.prerequisites)) {
-      if (p !== node.id && conceptIds.has(p)) {
-        edges.push({
-          from: p,
-          to: node.id,
-          kind: "knowledge",
-          reason: `concept prerequisite: ${p} must be understood before ${node.id}`
-        });
-      }
-    }
-  }
-  if (arr(kg.learning_path).length > 0) {
-    const orderMap = /* @__PURE__ */ new Map();
-    arr(kg.learning_path).forEach((s, idx) => {
-      const cid = str(s.concept_id);
-      if (cid) orderMap.set(cid, num(s.order, idx + 1));
-    });
-    nodes.sort((a, b) => (orderMap.get(a.id) ?? 999) - (orderMap.get(b.id) ?? 999));
-  }
-  let ci = 0;
-  for (const cat of arr(kg.categories)) {
-    ci += 1;
-    const ids = strs(cat.concept_ids).filter((id) => nodes.some((n) => n.id === id));
-    if (ids.length > 0) {
-      groupings.push({
-        id: str(cat.id, "cat" + ci),
-        name: str(cat.name, "Category " + ci),
-        node_ids: ids,
-        rationale: str(cat.description, "")
-      });
-    }
-  }
-  newKeywordsInOrder(nodes);
-  return validateCurriculumFeed({
-    schema_version: 2,
-    source: { graph_type: "knowledge_graph", warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },
-    learning_nodes: nodes,
-    dependency_edges: edges,
-    suggested_groupings: groupings,
-    phases: []
-  });
-}
-function emitFromProject(pg, opts) {
-  const nodes = [];
-  const edges = [];
-  const groupings = [];
-  arr(pg.features).forEach((f, fi) => addFeatureGroup(f, str(f.id, "F" + pad22(fi + 1)), nodes, edges, groupings));
-  if (nodes.length === 0 && arr(pg.features).length > 0) {
-    const hasTasks = arr(pg.implementation ?? {}).length > 0 || arr(pg.implementation?.tasks).length > 0;
-    throw new Error(
-      "Project graph has " + arr(pg.features).length + " features but NO features[].steps - the curriculum feed cannot emit planning nodes." + (hasTasks ? " This looks like a legacy knowledge-tree graph (implementation.tasks). Regenerate it with the domain-kit v3 pipeline (runProjectGraphPipeline / hybridGraphPipeline), then re-run." : " Every feature must carry at least one step with id/name/keywords/effort for curriculum planning.")
-    );
-  }
-  newKeywordsInOrder(nodes);
-  return validateCurriculumFeed({
-    schema_version: 2,
-    source: { graph_type: "project_graph", warnings: opts.warnings ?? [], hallucination_count: opts.hallucinationCount ?? 0 },
-    learning_nodes: nodes,
-    dependency_edges: edges,
-    suggested_groupings: groupings,
-    phases: []
-  });
-}
-function emitCurriculumFeed(graph, opts = {}) {
-  const g = graph;
-  if (arr(g.learning_nodes).length > 0) {
-    return validateCurriculumFeed(g);
-  }
-  if (g.project_graph || g.knowledge_graph || arr(g.links).length > 0 || arr(g.phases).length > 0) {
-    return emitFromHybrid(g, opts);
-  }
-  if (arr(g.concepts).length > 0 || str(g.type) === "knowledge_graph") return emitFromKnowledge(g, opts);
-  return emitFromProject(g, opts);
+  merged.imports = Array.from(importCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 20).map(([mod]) => mod);
+  merged.error_handling = Array.from(errorCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 10).map(([p]) => p);
+  merged.types = merged.types.slice(0, 100);
+  merged.functions = merged.functions.slice(0, 100);
+  merged.docstrings = merged.docstrings.slice(0, 20);
+  return merged;
 }
-var BLOOM_RANK, pad22, arr, str, num, strs;
-var init_curriculumFeedEmitter = __esm({
-  "src/feed/curriculumFeedEmitter.ts"() {
-    init_curriculumFeedSchema();
-    BLOOM_RANK = { Remember: 0, Understand: 1, Apply: 2, Analyze: 3, Evaluate: 4, Create: 5 };
-    pad22 = (n) => String(n).padStart(2, "0");
-    arr = (v) => Array.isArray(v) ? v : [];
-    str = (v, d = "") => typeof v === "string" ? v : d;
-    num = (v, d) => typeof v === "number" && Number.isFinite(v) ? v : d;
-    strs = (v) => Array.isArray(v) ? v.filter((x) => typeof x === "string") : [];
-  }
-});
 
-// src/parsers/swift.ts
-var IMPORT_RE = /^import\s+(\w+)/gm;
-var TYPE_RE = /\b(class|struct|enum|protocol)\s+(\w+)(?:\s*:\s*([^{]+))?/g;
-var FUNC_RE = /\bfunc\s+(\w+)\s*\(([^)]*)\)(?:\s*->\s*([^{]+))?/g;
-var WRAPPER_RE = /@(State|Binding|ObservedObject|StateObject|Published|Environment|EnvironmentObject|AppStorage|SceneStorage|FocusState|Observable)\b/g;
-var FRAMEWORK_USAGE_RE = /\b(URLSession|URLRequest|JSONSerialization|JSONDecoder|JSONEncoder|Task|DispatchQueue|Timer|NotificationCenter|UserDefaults|FileManager|Bundle)\b/g;
-function parseSwiftFile(filepath, content) {
+// src/parsers/cpp.ts
+var INCLUDE_RE = /#include\s*[<"]([^>"]+)[>"]/g;
+var TYPE_RE3 = /\b(?:class|struct|enum)\s+(\w+)/g;
+var FUNC_RE4 = /\b(?:void|int|float|double|char|bool|String|uint8_t|uint16_t|uint32_t)\s+(\w+)\s*\(/g;
+function parseCppFile(filepath, content) {
   const result = {
     imports: [],
     types: [],
     functions: [],
-    property_wrappers: [],
-    error_handling: [],
-    frameworks_used: []
+    error_handling: []
   };
   let match;
-  while ((match = IMPORT_RE.exec(content)) !== null) {
+  while ((match = INCLUDE_RE.exec(content)) !== null) {
     result.imports.push(match[1]);
   }
-  const fwSeen = /* @__PURE__ */ new Set();
-  while ((match = FRAMEWORK_USAGE_RE.exec(content)) !== null) {
-    if (!fwSeen.has(match[1])) {
-      fwSeen.add(match[1]);
-      result.frameworks_used.push(match[1]);
-    }
-  }
-  while ((match = TYPE_RE.exec(content)) !== null) {
-    const conforms = (match[3] || "").split(",").map((p) => p.trim()).filter(Boolean);
+  while ((match = TYPE_RE3.exec(content)) !== null) {
     result.types.push({
-      kind: match[1],
-      name: match[2],
-      conforms_to: conforms,
+      kind: "cpp",
+      name: match[1],
       file: filepath
     });
   }
-  while ((match = FUNC_RE.exec(content)) !== null) {
-    const name = match[1];
-    if (name.startsWith("_")) continue;
+  while ((match = FUNC_RE4.exec(content)) !== null) {
     result.functions.push({
-      name,
-      params: (match[2] || "").trim(),
-      returns: (match[3] || "").trim(),
+      name: match[1],
       file: filepath
     });
   }
-  const wrapperSet = /* @__PURE__ */ new Set();
-  while ((match = WRAPPER_RE.exec(content)) !== null) {
-    wrapperSet.add(match[1]);
-  }
-  result.property_wrappers = Array.from(wrapperSet);
-  if (content.includes("do {") || content.includes("do{")) {
-    result.error_handling.push("do-catch");
-  }
-  if (content.includes("throws")) {
-    result.error_handling.push("throws");
-  }
-  if (content.includes("Result<")) {
-    result.error_handling.push("Result type");
-  }
-  if (content.includes("try?")) {
-    result.error_handling.push("try?");
-  }
-  if (content.includes("try!")) {
-    result.error_handling.push("try!");
+  if (/\btry\b|\bthrow\b|\bcatch\b/.test(content)) {
+    result.error_handling.push("try/throw/catch");
   }
   return result;
 }
-function mergeSwiftResults(results) {
+function mergeCppResults(results) {
   const merged = {
     imports: [],
     types: [],
     functions: [],
-    property_wrappers: [],
-    error_handling: [],
-    frameworks_used: []
+    error_handling: []
   };
   const importCounts = /* @__PURE__ */ new Map();
-  const wrapperCounts = /* @__PURE__ */ new Map();
-  const errorCounts = /* @__PURE__ */ new Map();
-  const frameworkSet = /* @__PURE__ */ new Set();
   for (const r of results) {
     for (const imp of r.imports) {
       importCounts.set(imp, (importCounts.get(imp) || 0) + 1);
     }
     merged.types.push(...r.types);
     merged.functions.push(...r.functions);
-    for (const w of r.property_wrappers) {
-      wrapperCounts.set(w, (wrapperCounts.get(w) || 0) + 1);
-    }
-    for (const e of r.error_handling) {
-      errorCounts.set(e, (errorCounts.get(e) || 0) + 1);
-    }
-    for (const fw of r.frameworks_used) {
-      frameworkSet.add(fw);
-    }
-  }
-  merged.imports = Array.from(importCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 20).map(([mod, count]) => mod);
-  merged.property_wrappers = Array.from(wrapperCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 10).map(([w]) => w);
-  merged.error_handling = Array.from(errorCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 10).map(([p]) => p);
-  merged.frameworks_used = Array.from(frameworkSet).sort();
-  merged.types = merged.types.slice(0, 100);
-  merged.functions = merged.functions.slice(0, 100);
-  return merged;
-}
-
-// src/parsers/typescript.ts
-var IMPORT_RE2 = /import\s+.*?from\s+['"]([^'"]+)['"]/g;
-var TYPE_RE2 = /\b(interface|type|class|enum)\s+(\w+)/g;
-var FUNC_RE2 = /\bfunction\s+(\w+)\s*\(([^)]*)\)/g;
-var ARROW_RE = /\bconst\s+(\w+)\s*=\s*\([^)]*\)\s*(?::\s*\w+)?\s*=>/g;
-function parseTsFile(filepath, content) {
-  const result = {
-    imports: [],
-    types: [],
-    functions: [],
-    error_handling: []
-  };
-  let match;
-  while ((match = IMPORT_RE2.exec(content)) !== null) {
-    result.imports.push(match[1]);
-  }
-  while ((match = TYPE_RE2.exec(content)) !== null) {
-    result.types.push({
-      kind: match[1],
-      name: match[2],
-      file: filepath
-    });
-  }
-  while ((match = FUNC_RE2.exec(content)) !== null) {
-    result.functions.push({
-      name: match[1],
-      params: (match[2] || "").trim(),
-      file: filepath
-    });
-  }
-  while ((match = ARROW_RE.exec(content)) !== null) {
-    result.functions.push({
-      name: match[1],
-      params: "",
-      file: filepath
-    });
-  }
-  if (content.includes("try {") || content.includes("try{")) {
-    result.error_handling.push("try-catch");
-  }
-  if (content.includes("Promise")) {
-    result.error_handling.push("Promise");
-  }
-  if (content.includes(".catch(")) {
-    result.error_handling.push(".catch()");
-  }
-  return result;
-}
-function mergeTsResults(results) {
-  const merged = {
-    imports: [],
-    types: [],
-    functions: [],
-    error_handling: []
-  };
-  const importCounts = /* @__PURE__ */ new Map();
-  const errorCounts = /* @__PURE__ */ new Map();
-  for (const r of results) {
-    for (const imp of r.imports) {
-      importCounts.set(imp, (importCounts.get(imp) || 0) + 1);
-    }
-    merged.types.push(...r.types);
-    merged.functions.push(...r.functions);
-    for (const e of r.error_handling) {
-      errorCounts.set(e, (errorCounts.get(e) || 0) + 1);
-    }
-  }
-  merged.imports = Array.from(importCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 20).map(([mod]) => mod);
-  merged.error_handling = Array.from(errorCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 10).map(([p]) => p);
-  merged.types = merged.types.slice(0, 100);
-  merged.functions = merged.functions.slice(0, 100);
-  return merged;
-}
-
-// src/parsers/python.ts
-var IMPORT_RE3 = /^(?:import|from)\s+(\w+)/gm;
-var CLASS_RE = /\bclass\s+(\w+)(?:\s*\(([^)]+)\))?/g;
-var FUNC_RE3 = /\bdef\s+(\w+)\s*\(([^)]*)\)/g;
-var DOCSTRING_RE = /"""([^"]{20,300})"""/g;
-function parsePythonFile(filepath, content) {
-  const result = {
-    imports: [],
-    types: [],
-    functions: [],
-    docstrings: [],
-    error_handling: []
-  };
-  let match;
-  while ((match = IMPORT_RE3.exec(content)) !== null) {
-    result.imports.push(match[1]);
-  }
-  while ((match = DOCSTRING_RE.exec(content)) !== null) {
-    const firstSentence = match[1].trim().split("\n")[0].slice(0, 120);
-    if (firstSentence.length > 15) {
-      result.docstrings.push(firstSentence);
-    }
-  }
-  while ((match = CLASS_RE.exec(content)) !== null) {
-    const bases = (match[2] || "").split(",").map((b) => b.trim()).filter(Boolean);
-    result.types.push({
-      kind: "class",
-      name: match[1],
-      bases,
-      file: filepath
-    });
-  }
-  while ((match = FUNC_RE3.exec(content)) !== null) {
-    const name = match[1];
-    if (name.startsWith("__") && name.endsWith("__")) continue;
-    result.functions.push({
-      name,
-      params: (match[2] || "").trim(),
-      file: filepath
-    });
-  }
-  if (content.includes("try:")) {
-    result.error_handling.push("try-except");
-  }
-  if (content.includes("raise")) {
-    result.error_handling.push("raise");
-  }
-  return result;
-}
-function mergePythonResults(results) {
-  const merged = {
-    imports: [],
-    types: [],
-    functions: [],
-    docstrings: [],
-    error_handling: []
-  };
-  const importCounts = /* @__PURE__ */ new Map();
-  const errorCounts = /* @__PURE__ */ new Map();
-  for (const r of results) {
-    for (const imp of r.imports) {
-      importCounts.set(imp, (importCounts.get(imp) || 0) + 1);
-    }
-    merged.types.push(...r.types);
-    merged.functions.push(...r.functions);
-    merged.docstrings.push(...r.docstrings);
-    for (const e of r.error_handling) {
-      errorCounts.set(e, (errorCounts.get(e) || 0) + 1);
-    }
-  }
-  merged.imports = Array.from(importCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 20).map(([mod]) => mod);
-  merged.error_handling = Array.from(errorCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 10).map(([p]) => p);
-  merged.types = merged.types.slice(0, 100);
-  merged.functions = merged.functions.slice(0, 100);
-  merged.docstrings = merged.docstrings.slice(0, 20);
-  return merged;
-}
-
-// src/parsers/cpp.ts
-var INCLUDE_RE = /#include\s*[<"]([^>"]+)[>"]/g;
-var TYPE_RE3 = /\b(?:class|struct|enum)\s+(\w+)/g;
-var FUNC_RE4 = /\b(?:void|int|float|double|char|bool|String|uint8_t|uint16_t|uint32_t)\s+(\w+)\s*\(/g;
-function parseCppFile(filepath, content) {
-  const result = {
-    imports: [],
-    types: [],
-    functions: [],
-    error_handling: []
-  };
-  let match;
-  while ((match = INCLUDE_RE.exec(content)) !== null) {
-    result.imports.push(match[1]);
-  }
-  while ((match = TYPE_RE3.exec(content)) !== null) {
-    result.types.push({
-      kind: "cpp",
-      name: match[1],
-      file: filepath
-    });
-  }
-  while ((match = FUNC_RE4.exec(content)) !== null) {
-    result.functions.push({
-      name: match[1],
-      file: filepath
-    });
-  }
-  if (/\btry\b|\bthrow\b|\bcatch\b/.test(content)) {
-    result.error_handling.push("try/throw/catch");
-  }
-  return result;
-}
-function mergeCppResults(results) {
-  const merged = {
-    imports: [],
-    types: [],
-    functions: [],
-    error_handling: []
-  };
-  const importCounts = /* @__PURE__ */ new Map();
-  for (const r of results) {
-    for (const imp of r.imports) {
-      importCounts.set(imp, (importCounts.get(imp) || 0) + 1);
-    }
-    merged.types.push(...r.types);
-    merged.functions.push(...r.functions);
-    merged.error_handling.push(...r.error_handling);
+    merged.error_handling.push(...r.error_handling);
   }
   merged.imports = Array.from(importCounts.entries()).sort((a, b) => b[1] - a[1]).slice(0, 20).map(([mod]) => mod);
   merged.error_handling = [...new Set(merged.error_handling)];
@@ -1147,6 +527,17 @@ function extractKeywords(sourceContext, basicAnalysis, repoDir, options) {
 }
 
 // src/utils/llmClient.ts
+function summarizeProvenance(callLog) {
+  const providers = [];
+  const models = [];
+  let failed = 0;
+  for (const r of callLog) {
+    if (!providers.includes(r.provider)) providers.push(r.provider);
+    if (!models.includes(r.model)) models.push(r.model);
+    if (!r.ok) failed++;
+  }
+  return { providers, models, calls: callLog.length, failed_calls: failed, degraded: failed > 0 };
+}
 var LlmClientError = class extends Error {
   constructor(message, status, cause) {
     super(message);
@@ -1179,9 +570,10 @@ function resolveProviderChain(config) {
   return chain;
 }
 var MIN_REQUEST_INTERVAL_MS = 2500;
+var requestIntervalMs = Number(process.env.LLM_MIN_REQUEST_INTERVAL_MS || MIN_REQUEST_INTERVAL_MS);
 var lastRequestAt = 0;
 async function pacedDelay() {
-  const wait = lastRequestAt + MIN_REQUEST_INTERVAL_MS - Date.now();
+  const wait = lastRequestAt + requestIntervalMs - Date.now();
   if (wait > 0) await new Promise((resolve2) => setTimeout(resolve2, wait));
   lastRequestAt = Date.now();
 }
@@ -1196,6 +588,10 @@ function createLlmClient(config) {
   primary.apiKey;
   primary.baseUrl;
   const model = primary.model;
+  if (config?.minRequestIntervalMs !== void 0) {
+    requestIntervalMs = Math.max(0, config.minRequestIntervalMs);
+  }
+  const callLog = [];
   async function chat(messages, options) {
     const temperature = options?.temperature ?? config?.temperature ?? 0.1;
     const maxTokens = options?.maxTokens ?? config?.maxTokens ?? parseInt(process.env.LLM_MAX_TOKENS || "65536", 10);
@@ -1210,6 +606,7 @@ function createLlmClient(config) {
         await new Promise((resolve2) => setTimeout(resolve2, 2e4));
       }
       for (const provider of chain) {
+        const recIdx = callLog.push({ provider: provider.label, model: provider.model, ok: false }) - 1;
         try {
           const headers = {
             "Content-Type": "application/json",
@@ -1270,6 +667,7 @@ function createLlmClient(config) {
               const retryData = await retry.json();
               const retryContent2 = retryData.choices?.[0]?.message?.content || "";
               if (!retryContent2.trim()) throw err;
+              callLog[recIdx] = { ...callLog[recIdx], ok: true };
               return {
                 content: retryContent2,
                 model: retryData.model || provider.model,
@@ -1298,6 +696,7 @@ function createLlmClient(config) {
               if (!retry.ok) throw err;
               const retryData = await retry.json();
               const retryContent = retryData.choices?.[0]?.message?.content || "";
+              callLog[recIdx] = { ...callLog[recIdx], ok: true };
               return {
                 content: retryContent,
                 model: retryData.model || provider.model,
@@ -1328,6 +727,7 @@ function createLlmClient(config) {
           };
         } catch (err) {
           const msg = err instanceof Error ? err.message : String(err);
+          callLog[recIdx] = { ...callLog[recIdx], ok: false, error: msg.slice(0, 200) };
           attempts.push(`${provider.label}: ${msg}`);
           lastError = err instanceof LlmClientError ? err : new LlmClientError(`[${provider.label}] ${msg}`);
         }
@@ -1337,7 +737,7 @@ function createLlmClient(config) {
     }
     throw lastError ?? new LlmClientError("All LLM providers failed after " + MAX_CHAIN_ROUNDS + " rounds.");
   }
-  return { chat, model };
+  return { chat, model, callLog };
 }
 function parseJsonFromLlm(text) {
   let cleaned = text.trim();
@@ -1401,8 +801,8 @@ async function llmChatJson(client, systemPrompt, userPrompt, options) {
 
 // src/graph/scaffoldExtractor.ts
 async function extractScaffold(options) {
-  const { goal, techStack, fileList, llmConfig } = options;
-  const client = createLlmClient(llmConfig);
+  const { goal, techStack, fileList, llmConfig, sharedClient } = options;
+  const client = sharedClient ?? createLlmClient(llmConfig);
   const fileListStr = fileList.length > 0 ? fileList.join("\n") : "(empty)";
   const systemPrompt = "You are a programming pedagogy expert. For ONE concrete project, extract the 'FOUNDATION & SETUP' feature (id F0) \u2014 the COMPLETE set of 'MUST-KNOW' steps the learner needs before studying the first feature. Break it into concrete ACTION steps (5-8 steps), each with completion_level='base'. Include:\n1. Tools required for this tech stack (IDE, simulator/emulator, terminal, git, package manager) + basic operations (open project, build, run, debug, commit).\n2. Create the initial project: from a template OR clone/open the base-project (the provided repo).\n3. MINIMAL programming knowledge of the language (variables, types, functions, if/for, view declaration) + build one small demo (e.g. a single-screen Hello World app) BEFORE touching the real project.\n4. Repo map of the actual project: folder structure, entry point, how to build/run, main architecture (MVVM/Flux...), important packages/modules.\n5. Development loop (build->run->see result->debug), how to read/fix basic compile errors, minimal git workflow (clone/branch/commit/push).\nkeywords[]: real tool/language terms (e.g. 'Xcode', 'Simulator', 'Git', 'Swift', '@main', 'MVVM'). files[]: leave [] or use real paths if the step touches specific files. description: ONE concise sentence, MAX 140 characters. intent: WHY this step matters. outcome: {user_visible: string, technical: string}. acceptance[]: 2 verifiable criteria. effort: {estimated_minutes: number, complexity: low|medium|high}. NEVER invent. ALL text must be in ENGLISH (technical terms stay as-is). Return JSON containing only feature F0.";
   const userPrompt = `App goal: ${goal}
@@ -1487,8 +887,8 @@ ${content}`);
   return blocks.join("\n\n");
 }
 async function extractProjectOverview(options) {
-  const { goal, techStack, sdkApiIndex, fileContentsMap, astKeywords, llmConfig } = options;
-  const client = createLlmClient(llmConfig);
+  const { goal, techStack, sdkApiIndex, fileContentsMap, astKeywords, llmConfig, sharedClient } = options;
+  const client = sharedClient ?? createLlmClient(llmConfig);
   const usedSdkApis = sdkApiIndex.sdk_apis.filter((api) => api.used_in_demo).map((api) => api.name).slice(0, 2e3);
   const allFilesStr = buildSourceText(fileContentsMap);
   let keywordsAnchor = "";
@@ -1557,8 +957,8 @@ ${content}`);
   return blocks.join("\n\n");
 }
 async function extractFeatureSteps(options) {
-  const { goal, techStack, sdkApiIndex, fileContentsMap, feature, llmConfig } = options;
-  const client = createLlmClient(llmConfig);
+  const { goal, techStack, sdkApiIndex, fileContentsMap, feature, llmConfig, sharedClient } = options;
+  const client = sharedClient ?? createLlmClient(llmConfig);
   const usedSdkApis = sdkApiIndex.sdk_apis.filter((api) => api.used_in_demo).map((api) => api.name).slice(0, 2e3);
   const allFilesStr = buildSourceText2(fileContentsMap);
   const fid = feature.id || "F_UNK";
@@ -1625,8 +1025,8 @@ Split this feature into 2-6 action steps. Return JSON:
     concept_codes: []
   }));
 }
-async function extractFeatureStepsBatched(goal, techStack, sdkApiIndex, fileContentsMap, featuresMeta, llmConfig) {
-  const client = createLlmClient(llmConfig);
+async function extractFeatureStepsBatched(goal, techStack, sdkApiIndex, fileContentsMap, featuresMeta, llmConfig, sharedClient) {
+  const client = sharedClient ?? createLlmClient(llmConfig);
   const usedSdkApis = sdkApiIndex.sdk_apis.filter((api) => api.used_in_demo).map((api) => api.name).slice(0, 2e3);
   const sourceText = buildSourceText2(fileContentsMap);
   const featuresListing = featuresMeta.map(
@@ -1893,7 +1293,7 @@ function inferDepthFromContext(keyword, fileContentsMap) {
   return { depth: "sio", rationale: `Default: treating '${keyword}' as SIO (implementation-level)` };
 }
 async function escalateAndMapConcepts(options) {
-  const { projectGraph, fileContentsMap, availableConcepts, conceptMapOverride, llmConfig } = options;
+  const { projectGraph, fileContentsMap, availableConcepts, conceptMapOverride, llmConfig, sharedClient } = options;
   const features = projectGraph.features || [];
   const allTerms = /* @__PURE__ */ new Set();
   for (const feature of features) {
@@ -1909,7 +1309,7 @@ async function escalateAndMapConcepts(options) {
     llmResults = conceptMapOverride;
   } else {
     try {
-      const client = createLlmClient(llmConfig);
+      const client = sharedClient ?? createLlmClient(llmConfig);
       const conceptBank = (availableConcepts || []).sort().join(", ") || "(empty)";
       const termEntries = termList.map((term) => {
         const snippets = extractTermSnippets(term, fileContentsMap);
@@ -1962,13 +1362,16 @@ Return JSON: {"results": {"<keyword>": {"concept_code": "...", "concept_name": "
       const cName = info.concept_name || kw;
       let depth = "sio";
       let depthRationale = "Default: SIO";
+      let depthSource = "override";
       if (info.depth && ["ulo", "cio", "sio"].includes(info.depth)) {
         depth = info.depth;
         depthRationale = `LLM classified as ${depth}`;
+        depthSource = "llm";
       } else {
         const inferred = inferDepthFromContext(kw, fileContentsMap);
         depth = inferred.depth;
         depthRationale = inferred.rationale;
+        depthSource = "heuristic";
       }
       const kwKey = `${cCode}::${kw}`;
       if (seen.has(kwKey)) continue;
@@ -1986,6 +1389,7 @@ Return JSON: {"results": {"<keyword>": {"concept_code": "...", "concept_name": "
         keyword: kw,
         depth,
         depth_rationale: depthRationale,
+        depth_source: depthSource,
         evidence_files: evidenceFiles
       });
     }
@@ -2353,11 +1757,11 @@ function assembleRoadmap(options) {
 }
 
 // src/extractors/fileSelector.ts
-async function selectFilesWithLlm(filePaths, goal, techStack, llmConfig) {
+async function selectFilesWithLlm(filePaths, goal, techStack, llmConfig, sharedClient) {
   if (filePaths.length <= 15) {
     return { selected: filePaths, reasoning: "Too few files to filter" };
   }
-  const client = createLlmClient(llmConfig);
+  const client = sharedClient ?? createLlmClient(llmConfig);
   const treeLines = buildFileTree(filePaths);
   const systemPrompt = 'You are a software architect analyzing a project repository.\nGiven a file tree and a project goal, select which files are MOST IMPORTANT to read for understanding the project architecture and implementation.\n\nRULES:\n1. Prioritize source code files (Swift, TS, Python, C++) over config/docs\n2. Include entry points (App.swift, main.py, index.ts)\n3. Include core domain files (models, services, views, controllers)\n4. EXCLUDE test files, mock files, generated files\n5. EXCLUDE config files (package.json, Podfile, etc.) unless they reveal architecture\n6. Include files that directly implement the features mentioned in the goal\n7. Return 20-40 files maximum (fewer is better if the project is small)\n\nReturn JSON: {"selected": ["path/to/file1", "path/to/file2"], "reasoning": "brief explanation"}';
   const userPrompt = `Project goal: ${goal}
@@ -2519,6 +1923,7 @@ function detectPrimaryLanguage(filePaths) {
 }
 async function runProjectGraphPipeline(options) {
   const { repoDir, goal, techStack, llmConfig, embeddings, onProgress } = options;
+  const client = createLlmClient(llmConfig);
   const log = (step, msg) => {
     console.log(`[${step}] ${msg}`);
     onProgress?.(step, msg);
@@ -2532,7 +1937,8 @@ async function runProjectGraphPipeline(options) {
     allRelPaths,
     goal,
     techStack,
-    llmConfig
+    llmConfig,
+    client
   );
   log("STEP_1", `LLM selected ${selectedPaths.length}/${allRelPaths.length} files: ${reasoning.slice(0, 100)}`);
   log("STEP_1", "Reading content for selected files...");
@@ -2581,7 +1987,8 @@ async function runProjectGraphPipeline(options) {
     goal,
     techStack,
     fileList: filePaths,
-    llmConfig
+    llmConfig,
+    sharedClient: client
   });
   log("STEP_4_C1", "Extracting project overview (features meta)...");
   const overview = await extractProjectOverview({
@@ -2590,7 +1997,8 @@ async function runProjectGraphPipeline(options) {
     sdkApiIndex,
     fileContentsMap,
     astKeywords,
-    llmConfig
+    llmConfig,
+    sharedClient: client
   });
   const product = overview.product;
   const pblStep = {
@@ -2643,7 +2051,8 @@ async function runProjectGraphPipeline(options) {
         sdkApiIndex,
         fileContentsMap,
         nonF0Features,
-        llmConfig
+        llmConfig,
+        client
       );
       for (const feature of nonF0Features) {
         const steps = batchedSteps.get(feature.id || "");
@@ -2659,7 +2068,8 @@ async function runProjectGraphPipeline(options) {
             sdkApiIndex,
             fileContentsMap,
             feature,
-            llmConfig
+            llmConfig,
+            sharedClient: client
           });
           feature.steps = steps;
         } catch (e) {
@@ -2712,7 +2122,8 @@ async function runProjectGraphPipeline(options) {
   const featureConcepts = await escalateAndMapConcepts({
     projectGraph: verifiedGraph,
     fileContentsMap,
-    llmConfig
+    llmConfig,
+    sharedClient: client
   });
   log("STEP_6", `Concept mapping complete: ${featureConcepts.size} features mapped`);
   for (const feature of verifiedGraph.features || []) {
@@ -2779,7 +2190,8 @@ async function runProjectGraphPipeline(options) {
     roadmap,
     hallucinations,
     keywords: astKeywords,
-    featureConcepts
+    featureConcepts,
+    provenance: client.callLog
   };
 }
 
@@ -2899,6 +2311,13 @@ var ULO_CODE_RE = /^ULO-[A-Z][A-Z0-9_]*-\d{2}$/;
 var CIO_CODE_RE = /^CIO-[A-Z][A-Z0-9_]*-\d{2}-[A-Z][A-Z0-9_]*$/;
 var SIO_CODE_RE = /^SIO-[A-Z0-9]+-[A-Z][A-Z0-9_]*-\d{2}$/;
 
+// src/utils/diacritics.ts
+var COMBINING_MARKS = /[\u0300-\u036f]/g;
+var D_WITH_STROKE = /đ/gi;
+function stripDiacritics(s) {
+  return s.normalize("NFD").replace(COMBINING_MARKS, "").replace(D_WITH_STROKE, "d").toLowerCase();
+}
+
 // src/parsers/syllabusParser.ts
 var STOP_WORDS = /* @__PURE__ */ new Set([
   "and",
@@ -3661,7 +3080,7 @@ function loadKnowledgeTreeCatalog(tsvPath) {
 }
 function tokens(s) {
   return new Set(
-    s.toLowerCase().replace(/[^a-z0-9\s-]/g, " ").split(/\s+/).filter((w) => w.length >= 4)
+    stripDiacritics(s).replace(/[^a-z0-9\s-]/g, " ").split(/\s+/).filter((w) => w.length >= 4)
   );
 }
 function filterBySelection(catalog, selectedCategories, selectedTopics, analysisConcepts, maxConcepts = 120) {
@@ -3799,326 +3218,1221 @@ async function standardizeConcepts(opts) {
       if (tc.keywords.length > 0 && adopted.length === 0) {
         throw new Error("Concept " + c.id + " standardized to " + tc.code + " without adopted_keywords \u2014 fail-closed");
       }
-      finalDecisions.push({ ...d, id: c.id, tree_code: tc.code, adopted_keywords: adopted });
-      warnings.push("Concept " + c.id + " standardized as " + tc.code + " (" + tc.name + "), adopted keywords: " + adopted.join(", ") + (d.note ? " \u2014 " + d.note : ""));
-    } else {
-      const code = (d.proposed_code || "").toUpperCase().replace(/[^A-Z0-9_]/g, "_");
-      if (!/^[A-Z][A-Z0-9_]*$/.test(code)) {
-        throw new Error("Concept " + c.id + ' proposed invalid code "' + d.proposed_code + '" \u2014 fail-closed');
+      finalDecisions.push({ ...d, id: c.id, tree_code: tc.code, adopted_keywords: adopted });
+      warnings.push("Concept " + c.id + " standardized as " + tc.code + " (" + tc.name + "), adopted keywords: " + adopted.join(", ") + (d.note ? " \u2014 " + d.note : ""));
+    } else {
+      const code = (d.proposed_code || "").toUpperCase().replace(/[^A-Z0-9_]/g, "_");
+      if (!/^[A-Z][A-Z0-9_]*$/.test(code)) {
+        throw new Error("Concept " + c.id + ' proposed invalid code "' + d.proposed_code + '" \u2014 fail-closed');
+      }
+      finalDecisions.push({ ...d, id: c.id, proposed_code: code });
+      proposals.push({
+        code,
+        name: c.name,
+        description: d.proposed_definition || c.description.slice(0, 300),
+        keywords: c.keywords,
+        subject_codes: "PY",
+        category_codes: "",
+        topic_codes: "",
+        prerequisite_concept_codes: [],
+        status: "proposed",
+        source_concept_id: c.id,
+        possible_tree_matches: (d.possible_tree_matches || []).filter(Boolean)
+      });
+      warnings.push("Concept " + c.id + " proposed as NEW: " + code + (d.possible_tree_matches?.length ? " (near matches: " + d.possible_tree_matches.join(", ") + ")" : ""));
+    }
+  }
+  const outPath = proposalsPath || path.join(os.tmpdir(), "domain-kit-debug", "concept-proposals.json");
+  try {
+    fs.mkdirSync(outPath.slice(0, outPath.lastIndexOf("/")), { recursive: true });
+    fs.writeFileSync(outPath, JSON.stringify({ generated_at: (/* @__PURE__ */ new Date()).toISOString(), proposals }, null, 2));
+    log("STEP_2_5", "Proposals written: " + proposals.length + " -> " + outPath);
+  } catch (e) {
+    warnings.push("Could not write proposals artifact: " + (e instanceof Error ? e.message : String(e)));
+  }
+  return { decisions: finalDecisions, proposals, warnings, shortlistSize: shortlist.length, catalogSize: catalog.concepts.length };
+}
+
+// src/graph/knowledgeGraphPipeline.ts
+var MIN_CALIBRATION_MINUTES = 15;
+var MAX_CALIBRATION_MINUTES = 60;
+var DEFAULT_CONCEPT_MINUTES = 30;
+var MIN_CALIBRATION_DIVERGENCE = 0.5;
+function calibrateConceptMinutes(sioCount, problemTypeCount, prereqCount, hasHighBloom) {
+  const ratio = (value, cap) => Math.min(1, Math.max(0, value) / cap);
+  const score = 0.3 * ratio(sioCount, 4) + 0.25 * ratio(problemTypeCount, 4) + 0.2 * ratio(prereqCount, 4) + 0.25 * (hasHighBloom ? 1 : 0);
+  return Math.round(MIN_CALIBRATION_MINUTES + score * (MAX_CALIBRATION_MINUTES - MIN_CALIBRATION_MINUTES));
+}
+function topologicalSort(concepts) {
+  const inDegree = /* @__PURE__ */ new Map();
+  const adjacency = /* @__PURE__ */ new Map();
+  for (const concept of concepts) {
+    inDegree.set(concept.id, 0);
+    adjacency.set(concept.id, []);
+  }
+  for (const concept of concepts) {
+    for (const prereq of concept.prerequisites || []) {
+      adjacency.get(prereq)?.push(concept.id);
+      inDegree.set(concept.id, (inDegree.get(concept.id) || 0) + 1);
+    }
+  }
+  const queue = [];
+  for (const [id, degree] of inDegree) {
+    if (degree === 0) queue.push(id);
+  }
+  const sorted = [];
+  while (queue.length > 0) {
+    const current = queue.shift();
+    sorted.push(current);
+    for (const neighbor of adjacency.get(current) || []) {
+      const newDegree = (inDegree.get(neighbor) || 1) - 1;
+      inDegree.set(neighbor, newDegree);
+      if (newDegree === 0) queue.push(neighbor);
+    }
+  }
+  if (sorted.length !== concepts.length) {
+    console.warn(`[WARN] Topological sort incomplete: ${sorted.length}/${concepts.length} concepts sorted`);
+  }
+  return sorted;
+}
+async function generateKnowledgeGraph(options) {
+  const { subject, description, syllabusText, gradeBand, domain, techStack, llmConfig, onProgress } = options;
+  const warnings = [];
+  const log = (step, msg) => {
+    console.log(`[KG-${step}] ${msg}`);
+    onProgress?.(step, msg);
+  };
+  log("STEP_1", "Decomposing subject into concepts...");
+  let parsedSyllabus = options.parsedSyllabus;
+  if (!parsedSyllabus && syllabusText) {
+    parsedSyllabus = parseSyllabus(syllabusText);
+    log("STEP_1", `Parsed syllabus: ${parsedSyllabus.units.length} units, ${parsedSyllabus.allTopics.length} topics`);
+  }
+  const client = createLlmClient(llmConfig);
+  const maxSyllabusChars = parseInt(process.env.KG_MAX_SYLLABUS_CHARS || "16000", 10);
+  let truncatedSyllabus = "";
+  if (syllabusText) {
+    if (syllabusText.length > maxSyllabusChars) {
+      truncatedSyllabus = syllabusText.slice(0, maxSyllabusChars);
+      warnings.push(`Syllabus truncated from ${syllabusText.length} to ${maxSyllabusChars} chars \u2014 may miss some concepts`);
+    } else {
+      truncatedSyllabus = syllabusText;
+    }
+  }
+  const structuredTopicsGuide = parsedSyllabus && parsedSyllabus.allTopics.length > 0 ? `
+STRUCTURED SYLLABUS TOPICS (Every topic MUST map to at least one concept to ensure 100% syllabus coverage):
+` + parsedSyllabus.allTopics.map((t) => `- [${t.unitTitle}] ${t.id}: ${t.title} (Keywords: ${t.keywords.join(", ")})`).join("\n") + "\n" : "";
+  const systemPrompt = `You are an expert curriculum designer. Decompose the given subject into a structured knowledge graph with concepts, prerequisites, and problem types.
+
+CRITICAL RULES:
+1. Each concept MUST have the three depth layers, authored against this CONTRACT:
+   - ulo (WHAT + WHY): bound to the CONCEPT's intrinsic NATURE. It explains what the
+     concept is and why it exists \u2014 the problem it solves in principle. It must be
+     TECHNOLOGY-AGNOSTIC: never name a concrete library, API, function, file format,
+     tool or language feature. Typical assessment level: Remember / Understand.
+   - cio (HOW): the MECHANISM \u2014 how the concept works and solves that problem, step
+     by step. Still bound to the concept's nature: more concrete than the ULO, but
+     NOT tied to one specific technology (no concrete API names). CIO capability is
+     assessed INDIRECTLY, through completing contextual work, not in isolation.
+   - sio (IMPLEMENTATION): an array of 2-4 items. EVERY item MUST reference concrete
+     KEYWORDS/technologies (a real API, function, module, file, or named pattern) and
+     describe a completable, context-specific implementation task. Application,
+     Analysis and Creation skills are assessed INDIRECTLY through completing these
+     items. There is NO fixed Bloom ceiling for a layer \u2014 but concreteness MUST
+     strictly increase: SIO more technology-bound than CIO, CIO more concrete than ULO.
+   - prerequisites: concept IDs that must be learned first (MUST NOT create cycles)
+   - problem_types: 2-4 problem types with bloom_level and difficulty. Remember and
+     Understand problem types test the ULO/CIO directly; Apply-and-above types are
+     proxies for SIO completion in context.
+   - techniques: methods, formulas, tools
+2. Prerequisite chains MUST be acyclic (no concept can depend on itself or create a loop)
+3. Concepts should be ordered by prerequisite dependency (topological sort)
+4. Problem types should range from Remember to Apply (not all at same level)
+5. Group concepts into categories (chapters/sections)
+6. ALL text in ENGLISH (even if input is Vietnamese)
+7. NEVER invent concepts not present in the syllabus
+8. KEYWORDS: Each concept MUST include 5-10 domain-specific keywords that:
+   - Are concrete terms a student encounters when studying THIS concept
+   - Include at least 2 technology-specific terms (APIs, functions, types, tools)
+   - Are DISTINCT from keywords of other concepts (minimal overlap)
+   - NEVER generic English words (e.g. "view", "data", "code" are TOO generic)
+   - Example for "SwiftUI Layout": ["VStack", "HStack", "ZStack", ".padding()", ".frame()", "alignment", "Spacer", "LazyVGrid"]
+9. Return JSON matching the KnowledgeGraphSchema`;
+  const userPrompt = `Subject: ${subject}
+${description ? `Description: ${description}` : ""}
+${structuredTopicsGuide}${truncatedSyllabus ? `Syllabus:
+${truncatedSyllabus}` : ""}
+${gradeBand ? `Grade band: ${gradeBand[0]}-${gradeBand[1]}` : ""}
+${domain ? `Domain: ${domain}` : ""}
+
+Return JSON:
+{
+  "subject": {
+    "id": "${subject.toLowerCase().replace(/\s+/g, "-").slice(0, 30)}",
+    "name": "${subject}",
+    "description": "...",
+    "domain": "${domain || "other"}",
+    "grade_band": ${gradeBand ? `[${gradeBand[0]}, ${gradeBand[1]}]` : "[6, 12]"}
+  },
+  "concepts": [
+    {
+      "id": "C1",
+      "name": "Concept name",
+      "description": "2-3 sentence description: what this concept covers, why a learner encounters it, and what mastering it enables. Must be specific enough that a student reading only this description understands the concept's scope.",
+      "category": "category_id",
+      "keywords": ["specific_term_1", "concrete_api_2", "method_call_3", "tool_or_type_4", "syntax_keyword_5", "concept_term_6"],
+      "ulo": "WHAT + WHY in technology-agnostic language: what the concept is and the problem it exists to solve. No library/API/tool names.",
+      "cio": "HOW the mechanism works, still technology-agnostic but more concrete than the ULO.",
+      "sio": ["Concrete task naming a REAL API/function/module/file from the target technology, completable end to end", "Another technology-bound task using a different concrete keyword"],
+      "prerequisites": [],
+      "estimated_minutes": 30,
+      "problem_types": [
+        {
+          "id": "PT-C1-01",
+          "name": "Problem type name",
+          "description": "What this problem type tests",
+          "bloom_level": "Remember",
+          "difficulty": "easy",
+          "estimated_minutes": 10
+        }
+      ],
+      "techniques": ["technique 1", "technique 2"],
+      "common_mistakes": ["mistake 1"]
+    }
+  ],
+  "categories": [
+    {
+      "id": "cat1",
+      "name": "Category name",
+      "description": "Category description",
+      "concept_ids": ["C1", "C2"],
+      "order": 1
+    }
+  ],
+  "learning_path": [
+    {"concept_id": "C1", "order": 1, "depends_on": []},
+    {"concept_id": "C2", "order": 2, "depends_on": ["C1"]}
+  ]
+}`;
+  const result = await llmChatJson(client, systemPrompt, userPrompt, {
+    temperature: 0.1,
+    maxTokens: parseInt(process.env.KG_MAX_TOKENS || "65536", 10)
+  });
+  log("STEP_2", "Validating and cleaning knowledge graph...");
+  const concepts = result.concepts || [];
+  const categories = result.categories || [];
+  for (const c of concepts) {
+    if ((c.description || "").length < 50) {
+      warnings.push("Concept " + c.id + ": description too short (" + (c.description || "").length + " chars) \u2014 may produce shallow KX narratives");
+    }
+  }
+  {
+    const STOP = /* @__PURE__ */ new Set(["and", "the", "for", "with", "from", "that", "this", "into", "when", "while", "using", "their", "your", "each", "how", "why", "what", "between", "through", "about"]);
+    const tokensFrom = (text) => stripDiacritics(text).replace(/[^a-z0-9\s-]/g, " ").split(/\s+/).filter((w) => w.length >= 4 && !STOP.has(w));
+    for (const c of concepts) {
+      const existing = (c.keywords || []).map((k) => String(k).trim()).filter(Boolean);
+      if (existing.length === 0) {
+        const derived = [.../* @__PURE__ */ new Set([...tokensFrom(c.name), ...tokensFrom(c.description || "")])].slice(0, 8);
+        if (derived.length === 0) {
+          throw new Error("Concept " + c.id + " (" + c.name + ") has no keywords and none could be derived from name/description \u2014 fail-closed");
+        }
+        c.keywords = derived;
+        warnings.push("Concept " + c.id + ": empty keyword set - derived " + derived.join(", ") + " from name/description (WARNING: LLM returned no keywords)");
+      } else {
+        c.keywords = existing;
+      }
+    }
+  }
+  const rawPath = result.learning_path;
+  let learningPath = (rawPath || []).map((s) => ({
+    concept_id: String(s.concept_id || ""),
+    order: Number(s.order || 0),
+    depends_on: Array.isArray(s.depends_on) ? s.depends_on.map(String) : [],
+    milestone_name: String(s.milestone_name || "")
+  }));
+  const conceptIds = new Set(concepts.map((c) => c.id));
+  for (const concept of concepts) {
+    for (const prereq of concept.prerequisites || []) {
+      if (!conceptIds.has(prereq)) {
+        warnings.push(`Concept ${concept.id} references non-existent prerequisite ${prereq} \u2014 removed`);
+        concept.prerequisites = (concept.prerequisites || []).filter((p) => p !== prereq);
+      }
+    }
+  }
+  if (options.knowledgeTreePath) {
+    const catalog = loadKnowledgeTreeCatalog(options.knowledgeTreePath);
+    log("STEP_2_5", "Knowledge tree loaded: " + catalog.concepts.length + " concepts from " + catalog.path.split("/").pop());
+    const std = await standardizeConcepts({
+      client,
+      concepts: concepts.map((c) => ({
+        id: c.id,
+        name: c.name,
+        description: c.description || "",
+        keywords: c.keywords || []
+      })),
+      catalog,
+      techStack,
+      proposalsPath: options.proposalsPath,
+      onProgress: log
+    });
+    warnings.push(...std.warnings);
+    const codeByStd = new Map(std.decisions.map((d) => [d.id, d]));
+    for (const c of concepts) {
+      const d = codeByStd.get(c.id);
+      if (!d) throw new Error("Concept " + c.id + " missing standardization decision \u2014 fail-closed");
+      if (d.decision === "standardized") {
+        c.standardization = "standardized";
+        c.tree_code = d.tree_code;
+        c.code = d.tree_code;
+        const tc = catalog.concepts.find((x) => x.code === d.tree_code);
+        if (tc) {
+          for (const k of d.adopted_keywords || []) {
+            if (!(c.keywords || []).some((x) => x.toLowerCase() === k.toLowerCase())) {
+              c.keywords = [...c.keywords || [], k];
+            }
+          }
+          c.tree_prerequisites = tc.prerequisiteCodes;
+        }
+      } else {
+        c.standardization = "proposed_new";
+        c.code = d.proposed_code;
+      }
+    }
+    const idByTreeCode = new Map(concepts.filter((c) => c.tree_code).map((c) => [c.tree_code, c.id]));
+    for (const c of concepts) {
+      for (const tp of c.tree_prerequisites || []) {
+        const target = idByTreeCode.get(tp);
+        if (target && target !== c.id && !(c.prerequisites || []).includes(target)) {
+          c.prerequisites = [...c.prerequisites || [], target];
+          warnings.push("Prereq seeded from tree: " + c.id + " <- " + tp + " (" + target + ")");
+        }
+      }
+    }
+    log("STEP_2_5", "Standardized: " + std.decisions.filter((d) => d.decision === "standardized").length + ", proposed new: " + std.decisions.filter((d) => d.decision === "proposed_new").length);
+  }
+  log("STEP_3", "Checking for prerequisite cycles...");
+  const cycles = detectPrerequisiteCycles(concepts);
+  if (cycles.length > 0) {
+    log("STEP_3", `Found ${cycles.length} cycle(s) in prerequisite chain \u2014 breaking cycles`);
+    for (const cycle of cycles) {
+      warnings.push(`Cycle detected: ${cycle.join(" \u2192 ")} \u2014 breaking at weakest edge`);
+    }
+    const { fixed, removed } = breakPrerequisiteCycles(concepts, cycles);
+    for (let i = 0; i < concepts.length; i++) {
+      const fixedConcept = fixed.find((f) => f.id === concepts[i].id);
+      if (fixedConcept) {
+        concepts[i] = { ...concepts[i], prerequisites: fixedConcept.prerequisites };
+      }
+    }
+    for (const { from, to } of removed) {
+      warnings.push(`Removed prerequisite edge: ${from} \u2192 ${to} (cycle breaker)`);
+    }
+  }
+  log("STEP_4", "Topological sort of concepts...");
+  const sortedIds = topologicalSort(concepts);
+  learningPath = sortedIds.map((id, idx) => {
+    const concept = concepts.find((c) => c.id === id);
+    return {
+      concept_id: id,
+      order: idx + 1,
+      depends_on: concept?.prerequisites || [],
+      milestone_name: ""
+    };
+  });
+  log("STEP_5", "Authoring ULO/CIO/SIO depth layers hierarchically...");
+  {
+    const lo = await authorDepthLayersHierarchically(
+      client,
+      concepts.map((c) => ({ id: c.id, name: c.name, description: c.description, keywords: c.keywords })),
+      techStack || (domain === "software" || domain === "technology" ? "python" : domain || "general"),
+      warnings
+    );
+    const codeByConceptId = assignConceptCodes(concepts.map((c) => ({ id: c.id, name: c.name })));
+    const techTag = techTagFor(techStack || (domain === "software" || domain === "technology" ? "python" : domain || "general"));
+    for (const concept of concepts) {
+      concept.ulo = lo.uloByConcept[concept.id] || concept.ulo || "";
+      concept.cio = lo.cioByConcept[concept.id] || concept.cio || "";
+      if (lo.sioByConcept[concept.id] && lo.sioByConcept[concept.id].length > 0) {
+        concept.sio = lo.sioByConcept[concept.id];
+      }
+      concept.code = concept.code || codeByConceptId[concept.id];
+      concept.ulo_code = concept.ulo ? uloCode(concept.code) : concept.ulo_code;
+      concept.cio_code = concept.cio ? cioCode(concept.code, 1, cioActionSlug(concept.cio)) : concept.cio_code;
+      concept.sio_codes = concept.sio.length > 0 ? concept.sio.map((_, i) => sioCode(techTag, concept.code, i + 1)) : concept.sio_codes;
+    }
+    log("STEP_5", "Depth layers authored: " + concepts.length + " concepts, audit " + lo.audits.filter((a) => a.passed).length + "/" + concepts.length + " passed");
+  }
+  {
+    for (const concept of concepts) {
+      const sioText = (concept.sio || []).join(" ");
+      const techTokens = [];
+      let m;
+      const techTokenRe = /`([^`]+)`/g;
+      while ((m = techTokenRe.exec(sioText)) !== null) {
+        if (m[1].length >= 3 && m[1].length <= 40) techTokens.push(m[1]);
+      }
+      const annotationRe = /(?:^|[\s(])(@[A-Za-z]\w*)/g;
+      while ((m = annotationRe.exec(sioText)) !== null) techTokens.push(m[1]);
+      const dotRe = /\b\w+\.\w+\(/g;
+      while ((m = dotRe.exec(sioText)) !== null) techTokens.push(m[0].replace("(", ""));
+      const modifierRe = /(?:^|[\s(])(\.[a-z]\w*)\b/g;
+      while ((m = modifierRe.exec(sioText)) !== null) techTokens.push(m[1]);
+      const camelRe = /\b[a-z]+[A-Z][A-Za-z]+\b/g;
+      while ((m = camelRe.exec(sioText)) !== null) techTokens.push(m[0]);
+      const existing = new Set((concept.keywords || []).map((k) => k.toLowerCase()));
+      const newTokens = [...new Set(techTokens)].filter((t) => !existing.has(t.toLowerCase())).slice(0, 8);
+      if (newTokens.length > 0) {
+        concept.keywords = [...concept.keywords || [], ...newTokens];
+        warnings.push("Concept " + concept.id + ": enriched keywords with " + newTokens.length + " SIO-derived tokens");
+      }
+    }
+    log("STEP_5b", "SIO-keyword enrichment complete");
+  }
+  {
+    for (const concept of concepts) {
+      const sioCount = (concept.sio || []).length;
+      const ptCount = (concept.problem_types || []).length;
+      const prereqCount = (concept.prerequisites || []).length;
+      const hasHighBloom = (concept.problem_types || []).some(
+        (pt) => ["Analyze", "Evaluate", "Create"].includes(pt.bloom_level || "")
+      );
+      const calibrated = calibrateConceptMinutes(sioCount, ptCount, prereqCount, hasHighBloom);
+      const llmEstimate = concept.estimated_minutes || DEFAULT_CONCEPT_MINUTES;
+      if (Math.abs(calibrated - llmEstimate) / llmEstimate > MIN_CALIBRATION_DIVERGENCE) {
+        concept.estimated_minutes = calibrated;
+        warnings.push("Concept " + concept.id + ": minutes calibrated " + llmEstimate + "m \u2192 " + calibrated + "m");
+      }
+    }
+    log("STEP_5c", "Minute calibration complete");
+  }
+  for (const step of learningPath) {
+    if (!conceptIds.has(step.concept_id)) {
+      warnings.push(`Learning path references non-existent concept ${step.concept_id}`);
+    }
+  }
+  log("STEP_2", `Validated ${concepts.length} concepts, ${categories.length} categories, ${learningPath.length} learning path steps`);
+  const rawGraph = {
+    schema_version: 1,
+    type: "knowledge_graph",
+    subject: result.subject,
+    concepts,
+    categories,
+    learning_path: learningPath
+  };
+  log("STEP_6", "Running Knowledge Graph verification & reverse coverage audit...");
+  const { verifiedGraph, report } = verifyKnowledgeGraph(rawGraph, parsedSyllabus);
+  warnings.push(...report.warnings);
+  return {
+    knowledgeGraph: verifiedGraph,
+    warnings,
+    verificationReport: report,
+    provenance: client.callLog
+  };
+}
+var FeedKeywordsSchema = zod.z.object({
+  all: zod.z.array(zod.z.string()).default([]),
+  new: zod.z.array(zod.z.string()).default([]),
+  prerequisite: zod.z.array(zod.z.string()).default([])
+});
+var FeedScaffoldCandidateSchema = zod.z.object({
+  item: zod.z.string(),
+  reason: zod.z.string().default(""),
+  minutes_saved: zod.z.number().int().nonnegative().default(0),
+  suggest: zod.z.enum(["provide_full", "provide_partial", "provide_reference"]).default("provide_full")
+});
+var FeedNodeSchema = zod.z.object({
+  id: zod.z.string().min(1),
+  kind: zod.z.enum(["skill", "concept", "product_step"]),
+  name: zod.z.string().min(1),
+  concept_codes: zod.z.array(zod.z.string()).default([]),
+  keywords: FeedKeywordsSchema,
+  estimated_minutes: zod.z.number().int().nonnegative(),
+  bloom_hint: zod.z.enum(["Remember", "Understand", "Apply", "Analyze", "Evaluate", "Create"]).nullable().default(null),
+  depth_hint: zod.z.enum(["ulo", "cio", "sio"]).nullable().default(null),
+  completion_level: zod.z.enum(["mvp", "standard", "stretch"]).default("standard"),
+  scaffolding: zod.z.object({
+    scaffold_candidates: zod.z.array(FeedScaffoldCandidateSchema).default([]),
+    core_value_minutes: zod.z.number().int().nonnegative().default(0)
+  }).default({ scaffold_candidates: [], core_value_minutes: 0 }),
+  references: zod.z.array(zod.z.object({ file: zod.z.string().min(1), evidence: zod.z.string().default("") })).default([]),
+  feature_id: zod.z.string().nullable().default(null),
+  concept_ref: zod.z.string().nullable().default(null),
+  // P52/T2.1: outcome.user_visible projected from the ProjectGraph step — the
+  // tangible checkpoint the session-cutting planner aims for (empty when the
+  // step declares no user-visible result). Concepts carry '' by default.
+  user_visible_deliverable: zod.z.string().default(""),
+  // P52/T3.1 — depth-reconcile inputs (optional/defaulted so old feeds
+  // validate unchanged):
+  // • depth_variants: minutes to teach this node at each depth level.
+  //  ULO (know-it-exists) ≤ CIO (mechanism) ≤ SIO (implementation). All 3
+  //   required so a downgrade never turns an anchor teach into a zero.
+  // • depth_scaffold_candidates: parallel to scaffold_candidates but
+  //   acts on DEPTH (e.g. SIO→CIO) instead of lesson time.
+  // • is_core: concept is a Master-Tree core concept — reconciler must
+  //   never downgrade it; escalate instead.
+  depth_variants: zod.z.object({ ulo: zod.z.number().int().nonnegative(), cio: zod.z.number().int().nonnegative(), sio: zod.z.number().int().nonnegative() }).optional(),
+  depth_scaffold_candidates: zod.z.array(zod.z.object({
+    from_depth: zod.z.enum(["ulo", "cio", "sio"]),
+    to_depth: zod.z.enum(["ulo", "cio", "sio"]),
+    minutes_saved: zod.z.number().int().nonnegative(),
+    reason: zod.z.string().default("")
+  })).optional(),
+  is_core: zod.z.boolean().default(false),
+  /**
+   * Prerequisite concept ids this node needs that NO node in this feed provides —
+   * i.e. the learner must already know them before starting. Previously these were
+   * silently dropped (knowledge path) or crashed emission (both hybrid paths), so a
+   * course silently lost its entry requirements. Kept on the node so the mapping
+   * "concept X needs prior knowledge Y" survives; a course-level roll-up is derivable.
+   */
+  external_prerequisites: zod.z.array(zod.z.string()).default([]),
+  // Depth layer text (optional, additive — old feeds validate unchanged).
+  // Carries the ULO/CIO/SIO authored text from the KnowledgeGraph concept
+  // so downstream consumers (KX generator) can inject depth-appropriate
+  // material into their prompts without a second LLM call.
+  depth_context: zod.z.object({
+    ulo: zod.z.string().default(""),
+    cio: zod.z.string().default(""),
+    sio: zod.z.array(zod.z.string()).default([])
+  }).optional(),
+  // Progressive-completion bookkeeping (feed v2, additive):
+  // phase_id = development phase that introduces/uses this node;
+  // introduce_aspect = how the phase teaches a concept node (first intro, advanced
+  // revisit, or preview — a light ULO awareness pass that is NOT the introduction).
+  phase_id: zod.z.string().default(""),
+  introduce_aspect: zod.z.enum(["new", "advanced", "preview"]).nullable().default(null)
+});
+var FeedEdgeSchema = zod.z.object({
+  from: zod.z.string().min(1),
+  to: zod.z.string().min(1),
+  kind: zod.z.enum(["knowledge", "task"]),
+  reason: zod.z.string().default("")
+});
+var FeedGroupingSchema = zod.z.object({
+  id: zod.z.string().min(1),
+  name: zod.z.string().min(1),
+  node_ids: zod.z.array(zod.z.string()).min(1),
+  rationale: zod.z.string().default("")
+});
+var FeedPhaseSchema = zod.z.object({
+  id: zod.z.string().min(1),
+  order: zod.z.number().int().positive(),
+  name: zod.z.string().min(1),
+  product_completion: zod.z.string().min(1),
+  node_ids: zod.z.array(zod.z.string()).min(1)
+});
+var FeedDiagnosticSchema = zod.z.object({
+  code: zod.z.string().min(1),
+  severity: zod.z.enum(["info", "warning", "error"]),
+  message: zod.z.string(),
+  node_ids: zod.z.array(zod.z.string()).default([])
+});
+var FeedProvenanceSchema = zod.z.object({
+  providers: zod.z.array(zod.z.string()).default([]),
+  models: zod.z.array(zod.z.string()).default([]),
+  calls: zod.z.number().int().nonnegative().default(0),
+  failed_calls: zod.z.number().int().nonnegative().default(0),
+  degraded: zod.z.boolean().default(false)
+});
+var CurriculumFeedSchema = zod.z.object({
+  schema_version: zod.z.literal(2),
+  source: zod.z.object({
+    graph_type: zod.z.enum(["project_graph", "knowledge_graph", "hybrid_graph"]),
+    /** DERIVED from diagnostics — do not write to it directly. */
+    warnings: zod.z.array(zod.z.string()).default([]),
+    hallucination_count: zod.z.number().int().nonnegative().default(0),
+    diagnostics: zod.z.array(FeedDiagnosticSchema).default([]),
+    provenance: FeedProvenanceSchema.optional()
+  }),
+  learning_nodes: zod.z.array(FeedNodeSchema).min(1, "curriculum feed must contain at least one learning node"),
+  dependency_edges: zod.z.array(FeedEdgeSchema).default([]),
+  suggested_groupings: zod.z.array(FeedGroupingSchema).default([]),
+  // Progressive completion phases (cross-feature). When non-empty, these — not
+  // suggested_groupings — define the teaching sequence and unit structure.
+  phases: zod.z.array(FeedPhaseSchema).default([])
+});
+function validateCurriculumFeed(feed) {
+  const parsed = CurriculumFeedSchema.parse(feed);
+  const ids = new Set(parsed.learning_nodes.map((n) => n.id));
+  if (ids.size !== parsed.learning_nodes.length) {
+    throw new Error("curriculum feed contains duplicate node ids");
+  }
+  for (const e of parsed.dependency_edges) {
+    if (!ids.has(e.from) || !ids.has(e.to)) {
+      throw new Error("curriculum feed edge " + e.from + " -> " + e.to + " references unknown node");
+    }
+    if (e.from === e.to) throw new Error("curriculum feed self-loop edge on " + e.from);
+  }
+  for (const g of parsed.suggested_groupings) {
+    for (const id of g.node_ids) {
+      if (!ids.has(id)) throw new Error("grouping " + g.id + " references unknown node " + id);
+    }
+  }
+  for (const ph of parsed.phases) {
+    for (const id of ph.node_ids) {
+      if (!ids.has(id)) throw new Error("phase " + ph.id + " references unknown node " + id);
+    }
+  }
+  const phaseIds = parsed.phases.map((p) => p.id);
+  if (new Set(phaseIds).size !== phaseIds.length) throw new Error("curriculum feed contains duplicate phase ids");
+  const phaseOrders = parsed.phases.map((p) => p.order);
+  if (new Set(phaseOrders).size !== phaseOrders.length) {
+    throw new Error("curriculum feed contains duplicate phase orders: " + phaseOrders.join(", "));
+  }
+  for (let i = 1; i < phaseOrders.length; i++) {
+    if (phaseOrders[i] <= phaseOrders[i - 1]) {
+      throw new Error("curriculum feed phase orders are not ascending: " + phaseOrders.join(", "));
+    }
+  }
+  if (parsed.phases.length > 0) {
+    const phaseIndexOf = /* @__PURE__ */ new Map();
+    parsed.phases.forEach((p, i) => {
+      for (const id of p.node_ids) phaseIndexOf.set(id, i);
+    });
+    for (const e of parsed.dependency_edges) {
+      const fromIdx = phaseIndexOf.get(e.from);
+      const toIdx = phaseIndexOf.get(e.to);
+      if (fromIdx === void 0 || toIdx === void 0) continue;
+      if (fromIdx > toIdx) {
+        throw new Error(
+          "curriculum feed teaching-order violation: prerequisite " + e.from + " (phase " + (fromIdx + 1) + ") is scheduled AFTER its consumer " + e.to + " (phase " + (toIdx + 1) + ")"
+        );
+      }
+    }
+  }
+  return parsed;
+}
+
+// src/feed/curriculumFeedEmitter.ts
+var DEPTH_MINUTE_FRACTIONS = {
+  /** Awareness-only pass before the anchor teach. */
+  preview: 0.25,
+  ulo: 0.35,
+  cio: 0.65,
+  /** An advanced revisit re-teaches the concept, not the whole thing again. */
+  advancedRevisit: 0.5,
+  /** Minutes saved when an advanced revisit drops from SIO practice to a CIO recap. */
+  advancedRecapSave: 0.3,
+  /** Floor so a tiny concept still gets a teachable awareness pass. */
+  floor: 5,
+  /** Floor for an advanced revisit — it is a real teach, not an awareness pass. */
+  advancedFloor: 15
+};
+var DEFAULT_STEP_MINUTES = 15;
+var BLOOM_RANK = { Remember: 0, Understand: 1, Apply: 2, Analyze: 3, Evaluate: 4, Create: 5 };
+var pad22 = (n) => String(n).padStart(2, "0");
+var steplessStepIds = [];
+var takeSteplessStepIds = () => steplessStepIds.splice(0, steplessStepIds.length);
+var arr = (v) => Array.isArray(v) ? v : [];
+var str = (v, d = "") => typeof v === "string" ? v : d;
+var num = (v, d) => typeof v === "number" && Number.isFinite(v) ? v : d;
+var strs = (v) => Array.isArray(v) ? v.filter((x) => typeof x === "string") : [];
+function stepMinutes(step) {
+  const effort = step.effort ?? {};
+  return Math.max(0, Math.round(num(effort.estimated_minutes, num(step.estimated_minutes, DEFAULT_STEP_MINUTES))));
+}
+function diagnosticsOf(opts) {
+  const list = opts.diagnostics ?? (opts.diagnostics = []);
+  for (const message of opts.warnings ?? []) {
+    if (!list.some((d) => d.code === "upstream_warning" && d.message === message)) {
+      list.push({ code: "upstream_warning", severity: "warning", message, node_ids: [] });
+    }
+  }
+  return list;
+}
+function pushDiagnostic(opts, code, severity, message, nodeIds = []) {
+  diagnosticsOf(opts).push({ code, severity, message, node_ids: nodeIds });
+}
+function splitPrerequisites(concept, known) {
+  const internal = [];
+  const external = [];
+  for (const p of strs(concept.prerequisites)) {
+    (known.has(p) ? internal : external).push(p);
+  }
+  return { internal, external };
+}
+function noteExternalPrerequisites(opts, byNode) {
+  if (byNode.size === 0) return;
+  const entries = [];
+  for (const [nodeId, prereqs] of byNode) {
+    for (const prereqId of prereqs) entries.push({ nodeId, prereqId });
+  }
+  entries.sort((a, b) => a.nodeId === b.nodeId ? a.prereqId.localeCompare(b.prereqId) : a.nodeId.localeCompare(b.nodeId));
+  pushDiagnostic(
+    opts,
+    "external_prerequisite",
+    "info",
+    "Prerequisite(s) outside this analysis \u2014 the learner must already know them: " + entries.map((e) => e.nodeId + " \u2190 " + e.prereqId).join(", "),
+    entries.map((e) => e.nodeId)
+  );
+}
+function buildSource(opts, graphType) {
+  const diagnostics = diagnosticsOf(opts);
+  return {
+    graph_type: graphType,
+    // Derived view — 'info' diagnostics are deliberately not surfaced as warnings.
+    warnings: diagnostics.filter((d) => d.severity !== "info").map((d) => d.message),
+    hallucination_count: opts.hallucinationCount ?? 0,
+    diagnostics,
+    provenance: opts.provenance
+  };
+}
+function keywordKey(k) {
+  return k.normalize("NFC").toLowerCase();
+}
+function newKeywordsInOrder(nodes) {
+  const seen = /* @__PURE__ */ new Set();
+  for (const n of nodes) {
+    const all = n.keywords.all;
+    n.keywords.new = [];
+    n.keywords.prerequisite = [];
+    for (const k of all) {
+      if (seen.has(keywordKey(k))) n.keywords.prerequisite.push(k);
+      else n.keywords.new.push(k);
+      seen.add(keywordKey(k));
+    }
+  }
+}
+function feedNodeFromStep(step, featureId) {
+  const id = str(step.id);
+  return {
+    id,
+    kind: "product_step",
+    name: str(step.name, id),
+    concept_codes: strs(step.concept_codes),
+    keywords: { all: strs(step.keywords), new: [], prerequisite: [] },
+    estimated_minutes: stepMinutes(step),
+    bloom_hint: "Apply",
+    depth_hint: null,
+    completion_level: "standard",
+    scaffolding: { scaffold_candidates: [], core_value_minutes: stepMinutes(step) },
+    references: arr(step.files).map((f) => ({ file: str(f), evidence: "step file" })).filter((f) => f.file),
+    feature_id: featureId,
+    concept_ref: null,
+    // P52/T2.1: carry the step's tangible outcome so the planner can cut
+    // sessions at user-visible checkpoints instead of raw minute counts.
+    user_visible_deliverable: str(step.outcome?.user_visible),
+    is_core: false,
+    external_prerequisites: [],
+    phase_id: "",
+    introduce_aspect: null
+  };
+}
+function deriveConceptDepthHint(concept) {
+  const explicit = str(concept.depth_hint);
+  if (explicit === "ulo" || explicit === "cio" || explicit === "sio") return explicit;
+  const sio = arr(concept.sio);
+  const prereqs = strs(concept.prerequisites);
+  const pts = arr(concept.problem_types);
+  const hasHighBloom = pts.some((p) => {
+    const b = str(p.bloom_level);
+    return b === "Apply" || b === "Analyze" || b === "Evaluate" || b === "Create";
+  });
+  if (sio.length >= 2 || hasHighBloom) return "sio";
+  if (str(concept.cio) || prereqs.length >= 1) return "cio";
+  return "ulo";
+}
+function deriveDepthInputs(minutes, depth) {
+  const ulo = Math.max(DEPTH_MINUTE_FRACTIONS.floor, Math.round(minutes * DEPTH_MINUTE_FRACTIONS.ulo));
+  const cio = Math.max(ulo + DEPTH_MINUTE_FRACTIONS.floor, Math.round(minutes * DEPTH_MINUTE_FRACTIONS.cio));
+  const sio = Math.max(cio + DEPTH_MINUTE_FRACTIONS.floor, minutes);
+  const variants = { ulo, cio, sio };
+  const candidates = [];
+  if (depth === "sio") {
+    candidates.push({ from_depth: "sio", to_depth: "cio", minutes_saved: sio - cio, reason: "SIO implementation practice deferred \u2014 CIO mechanism suffices for downstream consumers" });
+  }
+  if (depth === "cio" || depth === "sio") {
+    candidates.push({ from_depth: depth, to_depth: "ulo", minutes_saved: (depth === "sio" ? sio : cio) - ulo, reason: "Mechanism deferred \u2014 ULO awareness suffices (know-it-exists); never below the ULO floor" });
+  }
+  return { depth_variants: variants, depth_scaffold_candidates: candidates };
+}
+function feedNodeFromConcept(concept) {
+  const id = str(concept.id);
+  const pts = arr(concept.problem_types).map((p) => str(p.bloom_level, "Understand")).filter((b) => b in BLOOM_RANK).sort((a, b) => BLOOM_RANK[a] - BLOOM_RANK[b]);
+  const topBloom = pts[pts.length - 1] ?? "Understand";
+  const rawRefs = arr(concept.references);
+  const references = rawRefs.length > 0 ? rawRefs.map((r) => ({ file: str(r.file, "syllabus.md"), evidence: str(r.evidence, str(concept.name)) })).filter((r) => r.file) : [{ file: "syllabus.md", evidence: str(concept.category ? `Topic under category ${str(concept.category)}` : str(concept.name), id) }];
+  const problemScaffolds = arr(concept.problem_types).map((pt) => ({
+    item: str(pt.name, "Problem type"),
+    reason: str(pt.description, "Formative practice check"),
+    minutes_saved: num(pt.estimated_minutes, 10),
+    suggest: "provide_partial"
+  }));
+  return {
+    id,
+    kind: "concept",
+    name: str(concept.name, id),
+    concept_codes: [str(concept.code) || id].filter(Boolean),
+    keywords: { all: strs(concept.keywords), new: [], prerequisite: [] },
+    estimated_minutes: Math.max(0, Math.round(num(concept.estimated_minutes, 15))),
+    bloom_hint: topBloom,
+    depth_hint: deriveConceptDepthHint(concept),
+    completion_level: "standard",
+    scaffolding: {
+      scaffold_candidates: problemScaffolds,
+      core_value_minutes: Math.max(0, Math.round(num(concept.estimated_minutes, 15)))
+    },
+    references,
+    feature_id: null,
+    concept_ref: id,
+    user_visible_deliverable: "",
+    // concepts are taught, not shipped — checkpoints live on product steps
+    ...deriveDepthInputs(Math.max(0, Math.round(num(concept.estimated_minutes, 15))), deriveConceptDepthHint(concept)),
+    // Knowledge-Tree concepts are the spine of the course — the reconciler must
+    // escalate them, never downgrade them. The emitter hardcoded `false`, so the
+    // flag the schema documents never reached the planner for any concept.
+    is_core: concept.is_core === true || str(concept.standardization) === "standardized",
+    external_prerequisites: [],
+    depth_context: {
+      ulo: str(concept.ulo),
+      cio: str(concept.cio),
+      sio: strs(concept.sio)
+    },
+    phase_id: "",
+    introduce_aspect: null
+  };
+}
+function addFeatureGroup(f, fid, nodes, edges, groupings) {
+  const steps = arr(f.steps);
+  const stepIds = [];
+  let prev = "";
+  for (let i = 0; i < steps.length; i++) {
+    const stepNode = feedNodeFromStep(steps[i], fid);
+    if (!stepNode.id) {
+      steplessStepIds.push(fid + "#" + i);
+      continue;
+    }
+    stepIds.push(stepNode.id);
+    nodes.push(stepNode);
+    if (prev) edges.push({ from: prev, to: stepNode.id, kind: "task", reason: "feature build order" });
+    prev = stepNode.id;
+  }
+  for (const dep of strs(f.depends_on)) {
+    const depFirst = nodes.find((n) => n.feature_id === dep);
+    if (depFirst && stepIds[0]) edges.push({ from: depFirst.id, to: stepIds[0], kind: "task", reason: "feature depends_on " + dep });
+  }
+  if (stepIds.length > 0) groupings.push({ id: "G-" + fid, name: str(f.name, fid), node_ids: stepIds, rationale: str(f.description, "") });
+  return stepIds;
+}
+function emitFromHybrid(hybrid, opts) {
+  const nodes = [];
+  const edges = [];
+  const groupings = [];
+  const pg = hybrid.project_graph ?? {};
+  const kg = hybrid.knowledge_graph ?? {};
+  const rawPhases = arr(hybrid.phases).filter((p) => str(p.id));
+  const features = arr(pg.features);
+  const conceptRecs = arr(kg.concepts);
+  const conceptById = new Map(conceptRecs.map((c) => [str(c.id), c]));
+  const knownConceptIds = new Set(conceptById.keys());
+  if (rawPhases.length === 0) {
+    const externalByNode2 = /* @__PURE__ */ new Map();
+    for (const c of conceptRecs) {
+      const node = feedNodeFromConcept(c);
+      nodes.push(node);
+      const { internal, external } = splitPrerequisites(c, knownConceptIds);
+      if (external.length > 0) {
+        node.external_prerequisites = external;
+        externalByNode2.set(node.id, external);
+      }
+      for (const p of internal) edges.push({ from: p, to: node.id, kind: "knowledge", reason: "concept prerequisite" });
+    }
+    noteExternalPrerequisites(opts, externalByNode2);
+    features.forEach((f, fi) => addFeatureGroup(f, str(f.id, "F" + pad22(fi + 1)), nodes, edges, groupings));
+    linkHybridKnowledgeEdges(hybrid, nodes, edges);
+    newKeywordsInOrder(nodes);
+    return validateCurriculumFeed({
+      schema_version: 2,
+      source: buildSource(opts, "hybrid_graph"),
+      learning_nodes: nodes,
+      dependency_edges: edges,
+      suggested_groupings: groupings,
+      phases: []
+    });
+  }
+  const featureOrder = /* @__PURE__ */ new Map();
+  features.forEach((f, fi) => featureOrder.set(str(f.id, "F" + pad22(fi + 1)), fi));
+  const stepIdsByFeature = /* @__PURE__ */ new Map();
+  for (const f of features) {
+    const fid = str(f.id);
+    stepIdsByFeature.set(fid, arr(f.steps).map((s) => str(s.id)).filter(Boolean));
+  }
+  const emitCtx = [];
+  const emittedConcepts = /* @__PURE__ */ new Set();
+  const previewsEmitted = /* @__PURE__ */ new Set();
+  const previewNodeIdByConcept = /* @__PURE__ */ new Map();
+  const externalByNode = /* @__PURE__ */ new Map();
+  const linkList = arr(hybrid.links);
+  for (const rp of rawPhases) {
+    const pid = str(rp.id);
+    const order = num(rp.order, emitCtx.length + 1);
+    const conceptOrder = [];
+    const intros = arr(rp.introduces);
+    const news = intros.filter((i) => str(i.aspect, "new") === "new");
+    const advanced = intros.filter((i) => str(i.aspect) === "advanced");
+    const previews = intros.filter((i) => str(i.aspect) === "preview");
+    for (const intro of [...news, ...advanced, ...previews]) {
+      const cid = str(intro.concept_id);
+      const c = conceptById.get(cid);
+      if (!c) {
+        throw new Error("Phase " + pid + " introduces unknown concept " + cid + " - fail-closed");
+      }
+      if (str(intro.aspect, "new") === "advanced" && !emittedConcepts.has(cid)) {
+        throw new Error("Phase " + pid + " advanced-revisits concept " + cid + " that was never emitted - fail-closed");
+      }
+      if (str(intro.aspect, "new") === "preview") {
+        if (emittedConcepts.has(cid)) {
+          throw new Error("Phase " + pid + " previews concept " + cid + " that was already introduced - preview must precede the anchor teach - fail-closed");
+        }
+        if (previewsEmitted.has(cid)) {
+          throw new Error("Phase " + pid + " duplicate preview of concept " + cid + " - fail-closed");
+        }
+        const pidIdx = rawPhases.findIndex((rp2) => str(rp2.id) === pid);
+        const anchorIdx = rawPhases.findIndex((rp2) => arr(rp2.introduces).some((i2) => str(i2.concept_id) === cid && str(i2.aspect, "new") !== "preview"));
+        if (anchorIdx < 0) {
+          throw new Error("Phase " + pid + " previews concept " + cid + " that is never fully introduced in any phase - fail-closed");
+        }
+        if (pidIdx >= anchorIdx) {
+          throw new Error("Phase " + pid + " previews concept " + cid + " whose anchor introduction is not in a LATER phase - fail-closed");
+        }
+        previewsEmitted.add(cid);
+        const prevNode = feedNodeFromConcept(c);
+        prevNode.id = cid + "__PREV" + pad22(order);
+        prevNode.name = str(c.name, cid) + " (preview)";
+        prevNode.phase_id = pid;
+        prevNode.introduce_aspect = "preview";
+        prevNode.estimated_minutes = Math.max(DEPTH_MINUTE_FRACTIONS.floor, Math.round(prevNode.estimated_minutes * DEPTH_MINUTE_FRACTIONS.preview));
+        prevNode.depth_hint = "ulo";
+        prevNode.bloom_hint = "Understand";
+        prevNode.concept_codes = [str(c.code) || cid];
+        prevNode.keywords = { all: strs(c.keywords), new: [], prerequisite: [] };
+        prevNode.scaffolding = { scaffold_candidates: [], core_value_minutes: 0 };
+        prevNode.depth_variants = { ulo: prevNode.estimated_minutes, cio: prevNode.estimated_minutes, sio: prevNode.estimated_minutes };
+        prevNode.depth_scaffold_candidates = [];
+        nodes.push(prevNode);
+        conceptOrder.push(prevNode.id);
+        previewNodeIdByConcept.set(cid, prevNode.id);
+        continue;
+      }
+      if (!emittedConcepts.has(cid)) {
+        const node = feedNodeFromConcept(c);
+        node.phase_id = pid;
+        node.introduce_aspect = "new";
+        nodes.push(node);
+        for (const p of strs(c.prerequisites)) {
+          if (!conceptById.has(p)) {
+            if (!externalByNode.has(cid)) externalByNode.set(cid, []);
+            externalByNode.get(cid).push(p);
+            node.external_prerequisites.push(p);
+            continue;
+          }
+          const previewOfPrereq = previewNodeIdByConcept.get(p);
+          if (!emittedConcepts.has(p) && !previewOfPrereq) {
+            throw new Error("Concept " + cid + " (phase " + pid + ") has prerequisite " + p + " that is neither introduced nor previewed in an EARLIER phase - fail-closed");
+          }
+          edges.push({ from: emittedConcepts.has(p) ? p : previewOfPrereq, to: cid, kind: "knowledge", reason: "concept prerequisite" });
+        }
+        emittedConcepts.add(cid);
+        conceptOrder.push(cid);
+      } else if (str(intro.aspect, "new") === "new") {
+        throw new Error("Phase " + pid + " introduces " + cid + " as new but it was already introduced in an earlier phase - fail-closed");
+      } else {
+        const revisitId = cid + "__ADV" + pad22(order);
+        const node = feedNodeFromConcept(c);
+        node.id = revisitId;
+        node.name = str(c.name, cid) + " (advanced)";
+        node.phase_id = pid;
+        node.introduce_aspect = "advanced";
+        node.estimated_minutes = Math.max(
+          DEPTH_MINUTE_FRACTIONS.advancedFloor,
+          Math.round(node.estimated_minutes * DEPTH_MINUTE_FRACTIONS.advancedRevisit)
+        );
+        node.depth_scaffold_candidates = [{
+          from_depth: "sio",
+          to_depth: "cio",
+          minutes_saved: Math.round(node.estimated_minutes * DEPTH_MINUTE_FRACTIONS.advancedRecapSave),
+          reason: "advanced revisit may drop to CIO recap without breaking first-teach chain"
+        }];
+        node.concept_codes = [str(c.code) || cid];
+        edges.push({ from: cid, to: revisitId, kind: "knowledge", reason: "advanced revisit of " + cid + " at phase " + pid });
+        nodes.push(node);
+        conceptOrder.push(revisitId);
       }
-      finalDecisions.push({ ...d, id: c.id, proposed_code: code });
-      proposals.push({
-        code,
-        name: c.name,
-        description: d.proposed_definition || c.description.slice(0, 300),
-        keywords: c.keywords,
-        subject_codes: "PY",
-        category_codes: "",
-        topic_codes: "",
-        prerequisite_concept_codes: [],
-        status: "proposed",
-        source_concept_id: c.id,
-        possible_tree_matches: (d.possible_tree_matches || []).filter(Boolean)
-      });
-      warnings.push("Concept " + c.id + " proposed as NEW: " + code + (d.possible_tree_matches?.length ? " (near matches: " + d.possible_tree_matches.join(", ") + ")" : ""));
-    }
-  }
-  const outPath = proposalsPath || path.join(os.tmpdir(), "domain-kit-debug", "concept-proposals.json");
-  try {
-    fs.mkdirSync(outPath.slice(0, outPath.lastIndexOf("/")), { recursive: true });
-    fs.writeFileSync(outPath, JSON.stringify({ generated_at: (/* @__PURE__ */ new Date()).toISOString(), proposals }, null, 2));
-    log("STEP_2_5", "Proposals written: " + proposals.length + " -> " + outPath);
-  } catch (e) {
-    warnings.push("Could not write proposals artifact: " + (e instanceof Error ? e.message : String(e)));
-  }
-  return { decisions: finalDecisions, proposals, warnings, shortlistSize: shortlist.length, catalogSize: catalog.concepts.length };
-}
-
-// src/graph/knowledgeGraphPipeline.ts
-function topologicalSort(concepts) {
-  const inDegree = /* @__PURE__ */ new Map();
-  const adjacency = /* @__PURE__ */ new Map();
-  for (const concept of concepts) {
-    inDegree.set(concept.id, 0);
-    adjacency.set(concept.id, []);
-  }
-  for (const concept of concepts) {
-    for (const prereq of concept.prerequisites || []) {
-      adjacency.get(prereq)?.push(concept.id);
-      inDegree.set(concept.id, (inDegree.get(concept.id) || 0) + 1);
     }
+    const featureIds = strs(rp.feature_ids).filter((fid) => featureOrder.has(fid)).sort((a, b) => featureOrder.get(a) - featureOrder.get(b));
+    emitCtx.push({ id: pid, order, name: str(rp.name, pid), productCompletion: str(rp.product_completion), conceptOrder, featureIds });
   }
-  const queue = [];
-  for (const [id, degree] of inDegree) {
-    if (degree === 0) queue.push(id);
-  }
-  const sorted = [];
-  while (queue.length > 0) {
-    const current = queue.shift();
-    sorted.push(current);
-    for (const neighbor of adjacency.get(current) || []) {
-      const newDegree = (inDegree.get(neighbor) || 1) - 1;
-      inDegree.set(neighbor, newDegree);
-      if (newDegree === 0) queue.push(neighbor);
+  noteExternalPrerequisites(opts, externalByNode);
+  for (const l of linkList) {
+    const cid = str(l.concept_id);
+    if (cid && conceptById.has(cid) && !emittedConcepts.has(cid)) {
+      throw new Error("Concept " + cid + " is consumed by links but never introduced in any phase - fail-closed");
     }
   }
-  if (sorted.length !== concepts.length) {
-    console.warn(`[WARN] Topological sort incomplete: ${sorted.length}/${concepts.length} concepts sorted`);
-  }
-  return sorted;
-}
-async function generateKnowledgeGraph(options) {
-  const { subject, description, syllabusText, gradeBand, domain, techStack, llmConfig, onProgress } = options;
-  const warnings = [];
-  const log = (step, msg) => {
-    console.log(`[KG-${step}] ${msg}`);
-    onProgress?.(step, msg);
-  };
-  log("STEP_1", "Decomposing subject into concepts...");
-  let parsedSyllabus = options.parsedSyllabus;
-  if (!parsedSyllabus && syllabusText) {
-    parsedSyllabus = parseSyllabus(syllabusText);
-    log("STEP_1", `Parsed syllabus: ${parsedSyllabus.units.length} units, ${parsedSyllabus.allTopics.length} topics`);
+  const seenFeatures = new Set(emitCtx.flatMap((e) => e.featureIds));
+  const missingFeatures = features.map((f) => str(f.id)).filter((fid) => fid && !seenFeatures.has(fid));
+  if (missingFeatures.length > 0) {
+    throw new Error("Features not covered by any phase: " + missingFeatures.join(", ") + " - fail-closed");
   }
-  const client = createLlmClient(llmConfig);
-  const maxSyllabusChars = parseInt(process.env.KG_MAX_SYLLABUS_CHARS || "16000", 10);
-  let truncatedSyllabus = "";
-  if (syllabusText) {
-    if (syllabusText.length > maxSyllabusChars) {
-      truncatedSyllabus = syllabusText.slice(0, maxSyllabusChars);
-      warnings.push(`Syllabus truncated from ${syllabusText.length} to ${maxSyllabusChars} chars \u2014 may miss some concepts`);
-    } else {
-      truncatedSyllabus = syllabusText;
-    }
+  const orphans = Array.from(conceptById.keys()).filter((cid) => !emittedConcepts.has(cid));
+  if (orphans.length > 0) {
+    pushDiagnostic(
+      opts,
+      "orphan_concept",
+      "error",
+      "Knowledge graph has " + orphans.length + " concept(s) no phase introduces and no link consumes \u2014 they will not be taught: " + orphans.join(", "),
+      orphans
+    );
   }
-  const structuredTopicsGuide = parsedSyllabus && parsedSyllabus.allTopics.length > 0 ? `
-STRUCTURED SYLLABUS TOPICS (Every topic MUST map to at least one concept to ensure 100% syllabus coverage):
-` + parsedSyllabus.allTopics.map((t) => `- [${t.unitTitle}] ${t.id}: ${t.title} (Keywords: ${t.keywords.join(", ")})`).join("\n") + "\n" : "";
-  const systemPrompt = "You are an expert curriculum designer. Decompose the given subject into a structured knowledge graph with concepts, prerequisites, and problem types.\n\nCRITICAL RULES:\n1. Each concept MUST have the three depth layers, authored against this CONTRACT:\n   - ulo (WHAT + WHY): bound to the CONCEPT's intrinsic NATURE. It explains what the\n     concept is and why it exists \u2014 the problem it solves in principle. It must be\n     TECHNOLOGY-AGNOSTIC: never name a concrete library, API, function, file format,\n     tool or language feature. Typical assessment level: Remember / Understand.\n   - cio (HOW): the MECHANISM \u2014 how the concept works and solves that problem, step\n     by step. Still bound to the concept's nature: more concrete than the ULO, but\n     NOT tied to one specific technology (no concrete API names). CIO capability is\n     assessed INDIRECTLY, through completing contextual work, not in isolation.\n   - sio (IMPLEMENTATION): an array of 2-4 items. EVERY item MUST reference concrete\n     KEYWORDS/technologies (a real API, function, module, file, or named pattern) and\n     describe a completable, context-specific implementation task. Application,\n     Analysis and Creation skills are assessed INDIRECTLY through completing these\n     items. There is NO fixed Bloom ceiling for a layer \u2014 but concreteness MUST\n     strictly increase: SIO more technology-bound than CIO, CIO more concrete than ULO.\n   - prerequisites: concept IDs that must be learned first (MUST NOT create cycles)\n   - problem_types: 2-4 problem types with bloom_level and difficulty. Remember and\n     Understand problem types test the ULO/CIO directly; Apply-and-above types are\n     proxies for SIO completion in context.\n   - techniques: methods, formulas, tools\n2. Prerequisite chains MUST be acyclic (no concept can depend on itself or create a loop)\n3. Concepts should be ordered by prerequisite dependency (topological sort)\n4. Problem types should range from Remember to Apply (not all at same level)\n5. Group concepts into categories (chapters/sections)\n6. ALL text in ENGLISH (even if input is Vietnamese)\n7. NEVER invent concepts not present in the syllabus\n8. Return JSON matching the KnowledgeGraphSchema";
-  const userPrompt = `Subject: ${subject}
-${description ? `Description: ${description}` : ""}
-${structuredTopicsGuide}${truncatedSyllabus ? `Syllabus:
-${truncatedSyllabus}` : ""}
-${gradeBand ? `Grade band: ${gradeBand[0]}-${gradeBand[1]}` : ""}
-${domain ? `Domain: ${domain}` : ""}
-
-Return JSON:
-{
-  "subject": {
-    "id": "${subject.toLowerCase().replace(/\s+/g, "-").slice(0, 30)}",
-    "name": "${subject}",
-    "description": "...",
-    "domain": "${domain || "other"}",
-    "grade_band": ${gradeBand ? `[${gradeBand[0]}, ${gradeBand[1]}]` : "[6, 12]"}
-  },
-  "concepts": [
-    {
-      "id": "C1",
-      "name": "Concept name",
-      "description": "Brief description",
-      "category": "category_id",
-      "ulo": "WHAT + WHY in technology-agnostic language: what the concept is and the problem it exists to solve. No library/API/tool names.",
-      "cio": "HOW the mechanism works, still technology-agnostic but more concrete than the ULO.",
-      "sio": ["Concrete task naming a REAL API/function/module/file from the target technology, completable end to end", "Another technology-bound task using a different concrete keyword"],
-      "prerequisites": [],
-      "estimated_minutes": 30,
-      "problem_types": [
-        {
-          "id": "PT-C1-01",
-          "name": "Problem type name",
-          "description": "What this problem type tests",
-          "bloom_level": "Remember",
-          "difficulty": "easy",
-          "estimated_minutes": 10
-        }
-      ],
-      "techniques": ["technique 1", "technique 2"],
-      "common_mistakes": ["mistake 1"]
+  const phaseNodeIds = [];
+  for (const ctx of emitCtx) {
+    const ids = [...ctx.conceptOrder];
+    for (const fid of ctx.featureIds) {
+      const f = features.find((x) => str(x.id) === fid);
+      const stepIds = addFeatureGroup(f, fid, nodes, edges, groupings);
+      for (const sid of stepIds) {
+        const node = nodes.find((x) => x.id === sid);
+        node.phase_id = ctx.id;
+      }
+      ids.push(...stepIds);
     }
-  ],
-  "categories": [
-    {
-      "id": "cat1",
-      "name": "Category name",
-      "description": "Category description",
-      "concept_ids": ["C1", "C2"],
-      "order": 1
+    if (ids.length === 0) {
+      throw new Error("Phase " + ctx.id + " contains no teaching nodes (no concepts introduced and no feature steps) - drop it or give it work - fail-closed");
     }
-  ],
-  "learning_path": [
-    {"concept_id": "C1", "order": 1, "depends_on": []},
-    {"concept_id": "C2", "order": 2, "depends_on": ["C1"]}
-  ]
-}`;
-  const result = await llmChatJson(client, systemPrompt, userPrompt, {
-    temperature: 0.1,
-    maxTokens: parseInt(process.env.KG_MAX_TOKENS || "65536", 10)
-  });
-  log("STEP_2", "Validating and cleaning knowledge graph...");
-  const concepts = result.concepts || [];
-  const categories = result.categories || [];
-  {
-    const STOP = /* @__PURE__ */ new Set(["and", "the", "for", "with", "from", "that", "this", "into", "when", "while", "using", "their", "your", "each", "how", "why", "what", "between", "through", "about"]);
-    const tokensFrom = (text) => text.toLowerCase().replace(/[^a-z0-9\s-]/g, " ").split(/\s+/).filter((w) => w.length >= 4 && !STOP.has(w));
-    for (const c of concepts) {
-      const existing = (c.keywords || []).map((k) => String(k).trim()).filter(Boolean);
-      if (existing.length === 0) {
-        const derived = [.../* @__PURE__ */ new Set([...tokensFrom(c.name), ...tokensFrom(c.description || "")])].slice(0, 5);
-        if (derived.length === 0) {
-          throw new Error("Concept " + c.id + " (" + c.name + ") has no keywords and none could be derived from name/description \u2014 fail-closed");
-        }
-        c.keywords = derived;
-        warnings.push("Concept " + c.id + ": empty keyword set - derived " + derived.join(", ") + " from name/description");
-      } else {
-        c.keywords = existing;
-      }
+    phaseNodeIds.push(ids);
+  }
+  const idlessInHybrid = takeSteplessStepIds();
+  if (idlessInHybrid.length > 0) {
+    pushDiagnostic(
+      opts,
+      "step_without_id",
+      "warning",
+      "Step(s) carrying no id cannot become planning nodes and were dropped (feature#index): " + idlessInHybrid.join(", "),
+      idlessInHybrid
+    );
+  }
+  const placed = new Set(phaseNodeIds.flat());
+  const orderedNodes = [];
+  for (const ids of phaseNodeIds) {
+    for (const id of ids) {
+      const n = nodes.find((x) => x.id === id);
+      if (n) orderedNodes.push(n);
     }
   }
-  const rawPath = result.learning_path;
-  let learningPath = (rawPath || []).map((s) => ({
-    concept_id: String(s.concept_id || ""),
-    order: Number(s.order || 0),
-    depends_on: Array.isArray(s.depends_on) ? s.depends_on.map(String) : [],
-    milestone_name: String(s.milestone_name || "")
-  }));
-  const conceptIds = new Set(concepts.map((c) => c.id));
-  for (const concept of concepts) {
-    for (const prereq of concept.prerequisites || []) {
-      if (!conceptIds.has(prereq)) {
-        warnings.push(`Concept ${concept.id} references non-existent prerequisite ${prereq} \u2014 removed`);
-        concept.prerequisites = (concept.prerequisites || []).filter((p) => p !== prereq);
+  for (const n of nodes) if (!placed.has(n.id)) orderedNodes.push(n);
+  nodes.length = 0;
+  nodes.push(...orderedNodes);
+  const edgeSeen = new Set(edges.map((e) => e.from + ">" + e.to));
+  const pushEdge = (from, to, reason) => {
+    const key = from + ">" + to;
+    if (edgeSeen.has(key)) return;
+    edgeSeen.add(key);
+    edges.push({ from, to, kind: "knowledge", reason });
+  };
+  for (const l of linkList) {
+    const cid = str(l.concept_id);
+    const fid = str(l.feature_id);
+    if (!conceptById.has(cid)) continue;
+    const firstStep = (stepIdsByFeature.get(fid) || [])[0];
+    if (!firstStep) continue;
+    const depth = str(l.depth, "cio");
+    const anchorNode = nodes.find((n2) => n2.kind === "concept" && n2.concept_ref === cid && n2.introduce_aspect === "new");
+    const stepNode = nodes.find((n2) => n2.id === firstStep);
+    const anchorPhaseIdx = anchorNode ? emitCtx.findIndex((c2) => c2.id === anchorNode.phase_id) : -1;
+    const stepPhaseIdx = stepNode ? emitCtx.findIndex((c2) => c2.id === stepNode.phase_id) : -1;
+    if (emitCtx.length > 0 && anchorPhaseIdx > stepPhaseIdx) {
+      pushDiagnostic(
+        opts,
+        "hybrid_link_drift",
+        "warning",
+        "hybrid link drift: concept " + cid + " is fully taught in a later phase than consumer " + firstStep + " (a preview covers the dependency)",
+        [cid, firstStep]
+      );
+      continue;
+    }
+    pushEdge(cid, firstStep, str(l.relationship, "hybrid link") + " [" + depth + "]");
+    for (const n of nodes) {
+      if (n.kind === "concept" && n.concept_ref === cid && n.introduce_aspect === "advanced" && n.phase_id === str(l.phase_id)) {
+        pushEdge(n.id, firstStep, "advanced application [" + depth + "]");
       }
     }
   }
-  if (options.knowledgeTreePath) {
-    const catalog = loadKnowledgeTreeCatalog(options.knowledgeTreePath);
-    log("STEP_2_5", "Knowledge tree loaded: " + catalog.concepts.length + " concepts from " + catalog.path.split("/").pop());
-    const std = await standardizeConcepts({
-      client,
-      concepts: concepts.map((c) => ({
-        id: c.id,
-        name: c.name,
-        description: c.description || "",
-        keywords: c.keywords || []
-      })),
-      catalog,
-      techStack,
-      proposalsPath: options.proposalsPath,
-      onProgress: log
-    });
-    warnings.push(...std.warnings);
-    const codeByStd = new Map(std.decisions.map((d) => [d.id, d]));
-    for (const c of concepts) {
-      const d = codeByStd.get(c.id);
-      if (!d) throw new Error("Concept " + c.id + " missing standardization decision \u2014 fail-closed");
-      if (d.decision === "standardized") {
-        c.standardization = "standardized";
-        c.tree_code = d.tree_code;
-        c.code = d.tree_code;
-        const tc = catalog.concepts.find((x) => x.code === d.tree_code);
-        if (tc) {
-          for (const k of d.adopted_keywords || []) {
-            if (!(c.keywords || []).some((x) => x.toLowerCase() === k.toLowerCase())) {
-              c.keywords = [...c.keywords || [], k];
-            }
-          }
-          c.tree_prerequisites = tc.prerequisiteCodes;
-        }
-      } else {
-        c.standardization = "proposed_new";
-        c.code = d.proposed_code;
+  newKeywordsInOrder(nodes);
+  const feedOrder = new Map(nodes.map((n, i) => [n.id, i]));
+  const introducer = /* @__PURE__ */ new Map();
+  for (const n of nodes) for (const k of n.keywords?.new ?? []) {
+    const key = keywordKey(k);
+    if (!introducer.has(key)) introducer.set(key, n.id);
+  }
+  for (const n of nodes) {
+    for (const k of n.keywords?.prerequisite ?? []) {
+      const src = introducer.get(keywordKey(k));
+      if (!src || src === n.id) continue;
+      const srcNode = nodes.find((x) => x.id === src);
+      const phaseOf = (id) => {
+        const n2 = nodes.find((x) => x.id === id);
+        return n2 ? emitCtx.findIndex((c) => c.id === n2.phase_id) : -1;
+      };
+      const conceptOvertaken = n.kind === "concept" && srcNode?.kind === "product_step";
+      const fromPhase = phaseOf(src);
+      const toPhase = phaseOf(n.id);
+      if (conceptOvertaken || emitCtx.length > 0 && fromPhase > toPhase) {
+        pushDiagnostic(
+          opts,
+          conceptOvertaken ? "concept_overtaken_by_step" : "keyword_order_drift",
+          "warning",
+          "keyword-order drift: introducer " + src + " sits in a later phase than consumer " + n.id + ' (keyword "' + k + '") \u2014 host should move the introducer earlier',
+          [src, n.id]
+        );
+        continue;
       }
+      if (feedOrder.get(src) < feedOrder.get(n.id)) pushEdge(src, n.id, "keyword prerequisite [" + k + "]");
     }
-    const idByTreeCode = new Map(concepts.filter((c) => c.tree_code).map((c) => [c.tree_code, c.id]));
-    for (const c of concepts) {
-      for (const tp of c.tree_prerequisites || []) {
-        const target = idByTreeCode.get(tp);
-        if (target && target !== c.id && !(c.prerequisites || []).includes(target)) {
-          c.prerequisites = [...c.prerequisites || [], target];
-          warnings.push("Prereq seeded from tree: " + c.id + " <- " + tp + " (" + target + ")");
-        }
+  }
+  const phases = emitCtx.map((ctx, i) => ({
+    id: ctx.id,
+    order: ctx.order,
+    name: ctx.name,
+    product_completion: ctx.productCompletion || "Phase " + (i + 1) + " deliverable",
+    node_ids: phaseNodeIds[i]
+  }));
+  return validateCurriculumFeed({
+    schema_version: 2,
+    source: buildSource(opts, "hybrid_graph"),
+    learning_nodes: nodes,
+    dependency_edges: edges,
+    suggested_groupings: groupings,
+    phases
+  });
+}
+function linkHybridKnowledgeEdges(hybrid, nodes, edges, setStepHints) {
+  const conceptIds = new Set(nodes.filter((n) => n.kind === "concept").map((n) => n.concept_ref || n.id));
+  for (const l of arr(hybrid.links)) {
+    const conceptId = str(l.concept_id);
+    const featureId = str(l.feature_id);
+    if (!conceptIds.has(conceptId)) continue;
+    const depth = str(l.depth, "cio");
+    const firstStep = nodes.find((n) => n.feature_id === featureId);
+    if (firstStep) {
+      edges.push({ from: conceptId, to: firstStep.id, kind: "knowledge", reason: str(l.relationship, "hybrid link") + " [" + depth + "]" });
+      if (!firstStep.depth_hint) {
+        firstStep.depth_hint = ["ulo", "cio", "sio"].includes(depth) ? depth : "cio";
       }
     }
-    log("STEP_2_5", "Standardized: " + std.decisions.filter((d) => d.decision === "standardized").length + ", proposed new: " + std.decisions.filter((d) => d.decision === "proposed_new").length);
   }
-  log("STEP_3", "Checking for prerequisite cycles...");
-  const cycles = detectPrerequisiteCycles(concepts);
-  if (cycles.length > 0) {
-    log("STEP_3", `Found ${cycles.length} cycle(s) in prerequisite chain \u2014 breaking cycles`);
-    for (const cycle of cycles) {
-      warnings.push(`Cycle detected: ${cycle.join(" \u2192 ")} \u2014 breaking at weakest edge`);
+}
+function emitFromKnowledge(kg, opts) {
+  const nodes = [];
+  const edges = [];
+  const groupings = [];
+  const conceptIds = new Set(arr(kg.concepts).map((c) => str(c.id)));
+  const externalByNode = /* @__PURE__ */ new Map();
+  for (const c of arr(kg.concepts)) {
+    const node = feedNodeFromConcept(c);
+    nodes.push(node);
+    const { internal, external } = splitPrerequisites(c, conceptIds);
+    if (external.length > 0) {
+      node.external_prerequisites = external;
+      externalByNode.set(node.id, external);
     }
-    const { fixed, removed } = breakPrerequisiteCycles(concepts, cycles);
-    for (let i = 0; i < concepts.length; i++) {
-      const fixedConcept = fixed.find((f) => f.id === concepts[i].id);
-      if (fixedConcept) {
-        concepts[i] = { ...concepts[i], prerequisites: fixedConcept.prerequisites };
+    for (const p of internal) {
+      if (p !== node.id) {
+        edges.push({
+          from: p,
+          to: node.id,
+          kind: "knowledge",
+          reason: `concept prerequisite: ${p} must be understood before ${node.id}`
+        });
       }
     }
-    for (const { from, to } of removed) {
-      warnings.push(`Removed prerequisite edge: ${from} \u2192 ${to} (cycle breaker)`);
+  }
+  noteExternalPrerequisites(opts, externalByNode);
+  if (arr(kg.learning_path).length > 0) {
+    const orderMap = /* @__PURE__ */ new Map();
+    arr(kg.learning_path).forEach((s, idx) => {
+      const cid = str(s.concept_id);
+      if (cid) orderMap.set(cid, num(s.order, idx + 1));
+    });
+    nodes.sort((a, b) => (orderMap.get(a.id) ?? 999) - (orderMap.get(b.id) ?? 999));
+  }
+  let ci = 0;
+  for (const cat of arr(kg.categories)) {
+    ci += 1;
+    const ids = strs(cat.concept_ids).filter((id) => nodes.some((n) => n.id === id));
+    if (ids.length > 0) {
+      groupings.push({
+        id: str(cat.id, "cat" + ci),
+        name: str(cat.name, "Category " + ci),
+        node_ids: ids,
+        rationale: str(cat.description, "")
+      });
     }
   }
-  log("STEP_4", "Topological sort of concepts...");
-  const sortedIds = topologicalSort(concepts);
-  learningPath = sortedIds.map((id, idx) => {
-    const concept = concepts.find((c) => c.id === id);
-    return {
-      concept_id: id,
-      order: idx + 1,
-      depends_on: concept?.prerequisites || [],
-      milestone_name: ""
-    };
+  newKeywordsInOrder(nodes);
+  return validateCurriculumFeed({
+    schema_version: 2,
+    source: buildSource(opts, "knowledge_graph"),
+    learning_nodes: nodes,
+    dependency_edges: edges,
+    suggested_groupings: groupings,
+    phases: []
   });
-  log("STEP_5", "Authoring ULO/CIO/SIO depth layers hierarchically...");
-  {
-    const lo = await authorDepthLayersHierarchically(
-      client,
-      concepts.map((c) => ({ id: c.id, name: c.name, description: c.description, keywords: c.keywords })),
-      techStack || (domain === "software" || domain === "technology" ? "python" : domain || "general"),
-      warnings
+}
+function emitFromProject(pg, opts) {
+  const nodes = [];
+  const edges = [];
+  const groupings = [];
+  const allFeatures = arr(pg.features);
+  allFeatures.forEach((f, fi) => addFeatureGroup(f, str(f.id, "F" + pad22(fi + 1)), nodes, edges, groupings));
+  const stepless = allFeatures.filter((f) => arr(f.steps).length === 0).map((f) => str(f.id)).filter(Boolean);
+  if (stepless.length > 0) {
+    pushDiagnostic(
+      opts,
+      "feature_without_steps",
+      "warning",
+      "Feature(s) declared but carrying no steps \u2014 they will be absent from the feed: " + stepless.join(", "),
+      stepless
     );
-    const codeByConceptId = assignConceptCodes(concepts.map((c) => ({ id: c.id, name: c.name })));
-    const techTag = techTagFor(techStack || (domain === "software" || domain === "technology" ? "python" : domain || "general"));
-    for (const concept of concepts) {
-      concept.ulo = lo.uloByConcept[concept.id] || concept.ulo || "";
-      concept.cio = lo.cioByConcept[concept.id] || concept.cio || "";
-      if (lo.sioByConcept[concept.id] && lo.sioByConcept[concept.id].length > 0) {
-        concept.sio = lo.sioByConcept[concept.id];
-      }
-      concept.code = concept.code || codeByConceptId[concept.id];
-      concept.ulo_code = concept.ulo ? uloCode(concept.code) : concept.ulo_code;
-      concept.cio_code = concept.cio ? cioCode(concept.code, 1, cioActionSlug(concept.cio)) : concept.cio_code;
-      concept.sio_codes = concept.sio.length > 0 ? concept.sio.map((_, i) => sioCode(techTag, concept.code, i + 1)) : concept.sio_codes;
-    }
-    log("STEP_5", "Depth layers authored: " + concepts.length + " concepts, audit " + lo.audits.filter((a) => a.passed).length + "/" + concepts.length + " passed");
   }
-  for (const step of learningPath) {
-    if (!conceptIds.has(step.concept_id)) {
-      warnings.push(`Learning path references non-existent concept ${step.concept_id}`);
-    }
+  const idless = takeSteplessStepIds();
+  if (idless.length > 0) {
+    pushDiagnostic(
+      opts,
+      "step_without_id",
+      "warning",
+      "Step(s) carrying no id cannot become planning nodes and were dropped (feature#index): " + idless.join(", "),
+      idless
+    );
   }
-  log("STEP_2", `Validated ${concepts.length} concepts, ${categories.length} categories, ${learningPath.length} learning path steps`);
-  const rawGraph = {
-    schema_version: 1,
-    type: "knowledge_graph",
-    subject: result.subject,
-    concepts,
-    categories,
-    learning_path: learningPath
-  };
-  log("STEP_6", "Running Knowledge Graph verification & reverse coverage audit...");
-  const { verifiedGraph, report } = verifyKnowledgeGraph(rawGraph, parsedSyllabus);
-  warnings.push(...report.warnings);
-  return {
-    knowledgeGraph: verifiedGraph,
-    warnings,
-    verificationReport: report
-  };
+  if (nodes.length === 0 && allFeatures.length > 0) {
+    const hasTasks = arr(pg.implementation ?? {}).length > 0 || arr(pg.implementation?.tasks).length > 0;
+    throw new Error(
+      "Project graph has " + allFeatures.length + " features but NO features[].steps - the curriculum feed cannot emit planning nodes." + (hasTasks ? " This looks like a legacy knowledge-tree graph (implementation.tasks). Regenerate it with the domain-kit v3 pipeline (runProjectGraphPipeline / hybridGraphPipeline), then re-run." : " Every feature must carry at least one step with id/name/keywords/effort for curriculum planning.")
+    );
+  }
+  newKeywordsInOrder(nodes);
+  return validateCurriculumFeed({
+    schema_version: 2,
+    source: buildSource(opts, "project_graph"),
+    learning_nodes: nodes,
+    dependency_edges: edges,
+    suggested_groupings: groupings,
+    phases: []
+  });
+}
+function emitCurriculumFeed(graph, opts = {}) {
+  const g = graph;
+  if (arr(g.learning_nodes).length > 0) {
+    return validateCurriculumFeed(g);
+  }
+  if (g.project_graph || g.knowledge_graph || arr(g.links).length > 0 || arr(g.phases).length > 0) {
+    return emitFromHybrid(g, opts);
+  }
+  if (arr(g.concepts).length > 0 || str(g.type) === "knowledge_graph") return emitFromKnowledge(g, opts);
+  return emitFromProject(g, opts);
 }
 
 // src/pipeline/knowledgeGraphPipeline.ts
-init_curriculumFeedEmitter();
 async function runKnowledgeGraphPipeline(options) {
   const warnings = [];
   let parsedSyllabus = options.parsedSyllabus;
@@ -4139,7 +4453,8 @@ async function runKnowledgeGraphPipeline(options) {
   });
   warnings.push(...result.warnings);
   const curriculumFeed = emitCurriculumFeed(result.knowledgeGraph, {
-    warnings
+    warnings,
+    provenance: summarizeProvenance(result.provenance)
   });
   return {
     knowledgeGraph: result.knowledgeGraph,
@@ -4173,9 +4488,10 @@ async function generateHybridGraph(options) {
         description: "",
         total_project_minutes: 0,
         total_concept_minutes: 0,
-        estimated_total_minutes: 0
+        linked_prereq_minutes: 0
       },
-      warnings
+      warnings,
+      provenance: []
     };
   }
   const client = createLlmClient(llmConfig);
@@ -4256,9 +4572,14 @@ async function generateHybridGraph(options) {
       description: "Progressive completion path: " + phases.length + " phases, " + features.length + " features, " + concepts.length + " concepts",
       total_project_minutes: totalProjectMinutes,
       total_concept_minutes: totalConceptMinutes,
-      estimated_total_minutes: totalProjectMinutes + totalPrereqMinutes
+      // HG-1 (2026-10-05): renamed from estimated_total_minutes. It counts only
+      // concepts that HAVE a feature link (max per concept, not summed), so it
+      // is NOT the course total — see HybridGraphSchema.linked_prereq_minutes.
+      // The phase planner below commits to totalProjectMinutes + totalConceptMinutes.
+      linked_prereq_minutes: totalProjectMinutes + totalPrereqMinutes
     },
-    warnings
+    warnings,
+    provenance: client.callLog
   };
 }
 function auditPhasePlan(plan, features, concepts, links, warnings, log) {
@@ -4334,12 +4655,20 @@ function auditPhasePlan(plan, features, concepts, links, warnings, log) {
       } else {
         newIntroPhase.set(cid, order);
       }
+      introductions.push({ concept_id: cid, aspect, note: String(ri.note || "") });
+    }
+    for (const intro of introductions) {
+      const cid = intro.concept_id;
+      if (intro.aspect === "advanced") continue;
+      const introOrder = newIntroPhase.get(cid);
+      if (introOrder === void 0 || introOrder !== order) continue;
       for (const pre of prereqOf.get(cid) || []) {
-        if (!newIntroPhase.has(pre)) {
-          errors.push("Phase " + id + ": concept " + cid + " introduced before its prerequisite " + pre + " is introduced - violates the prerequisite chain");
+        const previewOrder = previewPhase.get(pre);
+        const covered = newIntroPhase.has(pre) || previewOrder !== void 0 && previewOrder < order;
+        if (!covered) {
+          errors.push("Phase " + id + ": concept " + cid + " introduced before its prerequisite " + pre + " is introduced (or previewed in an earlier phase) - violates the prerequisite chain");
         }
       }
-      introductions.push({ concept_id: cid, aspect, note: String(ri.note || "") });
     }
     phases.push({
       id,
@@ -4377,6 +4706,9 @@ function auditPhasePlan(plan, features, concepts, links, warnings, log) {
     if (anchor !== void 0 && anchor <= pOrder) {
       errors.push("Concept " + cid + " previewed in phase " + pOrder + " but fully introduced in phase " + anchor + " - preview must precede the anchor introduction");
     }
+    if (anchor === void 0) {
+      errors.push("Concept " + cid + " is previewed in phase " + pOrder + " but never fully introduced (aspect new) in any phase - a preview must have an anchor teach");
+    }
   }
   return { phases, errors };
 }
@@ -4391,8 +4723,12 @@ async function decomposePhases(args) {
   const linkList = links.map(
     (l) => "- " + l.feature_id + " -> " + l.concept_id + " (" + l.depth + ")"
   ).join("\n") || "(none)";
-  const systemPrompt = 'You decompose a software project build into PROGRESSIVE COMPLETION PHASES for learning purposes.\n\nA phase is NOT a feature and NOT a milestone list: it is a cross-feature slice of the\nproduct whose completion yields a DEMONSTRABLY more complete product. Build up gradually:\nthe product grows feature by feature across phases, and each phase adds its features to\nwhat previous phases already built.\n\nRULES:\n1. Every feature must be assigned to EXACTLY ONE phase (no feature reused, none skipped).\n2. Phases are ordered; later phases depend on earlier ones and yield a more complete product.\n3. product_completion describes concretely what the product can DO once the phase is done.\n4. introduces lists which concepts the phase must teach BEFORE its feature work starts:\n   - aspect new: first time the concept appears in the course\n   - aspect advanced: a concept introduced in an EARLIER phase, revisited here at a\n     higher depth (an advanced aspect of the same concept, e.g. validation rules on top\n     of basic data modeling). Use the note field to say which aspect.\n   - aspect preview: a light awareness pass ("know it exists", ULO depth only, ~5 min)\n     placed in an EARLIER phase when its feature work needs the vocabulary before the\n     full teach. The anchor phase still owns the full new introduction.\n5. A concept MUST be introduced (new) no later than the first phase that consumes it.\n6. A concept must not be introduced before its own prerequisites are introduced.\n7. Typically 3-6 phases for a small project; keep phases balanced.\n8. Phase 1 usually covers project setup/foundation features plus the first minimal slice.\n9. Return JSON only.';
-  const baseUserPrompt = "FEATURES:\n" + featureList + "\n\nCONCEPTS:\n" + conceptList + "\n\nFEATURE-CONCEPT LINKS:\n" + linkList + "\n\nReturn JSON with a phases array. Each phase: { id: PH1, name, product_completion, feature_ids: [F0, F1], introduces: [{ concept_id: C1, aspect: new or advanced, note }] }.\n";
+  const systemPrompt = 'You decompose a software project build into PROGRESSIVE COMPLETION PHASES for learning purposes.\n\nA phase is NOT a feature and NOT a milestone list: it is a cross-feature slice of the\nproduct whose completion yields a DEMONSTRABLY more complete product. Build up gradually:\nthe product grows feature by feature across phases, and each phase adds its features to\nwhat previous phases already built.\n\nRULES:\n1. Every feature must be assigned to EXACTLY ONE phase (no feature reused, none skipped).\n2. Phases are ordered; later phases depend on earlier ones and yield a more complete product.\n3. product_completion describes concretely what the product can DO once the phase is done.\n4. introduces lists which concepts the phase must teach BEFORE its feature work starts:\n   - aspect new: first time the concept appears in the course\n   - aspect advanced: a concept introduced in an EARLIER phase, revisited here at a\n     higher depth (an advanced aspect of the same concept, e.g. validation rules on top\n     of basic data modeling). Use the note field to say which aspect.\n   - aspect preview: a light awareness pass ("know it exists", ULO depth only, ~5 min)\n     placed in an EARLIER phase when its feature work needs the vocabulary before the\n     full teach. The anchor phase still owns the full new introduction.\n5. A concept MUST be introduced (new) no later than the first phase that consumes it.\n6. A concept must not be introduced before its own prerequisites are introduced.\n7. Typically 3-6 phases for a small project; keep phases balanced.\n8. MINUTE BALANCE: Each phase should contain approximately 120-240 total minutes of\n   concept + feature work (about 3-5 sessions of 90 minutes each). If a phase\n   would contain < 60 minutes (too thin) or > 400 minutes (too heavy), rebalance.\n9. Phase 1 usually covers project setup/foundation features plus the first minimal slice.\n10. Return JSON only.';
+  const totalFeatureMinutes = features.reduce((s, f) => s + (f.steps || []).reduce((ss, st) => ss + (st.effort?.estimated_minutes || 15), 0), 0);
+  const totalConceptMinutes = concepts.reduce((s, c) => s + (c.estimated_minutes || 30), 0);
+  const totalMinutes = totalFeatureMinutes + totalConceptMinutes;
+  const targetPhaseCount = Math.max(3, Math.round(totalMinutes / 180));
+  const baseUserPrompt = "FEATURES:\n" + featureList + "\n\nCONCEPTS:\n" + conceptList + "\n\nFEATURE-CONCEPT LINKS:\n" + linkList + "\n\nTOTAL MINUTES: ~" + totalMinutes + "m (" + totalFeatureMinutes + "m features + " + totalConceptMinutes + "m concepts)\nTARGET: ~" + targetPhaseCount + " phases of ~180m each\n\nReturn JSON with a phases array. Each phase: { id: PH1, name, product_completion, feature_ids: [F0, F1], introduces: [{ concept_id: C1, aspect: new or advanced, note }] }.\n";
   const MAX_DECOMPOSE_ATTEMPTS = 3;
   let auditErrors = [];
   let phases = [];
@@ -4430,13 +4766,13 @@ async function decomposePhases(args) {
 }
 
 // src/pipeline/hybridGraphPipeline.ts
-init_curriculumFeedEmitter();
 async function runHybridGraphPipeline(options) {
   const warnings = [];
   const result = await generateHybridGraph(options);
   warnings.push(...result.warnings);
   const curriculumFeed = emitCurriculumFeed(result.hybridGraph, {
-    warnings
+    warnings,
+    provenance: summarizeProvenance(result.provenance)
   });
   return {
     hybridGraph: result.hybridGraph,
@@ -5019,6 +5355,9 @@ function detectSyllabusLanguage(text) {
   }
   return "en";
 }
+function normalizeText(s) {
+  return s.normalize("NFC").toLowerCase();
+}
 function detectDomain(options) {
   const evidence = [];
   const detectedTechStack = [];
@@ -5075,15 +5414,19 @@ function detectDomain(options) {
       }
     }
   }
-  const textContent = [
+  const textContent = normalizeText([
     options.description || "",
     options.goal || "",
     options.syllabusText || ""
-  ].join(" ").toLowerCase();
+  ].join(" "));
+  const textNoMarks = stripDiacritics(textContent);
   for (const [domain, keywords] of Object.entries(DOMAIN_KEYWORDS)) {
     const cat = domain;
     for (const kw of keywords) {
-      if (textContent.includes(kw.toLowerCase())) {
+      const kwNorm = normalizeText(kw);
+      const kwPlain = stripDiacritics(kw);
+      const matched = textContent.includes(kwNorm) || kwPlain !== kwNorm && textNoMarks.includes(kwPlain);
+      if (matched) {
         scores[cat] += 0.1;
         if (!evidence.some((e) => e.includes(`"${kw}"`))) {
           evidence.push(`Keyword "${kw}" \u2192 ${cat}`);
@@ -5122,11 +5465,12 @@ function detectDomain(options) {
   }
   if (options.syllabusText) {
     const syllabusLang = detectSyllabusLanguage(options.syllabusText);
-    const syllabusLower = options.syllabusText.toLowerCase();
-    if (syllabusLower.includes("h\xECnh h\u1ECDc") || syllabusLower.includes("\u0111\u1EA1i s\u1ED1") || syllabusLower.includes("geometry") || syllabusLower.includes("algebra") || syllabusLower.includes("\u51E0\u4F55") || syllabusLower.includes("\u4EE3\u6570") || syllabusLower.includes("\u5E7E\u4F55") || syllabusLower.includes("\u4EE3\u6570") || syllabusLower.includes("g\xE9om\xE9trie") || syllabusLower.includes("alg\xE8bre")) {
+    const syllabusLower = normalizeText(options.syllabusText);
+    const syllabusPlain = stripDiacritics(options.syllabusText);
+    if (syllabusLower.includes("h\xECnh h\u1ECDc") || syllabusLower.includes("\u0111\u1EA1i s\u1ED1") || syllabusPlain.includes("hinh hoc") || syllabusPlain.includes("dai so") || syllabusLower.includes("geometry") || syllabusLower.includes("algebra") || syllabusLower.includes("\u51E0\u4F55") || syllabusLower.includes("\u4EE3\u6570") || syllabusLower.includes("\u5E7E\u4F55") || syllabusLower.includes("\u4EE3\u6570") || syllabusLower.includes("g\xE9om\xE9trie") || syllabusLower.includes("alg\xE8bre")) {
       scores.math += 0.5;
       detectedSubject = "Mathematics";
-    } else if (syllabusLower.includes("v\u1EADt l\xFD") || syllabusLower.includes("h\xF3a") || syllabusLower.includes("sinh") || syllabusLower.includes("physics") || syllabusLower.includes("chemistry") || syllabusLower.includes("biology") || syllabusLower.includes("\u7269\u7406") || syllabusLower.includes("\u5316\u5B66") || syllabusLower.includes("\u7269\u7406") || syllabusLower.includes("\u5316\u5B66") || syllabusLower.includes("physique") || syllabusLower.includes("chimie")) {
+    } else if (syllabusLower.includes("v\u1EADt l\xFD") || syllabusLower.includes("h\xF3a") || syllabusPlain.includes("vat ly") || syllabusPlain.includes("hoa") || syllabusLower.includes("sinh") || syllabusLower.includes("physics") || syllabusLower.includes("chemistry") || syllabusLower.includes("biology") || syllabusLower.includes("\u7269\u7406") || syllabusLower.includes("\u5316\u5B66") || syllabusLower.includes("\u7269\u7406") || syllabusLower.includes("\u5316\u5B66") || syllabusLower.includes("physique") || syllabusLower.includes("chimie")) {
       scores.science += 0.5;
       detectedSubject = "Natural Science";
     } else if (syllabusLower.includes("ti\u1EBFng anh") || syllabusLower.includes("english") || syllabusLower.includes("grammar") || syllabusLower.includes("\u82F1\u8BED") || syllabusLower.includes("\u82F1\u8A9E") || syllabusLower.includes("anglais")) {
@@ -5367,6 +5711,9 @@ async function runDomainPipeline(options) {
   }
   if (effectiveMode === "hybrid") {
     log("LAYER_3", "Executing Hybrid Graph Pipeline...");
+    if (!options.repoDir && options.forcedLearningMode === "hybrid") {
+      throw new Error('forcedLearningMode "hybrid" requires repoDir \u2014 refusing to silently degrade to a concept-only feed (fail-closed)');
+    }
     if (options.repoDir) {
       const projectResult2 = await runProjectGraphPipeline({
         repoDir: options.repoDir,
@@ -5384,7 +5731,9 @@ async function runDomainPipeline(options) {
         domain: domainProfile.domainCategory,
         techStack: options.techStack,
         llmConfig: options.llmConfig,
-        onProgress: options.onProgress
+        onProgress: options.onProgress,
+        knowledgeTreePath: options.knowledgeTreePath,
+        proposalsPath: options.proposalsPath
       });
       const hybridResult = await runHybridGraphPipeline({
         projectGraph: projectResult2.projectGraph,
@@ -5403,7 +5752,8 @@ async function runDomainPipeline(options) {
         warnings
       };
     } else {
-      warnings.push("Hybrid learning mode requested but repoDir was not provided \u2014 falling back to concept-driven knowledge graph pipeline");
+      const downgradeReason = "Hybrid learning mode requested but repoDir was not provided \u2014 falling back to concept-driven knowledge graph pipeline";
+      warnings.push(downgradeReason);
       const knowledgeResult = await runKnowledgeGraphPipeline({
         subject: options.subject || domainProfile.detectedSubject || options.goal || "Subject Theory",
         description: options.description,
@@ -5412,7 +5762,9 @@ async function runDomainPipeline(options) {
         domain: domainProfile.domainCategory,
         techStack: options.techStack,
         llmConfig: options.llmConfig,
-        onProgress: options.onProgress
+        onProgress: options.onProgress,
+        knowledgeTreePath: options.knowledgeTreePath,
+        proposalsPath: options.proposalsPath
       });
       warnings.push(...knowledgeResult.warnings);
       return {
@@ -5420,7 +5772,8 @@ async function runDomainPipeline(options) {
         graphType: "knowledge_graph",
         curriculumFeed: knowledgeResult.curriculumFeed,
         knowledgeResult,
-        warnings
+        warnings,
+        modeDowngrade: { from: "hybrid_graph", to: "knowledge_graph", reason: downgradeReason }
       };
     }
   }
@@ -5436,9 +5789,10 @@ async function runDomainPipeline(options) {
     embeddings: options.embeddings,
     onProgress: options.onProgress
   });
-  const { emitCurriculumFeed: emitCurriculumFeed2 } = await Promise.resolve().then(() => (init_curriculumFeedEmitter(), curriculumFeedEmitter_exports));
-  const curriculumFeed = emitCurriculumFeed2(projectResult.projectGraph, {
-    warnings
+  const curriculumFeed = emitCurriculumFeed(projectResult.projectGraph, {
+    warnings,
+    hallucinationCount: projectResult.hallucinations.length,
+    provenance: summarizeProvenance(projectResult.provenance)
   });
   return {
     domainProfile,