dedup-is-topology-preserving-and-auditable
IN derived (depth 1)
Deduplication preserves network topology (rewrites both antecedent and outlist references to survivors), selects structurally-optimal survivors (most dependents with lexicographic tiebreak), and supports human oversight (KEEP/RETRACT markers in a user-editable plan format).
Summary
When duplicate beliefs are merged, the process is safe and transparent: it rewires all dependency connections to point at the surviving node so nothing breaks, it picks the most structurally important node to keep, and it lets humans review and override every merge decision before it takes effect.
Justifications
SL — Dedup's three design choices unify into safe, auditable graph refactoring
Antecedents (all must be IN):
- dedup-rewrites-both-antecedents-and-outlist — When a duplicate is retracted via dedup, all justification references (both antecedent and outlist) across the network are rewritten to point at the kept node
- dedup-keeps-most-connected-node — In auto-dedup mode, the node with the most dependents survives each cluster; ties break by lexicographic ID, and losers are retracted after dependents are rewired.
- dedup-plan-is-user-editable — The dedup plan format uses KEEP/RETRACT markers that users can swap before applying, making deduplication decisions reviewable and overridable
Dependents
These beliefs depend on this one:
- all-network-modifications-are-auditable-and-topology-preserving — All operations that modify network structure — standard mutations, deduplication, and belief import — simultaneously maintain the dependents index, preserve referential topology across both antecedent and outlist references, and produce timestamped audit records
- belief-consistency-spans-structural-and-semantic-dimensions — The system maintains belief consistency through two complementary mechanisms targeting different quality dimensions: deduplication resolves structural redundancy (merging equivalent beliefs while preserving topology with user-editable auditable plans), while contradiction management resolves semantic inconsistency (traceable dependency-directed backtracking with consistent nogood IDs and minimal-disruption culprit selection).
- belief-replacement-is-topology-safe-and-view-consistent — Both belief replacement mechanisms achieve topology safety and view consistency: supersession operates through reversible outlist semantics with gated view exclusion of superseded nodes, while deduplication rewires all justification references (both antecedent and outlist) to the most-connected survivor with user-auditable plans — ensuring the dependency graph remains structurally sound and consumers see a clean non-redundant belief set regardless of which replacement mechanism was used.
- bulk-operations-preserve-topology-and-reconcile — Both bulk modification operations — deduplication and import/sync — preserve network topology by rewiring justification references (both antecedent and outlist) to survivors or updated targets, while providing distinct reconciliation strategies (dedup via user-editable keep/retract plans, import via dual additive/remote-wins modes)
- 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.