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