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