nexus-agents 4.22.3 → 4.23.0

package/dist/{chunk-H7CV35LZ.js → chunk-PUGRS4KW.js}

@@ -1,9 +1,9 @@
 import {
   loadPapersRegistry
-} from "./chunk-P422WQJM.js";
+} from "./chunk-YVW743K3.js";
 import {
   getErrorMessage
-} from "./chunk-2SVIHHNJ.js";
+} from "./chunk-OYFKB64X.js";
 
 // src/cli/research-helpers-synthesize.ts
 import { z } from "zod";
@@ -767,11 +767,11 @@ function synthesizeCluster(cluster) {
     );
   }
   return {
+    ...insightFields(cluster.papers),
     topic: cluster.topic,
     paperCount: cluster.paperCount,
     papers: cluster.papers.map(toPaperRef),
     commonThemes,
-    keyInsights: attributeFindings(cluster.papers).slice(0, 10),
     techniques,
     implementationOpportunities: uniqueOpportunities,
     gaps,
@@ -779,6 +779,11 @@ function synthesizeCluster(cluster) {
     qualityDistribution
   };
 }
+var MAX_CLUSTER_INSIGHTS = 10;
+function insightFields(papers) {
+  const all = attributeFindings(papers);
+  return { keyInsights: all.slice(0, MAX_CLUSTER_INSIGHTS), totalInsights: all.length };
+}
 function findCrossCuttingThemes(clusters) {
   const tagToTopics = /* @__PURE__ */ new Map();
   for (const cluster of clusters) {
@@ -876,4 +881,4 @@ export {
   AttributedInsightSchema,
   synthesizeResearch
 };
-//# sourceMappingURL=chunk-H7CV35LZ.js.map
+//# sourceMappingURL=chunk-PUGRS4KW.js.map

package/dist/chunk-PUGRS4KW.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/cli/research-helpers-synthesize.ts","../src/cli/research-alignment-map.ts","../src/research/topic-aliases.ts"],"sourcesContent":["/**\n * Research Synthesis Helper\n *\n * Groups papers by topic cluster and generates structured synthesis\n * summaries with themes, findings, and implementation opportunities.\n *\n * @module cli/research-helpers-synthesize\n * (Source: Issue #1386 — Research Synthesis Pipeline)\n */\n\nimport { z } from 'zod';\nimport { loadPapersRegistry } from './research-helpers-io.js';\nimport type { PapersRegistry } from './research-types.js';\nimport type { Result } from '../core/result.js';\nimport { getErrorMessage } from '../core/index.js';\nimport { TECHNIQUE_IMPLEMENTATION_MAP, FEATURE_GATE_INVENTORY } from './research-alignment-map.js';\nimport { normalizeTopicToCanonical } from '../research/topic-aliases.js';\n\n// =============================================================================\n// TYPES\n// =============================================================================\n\n/** A paper entry from the registry, simplified for synthesis. */\nexport interface SynthesisPaper {\n  readonly id: string;\n  readonly title: string;\n  readonly topics: readonly string[];\n  readonly tags: readonly string[];\n  readonly summary: string;\n  readonly keyFindings: readonly string[];\n  readonly relevance: string;\n  readonly implementationStatus: string;\n  readonly techniquesExtracted: readonly string[];\n  readonly qualityScore: number;\n  readonly evidenceTier: 'high' | 'medium' | 'low';\n  /** Source URI — the paper URL, or `arxiv:<id>` (#2663 provenance). */\n  readonly sourceUri?: string;\n  /** Publication date as recorded in the registry (#2663 provenance). */\n  readonly publicationDate?: string;\n}\n\n/**\n * A reference to a source paper, carried into synthesis output so a\n * cluster is traceable back to its inputs (#2663).\n */\nexport interface SynthesisPaperRef {\n  readonly id: string;\n  readonly title: string;\n  readonly sourceUri?: string;\n}\n\n/**\n * A synthesized insight with its provenance (#2663). `sourcePaperIds` is\n * never empty — every merged claim is attributed. When two papers assert\n * the same finding, BOTH ids appear, so a contradiction is *representable*\n * as multiple attributed sources rather than silently collapsed into one.\n */\nexport interface AttributedInsight {\n  readonly insight: string;\n  readonly sourcePaperIds: readonly string[];\n}\n\n/**\n * Structural enforcement of the #2663 provenance invariant: every\n * synthesized insight must carry at least one source paper id. A doc rule\n * alone is fragile — this Zod schema makes \"no unattributed claim\" a\n * validated guarantee, not a hope.\n */\nexport const AttributedInsightSchema = z.object({\n  insight: z.string().min(1),\n  sourcePaperIds: z.array(z.string().min(1)).min(1),\n});\n\n/** A cluster of related papers grouped by topic. */\nexport interface PaperCluster {\n  readonly topic: string;\n  readonly papers: readonly SynthesisPaper[];\n  readonly paperCount: number;\n}\n\n/** A technique aligned to an existing implementation. */\nexport interface TechniqueAlignment {\n  readonly technique: string;\n  readonly status: 'implemented' | 'partial' | 'not-started';\n  readonly canonicalPath?: string | undefined;\n  readonly improvementHint?: string | undefined;\n}\n\n/** Quality distribution within a cluster. */\nexport interface QualityDistribution {\n  readonly avgScore: number;\n  readonly high: number;\n  readonly medium: number;\n  readonly low: number;\n}\n\n/** Synthesis output for a single topic cluster. */\nexport interface ClusterSynthesis {\n  readonly topic: string;\n  readonly paperCount: number;\n  readonly papers: readonly SynthesisPaperRef[];\n  readonly commonThemes: readonly string[];\n  readonly keyInsights: readonly AttributedInsight[];\n  /**\n   * How many attributed findings this cluster actually had (#5001).\n   *\n   * `keyInsights` is capped, and the cap bites: against the live registry six\n   * of eleven clusters exceed it, `orchestration` with 55. A caller seeing\n   * `paperCount: 40` beside ten insights could not tell \"these are the\n   * cluster's insights\" from \"these are ten of fifty-five\". A bounded read is\n   * fine; a bounded read reported as complete is not.\n   */\n  readonly totalInsights: number;\n  readonly techniques: readonly string[];\n  readonly implementationOpportunities: readonly string[];\n  readonly gaps: readonly string[];\n  readonly alignedTechniques: readonly TechniqueAlignment[];\n  readonly qualityDistribution: QualityDistribution;\n}\n\n/** Summary of alignment between research and implementation. */\nexport interface AlignmentSummary {\n  readonly implemented: number;\n  readonly partial: number;\n  readonly notStarted: number;\n  readonly total: number;\n  readonly topOpportunities: readonly string[];\n}\n\n/** Summary of a single feature gate for synthesis output. */\nexport interface FeatureGateStatus {\n  readonly envVar: string;\n  readonly defaultValue: string;\n  readonly description: string;\n  readonly linkedTechniqueCount: number;\n}\n\n/** Full synthesis result across all clusters. */\nexport interface SynthesisResult {\n  readonly clusters: readonly ClusterSynthesis[];\n  readonly totalPapers: number;\n  readonly topicCount: number;\n  readonly crossCuttingThemes: readonly string[];\n  readonly alignmentSummary: AlignmentSummary;\n  readonly featureGates: readonly FeatureGateStatus[];\n}\n\n/** Error for synthesis operations. */\nexport interface SynthesisError {\n  readonly code: 'LOAD_ERROR' | 'NO_PAPERS';\n  readonly message: string;\n}\n\n// =============================================================================\n// CONSTANTS\n// =============================================================================\n\n/** Minimum papers in a cluster to generate cross-cutting themes. */\nconst MIN_CROSS_CUTTING_CLUSTER_SIZE = 2;\n\n/** Tags that appear across many topics and indicate cross-cutting themes. */\nconst CROSS_CUTTING_TAG_THRESHOLD = 3;\n\n// =============================================================================\n// PUBLIC API\n// =============================================================================\n\n/**\n * Synthesize the research registry by grouping papers into topic clusters\n * and generating structured summaries.\n *\n * @param topicFilter - Optional topic to filter to a single cluster\n * @returns Structured synthesis result\n */\nexport async function synthesizeResearch(\n  topicFilter?: string\n): Promise<Result<SynthesisResult, SynthesisError>> {\n  const registryResult = await loadPapersRegistry();\n  if (!registryResult.ok) {\n    return {\n      ok: false,\n      error: {\n        code: 'LOAD_ERROR',\n        message: `Failed to load papers: ${getErrorMessage(registryResult.error)}`,\n      },\n    };\n  }\n\n  const papers = extractPapers(registryResult.value);\n  if (papers.length === 0) {\n    return {\n      ok: false,\n      error: { code: 'NO_PAPERS', message: 'No papers found in registry' },\n    };\n  }\n\n  const clusters = groupByTopic(papers);\n  const filtered =\n    topicFilter !== undefined ? clusters.filter((c) => c.topic === topicFilter) : clusters;\n\n  const syntheses = filtered.map(synthesizeCluster);\n  const crossCutting = findCrossCuttingThemes(filtered);\n  const alignmentSummary = buildAlignmentSummary(syntheses);\n  const featureGates = buildFeatureGateSummary();\n\n  return {\n    ok: true,\n    value: {\n      clusters: syntheses,\n      totalPapers: papers.length,\n      topicCount: filtered.length,\n      crossCuttingThemes: crossCutting,\n      alignmentSummary,\n      featureGates,\n    },\n  };\n}\n\n// =============================================================================\n// EXTRACTION\n// =============================================================================\n\n/**\n * Safely convert a field that types say is `readonly string[]` but may be\n * null/undefined at runtime (YAML parsing of empty array fields).\n */\nfunction safeArray(value: readonly string[]): string[] {\n  // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition -- YAML parsing can yield null despite type\n  if (value === null || value === undefined) return [];\n  return Array.from(value);\n}\n\n/** Extract papers from the registry structure. */\n/** Source URI for a paper: prefer the URL, else `arxiv:<id>` (#2663). */\nfunction paperSourceUri(p: PapersRegistry['papers'][string]): string | undefined {\n  if (typeof p.url === 'string' && p.url.length > 0) return p.url;\n  if (typeof p.arxiv_id === 'string' && p.arxiv_id.length > 0) return `arxiv:${p.arxiv_id}`;\n  return undefined;\n}\n\nfunction extractPapers(registry: PapersRegistry): SynthesisPaper[] {\n  return Object.entries(registry.papers).map(([id, p]) => {\n    const sourceUri = paperSourceUri(p);\n    return {\n      id,\n      title: p.title,\n      topics: safeArray(p.topics),\n      tags: safeArray(p.tags),\n      summary: p.summary.trim(),\n      keyFindings: safeArray(p.key_findings),\n      relevance: p.relevance,\n      implementationStatus: p.implementation_status,\n      techniquesExtracted: safeArray(p.techniques_extracted),\n      qualityScore: p.quality_score ?? 0,\n      evidenceTier: p.evidence_tier ?? 'low',\n      // #2663 — carry provenance from the registry into synthesis.\n      ...(sourceUri !== undefined ? { sourceUri } : {}),\n      ...(typeof p.publication_date === 'string' ? { publicationDate: p.publication_date } : {}),\n    };\n  });\n}\n\n// =============================================================================\n// GROUPING\n// =============================================================================\n\n/** Group papers by primary topic into clusters, normalizing free-form topics. */\nfunction groupByTopic(papers: readonly SynthesisPaper[]): PaperCluster[] {\n  const topicMap = new Map<string, SynthesisPaper[]>();\n\n  for (const paper of papers) {\n    for (const rawTopic of paper.topics) {\n      const topic = normalizeTopicToCanonical(rawTopic);\n      const existing = topicMap.get(topic);\n      if (existing !== undefined) {\n        existing.push(paper);\n      } else {\n        topicMap.set(topic, [paper]);\n      }\n    }\n  }\n\n  const clusters: PaperCluster[] = [];\n  for (const [topic, unsortedPapers] of topicMap) {\n    // Sort papers within cluster by quality_score descending (high-quality first)\n    const topicPapers = [...unsortedPapers].sort((a, b) => b.qualityScore - a.qualityScore);\n    clusters.push({\n      topic,\n      papers: topicPapers,\n      paperCount: topicPapers.length,\n    });\n  }\n\n  return clusters.sort((a, b) => b.paperCount - a.paperCount);\n}\n\n// =============================================================================\n// SYNTHESIS\n// =============================================================================\n\n/** Generate synthesis for a single topic cluster. */\n/** Compute quality score distribution for a set of papers. */\nfunction computeClusterQuality(papers: readonly SynthesisPaper[]): QualityDistribution {\n  const scores = papers.map((p) => p.qualityScore);\n  const totalScore = scores.reduce((sum, s) => sum + s, 0);\n  return {\n    avgScore: scores.length > 0 ? Math.round((totalScore / scores.length) * 10) / 10 : 0,\n    high: papers.filter((p) => p.evidenceTier === 'high').length,\n    medium: papers.filter((p) => p.evidenceTier === 'medium').length,\n    low: papers.filter((p) => p.evidenceTier === 'low').length,\n  };\n}\n\nfunction synthesizeCluster(cluster: PaperCluster): ClusterSynthesis {\n  const allTags = collectFrequencies(cluster.papers.flatMap((p) => [...p.tags]));\n  const allTechniques = collectFrequencies(\n    cluster.papers.flatMap((p) => [...p.techniquesExtracted])\n  );\n\n  // Common themes: tags that appear in 2+ papers\n  const commonThemes = [...allTags.entries()]\n    .filter(([, count]) => count >= MIN_CROSS_CUTTING_CLUSTER_SIZE)\n    .sort((a, b) => b[1] - a[1])\n    .map(([tag]) => tag);\n\n  // Techniques across the cluster\n  const techniques = [...allTechniques.entries()]\n    .sort((a, b) => b[1] - a[1])\n    .map(([tech, count]) => (count > 1 ? `${tech} (${String(count)} papers)` : tech));\n\n  // Implementation opportunities: techniques not yet implemented\n  const notStarted = cluster.papers\n    .filter((p) => p.implementationStatus === 'not-started')\n    .flatMap((p) => [...p.techniquesExtracted]);\n  const uniqueOpportunities = [...new Set(notStarted)];\n\n  // Gaps: topics with few papers or missing techniques\n  const gaps: string[] = [];\n  if (cluster.paperCount === 1) {\n    gaps.push(`Only 1 paper — more research needed on ${cluster.topic}`);\n  }\n  const highRelevanceUnimplemented = cluster.papers.filter(\n    (p) => p.relevance === 'high' && p.implementationStatus === 'not-started'\n  );\n  if (highRelevanceUnimplemented.length > 0) {\n    gaps.push(\n      `${String(highRelevanceUnimplemented.length)} high-relevance paper(s) not yet implemented`\n    );\n  }\n\n  // Alignment analysis: map techniques to existing implementations\n  const allTechNames = [...allTechniques.keys()];\n  const alignedTechniques = analyzeClusterAlignment(allTechNames);\n\n  const qualityDistribution = computeClusterQuality(cluster.papers);\n\n  // Add quality gap if most papers are low-quality\n  if (qualityDistribution.low > qualityDistribution.high + qualityDistribution.medium) {\n    gaps.push(\n      `Mostly low-evidence papers (${String(qualityDistribution.low)}/${String(cluster.paperCount)}) — findings need stronger validation`\n    );\n  }\n\n  return {\n    ...insightFields(cluster.papers),\n    topic: cluster.topic,\n    paperCount: cluster.paperCount,\n    papers: cluster.papers.map(toPaperRef),\n    commonThemes,\n    techniques,\n    implementationOpportunities: uniqueOpportunities,\n    gaps,\n    alignedTechniques,\n    qualityDistribution,\n  };\n}\n\n/** Insights carried per cluster. The count dropped is disclosed, not silent. */\nconst MAX_CLUSTER_INSIGHTS = 10;\n\n/**\n * The capped insight list plus the count it was capped from (#5001).\n *\n * Returned together so the two can never drift: a `keyInsights` without its\n * `totalInsights` is the silent truncation this replaced.\n */\nfunction insightFields(papers: readonly SynthesisPaper[]): {\n  keyInsights: readonly AttributedInsight[];\n  totalInsights: number;\n} {\n  const all = attributeFindings(papers);\n  return { keyInsights: all.slice(0, MAX_CLUSTER_INSIGHTS), totalInsights: all.length };\n}\n\n/** Find themes that span multiple topic clusters. */\nfunction findCrossCuttingThemes(clusters: readonly PaperCluster[]): string[] {\n  const tagToTopics = new Map<string, Set<string>>();\n\n  for (const cluster of clusters) {\n    for (const paper of cluster.papers) {\n      for (const tag of paper.tags) {\n        const existing = tagToTopics.get(tag);\n        if (existing !== undefined) {\n          existing.add(cluster.topic);\n        } else {\n          tagToTopics.set(tag, new Set([cluster.topic]));\n        }\n      }\n    }\n  }\n\n  return [...tagToTopics.entries()]\n    .filter(([, topics]) => topics.size >= CROSS_CUTTING_TAG_THRESHOLD)\n    .sort((a, b) => b[1].size - a[1].size)\n    .map(([tag, topics]) => `${tag} (spans: ${[...topics].join(', ')})`);\n}\n\n// =============================================================================\n// ALIGNMENT ANALYSIS\n// =============================================================================\n\n/** Analyze technique alignment for a cluster. */\nfunction analyzeClusterAlignment(techniques: readonly string[]): TechniqueAlignment[] {\n  const alignments: TechniqueAlignment[] = [];\n\n  for (const tech of techniques) {\n    // Strip count annotation like \"technique (2 papers)\"\n    const baseTech = tech.replace(/\\s*\\(\\d+\\s*papers?\\)$/, '');\n    const mapping = TECHNIQUE_IMPLEMENTATION_MAP.get(baseTech);\n\n    if (mapping !== undefined) {\n      alignments.push({\n        technique: baseTech,\n        status: mapping.status,\n        canonicalPath: mapping.path,\n        ...(mapping.hint !== undefined ? { improvementHint: mapping.hint } : {}),\n      });\n    } else {\n      alignments.push({ technique: baseTech, status: 'not-started' });\n    }\n  }\n\n  return alignments;\n}\n\n/** Build alignment summary across all clusters. */\nfunction buildAlignmentSummary(clusters: readonly ClusterSynthesis[]): AlignmentSummary {\n  const allAlignments = clusters.flatMap((c) => c.alignedTechniques);\n  const implemented = allAlignments.filter((a) => a.status === 'implemented').length;\n  const partial = allAlignments.filter((a) => a.status === 'partial').length;\n  const notStarted = allAlignments.filter((a) => a.status === 'not-started').length;\n\n  // Top opportunities: partial implementations with hints (most improvable)\n  const opportunities = allAlignments\n    .filter((a) => a.status === 'partial' && a.improvementHint !== undefined)\n    .map((a) => `${a.technique}: ${a.improvementHint ?? ''}`)\n    .slice(0, 10);\n\n  return {\n    implemented,\n    partial,\n    notStarted,\n    total: allAlignments.length,\n    topOpportunities: opportunities,\n  };\n}\n\n/** Build feature gate summary from the inventory. */\nfunction buildFeatureGateSummary(): FeatureGateStatus[] {\n  return FEATURE_GATE_INVENTORY.map((g) => ({\n    envVar: g.envVar,\n    defaultValue: g.defaultValue,\n    description: g.description,\n    linkedTechniqueCount: g.techniques?.length ?? 0,\n  }));\n}\n\n// =============================================================================\n// UTILITIES\n// =============================================================================\n\nfunction collectFrequencies(items: readonly string[]): Map<string, number> {\n  const counts = new Map<string, number>();\n  for (const item of items) {\n    counts.set(item, (counts.get(item) ?? 0) + 1);\n  }\n  return counts;\n}\n\n/** Project a source paper to the lean reference carried into output (#2663). */\nfunction toPaperRef(p: SynthesisPaper): SynthesisPaperRef {\n  return {\n    id: p.id,\n    title: p.title,\n    ...(p.sourceUri !== undefined ? { sourceUri: p.sourceUri } : {}),\n  };\n}\n\n/**\n * Deduplicate findings across a cluster's papers WHILE preserving\n * provenance (#2663). Findings are keyed by normalized text; when two\n * papers assert the same finding, both ids are collected — so a\n * contradiction is representable as multiple attributed sources rather\n * than silently collapsed. Every returned insight is validated to carry\n * at least one source id (`AttributedInsightSchema`).\n */\nfunction attributeFindings(papers: readonly SynthesisPaper[]): AttributedInsight[] {\n  const byNormalized = new Map<string, { insight: string; sourcePaperIds: Set<string> }>();\n  for (const paper of papers) {\n    for (const finding of paper.keyFindings) {\n      const normalized = finding.toLowerCase().trim();\n      if (normalized.length === 0) continue;\n      const existing = byNormalized.get(normalized);\n      if (existing !== undefined) {\n        existing.sourcePaperIds.add(paper.id);\n      } else {\n        byNormalized.set(normalized, {\n          insight: finding,\n          sourcePaperIds: new Set([paper.id]),\n        });\n      }\n    }\n  }\n  return [...byNormalized.values()].map((e) =>\n    AttributedInsightSchema.parse({ insight: e.insight, sourcePaperIds: [...e.sourcePaperIds] })\n  );\n}\n","/**\n * Research Alignment Map\n *\n * Maps technique names from the research registry to canonical code paths\n * in the nexus-agents codebase. Used by research synthesis to determine\n * which paper techniques are implemented, partially implemented, or new.\n *\n * @module cli/research-alignment-map\n * (Source: Issue #1386 — Research Synthesis Pipeline)\n */\n\n// =============================================================================\n// TYPES\n// =============================================================================\n\n/** Implementation status for a mapped technique. */\nexport interface TechniqueMapping {\n  readonly status: 'implemented' | 'partial';\n  readonly path: string;\n  readonly hint?: string | undefined;\n}\n\n/** A feature gate that controls an implementation. */\nexport interface FeatureGate {\n  /** Environment variable or config key. */\n  readonly envVar: string;\n  /** Default value when not explicitly set. */\n  readonly defaultValue: string;\n  /** Brief description of what the gate controls. */\n  readonly description: string;\n  /** Related technique names from the alignment map (if any). */\n  readonly techniques?: readonly string[];\n}\n\n// =============================================================================\n// MAP\n// =============================================================================\n\n/**\n * Maps technique names to canonical code paths.\n * 'implemented' = full implementation exists matching the technique.\n * 'partial' = related code exists but doesn't fully implement the technique.\n */\nexport const TECHNIQUE_IMPLEMENTATION_MAP: ReadonlyMap<string, TechniqueMapping> = new Map([\n  // Routing techniques\n  ['linucb-routing', { status: 'implemented', path: 'cli-adapters/linucb-bandit.ts' }],\n  ['topsis-routing', { status: 'implemented', path: 'cli-adapters/topsis-router.ts' }],\n  [\n    'cascade-routing',\n    { status: 'implemented', path: 'routing/stages/confidence-cascade-stage.ts' },\n  ],\n  [\n    'complexity-based-routing',\n    { status: 'implemented', path: 'routing/stages/confidence-cascade-stage.ts' },\n  ],\n  [\n    'moe-routing',\n    {\n      status: 'implemented',\n      path: 'cli-adapters/composite-router.ts',\n      hint: '5-stage composite routing selects among specialized CLI experts based on task features',\n    },\n  ],\n  ['two-stage-routing', { status: 'implemented', path: 'cli-adapters/composite-router-stages.ts' }],\n  [\n    'capability-instruction-tuning',\n    {\n      status: 'partial',\n      path: 'routing/stages/capability-match-stage.ts',\n      hint: 'Static capability profiles, not instruction-tuned',\n    },\n  ],\n  [\n    'knn-routing',\n    {\n      status: 'implemented',\n      path: 'routing/stages/knn-routing-stage.ts',\n      hint: 'KnnRoutingStage: cosine similarity over keyword vectors, K-nearest experience patterns, weighted by success rate',\n    },\n  ],\n  ['pilot-budget-routing', { status: 'implemented', path: 'cli-adapters/budget-router.ts' }],\n  [\n    'tolerance-routing',\n    {\n      status: 'implemented',\n      path: 'cli-adapters/composite-router-helpers.ts',\n      hint: 'TOPSIS_TOLERANCE_BAND_PERCENT (5%) identifies quality-equivalent candidates after TOPSIS ranking',\n    },\n  ],\n  [\n    'sater-routing',\n    {\n      status: 'implemented',\n      path: 'routing/stages/quality-constraint-stage.ts',\n      hint: 'QualityConstraintStage filters models by min quality (0.7), max cost, max latency before selection',\n    },\n  ],\n  [\n    'preference-trained-routing',\n    { status: 'implemented', path: 'cli-adapters/preference-router.ts' },\n  ],\n  [\n    'strmac-state-routing',\n    {\n      status: 'implemented',\n      path: 'context/routing-memory.ts',\n      hint: 'RoutingMemory maintains state across calls (profile, experience, action cache) feeding LinUCB + weather bonus stages',\n    },\n  ],\n  [\n    'cross-attention-routing',\n    {\n      status: 'implemented',\n      path: 'routing/stages/capability-match-stage.ts',\n      hint: 'AttentionMatrix maps task features to capability weights (configurable cross-attention)',\n    },\n  ],\n\n  // Consensus techniques\n  ['consensus-protocol', { status: 'implemented', path: 'consensus/engine.ts' }],\n  ['majority-voting', { status: 'implemented', path: 'consensus/engine.ts' }],\n  ['higher-order-voting', { status: 'implemented', path: 'consensus/higher-order-strategy.ts' }],\n  [\n    'anti-conformity-weighting',\n    { status: 'implemented', path: 'consensus/higher-order-strategy.ts' },\n  ],\n  [\n    'agreement-based-cascading',\n    {\n      status: 'implemented',\n      path: 'consensus/engine.ts',\n      hint: 'canCascadeEarly() closes proposals when outcome is mathematically determined',\n    },\n  ],\n  [\n    'incremental-quorum',\n    {\n      status: 'implemented',\n      path: 'consensus/incremental-quorum.ts',\n      hint: 'Ambiguity detection + voter expansion via VoterExpansionCallback (#1408)',\n    },\n  ],\n  [\n    'aegean-consensus',\n    { status: 'partial', path: 'consensus/engine.ts', hint: 'Byzantine tolerance not implemented' },\n  ],\n  [\n    'cp-wbft-consensus',\n    {\n      status: 'partial',\n      path: 'consensus/engine.ts',\n      hint: 'No weighted Byzantine fault tolerance',\n    },\n  ],\n\n  // Memory techniques\n  ['adaptive-memory', { status: 'implemented', path: 'memory/adaptive/' }],\n  ['mirix-six-type-memory', { status: 'implemented', path: 'memory/typed/' }],\n  [\n    'mem0-memory-architecture',\n    { status: 'partial', path: 'memory/', hint: 'Multi-backend memory but not mem0 pattern' },\n  ],\n  [\n    'graph-based-memory',\n    {\n      status: 'partial',\n      path: 'memory/belief/',\n      hint: 'Belief triples are graph-like but not full graph DB',\n    },\n  ],\n  ['experience-memory', { status: 'implemented', path: 'memory/session/' }],\n  ['hindsight-belief-memory', { status: 'implemented', path: 'memory/belief/' }],\n  [\n    'profile-memory',\n    {\n      status: 'implemented',\n      path: 'context/routing-memory.ts',\n      hint: 'RoutingMemory stores model preferences per task type and feeds recommendations into composite router via PERSISTENCE_AWARE_FLAGS',\n    },\n  ],\n  [\n    'action-memory',\n    {\n      status: 'implemented',\n      path: 'orchestration/outcomes/',\n      hint: 'OutcomeStore records actions+results+context with query-by-category/CLI/time and cross-session persistence',\n    },\n  ],\n  ['reflection-memory', { status: 'implemented', path: 'mcp/tools/orchestrate-reflection.ts' }],\n  [\n    'history-encoding',\n    {\n      status: 'partial',\n      path: 'context/token-counter.ts',\n      hint: 'Token counting exists but no learned history encoding',\n    },\n  ],\n\n  // Orchestration techniques\n  [\n    'aflow-mcts-workflows',\n    {\n      status: 'partial',\n      path: 'workflows/aflow/',\n      hint: 'AFlow scaffolding exists but MCTS not implemented',\n    },\n  ],\n  [\n    'dynamic-agent-selection',\n    { status: 'implemented', path: 'orchestration/aorchestra/agent-planner.ts' },\n  ],\n  ['dynamic-subagent-creation', { status: 'implemented', path: 'mcp/tools/create-expert.ts' }],\n  ['role-based-protocols', { status: 'implemented', path: 'agents/expert-roles.ts' }],\n  [\n    'rule-based-coordination',\n    { status: 'implemented', path: 'orchestration/aorchestra/worker-dispatcher.ts' },\n  ],\n  [\n    'temporal-graph-orchestration',\n    {\n      status: 'partial',\n      path: 'orchestration/graph/',\n      hint: 'Graph workflows exist but not temporal-aware',\n    },\n  ],\n  [\n    'model-based-coordination',\n    {\n      status: 'partial',\n      path: 'orchestration/aorchestra/',\n      hint: 'Worker dispatch but not model-based coordination theory',\n    },\n  ],\n  [\n    'trinity-roles',\n    {\n      status: 'partial',\n      path: 'agents/expert-roles.ts',\n      hint: '10 expert roles, not trinity pattern',\n    },\n  ],\n  [\n    'sew-self-evolving-workflows',\n    {\n      status: 'partial',\n      path: 'workflows/aflow/',\n      hint: 'AFlow framework but no self-evolution loop',\n    },\n  ],\n  [\n    'scaling-coordination-predictor',\n    {\n      status: 'partial',\n      path: 'orchestration/aorchestra/agent-planner.ts',\n      hint: 'Wave sizing but no scaling prediction',\n    },\n  ],\n\n  // Learning techniques\n  [\n    'self-refine-loop',\n    {\n      status: 'implemented',\n      path: 'mcp/tools/orchestrate-dispatch.ts',\n    },\n  ],\n  [\n    'recursive-improvement',\n    {\n      status: 'implemented',\n      path: 'mcp/tools/orchestrate-dispatch.ts',\n    },\n  ],\n  [\n    'rl-orchestrator',\n    {\n      status: 'implemented',\n      path: 'cli-adapters/linucb-bandit.ts',\n      hint: 'LinUCB contextual bandit actively selects models via explore-exploit in routing pipeline',\n    },\n  ],\n  ['reflexion-verbal-rl', { status: 'implemented', path: 'mcp/tools/orchestrate-reflection.ts' }],\n\n  // Source-derived techniques (Wave 6 — from open-source project analysis)\n  ['failure-lesson-injection', { status: 'implemented', path: 'orchestration/failure-lessons.ts' }],\n  [\n    'skill-relevance-matching',\n    {\n      status: 'implemented',\n      path: 'agents/experts/skill-matcher.ts',\n      hint: 'Matches task keywords to agent skill descriptions for optimal routing',\n    },\n  ],\n  [\n    'context-rot-prevention',\n    {\n      status: 'implemented',\n      path: 'agents/context-pruner.ts',\n      hint: 'Token-efficient context pruning prevents quality degradation in long sessions',\n    },\n  ],\n  [\n    'wave-based-parallel-execution',\n    {\n      status: 'implemented',\n      path: 'orchestration/aorchestra/worker-dispatcher.ts',\n      hint: 'AOrchestra worker dispatch with cross-wave context sharing',\n    },\n  ],\n  [\n    'write-time-deduplication',\n    {\n      status: 'implemented',\n      path: 'mcp/tools/memory-write.ts',\n      hint: 'Semantic dedup at write time prevents memory bloat',\n    },\n  ],\n]);\n\n// =============================================================================\n// FEATURE GATE INVENTORY\n// =============================================================================\n\n/** Inventory of feature gates linked to research-aligned techniques. */\nexport const FEATURE_GATE_INVENTORY: readonly FeatureGate[] = [\n  {\n    envVar: 'NEXUS_V2_MODE',\n    defaultValue: 'full',\n    description: 'V2 pipeline mode (off/partial/full)',\n    techniques: ['two-stage-routing', 'cascade-routing'],\n  },\n  {\n    envVar: 'NEXUS_AORCHESTRA',\n    defaultValue: 'true',\n    description: 'AOrchestra dynamic agent planning',\n    techniques: ['dynamic-agent-selection', 'model-based-coordination'],\n  },\n  {\n    envVar: 'NEXUS_AORCHESTRA_DISPATCH',\n    defaultValue: 'true',\n    description: 'AOrchestra worker dispatch',\n    techniques: ['rule-based-coordination', 'self-refine-loop'],\n  },\n  {\n    envVar: 'NEXUS_PERSIST_LEARNING',\n    defaultValue: 'true',\n    description: 'Cross-session routing persistence',\n    techniques: ['linucb-routing', 'preference-trained-routing', 'experience-memory'],\n  },\n  {\n    envVar: 'NEXUS_REFLECTIVE_MEMORY',\n    defaultValue: 'shadow',\n    description: 'Reflective memory retrieval (shadow=default, true=full, false=off)',\n    techniques: ['reflection-memory', 'adaptive-memory', 'reflexion-verbal-rl'],\n  },\n  {\n    envVar: 'NEXUS_BILLING_MODE',\n    defaultValue: 'plan',\n    description: 'Cost mode (plan=strongest, api=cost-aware)',\n    techniques: ['pilot-budget-routing', 'topsis-routing'],\n  },\n  {\n    envVar: 'NEXUS_WORKER_MAX_CALLS',\n    defaultValue: '6',\n    description: 'Max model calls per orchestrate',\n    techniques: ['self-refine-loop', 'recursive-improvement'],\n  },\n  { envVar: 'NEXUS_AUTH_ENABLED', defaultValue: 'true', description: 'Server authentication' },\n  { envVar: 'NEXUS_EVENTBUS_ENABLED', defaultValue: 'true', description: 'EventBus A2A bridge' },\n  {\n    envVar: 'NEXUS_RATE_LIMIT_ENABLED',\n    defaultValue: 'true',\n    description: 'Token-bucket rate limiter',\n  },\n  {\n    envVar: 'NEXUS_CIRCUIT_BREAKER_THRESHOLD',\n    defaultValue: '5',\n    description: 'Circuit breaker failure threshold',\n  },\n  {\n    envVar: 'NEXUS_V2_POLICY_MODE',\n    defaultValue: 'block',\n    description: 'Policy enforcement (off/warn/block)',\n  },\n  { envVar: 'NEXUS_LOG_LEVEL', defaultValue: 'info', description: 'Logging verbosity' },\n  {\n    envVar: 'NEXUS_DISABLE_SESSIONS',\n    defaultValue: 'false',\n    description: 'Disable session tracking',\n  },\n  {\n    envVar: 'NEXUS_DISABLE_METRICS',\n    defaultValue: 'false',\n    description: 'Disable metrics tracking',\n  },\n  {\n    envVar: 'NEXUS_ALLOW_MOCK_ORCHESTRATION',\n    defaultValue: 'false',\n    description: 'Allow mock orchestration (test/CI)',\n  },\n  {\n    envVar: 'NEXUS_MAX_CONCURRENT_EXPERTS',\n    defaultValue: '6',\n    description: 'Expert pool semaphore capacity',\n  },\n  {\n    envVar: 'NEXUS_VOTE_TIMEOUT_MS',\n    defaultValue: '60000',\n    description: 'Consensus vote timeout override',\n  },\n  {\n    envVar: 'NEXUS_EXPERT_TIMEOUT_MS',\n    defaultValue: '120000',\n    description: 'Expert handler timeout override',\n  },\n  {\n    envVar: 'NEXUS_WORKER_TIMEOUT_MS',\n    defaultValue: '60000',\n    description: 'Worker subprocess timeout override',\n  },\n];\n","/**\n * Topic alias map for normalizing free-form topic strings to canonical topics.\n *\n * Maps 200+ free-form topic strings found in papers.yaml to 12 canonical topics.\n * Used by normalizeTopicToCanonical() in research-schemas.ts.\n *\n * @module research/topic-aliases\n * @see Issue #1578 — Topic taxonomy normalization\n */\n\n/**\n * Map of free-form topic strings to canonical topics.\n */\nexport const TOPIC_ALIASES: Readonly<Record<string, string>> = {\n  // → consensus\n  voting: 'consensus',\n  'consensus-voting': 'consensus',\n  debate: 'consensus',\n  quorum: 'consensus',\n  byzantine: 'consensus',\n  'anti-conformity': 'consensus',\n  'agreement-based': 'consensus',\n  'correlation-aware': 'consensus',\n  'LLM consensus and multi-agent voting mechanisms': 'consensus',\n  'tolerance-parameter': 'consensus',\n\n  // → routing\n  'model-routing': 'routing',\n  'model routing': 'routing',\n  'llm-routing': 'routing',\n  cascade: 'routing',\n  'cascade-routing': 'routing',\n  'cost-optimization': 'routing',\n  'cost-reduction': 'routing',\n  'model-selection': 'routing',\n  topsis: 'routing',\n  linucb: 'routing',\n  'contextual-bandit': 'routing',\n  'quality-constrained': 'routing',\n  'budget-constraints': 'routing',\n  'unified-routing': 'routing',\n  'query-model-matching': 'routing',\n  'adaptive model routing and selection optimization': 'routing',\n  'multi-model routing optimization': 'routing',\n  'Single-head cross-attention for query-model matching': 'routing',\n  'performance-cost-tradeoff': 'routing',\n  'task-routing': 'routing',\n  'difficulty-estimation': 'routing',\n  'score-based': 'routing',\n  'optimal-weighting': 'routing',\n  'hierarchical-filtering': 'routing',\n  'preference-optimization': 'routing',\n  'preference-data': 'routing',\n  dpo: 'routing',\n  'cross-attention': 'routing',\n  'cma-es': 'routing',\n  profile: 'routing',\n  prediction: 'routing',\n  lightweight: 'routing',\n  bayesian: 'routing',\n  'quality-diversity': 'routing',\n  'resource-optimization': 'routing',\n  'routing-latency': 'routing',\n  optimization: 'routing',\n  'model-merging': 'routing',\n  'model-zoo': 'routing',\n\n  // → memory\n  'context-management': 'memory',\n  'context-compression': 'memory',\n  'context-control': 'memory',\n  compression: 'memory',\n  'kv-cache': 'memory',\n  'long-context': 'memory',\n  'long-term-memory': 'memory',\n  'episodic-memory': 'memory',\n  'graph-memory': 'memory',\n  'hierarchical-memory': 'memory',\n  'agentic-memory': 'memory',\n  'lifelong-learning': 'memory',\n  'cross-session-learning': 'memory',\n  'continual-learning': 'memory',\n  'self-editing-memory': 'memory',\n  'six-type-memory': 'memory',\n  'belief-memory': 'memory',\n  'belief-state': 'memory',\n  'action-memory': 'memory',\n  'memory-evolution': 'memory',\n  'virtual-context': 'memory',\n  paging: 'memory',\n  'prompt-compression': 'memory',\n  'learned-compression': 'memory',\n  zettelkasten: 'memory',\n  'knowledge-distillation': 'memory',\n  'history-encoding': 'memory',\n  'ictm-tuple': 'memory',\n  'latent-space': 'memory',\n  'vector-db': 'memory',\n  embedding: 'memory',\n  'Taxonomy of context management strategies': 'memory',\n  'Task-specific context compression': 'memory',\n  'Learned compression modules': 'memory',\n  rag: 'memory',\n  'retrieval augmented generation': 'memory',\n  svd: 'memory',\n  'svd-mutation': 'memory',\n  vae: 'memory',\n  knn: 'memory',\n  experience: 'memory',\n  'state-aware': 'memory',\n  'temporal-graph': 'memory',\n  versioning: 'memory',\n\n  // → code-generation\n  'code-repair': 'code-generation',\n  'code-agent': 'code-generation',\n  'code-review': 'code-generation',\n  'software-engineering': 'code-generation',\n  'swe-bench': 'code-generation',\n  'self-improvement': 'code-generation',\n  'self-evolving': 'code-generation',\n  'self-debug': 'code-generation',\n  'self-modification': 'code-generation',\n  'skill-library': 'code-generation',\n  'skill-discovery': 'code-generation',\n  'code review benchmarks': 'code-generation',\n  'code generation evaluation': 'code-generation',\n  'execution-feedback': 'code-generation',\n\n  // → cli-tools\n  mcp: 'cli-tools',\n  'MCP protocol': 'cli-tools',\n  'MCP security': 'cli-tools',\n  'MCP Security': 'cli-tools',\n  'mcp-applications': 'cli-tools',\n  'model-context-protocol': 'cli-tools',\n  puppeteer: 'cli-tools',\n  streaming: 'cli-tools',\n  integration: 'cli-tools',\n\n  // → orchestration\n  'multi-agent': 'orchestration',\n  'multi-agent-systems': 'orchestration',\n  'multi-agent orchestration': 'orchestration',\n  'Multi-Agent Orchestration': 'orchestration',\n  'multi-agent-orchestration': 'orchestration',\n  'multi-agent coordination': 'orchestration',\n  'multi-agent-coordination': 'orchestration',\n  'multi-agent-worker-dispatch': 'orchestration',\n  'multi-agent reliability': 'orchestration',\n  'multi-agent-rl': 'orchestration',\n  coordination: 'orchestration',\n  coordinator: 'orchestration',\n  collaboration: 'orchestration',\n  'graph-orchestration': 'orchestration',\n  'agent architecture': 'orchestration',\n  'dynamic-agent-creation': 'orchestration',\n  'specialized-agents': 'orchestration',\n  'thinker-worker-verifier': 'orchestration',\n  'two-agent': 'orchestration',\n  'meta-agent': 'orchestration',\n  agents: 'orchestration',\n  'workflow-optimization': 'orchestration',\n  'workflow-generation': 'orchestration',\n  'agent-communication': 'orchestration',\n  'inter-agent': 'orchestration',\n  'gvu-operator': 'orchestration',\n  'rubber-duck': 'orchestration',\n  'parallel-exploration': 'orchestration',\n  kubernetes: 'orchestration',\n  'scale-to-zero': 'orchestration',\n  edge: 'orchestration',\n  llm: 'orchestration',\n  multimodal: 'orchestration',\n  production: 'orchestration',\n  hybrid: 'orchestration',\n  'automatic-discovery': 'orchestration',\n  roadmap: 'orchestration',\n\n  // → security\n  'prompt injection defense': 'security',\n  'inter-agent-security': 'security',\n  'agent security': 'security',\n  compliance: 'security',\n  'formal-verification': 'security',\n  'formal-safety': 'security',\n\n  // → evaluation\n  benchmark: 'evaluation',\n  benchmarking: 'evaluation',\n  survey: 'evaluation',\n  'autonomous agent evaluation benchmarks': 'evaluation',\n  'evaluation-methods': 'evaluation',\n  'LLM evaluation': 'evaluation',\n  'hallucination-detection': 'evaluation',\n  'self-evaluation': 'evaluation',\n  'confidence-probe': 'evaluation',\n  'confidence-aware': 'evaluation',\n  verifier: 'evaluation',\n  observability: 'evaluation',\n  theoretical: 'evaluation',\n  'post-deployment': 'evaluation',\n  capability: 'evaluation',\n  'knowledge-gaps': 'evaluation',\n  helm: 'evaluation',\n\n  // → safety\n  'agentic-safety': 'safety',\n  'agentic AI safety': 'safety',\n  'safety-evaluation': 'safety',\n  'reward-modeling': 'safety',\n  'constitutional-ai': 'safety',\n  'hazard-analysis': 'safety',\n  stpa: 'safety',\n  'risk-assessment': 'safety',\n  'fault-tolerance': 'safety',\n  'ai-feedback': 'safety',\n  rlaif: 'safety',\n  'human-in-the-loop': 'safety',\n  feedback: 'safety',\n  'feedback-loop': 'safety',\n  'feedback-learning': 'safety',\n  anthropic: 'safety',\n\n  // → planning\n  'decision-making': 'planning',\n  'tree-search': 'planning',\n  'tree-structure': 'planning',\n  'multi-tree': 'planning',\n  mcts: 'planning',\n  backtrack: 'planning',\n  hindsight: 'planning',\n  'task-specific': 'planning',\n\n  // → tool-use\n  'tool use': 'tool-use',\n  'tool-augmented reasoning and function calling': 'tool-use',\n  'tool routing optimization': 'tool-use',\n  'dynamic-linking': 'tool-use',\n  'Sparse outcome rewards reduce tool calls by 72%': 'tool-use',\n\n  // → reasoning\n  'test-time': 'reasoning',\n  'test-time-scaling': 'reasoning',\n  'inference-scaling': 'reasoning',\n  'inference-optimization': 'reasoning',\n  'self-critique': 'reasoning',\n  'self-reflection': 'reasoning',\n  'self-referential': 'reasoning',\n  'self-play': 'reasoning',\n  reflexion: 'reasoning',\n  reflection: 'reasoning',\n  'reasoning-optimization': 'reasoning',\n  'meta-thinking': 'reasoning',\n  scaling: 'reasoning',\n  recursive: 'reasoning',\n  'trajectory-abstraction': 'reasoning',\n  'verbal-rl': 'reasoning',\n  exploration: 'reasoning',\n  'Reducible uncertainty modeling across agent trajectories': 'reasoning',\n  'Environmental feedback reduces uncertainty at decision gates': 'reasoning',\n  'reinforcement-learning': 'reasoning',\n  transformer: 'reasoning',\n  ssm: 'reasoning',\n  'sparse-activation': 'reasoning',\n  'behavior-distillation': 'reasoning',\n  'training-free': 'reasoning',\n  'transfer-learning': 'reasoning',\n  'instruction-tuning': 'reasoning',\n  'Dense process rewards improve performance by 22%': 'reasoning',\n  'prompt-optimization': 'reasoning',\n};\n\n/**\n * Normalize a free-form topic string to a canonical topic.\n * Returns the canonical topic if a mapping exists, otherwise the original string.\n */\nexport function normalizeTopicToCanonical(topic: string): string {\n  return TOPIC_ALIASES[topic] ?? topic;\n}\n"],"mappings":";;;;;;;;AAUA,SAAS,SAAS;;;ACiCX,IAAM,+BAAsE,oBAAI,IAAI;AAAA;AAAA,EAEzF,CAAC,kBAAkB,EAAE,QAAQ,eAAe,MAAM,gCAAgC,CAAC;AAAA,EACnF,CAAC,kBAAkB,EAAE,QAAQ,eAAe,MAAM,gCAAgC,CAAC;AAAA,EACnF;AAAA,IACE;AAAA,IACA,EAAE,QAAQ,eAAe,MAAM,6CAA6C;AAAA,EAC9E;AAAA,EACA;AAAA,IACE;AAAA,IACA,EAAE,QAAQ,eAAe,MAAM,6CAA6C;AAAA,EAC9E;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA,CAAC,qBAAqB,EAAE,QAAQ,eAAe,MAAM,0CAA0C,CAAC;AAAA,EAChG;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA,CAAC,wBAAwB,EAAE,QAAQ,eAAe,MAAM,gCAAgC,CAAC;AAAA,EACzF;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA,EAAE,QAAQ,eAAe,MAAM,oCAAoC;AAAA,EACrE;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA,CAAC,sBAAsB,EAAE,QAAQ,eAAe,MAAM,sBAAsB,CAAC;AAAA,EAC7E,CAAC,mBAAmB,EAAE,QAAQ,eAAe,MAAM,sBAAsB,CAAC;AAAA,EAC1E,CAAC,uBAAuB,EAAE,QAAQ,eAAe,MAAM,qCAAqC,CAAC;AAAA,EAC7F;AAAA,IACE;AAAA,IACA,EAAE,QAAQ,eAAe,MAAM,qCAAqC;AAAA,EACtE;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA,EAAE,QAAQ,WAAW,MAAM,uBAAuB,MAAM,sCAAsC;AAAA,EAChG;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA,CAAC,mBAAmB,EAAE,QAAQ,eAAe,MAAM,mBAAmB,CAAC;AAAA,EACvE,CAAC,yBAAyB,EAAE,QAAQ,eAAe,MAAM,gBAAgB,CAAC;AAAA,EAC1E;AAAA,IACE;AAAA,IACA,EAAE,QAAQ,WAAW,MAAM,WAAW,MAAM,4CAA4C;AAAA,EAC1F;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA,CAAC,qBAAqB,EAAE,QAAQ,eAAe,MAAM,kBAAkB,CAAC;AAAA,EACxE,CAAC,2BAA2B,EAAE,QAAQ,eAAe,MAAM,iBAAiB,CAAC;AAAA,EAC7E;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA,CAAC,qBAAqB,EAAE,QAAQ,eAAe,MAAM,sCAAsC,CAAC;AAAA,EAC5F;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA,EAAE,QAAQ,eAAe,MAAM,4CAA4C;AAAA,EAC7E;AAAA,EACA,CAAC,6BAA6B,EAAE,QAAQ,eAAe,MAAM,6BAA6B,CAAC;AAAA,EAC3F,CAAC,wBAAwB,EAAE,QAAQ,eAAe,MAAM,yBAAyB,CAAC;AAAA,EAClF;AAAA,IACE;AAAA,IACA,EAAE,QAAQ,eAAe,MAAM,gDAAgD;AAAA,EACjF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA,CAAC,uBAAuB,EAAE,QAAQ,eAAe,MAAM,sCAAsC,CAAC;AAAA;AAAA,EAG9F,CAAC,4BAA4B,EAAE,QAAQ,eAAe,MAAM,mCAAmC,CAAC;AAAA,EAChG;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EACA;AAAA,IACE;AAAA,IACA;AAAA,MACE,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AACF,CAAC;AAOM,IAAM,yBAAiD;AAAA,EAC5D;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,IACb,YAAY,CAAC,qBAAqB,iBAAiB;AAAA,EACrD;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,IACb,YAAY,CAAC,2BAA2B,0BAA0B;AAAA,EACpE;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,IACb,YAAY,CAAC,2BAA2B,kBAAkB;AAAA,EAC5D;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,IACb,YAAY,CAAC,kBAAkB,8BAA8B,mBAAmB;AAAA,EAClF;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,IACb,YAAY,CAAC,qBAAqB,mBAAmB,qBAAqB;AAAA,EAC5E;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,IACb,YAAY,CAAC,wBAAwB,gBAAgB;AAAA,EACvD;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,IACb,YAAY,CAAC,oBAAoB,uBAAuB;AAAA,EAC1D;AAAA,EACA,EAAE,QAAQ,sBAAsB,cAAc,QAAQ,aAAa,wBAAwB;AAAA,EAC3F,EAAE,QAAQ,0BAA0B,cAAc,QAAQ,aAAa,sBAAsB;AAAA,EAC7F;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAAA,EACA,EAAE,QAAQ,mBAAmB,cAAc,QAAQ,aAAa,oBAAoB;AAAA,EACpF;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AACF;;;ACvZO,IAAM,gBAAkD;AAAA;AAAA,EAE7D,QAAQ;AAAA,EACR,oBAAoB;AAAA,EACpB,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,mBAAmB;AAAA,EACnB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,mDAAmD;AAAA,EACnD,uBAAuB;AAAA;AAAA,EAGvB,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,eAAe;AAAA,EACf,SAAS;AAAA,EACT,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,qBAAqB;AAAA,EACrB,uBAAuB;AAAA,EACvB,sBAAsB;AAAA,EACtB,mBAAmB;AAAA,EACnB,wBAAwB;AAAA,EACxB,qDAAqD;AAAA,EACrD,oCAAoC;AAAA,EACpC,wDAAwD;AAAA,EACxD,6BAA6B;AAAA,EAC7B,gBAAgB;AAAA,EAChB,yBAAyB;AAAA,EACzB,eAAe;AAAA,EACf,qBAAqB;AAAA,EACrB,0BAA0B;AAAA,EAC1B,2BAA2B;AAAA,EAC3B,mBAAmB;AAAA,EACnB,KAAK;AAAA,EACL,mBAAmB;AAAA,EACnB,UAAU;AAAA,EACV,SAAS;AAAA,EACT,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,UAAU;AAAA,EACV,qBAAqB;AAAA,EACrB,yBAAyB;AAAA,EACzB,mBAAmB;AAAA,EACnB,cAAc;AAAA,EACd,iBAAiB;AAAA,EACjB,aAAa;AAAA;AAAA,EAGb,sBAAsB;AAAA,EACtB,uBAAuB;AAAA,EACvB,mBAAmB;AAAA,EACnB,aAAa;AAAA,EACb,YAAY;AAAA,EACZ,gBAAgB;AAAA,EAChB,oBAAoB;AAAA,EACpB,mBAAmB;AAAA,EACnB,gBAAgB;AAAA,EAChB,uBAAuB;AAAA,EACvB,kBAAkB;AAAA,EAClB,qBAAqB;AAAA,EACrB,0BAA0B;AAAA,EAC1B,sBAAsB;AAAA,EACtB,uBAAuB;AAAA,EACvB,mBAAmB;AAAA,EACnB,iBAAiB;AAAA,EACjB,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,oBAAoB;AAAA,EACpB,mBAAmB;AAAA,EACnB,QAAQ;AAAA,EACR,sBAAsB;AAAA,EACtB,uBAAuB;AAAA,EACvB,cAAc;AAAA,EACd,0BAA0B;AAAA,EAC1B,oBAAoB;AAAA,EACpB,cAAc;AAAA,EACd,gBAAgB;AAAA,EAChB,aAAa;AAAA,EACb,WAAW;AAAA,EACX,6CAA6C;AAAA,EAC7C,qCAAqC;AAAA,EACrC,+BAA+B;AAAA,EAC/B,KAAK;AAAA,EACL,kCAAkC;AAAA,EAClC,KAAK;AAAA,EACL,gBAAgB;AAAA,EAChB,KAAK;AAAA,EACL,KAAK;AAAA,EACL,YAAY;AAAA,EACZ,eAAe;AAAA,EACf,kBAAkB;AAAA,EAClB,YAAY;AAAA;AAAA,EAGZ,eAAe;AAAA,EACf,cAAc;AAAA,EACd,eAAe;AAAA,EACf,wBAAwB;AAAA,EACxB,aAAa;AAAA,EACb,oBAAoB;AAAA,EACpB,iBAAiB;AAAA,EACjB,cAAc;AAAA,EACd,qBAAqB;AAAA,EACrB,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,0BAA0B;AAAA,EAC1B,8BAA8B;AAAA,EAC9B,sBAAsB;AAAA;AAAA,EAGtB,KAAK;AAAA,EACL,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,oBAAoB;AAAA,EACpB,0BAA0B;AAAA,EAC1B,WAAW;AAAA,EACX,WAAW;AAAA,EACX,aAAa;AAAA;AAAA,EAGb,eAAe;AAAA,EACf,uBAAuB;AAAA,EACvB,6BAA6B;AAAA,EAC7B,6BAA6B;AAAA,EAC7B,6BAA6B;AAAA,EAC7B,4BAA4B;AAAA,EAC5B,4BAA4B;AAAA,EAC5B,+BAA+B;AAAA,EAC/B,2BAA2B;AAAA,EAC3B,kBAAkB;AAAA,EAClB,cAAc;AAAA,EACd,aAAa;AAAA,EACb,eAAe;AAAA,EACf,uBAAuB;AAAA,EACvB,sBAAsB;AAAA,EACtB,0BAA0B;AAAA,EAC1B,sBAAsB;AAAA,EACtB,2BAA2B;AAAA,EAC3B,aAAa;AAAA,EACb,cAAc;AAAA,EACd,QAAQ;AAAA,EACR,yBAAyB;AAAA,EACzB,uBAAuB;AAAA,EACvB,uBAAuB;AAAA,EACvB,eAAe;AAAA,EACf,gBAAgB;AAAA,EAChB,eAAe;AAAA,EACf,wBAAwB;AAAA,EACxB,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,MAAM;AAAA,EACN,KAAK;AAAA,EACL,YAAY;AAAA,EACZ,YAAY;AAAA,EACZ,QAAQ;AAAA,EACR,uBAAuB;AAAA,EACvB,SAAS;AAAA;AAAA,EAGT,4BAA4B;AAAA,EAC5B,wBAAwB;AAAA,EACxB,kBAAkB;AAAA,EAClB,YAAY;AAAA,EACZ,uBAAuB;AAAA,EACvB,iBAAiB;AAAA;AAAA,EAGjB,WAAW;AAAA,EACX,cAAc;AAAA,EACd,QAAQ;AAAA,EACR,0CAA0C;AAAA,EAC1C,sBAAsB;AAAA,EACtB,kBAAkB;AAAA,EAClB,2BAA2B;AAAA,EAC3B,mBAAmB;AAAA,EACnB,oBAAoB;AAAA,EACpB,oBAAoB;AAAA,EACpB,UAAU;AAAA,EACV,eAAe;AAAA,EACf,aAAa;AAAA,EACb,mBAAmB;AAAA,EACnB,YAAY;AAAA,EACZ,kBAAkB;AAAA,EAClB,MAAM;AAAA;AAAA,EAGN,kBAAkB;AAAA,EAClB,qBAAqB;AAAA,EACrB,qBAAqB;AAAA,EACrB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,mBAAmB;AAAA,EACnB,MAAM;AAAA,EACN,mBAAmB;AAAA,EACnB,mBAAmB;AAAA,EACnB,eAAe;AAAA,EACf,OAAO;AAAA,EACP,qBAAqB;AAAA,EACrB,UAAU;AAAA,EACV,iBAAiB;AAAA,EACjB,qBAAqB;AAAA,EACrB,WAAW;AAAA;AAAA,EAGX,mBAAmB;AAAA,EACnB,eAAe;AAAA,EACf,kBAAkB;AAAA,EAClB,cAAc;AAAA,EACd,MAAM;AAAA,EACN,WAAW;AAAA,EACX,WAAW;AAAA,EACX,iBAAiB;AAAA;AAAA,EAGjB,YAAY;AAAA,EACZ,iDAAiD;AAAA,EACjD,6BAA6B;AAAA,EAC7B,mBAAmB;AAAA,EACnB,mDAAmD;AAAA;AAAA,EAGnD,aAAa;AAAA,EACb,qBAAqB;AAAA,EACrB,qBAAqB;AAAA,EACrB,0BAA0B;AAAA,EAC1B,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,oBAAoB;AAAA,EACpB,aAAa;AAAA,EACb,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,0BAA0B;AAAA,EAC1B,iBAAiB;AAAA,EACjB,SAAS;AAAA,EACT,WAAW;AAAA,EACX,0BAA0B;AAAA,EAC1B,aAAa;AAAA,EACb,aAAa;AAAA,EACb,4DAA4D;AAAA,EAC5D,gEAAgE;AAAA,EAChE,0BAA0B;AAAA,EAC1B,aAAa;AAAA,EACb,KAAK;AAAA,EACL,qBAAqB;AAAA,EACrB,yBAAyB;AAAA,EACzB,iBAAiB;AAAA,EACjB,qBAAqB;AAAA,EACrB,sBAAsB;AAAA,EACtB,oDAAoD;AAAA,EACpD,uBAAuB;AACzB;AAMO,SAAS,0BAA0B,OAAuB;AAC/D,SAAO,cAAc,KAAK,KAAK;AACjC;;;AFnNO,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACzB,gBAAgB,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC;AAClD,CAAC;AAuFD,IAAM,iCAAiC;AAGvC,IAAM,8BAA8B;AAapC,eAAsB,mBACpB,aACkD;AAClD,QAAM,iBAAiB,MAAM,mBAAmB;AAChD,MAAI,CAAC,eAAe,IAAI;AACtB,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,OAAO;AAAA,QACL,MAAM;AAAA,QACN,SAAS,0BAA0B,gBAAgB,eAAe,KAAK,CAAC;AAAA,MAC1E;AAAA,IACF;AAAA,EACF;AAEA,QAAM,SAAS,cAAc,eAAe,KAAK;AACjD,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,OAAO,EAAE,MAAM,aAAa,SAAS,8BAA8B;AAAA,IACrE;AAAA,EACF;AAEA,QAAM,WAAW,aAAa,MAAM;AACpC,QAAM,WACJ,gBAAgB,SAAY,SAAS,OAAO,CAAC,MAAM,EAAE,UAAU,WAAW,IAAI;AAEhF,QAAM,YAAY,SAAS,IAAI,iBAAiB;AAChD,QAAM,eAAe,uBAAuB,QAAQ;AACpD,QAAM,mBAAmB,sBAAsB,SAAS;AACxD,QAAM,eAAe,wBAAwB;AAE7C,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,OAAO;AAAA,MACL,UAAU;AAAA,MACV,aAAa,OAAO;AAAA,MACpB,YAAY,SAAS;AAAA,MACrB,oBAAoB;AAAA,MACpB;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;AAUA,SAAS,UAAU,OAAoC;AAErD,MAAI,UAAU,QAAQ,UAAU,OAAW,QAAO,CAAC;AACnD,SAAO,MAAM,KAAK,KAAK;AACzB;AAIA,SAAS,eAAe,GAAyD;AAC/E,MAAI,OAAO,EAAE,QAAQ,YAAY,EAAE,IAAI,SAAS,EAAG,QAAO,EAAE;AAC5D,MAAI,OAAO,EAAE,aAAa,YAAY,EAAE,SAAS,SAAS,EAAG,QAAO,SAAS,EAAE,QAAQ;AACvF,SAAO;AACT;AAEA,SAAS,cAAc,UAA4C;AACjE,SAAO,OAAO,QAAQ,SAAS,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM;AACtD,UAAM,YAAY,eAAe,CAAC;AAClC,WAAO;AAAA,MACL;AAAA,MACA,OAAO,EAAE;AAAA,MACT,QAAQ,UAAU,EAAE,MAAM;AAAA,MAC1B,MAAM,UAAU,EAAE,IAAI;AAAA,MACtB,SAAS,EAAE,QAAQ,KAAK;AAAA,MACxB,aAAa,UAAU,EAAE,YAAY;AAAA,MACrC,WAAW,EAAE;AAAA,MACb,sBAAsB,EAAE;AAAA,MACxB,qBAAqB,UAAU,EAAE,oBAAoB;AAAA,MACrD,cAAc,EAAE,iBAAiB;AAAA,MACjC,cAAc,EAAE,iBAAiB;AAAA;AAAA,MAEjC,GAAI,cAAc,SAAY,EAAE,UAAU,IAAI,CAAC;AAAA,MAC/C,GAAI,OAAO,EAAE,qBAAqB,WAAW,EAAE,iBAAiB,EAAE,iBAAiB,IAAI,CAAC;AAAA,IAC1F;AAAA,EACF,CAAC;AACH;AAOA,SAAS,aAAa,QAAmD;AACvE,QAAM,WAAW,oBAAI,IAA8B;AAEnD,aAAW,SAAS,QAAQ;AAC1B,eAAW,YAAY,MAAM,QAAQ;AACnC,YAAM,QAAQ,0BAA0B,QAAQ;AAChD,YAAM,WAAW,SAAS,IAAI,KAAK;AACnC,UAAI,aAAa,QAAW;AAC1B,iBAAS,KAAK,KAAK;AAAA,MACrB,OAAO;AACL,iBAAS,IAAI,OAAO,CAAC,KAAK,CAAC;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAEA,QAAM,WAA2B,CAAC;AAClC,aAAW,CAAC,OAAO,cAAc,KAAK,UAAU;AAE9C,UAAM,cAAc,CAAC,GAAG,cAAc,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,eAAe,EAAE,YAAY;AACtF,aAAS,KAAK;AAAA,MACZ;AAAA,MACA,QAAQ;AAAA,MACR,YAAY,YAAY;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,SAAO,SAAS,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAC5D;AAQA,SAAS,sBAAsB,QAAwD;AACrF,QAAM,SAAS,OAAO,IAAI,CAAC,MAAM,EAAE,YAAY;AAC/C,QAAM,aAAa,OAAO,OAAO,CAAC,KAAK,MAAM,MAAM,GAAG,CAAC;AACvD,SAAO;AAAA,IACL,UAAU,OAAO,SAAS,IAAI,KAAK,MAAO,aAAa,OAAO,SAAU,EAAE,IAAI,KAAK;AAAA,IACnF,MAAM,OAAO,OAAO,CAAC,MAAM,EAAE,iBAAiB,MAAM,EAAE;AAAA,IACtD,QAAQ,OAAO,OAAO,CAAC,MAAM,EAAE,iBAAiB,QAAQ,EAAE;AAAA,IAC1D,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,iBAAiB,KAAK,EAAE;AAAA,EACtD;AACF;AAEA,SAAS,kBAAkB,SAAyC;AAClE,QAAM,UAAU,mBAAmB,QAAQ,OAAO,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC7E,QAAM,gBAAgB;AAAA,IACpB,QAAQ,OAAO,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,mBAAmB,CAAC;AAAA,EAC1D;AAGA,QAAM,eAAe,CAAC,GAAG,QAAQ,QAAQ,CAAC,EACvC,OAAO,CAAC,CAAC,EAAE,KAAK,MAAM,SAAS,8BAA8B,EAC7D,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,IAAI,CAAC,CAAC,GAAG,MAAM,GAAG;AAGrB,QAAM,aAAa,CAAC,GAAG,cAAc,QAAQ,CAAC,EAC3C,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,IAAI,CAAC,CAAC,MAAM,KAAK,MAAO,QAAQ,IAAI,GAAG,IAAI,KAAK,OAAO,KAAK,CAAC,aAAa,IAAK;AAGlF,QAAM,aAAa,QAAQ,OACxB,OAAO,CAAC,MAAM,EAAE,yBAAyB,aAAa,EACtD,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,mBAAmB,CAAC;AAC5C,QAAM,sBAAsB,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC;AAGnD,QAAM,OAAiB,CAAC;AACxB,MAAI,QAAQ,eAAe,GAAG;AAC5B,SAAK,KAAK,+CAA0C,QAAQ,KAAK,EAAE;AAAA,EACrE;AACA,QAAM,6BAA6B,QAAQ,OAAO;AAAA,IAChD,CAAC,MAAM,EAAE,cAAc,UAAU,EAAE,yBAAyB;AAAA,EAC9D;AACA,MAAI,2BAA2B,SAAS,GAAG;AACzC,SAAK;AAAA,MACH,GAAG,OAAO,2BAA2B,MAAM,CAAC;AAAA,IAC9C;AAAA,EACF;AAGA,QAAM,eAAe,CAAC,GAAG,cAAc,KAAK,CAAC;AAC7C,QAAM,oBAAoB,wBAAwB,YAAY;AAE9D,QAAM,sBAAsB,sBAAsB,QAAQ,MAAM;AAGhE,MAAI,oBAAoB,MAAM,oBAAoB,OAAO,oBAAoB,QAAQ;AACnF,SAAK;AAAA,MACH,+BAA+B,OAAO,oBAAoB,GAAG,CAAC,IAAI,OAAO,QAAQ,UAAU,CAAC;AAAA,IAC9F;AAAA,EACF;AAEA,SAAO;AAAA,IACL,GAAG,cAAc,QAAQ,MAAM;AAAA,IAC/B,OAAO,QAAQ;AAAA,IACf,YAAY,QAAQ;AAAA,IACpB,QAAQ,QAAQ,OAAO,IAAI,UAAU;AAAA,IACrC;AAAA,IACA;AAAA,IACA,6BAA6B;AAAA,IAC7B;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAGA,IAAM,uBAAuB;AAQ7B,SAAS,cAAc,QAGrB;AACA,QAAM,MAAM,kBAAkB,MAAM;AACpC,SAAO,EAAE,aAAa,IAAI,MAAM,GAAG,oBAAoB,GAAG,eAAe,IAAI,OAAO;AACtF;AAGA,SAAS,uBAAuB,UAA6C;AAC3E,QAAM,cAAc,oBAAI,IAAyB;AAEjD,aAAW,WAAW,UAAU;AAC9B,eAAW,SAAS,QAAQ,QAAQ;AAClC,iBAAW,OAAO,MAAM,MAAM;AAC5B,cAAM,WAAW,YAAY,IAAI,GAAG;AACpC,YAAI,aAAa,QAAW;AAC1B,mBAAS,IAAI,QAAQ,KAAK;AAAA,QAC5B,OAAO;AACL,sBAAY,IAAI,KAAK,oBAAI,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC;AAAA,QAC/C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,YAAY,QAAQ,CAAC,EAC7B,OAAO,CAAC,CAAC,EAAE,MAAM,MAAM,OAAO,QAAQ,2BAA2B,EACjE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EACpC,IAAI,CAAC,CAAC,KAAK,MAAM,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,MAAM,EAAE,KAAK,IAAI,CAAC,GAAG;AACvE;AAOA,SAAS,wBAAwB,YAAqD;AACpF,QAAM,aAAmC,CAAC;AAE1C,aAAW,QAAQ,YAAY;AAE7B,UAAM,WAAW,KAAK,QAAQ,yBAAyB,EAAE;AACzD,UAAM,UAAU,6BAA6B,IAAI,QAAQ;AAEzD,QAAI,YAAY,QAAW;AACzB,iBAAW,KAAK;AAAA,QACd,WAAW;AAAA,QACX,QAAQ,QAAQ;AAAA,QAChB,eAAe,QAAQ;AAAA,QACvB,GAAI,QAAQ,SAAS,SAAY,EAAE,iBAAiB,QAAQ,KAAK,IAAI,CAAC;AAAA,MACxE,CAAC;AAAA,IACH,OAAO;AACL,iBAAW,KAAK,EAAE,WAAW,UAAU,QAAQ,cAAc,CAAC;AAAA,IAChE;AAAA,EACF;AAEA,SAAO;AACT;AAGA,SAAS,sBAAsB,UAAyD;AACtF,QAAM,gBAAgB,SAAS,QAAQ,CAAC,MAAM,EAAE,iBAAiB;AACjE,QAAM,cAAc,cAAc,OAAO,CAAC,MAAM,EAAE,WAAW,aAAa,EAAE;AAC5E,QAAM,UAAU,cAAc,OAAO,CAAC,MAAM,EAAE,WAAW,SAAS,EAAE;AACpE,QAAM,aAAa,cAAc,OAAO,CAAC,MAAM,EAAE,WAAW,aAAa,EAAE;AAG3E,QAAM,gBAAgB,cACnB,OAAO,CAAC,MAAM,EAAE,WAAW,aAAa,EAAE,oBAAoB,MAAS,EACvE,IAAI,CAAC,MAAM,GAAG,EAAE,SAAS,KAAK,EAAE,mBAAmB,EAAE,EAAE,EACvD,MAAM,GAAG,EAAE;AAEd,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,cAAc;AAAA,IACrB,kBAAkB;AAAA,EACpB;AACF;AAGA,SAAS,0BAA+C;AACtD,SAAO,uBAAuB,IAAI,CAAC,OAAO;AAAA,IACxC,QAAQ,EAAE;AAAA,IACV,cAAc,EAAE;AAAA,IAChB,aAAa,EAAE;AAAA,IACf,sBAAsB,EAAE,YAAY,UAAU;AAAA,EAChD,EAAE;AACJ;AAMA,SAAS,mBAAmB,OAA+C;AACzE,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,QAAQ,OAAO;AACxB,WAAO,IAAI,OAAO,OAAO,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,EAC9C;AACA,SAAO;AACT;AAGA,SAAS,WAAW,GAAsC;AACxD,SAAO;AAAA,IACL,IAAI,EAAE;AAAA,IACN,OAAO,EAAE;AAAA,IACT,GAAI,EAAE,cAAc,SAAY,EAAE,WAAW,EAAE,UAAU,IAAI,CAAC;AAAA,EAChE;AACF;AAUA,SAAS,kBAAkB,QAAwD;AACjF,QAAM,eAAe,oBAAI,IAA8D;AACvF,aAAW,SAAS,QAAQ;AAC1B,eAAW,WAAW,MAAM,aAAa;AACvC,YAAM,aAAa,QAAQ,YAAY,EAAE,KAAK;AAC9C,UAAI,WAAW,WAAW,EAAG;AAC7B,YAAM,WAAW,aAAa,IAAI,UAAU;AAC5C,UAAI,aAAa,QAAW;AAC1B,iBAAS,eAAe,IAAI,MAAM,EAAE;AAAA,MACtC,OAAO;AACL,qBAAa,IAAI,YAAY;AAAA,UAC3B,SAAS;AAAA,UACT,gBAAgB,oBAAI,IAAI,CAAC,MAAM,EAAE,CAAC;AAAA,QACpC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AACA,SAAO,CAAC,GAAG,aAAa,OAAO,CAAC,EAAE;AAAA,IAAI,CAAC,MACrC,wBAAwB,MAAM,EAAE,SAAS,EAAE,SAAS,gBAAgB,CAAC,GAAG,EAAE,cAAc,EAAE,CAAC;AAAA,EAC7F;AACF;","names":[]}

package/dist/{chunk-DGLAEH7Y.js → chunk-R3H46BNY.js}

@@ -4,7 +4,7 @@ import {
   getErrorMessage,
   getTimeProvider,
   ok
-} from "./chunk-2SVIHHNJ.js";
+} from "./chunk-OYFKB64X.js";
 
 // src/context/session-memory.ts
 import * as fs from "fs";
@@ -352,4 +352,4 @@ export {
   SessionMemory,
   createSessionMemory
 };
-//# sourceMappingURL=chunk-DGLAEH7Y.js.map
+//# sourceMappingURL=chunk-R3H46BNY.js.map

package/dist/{chunk-N5W3GATS.js → chunk-TXCJMTLN.js}

@@ -1,6 +1,6 @@
 import {
   readOpenAICompatEnv
-} from "./chunk-RE2GYZRK.js";
+} from "./chunk-GGQOP4VK.js";
 import {
   allOf
 } from "./chunk-OQB3XC5O.js";
