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