Appendices In Appendix A, we present definitions for f-DiGraphs and f

Appendix C, we prove our main theoretical result on Boolean-rank instability under edge perturbation. In Appendix E, we present the implementation details for DCD-FG. Definition 3. (Half-square graphs and induced feature graph) Therefore, we focus on the direct set inclusion. We define the number of such possible adjacency patterns as I . By comparing coefficients inside the exponential, for fixed m, this upper bound tends to 0 as d .