@@ -10,10 +10,10 @@ import {
 import {
   createAllAdapters,
   probeCli
-} from "./chunk-JM42KPWJ.js";
+} from "./chunk-EPZCODRK.js";
 import {
   getNexusTmpDir
-} from "./chunk-RQV5ZUXT.js";
+} from "./chunk-4OW67KT2.js";
 import {
   DEFAULT_CAPABILITIES,
   colors,
@@ -25,20 +25,20 @@ import {
   ok,
   symbols,
   writeLine
-} from "./chunk-2SVIHHNJ.js";
+} from "./chunk-OYFKB64X.js";
 import {
   getLearningDir,
   getOutcomesFile,
   getRulesFile,
   isPersistenceEnabled
-} from "./chunk-HHLCAWAV.js";
+} from "./chunk-GBHJ37V3.js";
 import {
   detectSandbox,
   getNexusDataDir,
   getNexusRepoDir,
   getPerRepoSubdirs,
   nexusDataPath
-} from "./chunk-NBMWONHE.js";
+} from "./chunk-OGHEKPLD.js";
 
 // src/cli/setup-data-dir.ts
 import { mkdirSync, existsSync as existsSync3 } from "fs";
@@ -170,7 +170,7 @@ import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
 import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
 
 // src/version.ts
-var VERSION = true ? "4.22.3" : "dev";
+var VERSION = true ? "4.23.0" : "dev";
 
 // src/mcp/task-store.ts
 import { InMemoryTaskStore } from "@modelcontextprotocol/sdk/experimental/tasks";
