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