dependency-completeness-enables-accurate-dedup

IN derived (depth 3)

Complete dependency tracking for all reference types — both antecedent and outlist entries maintained eagerly by every network mutation — ensures deduplication accurately reflects the complete network topology: survivor selection considers all incoming dependencies including outlist references, and reference rewiring targets both antecedent and outlist positions across all justifications, preventing dedup from creating dangling references or miscounting dependents.

Summary

When the system tracks every type of connection between nodes — not just the obvious ones but also outlist references — deduplication can safely merge duplicate nodes without breaking anything. The node with the most connections survives, and all references get properly rewired, so no dangling pointers or miscounted dependencies are left behind.

Justifications

SL — Dedup accuracy is a downstream consequence of dependency tracking completeness — incomplete tracking would cause dedup to misjudge survivors or miss rewiring targets

Antecedents (all must be IN):

  • dependency-tracking-is-complete-for-all-reference-types — The dependents index fully tracks all relationship types — both antecedent references and outlist references — enabling complete incremental propagation for every truth value change without requiring periodic full recompute as a fallback
  • dedup-reflects-complete-dependency-graph — Deduplication survivor selection accurately reflects the complete dependency graph — the node with the most dependents survives each cluster, and that dependent count includes both antecedent-based and outlist-based dependency edges, ensuring the structurally most-connected node is always preserved.

Dependents

These beliefs depend on this one:

Details