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