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