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