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