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