The example in the Inclusion Proofs section lists the skipped hashes as 0x00..., 0x66... and 0x22..., in that order, and the diagram source (bip-0098/traversal-example.dot) agrees: 0x22... is the SKIP branch of D. The base64 proof under it decodes to 06 bd8440 03, then 32 bytes of 0x00, 32 of 0x66 and 32 of 0x44. 0x44... is E's right child, which is a VERIFY hash and shouldn't be in the proof.
This re-encodes the proof with 0x22... as the third hash. The header, the node codes and the 101-byte length stay the same, only the last 32 bytes change. It also drops a stray "." after "base64:".
python3 -c "import base64; print(base64.b64encode(bytes.fromhex('06bd844003')+b'\x00'*32+b'\x66'*32+b'\x22'*32).decode())"