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