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