[{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"938e5805353523daaeca7a72ac8809511794aeacc2e92bf16f504e6d689964c1","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"297558b2662170c7766a75ab2a7e6ce836535d397084842037bb1272612aac9c","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"r1\",\"kind\":\"condition\"}],\"notes\":[],\"root\":\"r1\",\"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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"938e5805353523daaeca7a72ac8809511794aeacc2e92bf16f504e6d689964c1","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"297558b2662170c7766a75ab2a7e6ce836535d397084842037bb1272612aac9c","section":"search_profile","status":"valid","value_json":"{\"activity_tags\":[],\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Knowledge of the theory of computation\"}],\"search_phrases\":[\"computational complexity\",\"efficient computation\",\"parallelism randomness quantum effects\",\"nondeterminism alternation counting\",\"complexity classes\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Analyze capabilities and limitations of efficient computation\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Examine relationships between computational models and complexity classes\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"title\",\"quote\":\"COMPUTATIONAL COMPLEXITY\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"},{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Computational Complexity studies the capabilities and limitations of efficient computation, focusing on models of parallelism, randomness, quantum effects, and non-uniformity alongside nondeterminism, alternation, and counting.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"capabilities and limitations of efficient computation\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Capabilities and limitations of efficient computation\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Models of parallelism, randomness, quantum effects, and non-uniformity\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"models based on the notions of nondeterminism, alternation, and counting\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Nondeterminism, alternation, and counting\"}]}","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"938e5805353523daaeca7a72ac8809511794aeacc2e92bf16f504e6d689964c1","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"297558b2662170c7766a75ab2a7e6ce836535d397084842037bb1272612aac9c","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"938e5805353523daaeca7a72ac8809511794aeacc2e92bf16f504e6d689964c1","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"297558b2662170c7766a75ab2a7e6ce836535d397084842037bb1272612aac9c","section":"student_summary","status":"valid","value_json":"{\"context_hash\":\"93bcb907e57ac641f3ad02232f23eb369db825cb9ebd31bdb95e26ef9e3d436b\",\"course_id\":\"COMPSCI 710\",\"current_instructors\":[],\"difficulty_workload\":[],\"errors\":[],\"historical_context\":[],\"message\":\"No course-specific reviews available\",\"offered\":false,\"profile_hash\":\"3f5110430805ccdd533c0c072df62d68a8a5f5441c4530bbdb15d419a199a09c\",\"quick_take\":[{\"citations\":[{\"course_id\":\"COMPSCI 710\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"d2e8dd66-d876-3db6-a412-4998917d9dd8\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1244\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 710\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"d2e8dd66-d876-3db6-a412-4998917d9dd8\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 710\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"d2e8dd66-d876-3db6-a412-4998917d9dd8\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Spring 2024: 3.87 GPA, 96.2% A/AB (n=26 letter grades); Fall 2024: 3.14 GPA, 46.4% A/AB (n=28 letter grades); Fall 2025: 3.88 GPA, 100.0% A/AB (n=20 letter grades).\"}],\"student_experience\":[],\"task_hash\":\"9dea82ef7f2113a5605c1c6030c4f9b19967eb742cc93a78268fb92357d29f5c\",\"teaching_history\":[],\"term_id\":\"1274\",\"term_name\":\"2027 Sprng\",\"version\":3}","candidate_json":null,"error":null,"model":"Qwen/Qwen3.8-27B","model_revision":"1d4bf0f2ff6012fd82039f2fa52739d0dd7c60c0","selected_for_release":true},{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"894926f96eabfa5770d0e43ef920b5f738799b8edf8936e4727525befc6c1314","section":"requirements","status":"invalid","value_json":null,"candidate_json":"{\"nodes\":[{\"children\":[],\"condition\":null,\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n0\",\"kind\":\"condition\"}],\"notes\":[],\"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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"894926f96eabfa5770d0e43ef920b5f738799b8edf8936e4727525befc6c1314","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 520\",\"field\":\"description\",\"quote\":\"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory.\"}],\"text\":\"Fundamentals of computability, automata, and complexity theory\"}],\"search_phrases\":[\"computational complexity theory\",\"parallelism randomness quantum\",\"nondeterminism alternation counting\",\"theory of computation graduate\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation.\"}],\"text\":\"Analyzing capabilities and limitations of efficient computation\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity\"}],\"text\":\"Comparing computational models based on parallelism, randomness, and quantum effects\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems\"}],\"text\":\"Analyzing complexity via nondeterminism, alternation, and counting\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"title\",\"quote\":\"COMPUTATIONAL COMPLEXITY\"},{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation.\"}],\"text\":\"COMPSCI 710 is a graduate course on computational complexity, studying efficient computation limits and relationships between various computational models.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"parallelism, randomness, quantum effects, and non-uniformity\"}],\"text\":\"Parallelism, randomness, quantum effects, and non-uniformity\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"nondeterminism, alternation, and counting\"}],\"text\":\"Nondeterminism, alternation, and counting\"}]}","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"894926f96eabfa5770d0e43ef920b5f738799b8edf8936e4727525befc6c1314","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"2fea3d4b93b26d194a96b1b396d1c3d0ad8ddd4384ec20a20a64bfe8458f63bb","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":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"2fea3d4b93b26d194a96b1b396d1c3d0ad8ddd4384ec20a20a64bfe8458f63bb","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 520\",\"field\":\"description\",\"quote\":\"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory.\"}],\"text\":\"Fundamentals of computability, automata, and complexity theory\"}],\"search_phrases\":[\"computational complexity theory\",\"parallelism randomness quantum\",\"nondeterminism alternation counting\",\"theory of computation graduate\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation.\"}],\"text\":\"Analyzing capabilities and limitations of efficient computation\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity\"}],\"text\":\"Comparing computational models based on parallelism, randomness, and quantum effects\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems\"}],\"text\":\"Analyzing complexity via nondeterminism, alternation, and counting\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"title\",\"quote\":\"COMPUTATIONAL COMPLEXITY\"},{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation.\"}],\"text\":\"COMPSCI 710 is a graduate course on computational complexity, studying efficient computation limits and relationships between various computational models.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"parallelism, randomness, quantum effects, and non-uniformity\"}],\"text\":\"Parallelism, randomness, quantum effects, and non-uniformity\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"nondeterminism, alternation, and counting\"}],\"text\":\"Nondeterminism, alternation, and counting\"}]}","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"2fea3d4b93b26d194a96b1b396d1c3d0ad8ddd4384ec20a20a64bfe8458f63bb","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"938e5805353523daaeca7a72ac8809511794aeacc2e92bf16f504e6d689964c1","job_id":"enrich-6556a505c10f448d98d02466","output_id":"5d0dbacf9c614445e97bda581d86d4ec77155c7fc506b1d600c108acb5d7367d","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"r1\",\"kind\":\"condition\"}],\"notes\":[],\"root\":\"r1\",\"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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"938e5805353523daaeca7a72ac8809511794aeacc2e92bf16f504e6d689964c1","job_id":"enrich-6556a505c10f448d98d02466","output_id":"5d0dbacf9c614445e97bda581d86d4ec77155c7fc506b1d600c108acb5d7367d","section":"search_profile","status":"valid","value_json":"{\"activity_tags\":[],\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Knowledge of the theory of computation\"}],\"search_phrases\":[\"computational complexity\",\"efficient computation\",\"parallelism randomness quantum effects\",\"nondeterminism alternation counting\",\"complexity classes\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Analyze capabilities and limitations of efficient computation\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Examine relationships between computational models and complexity classes\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"title\",\"quote\":\"COMPUTATIONAL COMPLEXITY\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"},{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Computational Complexity studies the capabilities and limitations of efficient computation, focusing on models of parallelism, randomness, quantum effects, and non-uniformity alongside nondeterminism, alternation, and counting.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"capabilities and limitations of efficient computation\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Capabilities and limitations of efficient computation\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Models of parallelism, randomness, quantum effects, and non-uniformity\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"models based on the notions of nondeterminism, alternation, and counting\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\"}],\"text\":\"Nondeterminism, alternation, and counting\"}]}","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"938e5805353523daaeca7a72ac8809511794aeacc2e92bf16f504e6d689964c1","job_id":"enrich-6556a505c10f448d98d02466","output_id":"5d0dbacf9c614445e97bda581d86d4ec77155c7fc506b1d600c108acb5d7367d","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-789789da373eecc1ff75f626","output_id":"598f1bb863f2c8ce7fba64194ca47926b56c3c91c69651a04d9bebbc6a57bfd6","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-789789da373eecc1ff75f626","output_id":"598f1bb863f2c8ce7fba64194ca47926b56c3c91c69651a04d9bebbc6a57bfd6","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 520\",\"field\":\"description\",\"quote\":\"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory.\"}],\"text\":\"Fundamentals of computability, automata, and complexity theory\"}],\"search_phrases\":[\"computational complexity theory\",\"parallelism randomness quantum\",\"nondeterminism alternation counting\",\"theory of computation graduate\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation.\"}],\"text\":\"Analyzing capabilities and limitations of efficient computation\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity\"}],\"text\":\"Comparing computational models based on parallelism, randomness, and quantum effects\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems\"}],\"text\":\"Analyzing complexity via nondeterminism, alternation, and counting\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"title\",\"quote\":\"COMPUTATIONAL COMPLEXITY\"},{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation.\"}],\"text\":\"COMPSCI 710 is a graduate course on computational complexity, studying efficient computation limits and relationships between various computational models.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"parallelism, randomness, quantum effects, and non-uniformity\"}],\"text\":\"Parallelism, randomness, quantum effects, and non-uniformity\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"nondeterminism, alternation, and counting\"}],\"text\":\"Nondeterminism, alternation, and counting\"}]}","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-789789da373eecc1ff75f626","output_id":"598f1bb863f2c8ce7fba64194ca47926b56c3c91c69651a04d9bebbc6a57bfd6","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"1147dfde86dacbc23a9d3cb8e1b33801c2f900cf4ee78cb48d0369d968363c7c","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":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"1147dfde86dacbc23a9d3cb8e1b33801c2f900cf4ee78cb48d0369d968363c7c","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"COMPSCI 520\",\"field\":\"description\",\"quote\":\"Basics about the notion, capabilities, and limitations of computation: elements of finite automata and regular languages, computability theory, and computational complexity theory.\"}],\"text\":\"Fundamentals of computability, automata, and complexity theory\"}],\"search_phrases\":[\"computational complexity theory\",\"parallelism randomness quantum\",\"nondeterminism alternation counting\",\"theory of computation graduate\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation.\"}],\"text\":\"Analyzing capabilities and limitations of efficient computation\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity\"}],\"text\":\"Comparing computational models based on parallelism, randomness, and quantum effects\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems\"}],\"text\":\"Analyzing complexity via nondeterminism, alternation, and counting\"}],\"summary\":{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"title\",\"quote\":\"COMPUTATIONAL COMPLEXITY\"},{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"Study of the capabilities and limitations of efficient computation.\"}],\"text\":\"COMPSCI 710 is a graduate course on computational complexity, studying efficient computation limits and relationships between various computational models.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"parallelism, randomness, quantum effects, and non-uniformity\"}],\"text\":\"Parallelism, randomness, quantum effects, and non-uniformity\"},{\"evidence\":[{\"course_id\":\"COMPSCI 710\",\"field\":\"description\",\"quote\":\"nondeterminism, alternation, and counting\"}],\"text\":\"Nondeterminism, alternation, and counting\"}]}","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"1147dfde86dacbc23a9d3cb8e1b33801c2f900cf4ee78cb48d0369d968363c7c","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_5aa71f83eb9826ebff756395","course_id":"COMPSCI 710","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"1147dfde86dacbc23a9d3cb8e1b33801c2f900cf4ee78cb48d0369d968363c7c","section":"student_summary","status":"valid","value_json":"{\"context_hash\":\"779b9db46161d6b64106bcbf467cf4b197819b35b2ec579fb32eb58b58bcc6a8\",\"course_id\":\"COMPSCI 710\",\"current_instructors\":[],\"difficulty_workload\":[],\"errors\":[],\"historical_context\":[],\"message\":\"No course-specific reviews available\",\"offered\":false,\"profile_hash\":\"5cb4dabf887cdbcd8c00d5a1312e10828b95c63f30bc3ea76aea199565390d02\",\"quick_take\":[{\"citations\":[{\"course_id\":\"COMPSCI 710\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"d2e8dd66-d876-3db6-a412-4998917d9dd8\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1244\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 710\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"d2e8dd66-d876-3db6-a412-4998917d9dd8\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"COMPSCI 710\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"d2e8dd66-d876-3db6-a412-4998917d9dd8\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Spring 2024: 3.87 GPA, 96.2% A/AB (n=26 letter grades); Fall 2024: 3.14 GPA, 46.4% A/AB (n=28 letter grades); Fall 2025: 3.88 GPA, 100.0% A/AB (n=20 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}]