{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261021-r06-linear-programming-0028"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0028","number":2428,"title":{"zh-Hant":"第 2428 題：有限線性規劃候選","en":"Question 2428: Feasible Indices in Canonical Candidate-Grid Order"},"family_id":"qf-app21-lp-feasible-inventory","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"a1755bee90401f376edf4520cd5b646bb6b5f9bff8268d284a36d38bf7280459","derivation_sha256":"8177a1841766e97fdd4a8ec4ae7051976f2d7c5d1fabcc623e4d167b53d0a577"}]}