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