1\begin{tabular}{@{}lrrrrr@{}}2\toprule3method & aggregation & multi\_hop & revision & temporal & unanswerable \\4\midrule5cache concat (neg. control) k=2 & 0 [0,0] & 70 [57,82] & 50 [35,65] & 55 [35,75] & 100 [100,100] \\6cache concat (neg. control) k=4 & 0 [0,0] & 52 [40,68] & 25 [12,40] & 40 [20,60] & 98 [91,100] \\7concat A4 k=2 & 0 [0,0] & 92 [85,99] & 70 [55,85] & 60 [35,80] & 100 [100,100] \\8concat A4 k=4 & 0 [0,0] & 92 [85,100] & 65 [50,80] & 65 [45,85] & 100 [100,100] \\9full context k=2 & 0 [0,0] & 98 [92,100] & 60 [50,71] & 70 [50,90] & 100 [100,100] \\10full context k=4 & 0 [0,0] & 95 [88,100] & 62 [50,75] & 50 [30,75] & 100 [100,100] \\11merge A5 k=2 & 0 [0,0] & 22 [12,35] & 15 [5,25] & 55 [35,80] & 100 [100,100] \\12merge A5 k=4 & 0 [0,0] & 32 [18,48] & 45 [35,55] & 45 [25,65] & 98 [92,100] \\13shared memory A6 k=2 & 0 [0,0] & 38 [22,52] & 45 [30,62] & 35 [20,55] & 100 [100,100] \\14shared memory A6 k=4 & 0 [0,0] & 60 [45,75] & 68 [50,85] & 45 [25,65] & 100 [100,100] \\15\bottomrule16\end{tabular}17