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