My understanding is that the more general case of causal discovery, where you have lots of variables, is already somewhat solved by Pearlian techniques (if you have A/B/C you can conditionalize on each and see what graph fits best - all independent, C confounding A & B, A -> B -> C, etc). But these techniques break down when it's just A and B: A->B and B->A look symmetrical - the problem is so simple that it's hard, because there's no C which can help break the symmetry and suggest something about the underlying causal graph.

OP is interesting because it points out that even without a C, A and B often aren't symmetrical in one particular way. So now pairs can be attacked as well as triplets and bigger; and maybe it points the way to new ways to tackle more complicated datasets.