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