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