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