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