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