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