[{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"c4a391833d5ff1df058a63d5a0a1a22a87d63c21cc2d07832ca46944a3fd91c6","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\":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\"}","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_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"c4a391833d5ff1df058a63d5a0a1a22a87d63c21cc2d07832ca46944a3fd91c6","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Familiarity with the topics in a basic Foundations course such asMATH 770is strongly recommended.\"}],\"text\":\"Foundations of Mathematics (MATH 770)\"}],\"search_phrases\":[\"computability theory\",\"Turing degree\",\"recursion theory\",\"index sets\",\"forcing arguments\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets, easy forcing arguments in computability theory, finite and infinite injury, Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems, computable ordinals.\"}],\"text\":\"Computability theory concepts and theorems\"}],\"summary\":{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"title\",\"quote\":\"COMPUTABILITY THEORY\"},{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets, easy forcing arguments in computability theory, finite and infinite injury, Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems, computable ordinals.\"}],\"text\":\"A graduate course in computability theory covering Turing degrees, reducibilities, index sets, and major theorems like Friedberg-Muchnik and Sacks Splitting.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets\"}],\"text\":\"Turing degrees and reducibilities\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"easy forcing arguments in computability theory, finite and infinite injury\"}],\"text\":\"Forcing and injury arguments\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems\"}],\"text\":\"Sacks and Friedberg-Muchnik theorems\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"computable ordinals\"}],\"text\":\"Computable ordinals\"}]}","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_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-5291a20b802b9bbbe22b24cb","output_id":"c4a391833d5ff1df058a63d5a0a1a22a87d63c21cc2d07832ca46944a3fd91c6","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_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"08c72ec8edde6e5c0b0f3c34c176727c1ae6f5da5ff78a2c20f5034952eed586","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":true},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"08c72ec8edde6e5c0b0f3c34c176727c1ae6f5da5ff78a2c20f5034952eed586","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Familiarity with the topics in a basic Foundations course such asMATH 770is strongly recommended.\"}],\"text\":\"Foundations of Mathematics (MATH 770)\"}],\"search_phrases\":[\"computability theory\",\"Turing degree\",\"recursion theory\",\"index sets\",\"forcing arguments\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets, easy forcing arguments in computability theory, finite and infinite injury, Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems, computable ordinals.\"}],\"text\":\"Computability theory concepts and theorems\"}],\"summary\":{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"title\",\"quote\":\"COMPUTABILITY THEORY\"},{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets, easy forcing arguments in computability theory, finite and infinite injury, Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems, computable ordinals.\"}],\"text\":\"A graduate course in computability theory covering Turing degrees, reducibilities, index sets, and major theorems like Friedberg-Muchnik and Sacks Splitting.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets\"}],\"text\":\"Turing degrees and reducibilities\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"easy forcing arguments in computability theory, finite and infinite injury\"}],\"text\":\"Forcing and injury arguments\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems\"}],\"text\":\"Sacks and Friedberg-Muchnik theorems\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"computable ordinals\"}],\"text\":\"Computable ordinals\"}]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":true},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-5590a4969e0a630fe46a86e8","output_id":"08c72ec8edde6e5c0b0f3c34c176727c1ae6f5da5ff78a2c20f5034952eed586","section":"student_experience","status":"insufficient_evidence","value_json":"{\"status\":\"insufficient_evidence\",\"themes\":[]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":true},{"run_id":"20260906T231458-5fdd2fff","observed_at":"2026-09-06 23:14:58.172943+00:00","course_uid":"course_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-789789da373eecc1ff75f626","output_id":"4c66a8390ce54b96ef9c8c2da4e6528b223bf01d16acfd5d1d98d13593e7036c","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_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-789789da373eecc1ff75f626","output_id":"4c66a8390ce54b96ef9c8c2da4e6528b223bf01d16acfd5d1d98d13593e7036c","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Familiarity with the topics in a basic Foundations course such asMATH 770is strongly recommended.\"}],\"text\":\"Foundations of Mathematics (MATH 770)\"}],\"search_phrases\":[\"computability theory\",\"Turing degree\",\"recursion theory\",\"index sets\",\"forcing arguments\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets, easy forcing arguments in computability theory, finite and infinite injury, Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems, computable ordinals.\"}],\"text\":\"Computability theory concepts and theorems\"}],\"summary\":{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"title\",\"quote\":\"COMPUTABILITY THEORY\"},{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets, easy forcing arguments in computability theory, finite and infinite injury, Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems, computable ordinals.\"}],\"text\":\"A graduate course in computability theory covering Turing degrees, reducibilities, index sets, and major theorems like Friedberg-Muchnik and Sacks Splitting.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets\"}],\"text\":\"Turing degrees and reducibilities\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"easy forcing arguments in computability theory, finite and infinite injury\"}],\"text\":\"Forcing and injury arguments\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems\"}],\"text\":\"Sacks and Friedberg-Muchnik theorems\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"computable ordinals\"}],\"text\":\"Computable ordinals\"}]}","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_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-789789da373eecc1ff75f626","output_id":"4c66a8390ce54b96ef9c8c2da4e6528b223bf01d16acfd5d1d98d13593e7036c","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_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"aef63e0a96bee92066f1ca74e12d597aff0db6b5fcdb2a259f9503d55f362e2b","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":true},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"aef63e0a96bee92066f1ca74e12d597aff0db6b5fcdb2a259f9503d55f362e2b","section":"search_profile","status":"valid","value_json":"{\"assumed_background\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Familiarity with the topics in a basic Foundations course such asMATH 770is strongly recommended.\"}],\"text\":\"Foundations of Mathematics (MATH 770)\"}],\"search_phrases\":[\"computability theory\",\"Turing degree\",\"recursion theory\",\"index sets\",\"forcing arguments\"],\"skills_taught\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets, easy forcing arguments in computability theory, finite and infinite injury, Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems, computable ordinals.\"}],\"text\":\"Computability theory concepts and theorems\"}],\"summary\":{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"title\",\"quote\":\"COMPUTABILITY THEORY\"},{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets, easy forcing arguments in computability theory, finite and infinite injury, Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems, computable ordinals.\"}],\"text\":\"A graduate course in computability theory covering Turing degrees, reducibilities, index sets, and major theorems like Friedberg-Muchnik and Sacks Splitting.\"},\"topics\":[{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets\"}],\"text\":\"Turing degrees and reducibilities\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"easy forcing arguments in computability theory, finite and infinite injury\"}],\"text\":\"Forcing and injury arguments\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems\"}],\"text\":\"Sacks and Friedberg-Muchnik theorems\"},{\"evidence\":[{\"course_id\":\"MATH 773\",\"field\":\"description\",\"quote\":\"computable ordinals\"}],\"text\":\"Computable ordinals\"}]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":true},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"aef63e0a96bee92066f1ca74e12d597aff0db6b5fcdb2a259f9503d55f362e2b","section":"student_experience","status":"insufficient_evidence","value_json":"{\"status\":\"insufficient_evidence\",\"themes\":[]}","candidate_json":null,"error":null,"model":"nvidia/Qwen3.6-35B-A3B-NVFP4","model_revision":"1355db6a052410cfd62085d94b58866fd0f2c3c5","selected_for_release":true},{"run_id":"20260907T155543-ce3781c4","observed_at":"2026-09-07 15:55:43.033547+00:00","course_uid":"course_89be3dddc9b1e93ca75157d0","course_id":"MATH 773","catalog_version_id":"04c1c0830ec1e8e14c41e878bd7dc56e33f077b379be4fe5777c7c2778141280","record_version_id":"a3f6facdabcdb63c3ede1fdc79de4511a67f75262a683a4024fef1796cfde4e6","job_id":"enrich-8b774950c2b6adfdc46d1b82","output_id":"aef63e0a96bee92066f1ca74e12d597aff0db6b5fcdb2a259f9503d55f362e2b","section":"student_summary","status":"valid","value_json":"{\"context_hash\":\"7e69ec67ca72f6b741f594b58407d2e10e17d06196f60145872d7fe2df33e160\",\"course_id\":\"MATH 773\",\"current_instructors\":[],\"difficulty_workload\":[],\"errors\":[],\"historical_context\":[],\"message\":\"No course-specific reviews available\",\"offered\":false,\"profile_hash\":\"5cb4dabf887cdbcd8c00d5a1312e10828b95c63f30bc3ea76aea199565390d02\",\"quick_take\":[{\"citations\":[{\"course_id\":\"MATH 773\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"0f91ffaf-bd22-36bb-bc85-5d7aa8ccc80b\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1244\",\"type\":\"grade\"},{\"course_id\":\"MATH 773\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"0f91ffaf-bd22-36bb-bc85-5d7aa8ccc80b\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1254\",\"type\":\"grade\"},{\"course_id\":\"MATH 773\",\"run_id\":\"20260907T155543-ce3781c4\",\"source_record\":{\"entity_id\":\"0f91ffaf-bd22-36bb-bc85-5d7aa8ccc80b\",\"file\":\"tables/observations.parquet\",\"kind\":\"grades\",\"source\":\"madgrades\"},\"table\":\"grades_latest\",\"term_id\":\"1264\",\"type\":\"grade\"}],\"text\":\"Recent recorded grades — Spring 2024: 3.10 GPA, 60.0% A/AB (n=10 letter grades); Spring 2025: 3.75 GPA, 100.0% A/AB (n=6 letter grades); Spring 2026: 3.81 GPA, 100.0% A/AB (n=13 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":true}]