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