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