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