{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261013-advance-20261021-r06-linear-programming-0011"},"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-0011","number":2411,"title":{"zh-Hant":"第 2411 題：有限線性規劃候選","en":"Question 2411: Every Constraint at One Declared Point"},"family_id":"qf-app21-lp-constraint-row-audit","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":"0bb22c0701ae70df53a025cacdce1024246452c4bcb263116412278075101c09","derivation_sha256":"7c2843aef5ef529833cbb3b14faa7c6036949bbd029872538c317ae3014f5bb1"}]}