Description
Starting only at nodes[0], follow dependencies until leaving the node map or repeating; return the repeated cycle plus closure, or the visited path when acyclic.
A justification chain or evidence path is a structural representation of an argument. Repeated identifiers and reachable cycles can expose a local structural issue, but path counts do not establish independent evidence or argument soundness.
Starting only at nodes[0], follow dependencies until leaving the node map or repeating; return the repeated cycle plus closure, or the visited path when acyclic.
When to use this tool
Use Justification Chain Circular Reference Witness when you need a supplied chain, path-count or cycle diagnostic.
How to use the tool and how it works
- Enter nodes, dependencies. Keep parallel arrays aligned. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read circular, witness. Inspect circular before interpreting the associated values.
Require nonempty unique nodes and aligned single dependencies. Starting only at nodes[0], follow dependencies until leaving the node map or repeating; return the repeated cycle plus closure, or the visited path when acyclic.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| nodes | Nodes | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
| dependencies | Dependencies | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| circular | Circular | Required. Boolean. |
| witness | Closed repeated cycle when circular; visited path otherwise. Only the nodes[0] component is traversed. | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
{
"input": {
"nodes": [
"A",
"B",
"C"
],
"dependencies": [
"B",
"C",
"B"
]
},
"output": {
"circular": true,
"witness": [
"B",
"C",
"B"
]
}
}Limitations and assumptions
- Other disconnected cycles are not searched. The noncircular witness is a path rather than a cycle; graph edges are supplied and argument soundness is not assessed.
- Inputs must satisfy both the field types and the cross-field conditions above. Invalid input causes an error; a successful false flag or documented placeholder is a different result.
Alternative or Complementary methods
Inspect the actual dependency graph and substantive premises. Use a full graph traversal when disconnected components matter, and evaluate evidentiary validity separately from structure.
References
Similar or alternative tools
- Evidence Chain Depth
Scan chain IDs in order, mark a cycle on any repeat, and either stop before counting the first repeated entry or continue counting every entry according to repeatedIdTerminates.
- Premise Support Single Link Tag
Record a directed premise-to-conclusion support assertion and attribution without validating the inference.