@remnic/core 9.63.8 → 9.63.10

package/dist/{chunk-LTYH2L6E.js → chunk-SILX74CP.js}

@@ -12,16 +12,16 @@ import {
 } from "./chunk-3HSRWJTC.js";
 import {
   handleSupportPassportOwnerHttp
-} from "./chunk-O52TB5SL.js";
+} from "./chunk-SAWGVTCE.js";
 import {
   buildSupportPassportPublicRequestHandler
-} from "./chunk-N7V3P4V5.js";
+} from "./chunk-H5VDBZLZ.js";
 import {
   nonEmptyQueryParam,
   optionalNamespaceKindQueryParam,
   optionalQueryString,
   positiveIntQueryParam
-} from "./chunk-JPWSYHLB.js";
+} from "./chunk-YGSDWO3U.js";
 import {
   EngramMcpServer,
   MCP_SUPPORTED_PROTOCOL_VERSIONS,
@@ -31,13 +31,13 @@ import {
   processChatMessage,
   sessionBelongsToPrincipal,
   subscribeChatTranscript
-} from "./chunk-PQHNZ63P.js";
+} from "./chunk-JJ45UTNT.js";
 import {
   RelayMissionStoreError
-} from "./chunk-5TF5STAV.js";
+} from "./chunk-K477BTF4.js";
 import {
   validateRequest
-} from "./chunk-DGUVXXAU.js";
+} from "./chunk-XFJUPJD7.js";
 import {
   executeResolution,
   isValidResolutionVerb
@@ -61,12 +61,12 @@ import {
   authorizationProbeNamespaces,
   authorizationProbeRequiresPrincipalNamespace,
   probeOperationAuthorization
-} from "./chunk-PHKU6BZ2.js";
+} from "./chunk-R7FQQQ23.js";
 import {
   CorrectionContractError,
   getOperation,
   resolveQueryNamespaceWritablePreflight
-} from "./chunk-BPQ7L27U.js";
+} from "./chunk-MIM7QT6H.js";
 import {
   isTrustZoneName
 } from "./chunk-5QZR2RA3.js";
@@ -3394,4 +3394,4 @@ export {
   resolveDefaultAdminConsolePublicDir,
   EngramAccessHttpServer
 };
-//# sourceMappingURL=chunk-LTYH2L6E.js.map
+//# sourceMappingURL=chunk-SILX74CP.js.map

package/dist/{chunk-MYI3RKI6.js → chunk-SYU5JOBQ.js}

@@ -1,6 +1,6 @@
 import {
   listNamespaces
-} from "./chunk-MIUL6AUZ.js";
+} from "./chunk-7ML7STOD.js";
 import {
   capabilityAllowsNamespace
 } from "./chunk-MZWSOLMT.js";
@@ -282,4 +282,4 @@ export {
   computeServiceCorpusWatermarks,
   computeServiceCorpusCensus
 };
-//# sourceMappingURL=chunk-MYI3RKI6.js.map
+//# sourceMappingURL=chunk-SYU5JOBQ.js.map

package/dist/{chunk-SY5JUJ2X.js → chunk-U5XC6DIS.js}

@@ -13,6 +13,9 @@ import {
 import {
   importSqlite
 } from "./chunk-PYHOAXTI.js";
+import {
+  backupMemoryDir
+} from "./chunk-OWHERGF2.js";
 import {
   exportJsonBundle
 } from "./chunk-UP6MOYCB.js";
@@ -25,18 +28,9 @@ import {
 import {
   importJsonBundle
 } from "./chunk-2DL3OFLD.js";
-import {
-  backupMemoryDir
-} from "./chunk-BXLOS5AJ.js";
 import {
   exportMarkdownBundle
 } from "./chunk-765K3SAT.js";
-import {
-  RoutingRulesStore
-} from "./chunk-TBUEE7XF.js";
-import {
-  WebDavServer
-} from "./chunk-PYIFUBRK.js";
 import {
   buildReplayNormalizerRegistry,
   clampBatchSize,
@@ -47,20 +41,26 @@ import {
   normalizeReplaySessionKey
 } from "./chunk-AJVLDJU6.js";
 import {
-  rebuildObservations
-} from "./chunk-DQTCGVFK.js";
+  RoutingRulesStore
+} from "./chunk-TBUEE7XF.js";
 import {
   TailscaleHelper
 } from "./chunk-EEC4PCG5.js";
 import {
-  migrateObservations
-} from "./chunk-IIFFC3RL.js";
+  WebDavServer
+} from "./chunk-PYIFUBRK.js";
 import {
-  rebuildMemoryLifecycleLedger
-} from "./chunk-Q6OL23WM.js";
+  rebuildObservations
+} from "./chunk-DQTCGVFK.js";
 import {
   archiveObservations
 } from "./chunk-YLBE6PLR.js";
+import {
+  migrateObservations
+} from "./chunk-IIFFC3RL.js";
+import {
+  rebuildMemoryLifecycleLedger
+} from "./chunk-Z4UPRZR6.js";
 import {
   getBulkImportSource,
   listBulkImportSources,
@@ -70,9 +70,6 @@ import {
 import {
   runCompatChecks
 } from "./chunk-CDKHKZL5.js";
-import {
-  searchVerifiedEpisodes
-} from "./chunk-XE2QCCT2.js";
 import {
   getUtilityLearningStatus,
   learnUtilityPromotionWeights
@@ -81,15 +78,18 @@ import {
   getUtilityTelemetryStatus,
   recordUtilityTelemetryEvent
 } from "./chunk-6FC3IZ26.js";
+import {
+  searchVerifiedEpisodes
+} from "./chunk-BTBAHTQ5.js";
 import {
   ThreadingManager
 } from "./chunk-OJP3N7UK.js";
 import {
   promoteSemanticRuleFromMemory
-} from "./chunk-BRHKW7GY.js";
+} from "./chunk-4IIDTPSK.js";
 import {
   searchVerifiedSemanticRules
-} from "./chunk-3T6HIIKA.js";
+} from "./chunk-EHC3FIJ4.js";
 import {
   buildResumeBundleFromState,
   getResumeBundleStatus,
@@ -106,6 +106,10 @@ import {
 import {
   parseXrayCliOptions
 } from "./chunk-7DRSWPUV.js";
+import {
+  readRuntimePolicySnapshot,
+  sanitizeRuntimePolicyValues
+} from "./chunk-2LA3H54D.js";
 import {
   formatNamespaceMaintenanceHealthText,
   runBenchmarkRecall,
@@ -114,7 +118,7 @@ import {
   runOperatorInventory,
   runOperatorRepair,
   runOperatorSetup
-} from "./chunk-ZOAAY2OE.js";
+} from "./chunk-77E7LLMV.js";
 import {
   analyzeSessionIntegrity,
   applySessionRepair,
@@ -129,10 +133,6 @@ import {
   renderPatternExplain,
   renderPatternsList
 } from "./chunk-3T74IZB3.js";
-import {
-  readRuntimePolicySnapshot,
-  sanitizeRuntimePolicyValues
-} from "./chunk-2LA3H54D.js";
 import {
   GITHUB_CONNECTOR_ID,
   GMAIL_CONNECTOR_ID,
@@ -152,10 +152,10 @@ import {
 } from "./chunk-6GUG4YNM.js";
 import {
   rescoreMemoryImportance
-} from "./chunk-JXS5PDQ7.js";
+} from "./chunk-UOBPK2OS.js";
 import {
   searchHarmonicRetrieval
-} from "./chunk-GBVRVYF4.js";
+} from "./chunk-YINSSARY.js";
 import {
   createEvalBaselineSnapshot,
   getEvalHarnessStatus,
@@ -175,7 +175,7 @@ import {
   rebuildMemoryProjection,
   repairMemoryProjection,
   verifyMemoryProjection
-} from "./chunk-6UKSOXAO.js";
+} from "./chunk-WQ6TRWAE.js";
 import {
   buildConnectorRowsFromDefinitions,
   parseConnectorsListOptions,
@@ -200,7 +200,7 @@ import {
 import {
   EngramAccessHttpServer,
   MeetingsInputError
-} from "./chunk-LTYH2L6E.js";
+} from "./chunk-SILX74CP.js";
 import {
   WearablesInputError
 } from "./chunk-V7IZKJI3.js";
@@ -210,13 +210,13 @@ import {
   loadChatSession,
   processChatMessage,
   sessionBelongsToPrincipal
-} from "./chunk-PQHNZ63P.js";
+} from "./chunk-JJ45UTNT.js";
 import {
   getAbstractionNodeStoreStatus
 } from "./chunk-DJUKBGAD.js";
 import {
   EngramAccessService
-} from "./chunk-BPQ7L27U.js";
+} from "./chunk-MIM7QT6H.js";
 import {
   WorkStorage
 } from "./chunk-GDB4J2H3.js";
@@ -236,7 +236,7 @@ import {
 } from "./chunk-3F3CVVDS.js";
 import {
   readAggregateExtractionWatermark
-} from "./chunk-QTXNS3HB.js";
+} from "./chunk-WCWIV2JH.js";
 import {
   getObjectiveStateStoreStatus
 } from "./chunk-HTP6XRUI.js";
@@ -245,24 +245,24 @@ import {
   readMemoryGovernanceRunArtifact,
   restoreMemoryGovernanceRun,
   runMemoryGovernance
-} from "./chunk-3TDAA7VA.js";
+} from "./chunk-6NMZXEJ7.js";
 import {
   listNamespaces,
   runNamespaceMigration,
   verifyNamespaces
-} from "./chunk-MIUL6AUZ.js";
+} from "./chunk-7ML7STOD.js";
 import {
   analyzeGraphHealth
 } from "./chunk-YMOPYG3K.js";
 import {
   resolveNamespaceChildRoot
-} from "./chunk-BOSIHHOH.js";
+} from "./chunk-UUYQWKHO.js";
 import {
   getCausalTrajectoryStoreStatus
 } from "./chunk-GPFZFCRN.js";
 import {
   meetingIdDate
-} from "./chunk-Q5XKKDFQ.js";
+} from "./chunk-5SZ6CLGJ.js";
 import {
   isValidTranscriptDate
 } from "./chunk-UHVXE24Y.js";
