{"id":"range-partitioning-merge-assumes-adjacency","text":"`Partition.merge(other)` appends the other partition's keys without re-sorting; correctness depends on the caller passing the immediate right neighbor, with no runtime adjacency validation.","truth_value":"IN","source":"entries/2026/05/29/range-partitioning-range_partitioning.md","source_url":"","source_hash":"","justifications":[],"dependents":["range-partitioning-routing-is-structurally-fragile"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"range-partitioning-merge-assumes-adjacency","truth_value":"IN","reason":"premise"}]}}