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