{"id":"no-high-key-per-node","text":"Nodes store no upper-bound \"high key,\" so a reader cannot detect that a concurrent split moved keys to a right sibling; this is the second missing prerequisite for Lehman-Yao's single-latch protocol","truth_value":"IN","source":"entries/2026/05/29/topic-sibling-pointer-maintenance.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"no-high-key-per-node","truth_value":"IN","reason":"premise"}]}}