Relationships between fragments can be represented using a directed acyclic graph (DAG), wherein each unique fragment is a node. Edges are drawn from fragments subsystems (parents) to larger fragments constructed from them (children). We refer to this structure as a PIE-DAG, although it is also known in set theory as a Hasse diagram. PIE-DAGs are constructed using the following heuristics: