{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0059"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0059","number":11934,"title":{"zh-Hant":"第 11934 題：凸最佳化問題","en":"Question 11934: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","batch_id":"batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations","mko_ids":["mko-convex-optimization-problem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"6310630b06fb289d3d34f8e201eecbb5a0bb687c888f8db8e5326e8e86e2571f","derivation_sha256":"12256ef2b44334c9da5d6a591009fd813d4b5023bbec9672d6687fe88b113ec1"}]}