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