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