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