We explore an alternative to Evidence Assembler (EA), where instead of selecting key sentences from every root-to-leaf path in the reasoning tree, we use a reranker to rescore the selected documents.
given a document reasoning-tree of t w reasoning chains, we use bidirectional attention (Seo et al., 2017) between the last documents in each chain and all the documents from the previous hops in that chain to obtain {ĥ 1 , • • • ,ĥ tw } which are the refined representations of the leaf documents.