🤖 AI Summary
This study investigates the conditions and mechanisms under which component collapse—manifested as the emergence of a giant connected component—occurs in hierarchical procedural corpora when content-approximate duplicate layers and shared container layers are used individually or in combination. To this end, the authors propose a symmetric, bounded auditing framework that preserves relational family visibility and integrate graph component analysis, bridge predictors, union density control, threshold sensitivity diagnostics, and lexical cue coverage evaluation. Systematic experiments across six corpora reveal that in MyFixit and Doc2Dial (2 out of 6), single-layer configurations can be effective while their union fails. Although no bridge-specific mechanism is identified, the work rigorously delineates multiple explanatory boundaries, thereby preventing causal overgeneralization and offering empirical constraints and methodological guidance for modeling hierarchical relations.
📝 Abstract
Component-disjoint leakage control can group corpus units by content similarity, hierarchical membership, or both. Guvenilir and Dogan previously showed that merging relation types can create a giant component that obstructs splitting; we do not claim this phenomenon as new. We examine it through a symmetric audit of a content-near-duplicate layer, a common-container layer, and their union in a fixed panel of six hierarchical procedural corpora. MyFixit and Doc2Dial exhibit the individual-layer-pass/union-fail pattern under the same operational criteria. The resulting two-of-six fraction describes this deliberately constructed panel and is not a prevalence estimate. A prespecified bridge-specific predictor is associated with the pattern, but it is not distinguished from a registered union-density control; the panel therefore does not identify a bridge-specific mechanism. Secondary diagnostics bound the interpretation of threshold sensitivity, annotation coverage, and lexical cues without extending those findings beyond their recorded sources and definitions. The paper's contribution is a bounded measurement and audit: it keeps relation families visible, evaluates their individual and union component structures symmetrically, and reports negative cases and mechanism limits. It proposes neither a new splitting algorithm nor a general causal claim about relation unions.