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