[{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"1c95acd5a90336498632c7f7854448bedcbf2dc6dbe9b890de556b11718e5353","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"ae3754498603797c290d8005c2de695ec4dbc9c364021d01474ff765b05218a6","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":null,\"course\":{\"course_number\":726,\"minimum_grade\":null,\"subjects\":[\"COMPSCI\",\"ISYE\",\"MATH\",\"STAT\"],\"timing\":\"prior\"},\"evidence\":\"STAT/COMP SCI/I SY E/MATH 726\",\"id\":\"req-1\",\"kind\":\"course\"}],\"notes\":[\"Subject abbreviations in the requirement were matched to the linked course reference COMPSCI/ISYE/MATH/STAT 726.\"],\"root\":\"req-1\",\"status\":\"parsed\"}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":true},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"1c95acd5a90336498632c7f7854448bedcbf2dc6dbe9b890de556b11718e5353","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"ae3754498603797c290d8005c2de695ec4dbc9c364021d01474ff765b05218a6","section":"search_profile","status":"valid","value_json":"{\"activity_tags\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"label\":\"mathematical-reasoning\"}],\"assumed_background\":[],\"search_phrases\":[\"nonlinearly constrained optimization\",\"tangent and normal cones\",\"theorems of the alternative\",\"separation results\",\"constraint qualifications\",\"first-order optimality conditions\",\"second-order optimality conditions\",\"duality\",\"merit functions and filters\",\"interior-point algorithms\",\"augmented Lagrangian algorithms\",\"sequential quadratic programming\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Understanding theory and algorithms for nonlinearly constrained optimization\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Applying geometric concepts such as tangent and normal cones, theorems of the alternative, and separation results\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Expressing first-order and second-order optimality conditions geometrically and algebraically\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Using nonlinear programming algorithms including merit functions, filters, interior-point, augmented Lagrangian, and sequential quadratic programming\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"title\",\"quote\":\"NONLINEAR OPTIMIZATION II\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"},{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Covers theory and algorithms for nonlinearly constrained optimization, including geometric concepts, constraint qualifications, optimality conditions, duality, and specific algorithms like SQP and interior-point methods.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Geometric concepts in optimization\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Optimality conditions and constraint qualifications\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Duality.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Duality in nonlinear programming\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Nonlinear programming algorithms\"}]}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":true},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"1c95acd5a90336498632c7f7854448bedcbf2dc6dbe9b890de556b11718e5353","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"ae3754498603797c290d8005c2de695ec4dbc9c364021d01474ff765b05218a6","section":"student_experience","status":"insufficient_evidence","value_json":"{\"status\":\"insufficient_evidence\",\"themes\":[]}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":true},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"1c95acd5a90336498632c7f7854448bedcbf2dc6dbe9b890de556b11718e5353","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"ae3754498603797c290d8005c2de695ec4dbc9c364021d01474ff765b05218a6","section":"student_summary","status":"valid","value_json":"{\"context_hash\":\"dc179cc17fa2d3202756c2495a1e63da8f6fe3762b02fd0e310c8cdea34130b2\",\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"current_instructors\":[],\"difficulty_workload\":[],\"errors\":[],\"historical_context\":[],\"message\":\"No course-specific reviews available\",\"offered\":false,\"profile_hash\":\"3f5110430805ccdd533c0c072df62d68a8a5f5441c4530bbdb15d419a199a09c\",\"quick_take\":[{\"citations\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"e5f09a86-bba2-33e8-bf07-ca7590869fd2\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1204\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"e5f09a86-bba2-33e8-bf07-ca7590869fd2\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1232\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"e5f09a86-bba2-33e8-bf07-ca7590869fd2\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1264\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Spring 2020: 3.71 GPA, 83.3% A/AB (n=12 letter grades); Fall 2022: 3.59 GPA, 76.5% A/AB (n=17 letter grades); Spring 2026: 3.59 GPA, 72.7% A/AB (n=11 letter grades).\"}],\"student_experience\":[],\"task_hash\":\"9dea82ef7f2113a5605c1c6030c4f9b19967eb742cc93a78268fb92357d29f5c\",\"teaching_history\":[],\"term_id\":\"1274\",\"term_name\":\"2027 Sprng\",\"version\":3}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":true},{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"847e7bd60ca83d0f910f9600e3c344b90eca860d0b6e7976ceaa55a34bd32e4a","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":null,\"course\":{\"course_number\":726,\"minimum_grade\":null,\"subjects\":[\"COMPSCI\",\"ISYE\",\"MATH\",\"STAT\"],\"timing\":\"prior\"},\"evidence\":\"STAT/COMP SCI/I SY E/MATH 726\",\"id\":\"n0\",\"kind\":\"course\"}],\"notes\":[],\"root\":\"n0\",\"status\":\"parsed\"}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"847e7bd60ca83d0f910f9600e3c344b90eca860d0b6e7976ceaa55a34bd32e4a","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 726\",\"field\":\"description\",\"quote\":\"Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.\"}],\"text\":\"Linear algebra and basic mathematical analysis\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 726\",\"field\":\"title\",\"quote\":\"NONLINEAR OPTIMIZATION I\"}],\"text\":\"Foundations of nonlinear optimization\"}],\"search_phrases\":[\"nonlinear optimization algorithms\",\"interior-point methods\",\"sequential quadratic programming\",\"optimality conditions\",\"duality theory\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization.\"}],\"text\":\"Nonlinearly constrained optimization theory and algorithms\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions.\"}],\"text\":\"First and second-order optimality conditions\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Duality.\"}],\"text\":\"Duality theory\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\"}],\"text\":\"Advanced nonlinear programming algorithms\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"title\",\"quote\":\"NONLINEAR OPTIMIZATION II\"},{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization.\"}],\"text\":\"NONLINEAR OPTIMIZATION II covers theory and algorithms for nonlinearly constrained optimization, including optimality conditions, duality, and methods like interior-point and SQP.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\"}],\"text\":\"Geometric concepts: tangent/normal cones, separation results\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Constraint qualifications.\"}],\"text\":\"Constraint qualifications\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\"}],\"text\":\"Merit functions, filters, interior-point, augmented Lagrangian, SQP\"}]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"847e7bd60ca83d0f910f9600e3c344b90eca860d0b6e7976ceaa55a34bd32e4a","section":"student_experience","status":"insufficient_evidence","value_json":"{\"status\":\"insufficient_evidence\",\"themes\":[]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"e052d2c4ff96306165ca0379b79daafdce8603d511a401ca3fb0c6b00e1aeec9","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":null,\"course\":{\"course_number\":726,\"minimum_grade\":null,\"subjects\":[\"COMPSCI\",\"ISYE\",\"MATH\",\"STAT\"],\"timing\":\"prior\"},\"evidence\":\"STAT/COMP SCI/I SY E/MATH 726\",\"id\":\"n0\",\"kind\":\"course\"}],\"notes\":[],\"root\":\"n0\",\"status\":\"parsed\"}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"e052d2c4ff96306165ca0379b79daafdce8603d511a401ca3fb0c6b00e1aeec9","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 726\",\"field\":\"description\",\"quote\":\"Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.\"}],\"text\":\"Linear algebra and basic mathematical analysis\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 726\",\"field\":\"title\",\"quote\":\"NONLINEAR OPTIMIZATION I\"}],\"text\":\"Foundations of nonlinear optimization\"}],\"search_phrases\":[\"nonlinear optimization algorithms\",\"interior-point methods\",\"sequential quadratic programming\",\"optimality conditions\",\"duality theory\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization.\"}],\"text\":\"Nonlinearly constrained optimization theory and algorithms\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions.\"}],\"text\":\"First and second-order optimality conditions\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Duality.\"}],\"text\":\"Duality theory\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\"}],\"text\":\"Advanced nonlinear programming algorithms\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"title\",\"quote\":\"NONLINEAR OPTIMIZATION II\"},{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization.\"}],\"text\":\"NONLINEAR OPTIMIZATION II covers theory and algorithms for nonlinearly constrained optimization, including optimality conditions, duality, and methods like interior-point and SQP.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\"}],\"text\":\"Geometric concepts: tangent/normal cones, separation results\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Constraint qualifications.\"}],\"text\":\"Constraint qualifications\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\"}],\"text\":\"Merit functions, filters, interior-point, augmented Lagrangian, SQP\"}]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"e052d2c4ff96306165ca0379b79daafdce8603d511a401ca3fb0c6b00e1aeec9","section":"student_experience","status":"insufficient_evidence","value_json":"{\"status\":\"insufficient_evidence\",\"themes\":[]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"1c95acd5a90336498632c7f7854448bedcbf2dc6dbe9b890de556b11718e5353","job_id":"enrich-6556a505c10f448d98d02466","output_id":"442d3d7f1fcbbcd4c3312096adbbe0f53b009301eea46d1c2f6d0ce4d646e1e2","section":"requirements","status":"invalid","value_json":null,"candidate_json":"{\"nodes\":[{\"children\":[],\"condition\":null,\"course\":{\"course_number\":726,\"minimum_grade\":null,\"subjects\":[\"STAT\",\"COMP SCI\",\"I SY E\",\"MATH\"],\"timing\":\"prior\"},\"evidence\":\"STAT/COMP SCI/I SY E/MATH 726\",\"id\":\"req-1\",\"kind\":\"course\"}],\"notes\":[\"Course subjects normalized to canonical forms from linked_courses reference COMPSCI/ISYE/MATH 726.\",\"Timing assumed prior based on standard prerequisite structure unless concurrent enrollment is explicitly allowed.\"],\"root\":\"req-1\",\"status\":\"parsed\"}","error":"Node req-1: course {'course_number': 726, 'minimum_grade': None, 'subjects': ['STAT', 'COMP SCI', 'I SY E', 'MATH'], 'timing': 'prior'} is absent from the source links (linked_courses). Standing, declared programs, and subject credit counts are condition nodes, not courses. Never invent course 0. For a source reference absent from linked_courses, use kind=condition, course=null, condition=<verbatim source clause>, children=[], and needs_review with an explanatory note. Allowed course references: [{'course_number': 726, 'subjects': ['COMPSCI', 'ISYE', 'MATH', 'STAT']}].","model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":false},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"1c95acd5a90336498632c7f7854448bedcbf2dc6dbe9b890de556b11718e5353","job_id":"enrich-6556a505c10f448d98d02466","output_id":"442d3d7f1fcbbcd4c3312096adbbe0f53b009301eea46d1c2f6d0ce4d646e1e2","section":"search_profile","status":"valid","value_json":"{\"activity_tags\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"label\":\"mathematical-reasoning\"}],\"assumed_background\":[],\"search_phrases\":[\"nonlinearly constrained optimization\",\"tangent and normal cones\",\"theorems of the alternative\",\"separation results\",\"constraint qualifications\",\"first-order optimality conditions\",\"second-order optimality conditions\",\"duality\",\"merit functions and filters\",\"interior-point algorithms\",\"augmented Lagrangian algorithms\",\"sequential quadratic programming\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Understanding theory and algorithms for nonlinearly constrained optimization\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Applying geometric concepts such as tangent and normal cones, theorems of the alternative, and separation results\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Expressing first-order and second-order optimality conditions geometrically and algebraically\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Using nonlinear programming algorithms including merit functions, filters, interior-point, augmented Lagrangian, and sequential quadratic programming\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"title\",\"quote\":\"NONLINEAR OPTIMIZATION II\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"},{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Covers theory and algorithms for nonlinearly constrained optimization, including geometric concepts, constraint qualifications, optimality conditions, duality, and specific algorithms like SQP and interior-point methods.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Geometric concepts in optimization\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Optimality conditions and constraint qualifications\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Duality.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Duality in nonlinear programming\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Nonlinear programming algorithms\"}]}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":false},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"1c95acd5a90336498632c7f7854448bedcbf2dc6dbe9b890de556b11718e5353","job_id":"enrich-6556a505c10f448d98d02466","output_id":"442d3d7f1fcbbcd4c3312096adbbe0f53b009301eea46d1c2f6d0ce4d646e1e2","section":"student_experience","status":"insufficient_evidence","value_json":"{\"status\":\"insufficient_evidence\",\"themes\":[]}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":false},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"1c95acd5a90336498632c7f7854448bedcbf2dc6dbe9b890de556b11718e5353","job_id":"enrich-79348710a077dbb34341f483","output_id":"97c4f174b853bf0928bcbf0bd044ff5e1a43cad31ac2d8a3537c11bdd32d68f5","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":null,\"course\":{\"course_number\":726,\"minimum_grade\":null,\"subjects\":[\"COMPSCI\",\"ISYE\",\"MATH\",\"STAT\"],\"timing\":\"prior\"},\"evidence\":\"STAT/COMP SCI/I SY E/MATH 726\",\"id\":\"req-1\",\"kind\":\"course\"}],\"notes\":[\"Subject abbreviations in the requirement were matched to the linked course reference COMPSCI/ISYE/MATH/STAT 726.\"],\"root\":\"req-1\",\"status\":\"parsed\"}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":false},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"1c95acd5a90336498632c7f7854448bedcbf2dc6dbe9b890de556b11718e5353","job_id":"enrich-79348710a077dbb34341f483","output_id":"97c4f174b853bf0928bcbf0bd044ff5e1a43cad31ac2d8a3537c11bdd32d68f5","section":"search_profile","status":"valid","value_json":"{\"activity_tags\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"label\":\"mathematical-reasoning\"}],\"assumed_background\":[],\"search_phrases\":[\"nonlinearly constrained optimization\",\"tangent and normal cones\",\"theorems of the alternative\",\"separation results\",\"constraint qualifications\",\"first-order optimality conditions\",\"second-order optimality conditions\",\"duality\",\"merit functions and filters\",\"interior-point algorithms\",\"augmented Lagrangian algorithms\",\"sequential quadratic programming\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Understanding theory and algorithms for nonlinearly constrained optimization\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Applying geometric concepts such as tangent and normal cones, theorems of the alternative, and separation results\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Expressing first-order and second-order optimality conditions geometrically and algebraically\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Using nonlinear programming algorithms including merit functions, filters, interior-point, augmented Lagrangian, and sequential quadratic programming\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"title\",\"quote\":\"NONLINEAR OPTIMIZATION II\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"},{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Covers theory and algorithms for nonlinearly constrained optimization, including geometric concepts, constraint qualifications, optimality conditions, duality, and specific algorithms like SQP and interior-point methods.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Geometric concepts in optimization\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Optimality conditions and constraint qualifications\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Duality.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Duality in nonlinear programming\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Nonlinear programming algorithms\"}]}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":false},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"1c95acd5a90336498632c7f7854448bedcbf2dc6dbe9b890de556b11718e5353","job_id":"enrich-79348710a077dbb34341f483","output_id":"97c4f174b853bf0928bcbf0bd044ff5e1a43cad31ac2d8a3537c11bdd32d68f5","section":"student_experience","status":"insufficient_evidence","value_json":"{\"status\":\"insufficient_evidence\",\"themes\":[]}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":false},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"ac97a4d10f6c9602470226f047ffe3f83fa427141323b0e340fcfa09863a893f","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":null,\"course\":{\"course_number\":726,\"minimum_grade\":null,\"subjects\":[\"COMPSCI\",\"ISYE\",\"MATH\",\"STAT\"],\"timing\":\"prior\"},\"evidence\":\"STAT/COMP SCI/I SY E/MATH 726\",\"id\":\"n0\",\"kind\":\"course\"}],\"notes\":[],\"root\":\"n0\",\"status\":\"parsed\"}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"ac97a4d10f6c9602470226f047ffe3f83fa427141323b0e340fcfa09863a893f","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 726\",\"field\":\"description\",\"quote\":\"Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.\"}],\"text\":\"Linear algebra and basic mathematical analysis\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 726\",\"field\":\"title\",\"quote\":\"NONLINEAR OPTIMIZATION I\"}],\"text\":\"Foundations of nonlinear optimization\"}],\"search_phrases\":[\"nonlinear optimization algorithms\",\"interior-point methods\",\"sequential quadratic programming\",\"optimality conditions\",\"duality theory\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization.\"}],\"text\":\"Nonlinearly constrained optimization theory and algorithms\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions.\"}],\"text\":\"First and second-order optimality conditions\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Duality.\"}],\"text\":\"Duality theory\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Nonlinear programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\"}],\"text\":\"Advanced nonlinear programming algorithms\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"title\",\"quote\":\"NONLINEAR OPTIMIZATION II\"},{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinearly constrained optimization.\"}],\"text\":\"NONLINEAR OPTIMIZATION II covers theory and algorithms for nonlinearly constrained optimization, including optimality conditions, duality, and methods like interior-point and SQP.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results.\"}],\"text\":\"Geometric concepts: tangent/normal cones, separation results\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"Constraint qualifications.\"}],\"text\":\"Constraint qualifications\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"field\":\"description\",\"quote\":\"merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.\"}],\"text\":\"Merit functions, filters, interior-point, augmented Lagrangian, SQP\"}]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"ac97a4d10f6c9602470226f047ffe3f83fa427141323b0e340fcfa09863a893f","section":"student_experience","status":"insufficient_evidence","value_json":"{\"status\":\"insufficient_evidence\",\"themes\":[]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_16b002cb61d416743661e65d","course_id":"COMPSCI/ISYE/MATH 730","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"ac97a4d10f6c9602470226f047ffe3f83fa427141323b0e340fcfa09863a893f","section":"student_summary","status":"valid","value_json":"{\"context_hash\":\"cdd7eca8d983ae86787546f1b1b60b6c2c6f8c94ec7bdb76ced8fab28f3618ca\",\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"current_instructors\":[],\"difficulty_workload\":[],\"errors\":[],\"historical_context\":[],\"message\":\"No course-specific reviews available\",\"offered\":false,\"profile_hash\":\"5cb4dabf887cdbcd8c00d5a1312e10828b95c63f30bc3ea76aea199565390d02\",\"quick_take\":[{\"citations\":[{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"e5f09a86-bba2-33e8-bf07-ca7590869fd2\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1204\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"e5f09a86-bba2-33e8-bf07-ca7590869fd2\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1232\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE/MATH 730\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"e5f09a86-bba2-33e8-bf07-ca7590869fd2\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1264\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Spring 2020: 3.71 GPA, 83.3% A/AB (n=12 letter grades); Fall 2022: 3.59 GPA, 76.5% A/AB (n=17 letter grades); Spring 2026: 3.59 GPA, 72.7% A/AB (n=11 letter grades).\"}],\"student_experience\":[],\"task_hash\":\"74fb0997943e888960bbc9e47db8c4fd12e4292d55c20509d8d89db6a9910f68\",\"teaching_history\":[],\"term_id\":\"1272\",\"term_name\":\"2026 Fall\",\"version\":2}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false}]