{"id":"first-match-is-minimum-in-sorted-scan","text":"In the two-pointer scan of two sorted arrays, the first equality found is necessarily the smallest common value because both pointers start at index 0 and only advance forward.","truth_value":"IN","source":"entries/2026/06/06/minimum-common-value-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"first-match-is-minimum-in-sorted-scan","truth_value":"IN","reason":"premise"}]}}