{"id":"btree-range-scan-provides-ordered-access","text":"B-tree range scans provide correct ordered sequential access by walking the actively maintained sibling chain with support for unbounded end keys, traversing all matching keys in sorted order.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["btree-sibling-chain-maintained-across-mutations","range-scan-supports-unbounded"],"outlist":["range-scan-no-cycle-guard"],"label":"Sibling chain maintenance ensures ordering but no cycle detection means a corrupt pointer could cause infinite traversal"}],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"btree-range-scan-provides-ordered-access","truth_value":"IN","reason":"SL justification valid","antecedents":["btree-sibling-chain-maintained-across-mutations","range-scan-supports-unbounded"],"label":"Sibling chain maintenance ensures ordering but no cycle detection means a corrupt pointer could cause infinite traversal","outlist":["range-scan-no-cycle-guard"]},{"node":"btree-sibling-chain-maintained-across-mutations","truth_value":"IN","reason":"SL justification valid","antecedents":["split-chain-rewiring-order","btree-leaf-sibling-patched-on-remove","btree-sibling-chain-fixed-offset"],"label":"Split, delete, and read operations all respect and maintain the sibling chain through coordinated ordering and format invariants."},{"node":"split-chain-rewiring-order","truth_value":"IN","reason":"premise"},{"node":"btree-leaf-sibling-patched-on-remove","truth_value":"IN","reason":"premise"},{"node":"btree-sibling-chain-fixed-offset","truth_value":"IN","reason":"premise"},{"node":"range-scan-supports-unbounded","truth_value":"IN","reason":"premise"}]}}