[{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"34f0421e07be0aa27962364ab5cfeac60894427fa4bbfd1b983d7800ff3de6a5","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"34f0421e07be0aa27962364ab5cfeac60894427fa4bbfd1b983d7800ff3de6a5","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 577\",\"field\":\"description\",\"quote\":\"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness.\"},{\"course_id\":\"COMPSCI 577\",\"field\":\"description\",\"quote\":\"Computational intractability including typical NP-complete problems and ways to deal with them.\"}],\"text\":\"Introductory algorithms, including greedy methods, divide-and-conquer, dynamic programming, reductions, randomness, and NP-completeness.\"}],\"search_phrases\":[\"advanced algorithms design analysis\",\"randomized algorithms linear programming\",\"approximation algorithms NP-hard\",\"semi-definite programming algorithms\",\"online distributed algorithms\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming.\"}],\"text\":\"Design and analysis of efficient algorithms using advanced techniques.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.\"}],\"text\":\"Applying algorithmic techniques to data structures, NP-hard approximation, learning, and distributed systems.\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"title\",\"quote\":\"ADVANCED ALGORITHMS\"},{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming.\"}],\"text\":\"COMPSCI 787 covers advanced algorithm design and analysis, focusing on randomness, linear programming, and semi-definite programming for optimization and distributed problems.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"use of randomness, linear programming, and semi-definite programming\"}],\"text\":\"Randomness, linear programming, and semi-definite programming in algorithms.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"approximating NP-hard optimization problems\"}],\"text\":\"Approximation algorithms for NP-hard optimization problems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"learning, on-line and distributed problems\"}],\"text\":\"Algorithms for learning, on-line, and distributed problems.\"}]}","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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"34f0421e07be0aa27962364ab5cfeac60894427fa4bbfd1b983d7800ff3de6a5","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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"24ad500ee60250e1c95881ed71f7f04ca83431bd4cd43a8dacc9263e064c1911","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[],\"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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"24ad500ee60250e1c95881ed71f7f04ca83431bd4cd43a8dacc9263e064c1911","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 577\",\"field\":\"description\",\"quote\":\"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness.\"},{\"course_id\":\"COMPSCI 577\",\"field\":\"description\",\"quote\":\"Computational intractability including typical NP-complete problems and ways to deal with them.\"}],\"text\":\"Introductory algorithms, including greedy methods, divide-and-conquer, dynamic programming, reductions, randomness, and NP-completeness.\"}],\"search_phrases\":[\"advanced algorithms design analysis\",\"randomized algorithms linear programming\",\"approximation algorithms NP-hard\",\"semi-definite programming algorithms\",\"online distributed algorithms\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming.\"}],\"text\":\"Design and analysis of efficient algorithms using advanced techniques.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.\"}],\"text\":\"Applying algorithmic techniques to data structures, NP-hard approximation, learning, and distributed systems.\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"title\",\"quote\":\"ADVANCED ALGORITHMS\"},{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming.\"}],\"text\":\"COMPSCI 787 covers advanced algorithm design and analysis, focusing on randomness, linear programming, and semi-definite programming for optimization and distributed problems.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"use of randomness, linear programming, and semi-definite programming\"}],\"text\":\"Randomness, linear programming, and semi-definite programming in algorithms.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"approximating NP-hard optimization problems\"}],\"text\":\"Approximation algorithms for NP-hard optimization problems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"learning, on-line and distributed problems\"}],\"text\":\"Algorithms for learning, on-line, and distributed problems.\"}]}","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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"24ad500ee60250e1c95881ed71f7f04ca83431bd4cd43a8dacc9263e064c1911","section":"student_experience","status":"valid","value_json":"{\"status\":\"supported\",\"themes\":[{\"aspect\":\"teaching_clarity\",\"evidence\":[{\"comment\":\"The worst course I ever had in uw-madison. It should be named as MATH 787. Filled with proof and math equations. Don't expect to see one line of code in this class. BTW, the homework is not relevant to homework. Please avoid if you don't want to rack yourself.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2020-09-12 04:38:12 +0000 UTC\",\"difficulty_rating\":5,\"id\":\"115439d52691704192a1295f\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":1,\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"Prof. Tzamos is an amazing professor. He provides great intuition for what is setup to be a challenging, but very useful course. The course is relevant covering cutting edge research in the field. Unfortunately, due to the pandemic this course was made online, but Prof. Tzamos made great use of technology to still make it interactive!\",\"course_id\":\"COMPSCI 787\",\"date\":\"2021-01-05 01:06:02 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"5a8a9ae75f4b0c21d18133fb\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM0MjM2Mjg1\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"Prof Tzamos has terribly good intuition about tough math concepts of algorithms. Homework is math-oriented (as expected from this class) and I found it useful ; making you prove things actually gave me a far better understanding than just reading from a book or coding the algorithms.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2021-01-13 23:10:00 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"6e91790bb53f594b026af25b\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM0Mjc0MjA5\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"CS787 advanced algorithms is a hard course. Prof Bach made the course approachable. He was willing to explain the topic and answer questions, whichever is asked at class. He definitely made it less intimidating to learn. Workload is average (2 hws + 1 exams).\",\"course_id\":\"COMPSCI 787\",\"date\":\"2023-09-07 18:54:47 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"a12d8ee34dbf31b35e4069dd\",\"instructor_id\":\"rmp:125529\",\"instructor_name\":\"Eric Bach\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM4MjA4MzM4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/125529\"}],\"evidence_count\":4,\"review_ids\":[\"115439d52691704192a1295f\",\"5a8a9ae75f4b0c21d18133fb\",\"6e91790bb53f594b026af25b\",\"a12d8ee34dbf31b35e4069dd\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:125529\",\"name\":\"Eric Bach\"},{\"id\":\"rmp:2529436\",\"name\":\"Christos Tzamos\"}],\"review_year_end\":\"2023\",\"review_year_start\":\"2020\"},\"sentiment\":\"mixed\",\"summary\":\"Reviews for Prof. Tzamos are polarized; some find his math intuition amazing while others feel the course is too proof-heavy and lacks coding. Prof. Bach is praised for being approachable and explaining topics well.\"},{\"aspect\":\"workload\",\"evidence\":[{\"comment\":\"CS787 advanced algorithms is a hard course. Prof Bach made the course approachable. He was willing to explain the topic and answer questions, whichever is asked at class. He definitely made it less intimidating to learn. Workload is average (2 hws + 1 exams).\",\"course_id\":\"COMPSCI 787\",\"date\":\"2023-09-07 18:54:47 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"a12d8ee34dbf31b35e4069dd\",\"instructor_id\":\"rmp:125529\",\"instructor_name\":\"Eric Bach\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM4MjA4MzM4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/125529\"},{\"comment\":\"The worst course I ever had in uw-madison. It should be named as MATH 787. Filled with proof and math equations. Don't expect to see one line of code in this class. BTW, the homework is not relevant to homework. Please avoid if you don't want to rack yourself.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2020-09-12 04:38:12 +0000 UTC\",\"difficulty_rating\":5,\"id\":\"115439d52691704192a1295f\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":1,\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"}],\"evidence_count\":2,\"review_ids\":[\"a12d8ee34dbf31b35e4069dd\",\"115439d52691704192a1295f\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:125529\",\"name\":\"Eric Bach\"},{\"id\":\"rmp:2529436\",\"name\":\"Christos Tzamos\"}],\"review_year_end\":\"2023\",\"review_year_start\":\"2020\"},\"sentiment\":\"mixed\",\"summary\":\"One student reported an average workload of 2 homeworks and 1 exam, while another described the homework as irrelevant and the course as extremely difficult.\"},{\"aspect\":\"assessment\",\"evidence\":[{\"comment\":\"The worst course I ever had in uw-madison. It should be named as MATH 787. Filled with proof and math equations. Don't expect to see one line of code in this class. BTW, the homework is not relevant to homework. Please avoid if you don't want to rack yourself.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2020-09-12 04:38:12 +0000 UTC\",\"difficulty_rating\":5,\"id\":\"115439d52691704192a1295f\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":1,\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"Prof Tzamos has terribly good intuition about tough math concepts of algorithms. Homework is math-oriented (as expected from this class) and I found it useful ; making you prove things actually gave me a far better understanding than just reading from a book or coding the algorithms.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2021-01-13 23:10:00 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"6e91790bb53f594b026af25b\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM0Mjc0MjA5\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"}],\"evidence_count\":2,\"review_ids\":[\"115439d52691704192a1295f\",\"6e91790bb53f594b026af25b\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:2529436\",\"name\":\"Christos Tzamos\"}],\"review_year_end\":\"2021\",\"review_year_start\":\"2020\"},\"sentiment\":\"mixed\",\"summary\":\"Assessments are described as math-oriented and proof-based, which some students found useful for understanding, while others found them irrelevant to practical coding.\"}]}","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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"d4cf82c99e772c037538f278e2b2971980188a11bc873736da5bd00d5ec366ec","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[],\"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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"d4cf82c99e772c037538f278e2b2971980188a11bc873736da5bd00d5ec366ec","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 577\",\"field\":\"description\",\"quote\":\"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness.\"},{\"course_id\":\"COMPSCI 577\",\"field\":\"description\",\"quote\":\"Computational intractability including typical NP-complete problems and ways to deal with them.\"}],\"text\":\"Introductory algorithms, including greedy methods, divide-and-conquer, dynamic programming, reductions, randomness, and NP-completeness.\"}],\"search_phrases\":[\"advanced algorithms design analysis\",\"randomized algorithms linear programming\",\"approximation algorithms NP-hard\",\"semi-definite programming algorithms\",\"online distributed algorithms\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming.\"}],\"text\":\"Design and analysis of efficient algorithms using advanced techniques.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.\"}],\"text\":\"Applying algorithmic techniques to data structures, NP-hard approximation, learning, and distributed systems.\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"title\",\"quote\":\"ADVANCED ALGORITHMS\"},{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming.\"}],\"text\":\"COMPSCI 787 covers advanced algorithm design and analysis, focusing on randomness, linear programming, and semi-definite programming for optimization and distributed problems.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"use of randomness, linear programming, and semi-definite programming\"}],\"text\":\"Randomness, linear programming, and semi-definite programming in algorithms.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"approximating NP-hard optimization problems\"}],\"text\":\"Approximation algorithms for NP-hard optimization problems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"learning, on-line and distributed problems\"}],\"text\":\"Algorithms for learning, on-line, and distributed problems.\"}]}","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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"d4cf82c99e772c037538f278e2b2971980188a11bc873736da5bd00d5ec366ec","section":"student_experience","status":"valid","value_json":"{\"status\":\"supported\",\"themes\":[{\"aspect\":\"teaching_clarity\",\"evidence\":[{\"comment\":\"The worst course I ever had in uw-madison. It should be named as MATH 787. Filled with proof and math equations. Don't expect to see one line of code in this class. BTW, the homework is not relevant to homework. Please avoid if you don't want to rack yourself.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2020-09-12 04:38:12 +0000 UTC\",\"difficulty_rating\":5,\"id\":\"115439d52691704192a1295f\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":1,\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"Prof. Tzamos is an amazing professor. He provides great intuition for what is setup to be a challenging, but very useful course. The course is relevant covering cutting edge research in the field. Unfortunately, due to the pandemic this course was made online, but Prof. Tzamos made great use of technology to still make it interactive!\",\"course_id\":\"COMPSCI 787\",\"date\":\"2021-01-05 01:06:02 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"5a8a9ae75f4b0c21d18133fb\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM0MjM2Mjg1\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"Prof Tzamos has terribly good intuition about tough math concepts of algorithms. Homework is math-oriented (as expected from this class) and I found it useful ; making you prove things actually gave me a far better understanding than just reading from a book or coding the algorithms.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2021-01-13 23:10:00 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"6e91790bb53f594b026af25b\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM0Mjc0MjA5\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"CS787 advanced algorithms is a hard course. Prof Bach made the course approachable. He was willing to explain the topic and answer questions, whichever is asked at class. He definitely made it less intimidating to learn. Workload is average (2 hws + 1 exams).\",\"course_id\":\"COMPSCI 787\",\"date\":\"2023-09-07 18:54:47 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"a12d8ee34dbf31b35e4069dd\",\"instructor_id\":\"rmp:125529\",\"instructor_name\":\"Eric Bach\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM4MjA4MzM4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/125529\"}],\"evidence_count\":4,\"review_ids\":[\"115439d52691704192a1295f\",\"5a8a9ae75f4b0c21d18133fb\",\"6e91790bb53f594b026af25b\",\"a12d8ee34dbf31b35e4069dd\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:125529\",\"name\":\"Eric Bach\"},{\"id\":\"rmp:2529436\",\"name\":\"Christos Tzamos\"}],\"review_year_end\":\"2023\",\"review_year_start\":\"2020\"},\"sentiment\":\"mixed\",\"summary\":\"Reviews for Prof. Tzamos are polarized; some find his math intuition amazing while others feel the course is too proof-heavy and lacks coding. Prof. Bach is praised for being approachable and explaining topics well.\"},{\"aspect\":\"workload\",\"evidence\":[{\"comment\":\"CS787 advanced algorithms is a hard course. Prof Bach made the course approachable. He was willing to explain the topic and answer questions, whichever is asked at class. He definitely made it less intimidating to learn. Workload is average (2 hws + 1 exams).\",\"course_id\":\"COMPSCI 787\",\"date\":\"2023-09-07 18:54:47 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"a12d8ee34dbf31b35e4069dd\",\"instructor_id\":\"rmp:125529\",\"instructor_name\":\"Eric Bach\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM4MjA4MzM4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/125529\"},{\"comment\":\"The worst course I ever had in uw-madison. It should be named as MATH 787. Filled with proof and math equations. Don't expect to see one line of code in this class. BTW, the homework is not relevant to homework. Please avoid if you don't want to rack yourself.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2020-09-12 04:38:12 +0000 UTC\",\"difficulty_rating\":5,\"id\":\"115439d52691704192a1295f\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":1,\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"}],\"evidence_count\":2,\"review_ids\":[\"a12d8ee34dbf31b35e4069dd\",\"115439d52691704192a1295f\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:125529\",\"name\":\"Eric Bach\"},{\"id\":\"rmp:2529436\",\"name\":\"Christos Tzamos\"}],\"review_year_end\":\"2023\",\"review_year_start\":\"2020\"},\"sentiment\":\"mixed\",\"summary\":\"One student reported an average workload of 2 homeworks and 1 exam, while another described the homework as irrelevant and the course as extremely difficult.\"},{\"aspect\":\"assessment\",\"evidence\":[{\"comment\":\"The worst course I ever had in uw-madison. It should be named as MATH 787. Filled with proof and math equations. Don't expect to see one line of code in this class. BTW, the homework is not relevant to homework. Please avoid if you don't want to rack yourself.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2020-09-12 04:38:12 +0000 UTC\",\"difficulty_rating\":5,\"id\":\"115439d52691704192a1295f\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":1,\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"Prof Tzamos has terribly good intuition about tough math concepts of algorithms. Homework is math-oriented (as expected from this class) and I found it useful ; making you prove things actually gave me a far better understanding than just reading from a book or coding the algorithms.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2021-01-13 23:10:00 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"6e91790bb53f594b026af25b\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM0Mjc0MjA5\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"}],\"evidence_count\":2,\"review_ids\":[\"115439d52691704192a1295f\",\"6e91790bb53f594b026af25b\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:2529436\",\"name\":\"Christos Tzamos\"}],\"review_year_end\":\"2021\",\"review_year_start\":\"2020\"},\"sentiment\":\"mixed\",\"summary\":\"Assessments are described as math-oriented and proof-based, which some students found useful for understanding, while others found them irrelevant to practical coding.\"}]}","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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"d4cf82c99e772c037538f278e2b2971980188a11bc873736da5bd00d5ec366ec","section":"student_summary","status":"invalid","value_json":"{\"context_hash\":\"ba220a2242f255fab23e7e1969c687516afa97611b5c0e859a4e2f76a8dca5ad\",\"course_id\":\"COMPSCI 787\",\"current_instructors\":[{\"instructor_uid\":\"instructor_c6e63d064842a675b1e752b4\",\"message\":\"No course-specific reviews available\",\"name\":\"Manolis Vlatakis Gkaragkounis\",\"review_status\":\"no_course_reviews\",\"rmp_instructor_id\":null,\"summary\":[]}],\"difficulty_workload\":[],\"errors\":[{\"error\":\"ModelAPIError: Connection error.\",\"instructor_uid\":null,\"mode\":\"history\"},{\"error\":\"ModelAPIError: Connection error.\",\"instructor_uid\":null,\"mode\":\"overview\"}],\"historical_context\":[],\"message\":null,\"offered\":true,\"profile_hash\":\"5cb4dabf887cdbcd8c00d5a1312e10828b95c63f30bc3ea76aea199565390d02\",\"quick_take\":[{\"citations\":[{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1234\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1264\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Spring 2023: 3.76 GPA, 88.2% A/AB (n=17 letter grades); Fall 2024: 3.77 GPA, 97.0% A/AB (n=33 letter grades); Spring 2026: 3.95 GPA, 100.0% A/AB (n=22 letter grades).\"}],\"student_experience\":[],\"task_hash\":\"74fb0997943e888960bbc9e47db8c4fd12e4292d55c20509d8d89db6a9910f68\",\"teaching_history\":[{\"citations\":[{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1202\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1212\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1224\",\"type\":\"grade\"}],\"text\":\"CHRISTOS TZAMOS is recorded teaching in Fall 2019, Fall 2020, Spring 2022. Recorded history may be incomplete and does not establish a future schedule.\"},{\"citations\":[{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1072\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1112\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1124\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1152\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1184\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1234\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"}],\"text\":\"ERIC BACH is recorded teaching in Fall 2006, Fall 2010, Spring 2012, Fall 2014, Spring 2018, Spring 2023, Fall 2024. 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":"[{\"mode\": \"history\", \"instructor_uid\": null, \"error\": \"ModelAPIError: Connection error.\"}, {\"mode\": \"overview\", \"instructor_uid\": null, \"error\": \"ModelAPIError: Connection error.\"}]","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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-f516c4d3e82cfe326b4f5f54","output_id":"2f01cb611bc75cd98e69a9b3ae0dfa144e3bfca8dba3db32f48b96af302505f8","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[],\"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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-f516c4d3e82cfe326b4f5f54","output_id":"2f01cb611bc75cd98e69a9b3ae0dfa144e3bfca8dba3db32f48b96af302505f8","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 577\",\"field\":\"description\",\"quote\":\"Basic paradigms for the design and analysis of efficient algorithms: greed, divide-and-conquer, dynamic programming, reductions, and the use of randomness.\"},{\"course_id\":\"COMPSCI 577\",\"field\":\"description\",\"quote\":\"Computational intractability including typical NP-complete problems and ways to deal with them.\"}],\"text\":\"Introductory algorithms, including greedy methods, divide-and-conquer, dynamic programming, reductions, randomness, and NP-completeness.\"}],\"search_phrases\":[\"advanced algorithms design analysis\",\"randomized algorithms linear programming\",\"approximation algorithms NP-hard\",\"semi-definite programming algorithms\",\"online distributed algorithms\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming.\"}],\"text\":\"Design and analysis of efficient algorithms using advanced techniques.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems.\"}],\"text\":\"Applying algorithmic techniques to data structures, NP-hard approximation, learning, and distributed systems.\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"title\",\"quote\":\"ADVANCED ALGORITHMS\"},{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming.\"}],\"text\":\"COMPSCI 787 covers advanced algorithm design and analysis, focusing on randomness, linear programming, and semi-definite programming for optimization and distributed problems.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"use of randomness, linear programming, and semi-definite programming\"}],\"text\":\"Randomness, linear programming, and semi-definite programming in algorithms.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"approximating NP-hard optimization problems\"}],\"text\":\"Approximation algorithms for NP-hard optimization problems.\"},{\"evidence\":[{\"course_id\":\"COMPSCI 787\",\"field\":\"description\",\"quote\":\"learning, on-line and distributed problems\"}],\"text\":\"Algorithms for learning, on-line, and distributed problems.\"}]}","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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-f516c4d3e82cfe326b4f5f54","output_id":"2f01cb611bc75cd98e69a9b3ae0dfa144e3bfca8dba3db32f48b96af302505f8","section":"student_experience","status":"valid","value_json":"{\"status\":\"supported\",\"themes\":[{\"aspect\":\"teaching_clarity\",\"evidence\":[{\"comment\":\"The worst course I ever had in uw-madison. It should be named as MATH 787. Filled with proof and math equations. Don't expect to see one line of code in this class. BTW, the homework is not relevant to homework. Please avoid if you don't want to rack yourself.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2020-09-12 04:38:12 +0000 UTC\",\"difficulty_rating\":5,\"id\":\"115439d52691704192a1295f\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":1,\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"Prof. Tzamos is an amazing professor. He provides great intuition for what is setup to be a challenging, but very useful course. The course is relevant covering cutting edge research in the field. Unfortunately, due to the pandemic this course was made online, but Prof. Tzamos made great use of technology to still make it interactive!\",\"course_id\":\"COMPSCI 787\",\"date\":\"2021-01-05 01:06:02 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"5a8a9ae75f4b0c21d18133fb\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM0MjM2Mjg1\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"Prof Tzamos has terribly good intuition about tough math concepts of algorithms. Homework is math-oriented (as expected from this class) and I found it useful ; making you prove things actually gave me a far better understanding than just reading from a book or coding the algorithms.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2021-01-13 23:10:00 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"6e91790bb53f594b026af25b\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM0Mjc0MjA5\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"CS787 advanced algorithms is a hard course. Prof Bach made the course approachable. He was willing to explain the topic and answer questions, whichever is asked at class. He definitely made it less intimidating to learn. Workload is average (2 hws + 1 exams).\",\"course_id\":\"COMPSCI 787\",\"date\":\"2023-09-07 18:54:47 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"a12d8ee34dbf31b35e4069dd\",\"instructor_id\":\"rmp:125529\",\"instructor_name\":\"Eric Bach\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM4MjA4MzM4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/125529\"}],\"evidence_count\":4,\"review_ids\":[\"115439d52691704192a1295f\",\"5a8a9ae75f4b0c21d18133fb\",\"6e91790bb53f594b026af25b\",\"a12d8ee34dbf31b35e4069dd\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:125529\",\"name\":\"Eric Bach\"},{\"id\":\"rmp:2529436\",\"name\":\"Christos Tzamos\"}],\"review_year_end\":\"2023\",\"review_year_start\":\"2020\"},\"sentiment\":\"mixed\",\"summary\":\"Reviews for Prof. Tzamos are polarized; some find his math intuition amazing while others feel the course is too proof-heavy and lacks coding. Prof. Bach is praised for being approachable and explaining topics well.\"},{\"aspect\":\"workload\",\"evidence\":[{\"comment\":\"CS787 advanced algorithms is a hard course. Prof Bach made the course approachable. He was willing to explain the topic and answer questions, whichever is asked at class. He definitely made it less intimidating to learn. Workload is average (2 hws + 1 exams).\",\"course_id\":\"COMPSCI 787\",\"date\":\"2023-09-07 18:54:47 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"a12d8ee34dbf31b35e4069dd\",\"instructor_id\":\"rmp:125529\",\"instructor_name\":\"Eric Bach\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM4MjA4MzM4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/125529\"},{\"comment\":\"The worst course I ever had in uw-madison. It should be named as MATH 787. Filled with proof and math equations. Don't expect to see one line of code in this class. BTW, the homework is not relevant to homework. Please avoid if you don't want to rack yourself.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2020-09-12 04:38:12 +0000 UTC\",\"difficulty_rating\":5,\"id\":\"115439d52691704192a1295f\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":1,\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"}],\"evidence_count\":2,\"review_ids\":[\"a12d8ee34dbf31b35e4069dd\",\"115439d52691704192a1295f\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:125529\",\"name\":\"Eric Bach\"},{\"id\":\"rmp:2529436\",\"name\":\"Christos Tzamos\"}],\"review_year_end\":\"2023\",\"review_year_start\":\"2020\"},\"sentiment\":\"mixed\",\"summary\":\"One student reported an average workload of 2 homeworks and 1 exam, while another described the homework as irrelevant and the course as extremely difficult.\"},{\"aspect\":\"assessment\",\"evidence\":[{\"comment\":\"The worst course I ever had in uw-madison. It should be named as MATH 787. Filled with proof and math equations. Don't expect to see one line of code in this class. BTW, the homework is not relevant to homework. Please avoid if you don't want to rack yourself.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2020-09-12 04:38:12 +0000 UTC\",\"difficulty_rating\":5,\"id\":\"115439d52691704192a1295f\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":1,\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"},{\"comment\":\"Prof Tzamos has terribly good intuition about tough math concepts of algorithms. Homework is math-oriented (as expected from this class) and I found it useful ; making you prove things actually gave me a far better understanding than just reading from a book or coding the algorithms.\",\"course_id\":\"COMPSCI 787\",\"date\":\"2021-01-13 23:10:00 +0000 UTC\",\"difficulty_rating\":4,\"id\":\"6e91790bb53f594b026af25b\",\"instructor_id\":\"rmp:2529436\",\"instructor_name\":\"Christos Tzamos\",\"quality_rating\":5,\"source_review_id\":\"UmF0aW5nLTM0Mjc0MjA5\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\"}],\"evidence_count\":2,\"review_ids\":[\"115439d52691704192a1295f\",\"6e91790bb53f594b026af25b\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:2529436\",\"name\":\"Christos Tzamos\"}],\"review_year_end\":\"2021\",\"review_year_start\":\"2020\"},\"sentiment\":\"mixed\",\"summary\":\"Assessments are described as math-oriented and proof-based, which some students found useful for understanding, while others found them irrelevant to practical coding.\"}]}","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_1c792cd171ebabb5c5548c07","course_id":"COMPSCI 787","catalog_version_id":"4479b1c373eb7f6c37de033740f8e53b39dc27d10418f125f68649dd1485b091","record_version_id":"8c7218745a19a0176e6ec9a78c82ff7d0c94d7f098c7995bf2616006d18e4c42","job_id":"enrich-f516c4d3e82cfe326b4f5f54","output_id":"2f01cb611bc75cd98e69a9b3ae0dfa144e3bfca8dba3db32f48b96af302505f8","section":"student_summary","status":"valid","value_json":"{\"context_hash\":\"ba220a2242f255fab23e7e1969c687516afa97611b5c0e859a4e2f76a8dca5ad\",\"course_id\":\"COMPSCI 787\",\"current_instructors\":[{\"instructor_uid\":\"instructor_c6e63d064842a675b1e752b4\",\"message\":\"No course-specific reviews available\",\"name\":\"Manolis Vlatakis Gkaragkounis\",\"review_status\":\"no_course_reviews\",\"rmp_instructor_id\":null,\"summary\":[]}],\"difficulty_workload\":[{\"citations\":[{\"instructor_name\":\"Christos Tzamos\",\"review_date\":\"2020-09-12 04:38:12 +0000 UTC\",\"review_id\":\"115439d52691704192a1295f\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:2529436\",\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\",\"type\":\"review\"},{\"instructor_name\":\"Eric Bach\",\"review_date\":\"2023-09-07 18:54:47 +0000 UTC\",\"review_id\":\"a12d8ee34dbf31b35e4069dd\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:125529\",\"source_review_id\":\"UmF0aW5nLTM4MjA4MzM4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/125529\",\"type\":\"review\"}],\"text\":\"The course is mathematically rigorous with heavy proof requirements, though one historical review notes an average workload of two homeworks and one exam under a different instructor.\"}],\"errors\":[],\"historical_context\":[{\"citations\":[{\"instructor_name\":\"Christos Tzamos\",\"review_date\":\"2020-09-12 04:38:12 +0000 UTC\",\"review_id\":\"115439d52691704192a1295f\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:2529436\",\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\",\"type\":\"review\"},{\"instructor_name\":\"Christos Tzamos\",\"review_date\":\"2021-01-05 01:06:02 +0000 UTC\",\"review_id\":\"5a8a9ae75f4b0c21d18133fb\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:2529436\",\"source_review_id\":\"UmF0aW5nLTM0MjM2Mjg1\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\",\"type\":\"review\"},{\"instructor_name\":\"Christos Tzamos\",\"review_date\":\"2021-01-13 23:10:00 +0000 UTC\",\"review_id\":\"6e91790bb53f594b026af25b\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:2529436\",\"source_review_id\":\"UmF0aW5nLTM0Mjc0MjA5\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\",\"type\":\"review\"},{\"instructor_name\":\"Eric Bach\",\"review_date\":\"2023-09-07 18:54:47 +0000 UTC\",\"review_id\":\"a12d8ee34dbf31b35e4069dd\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:125529\",\"source_review_id\":\"UmF0aW5nLTM4MjA4MzM4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/125529\",\"type\":\"review\"},{\"instructor_name\":\"Christos Tzamos\",\"review_date\":\"2023-11-27 16:18:14 +0000 UTC\",\"review_id\":\"5ca81ca8ed259f9f3ce592e3\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:2529436\",\"source_review_id\":\"UmF0aW5nLTM4NDQxNDA5\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\",\"type\":\"review\"}],\"text\":\"Manolis Vlatakis Gkaragkounis is the current instructor, but reviews focus on historical faculty. Christos Tzamos provided strong intuition for math-heavy algorithms, though one student found the proof-based content overwhelming. Eric Bach made the difficult course approachable and responsive to student questions.\"}],\"message\":null,\"offered\":true,\"profile_hash\":\"e59ddc7389015d0035b68cd195c939d475bf72b959b29cf12eab59b454ccaef1\",\"quick_take\":[{\"citations\":[{\"instructor_name\":\"Christos Tzamos\",\"review_date\":\"2021-01-05 01:06:02 +0000 UTC\",\"review_id\":\"5a8a9ae75f4b0c21d18133fb\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:2529436\",\"source_review_id\":\"UmF0aW5nLTM0MjM2Mjg1\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\",\"type\":\"review\"},{\"instructor_name\":\"Christos Tzamos\",\"review_date\":\"2021-01-13 23:10:00 +0000 UTC\",\"review_id\":\"6e91790bb53f594b026af25b\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:2529436\",\"source_review_id\":\"UmF0aW5nLTM0Mjc0MjA5\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\",\"type\":\"review\"}],\"text\":\"Historical reviews describe COMPSCI 787 as a challenging but useful course covering cutting-edge research, with students valuing the deep mathematical intuition provided by past instructors.\"},{\"citations\":[{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1234\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1264\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Spring 2023: 3.76 GPA, 88.2% A/AB (n=17 letter grades); Fall 2024: 3.77 GPA, 97.0% A/AB (n=33 letter grades); Spring 2026: 3.95 GPA, 100.0% A/AB (n=22 letter grades).\"}],\"student_experience\":[{\"citations\":[{\"instructor_name\":\"Christos Tzamos\",\"review_date\":\"2020-09-12 04:38:12 +0000 UTC\",\"review_id\":\"115439d52691704192a1295f\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:2529436\",\"source_review_id\":\"UmF0aW5nLTMzNjQxMzg3\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\",\"type\":\"review\"},{\"instructor_name\":\"Christos Tzamos\",\"review_date\":\"2021-01-05 01:06:02 +0000 UTC\",\"review_id\":\"5a8a9ae75f4b0c21d18133fb\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:2529436\",\"source_review_id\":\"UmF0aW5nLTM0MjM2Mjg1\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\",\"type\":\"review\"},{\"instructor_name\":\"Christos Tzamos\",\"review_date\":\"2021-01-13 23:10:00 +0000 UTC\",\"review_id\":\"6e91790bb53f594b026af25b\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:2529436\",\"source_review_id\":\"UmF0aW5nLTM0Mjc0MjA5\",\"source_url\":\"https://www.ratemyprofessors.com/professor/2529436\",\"type\":\"review\"}],\"text\":\"Historical reviews of Christos Tzamos: Students report conflicting experiences with the mathematical focus; some find the proofs essential for understanding, while others dislike the lack of coding and high difficulty.\"}],\"task_hash\":\"74fb0997943e888960bbc9e47db8c4fd12e4292d55c20509d8d89db6a9910f68\",\"teaching_history\":[{\"citations\":[{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1202\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1212\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1224\",\"type\":\"grade\"}],\"text\":\"CHRISTOS TZAMOS is recorded teaching in Fall 2019, Fall 2020, Spring 2022. Recorded history may be incomplete and does not establish a future schedule.\"},{\"citations\":[{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1072\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1112\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1124\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1152\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1184\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1234\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 787\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"source_record\":{\"entity_id\":\"e15aee56-d421-3b05-b6be-098392da0212\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"}],\"text\":\"ERIC BACH is recorded teaching in Fall 2006, Fall 2010, Spring 2012, Fall 2014, Spring 2018, Spring 2023, Fall 2024. 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}]