@yugenlab/vaayu 0.1.10 → 0.1.12

package/chunks/{chunk-OT4G2L46.js → chunk-M2RLX5LU.js}

@@ -6,24 +6,28 @@ import {
   STOP_WORDS,
   cosineSimilarity,
   textMatchScore
-} from "./chunk-JAWZ7ANC.js";
+} from "./chunk-RVKTGKFD.js";
 import {
-  initGraphSchema
-} from "./chunk-YJRXLRTE.js";
+  initGraphSchema,
+  init_schema
+} from "./chunk-VEZ2DI2M.js";
 import {
-  DatabaseManager
-} from "./chunk-U62ABYKD.js";
+  DatabaseManager,
+  init_database
+} from "./chunk-H46F2Y6R.js";
 import {
-  getChitraguptaHome
-} from "./chunk-UZ6OIVEC.js";
+  getChitraguptaHome,
+  init_dist
+} from "./chunk-KVQH4LE7.js";
 
-// ../chitragupta/packages/smriti/src/graphrag-pagerank.ts
+// ../chitragupta/packages/smriti/dist/graphrag-pagerank.js
 var PAGERANK_DAMPING = 0.85;
 var PAGERANK_EPSILON = 1e-4;
 var PAGERANK_MAX_ITERATIONS = 100;
 function computePageRank(graph) {
   const N = graph.nodes.length;
-  if (N === 0) return /* @__PURE__ */ new Map();
+  if (N === 0)
+    return /* @__PURE__ */ new Map();
   const ranks = /* @__PURE__ */ new Map();
   const nodeIds = /* @__PURE__ */ new Set();
   for (const node of graph.nodes) {
@@ -63,17 +67,19 @@ function computePageRank(graph) {
       const rank = baseFactor + PAGERANK_DAMPING * (incomingRank + danglingRank / N);
       newRanks.set(node.id, rank);
       const delta = Math.abs(rank - (ranks.get(node.id) ?? 0));
-      if (delta > maxDelta) maxDelta = delta;
+      if (delta > maxDelta)
+        maxDelta = delta;
     }
     for (const [id, rank] of newRanks) {
       ranks.set(id, rank);
     }
-    if (maxDelta < PAGERANK_EPSILON) break;
+    if (maxDelta < PAGERANK_EPSILON)
+      break;
   }
   return ranks;
 }
 
