Evidence Path Tracing — Weighted Dijkstra Provenance

trace_evidence_path finds the lowest-cost chain between any two knowledge nodes using weighted Dijkstra. Cost = -log(confidence) + recency_decay + type_cost. A traces a single shortest path from the ROI roadmap to the batch implementation summary (3 hops, cost 0.59). B uses Yen's K-shortest to find 2 diverse alternate paths through different intermediate nodes. All payloads below are from a real Graphonomous MCP session.