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