{"id":"lehman-yao-needs-high-keys-and-internal-links","text":"The existing leaf `next_sibling` pointer is necessary but insufficient for Lehman-Yao concurrent access; the algorithm also requires right-links on internal nodes and a high key per node, neither of which this implementation has","truth_value":"IN","source":"entries/2026/05/29/topic-concurrency-and-latch-coupling.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"lehman-yao-needs-high-keys-and-internal-links","truth_value":"IN","reason":"premise"}]}}