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