[{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"68847327309748809a7367f8cec99b930870dd2606c0093bb11a5e4222a90bc0","record_version_id":"2cfacf5d7714e4fee86657850a46cd01af339be28423d24ef625c74c95b253a5","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"dc7e9554d5b8c161900af82868f9b4f7a377469f6681efb2265b57d0c0ed6240","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"root\",\"kind\":\"condition\"}],\"notes\":[],\"root\":\"root\",\"status\":\"parsed\"}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":true},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"68847327309748809a7367f8cec99b930870dd2606c0093bb11a5e4222a90bc0","record_version_id":"2cfacf5d7714e4fee86657850a46cd01af339be28423d24ef625c74c95b253a5","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"dc7e9554d5b8c161900af82868f9b4f7a377469f6681efb2265b57d0c0ed6240","section":"search_profile","status":"valid","value_json":"{\"activity_tags\":[],\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Knowledge of programming languages and compiler design\"}],\"search_phrases\":[\"program verification\",\"model-checking techniques\",\"linear temporal logic\",\"computational tree logic\",\"logic/automata connection\",\"bisimulations\",\"probabilistic model-checking\",\"program synthesis\",\"verification of privacy properties\",\"formal methods for program verification\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"official_learning_outcomes\",\"outcome_index\":0,\"quote\":\"Syntax and formal semantics of temporal logics such as LTL and MSO and formalizing software safety properties. Translations from temporal logics to automata.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Formal semantics of temporal logics and translation to automata\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"official_learning_outcomes\",\"outcome_index\":1,\"quote\":\"Understand algorithms for checking whether a program satisfies a temporal property in temporal logic and apply such algorithms to verification problems.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Applying model-checking algorithms to verification problems\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"official_learning_outcomes\",\"outcome_index\":2,\"quote\":\"Understand and apply state-of-the-art program synthesis algorithms such as counterexample-guided inductive synthesis, syntax-guided synthesis, sketching, and MCMC sampling.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Applying program synthesis algorithms including CEGIS and syntax-guided synthesis\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"title\",\"quote\":\"PROGRAM VERIFICATION AND SYNTHESIS\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"},{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Formal methods for program verification covering model-checking, temporal logics, automata connections, and special topics like program synthesis and privacy property verification.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Model-checking, temporal logics (LTL, CTL), logic/automata connection, bisimulations, and probabilistic model-checking\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Program synthesis and verification/synthesis of privacy properties\"}]}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":true},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"68847327309748809a7367f8cec99b930870dd2606c0093bb11a5e4222a90bc0","record_version_id":"2cfacf5d7714e4fee86657850a46cd01af339be28423d24ef625c74c95b253a5","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"dc7e9554d5b8c161900af82868f9b4f7a377469f6681efb2265b57d0c0ed6240","section":"student_experience","status":"insufficient_evidence","value_json":"{\"status\":\"insufficient_evidence\",\"themes\":[]}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":true},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"68847327309748809a7367f8cec99b930870dd2606c0093bb11a5e4222a90bc0","record_version_id":"2cfacf5d7714e4fee86657850a46cd01af339be28423d24ef625c74c95b253a5","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"dc7e9554d5b8c161900af82868f9b4f7a377469f6681efb2265b57d0c0ed6240","section":"student_summary","status":"valid","value_json":"{\"context_hash\":\"10445d8837aff821886d518c85300de571ab6e914d9b64875e1d81101cd1db40\",\"course_id\":\"COMPSCI 703\",\"current_instructors\":[{\"instructor_uid\":\"instructor_1f76910c57da4dfc0d426595\",\"message\":\"No course-specific reviews available\",\"name\":\"Adithya Murali\",\"review_status\":\"no_course_reviews\",\"rmp_instructor_id\":null,\"summary\":[{\"citations\":[{\"course_id\":\"COMPSCI 703\",\"run_id\":\"20261014T203208-0851c9a1\",\"section_number\":1,\"source_course_id\":\"3e23efe6-72a4-3cc2-ac1f-10ac7a79aa03\",\"source_record\":{\"entity_id\":\"3e23efe6-72a4-3cc2-ac1f-10ac7a79aa03\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1254\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Spring 2025: 3.77 GPA, 100.0% A/AB (n=11 letter grades).\"}]}],\"difficulty_workload\":[],\"errors\":[],\"historical_context\":[],\"message\":\"No course-specific reviews available\",\"offered\":true,\"profile_hash\":\"3f5110430805ccdd533c0c072df62d68a8a5f5441c4530bbdb15d419a199a09c\",\"quick_take\":[{\"citations\":[{\"course_id\":\"COMPSCI 703\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"3e23efe6-72a4-3cc2-ac1f-10ac7a79aa03\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1232\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 703\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"3e23efe6-72a4-3cc2-ac1f-10ac7a79aa03\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 703\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"3e23efe6-72a4-3cc2-ac1f-10ac7a79aa03\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1254\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Fall 2022: 3.80 GPA, 96.0% A/AB (n=25 letter grades); Fall 2023: 3.92 GPA, 96.0% A/AB (n=25 letter grades); Spring 2025: 3.77 GPA, 100.0% A/AB (n=11 letter grades).\"}],\"student_experience\":[],\"task_hash\":\"9dea82ef7f2113a5605c1c6030c4f9b19967eb742cc93a78268fb92357d29f5c\",\"teaching_history\":[{\"citations\":[{\"course_id\":\"COMPSCI 703\",\"run_id\":\"20261014T203208-0851c9a1\",\"section_number\":1,\"source_course_id\":\"3e23efe6-72a4-3cc2-ac1f-10ac7a79aa03\",\"source_record\":{\"entity_id\":\"3e23efe6-72a4-3cc2-ac1f-10ac7a79aa03\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1254\",\"type\":\"grade\"}],\"text\":\"ADITHYA MURALI is recorded teaching in Spring 2025. Recorded history may be incomplete and does not establish a future schedule.\"}],\"term_id\":\"1274\",\"term_name\":\"2027 Sprng\",\"version\":3}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":true},{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"5d73a763748dbd7a8baa82baa204789dcf61c7149e712fd6276f70d2a184de3c","section":"requirements","status":"invalid","value_json":null,"candidate_json":"{\"nodes\":[{\"children\":[],\"condition\":null,\"course\":{\"course_number\":0,\"minimum_grade\":null,\"subjects\":[\"COMPSCI\"],\"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 phrase 'Graduate/professional standing' is ambiguous; it may refer to a specific standing category or require review to distinguish from course-level prerequisites. It is treated as a condition leaf.\"],\"root\":\"n0\",\"status\":\"needs_review\"}","error":"Unreachable nodes: n1; 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_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"5d73a763748dbd7a8baa82baa204789dcf61c7149e712fd6276f70d2a184de3c","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 536\",\"field\":\"description\",\"quote\":\"Introduction to the theory and practice of compiler design. Comparison of features of several programming languages and their implications for implementation techniques.\"}],\"text\":\"Programming languages and compiler design\"}],\"search_phrases\":[\"formal methods program verification\",\"model checking temporal logic\",\"program synthesis privacy\",\"COMPSCI 703 graduate verification\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"Model checking and temporal logic reasoning\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\"}],\"text\":\"Program synthesis and privacy property verification\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"title\",\"quote\":\"PROGRAM VERIFICATION AND SYNTHESIS\"},{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"COMPSCI 703 teaches formal methods for program verification, including model checking, temporal logic, and program synthesis.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"Model checking and temporal logic\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\"}],\"text\":\"Program synthesis and privacy properties\"}]}","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_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"5d73a763748dbd7a8baa82baa204789dcf61c7149e712fd6276f70d2a184de3c","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_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"12137f8544afc62bf75fc4945a1b050418f776990292fb8541fd9c1b80fb76f3","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[\"The requirement 'Graduate/professional standing' is modeled as a condition node.\"],\"root\":\"n0\",\"status\":\"parsed\"}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"12137f8544afc62bf75fc4945a1b050418f776990292fb8541fd9c1b80fb76f3","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 536\",\"field\":\"description\",\"quote\":\"Introduction to the theory and practice of compiler design. Comparison of features of several programming languages and their implications for implementation techniques.\"}],\"text\":\"Programming languages and compiler design\"}],\"search_phrases\":[\"formal methods program verification\",\"model checking temporal logic\",\"program synthesis privacy\",\"COMPSCI 703 graduate verification\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"Model checking and temporal logic reasoning\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\"}],\"text\":\"Program synthesis and privacy property verification\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"title\",\"quote\":\"PROGRAM VERIFICATION AND SYNTHESIS\"},{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"COMPSCI 703 teaches formal methods for program verification, including model checking, temporal logic, and program synthesis.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"Model checking and temporal logic\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\"}],\"text\":\"Program synthesis and privacy properties\"}]}","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_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"12137f8544afc62bf75fc4945a1b050418f776990292fb8541fd9c1b80fb76f3","section":"student_experience","status":"insufficient_evidence","value_json":"{\"status\":\"insufficient_evidence\",\"themes\":[]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"68847327309748809a7367f8cec99b930870dd2606c0093bb11a5e4222a90bc0","record_version_id":"2cfacf5d7714e4fee86657850a46cd01af339be28423d24ef625c74c95b253a5","job_id":"enrich-6556a505c10f448d98d02466","output_id":"ae00015664927b21f5b5b014e2dced1f9b35641189e0f6d9512bed72388ff3a3","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"root\",\"kind\":\"condition\"}],\"notes\":[],\"root\":\"root\",\"status\":\"parsed\"}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":false},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"68847327309748809a7367f8cec99b930870dd2606c0093bb11a5e4222a90bc0","record_version_id":"2cfacf5d7714e4fee86657850a46cd01af339be28423d24ef625c74c95b253a5","job_id":"enrich-6556a505c10f448d98d02466","output_id":"ae00015664927b21f5b5b014e2dced1f9b35641189e0f6d9512bed72388ff3a3","section":"search_profile","status":"valid","value_json":"{\"activity_tags\":[],\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Knowledge of programming languages and compiler design\"}],\"search_phrases\":[\"program verification\",\"model-checking techniques\",\"linear temporal logic\",\"computational tree logic\",\"logic/automata connection\",\"bisimulations\",\"probabilistic model-checking\",\"program synthesis\",\"verification of privacy properties\",\"formal methods for program verification\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"official_learning_outcomes\",\"outcome_index\":0,\"quote\":\"Syntax and formal semantics of temporal logics such as LTL and MSO and formalizing software safety properties. Translations from temporal logics to automata.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Formal semantics of temporal logics and translation to automata\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"official_learning_outcomes\",\"outcome_index\":1,\"quote\":\"Understand algorithms for checking whether a program satisfies a temporal property in temporal logic and apply such algorithms to verification problems.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Applying model-checking algorithms to verification problems\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"official_learning_outcomes\",\"outcome_index\":2,\"quote\":\"Understand and apply state-of-the-art program synthesis algorithms such as counterexample-guided inductive synthesis, syntax-guided synthesis, sketching, and MCMC sampling.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Applying program synthesis algorithms including CEGIS and syntax-guided synthesis\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"title\",\"quote\":\"PROGRAM VERIFICATION AND SYNTHESIS\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"},{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Formal methods for program verification covering model-checking, temporal logics, automata connections, and special topics like program synthesis and privacy property verification.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Model-checking, temporal logics (LTL, CTL), logic/automata connection, bisimulations, and probabilistic model-checking\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Program synthesis and verification/synthesis of privacy properties\"}]}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":false},{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"68847327309748809a7367f8cec99b930870dd2606c0093bb11a5e4222a90bc0","record_version_id":"2cfacf5d7714e4fee86657850a46cd01af339be28423d24ef625c74c95b253a5","job_id":"enrich-6556a505c10f448d98d02466","output_id":"ae00015664927b21f5b5b014e2dced1f9b35641189e0f6d9512bed72388ff3a3","section":"student_experience","status":"insufficient_evidence","value_json":"{\"status\":\"insufficient_evidence\",\"themes\":[]}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":false},{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-789789da373eecc1ff75f626","output_id":"d1c91a916f6cbb26d75e8cb458b5c9212eef49ee3d84a77a52ff6cb897ac1d93","section":"requirements","status":"invalid","value_json":null,"candidate_json":"{\"nodes\":[{\"children\":[],\"condition\":null,\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[\"The requirement 'Graduate/professional standing' is modeled as a condition node.\"],\"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_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-789789da373eecc1ff75f626","output_id":"d1c91a916f6cbb26d75e8cb458b5c9212eef49ee3d84a77a52ff6cb897ac1d93","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 536\",\"field\":\"description\",\"quote\":\"Introduction to the theory and practice of compiler design. Comparison of features of several programming languages and their implications for implementation techniques.\"}],\"text\":\"Programming languages and compiler design\"}],\"search_phrases\":[\"formal methods program verification\",\"model checking temporal logic\",\"program synthesis privacy\",\"COMPSCI 703 graduate verification\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"Model checking and temporal logic reasoning\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\"}],\"text\":\"Program synthesis and privacy property verification\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"title\",\"quote\":\"PROGRAM VERIFICATION AND SYNTHESIS\"},{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"COMPSCI 703 teaches formal methods for program verification, including model checking, temporal logic, and program synthesis.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"Model checking and temporal logic\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\"}],\"text\":\"Program synthesis and privacy properties\"}]}","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_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-789789da373eecc1ff75f626","output_id":"d1c91a916f6cbb26d75e8cb458b5c9212eef49ee3d84a77a52ff6cb897ac1d93","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_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"8e238f1ce7edf0c3fd54422419e77823cb069287b9812a492c3cf9f07ead75b0","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[\"The requirement 'Graduate/professional standing' is modeled as a condition node.\"],\"root\":\"n0\",\"status\":\"parsed\"}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"8e238f1ce7edf0c3fd54422419e77823cb069287b9812a492c3cf9f07ead75b0","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 536\",\"field\":\"description\",\"quote\":\"Introduction to the theory and practice of compiler design. Comparison of features of several programming languages and their implications for implementation techniques.\"}],\"text\":\"Programming languages and compiler design\"}],\"search_phrases\":[\"formal methods program verification\",\"model checking temporal logic\",\"program synthesis privacy\",\"COMPSCI 703 graduate verification\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"Model checking and temporal logic reasoning\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\"}],\"text\":\"Program synthesis and privacy property verification\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"title\",\"quote\":\"PROGRAM VERIFICATION AND SYNTHESIS\"},{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"COMPSCI 703 teaches formal methods for program verification, including model checking, temporal logic, and program synthesis.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"Model checking and temporal logic\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\"}],\"text\":\"Program synthesis and privacy properties\"}]}","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_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"8e238f1ce7edf0c3fd54422419e77823cb069287b9812a492c3cf9f07ead75b0","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_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"8e238f1ce7edf0c3fd54422419e77823cb069287b9812a492c3cf9f07ead75b0","section":"student_summary","status":"valid","value_json":"{\"context_hash\":\"87e36eb8a319829747dc590e34d30f8fb2cf552fe0ef76bef937f8e6a1089630\",\"course_id\":\"COMPSCI 703\",\"current_instructors\":[],\"difficulty_workload\":[],\"errors\":[],\"historical_context\":[],\"message\":\"No course-specific reviews available\",\"offered\":false,\"profile_hash\":\"5cb4dabf887cdbcd8c00d5a1312e10828b95c63f30bc3ea76aea199565390d02\",\"quick_take\":[{\"citations\":[{\"course_id\":\"COMPSCI 703\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"3e23efe6-72a4-3cc2-ac1f-10ac7a79aa03\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1232\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 703\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"3e23efe6-72a4-3cc2-ac1f-10ac7a79aa03\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 703\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"3e23efe6-72a4-3cc2-ac1f-10ac7a79aa03\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1254\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Fall 2022: 3.80 GPA, 96.0% A/AB (n=25 letter grades); Fall 2023: 3.92 GPA, 96.0% A/AB (n=25 letter grades); Spring 2025: 3.77 GPA, 100.0% A/AB (n=11 letter grades).\"}],\"student_experience\":[],\"task_hash\":\"74fb0997943e888960bbc9e47db8c4fd12e4292d55c20509d8d89db6a9910f68\",\"teaching_history\":[],\"term_id\":\"1272\",\"term_name\":\"2026 Fall\",\"version\":2}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false},{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-dab8f6acaa72f26086773521","output_id":"57a4adbb508393a9bf0c40a02a59889f168311aeaed2201960f03db01966a6ea","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[\"The requirement 'Graduate/professional standing' is modeled as a condition node.\"],\"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_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-dab8f6acaa72f26086773521","output_id":"57a4adbb508393a9bf0c40a02a59889f168311aeaed2201960f03db01966a6ea","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 536\",\"field\":\"description\",\"quote\":\"Introduction to the theory and practice of compiler design. Comparison of features of several programming languages and their implications for implementation techniques.\"}],\"text\":\"Programming languages and compiler design\"}],\"search_phrases\":[\"formal methods program verification\",\"model checking temporal logic\",\"program synthesis privacy\",\"COMPSCI 703 graduate verification\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"Model checking and temporal logic reasoning\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\"}],\"text\":\"Program synthesis and privacy property verification\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"title\",\"quote\":\"PROGRAM VERIFICATION AND SYNTHESIS\"},{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"COMPSCI 703 teaches formal methods for program verification, including model checking, temporal logic, and program synthesis.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking.\"}],\"text\":\"Model checking and temporal logic\"},{\"evidence\":[{\"course_id\":\"COMPSCI 703\",\"field\":\"description\",\"quote\":\"Special topics include: program synthesis, verification and synthesis of privacy properties.\"}],\"text\":\"Program synthesis and privacy properties\"}]}","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_ecff5c2de6527b0350b0998a","course_id":"COMPSCI 703","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","job_id":"enrich-dab8f6acaa72f26086773521","output_id":"57a4adbb508393a9bf0c40a02a59889f168311aeaed2201960f03db01966a6ea","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}]