@@ -1201,13 +1201,13 @@ async function runDoctorFix(result) {
   writeLine2("\u2500".repeat(40));
   let fixCount = 0;
   if (!result.dataDirectory.rootExists || result.dataDirectory.subdirectories.some((d) => !d.exists || !d.writable)) {
-    const { initDataDirectories: initDataDirectories2, describeDataDirFix: describeDataDirFix2 } = await import("./setup-data-dir-XPXP3KIZ.js");
+    const { initDataDirectories: initDataDirectories2, describeDataDirFix: describeDataDirFix2 } = await import("./setup-data-dir-KHLK534F.js");
     const outcome = describeDataDirFix2(initDataDirectories2());
     writeLine2(outcome.line);
     if (outcome.counted) fixCount++;
   }
   if (!result.configFile.found) {
-    const { runConfigInitSync } = await import("./setup-config-O7LHHD42.js");
+    const { runConfigInitSync } = await import("./setup-config-WW5BNLVS.js");
     const configResult = runConfigInitSync(process.cwd(), false, false);
     if (configResult.success && configResult.created) {
       writeLine2(`\u2713 Generated config: ${configResult.path}`);
@@ -1304,4 +1304,4 @@ export {
   startStdioServer,
   closeServer
 };
-//# sourceMappingURL=chunk-N5W3GATS.js.map
+//# sourceMappingURL=chunk-TXCJMTLN.js.map

package/dist/{chunk-CBORIR4Y.js → chunk-WJGTRYWS.js}

@@ -13,7 +13,7 @@ import {
   lookupInTreeCapability,
   ok,
   resolveRetryAfterMs
-} from "./chunk-2SVIHHNJ.js";
+} from "./chunk-OYFKB64X.js";
 
 // src/config/model-parameter-support.ts
 function parseClaudeMajorMinor(bareId) {
@@ -834,4 +834,4 @@ export {
   DEFAULT_COLLECT_STREAM_MAX_CHUNKS,
   collectStream
 };
-//# sourceMappingURL=chunk-CBORIR4Y.js.map
+//# sourceMappingURL=chunk-WJGTRYWS.js.map

package/dist/{chunk-W2DYH4WL.js → chunk-XQEWXGJ5.js}

@@ -1,7 +1,7 @@
 import {
   computeCostDetail,
   priceBasisOf
-} from "./chunk-TBXAEAKP.js";
+} from "./chunk-AWMXPIMK.js";
 import {
   allOf
 } from "./chunk-OQB3XC5O.js";
@@ -22,22 +22,22 @@ import {
   toolSuccess,
   withProgressHeartbeat,
   wrapToolWithTimeout
-} from "./chunk-D6ZTSN34.js";
+} from "./chunk-LSJ2EPOF.js";
 import {
   assessPanelIndependence,
   countDistinctModels,
   createEvent,
   getGlobalRegistry
-} from "./chunk-V533P6BT.js";
+} from "./chunk-IC6WLIGJ.js";
 import {
   getToolMemory
-} from "./chunk-EU7S5CDW.js";
+} from "./chunk-ADC7YEU2.js";
 import {
   authRemediation,
   delay,
   getAvailableClis,
   withTimeout
-} from "./chunk-JM42KPWJ.js";
+} from "./chunk-EPZCODRK.js";
 import {
   AgentError,
   CLI_NAMES,
@@ -65,16 +65,16 @@ import {
   registerPersistentOutcomeStoreFactory,
   resolveClassGuardMs,
   resolveVoteTimeout
-} from "./chunk-2SVIHHNJ.js";
+} from "./chunk-OYFKB64X.js";
 import {
   ensureLearningDir,
   getOutcomesFile
-} from "./chunk-HHLCAWAV.js";
+} from "./chunk-GBHJ37V3.js";
 import {
   getNexusDataDir,
   nexusDataPath,
   nexusDataPathEnsure
-} from "./chunk-NBMWONHE.js";
+} from "./chunk-OGHEKPLD.js";
 
 // src/mcp/tools/consensus-vote.ts
 import { z as z10 } from "zod";
