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