@kage-core/kage-graph-mcp 2.2.5 → 2.2.7

package/dist/kernel.js

@@ -8089,9 +8089,15 @@ function kageRisk(projectDir, targets = [], changedFiles = []) {
     const graph = readCurrentCodeGraph(projectDir) ?? buildCodeGraph(projectDir);
     const graphPaths = new Set(graph.files.map((file) => file.path));
     const dependents = codeDependents(graph);
-    const resolvedTargets = unique((targets.length ? targets : changedFiles.length ? changedFiles : gitChangedFiles(projectDir))
+    const explicitTargets = targets.length > 0;
+    const resolvedTargets = unique((explicitTargets ? targets : changedFiles.length ? changedFiles : gitChangedFiles(projectDir))
         .map((path) => gitPathToProjectRelative(projectDir, path) ?? path)
-        .filter((path) => path && !isNoisePath(path)));
+        .filter((path) => path && !isNoisePath(path))
+        // Risk is a CODE assessment. When inferring targets from the working tree,
+        // keep only files the code graph actually knows about — memory packets,
+        // dotfiles, and docs have no dependents/hotspot signal and are pure noise
+        // here. Explicitly-named targets are always honored.
+        .filter((path) => explicitTargets || graphPaths.has(path)));
     const warnings = [];
     if (!gitHead(projectDir))
         warnings.push("Git history is unavailable, so churn, ownership, and co-change signals may be empty.");
@@ -8533,6 +8539,12 @@ const TRUTH_COMMON_SYMBOL_NAMES = new Set([
     "build", "parse", "load", "save", "update", "delete", "remove", "test", "validate",
     "format", "process", "next", "send", "write", "read", "config", "helper", "util",
 ]);
+// Convention-named local closures that collide across unrelated code by idiom,
+// not duplication. Kept separate from common-names so the intent is clear.
+const TRUTH_DUPLICATE_NAME_DENYLIST = new Set([
+    "decorator", "wrapper", "inner", "callback", "wrapped", "fn", "cb", "noop",
+    "predicate", "comparator", "getter", "setter", "factory", "visit",
+]);
 function truthExcludedPath(path) {
     return /(^|\/)(tests?|__tests__|specs?|examples?|fixtures?|benchmarks?|mocks?|__mocks__|vendor|node_modules|dist|build)\//i.test(path)
         || /\.(test|spec)\.[^.]+$/i.test(path)
@@ -8619,7 +8631,14 @@ function truthReport(projectDir) {
     // 1a. Duplicate implementations: same-name symbols spread across directories.
     const symbolsByName = new Map();
     for (const symbol of graph.symbols) {
-        if (!["function", "class", "method"].includes(symbol.kind))
+        // Methods are excluded: same-named methods on different classes (__init__,
+        // to_dict, validate, ...) are normal polymorphism, not duplication. Only
+        // top-level functions and classes can be genuine parallel implementations.
+        if (!["function", "class"].includes(symbol.kind))
+            continue;
+        // Dunders and convention-named local closures (decorator/wrapper/inner/...)
+        // collide by language idiom across unrelated code; never real duplicates.
+        if (/^__.*__$/.test(symbol.name) || TRUTH_DUPLICATE_NAME_DENYLIST.has(symbol.name.toLowerCase()))
             continue;
         if (symbol.name.length < 4 || TRUTH_COMMON_SYMBOL_NAMES.has(symbol.name.toLowerCase()))
             continue;
@@ -8641,14 +8660,16 @@ function truthReport(projectDir) {
             signatureCounts.set(normalized, (signatureCounts.get(normalized) ?? 0) + 1);
         }
         const signatureMatch = [...signatureCounts.values()].some((count) => count >= 2);
+        // A same-name-only collision across dirs is weak signal and the source of
+        // most false positives. Require a matching signature to report it at all.
+        if (!signatureMatch)
+            continue;
         const newestEpoch = Math.max(0, ...members.map((member) => fileNewestEpoch.get(member.path) ?? 0));
         const recent = hasGit && newestEpoch > aiEraCutoff;
         duplicateFindings.push({
             kind: "duplicate_cluster",
-            title: `${members[0].name} — ${paths.size} implementations across ${dirs.size} directories${recent ? " [recent, likely AI-era]" : ""}`,
-            detail: signatureMatch
-                ? "Same name AND near-identical signature: almost certainly parallel implementations of the same idea."
-                : "Same name in unrelated directories: agents and humans may be solving the same problem twice.",
+            title: `${members[0].name} — ${paths.size} implementations across ${dirs.size} directories${recent ? " [recently changed]" : ""}`,
+            detail: "Same name and near-identical signature in unrelated directories — likely parallel implementations of the same idea, worth a look.",
             evidence: members.slice(0, 5).map((member) => `${member.path}:${member.line}  ${member.kind} ${member.signature.slice(0, 80)}`),
             surprise: Math.min(100, 45 + paths.size * 8 + (signatureMatch ? 15 : 0) + (recent ? 20 : 0)),
         });
@@ -9189,9 +9210,15 @@ function renderClaudeMemAuditReceipt(report) {
 function kageReviewerSuggestions(projectDir, targets = [], changedFiles = []) {
     const graph = readCurrentCodeGraph(projectDir) ?? buildCodeGraph(projectDir);
     const graphPaths = new Set(graph.files.map((file) => file.path));
-    const resolvedTargets = unique((targets.length ? targets : changedFiles.length ? changedFiles : gitChangedFiles(projectDir))
+    const explicitTargets = targets.length > 0;
+    const resolvedTargets = unique((explicitTargets ? targets : changedFiles.length ? changedFiles : gitChangedFiles(projectDir))
         .map((path) => gitPathToProjectRelative(projectDir, path) ?? path)
-        .filter((path) => path && !isNoisePath(path)));
+        .filter((path) => path && !isNoisePath(path))
+        // Risk is a CODE assessment. When inferring targets from the working tree,
+        // keep only files the code graph actually knows about — memory packets,
+        // dotfiles, and docs have no dependents/hotspot signal and are pure noise
+        // here. Explicitly-named targets are always honored.
+        .filter((path) => explicitTargets || graphPaths.has(path)));
     const warnings = [];
     if (!gitHead(projectDir))
         warnings.push("Git history is unavailable, so reviewer suggestions cannot be computed.");

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@kage-core/kage-graph-mcp",
-  "version": "2.2.5",
+  "version": "2.2.7",
   "description": "Local-first repo memory, code graph, and recall MCP server for coding agents",
   "main": "dist/index.js",
   "files": [