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