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