{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0071"},"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-0071","number":11946,"title":{"zh-Hant":"第 11946 題：凸最佳化問題","en":"Question 11946: 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":"fcaf6ebd9a75a800778938f11d90260787d4b332da0f174db9bc4e7274a6a7ef","derivation_sha256":"95ac3b09e27db9e91d2e8935c304ea67b5bedc778012cfb6ef503293dca496c0"}]}