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