[{"run_id":"20261014T203208-0851c9a1","observed_at":"2026-10-14 17:50:09.728220+00:00","course_uid":"course_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"88e0e0ffb41328f345f9311d56a4bbc12023efca90d1947b619584bcf00fbe2a","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"b7f51aa6e7e2af10fa51669dea2704c3f44df08007871c448bd1465c268739d7","section":"requirements","status":"needs_review","value_json":"{\"nodes\":[{\"children\":[\"req1\",\"req2\"],\"condition\":null,\"course\":null,\"evidence\":\"Graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"root\",\"kind\":\"any\"},{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"req1\",\"kind\":\"condition\"},{\"children\":[],\"condition\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"course\":null,\"evidence\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"req2\",\"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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"88e0e0ffb41328f345f9311d56a4bbc12023efca90d1947b619584bcf00fbe2a","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"b7f51aa6e7e2af10fa51669dea2704c3f44df08007871c448bd1465c268739d7","section":"search_profile","status":"valid","value_json":"{\"activity_tags\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems, Lowenheim-Skolem Theorem\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"label\":\"mathematical-reasoning\"}],\"assumed_background\":[],\"search_phrases\":[\"first-order logic syntax semantics\",\"completeness compactness theorems\",\"lowenheim-skolem theorem\",\"computable computably enumerable sets\",\"incompleteness theorem\",\"zermelo-fraenkel set theory choice\",\"ordinal cardinal arithmetic\",\"foundations of mathematics graduate course\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Understanding first-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems, Lowenheim-Skolem Theorem\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Applying completeness, compactness, and Lowenheim-Skolem theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Analyzing computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Proving and understanding the Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Working with axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Performing ordinal and cardinal arithmetic\"}],\"summary\":{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"title\",\"quote\":\"FOUNDATIONS OF MATHEMATICS\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"},{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics, Completeness and Compactness Theorems, Lowenheim-Skolem Theorem, computable and computably enumerable sets, Incompleteness Theorem, axioms of Zermelo-Fraenkel set theory with choice, ordinal and cardinal arithmetic.\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Graduate course in foundations of mathematics covering first-order logic, incompleteness theorems, computability, and set theory including ZFC and ordinal/cardinal arithmetic.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"First-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems, Lowenheim-Skolem Theorem\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Completeness, Compactness, and Lowenheim-Skolem Theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Ordinal and cardinal arithmetic\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"88e0e0ffb41328f345f9311d56a4bbc12023efca90d1947b619584bcf00fbe2a","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"b7f51aa6e7e2af10fa51669dea2704c3f44df08007871c448bd1465c268739d7","section":"student_experience","status":"valid","value_json":"{\"status\":\"supported\",\"themes\":[{\"aspect\":\"teaching_clarity\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"positive\",\"subject_instructor_id\":\"rmp:1503053\",\"summary\":\"Cited reviews praise Uri Andrews for great lectures.\"},{\"aspect\":\"organization\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"negative\",\"subject_instructor_id\":\"rmp:1503053\",\"summary\":\"One reviewer states that the organization of the course under Uri Andrews was quite chaotic.\"},{\"aspect\":\"overall\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"mixed\",\"subject_instructor_id\":\"rmp:1503053\",\"summary\":\"A reviewer recommends Uri Andrews for graduate level courses but not for content seen for the first time.\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"88e0e0ffb41328f345f9311d56a4bbc12023efca90d1947b619584bcf00fbe2a","job_id":"enrich-49752a259f17fab0f49665b3","output_id":"b7f51aa6e7e2af10fa51669dea2704c3f44df08007871c448bd1465c268739d7","section":"student_summary","status":"valid","value_json":"{\"context_hash\":\"c5516788ffc464b07cb01906bac16053e6869c331e1f5b628151e8ce099438a6\",\"course_id\":\"MATH 770\",\"current_instructors\":[],\"difficulty_workload\":[{\"citations\":[{\"instructor_name\":\"Uri Andrews\",\"review_date\":\"2025-12-28 19:55:20 +0000 UTC\",\"review_id\":\"7368fbb02a544d8818bbead9\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_instructor_id\":\"rmp:1503053\",\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\",\"type\":\"review\"}],\"evidence_scope\":\"past_student_reviews\",\"text\":\"The review did not provide specific details about homework volume, exam frequency, or study time requirements.\"}],\"errors\":[],\"historical_context\":[],\"message\":null,\"offered\":false,\"profile_hash\":\"3f5110430805ccdd533c0c072df62d68a8a5f5441c4530bbdb15d419a199a09c\",\"quick_take\":[{\"citations\":[{\"instructor_name\":\"Uri Andrews\",\"review_date\":\"2025-12-28 19:55:20 +0000 UTC\",\"review_id\":\"7368fbb02a544d8818bbead9\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_instructor_id\":\"rmp:1503053\",\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\",\"type\":\"review\"}],\"evidence_scope\":\"past_student_reviews\",\"text\":\"Students found the lectures great but described the course organization as chaotic. The instructor was recommended for graduate-level study rather than first-time exposure to the material.\"},{\"citations\":[{\"course_id\":\"MATH 770\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Fall 2023: 4.00 GPA, 100.0% A/AB (n=19 letter grades); Fall 2024: 4.00 GPA, 100.0% A/AB (n=22 letter grades); Fall 2025: 4.00 GPA, 100.0% A/AB (n=23 letter grades).\"}],\"student_experience\":[{\"citations\":[{\"instructor_name\":\"Uri Andrews\",\"review_date\":\"2025-12-28 19:55:20 +0000 UTC\",\"review_id\":\"7368fbb02a544d8818bbead9\",\"run_id\":\"20261014T203208-0851c9a1\",\"source_instructor_id\":\"rmp:1503053\",\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\",\"type\":\"review\"}],\"evidence_scope\":\"past_student_reviews\",\"text\":\"A student found the course structure disorganized, noting that the chaotic presentation made it less suitable for students encountering the content for the first time.\"}],\"task_hash\":\"9dea82ef7f2113a5605c1c6030c4f9b19967eb742cc93a78268fb92357d29f5c\",\"teaching_history\":[{\"citations\":[{\"course_id\":\"MATH 770\",\"run_id\":\"20261014T203208-0851c9a1\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1122\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20261014T203208-0851c9a1\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1152\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20261014T203208-0851c9a1\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1192\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20261014T203208-0851c9a1\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1232\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20261014T203208-0851c9a1\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20261014T203208-0851c9a1\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20261014T203208-0851c9a1\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"URI ANDREWS is recorded teaching in Fall 2011, Fall 2014, Fall 2018, Fall 2022, Fall 2023, Fall 2024, Fall 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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"ffa02bb0cc5e11712e415bd8127369a9a1d915af1d691c437f32013d33d61aa0","section":"requirements","status":"invalid","value_json":null,"candidate_json":"{\"nodes\":[{\"children\":[\"n1\",\"n2\"],\"condition\":null,\"course\":null,\"evidence\":\"Graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"n0\",\"kind\":\"any\"},{\"children\":[],\"condition\":null,\"course\":{\"course_number\":0,\"minimum_grade\":null,\"subjects\":[\"STANDING\"],\"timing\":\"prior\"},\"evidence\":\"Graduate/professional standing\",\"id\":\"n1\",\"kind\":\"condition\"},{\"children\":[],\"condition\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"course\":null,\"evidence\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"n2\",\"kind\":\"condition\"}],\"notes\":[],\"root\":\"n0\",\"status\":\"parsed\"}","error":"Only course nodes may carry course references","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"ffa02bb0cc5e11712e415bd8127369a9a1d915af1d691c437f32013d33d61aa0","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[],\"search_phrases\":[\"first-order logic graduate course\",\"completeness compactness theorems math\",\"Zermelo-Fraenkel set theory graduate\",\"incompleteness theorem foundations\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\"}],\"text\":\"Understanding first-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems\"}],\"text\":\"Proving completeness and compactness theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Lowenheim-Skolem Theorem\"}],\"text\":\"Applying the Lowenheim-Skolem Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\"}],\"text\":\"Analyzing computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\"}],\"text\":\"Understanding the Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\"}],\"text\":\"Studying axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\"}],\"text\":\"Performing ordinal and cardinal arithmetic\"}],\"summary\":{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"title\",\"quote\":\"FOUNDATIONS OF MATHEMATICS\"},{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics, Completeness and Compactness Theorems, Lowenheim-Skolem Theorem, computable and computably enumerable sets, Incompleteness Theorem, axioms of Zermelo-Fraenkel set theory with choice, ordinal and cardinal arithmetic.\"}],\"text\":\"A graduate course covering first-order logic, model theory theorems, computability, and set theory foundations.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\"}],\"text\":\"First-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems\"}],\"text\":\"Completeness and Compactness Theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Lowenheim-Skolem Theorem\"}],\"text\":\"Lowenheim-Skolem Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\"}],\"text\":\"Computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\"}],\"text\":\"Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\"}],\"text\":\"Axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\"}],\"text\":\"Ordinal and cardinal arithmetic\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"ffa02bb0cc5e11712e415bd8127369a9a1d915af1d691c437f32013d33d61aa0","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"975cfd38a2eb9d66bfb8c68f1f25347e79346d6e6f911657158556101c30cf34","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[\"n1\",\"n2\"],\"condition\":null,\"course\":null,\"evidence\":\"Graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"n0\",\"kind\":\"any\"},{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n1\",\"kind\":\"condition\"},{\"children\":[],\"condition\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"course\":null,\"evidence\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"n2\",\"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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"975cfd38a2eb9d66bfb8c68f1f25347e79346d6e6f911657158556101c30cf34","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[],\"search_phrases\":[\"first-order logic graduate course\",\"completeness compactness theorems math\",\"Zermelo-Fraenkel set theory graduate\",\"incompleteness theorem foundations\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\"}],\"text\":\"Understanding first-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems\"}],\"text\":\"Proving completeness and compactness theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Lowenheim-Skolem Theorem\"}],\"text\":\"Applying the Lowenheim-Skolem Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\"}],\"text\":\"Analyzing computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\"}],\"text\":\"Understanding the Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\"}],\"text\":\"Studying axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\"}],\"text\":\"Performing ordinal and cardinal arithmetic\"}],\"summary\":{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"title\",\"quote\":\"FOUNDATIONS OF MATHEMATICS\"},{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics, Completeness and Compactness Theorems, Lowenheim-Skolem Theorem, computable and computably enumerable sets, Incompleteness Theorem, axioms of Zermelo-Fraenkel set theory with choice, ordinal and cardinal arithmetic.\"}],\"text\":\"A graduate course covering first-order logic, model theory theorems, computability, and set theory foundations.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\"}],\"text\":\"First-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems\"}],\"text\":\"Completeness and Compactness Theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Lowenheim-Skolem Theorem\"}],\"text\":\"Lowenheim-Skolem Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\"}],\"text\":\"Computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\"}],\"text\":\"Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\"}],\"text\":\"Axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\"}],\"text\":\"Ordinal and cardinal arithmetic\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"975cfd38a2eb9d66bfb8c68f1f25347e79346d6e6f911657158556101c30cf34","section":"student_experience","status":"valid","value_json":"{\"status\":\"supported\",\"themes\":[{\"aspect\":\"organization\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"negative\",\"summary\":\"The course organization was described as chaotic.\"},{\"aspect\":\"teaching_clarity\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"positive\",\"summary\":\"The lectures were considered great.\"},{\"aspect\":\"overall\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"mixed\",\"summary\":\"Recommended for graduate level but not for first-time content.\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"88e0e0ffb41328f345f9311d56a4bbc12023efca90d1947b619584bcf00fbe2a","job_id":"enrich-6556a505c10f448d98d02466","output_id":"70ca3360982d3ef96adeb6657ceb52bfd0bc9e4be7b51f3464144ede75a7b35d","section":"requirements","status":"needs_review","value_json":"{\"nodes\":[{\"children\":[\"req1\",\"req2\"],\"condition\":null,\"course\":null,\"evidence\":\"Graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"root\",\"kind\":\"any\"},{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"req1\",\"kind\":\"condition\"},{\"children\":[],\"condition\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"course\":null,\"evidence\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"req2\",\"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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"88e0e0ffb41328f345f9311d56a4bbc12023efca90d1947b619584bcf00fbe2a","job_id":"enrich-6556a505c10f448d98d02466","output_id":"70ca3360982d3ef96adeb6657ceb52bfd0bc9e4be7b51f3464144ede75a7b35d","section":"search_profile","status":"valid","value_json":"{\"activity_tags\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems, Lowenheim-Skolem Theorem\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"label\":\"mathematical-reasoning\"}],\"assumed_background\":[],\"search_phrases\":[\"first-order logic syntax semantics\",\"completeness compactness theorems\",\"lowenheim-skolem theorem\",\"computable computably enumerable sets\",\"incompleteness theorem\",\"zermelo-fraenkel set theory choice\",\"ordinal cardinal arithmetic\",\"foundations of mathematics graduate course\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Understanding first-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems, Lowenheim-Skolem Theorem\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Applying completeness, compactness, and Lowenheim-Skolem theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Analyzing computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Proving and understanding the Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Working with axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Performing ordinal and cardinal arithmetic\"}],\"summary\":{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"title\",\"quote\":\"FOUNDATIONS OF MATHEMATICS\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"},{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics, Completeness and Compactness Theorems, Lowenheim-Skolem Theorem, computable and computably enumerable sets, Incompleteness Theorem, axioms of Zermelo-Fraenkel set theory with choice, ordinal and cardinal arithmetic.\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Graduate course in foundations of mathematics covering first-order logic, incompleteness theorems, computability, and set theory including ZFC and ordinal/cardinal arithmetic.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"First-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems, Lowenheim-Skolem Theorem\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Completeness, Compactness, and Lowenheim-Skolem Theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\",\"source_url\":\"https://guide.wisc.edu/courses/math/\"}],\"text\":\"Ordinal and cardinal arithmetic\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"88e0e0ffb41328f345f9311d56a4bbc12023efca90d1947b619584bcf00fbe2a","job_id":"enrich-6556a505c10f448d98d02466","output_id":"70ca3360982d3ef96adeb6657ceb52bfd0bc9e4be7b51f3464144ede75a7b35d","section":"student_experience","status":"valid","value_json":"{\"status\":\"supported\",\"themes\":[{\"aspect\":\"teaching_clarity\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"positive\",\"subject_instructor_id\":\"rmp:1503053\",\"summary\":\"Cited reviews praise Uri Andrews for great lectures.\"},{\"aspect\":\"organization\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"negative\",\"subject_instructor_id\":\"rmp:1503053\",\"summary\":\"One reviewer states that the organization of the course under Uri Andrews was quite chaotic.\"},{\"aspect\":\"overall\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"mixed\",\"subject_instructor_id\":\"rmp:1503053\",\"summary\":\"A reviewer recommends Uri Andrews for graduate level courses but not for content seen for the first time.\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-789789da373eecc1ff75f626","output_id":"f257cb1e0cd18ecf89c88cfc129815f875023bd19a50a5e00a5ae426e81f02bb","section":"requirements","status":"needs_review","value_json":"{\"nodes\":[{\"children\":[\"n1\",\"n2\"],\"condition\":null,\"course\":null,\"evidence\":\"Graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"n0\",\"kind\":\"any\"},{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n1\",\"kind\":\"condition\"},{\"children\":[],\"condition\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"course\":null,\"evidence\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"n2\",\"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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-789789da373eecc1ff75f626","output_id":"f257cb1e0cd18ecf89c88cfc129815f875023bd19a50a5e00a5ae426e81f02bb","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[],\"search_phrases\":[\"first-order logic graduate course\",\"completeness compactness theorems math\",\"Zermelo-Fraenkel set theory graduate\",\"incompleteness theorem foundations\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\"}],\"text\":\"Understanding first-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems\"}],\"text\":\"Proving completeness and compactness theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Lowenheim-Skolem Theorem\"}],\"text\":\"Applying the Lowenheim-Skolem Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\"}],\"text\":\"Analyzing computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\"}],\"text\":\"Understanding the Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\"}],\"text\":\"Studying axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\"}],\"text\":\"Performing ordinal and cardinal arithmetic\"}],\"summary\":{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"title\",\"quote\":\"FOUNDATIONS OF MATHEMATICS\"},{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics, Completeness and Compactness Theorems, Lowenheim-Skolem Theorem, computable and computably enumerable sets, Incompleteness Theorem, axioms of Zermelo-Fraenkel set theory with choice, ordinal and cardinal arithmetic.\"}],\"text\":\"A graduate course covering first-order logic, model theory theorems, computability, and set theory foundations.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\"}],\"text\":\"First-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems\"}],\"text\":\"Completeness and Compactness Theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Lowenheim-Skolem Theorem\"}],\"text\":\"Lowenheim-Skolem Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\"}],\"text\":\"Computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\"}],\"text\":\"Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\"}],\"text\":\"Axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\"}],\"text\":\"Ordinal and cardinal arithmetic\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-789789da373eecc1ff75f626","output_id":"f257cb1e0cd18ecf89c88cfc129815f875023bd19a50a5e00a5ae426e81f02bb","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"beee8d7876130e468c379fb9d4751e1742abd082f49f6f8be3c6ec169d47fd1f","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[\"n1\",\"n2\"],\"condition\":null,\"course\":null,\"evidence\":\"Graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"n0\",\"kind\":\"any\"},{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n1\",\"kind\":\"condition\"},{\"children\":[],\"condition\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"course\":null,\"evidence\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"n2\",\"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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"beee8d7876130e468c379fb9d4751e1742abd082f49f6f8be3c6ec169d47fd1f","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[],\"search_phrases\":[\"first-order logic graduate course\",\"completeness compactness theorems math\",\"Zermelo-Fraenkel set theory graduate\",\"incompleteness theorem foundations\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\"}],\"text\":\"Understanding first-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems\"}],\"text\":\"Proving completeness and compactness theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Lowenheim-Skolem Theorem\"}],\"text\":\"Applying the Lowenheim-Skolem Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\"}],\"text\":\"Analyzing computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\"}],\"text\":\"Understanding the Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\"}],\"text\":\"Studying axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\"}],\"text\":\"Performing ordinal and cardinal arithmetic\"}],\"summary\":{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"title\",\"quote\":\"FOUNDATIONS OF MATHEMATICS\"},{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics, Completeness and Compactness Theorems, Lowenheim-Skolem Theorem, computable and computably enumerable sets, Incompleteness Theorem, axioms of Zermelo-Fraenkel set theory with choice, ordinal and cardinal arithmetic.\"}],\"text\":\"A graduate course covering first-order logic, model theory theorems, computability, and set theory foundations.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\"}],\"text\":\"First-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems\"}],\"text\":\"Completeness and Compactness Theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Lowenheim-Skolem Theorem\"}],\"text\":\"Lowenheim-Skolem Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\"}],\"text\":\"Computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\"}],\"text\":\"Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\"}],\"text\":\"Axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\"}],\"text\":\"Ordinal and cardinal arithmetic\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"beee8d7876130e468c379fb9d4751e1742abd082f49f6f8be3c6ec169d47fd1f","section":"student_experience","status":"valid","value_json":"{\"status\":\"supported\",\"themes\":[{\"aspect\":\"organization\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"negative\",\"summary\":\"The course organization was described as chaotic.\"},{\"aspect\":\"teaching_clarity\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"positive\",\"summary\":\"The lectures were considered great.\"},{\"aspect\":\"overall\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"mixed\",\"summary\":\"Recommended for graduate level but not for first-time content.\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"beee8d7876130e468c379fb9d4751e1742abd082f49f6f8be3c6ec169d47fd1f","section":"student_summary","status":"invalid","value_json":"{\"context_hash\":\"6cf6133af03f41cce3ab91137a5ffa9d52a88612089a7d4b6624501ebb49d911\",\"course_id\":\"MATH 770\",\"current_instructors\":[{\"instructor_uid\":\"instructor_be5c24b98e4a5132a7591fdc\",\"message\":\"Summary generation failed\",\"name\":\"Uri Andrews\",\"review_status\":\"generation_failed\",\"rmp_instructor_id\":\"rmp:1503053\",\"summary\":[{\"citations\":[{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Fall 2023: 4.00 GPA, 100.0% A/AB (n=19 letter grades); Fall 2024: 4.00 GPA, 100.0% A/AB (n=22 letter grades); Fall 2025: 4.00 GPA, 100.0% A/AB (n=23 letter grades).\"}]}],\"difficulty_workload\":[],\"errors\":[{\"error\":\"ModelAPIError: Connection error.\",\"instructor_uid\":\"instructor_be5c24b98e4a5132a7591fdc\",\"mode\":\"professor\"},{\"error\":\"ModelAPIError: Connection error.\",\"instructor_uid\":null,\"mode\":\"overview\"}],\"historical_context\":[],\"message\":null,\"offered\":true,\"profile_hash\":\"5cb4dabf887cdbcd8c00d5a1312e10828b95c63f30bc3ea76aea199565390d02\",\"quick_take\":[{\"citations\":[{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Fall 2023: 4.00 GPA, 100.0% A/AB (n=19 letter grades); Fall 2024: 4.00 GPA, 100.0% A/AB (n=22 letter grades); Fall 2025: 4.00 GPA, 100.0% A/AB (n=23 letter grades).\"}],\"student_experience\":[],\"task_hash\":\"74fb0997943e888960bbc9e47db8c4fd12e4292d55c20509d8d89db6a9910f68\",\"teaching_history\":[{\"citations\":[{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1122\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1152\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1192\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1232\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"URI ANDREWS is recorded teaching in Fall 2011, Fall 2014, Fall 2018, Fall 2022, Fall 2023, Fall 2024, Fall 2025. Recorded history may be incomplete and does not establish a future schedule.\"}],\"term_id\":\"1272\",\"term_name\":\"2026 Fall\",\"version\":2}","candidate_json":null,"error":"[{\"mode\": \"professor\", \"instructor_uid\": \"instructor_be5c24b98e4a5132a7591fdc\", \"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":false},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-f516c4d3e82cfe326b4f5f54","output_id":"e771022e13e32d10a5d20def1fe56f2e557003ef3c92c718ed7714c5a21392a1","section":"requirements","status":"valid","value_json":"{\"nodes\":[{\"children\":[\"n1\",\"n2\"],\"condition\":null,\"course\":null,\"evidence\":\"Graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"n0\",\"kind\":\"any\"},{\"children\":[],\"condition\":\"Graduate/professional standing\",\"course\":null,\"evidence\":\"Graduate/professional standing\",\"id\":\"n1\",\"kind\":\"condition\"},{\"children\":[],\"condition\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"course\":null,\"evidence\":\"member of the Pre-Masters Mathematics (Visiting International) Program\",\"id\":\"n2\",\"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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-f516c4d3e82cfe326b4f5f54","output_id":"e771022e13e32d10a5d20def1fe56f2e557003ef3c92c718ed7714c5a21392a1","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[],\"search_phrases\":[\"first-order logic graduate course\",\"completeness compactness theorems math\",\"Zermelo-Fraenkel set theory graduate\",\"incompleteness theorem foundations\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\"}],\"text\":\"Understanding first-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems\"}],\"text\":\"Proving completeness and compactness theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Lowenheim-Skolem Theorem\"}],\"text\":\"Applying the Lowenheim-Skolem Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\"}],\"text\":\"Analyzing computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\"}],\"text\":\"Understanding the Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\"}],\"text\":\"Studying axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\"}],\"text\":\"Performing ordinal and cardinal arithmetic\"}],\"summary\":{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"title\",\"quote\":\"FOUNDATIONS OF MATHEMATICS\"},{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics, Completeness and Compactness Theorems, Lowenheim-Skolem Theorem, computable and computably enumerable sets, Incompleteness Theorem, axioms of Zermelo-Fraenkel set theory with choice, ordinal and cardinal arithmetic.\"}],\"text\":\"A graduate course covering first-order logic, model theory theorems, computability, and set theory foundations.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"First-order logic syntax and semantics\"}],\"text\":\"First-order logic syntax and semantics\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Completeness and Compactness Theorems\"}],\"text\":\"Completeness and Compactness Theorems\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Lowenheim-Skolem Theorem\"}],\"text\":\"Lowenheim-Skolem Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"computable and computably enumerable sets\"}],\"text\":\"Computable and computably enumerable sets\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"Incompleteness Theorem\"}],\"text\":\"Incompleteness Theorem\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"axioms of Zermelo-Fraenkel set theory with choice\"}],\"text\":\"Axioms of Zermelo-Fraenkel set theory with choice\"},{\"evidence\":[{\"course_id\":\"MATH 770\",\"field\":\"description\",\"quote\":\"ordinal and cardinal arithmetic\"}],\"text\":\"Ordinal and cardinal arithmetic\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-f516c4d3e82cfe326b4f5f54","output_id":"e771022e13e32d10a5d20def1fe56f2e557003ef3c92c718ed7714c5a21392a1","section":"student_experience","status":"valid","value_json":"{\"status\":\"supported\",\"themes\":[{\"aspect\":\"organization\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"negative\",\"summary\":\"The course organization was described as chaotic.\"},{\"aspect\":\"teaching_clarity\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"positive\",\"summary\":\"The lectures were considered great.\"},{\"aspect\":\"overall\",\"evidence\":[{\"comment\":\"Great lectures, but the organization of the course was quite chaotic. I would recommend him for graduate level courses, but maybe not for content that you're seeing for the first time.\",\"course_id\":\"MATH 770\",\"date\":\"2025-12-28 19:55:20 +0000 UTC\",\"difficulty_rating\":1,\"id\":\"7368fbb02a544d8818bbead9\",\"instructor_id\":\"rmp:1503053\",\"instructor_name\":\"Uri Andrews\",\"quality_rating\":3,\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\"}],\"evidence_count\":1,\"review_ids\":[\"7368fbb02a544d8818bbead9\"],\"scope\":{\"historical\":true,\"instructors\":[{\"id\":\"rmp:1503053\",\"name\":\"Uri Andrews\"}],\"review_year_end\":\"2025\",\"review_year_start\":\"2025\"},\"sentiment\":\"mixed\",\"summary\":\"Recommended for graduate level but not for first-time content.\"}]}","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_bdcdafe99c9aab1eafa8371d","course_id":"MATH 770","catalog_version_id":"0fd94310e6b7edfca05311db9cd858518d0b2b1b0f3e07a8925fefb1c4012154","record_version_id":"62a2b2d474272dc3206c234b23855f84bb26d8c4aad5d3594bf063592f927e9c","job_id":"enrich-f516c4d3e82cfe326b4f5f54","output_id":"e771022e13e32d10a5d20def1fe56f2e557003ef3c92c718ed7714c5a21392a1","section":"student_summary","status":"valid","value_json":"{\"context_hash\":\"6cf6133af03f41cce3ab91137a5ffa9d52a88612089a7d4b6624501ebb49d911\",\"course_id\":\"MATH 770\",\"current_instructors\":[{\"instructor_uid\":\"instructor_be5c24b98e4a5132a7591fdc\",\"message\":null,\"name\":\"Uri Andrews\",\"review_status\":\"supported\",\"rmp_instructor_id\":\"rmp:1503053\",\"summary\":[{\"citations\":[{\"instructor_name\":\"Uri Andrews\",\"review_date\":\"2025-12-28 19:55:20 +0000 UTC\",\"review_id\":\"7368fbb02a544d8818bbead9\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:1503053\",\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\",\"type\":\"review\"}],\"text\":\"Uri Andrews delivers great lectures, though one reviewer found the course organization chaotic. They suggest he is suitable for graduate-level courses but potentially less ideal for students encountering the content for the first time.\"},{\"citations\":[{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Fall 2023: 4.00 GPA, 100.0% A/AB (n=19 letter grades); Fall 2024: 4.00 GPA, 100.0% A/AB (n=22 letter grades); Fall 2025: 4.00 GPA, 100.0% A/AB (n=23 letter grades).\"}]}],\"difficulty_workload\":[{\"citations\":[{\"instructor_name\":\"Uri Andrews\",\"review_date\":\"2025-12-28 19:55:20 +0000 UTC\",\"review_id\":\"7368fbb02a544d8818bbead9\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:1503053\",\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\",\"type\":\"review\"}],\"text\":\"The course is rated as easy, though the chaotic organization may require extra effort to navigate the material effectively.\"}],\"errors\":[],\"historical_context\":[],\"message\":null,\"offered\":true,\"profile_hash\":\"e59ddc7389015d0035b68cd195c939d475bf72b959b29cf12eab59b454ccaef1\",\"quick_take\":[{\"citations\":[{\"instructor_name\":\"Uri Andrews\",\"review_date\":\"2025-12-28 19:55:20 +0000 UTC\",\"review_id\":\"7368fbb02a544d8818bbead9\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:1503053\",\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\",\"type\":\"review\"}],\"text\":\"Uri Andrews delivers great lectures, but the course organization is chaotic, making it better for graduate students than those seeing the content for the first time.\"},{\"citations\":[{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Fall 2023: 4.00 GPA, 100.0% A/AB (n=19 letter grades); Fall 2024: 4.00 GPA, 100.0% A/AB (n=22 letter grades); Fall 2025: 4.00 GPA, 100.0% A/AB (n=23 letter grades).\"}],\"student_experience\":[{\"citations\":[{\"instructor_name\":\"Uri Andrews\",\"review_date\":\"2025-12-28 19:55:20 +0000 UTC\",\"review_id\":\"7368fbb02a544d8818bbead9\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_instructor_id\":\"rmp:1503053\",\"source_review_id\":\"UmF0aW5nLTQyNDA5NTc4\",\"source_url\":\"https://www.ratemyprofessors.com/professor/1503053\",\"type\":\"review\"}],\"text\":\"Reviewers appreciate the lecture quality but find the course structure disorganized, suggesting it is less suitable for beginners.\"}],\"task_hash\":\"74fb0997943e888960bbc9e47db8c4fd12e4292d55c20509d8d89db6a9910f68\",\"teaching_history\":[{\"citations\":[{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1122\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1152\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1192\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1232\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1242\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1252\",\"type\":\"grade\"},{\"course_id\":\"MATH 770\",\"run_id\":\"20260907T155543-ce3781c4\",\"section_number\":1,\"source_course_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"source_record\":{\"entity_id\":\"1fb5ff94-b3eb-3191-ae67-973f47e5d589\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"section_grades_latest\",\"term_id\":\"1262\",\"type\":\"grade\"}],\"text\":\"URI ANDREWS is recorded teaching in Fall 2011, Fall 2014, Fall 2018, Fall 2022, Fall 2023, Fall 2024, Fall 2025. Recorded history may be incomplete and does not establish a future schedule.\"}],\"term_id\":\"1272\",\"term_name\":\"2026 Fall\",\"version\":2}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":false}]