Utility and terminology of the proposed edge definition for diubergraphs

Determine whether the proposed distinction between edges and uberedges in depth-k diubergraphs is mathematically useful, or whether the two terms should be used interchangeably.

Background

The manuscript introduces depth-k diubergraphs in which nested objects can function as edges and vertices. It then questions whether maintaining separate terminology for 'edges' and 'uberedges' contributes useful structure or whether the terminology should be simplified.