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