It is suggested not to allow fee filters from peers to influence the choice of route as malicious nodes can exploit that and launch serious deanonymization attacks. The suggestion of automatically fluffing or applying fee filters in the stempool is discussed as solutions. Nodes may choose to either drop stem transactions or immediately start diffusion when a transaction would otherwise be sent to a Dandelion node whose filter is not satisfied. The reference implementation adds any mempool transactions to the stempool but not vice-versa so that the stempool becomes a superset of the mempool. Stem orphans can occur when a node on the stem shuffles its route between sending dependent transactions. The solution is to wait for the fluff phase to begin, at which point the orphans will be resolved. Making Dandelion routing decisions based on claims made by peer nodes can cause problems and therefore it is recommended against biasing the peer selection code. On the implementation side, discussion is planned later. The focus is on writing up a clearer spec for node behavior in the BIP.