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