@@ -4932,7 +4932,7 @@ function registerCli(api, orchestrator, registerOptions = {}) {
           }
         }
         if (sourceArchive.endsWith(".enc")) {
-          const { isEncryptedCapsuleFile } = await import("./capsule-crypto-YO5QJ6L3.js");
+          const { isEncryptedCapsuleFile } = await import("./capsule-crypto-GWVG7LGC.js");
           const encDetected = await isEncryptedCapsuleFile(sourceArchive).catch(() => true);
           if (encDetected) {
             throw new Error(
@@ -5095,7 +5095,7 @@ function registerCli(api, orchestrator, registerOptions = {}) {
           const { parseExportBundle } = await import("./transfer/types.js");
           let decryptedBuf;
           try {
-            const { decryptCapsuleFileInMemory } = await import("./capsule-crypto-YO5QJ6L3.js");
+            const { decryptCapsuleFileInMemory } = await import("./capsule-crypto-GWVG7LGC.js");
             decryptedBuf = await decryptCapsuleFileInMemory(archivePath, memoryDir);
           } catch (decErr) {
             const msg = decErr instanceof Error ? decErr.message : String(decErr);
@@ -8344,4 +8344,4 @@ export {
   listMemoryMarkdownFilePaths,
   registerCli
 };
-//# sourceMappingURL=chunk-SY5JUJ2X.js.map
+//# sourceMappingURL=chunk-U5XC6DIS.js.map

package/dist/{chunk-JXS5PDQ7.js → chunk-UOBPK2OS.js}

@@ -1,3 +1,9 @@
+import {
+  cjkBigrams,
+  hasLatinWord,
+  informationalLength
+} from "./chunk-CIO7GCWE.js";
+
 // src/importance.ts
 var CRITICAL_PATTERNS = [
   // Explicit importance
@@ -48,9 +54,7 @@ var TRIVIAL_PATTERNS = [
   /^(got it|understood|roger|copy|noted)[.!]?\s*$/i,
   /^(bye|goodbye|later|see ya|ttyl)[.!]?\s*$/i,
   /^(lol|haha|hehe|lmao|rofl)[.!]?\s*$/i,
-  /^(hmm+|uhh*|ahh*|err*|umm*)[.!]?\s*$/i,
-  // Very short content
-  /^.{1,10}$/
+  /^(hmm+|uhh*|ahh*|err*|umm*)[.!]?\s*$/i
 ];
 var CATEGORY_BOOSTS = {
   correction: 0.15,
@@ -210,9 +214,12 @@ var STOP_WORDS = /* @__PURE__ */ new Set([
   "against"
 ]);
 function extractKeywords(content, maxKeywords = 5) {
-  const words = content.toLowerCase().replace(/[^a-z0-9\s-]/g, " ").split(/\s+/).filter((w) => w.length >= 3 && !STOP_WORDS.has(w));
+  const candidates = [
+    ...content.toLowerCase().replace(/[^a-z0-9\s-]/g, " ").split(/\s+/).filter((w) => w.length >= 3 && !STOP_WORDS.has(w)),
+    ...cjkBigrams(content)
+  ];
   const freq = /* @__PURE__ */ new Map();
-  for (const word of words) {
+  for (const word of candidates) {
     freq.set(word, (freq.get(word) ?? 0) + 1);
   }
   return [...freq.entries()].sort((a, b) => b[1] - a[1]).slice(0, maxKeywords).map(([word]) => word);
@@ -220,7 +227,6 @@ function extractKeywords(content, maxKeywords = 5) {
 function scoreImportance(content, category, tags = []) {
   const reasons = [];
   let score = 0.5;
-  const lowerContent = content.toLowerCase();
   const contentLength = content.length;
   for (const pattern of TRIVIAL_PATTERNS) {
     if (pattern.test(content)) {
@@ -232,6 +238,18 @@ function scoreImportance(content, category, tags = []) {
       };
     }
   }
+  const weightedLength = informationalLength(content);
+  if (weightedLength >= 1 && weightedLength <= 10) {
+    return {
+      score: 0.1,
+      level: "trivial",
+      reasons: ["Trivial content (greeting, filler, or very short)"],
+      keywords: []
+    };
+  }
+  if (!hasLatinWord(content)) {
+    reasons.push("Non-Latin script: keyword tiers not applicable; script-agnostic signals only");
+  }
   for (const pattern of CRITICAL_PATTERNS) {
     if (pattern.test(content)) {
       score += 0.2;
@@ -330,4 +348,4 @@ export {
   importanceLevel,
   isAboveImportanceThreshold
 };
-//# sourceMappingURL=chunk-JXS5PDQ7.js.map
+//# sourceMappingURL=chunk-UOBPK2OS.js.map

package/dist/chunk-UOBPK2OS.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/importance.ts"],"sourcesContent":["/**\n * Local Importance Scoring (Phase 1B)\n *\n * Zero-LLM heuristic system that evaluates each memory's significance.\n * Analyzes content for markers like explicit importance statements,\n * personal information, instructions, emotional content, and factual density.\n */\n\nimport type { ImportanceLevel, ImportanceScore, MemoryCategory, MemoryFile } from \"./types.js\";\nimport { cjkBigrams, hasLatinWord, informationalLength } from \"./utils/script-aware-text.js\";\n\n// ---------------------------------------------------------------------------\n// Marker patterns for each tier\n// ---------------------------------------------------------------------------\n\n/** Critical importance markers (0.9-1.0) */\nconst CRITICAL_PATTERNS = [\n  // Explicit importance\n  /\\b(critical|crucial|essential|must|always|never)\\b/i,\n  /\\b(important|remember this|don't forget)\\b/i,\n  // Personal identity\n  /\\b(my name is|i am|i'm called)\\b/i,\n  /\\b(my (birthday|phone|email|address|ssn|password))\\b/i,\n  // Strong preferences\n  /\\b(i (hate|love|despise|adore))\\b/i,\n  /\\b(absolutely|definitely|certainly) (not|must|should)\\b/i,\n  // Corrections (high weight)\n  /\\b(actually|no,? that's wrong|correction:?|let me correct)\\b/i,\n  /\\b(i said|i meant|i was wrong)\\b/i,\n];\n\n/** High importance markers (0.7-0.9) */\nconst HIGH_PATTERNS = [\n  // Decisions\n  /\\b(decided|decision|chose|choosing|picked|selected)\\b/i,\n  /\\b(we('ll| will) (go with|use|implement))\\b/i,\n  // Instructions\n  /\\b(make sure|ensure|always|don't|do not|never|avoid)\\b/i,\n  /\\b(you (should|must|need to))\\b/i,\n  // Temporal references (deadlines, schedules)\n  /\\b(by (monday|tuesday|wednesday|thursday|friday|saturday|sunday))\\b/i,\n  /\\b(deadline|due (date|by)|by (end of|next))\\b/i,\n  /\\b(tomorrow|next week|this week|today)\\b/i,\n  // Preferences\n  /\\b(i (prefer|like|want|need|dislike))\\b/i,\n  /\\b(my (preference|style|approach|way))\\b/i,\n  // Commitments\n  /\\b(i('ll| will)|promise|commit|guarantee)\\b/i,\n  /\\b(scheduled|appointment|meeting|call)\\b/i,\n];\n\n\n/** Low importance markers (0.2-0.4) */\nconst LOW_PATTERNS = [\n  // Uncertainty\n  /\\b(maybe|perhaps|possibly|might|could be)\\b/i,\n  /\\b(i think|i guess|not sure|uncertain)\\b/i,\n  /\\b(probably|likely|seems like)\\b/i,\n  // Hedging\n  /\\b(kind of|sort of|somewhat|a bit)\\b/i,\n  /\\b(in a way|to some extent)\\b/i,\n];\n\n/** Trivial content markers (0.0-0.2) */\nconst TRIVIAL_PATTERNS = [\n  // Greetings and filler\n  /^(hi|hello|hey|yo|sup|greetings)[.!,]?\\s*$/i,\n  /^(ok|okay|k|sure|yes|no|yep|nope|yeah|nah)[.!]?\\s*$/i,\n  /^(thanks|thank you|thx|ty|cheers)[.!]?\\s*$/i,\n  /^(got it|understood|roger|copy|noted)[.!]?\\s*$/i,\n  /^(bye|goodbye|later|see ya|ttyl)[.!]?\\s*$/i,\n  /^(lol|haha|hehe|lmao|rofl)[.!]?\\s*$/i,\n  /^(hmm+|uhh*|ahh*|err*|umm*)[.!]?\\s*$/i,\n];\n\n// ---------------------------------------------------------------------------\n// Category-based importance boosts\n// ---------------------------------------------------------------------------\n\nconst CATEGORY_BOOSTS: Record<MemoryCategory, number> = {\n  correction: 0.15,        // Corrections are always important\n  principle: 0.12,         // Durable rules/values\n  rule: 0.11,              // Causal IF→THEN rules\n  procedure: 0.10,         // Repeatable workflows (issue #519)\n  preference: 0.10,        // User preferences matter\n  commitment: 0.10,        // Promises/obligations\n  reasoning_trace: 0.09,   // Stored reasoning chains (issue #564)\n  decision: 0.08,          // Decisions with rationale\n  relationship: 0.05,      // Entity relationships\n  skill: 0.05,             // Capabilities\n  moment: 0.03,            // Emotional milestones\n  entity: 0.02,            // Entity facts\n  fact: 0.00,              // Base facts, no boost\n};\n\n// ---------------------------------------------------------------------------\n// Keyword extraction\n// ---------------------------------------------------------------------------\n\n/** Common stop words to filter out */\nconst STOP_WORDS = new Set([\n  \"a\", \"an\", \"the\", \"is\", \"are\", \"was\", \"were\", \"be\", \"been\", \"being\",\n  \"have\", \"has\", \"had\", \"do\", \"does\", \"did\", \"will\", \"would\", \"could\",\n  \"should\", \"may\", \"might\", \"must\", \"shall\", \"can\", \"need\", \"dare\",\n  \"ought\", \"used\", \"to\", \"of\", \"in\", \"for\", \"on\", \"with\", \"at\", \"by\",\n  \"from\", \"as\", \"into\", \"through\", \"during\", \"before\", \"after\", \"above\",\n  \"below\", \"between\", \"under\", \"again\", \"further\", \"then\", \"once\",\n  \"here\", \"there\", \"when\", \"where\", \"why\", \"how\", \"all\", \"each\", \"few\",\n  \"more\", \"most\", \"other\", \"some\", \"such\", \"no\", \"nor\", \"not\", \"only\",\n  \"own\", \"same\", \"so\", \"than\", \"too\", \"very\", \"just\", \"and\", \"but\",\n  \"or\", \"if\", \"because\", \"until\", \"while\", \"this\", \"that\", \"these\",\n  \"those\", \"i\", \"me\", \"my\", \"myself\", \"we\", \"our\", \"ours\", \"ourselves\",\n  \"you\", \"your\", \"yours\", \"yourself\", \"yourselves\", \"he\", \"him\", \"his\",\n  \"himself\", \"she\", \"her\", \"hers\", \"herself\", \"it\", \"its\", \"itself\",\n  \"they\", \"them\", \"their\", \"theirs\", \"themselves\", \"what\", \"which\",\n  \"who\", \"whom\", \"whose\", \"am\", \"been\", \"being\", \"about\", \"against\",\n]);\n\n/**\n * Extract salient keywords from content.\n * Returns top N keywords sorted by relevance.\n */\nfunction extractKeywords(content: string, maxKeywords: number = 5): string[] {\n  // Latin words plus CJK bigrams, so non-Latin content still yields\n  // keywords (pure-CJK prose returned none before #2192).\n  const candidates = [\n    ...content\n      .toLowerCase()\n      .replace(/[^a-z0-9\\s-]/g, \" \")\n      .split(/\\s+/)\n      .filter((w) => w.length >= 3 && !STOP_WORDS.has(w)),\n    ...cjkBigrams(content),\n  ];\n\n  // Count frequencies\n  const freq = new Map<string, number>();\n  for (const word of candidates) {\n    freq.set(word, (freq.get(word) ?? 0) + 1);\n  }\n\n  // Sort by frequency, take top N\n  return [...freq.entries()]\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, maxKeywords)\n    .map(([word]) => word);\n}\n\n// ---------------------------------------------------------------------------\n// Main scoring function\n// ---------------------------------------------------------------------------\n\n/**\n * Calculate importance score for a memory.\n * Pure local heuristics, zero LLM calls.\n */\nexport function scoreImportance(\n  content: string,\n  category: MemoryCategory,\n  tags: string[] = [],\n): ImportanceScore {\n  const reasons: string[] = [];\n  let score = 0.5; // Start at normal baseline\n\n  const contentLength = content.length;\n\n  // Check for trivial content first (short-circuit)\n  for (const pattern of TRIVIAL_PATTERNS) {\n    if (pattern.test(content)) {\n      return {\n        score: 0.1,\n        level: \"trivial\",\n        reasons: [\"Trivial content (greeting, filler, or very short)\"],\n        keywords: [],\n      };\n    }\n  }\n\n  // Very short content. informationalLength weights CJK/Hangul 3:1, so a\n  // dense non-Latin sentence (\"予約しました\") is not trivial for being\n  // under 10 raw characters while its English equivalent is not (#2192).\n  const weightedLength = informationalLength(content);\n  if (weightedLength >= 1 && weightedLength <= 10) {\n    return {\n      score: 0.1,\n      level: \"trivial\",\n      reasons: [\"Trivial content (greeting, filler, or very short)\"],\n      keywords: [],\n    };\n  }\n\n  // Documented non-Latin fallback (#2192): the English keyword tiers below\n  // cannot fire without Latin words, so the score rests on the 0.5 baseline\n  // plus script-agnostic signals (category boost, length, digits, tags).\n  if (!hasLatinWord(content)) {\n    reasons.push(\"Non-Latin script: keyword tiers not applicable; script-agnostic signals only\");\n  }\n\n  // Check critical patterns\n  for (const pattern of CRITICAL_PATTERNS) {\n    if (pattern.test(content)) {\n      score += 0.20;\n      reasons.push(`Critical marker: ${pattern.source.slice(0, 30)}`);\n      break; // Only count once per tier\n    }\n  }\n\n  // Check high patterns\n  for (const pattern of HIGH_PATTERNS) {\n    if (pattern.test(content)) {\n      score += 0.12;\n      reasons.push(`High importance marker detected`);\n      break;\n    }\n  }\n\n  // Check low patterns (reduces score)\n  for (const pattern of LOW_PATTERNS) {\n    if (pattern.test(content)) {\n      score -= 0.15;\n      reasons.push(`Uncertainty/hedging detected`);\n      break;\n    }\n  }\n\n  // Category boost\n  const categoryBoost = CATEGORY_BOOSTS[category] ?? 0;\n  if (categoryBoost > 0) {\n    score += categoryBoost;\n    reasons.push(`Category boost: ${category}`);\n  }\n\n  // Length bonus (longer = more substance, capped)\n  if (contentLength > 200) {\n    const lengthBonus = Math.min((contentLength - 200) / 1000, 0.1);\n    score += lengthBonus;\n    if (lengthBonus > 0.05) {\n      reasons.push(\"Substantial content length\");\n    }\n  }\n\n  // Check for personal pronouns (signals personal relevance)\n  if (/\\b(my|mine|i|i'm|i've|i'd|i'll)\\b/i.test(content)) {\n    score += 0.05;\n    reasons.push(\"Personal reference\");\n  }\n\n  // Check for numbers/specifics (concrete details)\n  if (/\\b\\d{2,}\\b/.test(content) || /\\b(version|v\\d|api|config)\\b/i.test(content)) {\n    score += 0.03;\n    reasons.push(\"Contains specific details\");\n  }\n\n  // Tag-based boosts\n  const importantTags = tags.filter((t) =>\n    [\"important\", \"critical\", \"preference\", \"decision\", \"rule\", \"principle\"].includes(t.toLowerCase())\n  );\n  if (importantTags.length > 0) {\n    score += 0.05 * importantTags.length;\n    reasons.push(`Important tags: ${importantTags.join(\", \")}`);\n  }\n\n  // Clamp score to 0-1 range\n  score = Math.max(0, Math.min(1, score));\n\n  // Determine level from score\n  let level: ImportanceLevel;\n  if (score >= 0.9) {\n    level = \"critical\";\n  } else if (score >= 0.7) {\n    level = \"high\";\n  } else if (score >= 0.4) {\n    level = \"normal\";\n  } else if (score >= 0.2) {\n    level = \"low\";\n  } else {\n    level = \"trivial\";\n  }\n\n  // Extract keywords\n  const keywords = extractKeywords(content);\n\n  return {\n    score: Math.round(score * 100) / 100, // Round to 2 decimal places\n    level,\n    reasons: reasons.slice(0, 5), // Cap at 5 reasons\n    keywords,\n  };\n}\n\n/**\n * Recompute importance for an existing memory file using current local heuristics.\n */\nexport function rescoreMemoryImportance(memory: MemoryFile): ImportanceScore {\n  return scoreImportance(memory.content, memory.frontmatter.category, memory.frontmatter.tags ?? []);\n}\n\n/**\n * Get importance level from numeric score.\n */\nexport function importanceLevel(score: number): ImportanceLevel {\n  if (score >= 0.9) return \"critical\";\n  if (score >= 0.7) return \"high\";\n  if (score >= 0.4) return \"normal\";\n  if (score >= 0.2) return \"low\";\n  return \"trivial\";\n}\n\n// ---------------------------------------------------------------------------\n// Importance threshold helper (issue #372)\n// ---------------------------------------------------------------------------\n\n/**\n * Ordering for importance levels used by the extraction write gate.\n * Higher indices mean more important.\n */\nconst IMPORTANCE_LEVEL_RANK: Record<ImportanceLevel, number> = {\n  trivial: 0,\n  low: 1,\n  normal: 2,\n  high: 3,\n  critical: 4,\n};\n\n/**\n * Return true if `candidate` meets or exceeds `threshold`. Used by the\n * extraction write gate in orchestrator.persistExtraction() to drop trivial\n * content before it is written to the memory store.\n *\n * Note: callers should pass the ALREADY-BOOSTED level returned by\n * scoreImportance(), because category boosts (e.g. corrections) are applied\n * inside scoreImportance() before the level is derived.\n */\nexport function isAboveImportanceThreshold(\n  candidate: ImportanceLevel,\n  threshold: ImportanceLevel,\n): boolean {\n  return IMPORTANCE_LEVEL_RANK[candidate] >= IMPORTANCE_LEVEL_RANK[threshold];\n}\n"],"mappings":";;;;;;;AAgBA,IAAM,oBAAoB;AAAA;AAAA,EAExB;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AACF;AAGA,IAAM,gBAAgB;AAAA;AAAA,EAEpB;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AACF;AAIA,IAAM,eAAe;AAAA;AAAA,EAEnB;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AACF;AAGA,IAAM,mBAAmB;AAAA;AAAA,EAEvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAMA,IAAM,kBAAkD;AAAA,EACtD,YAAY;AAAA;AAAA,EACZ,WAAW;AAAA;AAAA,EACX,MAAM;AAAA;AAAA,EACN,WAAW;AAAA;AAAA,EACX,YAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,iBAAiB;AAAA;AAAA,EACjB,UAAU;AAAA;AAAA,EACV,cAAc;AAAA;AAAA,EACd,OAAO;AAAA;AAAA,EACP,QAAQ;AAAA;AAAA,EACR,QAAQ;AAAA;AAAA,EACR,MAAM;AAAA;AACR;AAOA,IAAM,aAAa,oBAAI,IAAI;AAAA,EACzB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAC5D;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAC5D;AAAA,EAAU;AAAA,EAAO;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAQ;AAAA,EAC1D;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAM;AAAA,EAC9D;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAW;AAAA,EAAU;AAAA,EAAU;AAAA,EAAS;AAAA,EAC9D;AAAA,EAAS;AAAA,EAAW;AAAA,EAAS;AAAA,EAAS;AAAA,EAAW;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAC/D;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAC7D;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAO;AAAA,EAC3D;AAAA,EAAM;AAAA,EAAM;AAAA,EAAW;AAAA,EAAS;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAS;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EAAU;AAAA,EAAM;AAAA,EAAO;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAY;AAAA,EAAc;AAAA,EAAM;AAAA,EAAO;AAAA,EAC/D;AAAA,EAAW;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAW;AAAA,EAAM;AAAA,EAAO;AAAA,EACzD;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAU;AAAA,EAAc;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAS;AAC1D,CAAC;AAMD,SAAS,gBAAgB,SAAiB,cAAsB,GAAa;AAG3E,QAAM,aAAa;AAAA,IACjB,GAAG,QACA,YAAY,EACZ,QAAQ,iBAAiB,GAAG,EAC5B,MAAM,KAAK,EACX,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;AAAA,IACpD,GAAG,WAAW,OAAO;AAAA,EACvB;AAGA,QAAM,OAAO,oBAAI,IAAoB;AACrC,aAAW,QAAQ,YAAY;AAC7B,SAAK,IAAI,OAAO,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,EAC1C;AAGA,SAAO,CAAC,GAAG,KAAK,QAAQ,CAAC,EACtB,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,WAAW,EACpB,IAAI,CAAC,CAAC,IAAI,MAAM,IAAI;AACzB;AAUO,SAAS,gBACd,SACA,UACA,OAAiB,CAAC,GACD;AACjB,QAAM,UAAoB,CAAC;AAC3B,MAAI,QAAQ;AAEZ,QAAM,gBAAgB,QAAQ;AAG9B,aAAW,WAAW,kBAAkB;AACtC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,aAAO;AAAA,QACL,OAAO;AAAA,QACP,OAAO;AAAA,QACP,SAAS,CAAC,mDAAmD;AAAA,QAC7D,UAAU,CAAC;AAAA,MACb;AAAA,IACF;AAAA,EACF;AAKA,QAAM,iBAAiB,oBAAoB,OAAO;AAClD,MAAI,kBAAkB,KAAK,kBAAkB,IAAI;AAC/C,WAAO;AAAA,MACL,OAAO;AAAA,MACP,OAAO;AAAA,MACP,SAAS,CAAC,mDAAmD;AAAA,MAC7D,UAAU,CAAC;AAAA,IACb;AAAA,EACF;AAKA,MAAI,CAAC,aAAa,OAAO,GAAG;AAC1B,YAAQ,KAAK,8EAA8E;AAAA,EAC7F;AAGA,aAAW,WAAW,mBAAmB;AACvC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,eAAS;AACT,cAAQ,KAAK,oBAAoB,QAAQ,OAAO,MAAM,GAAG,EAAE,CAAC,EAAE;AAC9D;AAAA,IACF;AAAA,EACF;AAGA,aAAW,WAAW,eAAe;AACnC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,eAAS;AACT,cAAQ,KAAK,iCAAiC;AAC9C;AAAA,IACF;AAAA,EACF;AAGA,aAAW,WAAW,cAAc;AAClC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,eAAS;AACT,cAAQ,KAAK,8BAA8B;AAC3C;AAAA,IACF;AAAA,EACF;AAGA,QAAM,gBAAgB,gBAAgB,QAAQ,KAAK;AACnD,MAAI,gBAAgB,GAAG;AACrB,aAAS;AACT,YAAQ,KAAK,mBAAmB,QAAQ,EAAE;AAAA,EAC5C;AAGA,MAAI,gBAAgB,KAAK;AACvB,UAAM,cAAc,KAAK,KAAK,gBAAgB,OAAO,KAAM,GAAG;AAC9D,aAAS;AACT,QAAI,cAAc,MAAM;AACtB,cAAQ,KAAK,4BAA4B;AAAA,IAC3C;AAAA,EACF;AAGA,MAAI,qCAAqC,KAAK,OAAO,GAAG;AACtD,aAAS;AACT,YAAQ,KAAK,oBAAoB;AAAA,EACnC;AAGA,MAAI,aAAa,KAAK,OAAO,KAAK,gCAAgC,KAAK,OAAO,GAAG;AAC/E,aAAS;AACT,YAAQ,KAAK,2BAA2B;AAAA,EAC1C;AAGA,QAAM,gBAAgB,KAAK;AAAA,IAAO,CAAC,MACjC,CAAC,aAAa,YAAY,cAAc,YAAY,QAAQ,WAAW,EAAE,SAAS,EAAE,YAAY,CAAC;AAAA,EACnG;AACA,MAAI,cAAc,SAAS,GAAG;AAC5B,aAAS,OAAO,cAAc;AAC9B,YAAQ,KAAK,mBAAmB,cAAc,KAAK,IAAI,CAAC,EAAE;AAAA,EAC5D;AAGA,UAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAGtC,MAAI;AACJ,MAAI,SAAS,KAAK;AAChB,YAAQ;AAAA,EACV,WAAW,SAAS,KAAK;AACvB,YAAQ;AAAA,EACV,WAAW,SAAS,KAAK;AACvB,YAAQ;AAAA,EACV,WAAW,SAAS,KAAK;AACvB,YAAQ;AAAA,EACV,OAAO;AACL,YAAQ;AAAA,EACV;AAGA,QAAM,WAAW,gBAAgB,OAAO;AAExC,SAAO;AAAA,IACL,OAAO,KAAK,MAAM,QAAQ,GAAG,IAAI;AAAA;AAAA,IACjC;AAAA,IACA,SAAS,QAAQ,MAAM,GAAG,CAAC;AAAA;AAAA,IAC3B;AAAA,EACF;AACF;AAKO,SAAS,wBAAwB,QAAqC;AAC3E,SAAO,gBAAgB,OAAO,SAAS,OAAO,YAAY,UAAU,OAAO,YAAY,QAAQ,CAAC,CAAC;AACnG;AAKO,SAAS,gBAAgB,OAAgC;AAC9D,MAAI,SAAS,IAAK,QAAO;AACzB,MAAI,SAAS,IAAK,QAAO;AACzB,MAAI,SAAS,IAAK,QAAO;AACzB,MAAI,SAAS,IAAK,QAAO;AACzB,SAAO;AACT;AAUA,IAAM,wBAAyD;AAAA,EAC7D,SAAS;AAAA,EACT,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,UAAU;AACZ;AAWO,SAAS,2BACd,WACA,WACS;AACT,SAAO,sBAAsB,SAAS,KAAK,sBAAsB,SAAS;AAC5E;","names":[]}

package/dist/{chunk-BOSIHHOH.js → chunk-UUYQWKHO.js}

@@ -4,7 +4,7 @@ import {
 } from "./chunk-RDFF2NAU.js";
 import {
   StorageManager
-} from "./chunk-Q5XKKDFQ.js";
+} from "./chunk-5SZ6CLGJ.js";
 import {
   excludeSupportPassportPrivateMemories
 } from "./chunk-XDL5CYZN.js";
@@ -138,4 +138,4 @@ export {
   runCodexMaterialize,
   runPostConsolidationMaterialize
 };
-//# sourceMappingURL=chunk-BOSIHHOH.js.map
+//# sourceMappingURL=chunk-UUYQWKHO.js.map

package/dist/{chunk-DQEMWVMT.js → chunk-UVYI6VIX.js}

@@ -246,4 +246,4 @@ export {
   decryptCapsuleFile,
   decryptCapsuleFileInMemory
 };
-//# sourceMappingURL=chunk-DQEMWVMT.js.map
+//# sourceMappingURL=chunk-UVYI6VIX.js.map

package/dist/{chunk-M4AHBM72.js → chunk-VCBG52MM.js}

@@ -1,3 +1,6 @@
+import {
+  LcmDag
+} from "./chunk-7N4KAIGN.js";
 import {
   LcmWorkQueue
 } from "./chunk-TPDBFYEG.js";
@@ -14,9 +17,6 @@ import {
 import {
   LcmArchive
 } from "./chunk-WVP2I6C5.js";
-import {
-  LcmDag
-} from "./chunk-7N4KAIGN.js";
 import {
   estimateTokenCount
 } from "./chunk-TOTT6S2V.js";
@@ -568,4 +568,4 @@ export {
   extractLcmConfig,
   LcmEngine
 };
-//# sourceMappingURL=chunk-M4AHBM72.js.map
+//# sourceMappingURL=chunk-VCBG52MM.js.map

package/dist/{chunk-62Y5AGCM.js → chunk-VENMDW4U.js}

@@ -1,21 +1,21 @@
+import {
+  RemoteSearchBackend
+} from "./chunk-VYISFWVX.js";
+import {
+  EmbedHelper
+} from "./chunk-6KTXE6A3.js";
 import {
   LanceDbBackend
-} from "./chunk-OQIRBGUU.js";
+} from "./chunk-2Q4UAPLD.js";
 import {
   MeilisearchBackend
-} from "./chunk-VANZKHTN.js";
+} from "./chunk-G5OB4XZX.js";
 import {
   NoopSearchBackend
 } from "./chunk-CYEPCZN5.js";
 import {
   OramaBackend
-} from "./chunk-ML3U4KPR.js";
-import {
-  RemoteSearchBackend
-} from "./chunk-VYISFWVX.js";
-import {
-  EmbedHelper
-} from "./chunk-6KTXE6A3.js";
+} from "./chunk-K547KS3X.js";
 import {
   createConversationIndexBackend
 } from "./chunk-227UFSEQ.js";
@@ -179,4 +179,4 @@ export {
   createConversationSearchBackend,
   createConversationIndexRuntime
 };
-//# sourceMappingURL=chunk-62Y5AGCM.js.map
+//# sourceMappingURL=chunk-VENMDW4U.js.map

package/dist/{chunk-6NAPOLRO.js → chunk-VY47VI2T.js}

@@ -1,6 +1,9 @@
 import {
   isDirectAnswerEligible
 } from "./chunk-PYIR4SSB.js";
+import {
+  cjkBigrams
+} from "./chunk-CIO7GCWE.js";
 import {
   normalizeRecallTokens
 } from "./chunk-YCVB7X56.js";
@@ -88,9 +91,8 @@ function computeKeywordScoreForTokens(contentTokens, cat) {
   return score;
 }
 function tokenizeKeywordText(value) {
-  return new Set(
-    value.toLowerCase().split(/[^a-z0-9]+/).map((word) => word.trim()).filter((word) => word.length >= 3 && !TAXONOMY_KEYWORD_STOPWORDS.has(word))
-  );
+  const latin = (value.toLowerCase().match(/[a-z0-9]+/g) ?? []).filter((word) => word.length >= 3 && !TAXONOMY_KEYWORD_STOPWORDS.has(word));
+  return /* @__PURE__ */ new Set([...latin, ...cjkBigrams(value)]);
 }
 function selectFallbackCategory(categories) {
   return categories.find((cat) => cat.id === DEFAULT_CATEGORY_ID) ?? categories.find((cat) => {
@@ -177,4 +179,4 @@ export {
   resolveCategory,
   tryDirectAnswer
 };
-//# sourceMappingURL=chunk-6NAPOLRO.js.map
+//# sourceMappingURL=chunk-VY47VI2T.js.map

package/dist/chunk-VY47VI2T.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/taxonomy/resolver.ts","../src/direct-answer-wiring.ts"],"sourcesContent":["/**\n * Resolver decision tree for the MECE taxonomy.\n *\n * Given extracted content and its MemoryCategory, determines which\n * taxonomy category the knowledge should be filed under.\n */\n\nimport type { MemoryCategory } from \"../types.js\";\nimport type { ResolverDecision, Taxonomy, TaxonomyCategory } from \"./types.js\";\nimport { cjkBigrams } from \"../utils/script-aware-text.js\";\n\nconst DEFAULT_CATEGORY_ID = \"facts\";\n\n/**\n * Resolve a piece of content to a taxonomy category.\n *\n * Algorithm:\n * 1. Find all taxonomy categories whose `memoryCategories` include\n *    the given `memoryCategory`.\n * 2. If exactly one match, return it with confidence 1.0.\n * 3. If multiple matches, prefer the strongest exact-token keyword\n *    overlap from filing rules. Use priority only as a tie-breaker.\n *    If no filing rules match, choose the explicit/default fallback\n *    category instead of letting low-priority generic terms win.\n * 4. If no match, fall back to the \"facts\" category (or first\n *    category if \"facts\" is absent) with low confidence.\n * 5. Always populate `alternatives` with other plausible categories.\n */\nexport function resolveCategory(\n  content: string,\n  memoryCategory: MemoryCategory,\n  taxonomy: Taxonomy,\n): ResolverDecision {\n  const contentTokens = tokenizeKeywordText(content);\n\n  // Step 1: find matching categories\n  const matches = taxonomy.categories.filter((cat) =>\n    cat.memoryCategories.includes(memoryCategory),\n  );\n\n  if (matches.length === 0) {\n    // No taxonomy category accepts this MemoryCategory — fall back\n    const fallback =\n      taxonomy.categories.find((c) => c.id === DEFAULT_CATEGORY_ID) ??\n      taxonomy.categories[0];\n    if (!fallback) {\n      return {\n        categoryId: DEFAULT_CATEGORY_ID,\n        confidence: 0,\n        reason: \"Taxonomy is empty; using default category\",\n        alternatives: [],\n      };\n    }\n    const alternatives = taxonomy.categories\n      .filter((c) => c.id !== fallback.id)\n      .map((c) => ({\n        categoryId: c.id,\n        reason: c.description,\n      }));\n    return {\n      categoryId: fallback.id,\n      confidence: 0.3,\n      reason: `No taxonomy category maps to MemoryCategory \"${memoryCategory}\"; falling back to \"${fallback.name}\"`,\n      alternatives,\n    };\n  }\n\n  if (matches.length === 1) {\n    const match = matches[0]!;\n    const alternatives = taxonomy.categories\n      .filter((c) => c.id !== match.id)\n      .map((c) => ({\n        categoryId: c.id,\n        reason: c.description,\n      }));\n    return {\n      categoryId: match.id,\n      confidence: 1.0,\n      reason: `Unique match: MemoryCategory \"${memoryCategory}\" maps to \"${match.name}\"`,\n      alternatives,\n    };\n  }\n\n  // Multiple matches — use filing rule keyword heuristics + priority\n  const scored = matches.map((cat) => ({\n    cat,\n    keywordScore: computeKeywordScoreForTokens(contentTokens, cat),\n  }));\n\n  // Sort by keyword score descending, then priority ascending (lower wins)\n  scored.sort((a, b) => {\n    if (b.keywordScore !== a.keywordScore) return b.keywordScore - a.keywordScore;\n    return a.cat.priority - b.cat.priority;\n  });\n\n  const topScored = scored[0]!;\n  const best = topScored.keywordScore > 0\n    ? topScored\n    : {\n        cat: selectFallbackCategory(matches) ?? topScored.cat,\n        keywordScore: 0,\n      };\n  const runnerUp = scored[1];\n\n  // Confidence is higher when keyword match clearly differentiates\n  const confidence =\n    best.keywordScore > 0 && (!runnerUp || best.keywordScore > runnerUp.keywordScore)\n      ? 0.9\n      : 0.7;\n\n  const alternatives = taxonomy.categories\n    .filter((c) => c.id !== best.cat.id)\n    .map((c) => ({\n      categoryId: c.id,\n      reason: c.description,\n    }));\n\n  const reason =\n    best.keywordScore > 0\n      ? `Filing rules for \"${best.cat.name}\" matched content keywords (priority ${best.cat.priority})`\n      : `No filing rules matched content keywords; using fallback category \"${best.cat.name}\"`;\n\n  return {\n    categoryId: best.cat.id,\n    confidence,\n    reason,\n    alternatives,\n  };\n}\n\n/**\n * Compute a simple keyword overlap score between content and\n * a category's filing rules + description.\n */\nfunction computeKeywordScoreForTokens(contentTokens: Set<string>, cat: TaxonomyCategory): number {\n  let score = 0;\n  const ruleText = [...cat.filingRules, cat.description]\n    .join(\" \")\n    .toLowerCase();\n\n  const keywords = tokenizeKeywordText(ruleText);\n\n  for (const kw of keywords) {\n    if (contentTokens.has(kw)) {\n      score += 1;\n    }\n  }\n  return score;\n}\n\nfunction tokenizeKeywordText(value: string): Set<string> {\n  // CJK bigrams tokenize BOTH sides (content and filing rules), so a\n  // taxonomy written in a CJK language matches CJK content; Latin-only\n  // taxonomies see no change (issue #2192).\n  const latin = (value.toLowerCase().match(/[a-z0-9]+/g) ?? [])\n    .filter((word) => word.length >= 3 && !TAXONOMY_KEYWORD_STOPWORDS.has(word));\n  return new Set([...latin, ...cjkBigrams(value)]);\n}\n\nfunction selectFallbackCategory(\n  categories: readonly TaxonomyCategory[],\n): TaxonomyCategory | undefined {\n  return categories.find((cat) => cat.id === DEFAULT_CATEGORY_ID) ??\n    categories.find((cat) => {\n      const text = `${cat.id} ${cat.name} ${cat.description} ${cat.filingRules.join(\" \")}`.toLowerCase();\n      return /\\b(general|fallback)\\b/.test(text);\n    });\n}\n\nconst TAXONOMY_KEYWORD_STOPWORDS = new Set([\n  \"about\",\n  \"all\",\n  \"and\",\n  \"are\",\n  \"for\",\n  \"from\",\n  \"has\",\n  \"into\",\n  \"not\",\n  \"the\",\n  \"this\",\n  \"was\",\n  \"with\",\n]);\n","/**\n * Direct-answer wiring (issue #518 slice 3).\n *\n * Binds the pure eligibility decision (`direct-answer.ts`) to the data\n * sources needed to build candidates: storage, trust-zones, taxonomy,\n * and importance scoring.  Kept as a separate module so that:\n *\n * - The eligibility layer stays pure and unit-testable without stores.\n * - Each caller injects its own source accessors.  The orchestrator\n *   binding is a follow-on slice; tests here use mock sources.\n * - The wiring is safe to ship alone — nothing calls `tryDirectAnswer`\n *   yet, so enabling this module's presence does not change recall\n *   behavior.  The next slice adds exactly one call site before QMD.\n *\n * Short-circuit contract:\n *\n * - When the resolved gate (`input.enabled`, projected from\n *   `caps.recallDirectAnswer` at the recall-operation entry) is `false`, the\n *   function returns the\n *   eligibility verdict with reason `\"disabled\"` without touching any source\n *   accessor.  This is the documented default.\n * - When enabled, the wiring cheaply drops non-trusted-zone memories\n *   and ineligible taxonomy buckets before computing importance, so\n *   the eligibility module sees a pre-filtered candidate set.  The\n *   eligibility module still performs the same checks itself — this\n *   module is purely an I/O and prefiltering layer.\n */\n\nimport type { MemoryFile, PluginConfig } from \"./types.js\";\nimport type { TrustZoneName } from \"./trust-zones.js\";\nimport type { Taxonomy } from \"./taxonomy/types.js\";\nimport { resolveCategory } from \"./taxonomy/resolver.js\";\nimport { normalizeRecallTokens } from \"./recall-tokenization.js\";\nimport { throwIfAborted } from \"./abort-error.js\";\nimport {\n  isDirectAnswerEligible,\n  type DirectAnswerCandidate,\n  type DirectAnswerConfig,\n  type DirectAnswerResult,\n} from \"./direct-answer.js\";\n\n/**\n * Caller-provided accessors for candidate sourcing.  Decouples the\n * wiring from any specific storage / trust-zone / importance backend.\n */\nexport interface DirectAnswerSources {\n  /**\n   * List memories eligible to be considered for direct-answer.\n   * Callers are expected to return only active, non-superseded memories\n   * in the requested namespace; the wiring will cheaply re-filter on\n   * trust zone and taxonomy bucket and hand the rest to the eligibility\n   * module, which applies the full gate ladder.\n   */\n  listCandidateMemories(options: {\n    namespace: string;\n    abortSignal?: AbortSignal;\n  }): Promise<MemoryFile[]>;\n  /**\n   * Resolve the trust-zone record for a memory.  Returns `null` when\n   * the memory has no trust-zone record (treated as not trusted).\n   */\n  trustZoneFor(memoryId: string): Promise<TrustZoneName | null>;\n  /**\n   * Resolve a calibrated importance score in [0, 1] for a memory.\n   */\n  importanceFor(memory: MemoryFile): number;\n  /**\n   * Taxonomy used to classify memories into direct-answer buckets.\n   */\n  taxonomy: Taxonomy;\n}\n\nexport interface DirectAnswerWiringInput {\n  query: string;\n  namespace: string;\n  config: Pick<\n    PluginConfig,\n    | \"recallDirectAnswerTokenOverlapFloor\"\n    | \"recallDirectAnswerImportanceFloor\"\n    | \"recallDirectAnswerAmbiguityMargin\"\n    | \"recallDirectAnswerEligibleTaxonomyBuckets\"\n  >;\n  /**\n   * Direct-answer capability gate, resolved once at the recall-operation entry\n   * via `resolveCapabilities(config).recallDirectAnswer` (issue #1523). This\n   * is the sole gate — the function no longer reads the config flag directly.\n   * Callers MUST pass the resolved capability so the whole operation agrees on\n   * a single gate value.\n   */\n  enabled: boolean;\n  sources: DirectAnswerSources;\n  queryEntityRefs?: string[];\n  abortSignal?: AbortSignal;\n}\n\n/**\n * Attempt direct-answer resolution.  Returns the eligibility verdict\n * produced by `isDirectAnswerEligible` with candidates materialized\n * from the caller-supplied sources.\n */\nexport async function tryDirectAnswer(\n  input: DirectAnswerWiringInput,\n): Promise<DirectAnswerResult> {\n  const { query, namespace, config, enabled, sources, queryEntityRefs, abortSignal } = input;\n\n  const eligibilityConfig: DirectAnswerConfig = {\n    enabled,\n    tokenOverlapFloor: config.recallDirectAnswerTokenOverlapFloor,\n    importanceFloor: config.recallDirectAnswerImportanceFloor,\n    ambiguityMargin: config.recallDirectAnswerAmbiguityMargin,\n    eligibleTaxonomyBuckets: config.recallDirectAnswerEligibleTaxonomyBuckets,\n  };\n\n  // Short-circuit disabled case before touching any I/O.\n  if (!eligibilityConfig.enabled) {\n    return isDirectAnswerEligible({\n      query,\n      candidates: [],\n      config: eligibilityConfig,\n      queryEntityRefs,\n    });\n  }\n\n  // Short-circuit empty-query case before any I/O.  isDirectAnswerEligible\n  // deterministically returns reason \"empty-query\" when the query\n  // normalizes to zero searchable tokens; there's no point materializing\n  // candidates just to reach the same verdict, and doing so would\n  // surface avoidable upstream errors for requests that should exit\n  // immediately.\n  if (normalizeRecallTokens(query).length === 0) {\n    return isDirectAnswerEligible({\n      query,\n      candidates: [],\n      config: eligibilityConfig,\n      queryEntityRefs,\n    });\n  }\n\n  throwIfAborted(abortSignal, \"direct-answer wiring aborted\");\n  const memories = await sources.listCandidateMemories({ namespace, abortSignal });\n  throwIfAborted(abortSignal, \"direct-answer wiring aborted\");\n  const candidates: DirectAnswerCandidate[] = [];\n\n  for (const memory of memories) {\n    // Throw rather than returning a partial verdict — a mid-loop abort\n    // that left competing candidates unprocessed could otherwise surface\n    // a spurious \"eligible\" result that the ambiguity gate never got a\n    // chance to reject.  The check repeats after every await so an\n    // abort that lands during the in-flight I/O on the final memory\n    // (after which no further iteration would exist) still stops us.\n    throwIfAborted(abortSignal, \"direct-answer wiring aborted\");\n\n    const trustZone = await sources.trustZoneFor(memory.frontmatter.id);\n    throwIfAborted(abortSignal, \"direct-answer wiring aborted\");\n\n    // Cheap pre-filter: non-trusted memories can't qualify, so skip\n    // taxonomy and importance resolution for them.\n    if (trustZone !== \"trusted\") continue;\n\n    const decision = resolveCategory(\n      memory.content,\n      memory.frontmatter.category,\n      sources.taxonomy,\n    );\n    const taxonomyBucket = decision.categoryId;\n    if (!eligibilityConfig.eligibleTaxonomyBuckets.includes(taxonomyBucket)) continue;\n\n    const importanceScore = sources.importanceFor(memory);\n\n    candidates.push({\n      memory,\n      trustZone,\n      taxonomyBucket,\n      importanceScore,\n    });\n  }\n\n  // Final check — if abort landed during the trust-zone await for the\n  // last memory, the loop condition no longer fires.  Guard before we\n  // hand candidates to the eligibility gate.\n  throwIfAborted(abortSignal, \"direct-answer wiring aborted\");\n\n  return isDirectAnswerEligible({\n    query,\n    candidates,\n    config: eligibilityConfig,\n    queryEntityRefs,\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;AAWA,IAAM,sBAAsB;AAiBrB,SAAS,gBACd,SACA,gBACA,UACkB;AAClB,QAAM,gBAAgB,oBAAoB,OAAO;AAGjD,QAAM,UAAU,SAAS,WAAW;AAAA,IAAO,CAAC,QAC1C,IAAI,iBAAiB,SAAS,cAAc;AAAA,EAC9C;AAEA,MAAI,QAAQ,WAAW,GAAG;AAExB,UAAM,WACJ,SAAS,WAAW,KAAK,CAAC,MAAM,EAAE,OAAO,mBAAmB,KAC5D,SAAS,WAAW,CAAC;AACvB,QAAI,CAAC,UAAU;AACb,aAAO;AAAA,QACL,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ,QAAQ;AAAA,QACR,cAAc,CAAC;AAAA,MACjB;AAAA,IACF;AACA,UAAMA,gBAAe,SAAS,WAC3B,OAAO,CAAC,MAAM,EAAE,OAAO,SAAS,EAAE,EAClC,IAAI,CAAC,OAAO;AAAA,MACX,YAAY,EAAE;AAAA,MACd,QAAQ,EAAE;AAAA,IACZ,EAAE;AACJ,WAAO;AAAA,MACL,YAAY,SAAS;AAAA,MACrB,YAAY;AAAA,MACZ,QAAQ,gDAAgD,cAAc,uBAAuB,SAAS,IAAI;AAAA,MAC1G,cAAAA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAMA,gBAAe,SAAS,WAC3B,OAAO,CAAC,MAAM,EAAE,OAAO,MAAM,EAAE,EAC/B,IAAI,CAAC,OAAO;AAAA,MACX,YAAY,EAAE;AAAA,MACd,QAAQ,EAAE;AAAA,IACZ,EAAE;AACJ,WAAO;AAAA,MACL,YAAY,MAAM;AAAA,MAClB,YAAY;AAAA,MACZ,QAAQ,iCAAiC,cAAc,cAAc,MAAM,IAAI;AAAA,MAC/E,cAAAA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAAS,QAAQ,IAAI,CAAC,SAAS;AAAA,IACnC;AAAA,IACA,cAAc,6BAA6B,eAAe,GAAG;AAAA,EAC/D,EAAE;AAGF,SAAO,KAAK,CAAC,GAAG,MAAM;AACpB,QAAI,EAAE,iBAAiB,EAAE,aAAc,QAAO,EAAE,eAAe,EAAE;AACjE,WAAO,EAAE,IAAI,WAAW,EAAE,IAAI;AAAA,EAChC,CAAC;AAED,QAAM,YAAY,OAAO,CAAC;AAC1B,QAAM,OAAO,UAAU,eAAe,IAClC,YACA;AAAA,IACE,KAAK,uBAAuB,OAAO,KAAK,UAAU;AAAA,IAClD,cAAc;AAAA,EAChB;AACJ,QAAM,WAAW,OAAO,CAAC;AAGzB,QAAM,aACJ,KAAK,eAAe,MAAM,CAAC,YAAY,KAAK,eAAe,SAAS,gBAChE,MACA;AAEN,QAAM,eAAe,SAAS,WAC3B,OAAO,CAAC,MAAM,EAAE,OAAO,KAAK,IAAI,EAAE,EAClC,IAAI,CAAC,OAAO;AAAA,IACX,YAAY,EAAE;AAAA,IACd,QAAQ,EAAE;AAAA,EACZ,EAAE;AAEJ,QAAM,SACJ,KAAK,eAAe,IAChB,qBAAqB,KAAK,IAAI,IAAI,wCAAwC,KAAK,IAAI,QAAQ,MAC3F,sEAAsE,KAAK,IAAI,IAAI;AAEzF,SAAO;AAAA,IACL,YAAY,KAAK,IAAI;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAMA,SAAS,6BAA6B,eAA4B,KAA+B;AAC/F,MAAI,QAAQ;AACZ,QAAM,WAAW,CAAC,GAAG,IAAI,aAAa,IAAI,WAAW,EAClD,KAAK,GAAG,EACR,YAAY;AAEf,QAAM,WAAW,oBAAoB,QAAQ;AAE7C,aAAW,MAAM,UAAU;AACzB,QAAI,cAAc,IAAI,EAAE,GAAG;AACzB,eAAS;AAAA,IACX;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAA4B;AAIvD,QAAM,SAAS,MAAM,YAAY,EAAE,MAAM,YAAY,KAAK,CAAC,GACxD,OAAO,CAAC,SAAS,KAAK,UAAU,KAAK,CAAC,2BAA2B,IAAI,IAAI,CAAC;AAC7E,SAAO,oBAAI,IAAI,CAAC,GAAG,OAAO,GAAG,WAAW,KAAK,CAAC,CAAC;AACjD;AAEA,SAAS,uBACP,YAC8B;AAC9B,SAAO,WAAW,KAAK,CAAC,QAAQ,IAAI,OAAO,mBAAmB,KAC5D,WAAW,KAAK,CAAC,QAAQ;AACvB,UAAM,OAAO,GAAG,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,WAAW,IAAI,IAAI,YAAY,KAAK,GAAG,CAAC,GAAG,YAAY;AACjG,WAAO,yBAAyB,KAAK,IAAI;AAAA,EAC3C,CAAC;AACL;AAEA,IAAM,6BAA6B,oBAAI,IAAI;AAAA,EACzC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;;;ACnFD,eAAsB,gBACpB,OAC6B;AAC7B,QAAM,EAAE,OAAO,WAAW,QAAQ,SAAS,SAAS,iBAAiB,YAAY,IAAI;AAErF,QAAM,oBAAwC;AAAA,IAC5C;AAAA,IACA,mBAAmB,OAAO;AAAA,IAC1B,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,IACxB,yBAAyB,OAAO;AAAA,EAClC;AAGA,MAAI,CAAC,kBAAkB,SAAS;AAC9B,WAAO,uBAAuB;AAAA,MAC5B;AAAA,MACA,YAAY,CAAC;AAAA,MACb,QAAQ;AAAA,MACR;AAAA,IACF,CAAC;AAAA,EACH;AAQA,MAAI,sBAAsB,KAAK,EAAE,WAAW,GAAG;AAC7C,WAAO,uBAAuB;AAAA,MAC5B;AAAA,MACA,YAAY,CAAC;AAAA,MACb,QAAQ;AAAA,MACR;AAAA,IACF,CAAC;AAAA,EACH;AAEA,iBAAe,aAAa,8BAA8B;AAC1D,QAAM,WAAW,MAAM,QAAQ,sBAAsB,EAAE,WAAW,YAAY,CAAC;AAC/E,iBAAe,aAAa,8BAA8B;AAC1D,QAAM,aAAsC,CAAC;AAE7C,aAAW,UAAU,UAAU;AAO7B,mBAAe,aAAa,8BAA8B;AAE1D,UAAM,YAAY,MAAM,QAAQ,aAAa,OAAO,YAAY,EAAE;AAClE,mBAAe,aAAa,8BAA8B;AAI1D,QAAI,cAAc,UAAW;AAE7B,UAAM,WAAW;AAAA,MACf,OAAO;AAAA,MACP,OAAO,YAAY;AAAA,MACnB,QAAQ;AAAA,IACV;AACA,UAAM,iBAAiB,SAAS;AAChC,QAAI,CAAC,kBAAkB,wBAAwB,SAAS,cAAc,EAAG;AAEzE,UAAM,kBAAkB,QAAQ,cAAc,MAAM;AAEpD,eAAW,KAAK;AAAA,MACd;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAKA,iBAAe,aAAa,8BAA8B;AAE1D,SAAO,uBAAuB;AAAA,IAC5B;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,EACF,CAAC;AACH;","names":["alternatives"]}

package/dist/{chunk-QTXNS3HB.js → chunk-WCWIV2JH.js}

@@ -1,6 +1,6 @@
 import {
   resolveCorpusNamespaceRoots
-} from "./chunk-MYI3RKI6.js";
+} from "./chunk-SYU5JOBQ.js";
 import {
   capabilityAllowsNamespace
 } from "./chunk-MZWSOLMT.js";
@@ -200,4 +200,4 @@ async function readAggregateExtractionWatermark(options) {
 export {
   readAggregateExtractionWatermark
 };
-//# sourceMappingURL=chunk-QTXNS3HB.js.map
+//# sourceMappingURL=chunk-WCWIV2JH.js.map

package/dist/{chunk-6UKSOXAO.js → chunk-WQ6TRWAE.js}

@@ -7,10 +7,10 @@ import {
 import {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact
-} from "./chunk-3TDAA7VA.js";
+} from "./chunk-6NMZXEJ7.js";
 import {
   StorageManager
-} from "./chunk-Q5XKKDFQ.js";
+} from "./chunk-5SZ6CLGJ.js";
 import {
   normalizeProjectionPreview,
   normalizeProjectionTags
@@ -1005,4 +1005,4 @@ export {
   verifyMemoryProjection,
   repairMemoryProjection
 };
-//# sourceMappingURL=chunk-6UKSOXAO.js.map
+//# sourceMappingURL=chunk-WQ6TRWAE.js.map

package/dist/{chunk-CBY54QYW.js → chunk-X6HNXVXS.js}

@@ -9,14 +9,14 @@ import {
 } from "./chunk-666A3MOW.js";
 import {
   rebuildMemoryLifecycleLedger
-} from "./chunk-Q6OL23WM.js";
+} from "./chunk-Z4UPRZR6.js";
 import {
   planNamespaceMaintenance,
   runNamespaceMaintenanceBatchPlan
-} from "./chunk-QQYHYW2N.js";
+} from "./chunk-PQODT53H.js";
 import {
   rebuildMemoryProjection
-} from "./chunk-6UKSOXAO.js";
+} from "./chunk-WQ6TRWAE.js";
 import {
   activityDayWindow,
   activityDigestPath,
@@ -1719,4 +1719,4 @@ export {
   ActivitySyncScheduler,
   MaintenanceScheduler
 };
-//# sourceMappingURL=chunk-CBY54QYW.js.map
+//# sourceMappingURL=chunk-X6HNXVXS.js.map

package/dist/{chunk-DGUVXXAU.js → chunk-XFJUPJD7.js}

@@ -1,6 +1,6 @@
 import {
   isValidCapsuleSince
-} from "./chunk-VDX2J7OX.js";
+} from "./chunk-5W7CTZ2E.js";
 import {
   CAPSULE_ID_PATTERN
 } from "./chunk-WEHSQBFR.js";
@@ -475,4 +475,4 @@ export {
   actionConfidenceRequestSchema,
   validateRequest
 };
-//# sourceMappingURL=chunk-DGUVXXAU.js.map
+//# sourceMappingURL=chunk-XFJUPJD7.js.map

package/dist/{chunk-JPWSYHLB.js → chunk-YGSDWO3U.js}

@@ -1,6 +1,6 @@
 import {
   isNamespaceKind
-} from "./chunk-KFB4YNXM.js";
+} from "./chunk-G5F4MXXC.js";
 import {
   EngramAccessInputError
 } from "./chunk-2Z24E5W2.js";
@@ -40,4 +40,4 @@ export {
   positiveIntQueryParam,
   optionalNamespaceKindQueryParam
 };
-//# sourceMappingURL=chunk-JPWSYHLB.js.map
+//# sourceMappingURL=chunk-YGSDWO3U.js.map

package/dist/{chunk-GBVRVYF4.js → chunk-YINSSARY.js}

@@ -296,4 +296,4 @@ async function searchHarmonicRetrieval(options) {
 export {
   searchHarmonicRetrieval
 };
-//# sourceMappingURL=chunk-GBVRVYF4.js.map
+//# sourceMappingURL=chunk-YINSSARY.js.map