The Reconstruction Conjecture for simple graphs remains unresolved. Most attempts I've seen at resolving the conjecture aim at proving it to be true (or partially true). I don't believe there is a compelling reason for it to be true, so I'm brainstorming how to generate a counterexample.

Bollobás showed that almost all graphs have reconstruction number 3, which means that there exist three cards in their deck that uniquely determine the graph. This essentially thwarts any obvious attempt at generating random graphs to find a counterexample.

On the other hand, the Reconstruction Conjecture for digraphs is false (there are known families of counterexamples). It might also be similarly impractical to generate random counterexamples to the Reconstruction Conjecture for digraphs, despite knowing it is false.

Hence my question:

**Question**: Are almost all digraphs reconstructible?