@@ -6198,7 +6198,7 @@ async function processVotesWithCascade(engineVotes, opts) {
 var CONTRARIAN_ESCALATION_THRESHOLD = 0.8;
 async function runContrarianCheck(proposal, log) {
   try {
-    const { executeExpert } = await import("./expert-bridge-5MK4DOB7.js");
+    const { executeExpert } = await import("./expert-bridge-XN5MFZOG.js");
     const prompt = [
       "You are a contrarian analyst. Your job is to find reasons this proposal should be REJECTED.",
       "Look for: YAGNI (not needed), MISALIGNED (wrong tech/architecture), SECURITY_RISK, SCOPE_CREEP.",
@@ -6749,4 +6749,4 @@ export {
   CONSENSUS_VOTE_TOOL_SCHEMA,
   registerConsensusVoteTool
 };
-//# sourceMappingURL=chunk-W2DYH4WL.js.map
+//# sourceMappingURL=chunk-XQEWXGJ5.js.map

package/dist/{chunk-PSXX2GBZ.js → chunk-YFDE4AM3.js}

@@ -1,11 +1,11 @@
 import {
   resolveCliSlot
-} from "./chunk-RMTTKP4L.js";
+} from "./chunk-CMZGRDKF.js";
 import {
   createLogger,
   getTimeProvider,
   isRateLimitText
-} from "./chunk-2SVIHHNJ.js";
+} from "./chunk-OYFKB64X.js";
 
 // src/pipeline/expert-bridge.ts
 function resolveCliFromModelString(model) {
@@ -21,7 +21,7 @@ async function getMcpConfigPath() {
   if (cachedMcpConfigPath !== null) return cachedMcpConfigPath;
   mcpConfigInitPromise ??= (async () => {
     try {
-      const { generateMcpConfig } = await import("./child-mcp-config-Y3QSDCYI.js");
+      const { generateMcpConfig } = await import("./child-mcp-config-FEK2HK5L.js");
       const config = await generateMcpConfig();
       cachedMcpConfigPath = config.configPath;
       cachedMcpConfigCleanup = config.cleanup;
@@ -93,8 +93,8 @@ var routerInitPromise = null;
 async function getRouter() {
   if (cachedRouter !== null) return cachedRouter;
   routerInitPromise ??= (async () => {
-    const { createAllAdapters } = await import("./factory-6FNJM6P3.js");
-    const { createCompositeRouter } = await import("./composite-router-CCDCVYTY.js");
+    const { createAllAdapters } = await import("./factory-GVBBWUOE.js");
+    const { createCompositeRouter } = await import("./composite-router-4F3ZVLJV.js");
     const adapters = createAllAdapters();
     if (adapters.size === 0) {
       routerInitPromise = null;
@@ -102,7 +102,7 @@ async function getRouter() {
     }
     cachedRouter = adaptCompositeRouter(createCompositeRouter(adapters));
     try {
-      const { createCliCircuitBreakerIntegration } = await import("./cli-circuit-breaker-T2IKLJVA.js");
+      const { createCliCircuitBreakerIntegration } = await import("./cli-circuit-breaker-VUWP2GRN.js");
       cachedCircuitBreaker = createCliCircuitBreakerIntegration([...adapters.values()]);
     } catch (error) {
       const msg = error instanceof Error ? error.message : String(error);
@@ -213,4 +213,4 @@ export {
   tokenSplitFromUsage,
   executeExpert
 };
-//# sourceMappingURL=chunk-PSXX2GBZ.js.map
+//# sourceMappingURL=chunk-YFDE4AM3.js.map

package/dist/{chunk-P422WQJM.js → chunk-YVW743K3.js}

@@ -5,7 +5,7 @@ import {
   getErrorMessage,
   ok,
   parseBoolEnv
-} from "./chunk-2SVIHHNJ.js";
+} from "./chunk-OYFKB64X.js";
 
 // src/cli/research-helpers-io.ts
 import * as fs2 from "fs/promises";
@@ -156,4 +156,4 @@ export {
   loadPapersRegistry,
   savePapersRegistry
 };
-//# sourceMappingURL=chunk-P422WQJM.js.map
+//# sourceMappingURL=chunk-YVW743K3.js.map

package/dist/{chunk-XYWCZNFC.js → chunk-Z37OVF33.js}

@@ -2,7 +2,7 @@ import {
   createLogger,
   err,
   ok
-} from "./chunk-2SVIHHNJ.js";
+} from "./chunk-OYFKB64X.js";
 
 // src/scm/token-resolver.ts
 import { execFile } from "child_process";
@@ -87,4 +87,4 @@ export {
   hasToken,
   getTokenEnvVars
 };
-//# sourceMappingURL=chunk-XYWCZNFC.js.map
+//# sourceMappingURL=chunk-Z37OVF33.js.map

package/dist/{cli-circuit-breaker-T2IKLJVA.js → cli-circuit-breaker-VUWP2GRN.js}

@@ -3,10 +3,10 @@ import {
   createCliCircuitBreakerIntegration,
   getCliCircuitBreakerSnapshot,
   getDefaultCliCircuitBreakerRegistry
-} from "./chunk-SBLLJXJO.js";
-import "./chunk-2SVIHHNJ.js";
-import "./chunk-HHLCAWAV.js";
-import "./chunk-NBMWONHE.js";
+} from "./chunk-5KKJKQVE.js";
+import "./chunk-OYFKB64X.js";
+import "./chunk-GBHJ37V3.js";
+import "./chunk-OGHEKPLD.js";
 import "./chunk-ZPWHCABL.js";
 export {
   CliCircuitBreakerIntegration,
@@ -14,4 +14,4 @@ export {
   getCliCircuitBreakerSnapshot,
   getDefaultCliCircuitBreakerRegistry
 };
-//# sourceMappingURL=cli-circuit-breaker-T2IKLJVA.js.map
+//# sourceMappingURL=cli-circuit-breaker-VUWP2GRN.js.map