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