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