-// ../chitragupta/packages/smriti/src/graphrag-pagerank-incremental.ts
+// ../chitragupta/packages/smriti/dist/graphrag-pagerank-incremental.js
 var IncrementalPageRank = class {
   ranks = /* @__PURE__ */ new Map();
   outDegree = /* @__PURE__ */ new Map();
@@ -155,7 +161,8 @@ var IncrementalPageRank = class {
     if (oldDeg > 0) {
       const shareDelta = prU * (1 / newDeg - 1 / oldDeg);
       for (const neighbor of this.getOutNeighbors(source)) {
-        if (neighbor === target) continue;
+        if (neighbor === target)
+          continue;
         const prev = residuals.get(neighbor) ?? 0;
         residuals.set(neighbor, prev + this.damping * shareDelta);
       }
@@ -169,11 +176,14 @@ var IncrementalPageRank = class {
    * @param target - Target node ID.
    */
   removeEdge(source, target) {
-    if (!this.nodeSet.has(source) || !this.nodeSet.has(target)) return;
+    if (!this.nodeSet.has(source) || !this.nodeSet.has(target))
+      return;
     const inSet = this.inLinks.get(target);
-    if (!inSet || !inSet.has(source)) return;
+    if (!inSet || !inSet.has(source))
+      return;
     const oldDeg = this.outDegree.get(source) ?? 0;
-    if (oldDeg <= 0) return;
+    if (oldDeg <= 0)
+      return;
     const newDeg = oldDeg - 1;
     this.outDegree.set(source, newDeg);
     inSet.delete(source);
@@ -216,7 +226,8 @@ var IncrementalPageRank = class {
           maxNode = node;
         }
       }
-      if (maxNode === null || maxResidual < this.epsilon) break;
+      if (maxNode === null || maxResidual < this.epsilon)
+        break;
       const res = residuals.get(maxNode);
       this.ranks.set(maxNode, (this.ranks.get(maxNode) ?? 0) + res);
       residuals.delete(maxNode);
@@ -240,13 +251,14 @@ var IncrementalPageRank = class {
   }
 };
 
-// ../chitragupta/packages/smriti/src/graphrag-pagerank-personalized.ts
+// ../chitragupta/packages/smriti/dist/graphrag-pagerank-personalized.js
 function buildTopicBias(nodeIds, nodeContents, topic) {
   const bias = /* @__PURE__ */ new Map();
   const n = nodeIds.length;
   if (!topic || n === 0) {
     const uniform = 1 / Math.max(n, 1);
-    for (const id of nodeIds) bias.set(id, uniform);
+    for (const id of nodeIds)
+      bias.set(id, uniform);
     return bias;
   }
   const queryTerms = tokenizeSimple(topic);
@@ -263,7 +275,8 @@ function buildTopicBias(nodeIds, nodeContents, topic) {
   }
   if (totalSim === 0) {
     const uniform = 1 / n;
-    for (const id of nodeIds) bias.set(id, uniform);
+    for (const id of nodeIds)
+      bias.set(id, uniform);
     return bias;
   }
   for (let i = 0; i < n; i++) {
@@ -288,7 +301,8 @@ function tfCosineSimilarity(a, b) {
   for (const [term, freqA] of a) {
     normA += freqA * freqA;
     const freqB = b.get(term);
-    if (freqB !== void 0) dot += freqA * freqB;
+    if (freqB !== void 0)
+      dot += freqA * freqB;
   }
   for (const freqB of b.values()) {
     normB += freqB * freqB;
@@ -302,7 +316,8 @@ function computePersonalizedPageRank(graph, topicBias, opts) {
   const maxIter = opts?.maxIterations ?? 150;
   const useGS = opts?.useGaussSeidel ?? true;
   const N = graph.nodes.length;
-  if (N === 0) return /* @__PURE__ */ new Map();
+  if (N === 0)
+    return /* @__PURE__ */ new Map();
   const nodeIds = graph.nodes.map((n) => n.id);
   const nodeIdSet = new Set(nodeIds);
   const outDegree = /* @__PURE__ */ new Map();
@@ -336,7 +351,8 @@ function computePersonalizedPageRank(graph, topicBias, opts) {
   }
   const danglingNodes = [];
   for (const id of nodeIds) {
-    if ((outDegree.get(id) ?? 0) === 0) danglingNodes.push(id);
+    if ((outDegree.get(id) ?? 0) === 0)
+      danglingNodes.push(id);
   }
   for (let iter = 0; iter < maxIter; iter++) {
     let danglingSum = 0;
@@ -357,7 +373,8 @@ function computePersonalizedPageRank(graph, topicBias, opts) {
         const newRank = (1 - damping) * biasVal + damping * incomingSum + danglingContrib;
         const oldRank = ranks.get(id) ?? 0;
         const delta = Math.abs(newRank - oldRank);
-        if (delta > maxDelta) maxDelta = delta;
+        if (delta > maxDelta)
+          maxDelta = delta;
         ranks.set(id, newRank);
       }
     } else {
@@ -373,16 +390,19 @@ function computePersonalizedPageRank(graph, topicBias, opts) {
         const newRank = (1 - damping) * biasVal + damping * incomingSum + danglingContrib;
         newRanks.set(id, newRank);
         const delta = Math.abs(newRank - (ranks.get(id) ?? 0));
-        if (delta > maxDelta) maxDelta = delta;
+        if (delta > maxDelta)
+          maxDelta = delta;
       }
-      for (const [id, rank] of newRanks) ranks.set(id, rank);
+      for (const [id, rank] of newRanks)
+        ranks.set(id, rank);
     }
-    if (maxDelta < epsilon) break;
+    if (maxDelta < epsilon)
+      break;
   }
   return ranks;
 }
 
-// ../chitragupta/packages/smriti/src/graphrag-extraction.ts
+// ../chitragupta/packages/smriti/dist/graphrag-extraction.js
 var CHUNK_TARGET_TOKENS = 350;
 var CHUNK_MIN_TOKENS = 200;
 var CHUNK_MAX_TOKENS = 500;
@@ -396,7 +416,8 @@ function estimateTokens(text) {
 }
 function semanticChunk(text) {
   const sentences = splitSentences(text);
-  if (sentences.length === 0) return [];
+  if (sentences.length === 0)
+    return [];
   const totalTokens = estimateTokens(text);
   if (totalTokens <= CHUNK_MAX_TOKENS) {
     return [{ text, startSentence: 0, endSentence: sentences.length - 1 }];
@@ -425,7 +446,8 @@ function semanticChunk(text) {
       overlapTokens += estimateTokens(sentences[overlapStart]);
     }
     startIdx = Math.max(overlapStart, startIdx + 1);
-    if (startIdx >= endIdx) break;
+    if (startIdx >= endIdx)
+      break;
   }
   return chunks;
 }
@@ -483,8 +505,10 @@ function keywordExtractEntities(text) {
   const entities = [];
   const sorted = [...freq.entries()].sort((a, b) => b[1] - a[1]);
   for (const [word, count] of sorted) {
-    if (count < 2) break;
-    if (entities.length >= 20) break;
+    if (count < 2)
+      break;
+    if (entities.length >= 20)
+      break;
     entities.push({
       name: word,
       type: "concept",
@@ -494,7 +518,7 @@ function keywordExtractEntities(text) {
   return entities;
 }
 
-// ../chitragupta/packages/smriti/src/ner-extractor.ts
+// ../chitragupta/packages/smriti/dist/ner-extractor.js
 var DEFAULT_ENDPOINT = "http://localhost:8501";
 var DEFAULT_MODEL = "gliner-large-v2.1";
 var DEFAULT_MIN_CONFIDENCE = 0.5;
@@ -588,10 +612,7 @@ var TECHNOLOGY_WORDS = [
   "yarn",
   "zod"
 ];
-var TECHNOLOGY_PATTERN = new RegExp(
-  `\\b(${TECHNOLOGY_WORDS.join("|")})\\b`,
-  "gi"
-);
+var TECHNOLOGY_PATTERN = new RegExp(`\\b(${TECHNOLOGY_WORDS.join("|")})\\b`, "gi");
 var TOOL_WORDS = [
   "read",
   "write",
@@ -607,10 +628,7 @@ var TOOL_WORDS = [
   "webfetch",
   "websearch"
 ];
-var TOOL_PATTERN = new RegExp(
-  `\\b(${TOOL_WORDS.join("|")})\\b`,
-  "gi"
-);
+var TOOL_PATTERN = new RegExp(`\\b(${TOOL_WORDS.join("|")})\\b`, "gi");
 var ERROR_PATTERN = /\b((?:[A-Z]\w*Error)\b|(?:ENOENT|EACCES|ECONNREFUSED|ETIMEDOUT|EPERM)\b|(?:failed\s+to\s+\w+)|(?:error:\s*\S+))/gi;
 var DECISION_PATTERN = /\b((?:decided|chose|selected|opted|switched|migrated|moved)\s+to\s+\w[\w\s]{0,30})/gi;
 var ACTION_PATTERN = /\b((?:created|deleted|removed|modified|updated|installed|uninstalled|deployed|fixed|refactored|renamed|merged|rebased|reverted|committed|pushed|pulled)\s+\w[\w\s]{0,30})/gi;
@@ -639,7 +657,8 @@ var NERExtractor = class {
    * and `useHeuristic` is enabled.
    */
   async extract(text) {
-    if (!text || text.trim().length === 0) return [];
+    if (!text || text.trim().length === 0)
+      return [];
     const glinerUp = await this.isGLiNERAvailable();
     if (glinerUp) {
       try {
@@ -666,7 +685,8 @@ var NERExtractor = class {
    * Caches the result after the first successful probe.
    */
   async isGLiNERAvailable() {
-    if (this.glinerAvailable !== null) return this.glinerAvailable;
+    if (this.glinerAvailable !== null)
+      return this.glinerAvailable;
     try {
       const response = await fetch(this.endpoint, {
         method: "GET",
@@ -732,10 +752,12 @@ var NERExtractor = class {
     const coveredSpans = [];
     const addMatch = (match, type, groupIndex = 1) => {
       const captured = match[groupIndex];
-      if (!captured) return;
+      if (!captured)
+        return;
       const start = match.index + match[0].indexOf(captured);
       const end = start + captured.length;
-      if (this.spanOverlaps([start, end], coveredSpans)) return;
+      if (this.spanOverlaps([start, end], coveredSpans))
+        return;
       coveredSpans.push([start, end]);
       entities.push({
         text: captured.trim(),
@@ -783,9 +805,7 @@ var NERExtractor = class {
    */
   postProcess(entities) {
     const typeSet = new Set(this.entityTypes);
-    let filtered = entities.filter(
-      (e) => typeSet.has(e.type) && e.confidence >= this.minConfidence
-    );
+    let filtered = entities.filter((e) => typeSet.has(e.type) && e.confidence >= this.minConfidence);
     const seen = /* @__PURE__ */ new Map();
     for (const entity of filtered) {
       const key = `${entity.type}::${entity.text.toLowerCase().trim()}`;
@@ -796,14 +816,15 @@ var NERExtractor = class {
     }
     filtered = [...seen.values()];
     filtered.sort((a, b) => {
-      if (b.confidence !== a.confidence) return b.confidence - a.confidence;
+      if (b.confidence !== a.confidence)
+        return b.confidence - a.confidence;
       return a.span[0] - b.span[0];
     });
     return filtered.slice(0, this.maxEntities);
   }
 };
 
-// ../chitragupta/packages/smriti/src/bitemporal.ts
+// ../chitragupta/packages/smriti/dist/bitemporal.js
 function nowISO() {
   return (/* @__PURE__ */ new Date()).toISOString();
 }
@@ -844,14 +865,19 @@ function expireEdge(edge, validUntil) {
 function queryEdgesAtTime(edges, asOfValid, asOfRecord) {
   return edges.filter((e) => {
     const vFrom = e.validFrom ?? EPOCH_ISO;
-    if (vFrom > asOfValid) return false;
-    if (e.validUntil !== void 0 && e.validUntil <= asOfValid) return false;
+    if (vFrom > asOfValid)
+      return false;
+    if (e.validUntil !== void 0 && e.validUntil <= asOfValid)
+      return false;
     if (asOfRecord !== void 0) {
       const rAt = e.recordedAt ?? EPOCH_ISO;
-      if (rAt > asOfRecord) return false;
-      if (e.supersededAt !== void 0 && e.supersededAt <= asOfRecord) return false;
+      if (rAt > asOfRecord)
+        return false;
+      if (e.supersededAt !== void 0 && e.supersededAt <= asOfRecord)
+        return false;
     } else {
-      if (e.supersededAt !== void 0) return false;
+      if (e.supersededAt !== void 0)
+        return false;
     }
     return true;
   });
@@ -862,19 +888,21 @@ function getEdgeHistory(edges, source, target) {
 function temporalDecay(edge, now, halfLifeMs) {
   const referenceTime = edge.validUntil !== void 0 ? new Date(edge.validUntil).getTime() : new Date(edge.validFrom ?? EPOCH_ISO).getTime();
   const elapsed = now - referenceTime;
-  if (elapsed <= 0) return edge.weight;
+  if (elapsed <= 0)
+    return edge.weight;
   const decay = Math.exp(-Math.LN2 * elapsed / halfLifeMs);
   return edge.weight * decay;
 }
 function compactEdges(edges, retentionMs) {
   const cutoff = Date.now() - retentionMs;
   return edges.filter((e) => {
-    if (e.supersededAt === void 0) return true;
+    if (e.supersededAt === void 0)
+      return true;
     return new Date(e.supersededAt).getTime() > cutoff;
   });
 }
 
-// ../chitragupta/packages/smriti/src/graphrag-builder.ts
+// ../chitragupta/packages/smriti/dist/graphrag-builder.js
 function scopeToId(scope) {
   switch (scope.type) {
     case "global":
@@ -919,7 +947,8 @@ async function createSessionNode(ctx, session) {
 async function extractConceptsFromNodes(ctx, nodes, edges) {
   const entityIndex = /* @__PURE__ */ new Map();
   for (const node of nodes) {
-    if (!node.content || node.type === "concept") continue;
+    if (!node.content || node.type === "concept")
+      continue;
     const entities = await ctx.extractEntities(node.content);
     for (const entity of entities) {
       const key = entity.name.toLowerCase();
@@ -935,9 +964,11 @@ async function extractConceptsFromNodes(ctx, nodes, edges) {
     }
   }
   for (const [key, data] of entityIndex) {
-    if (data.sourceIds.length < 2) continue;
+    if (data.sourceIds.length < 2)
+      continue;
     const conceptId = `concept-${key.replace(/\s+/g, "-")}`;
-    if (nodes.some((n) => n.id === conceptId)) continue;
+    if (nodes.some((n) => n.id === conceptId))
+      continue;
     const conceptNode = {
       id: conceptId,
       type: "concept",
@@ -1104,21 +1135,15 @@ function removeSessionFromGraph(graph, sessionId) {
     }
   }
   graph.nodes = graph.nodes.filter((n) => !nodeIdsToRemove.has(n.id));
-  graph.edges = graph.edges.filter(
-    (e) => !nodeIdsToRemove.has(e.source) && !nodeIdsToRemove.has(e.target)
-  );
+  graph.edges = graph.edges.filter((e) => !nodeIdsToRemove.has(e.source) && !nodeIdsToRemove.has(e.target));
 }
 function removeMemoryFromGraph(graph, scope) {
   const memoryId = scopeToId(scope);
-  graph.nodes = graph.nodes.filter(
-    (n) => n.id !== memoryId && !n.id.startsWith(`${memoryId}-chunk-`)
-  );
-  graph.edges = graph.edges.filter(
-    (e) => e.source !== memoryId && e.target !== memoryId && !e.source.startsWith(`${memoryId}-chunk-`) && !e.target.startsWith(`${memoryId}-chunk-`)
-  );
+  graph.nodes = graph.nodes.filter((n) => n.id !== memoryId && !n.id.startsWith(`${memoryId}-chunk-`));
+  graph.edges = graph.edges.filter((e) => e.source !== memoryId && e.target !== memoryId && !e.source.startsWith(`${memoryId}-chunk-`) && !e.target.startsWith(`${memoryId}-chunk-`));
 }
 
-// ../chitragupta/packages/smriti/src/leiden-algorithm.ts
+// ../chitragupta/packages/smriti/dist/leiden-algorithm.js
 var Xorshift32 = class {
   state;
   constructor(seed) {
@@ -1161,8 +1186,10 @@ var AdjacencyGraph = class {
     for (const edge of graph.edges) {
       const s = this.idToIndex.get(edge.source);
       const t = this.idToIndex.get(edge.target);
-      if (s === void 0 || t === void 0) continue;
-      if (s === t) continue;
+      if (s === void 0 || t === void 0)
+        continue;
+      if (s === t)
+        continue;
       const w = edge.weight ?? 1;
       this.adj[s].set(t, (this.adj[s].get(t) ?? 0) + w);
       this.adj[t].set(s, (this.adj[t].get(s) ?? 0) + w);
@@ -1175,7 +1202,8 @@ var AdjacencyGraph = class {
 };
 function computeModularity(g, assignment, resolution) {
   const twoM = g.totalWeight;
-  if (twoM === 0) return 0;
+  if (twoM === 0)
+    return 0;
   const internalWeight = /* @__PURE__ */ new Map();
   const communityDegree = /* @__PURE__ */ new Map();
   for (let i = 0; i < g.n; i++) {
@@ -1197,15 +1225,19 @@ function computeModularity(g, assignment, resolution) {
 }
 function modularityGain(g, i, cNew, assignment, communityDegree, resolution) {
   const twoM = g.totalWeight;
-  if (twoM === 0) return 0;
+  if (twoM === 0)
+    return 0;
   const cOld = assignment[i];
-  if (cOld === cNew) return 0;
+  if (cOld === cNew)
+    return 0;
   const ki = g.degree[i];
   let kInNew = 0;
   let kInOld = 0;
   for (const [j, w] of g.adj[i]) {
-    if (assignment[j] === cNew) kInNew += w;
-    if (assignment[j] === cOld) kInOld += w;
+    if (assignment[j] === cNew)
+      kInNew += w;
+    if (assignment[j] === cOld)
+      kInOld += w;
   }
   const sigmaTotNew = communityDegree.get(cNew) ?? 0;
   const sigmaTotOld = communityDegree.get(cOld) ?? 0;
@@ -1235,7 +1267,8 @@ function localNodeMoving(g, assignment, resolution, rng) {
     let bestCommunity = cOld;
     let bestGain = 0;
     for (const cNew of neighborCommunities) {
-      if (cNew === cOld) continue;
+      if (cNew === cOld)
+        continue;
       const gain = modularityGain(g, i, cNew, assignment, communityDegree, resolution);
       if (gain > bestGain) {
         bestGain = gain;
@@ -1255,17 +1288,20 @@ function refineCommunities(g, assignment) {
   const communityNodes = /* @__PURE__ */ new Map();
   for (let i = 0; i < g.n; i++) {
     const c = assignment[i];
-    if (!communityNodes.has(c)) communityNodes.set(c, []);
+    if (!communityNodes.has(c))
+      communityNodes.set(c, []);
     communityNodes.get(c).push(i);
   }
   let nextCommunityId = Math.max(...assignment) + 1;
   for (const [_communityId, nodes] of communityNodes) {
-    if (nodes.length <= 1) continue;
+    if (nodes.length <= 1)
+      continue;
     const nodeSet = new Set(nodes);
     const visited = /* @__PURE__ */ new Set();
     const components = [];
     for (const start of nodes) {
-      if (visited.has(start)) continue;
+      if (visited.has(start))
+        continue;
       const component = [];
       const queue = [start];
       visited.add(start);
@@ -1322,7 +1358,7 @@ function compactCommunities(assignment, minSize) {
   return assignment.map((c) => remap.get(c) ?? 0);
 }
 
-// ../chitragupta/packages/smriti/src/graphrag-leiden.ts
+// ../chitragupta/packages/smriti/dist/graphrag-leiden.js
 var DEFAULT_LEIDEN_CONFIG = {
   resolution: 1,
   maxIterations: 10,
@@ -1376,7 +1412,8 @@ function buildCommunityList(g, compacted, resolution) {
   const communityNodes = /* @__PURE__ */ new Map();
   for (let i = 0; i < g.n; i++) {
     const c = compacted[i];
-    if (!communityNodes.has(c)) communityNodes.set(c, []);
+    if (!communityNodes.has(c))
+      communityNodes.set(c, []);
     communityNodes.get(c).push(g.indexToId[i]);
   }
   const communityList = [];
@@ -1395,7 +1432,8 @@ function buildCommunityList(g, compacted, resolution) {
     const possibleEdges = members.length * (members.length - 1) / 2;
     const density = possibleEdges > 0 ? internalEdges / possibleEdges : 0;
     let ac = 0;
-    for (const mi of memberSet) ac += g.degree[mi];
+    for (const mi of memberSet)
+      ac += g.degree[mi];
     const twoM = g.totalWeight;
     const communityMod = twoM > 0 ? 2 * internalWeight / twoM - resolution * (ac / twoM) ** 2 : 0;
     communityList.push({
@@ -1417,9 +1455,7 @@ function annotateCommunities(graph, result) {
   }
 }
 function communitySummary(graph, communityId, maxLabels = 5) {
-  const members = graph.nodes.filter(
-    (n) => n.metadata.communityId === communityId
-  );
+  const members = graph.nodes.filter((n) => n.metadata.communityId === communityId);
   const typeCount = {};
   for (const node of members) {
     typeCount[node.type] = (typeCount[node.type] ?? 0) + 1;
@@ -1441,8 +1477,10 @@ function findBridgeNodes(graph, result, minCommunities = 2) {
   for (const edge of graph.edges) {
     const sc = result.communities.get(edge.source);
     const tc = result.communities.get(edge.target);
-    if (sc === void 0 || tc === void 0) continue;
-    if (sc === tc) continue;
+    if (sc === void 0 || tc === void 0)
+      continue;
+    if (sc === tc)
+      continue;
     touchedCommunities.get(edge.source)?.add(tc);
     touchedCommunities.get(edge.target)?.add(sc);
   }
@@ -1456,7 +1494,10 @@ function findBridgeNodes(graph, result, minCommunities = 2) {
   return bridges;
 }
 
-// ../chitragupta/packages/smriti/src/graphrag-persistence.ts
+// ../chitragupta/packages/smriti/dist/graphrag-persistence.js
+init_dist();
+init_database();
+init_schema();
 import fs from "fs";
 import path from "path";
 function getGraphDir() {
@@ -1494,26 +1535,17 @@ function insertEdgeToDb(db, edge) {
     INSERT OR IGNORE INTO edges (source, target, relationship, weight, pramana, viveka,
       valid_from, valid_until, recorded_at, superseded_at)
     VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
-  `).run(
-    edge.source,
-    edge.target,
-    edge.relationship,
-    edge.weight,
-    null,
-    null,
-    edge.validFrom ? new Date(edge.validFrom).getTime() : Date.now(),
-    edge.validUntil ? new Date(edge.validUntil).getTime() : null,
-    edge.recordedAt ? new Date(edge.recordedAt).getTime() : Date.now(),
-    edge.supersededAt ? new Date(edge.supersededAt).getTime() : null
-  );
+  `).run(edge.source, edge.target, edge.relationship, edge.weight, null, null, edge.validFrom ? new Date(edge.validFrom).getTime() : Date.now(), edge.validUntil ? new Date(edge.validUntil).getTime() : null, edge.recordedAt ? new Date(edge.recordedAt).getTime() : Date.now(), edge.supersededAt ? new Date(edge.supersededAt).getTime() : null);
 }
 function saveToSqlite(db, graph, pageRankScores, embeddingCache) {
   db.transaction(() => {
     db.prepare("DELETE FROM pagerank").run();
     db.prepare("DELETE FROM edges").run();
     db.prepare("DELETE FROM nodes").run();
-    for (const node of graph.nodes) upsertNodeToDb(db, node);
-    for (const edge of graph.edges) insertEdgeToDb(db, edge);
+    for (const node of graph.nodes)
+      upsertNodeToDb(db, node);
+    for (const edge of graph.edges)
+      insertEdgeToDb(db, edge);
     for (const [nodeId, score] of pageRankScores) {
       db.prepare("INSERT OR REPLACE INTO pagerank (node_id, score, updated_at) VALUES (?, ?, ?)").run(nodeId, score, Date.now());
     }
@@ -1522,7 +1554,8 @@ function saveToSqlite(db, graph, pageRankScores, embeddingCache) {
 }
 function loadFromSqlite(db) {
   const nodeCount = db.prepare("SELECT COUNT(*) as cnt FROM nodes").get().cnt;
-  if (nodeCount === 0) return null;
+  if (nodeCount === 0)
+    return null;
   const nodeRows = db.prepare("SELECT * FROM nodes").all();
   const nodes = nodeRows.map((row) => ({
     id: row.id,
@@ -1557,8 +1590,10 @@ function loadFromSqlite(db) {
 }
 function migrateInMemoryToSqlite(db, graph, pageRankScores) {
   db.transaction(() => {
-    for (const node of graph.nodes) upsertNodeToDb(db, node);
-    for (const edge of graph.edges) insertEdgeToDb(db, edge);
+    for (const node of graph.nodes)
+      upsertNodeToDb(db, node);
+    for (const edge of graph.edges)
+      insertEdgeToDb(db, edge);
     for (const [nodeId, score] of pageRankScores) {
       db.prepare("INSERT OR REPLACE INTO pagerank (node_id, score, updated_at) VALUES (?, ?, ?)").run(nodeId, score, Date.now());
     }
@@ -1571,7 +1606,8 @@ function saveToJson(graph, pageRankScores, embeddingCache) {
     fs.writeFileSync(getGraphPath(), JSON.stringify(graph, null, "	"), "utf-8");
     saveEmbeddingsJson(embeddingCache);
     const pageRankObj = {};
-    for (const [key, value] of pageRankScores) pageRankObj[key] = value;
+    for (const [key, value] of pageRankScores)
+      pageRankObj[key] = value;
     fs.writeFileSync(getPageRankPath(), JSON.stringify(pageRankObj, null, "	"), "utf-8");
   } catch {
   }
@@ -1591,7 +1627,8 @@ function loadFromJson() {
     const prPath = getPageRankPath();
     if (fs.existsSync(prPath)) {
       const ranks = JSON.parse(fs.readFileSync(prPath, "utf-8"));
-      for (const [key, value] of Object.entries(ranks)) pageRankScores.set(key, value);
+      for (const [key, value] of Object.entries(ranks))
+        pageRankScores.set(key, value);
     }
   } catch {
   }
@@ -1602,7 +1639,8 @@ function saveEmbeddingsJson(embeddingCache) {
     const dir = getGraphDir();
     fs.mkdirSync(dir, { recursive: true });
     const embeddings = {};
-    for (const [key, value] of embeddingCache) embeddings[key] = value;
+    for (const [key, value] of embeddingCache)
+      embeddings[key] = value;
     fs.writeFileSync(getEmbeddingsPath(), JSON.stringify(embeddings, null, "	"), "utf-8");
   } catch {
   }
@@ -1613,10 +1651,12 @@ function loadEmbeddingsJson(maxCacheSize) {
     const embPath = getEmbeddingsPath();
     if (fs.existsSync(embPath)) {
       const embeddings = JSON.parse(fs.readFileSync(embPath, "utf-8"));
-      for (const [key, value] of Object.entries(embeddings)) cache.set(key, value);
+      for (const [key, value] of Object.entries(embeddings))
+        cache.set(key, value);
       while (cache.size > maxCacheSize) {
         const oldest = cache.keys().next().value;
-        if (oldest !== void 0) cache.delete(oldest);
+        if (oldest !== void 0)
+          cache.delete(oldest);
       }
     }
   } catch {
@@ -1624,23 +1664,27 @@ function loadEmbeddingsJson(maxCacheSize) {
   return cache;
 }
 function lookupPramana(db, nodeId) {
-  if (!db) return "shabda";
+  if (!db)
+    return "shabda";
   try {
     const row = db.prepare(`
       SELECT pramana, COUNT(*) as cnt FROM edges
       WHERE (source = ? OR target = ?) AND pramana IS NOT NULL
       GROUP BY pramana ORDER BY cnt DESC LIMIT 1
     `).get(nodeId, nodeId);
-    if (row?.pramana) return row.pramana;
+    if (row?.pramana)
+      return row.pramana;
   } catch {
   }
   return "shabda";
 }
 function lookupPramanaBatch(db, nodeIds) {
   const result = /* @__PURE__ */ new Map();
-  if (nodeIds.length === 0) return result;
+  if (nodeIds.length === 0)
+    return result;
   if (!db) {
-    for (const id of nodeIds) result.set(id, "shabda");
+    for (const id of nodeIds)
+      result.set(id, "shabda");
     return result;
   }
   try {
@@ -1656,26 +1700,31 @@ function lookupPramanaBatch(db, nodeIds) {
         GROUP BY target, pramana
       ) GROUP BY node_id HAVING cnt = MAX(cnt)
     `).all(...nodeIds, ...nodeIds);
-    for (const row of rows) result.set(row.node_id, row.pramana);
+    for (const row of rows)
+      result.set(row.node_id, row.pramana);
   } catch {
   }
   for (const id of nodeIds) {
-    if (!result.has(id)) result.set(id, "shabda");
+    if (!result.has(id))
+      result.set(id, "shabda");
   }
   return result;
 }
 function migrateGraphJson() {
   const graphPath = getGraphPath();
   const prPath = getPageRankPath();
-  if (!fs.existsSync(graphPath)) return { nodes: 0, edges: 0 };
+  if (!fs.existsSync(graphPath))
+    return { nodes: 0, edges: 0 };
   try {
     const graph = JSON.parse(fs.readFileSync(graphPath, "utf-8"));
-    if (!graph.nodes || graph.nodes.length === 0) return { nodes: 0, edges: 0 };
+    if (!graph.nodes || graph.nodes.length === 0)
+      return { nodes: 0, edges: 0 };
     const pageRankScores = /* @__PURE__ */ new Map();
     try {
       if (fs.existsSync(prPath)) {
         const ranks = JSON.parse(fs.readFileSync(prPath, "utf-8"));
-        for (const [key, value] of Object.entries(ranks)) pageRankScores.set(key, value);
+        for (const [key, value] of Object.entries(ranks))
+          pageRankScores.set(key, value);
       }
     } catch {
     }
@@ -1692,35 +1741,24 @@ function migrateGraphJson() {
           valid_from, valid_until, recorded_at, superseded_at)
         VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
       `);
-      const prStmt = db.prepare(
-        "INSERT OR REPLACE INTO pagerank (node_id, score, updated_at) VALUES (?, ?, ?)"
-      );
+      const prStmt = db.prepare("INSERT OR REPLACE INTO pagerank (node_id, score, updated_at) VALUES (?, ?, ?)");
       const now = Date.now();
       for (const node of graph.nodes) {
         upsertStmt.run(node.id, node.type, node.label, node.content, JSON.stringify(node.metadata), now, now);
       }
       for (const edge of graph.edges) {
-        edgeStmt.run(
-          edge.source,
-          edge.target,
-          edge.relationship,
-          edge.weight,
-          null,
-          null,
-          edge.validFrom ? new Date(edge.validFrom).getTime() : now,
-          edge.validUntil ? new Date(edge.validUntil).getTime() : null,
-          edge.recordedAt ? new Date(edge.recordedAt).getTime() : now,
-          edge.supersededAt ? new Date(edge.supersededAt).getTime() : null
-        );
+        edgeStmt.run(edge.source, edge.target, edge.relationship, edge.weight, null, null, edge.validFrom ? new Date(edge.validFrom).getTime() : now, edge.validUntil ? new Date(edge.validUntil).getTime() : null, edge.recordedAt ? new Date(edge.recordedAt).getTime() : now, edge.supersededAt ? new Date(edge.supersededAt).getTime() : null);
       }
-      for (const [nodeId, score] of pageRankScores) prStmt.run(nodeId, score, now);
+      for (const [nodeId, score] of pageRankScores)
+        prStmt.run(nodeId, score, now);
     })();
     try {
       fs.renameSync(graphPath, graphPath + ".bak");
     } catch {
     }
     try {
-      if (fs.existsSync(prPath)) fs.renameSync(prPath, prPath + ".bak");
+      if (fs.existsSync(prPath))
+        fs.renameSync(prPath, prPath + ".bak");
     } catch {
     }
     return { nodes: graph.nodes.length, edges: graph.edges.length };
@@ -1729,7 +1767,7 @@ function migrateGraphJson() {
   }
 }
 
-// ../chitragupta/packages/smriti/src/graphrag.ts
+// ../chitragupta/packages/smriti/dist/graphrag.js
 var DEFAULT_CONFIG = {
   endpoint: process.env.OLLAMA_HOST ?? "http://localhost:11434",
   model: "nomic-embed-text",
@@ -1757,7 +1795,8 @@ var GraphRAGEngine = class {
     this.loadFromDisk();
   }
   async checkOllamaAvailability() {
-    if (this.ollamaAvailable !== null) return this.ollamaAvailable;
+    if (this.ollamaAvailable !== null)
+      return this.ollamaAvailable;
     try {
       const response = await fetch(`${this.config.endpoint}/api/version`, {
         method: "GET",
@@ -1772,12 +1811,14 @@ var GraphRAGEngine = class {
   /** Get (or compute and cache) an embedding vector for the given text. */
   async getEmbedding(text) {
     const cached = this.embeddingCache.get(text);
-    if (cached) return cached;
+    if (cached)
+      return cached;
     const vector = await this.embeddingService.getEmbedding(text);
     this.embeddingCache.set(text, vector);
     if (this.embeddingCache.size > this.maxEmbeddingCacheSize) {
       const oldest = this.embeddingCache.keys().next().value;
-      if (oldest !== void 0) this.embeddingCache.delete(oldest);
+      if (oldest !== void 0)
+        this.embeddingCache.delete(oldest);
     }
     return vector;
   }
@@ -1792,7 +1833,9 @@ var GraphRAGEngine = class {
     if (isAvailable) {
       try {
         baseEntities = await llmExtractEntities(text, this.config.endpoint, this.config.generationModel);
-      } catch {
+      } catch (err) {
+        process.stderr.write(`[smriti:graphrag] LLM entity extraction failed, falling back to keywords: ${err instanceof Error ? err.message : String(err)}
+`);
         baseEntities = keywordExtractEntities(text);
       }
     } else {
@@ -1825,7 +1868,9 @@ var GraphRAGEngine = class {
           seen.add(normalized);
         }
       }
-    } catch {
+    } catch (err) {
+      process.stderr.write(`[smriti:graphrag] NER extraction failed: ${err instanceof Error ? err.message : String(err)}
+`);
     }
     return baseEntities;
   }
@@ -1838,14 +1883,18 @@ var GraphRAGEngine = class {
   }
   /** Feed removed edges into incremental PR engine. */
   applyEdgeRemovals(edges) {
-    if (!this.incrementalPR || edges.length === 0) return;
-    for (const edge of edges) this.incrementalPR.removeEdge(edge.source, edge.target);
+    if (!this.incrementalPR || edges.length === 0)
+      return;
+    for (const edge of edges)
+      this.incrementalPR.removeEdge(edge.source, edge.target);
     this.pageRankScores = this.incrementalPR.getRanks();
   }
   /** Feed newly added edges into incremental PR engine. */
   applyEdgeAdditions(edges) {
-    if (!this.incrementalPR || edges.length === 0) return;
-    for (const edge of edges) this.incrementalPR.addEdge(edge.source, edge.target);
+    if (!this.incrementalPR || edges.length === 0)
+      return;
+    for (const edge of edges)
+      this.incrementalPR.addEdge(edge.source, edge.target);
     this.pageRankScores = this.incrementalPR.getRanks();
   }
   /**
@@ -1878,7 +1927,8 @@ var GraphRAGEngine = class {
       nodes.push(await createSessionNode(this, session));
       await indexSessionTurns(this, session, nodes, edges);
     }
-    for (const memory of memories) await buildMemoryNodes(this, memory, nodes, edges);
+    for (const memory of memories)
+      await buildMemoryNodes(this, memory, nodes, edges);
     await extractConceptsFromNodes(this, nodes, edges);
     this.graph = { nodes, edges };
     if (this.graph.nodes.length > 0 && this.graph.edges.length > 0) {
@@ -1892,13 +1942,16 @@ var GraphRAGEngine = class {
   /** Search the knowledge graph using hybrid scoring (cosine + PageRank + BM25). */
   async search(query, graph, topK = 10) {
     const searchGraph = graph ?? this.graph;
-    if (searchGraph.nodes.length === 0) return [];
+    if (searchGraph.nodes.length === 0)
+      return [];
     const queryEmbedding = await this.getEmbedding(query);
-    if (this.pageRankScores.size === 0) this.computePageRank(searchGraph);
+    if (this.pageRankScores.size === 0)
+      this.computePageRank(searchGraph);
     let maxPageRank = 0;
     for (const node of searchGraph.nodes) {
       const pr = this.pageRankScores.get(node.id) ?? 0;
-      if (pr > maxPageRank) maxPageRank = pr;
+      if (pr > maxPageRank)
+        maxPageRank = pr;
     }
     const scored = [];
     for (const node of searchGraph.nodes) {
@@ -1910,7 +1963,8 @@ var GraphRAGEngine = class {
       const normPR = maxPageRank > 0 ? rawPR / maxPageRank : 0;
       const textScore = textMatchScore(query, node.content + " " + node.label);
       const finalScore = ALPHA * cosineSim + BETA * normPR + GAMMA * textScore;
-      if (finalScore > 0) scored.push({ node, score: finalScore });
+      if (finalScore > 0)
+        scored.push({ node, score: finalScore });
     }
     scored.sort((a, b) => b.score - a.score);
     return scored.slice(0, topK).map((s) => s.node);
@@ -1975,7 +2029,9 @@ var GraphRAGEngine = class {
         saveToSqlite(db, this.graph, this.pageRankScores, this.embeddingCache);
         return;
       }
-    } catch {
+    } catch (err) {
+      process.stderr.write(`[smriti:graphrag] SQLite save failed, falling back to JSON: ${err instanceof Error ? err.message : String(err)}
+`);
     }
     saveToJson(this.graph, this.pageRankScores, this.embeddingCache);
   }
@@ -1996,13 +2052,17 @@ var GraphRAGEngine = class {
           if (this.graph.nodes.length > 0) {
             try {
               migrateInMemoryToSqlite(db, this.graph, this.pageRankScores);
-            } catch {
+            } catch (err) {
+              process.stderr.write(`[smriti:graphrag] in-memory to SQLite migration failed: ${err instanceof Error ? err.message : String(err)}
+`);
             }
           }
         }
         loaded = true;
       }
-    } catch {
+    } catch (err) {
+      process.stderr.write(`[smriti:graphrag] SQLite load failed: ${err instanceof Error ? err.message : String(err)}
+`);
     }
     if (!loaded) {
       const jsonData = loadFromJson();
@@ -2012,7 +2072,8 @@ var GraphRAGEngine = class {
     for (const [k, v] of loadEmbeddingsJson(this.maxEmbeddingCacheSize)) {
       this.embeddingCache.set(k, v);
     }
-    if (this.graph.edges.length > 0) this.initIncrementalPR();
+    if (this.graph.edges.length > 0)
+      this.initIncrementalPR();
   }
   /** Get the current in-memory knowledge graph. */
   getGraph() {
@@ -2026,8 +2087,11 @@ var GraphRAGEngine = class {
     this.incrementalPR = null;
     try {
       const db = this.getGraphDbHandle();
-      if (db) db.exec("DELETE FROM pagerank; DELETE FROM edges; DELETE FROM nodes;");
-    } catch {
+      if (db)
+        db.exec("DELETE FROM pagerank; DELETE FROM edges; DELETE FROM nodes;");
+    } catch (err) {
+      process.stderr.write(`[smriti:graphrag] clear DB failed: ${err instanceof Error ? err.message : String(err)}
+`);
     }
     this.saveToDisk();
   }
@@ -2042,8 +2106,10 @@ var GraphRAGEngine = class {
    */
   getNeighbors(nodeId, direction = "both") {
     return this.graph.edges.filter((edge) => {
-      if (direction === "out") return edge.source === nodeId;
-      if (direction === "in") return edge.target === nodeId;
+      if (direction === "out")
+        return edge.source === nodeId;
+      if (direction === "in")
+        return edge.target === nodeId;
       return edge.source === nodeId || edge.target === nodeId;
     });
   }
@@ -2068,4 +2134,4 @@ export {
   migrateGraphJson,
   GraphRAGEngine
 };
-//# sourceMappingURL=chunk-OT4G2L46.js.map
+//# sourceMappingURL=chunk-M2RLX5LU.js.map