@inerrata-corporation/errata 2.0.2-dev.361 → 2.0.2-dev.362

package/errata.mjs

@@ -26344,7 +26344,8 @@ function mergeDualBurst(local, cloud, opts = {}) {
       provenance: corroborated ? "corroborated" : "local",
       ...twin?.usageCount != null ? { usageCount: twin.usageCount } : {},
       ...twin?.rel ? { rel: twin.rel } : {},
-      why: l.components
+      why: l.components,
+      ...l.via ? { via: l.via } : {}
     });
   }
   let collectiveCount = 0;
@@ -26531,7 +26532,8 @@ function formatDualNodes(merged) {
         centrality: Number(n.why.centrality.toFixed(3)),
         trust: n.why.trust
       }
-    } : {}
+    } : {},
+    ...n.via ? { via: n.via } : {}
   }));
 }
 var BRIDGE_LABELS, CANONICAL_KNOWLEDGE_ID, UUID_ID;
@@ -28275,14 +28277,19 @@ function localBurst(store, seedId, opts = {}) {
   const seed = store.getNode(seedId);
   if (!seed) return [];
   const hopOf = /* @__PURE__ */ new Map([[seedId, 0]]);
+  const viaOf = /* @__PURE__ */ new Map();
   let frontier = [seedId];
   for (let h = 1; h <= maxHops && hopOf.size < nodeCap; h++) {
     const next = [];
     for (const id of frontier) {
-      const neigh = [...store.outEdges(id).map((e) => e.to), ...store.inEdges(id).map((e) => e.from)];
-      for (const nb of neigh) {
+      const neigh = [
+        ...store.outEdges(id).map((e) => ({ nb: e.to, via: { edgeType: e.type, parentId: id, forward: true } })),
+        ...store.inEdges(id).map((e) => ({ nb: e.from, via: { edgeType: e.type, parentId: id, forward: false } }))
+      ];
+      for (const { nb, via } of neigh) {
         if (!hopOf.has(nb)) {
           hopOf.set(nb, h);
+          viaOf.set(nb, via);
           next.push(nb);
           if (hopOf.size >= nodeCap) break;
         }
@@ -28304,7 +28311,8 @@ function localBurst(store, seedId, opts = {}) {
   const now = store.currentIngestSeq();
   return nodes.map(({ node: node2, hops }) => {
     const r = scoreCandidate(node2, { ...ctxSeed, hops, decay: nodeFreshness(node2, now) }, weights);
-    return { id: node2.id, score: r.score, components: r.components, node: node2, hops };
+    const via = viaOf.get(node2.id);
+    return { id: node2.id, score: r.score, components: r.components, node: node2, hops, ...via ? { via } : {} };
   }).filter((r) => !gated || r.score > 0).sort((a, b) => b.score - a.score).slice(0, limit);
 }
 var init_relevance_rank = __esm({
@@ -38028,7 +38036,7 @@ var init_mcp = __esm({
       },
       {
         name: "errata.burst",
-        description: "Burst-grade local retrieval \u2014 the INTELLIGENT, seed-relative neighborhood (not a flat list). Given a SEED (`nodeId` or `qname`), expand its neighborhood and return the RELEVANT scored subset, ranked by burst-style relevance: semantic similarity to the seed \xD7 centrality \xD7 trust, hop-decayed; semantically-unrelated nodes are gated out. Prefer this over errata.neighbors when you want signal-ranked CONTEXT rather than raw edges. When the SEED is a package and the collective is reachable, results BLEND cross-project knowledge \u2014 each carries `provenance` (local | collective | corroborated) and `usageCount` (projects using it); `corroborated` means your graph and the collective agree (trust it most), `collective` is a cross-project prior to verify. Returns {seed, count, results:[{id,label,name,score,hops,provenance,usageCount?,why?}]}.",
+        description: "Burst-grade local retrieval \u2014 the INTELLIGENT, seed-relative neighborhood (not a flat list). Given a SEED (`nodeId` or `qname`), expand its neighborhood and return the RELEVANT scored subset, ranked by burst-style relevance: semantic similarity to the seed \xD7 centrality \xD7 trust, hop-decayed; semantically-unrelated nodes are gated out. Prefer this over errata.neighbors when you want signal-ranked CONTEXT rather than raw edges. When the SEED is a package and the collective is reachable, results BLEND cross-project knowledge \u2014 each carries `provenance` (local | collective | corroborated) and `usageCount` (projects using it); `corroborated` means your graph and the collective agree (trust it most), `collective` is a cross-project prior to verify. Returns {seed, count, results:[{id,label,name,score,hops,provenance,usageCount?,why?,via?}]} \u2014 `via` is the TOPOLOGY: the edge that reached this result in the walk ({edgeType, parentId, forward}; forward: true \u21D2 parent \u2014edgeType\u2192 node), so you can tell 'FIXED_BY your seed' from 'two hops away via a shared package' and choose whether to dig down a causal chain or turn elsewhere.",
         inputSchema: {
           type: "object",
           properties: {
@@ -38072,7 +38080,8 @@ var init_mcp = __esm({
             node: { label: r.node.label, description: r.node.description },
             score: r.score,
             hops: r.hops ?? 0,
-            components: r.components
+            components: r.components,
+            ...r.via ? { via: r.via } : {}
           }));
           const seedNode = store.getNode(id);
           let collectiveStatus = "local-only";
@@ -38118,7 +38127,8 @@ var init_mcp = __esm({
                 semantic: Number(r.components.semantic.toFixed(3)),
                 centrality: Number(r.components.centrality.toFixed(3)),
                 trust: r.components.trust
-              }
+              },
+              ...r.via ? { via: r.via } : {}
             }))
           };
         }
@@ -53264,7 +53274,7 @@ function startLoopLagMonitor(thresholdMs = 1e3) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.2-dev.361" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.2-dev.362" : "2.0.0-alpha.0";
 var IGNORED_PATH = /[\\/](?:\.git|node_modules|\.errata|\.claude|\.codex|\.cursor|\.turbo|\.next|dist|coverage|test-results|playwright-report|__pycache__)(?:[\\/]|$)/;
 var IGNORED_NOISE = /castalia\.db|eventlog\.sqlite|turn-cursors/;
 var GIT_OP_MUTE_MS = 4e3;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@inerrata-corporation/errata",
-  "version": "2.0.2-dev.361",
+  "version": "2.0.2-dev.362",
   "description": "errata - local-first observation engine for AI coding agents",
   "type": "module",
   "bin": {