Your link defines it as iteratively converting a DCG to a DAG by removing the lowest-weighted connections until only forward paths exist between the hypothetical cause and the target effect, thereby establishing "causality".

In one sense that's entirely defensible, but the fundamental flaw is that you can do the same between almost any nodes in the graph (as long as a cycle exists between them - You can't e.g. prove JFK's assassination caused the Big Bang because there's no loop that can ever go back to that point).

/ Edit: My apologies, I misunderstood that you're the actual author of TFA. But you're still right!