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