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