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