Abstract: A computing machine accesses a directed graph representing one or more sequences of actions. The directed graph comprises nodes and edges between the nodes. Each node is either a beginning node, an intermediate node, or an end node. Each intermediate is downstream from at least one beginning node and upstream from at least one end node. Each beginning node in at least a subset of the beginning nodes has an explainability value vector. The computing machine computes, for each first node from among a plurality of first nodes that are intermediate nodes or end nodes, a provenance value representing dependency of an explainability value vector of the first node on the one or more nodes upstream from the first node. The computing machine computes, for each first node, the explainability value vector. The computing machine provides a graphical output representing at least an explainability value vector of an end node.

Abstract: A computing machine accesses a directed graph representing one or more sequences of actions. The directed graph comprises nodes and edges between the nodes. Each node is either a beginning node, an intermediate node, or an end node. Each intermediate is downstream from at least one beginning node and upstream from at least one end node. Each beginning node in at least a subset of the beginning nodes has an explainability value vector. The computing machine computes, for each first node from among a plurality of first nodes that are intermediate nodes or end nodes, a provenance value representing dependency of an explainability value vector of the first node on the one or more nodes upstream from the first node. The computing machine computes, for each first node, the explainability value vector. The computing machine provides a graphical output representing at least an explainability value vector of an end node.