graph_path

shallow

dev.whiteintel/whiteintel · Verify this server

How two entities are connected: the ordered hops of a bounded breadth-first search over ownership and control edges in both directions. ⚠️ BOUNDED, NOT EXHAUSTIVE — at most 15 edges are followed per entity, per direction, per hop, so `found: false` means NO PATH WAS FOUND WITHIN THOSE BOUNDS and is NOT evidence that the two entities are unconnected. The response always carries `exhaustive: false`; never report a negative result as a clean bill of health.

100.0/100

1 trials · measured 8 days ago

graph_path scores 100.0/100 on Vouch's measured behaviour index, from 1 real invocation trials against dev.whiteintel/whiteintel, measured 25 Aug 2026 under methodology v0.2.0. Every measured component scored 100.

Component breakdown

ComponentWeightValue
Reliability35%not applicable
Schema integrity25%100.0
Failure behaviour15%not applicable
Latency15%not applicable
Concurrency10%not applicable

Tool details

Transport
remote + stdio
Credential class
open
Category
Legal & government
Input schema
not declared
Output schema
not declared
Side-effect classification
unclassified

Score history

DayScoreTierMethodology
2026-08-25100.0shallowv0.2.0

Probe evidence

ProbeOutcomes
schema_integritypass: 1

Raw request/response logs are not archived yet — the outcome counts above are drawn directly from every recorded trial.

Embed this score

Available for every tool, scored or not — not a verification perk. Always links back to this page.

Vouch score: graph_path
[![Vouch score](https://vouch.tools/api/tools/03b05942-edc2-4579-9d75-50dfc6ddfa3d/badge.svg)](https://vouch.tools/tools/03b05942-edc2-4579-9d75-50dfc6ddfa3d)
graph_path — Vouch