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