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