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