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