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