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