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