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