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