Evidence Graph Mapper
Validate a compact directed evidence graph encoded as node IDs and A->B edges.
Description
A directed evidence graph connects caller-named nodes using compact edge strings.
A directed evidence graph connects caller-named nodes using compact edge strings. Syntax and connectivity differ from evidential validity.1
Validate a compact directed evidence graph encoded as node IDs and A->B edges.
When to use Evidence Graph Mapper
Use this tool to validate a compact directed evidence graph encoded as node IDs and A->B edges.
Prepare the recorded observations, ratings, assumptions or expected/observed lists requested. Choose thresholds and definitions appropriate to the planning question.
How to use Evidence Graph Mapper and understand its results
- Prepare the recorded observations, ratings, assumptions or expected/observed lists requested. Choose thresholds and definitions appropriate to the planning question.
- Enter nodes, edges using the field table and calculation rules, then run the tool.
- Read validEdges, invalidEdges, orphanNodes. The explanation below defines the units, signs, ordering and any flags or placeholder values.
- If the tool reports an input issue, correct the values and run it again. Apply the stated assumptions when interpreting a successfully returned result.
| Input field | Meaning | Value type; see rules below | Requirement |
|---|---|---|---|
| nodes | Evidence node IDs | list of string | Required |
| edges | Directed edges | list of string | Required |
Enter unique raw nonempty node IDs and A->B edge strings. Node IDs are not trimmed; edge endpoints are. Return original valid/invalid edges and orphan nodes in input order. Empty lists, repeated edges, self-loops and cycles are allowed.
valid edge=exactly two trimmed endpoints in node set Units, indexing, boundary conditions and exceptional cases are defined in the calculation rules above.
| Output field | Meaning | Value type |
|---|---|---|
| validEdges | Valid edges | list of string |
| invalidEdges | Invalid edges | list of string |
| orphanNodes | Orphan nodes | list of string |
{
"input": {
"nodes": [
"claim",
"witness",
"document"
],
"edges": [
"witness->claim",
"document->claim"
]
},
"output": {
"validEdges": [
"witness->claim",
"document->claim"
],
"invalidEdges": [],
"orphanNodes": []
}
}Limitations and assumptions
No causal meaning, truth or graph visualization is inferred.
Numeric inputs, where present, must be finite. Follow the calculation-specific rules for overflow, underflow and exceptional cases. Lists are limited to 100,000 entries; the rules above may require smaller limits. Missing required fields, extra fields, wrong value types and violations of the calculation rules are input errors.
Alternative or Complementary methods
Use Five-Whys Chain: Check a five-whys chain for depth and repeated answers. For a complementary task, use Tabletop Exercise Coverage: Audit futures tabletop exercise coverage.
References
-
Evidence Graph Mapper — tool.io
Similar or alternative tools
- Five-Whys Chain
Check a five-whys chain for depth and repeated answers.
- Tabletop Exercise Coverage
Audit futures tabletop exercise coverage.