{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261021-r06-linear-programming-0046"},"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-0046","number":2446,"title":{"zh-Hant":"第 2446 題：有限線性規劃候選","en":"Question 2446: 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":"c708a8655d9d50bf0591dfffbf6a63b0492e3c7827d9e1ed6a0a798fa8db56e7","derivation_sha256":"d064865ca26fa27d73db351a535d429745826c154bf47baafe012d3d1c53fa4d"}]}