[{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"02d185195dc02609f6973376833cf8602bc18a4367ed5b898ef080a4fd6aa03d","section":"requirements","status":"invalid","value_json":null,"candidate_json":"{\"nodes\":[{\"children\":[],\"condition\":null,\"course\":{\"course_number\":0,\"minimum_grade\":null,\"subjects\":[\"GRADUATE\"],\"timing\":\"prior\"},\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"},{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n1\",\"kind\":\"condition\"}],\"notes\":[\"The term 'Graduate/professional standing' is a standing requirement, not a specific course. It is treated as a condition leaf.\"],\"root\":\"n1\",\"status\":\"parsed\"}","error":"Unreachable nodes: n0; connect all conditions and exclusions to the root.","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_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"02d185195dc02609f6973376833cf8602bc18a4367ed5b898ef080a4fd6aa03d","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/I SY E/MATH/STAT 525,I SY E 623,COMP SCI/I SY E/MATH/STAT 726), knowledge of analysis (e.g.,MATH/STAT 431or521) and programming ability (e.g.,COMP SCI 200or 301)\"}],\"text\":\"Knowledge of mathematical optimization, analysis, and programming ability.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 200\",\"field\":\"description\",\"quote\":\"Learn the process of incrementally developing small (200-500 lines) programs along with the fundamental Computer Science topics. These topics include: problem abstraction and decomposition, the edit-compile-run cycle, using variables of primitive and more complex data types, conditional and loop-based flow control, basic testing and debugging techniques, how to define and call functions\"}],\"text\":\"Fundamental programming skills including problem decomposition, control flow, and function definition.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 525\",\"field\":\"description\",\"quote\":\"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory\"}],\"text\":\"Linear optimization theory, simplex method, and duality.\"},{\"evidence\":[{\"course_id\":\"ISYE 623\",\"field\":\"description\",\"quote\":\"Translation of problems into optimization models, including how to implement these models in relevant software. Specific topics include techniques to create models of problems with discrete decisions\"}],\"text\":\"Advanced optimization modeling and discrete decision modeling.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 726\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods\"}],\"text\":\"Nonlinear optimization algorithms and methods.\"},{\"evidence\":[{\"course_id\":\"MATH/STAT 431\",\"field\":\"description\",\"quote\":\"Topics covered include axioms of probability, random variables, the most important discrete and continuous probability distributions, expectation and variance, moment generating functions, conditional probability and conditional expectations, multivariate distributions, Markov's and Chebyshev's inequalities, laws of large numbers, and the central limit theorem\"}],\"text\":\"Probability theory, random variables, and limit theorems.\"}],\"search_phrases\":[\"dynamic programming algorithms\",\"Markov decision processes\",\"stochastic optimization\",\"resource allocation\",\"traveling salesman problem\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General and special techniques of dynamic programming developed by means of examples\"}],\"text\":\"Applying dynamic programming techniques to solve optimization problems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes\"}],\"text\":\"Solving specific optimization problems including shortest-path, TSP, knapsack, and inventory systems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General stochastic formulations. Markovian decision processes\"}],\"text\":\"Formulating and analyzing stochastic decision processes.\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"title\",\"quote\":\"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General and special techniques of dynamic programming developed by means of examples\"}],\"text\":\"Covers dynamic programming techniques and applications to problems like shortest-path, TSP, and Markovian decision processes.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes\"}],\"text\":\"Shortest-path algorithms, equipment replacement, resource allocation, TSP, knapsack, and inventory systems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General stochastic formulations. Markovian decision processes\"}],\"text\":\"Stochastic formulations and Markovian decision processes.\"}]}","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_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"02d185195dc02609f6973376833cf8602bc18a4367ed5b898ef080a4fd6aa03d","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_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"7a3f0b73a4229c0752ea16381d01fa94004509c3aec6de1118ce220bf68a9780","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[\"Graduate/professional standing is a standing requirement.\"],\"root\":\"n0\",\"status\":\"parsed\"}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":true},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"7a3f0b73a4229c0752ea16381d01fa94004509c3aec6de1118ce220bf68a9780","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/I SY E/MATH/STAT 525,I SY E 623,COMP SCI/I SY E/MATH/STAT 726), knowledge of analysis (e.g.,MATH/STAT 431or521) and programming ability (e.g.,COMP SCI 200or 301)\"}],\"text\":\"Knowledge of mathematical optimization, analysis, and programming ability.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 200\",\"field\":\"description\",\"quote\":\"Learn the process of incrementally developing small (200-500 lines) programs along with the fundamental Computer Science topics. These topics include: problem abstraction and decomposition, the edit-compile-run cycle, using variables of primitive and more complex data types, conditional and loop-based flow control, basic testing and debugging techniques, how to define and call functions\"}],\"text\":\"Fundamental programming skills including problem decomposition, control flow, and function definition.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 525\",\"field\":\"description\",\"quote\":\"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory\"}],\"text\":\"Linear optimization theory, simplex method, and duality.\"},{\"evidence\":[{\"course_id\":\"ISYE 623\",\"field\":\"description\",\"quote\":\"Translation of problems into optimization models, including how to implement these models in relevant software. Specific topics include techniques to create models of problems with discrete decisions\"}],\"text\":\"Advanced optimization modeling and discrete decision modeling.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 726\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods\"}],\"text\":\"Nonlinear optimization algorithms and methods.\"},{\"evidence\":[{\"course_id\":\"MATH/STAT 431\",\"field\":\"description\",\"quote\":\"Topics covered include axioms of probability, random variables, the most important discrete and continuous probability distributions, expectation and variance, moment generating functions, conditional probability and conditional expectations, multivariate distributions, Markov's and Chebyshev's inequalities, laws of large numbers, and the central limit theorem\"}],\"text\":\"Probability theory, random variables, and limit theorems.\"}],\"search_phrases\":[\"dynamic programming algorithms\",\"Markov decision processes\",\"stochastic optimization\",\"resource allocation\",\"traveling salesman problem\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General and special techniques of dynamic programming developed by means of examples\"}],\"text\":\"Applying dynamic programming techniques to solve optimization problems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes\"}],\"text\":\"Solving specific optimization problems including shortest-path, TSP, knapsack, and inventory systems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General stochastic formulations. Markovian decision processes\"}],\"text\":\"Formulating and analyzing stochastic decision processes.\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"title\",\"quote\":\"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General and special techniques of dynamic programming developed by means of examples\"}],\"text\":\"Covers dynamic programming techniques and applications to problems like shortest-path, TSP, and Markovian decision processes.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes\"}],\"text\":\"Shortest-path algorithms, equipment replacement, resource allocation, TSP, knapsack, and inventory systems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General stochastic formulations. Markovian decision processes\"}],\"text\":\"Stochastic formulations and Markovian decision processes.\"}]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":true},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"7a3f0b73a4229c0752ea16381d01fa94004509c3aec6de1118ce220bf68a9780","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":true},{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-789789da373eecc1ff75f626","output_id":"725c416fdfae104b725523a8b4846a8839a1822580e091f4831d58b6b756bf68","section":"requirements","status":"invalid","value_json":null,"candidate_json":"{\"nodes\":[{\"children\":[],\"condition\":null,\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[\"Graduate/professional standing is a standing requirement.\"],\"root\":\"n0\",\"status\":\"parsed\"}","error":"Non-course conditions must preserve verbatim source text","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_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-789789da373eecc1ff75f626","output_id":"725c416fdfae104b725523a8b4846a8839a1822580e091f4831d58b6b756bf68","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/I SY E/MATH/STAT 525,I SY E 623,COMP SCI/I SY E/MATH/STAT 726), knowledge of analysis (e.g.,MATH/STAT 431or521) and programming ability (e.g.,COMP SCI 200or 301)\"}],\"text\":\"Knowledge of mathematical optimization, analysis, and programming ability.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 200\",\"field\":\"description\",\"quote\":\"Learn the process of incrementally developing small (200-500 lines) programs along with the fundamental Computer Science topics. These topics include: problem abstraction and decomposition, the edit-compile-run cycle, using variables of primitive and more complex data types, conditional and loop-based flow control, basic testing and debugging techniques, how to define and call functions\"}],\"text\":\"Fundamental programming skills including problem decomposition, control flow, and function definition.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 525\",\"field\":\"description\",\"quote\":\"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory\"}],\"text\":\"Linear optimization theory, simplex method, and duality.\"},{\"evidence\":[{\"course_id\":\"ISYE 623\",\"field\":\"description\",\"quote\":\"Translation of problems into optimization models, including how to implement these models in relevant software. Specific topics include techniques to create models of problems with discrete decisions\"}],\"text\":\"Advanced optimization modeling and discrete decision modeling.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 726\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods\"}],\"text\":\"Nonlinear optimization algorithms and methods.\"},{\"evidence\":[{\"course_id\":\"MATH/STAT 431\",\"field\":\"description\",\"quote\":\"Topics covered include axioms of probability, random variables, the most important discrete and continuous probability distributions, expectation and variance, moment generating functions, conditional probability and conditional expectations, multivariate distributions, Markov's and Chebyshev's inequalities, laws of large numbers, and the central limit theorem\"}],\"text\":\"Probability theory, random variables, and limit theorems.\"}],\"search_phrases\":[\"dynamic programming algorithms\",\"Markov decision processes\",\"stochastic optimization\",\"resource allocation\",\"traveling salesman problem\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General and special techniques of dynamic programming developed by means of examples\"}],\"text\":\"Applying dynamic programming techniques to solve optimization problems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes\"}],\"text\":\"Solving specific optimization problems including shortest-path, TSP, knapsack, and inventory systems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General stochastic formulations. Markovian decision processes\"}],\"text\":\"Formulating and analyzing stochastic decision processes.\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"title\",\"quote\":\"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General and special techniques of dynamic programming developed by means of examples\"}],\"text\":\"Covers dynamic programming techniques and applications to problems like shortest-path, TSP, and Markovian decision processes.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes\"}],\"text\":\"Shortest-path algorithms, equipment replacement, resource allocation, TSP, knapsack, and inventory systems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General stochastic formulations. Markovian decision processes\"}],\"text\":\"Stochastic formulations and Markovian decision processes.\"}]}","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_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-789789da373eecc1ff75f626","output_id":"725c416fdfae104b725523a8b4846a8839a1822580e091f4831d58b6b756bf68","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_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"1a28914d3aeba3e283fc4f218d62c012dc8c1cf3466c3bd14575ede3cf092489","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[\"Graduate/professional standing is a standing requirement.\"],\"root\":\"n0\",\"status\":\"parsed\"}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":true},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"1a28914d3aeba3e283fc4f218d62c012dc8c1cf3466c3bd14575ede3cf092489","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/I SY E/MATH/STAT 525,I SY E 623,COMP SCI/I SY E/MATH/STAT 726), knowledge of analysis (e.g.,MATH/STAT 431or521) and programming ability (e.g.,COMP SCI 200or 301)\"}],\"text\":\"Knowledge of mathematical optimization, analysis, and programming ability.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 200\",\"field\":\"description\",\"quote\":\"Learn the process of incrementally developing small (200-500 lines) programs along with the fundamental Computer Science topics. These topics include: problem abstraction and decomposition, the edit-compile-run cycle, using variables of primitive and more complex data types, conditional and loop-based flow control, basic testing and debugging techniques, how to define and call functions\"}],\"text\":\"Fundamental programming skills including problem decomposition, control flow, and function definition.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 525\",\"field\":\"description\",\"quote\":\"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory\"}],\"text\":\"Linear optimization theory, simplex method, and duality.\"},{\"evidence\":[{\"course_id\":\"ISYE 623\",\"field\":\"description\",\"quote\":\"Translation of problems into optimization models, including how to implement these models in relevant software. Specific topics include techniques to create models of problems with discrete decisions\"}],\"text\":\"Advanced optimization modeling and discrete decision modeling.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 726\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods\"}],\"text\":\"Nonlinear optimization algorithms and methods.\"},{\"evidence\":[{\"course_id\":\"MATH/STAT 431\",\"field\":\"description\",\"quote\":\"Topics covered include axioms of probability, random variables, the most important discrete and continuous probability distributions, expectation and variance, moment generating functions, conditional probability and conditional expectations, multivariate distributions, Markov's and Chebyshev's inequalities, laws of large numbers, and the central limit theorem\"}],\"text\":\"Probability theory, random variables, and limit theorems.\"}],\"search_phrases\":[\"dynamic programming algorithms\",\"Markov decision processes\",\"stochastic optimization\",\"resource allocation\",\"traveling salesman problem\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General and special techniques of dynamic programming developed by means of examples\"}],\"text\":\"Applying dynamic programming techniques to solve optimization problems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes\"}],\"text\":\"Solving specific optimization problems including shortest-path, TSP, knapsack, and inventory systems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General stochastic formulations. Markovian decision processes\"}],\"text\":\"Formulating and analyzing stochastic decision processes.\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"title\",\"quote\":\"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General and special techniques of dynamic programming developed by means of examples\"}],\"text\":\"Covers dynamic programming techniques and applications to problems like shortest-path, TSP, and Markovian decision processes.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes\"}],\"text\":\"Shortest-path algorithms, equipment replacement, resource allocation, TSP, knapsack, and inventory systems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General stochastic formulations. Markovian decision processes\"}],\"text\":\"Stochastic formulations and Markovian decision processes.\"}]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":true},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"1a28914d3aeba3e283fc4f218d62c012dc8c1cf3466c3bd14575ede3cf092489","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":true},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"1a28914d3aeba3e283fc4f218d62c012dc8c1cf3466c3bd14575ede3cf092489","section":"student_summary","status":"valid","value_json":"{\"context_hash\":\"d22b7cf583dd81aeac142df9bf9863ca24911aa9792f1dd4a0b7d5dba0e05f18\",\"course_id\":\"COMPSCI/ISYE 723\",\"current_instructors\":[{\"instructor_uid\":\"instructor_b67d3db63b5f7978d78b2ad5\",\"message\":\"No course-specific reviews available\",\"name\":\"Yonatan Mintz\",\"review_status\":\"no_course_reviews\",\"rmp_instructor_id\":\"rmp:3014140\",\"summary\":[{\"citations\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"source_record\":{\"entity_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"source_record\":{\"entity_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"source_record\":{\"entity_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Fall 2023: 3.89 GPA, 89.5% A/AB (n=19 letter grades); Fall 2024: 3.95 GPA, 100.0% A/AB (n=22 letter grades); Fall 2025: 3.87 GPA, 93.3% A/AB (n=15 letter grades).\"}]}],\"difficulty_workload\":[],\"errors\":[],\"historical_context\":[],\"message\":\"No course-specific reviews available\",\"offered\":true,\"profile_hash\":\"5cb4dabf887cdbcd8c00d5a1312e10828b95c63f30bc3ea76aea199565390d02\",\"quick_take\":[{\"citations\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Fall 2023: 3.89 GPA, 89.5% A/AB (n=19 letter grades); Fall 2024: 3.95 GPA, 100.0% A/AB (n=22 letter grades); Fall 2025: 3.87 GPA, 93.3% A/AB (n=15 letter grades).\"}],\"student_experience\":[],\"task_hash\":\"74fb0997943e888960bbc9e47db8c4fd12e4292d55c20509d8d89db6a9910f68\",\"teaching_history\":[{\"citations\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"source_record\":{\"entity_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1222\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"source_record\":{\"entity_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1232\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"source_record\":{\"entity_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"source_record\":{\"entity_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"source_record\":{\"entity_id\":\"c36c8d01-d51e-3757-a8c7-6c7548f08412\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"YONATAN MINTZ is recorded teaching in Fall 2021, Fall 2022, Fall 2023, Fall 2024, Fall 2025. Recorded history may be incomplete and does not establish a future schedule.\"}],\"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":true},{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-dab8f6acaa72f26086773521","output_id":"bb77729c75194c16fb0b58188bf2d0ddc6b1a95384e806718bfa76aa94d75361","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[\"Graduate/professional standing is a standing requirement.\"],\"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_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-dab8f6acaa72f26086773521","output_id":"bb77729c75194c16fb0b58188bf2d0ddc6b1a95384e806718bfa76aa94d75361","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/I SY E/MATH/STAT 525,I SY E 623,COMP SCI/I SY E/MATH/STAT 726), knowledge of analysis (e.g.,MATH/STAT 431or521) and programming ability (e.g.,COMP SCI 200or 301)\"}],\"text\":\"Knowledge of mathematical optimization, analysis, and programming ability.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 200\",\"field\":\"description\",\"quote\":\"Learn the process of incrementally developing small (200-500 lines) programs along with the fundamental Computer Science topics. These topics include: problem abstraction and decomposition, the edit-compile-run cycle, using variables of primitive and more complex data types, conditional and loop-based flow control, basic testing and debugging techniques, how to define and call functions\"}],\"text\":\"Fundamental programming skills including problem decomposition, control flow, and function definition.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 525\",\"field\":\"description\",\"quote\":\"Introduces optimization problems whose constraints are expressed by linear inequalities. Develops geometric and algebraic insights into the structure of the problem, with an emphasis on formal proofs. Presents the theory behind the simplex method, the main algorithm used to solve linear optimization problems. Explores duality theory\"}],\"text\":\"Linear optimization theory, simplex method, and duality.\"},{\"evidence\":[{\"course_id\":\"ISYE 623\",\"field\":\"description\",\"quote\":\"Translation of problems into optimization models, including how to implement these models in relevant software. Specific topics include techniques to create models of problems with discrete decisions\"}],\"text\":\"Advanced optimization modeling and discrete decision modeling.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE/MATH/STAT 726\",\"field\":\"description\",\"quote\":\"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods\"}],\"text\":\"Nonlinear optimization algorithms and methods.\"},{\"evidence\":[{\"course_id\":\"MATH/STAT 431\",\"field\":\"description\",\"quote\":\"Topics covered include axioms of probability, random variables, the most important discrete and continuous probability distributions, expectation and variance, moment generating functions, conditional probability and conditional expectations, multivariate distributions, Markov's and Chebyshev's inequalities, laws of large numbers, and the central limit theorem\"}],\"text\":\"Probability theory, random variables, and limit theorems.\"}],\"search_phrases\":[\"dynamic programming algorithms\",\"Markov decision processes\",\"stochastic optimization\",\"resource allocation\",\"traveling salesman problem\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General and special techniques of dynamic programming developed by means of examples\"}],\"text\":\"Applying dynamic programming techniques to solve optimization problems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes\"}],\"text\":\"Solving specific optimization problems including shortest-path, TSP, knapsack, and inventory systems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General stochastic formulations. Markovian decision processes\"}],\"text\":\"Formulating and analyzing stochastic decision processes.\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"title\",\"quote\":\"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS\"},{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General and special techniques of dynamic programming developed by means of examples\"}],\"text\":\"Covers dynamic programming techniques and applications to problems like shortest-path, TSP, and Markovian decision processes.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes\"}],\"text\":\"Shortest-path algorithms, equipment replacement, resource allocation, TSP, knapsack, and inventory systems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI/ISYE 723\",\"field\":\"description\",\"quote\":\"General stochastic formulations. Markovian decision processes\"}],\"text\":\"Stochastic formulations and Markovian decision processes.\"}]}","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_b6ee9e2bd841018bd3a65997","course_id":"COMPSCI/ISYE 723","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","job_id":"enrich-dab8f6acaa72f26086773521","output_id":"bb77729c75194c16fb0b58188bf2d0ddc6b1a95384e806718bfa76aa94d75361","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}]