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