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