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