gitnexus 1.6.12-rc.24 → 1.6.12-rc.25

package/dist/core/ingestion/community-processor.js

@@ -15,6 +15,7 @@ import { createRequire } from 'node:module';
 import { fileURLToPath } from 'node:url';
 import { dirname, resolve } from 'node:path';
 import { Worker } from 'node:worker_threads';
+import { isHeuristicEdgeReason } from '../graph/edge-reasons.js';
 const __filename = fileURLToPath(import.meta.url);
 const __dirname = dirname(__filename);
 // Navigate to package root (works from both src/ and dist/)
@@ -49,6 +50,16 @@ const DEFAULT_COMMUNITY_ENGINE = 'graphology';
 const LEIDEN_TIMEOUT_MS = 60_000;
 const ICEBUG_TIMEOUT_MS = 60_000;
 const MIN_CONFIDENCE_LARGE = 0.5;
+/**
+ * Whether a large graph's projection may include this edge.
+ *
+ * The confidence floor alone lets every global-name-fallback edge through — it
+ * is emitted at exactly `MIN_CONFIDENCE_LARGE`, so `confidence <` never
+ * excludes it. Clustering on unique-name guesses fuses unrelated areas into one
+ * community, which is precisely the noise the large-graph floor exists to
+ * remove, so the reason is checked too — see `graph/edge-reasons.ts`.
+ */
+const isLargeGraphEligible = (confidence, reason) => confidence >= MIN_CONFIDENCE_LARGE && !isHeuristicEdgeReason(reason);
 export const resolveCommunityDetectionEngine = (raw = process.env[COMMUNITY_ENGINE_ENV]) => {
     if (raw === undefined || raw.trim() === '')
         return DEFAULT_COMMUNITY_ENGINE;
@@ -153,12 +164,18 @@ export const buildCommunityProjection = (knowledgeGraph) => {
     const isLarge = symbolCount > 10_000;
     const connectedNodes = new Set();
     const nodeDegree = new Map();
-    // Field-wise scan (#2680): this walks every edge and reads only these four,
+    // Field-wise scan (#2680): this walks every edge and reads only these five,
     // so taking objects would allocate one per edge for nothing.
-    knowledgeGraph.forEachRelationshipFields((sourceId, targetId, type, confidence) => {
+    knowledgeGraph.forEachRelationshipFields((sourceId, targetId, type, confidence, reason) => {
         if (!isClusteringRelationship(type) || sourceId === targetId)
             return;
-        if (isLarge && confidence < MIN_CONFIDENCE_LARGE)
+        // A name-guessed edge must not join two nodes into a community at ANY graph
+        // size — the rationale in `graph/edge-reasons.ts` is about what the edge
+        // claims, not about how many symbols surround it. Process tracing applies
+        // the same reason gate unconditionally (`process-processor.ts`).
+        if (isHeuristicEdgeReason(reason))
+            return;
+        if (isLarge && !isLargeGraphEligible(confidence, reason))
             return;
         connectedNodes.add(sourceId);
         connectedNodes.add(targetId);
@@ -189,10 +206,12 @@ export const buildCommunityProjection = (knowledgeGraph) => {
     }
     const seenEdges = new Set();
     const edges = [];
-    knowledgeGraph.forEachRelationshipFields((sourceId, targetId, type, confidence) => {
+    knowledgeGraph.forEachRelationshipFields((sourceId, targetId, type, confidence, reason) => {
         if (!isClusteringRelationship(type) || sourceId === targetId)
             return;
-        if (isLarge && confidence < MIN_CONFIDENCE_LARGE)
+        if (isHeuristicEdgeReason(reason))
+            return;
+        if (isLarge && !isLargeGraphEligible(confidence, reason))
             return;
         const sourceIndex = nodeIndexById.get(sourceId);
         const targetIndex = nodeIndexById.get(targetId);

package/dist/core/ingestion/process-processor.js

@@ -9,6 +9,7 @@
  *
  * Processes help agents understand how features work through the codebase.
  */
+import { isHeuristicEdgeReason } from '../graph/edge-reasons.js';
 import { calculateEntryPointScore, isTestFile } from './entry-point-scoring.js';
 import { SupportedLanguages } from '../../_shared/index.js';
 import { isDev } from './utils/env.js';
@@ -289,11 +290,21 @@ outwardActionSites = []) => {
  * traces to jump across unrelated code areas.
  */
 const MIN_TRACE_CONFIDENCE = 0.5;
+/**
+ * True when an edge may seed or extend a traced flow.
+ *
+ * The confidence floor alone is not sufficient: the global-name fallback emits
+ * at exactly `MIN_TRACE_CONFIDENCE`, so a `<` comparison admits every one of
+ * its guesses. A flow assembled from name guesses reads as a real execution
+ * path through code that may never call each other, so the reason is checked
+ * too — see `graph/edge-reasons.ts`.
+ */
+const isTraceableCallsEdge = (type, confidence, reason) => type === 'CALLS' && confidence >= MIN_TRACE_CONFIDENCE && !isHeuristicEdgeReason(reason);
 const buildCallsGraph = (graph) => {
     const adj = new Map();
-    // Field-wise scan (#2680) — whole-graph walk, four fields, no object needed.
-    graph.forEachRelationshipFields((sourceId, targetId, type, confidence) => {
-        if (type !== 'CALLS' || confidence < MIN_TRACE_CONFIDENCE)
+    // Field-wise scan (#2680) — whole-graph walk, five fields, no object needed.
+    graph.forEachRelationshipFields((sourceId, targetId, type, confidence, reason) => {
+        if (!isTraceableCallsEdge(type, confidence, reason))
             return;
         const existing = adj.get(sourceId);
         if (existing === undefined)
@@ -305,8 +316,8 @@ const buildCallsGraph = (graph) => {
 };
 const buildReverseCallsGraph = (graph) => {
     const adj = new Map();
-    graph.forEachRelationshipFields((sourceId, targetId, type, confidence) => {
-        if (type !== 'CALLS' || confidence < MIN_TRACE_CONFIDENCE)
+    graph.forEachRelationshipFields((sourceId, targetId, type, confidence, reason) => {
+        if (!isTraceableCallsEdge(type, confidence, reason))
             return;
         const existing = adj.get(targetId);
         if (existing === undefined)

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "gitnexus",
-  "version": "1.6.12-rc.24",
+  "version": "1.6.12-rc.25",
   "description": "Graph-powered code intelligence for AI agents. Index any codebase, query via MCP or CLI.",
   "author": "Abhigyan Patwari",
   "license": "PolyForm-Noncommercial-1.0.0",