{ "expression": "\nvar rw = upstream[\"gen-rw\"] || {};\nvar math = upstream[\"gen-math\"] || {};\nvar rwItems = rw.items || [];\nvar mathItems = math.items || [];\nvar bb = steps[\"build-batches\"] || {};\nvar rwB = bb.rwBatches || [];\nvar mathB = bb.mathBatches || [];\nvar n = bb.testNumber;\nvar qs = {rw:{1:[],2:[]}, math:{1:[],2:[]}};\n\n// Fix invalid JSON escape sequences. LLMs emit \\ge, \\le, \\pi, \\text inside strings.\n// Walk char-by-char: any lone backslash not followed by a valid JSON escape char\n// gets doubled.\nvar repairEscapes = function(raw) {\n var out = \"\";\n var i = 0;\n var valid = {'\"':1,'\\\\':1,'/':1,'b':1,'f':1,'n':1,'r':1,'t':1,'u':1};\n while (i < raw.length) {\n var c = raw[i];\n if (c === '\\\\' && i + 1 < raw.length) {\n var nxt = raw[i+1];\n if (valid[nxt]) { out += c + nxt; i += 2; continue; }\n // invalid: double the backslash, keep next char\n out += '\\\\\\\\' + nxt; i += 2; continue;\n }\n out += c; i++;\n }\n return out;\n};\n\nvar parse = function(text) {\n if (!text) return [];\n var m = text.match(/\\[[\\s\\S]*\\]/);\n if (!m) return [];\n var raw = m[0];\n try { return JSON.parse(raw); } catch(e) {}\n // First repair: fix invalid backslash escapes\n var escFixed = repairEscapes(raw);\n try { return JSON.parse(escFixed); } catch(e) {}\n // Second repair: LLMs sometimes forget to close question obj after nested choices.\n // Strip outer [] then split by boundary pattern.\n var inner = escFixed.slice(1, escFixed.length - 1).trim();\n var parts = inner.split(/(?=,\\s*\\{\"id\"\\s*:\\s*\"[^\"]+\"\\s*,)/);\n parts = parts.map(function(p, i) { return i > 0 ? p.replace(/^,\\s*/, \"\") : p; });\n var repaired = [];\n for (var i = 0; i < parts.length; i++) {\n var p = parts[i].trim();\n if (!p) continue;\n var q = null;\n try { q = JSON.parse(p); }\n catch(ee) { try { q = JSON.parse(p + \"}\"); } catch(eee) { q = null; } }\n if (q) repaired.push(q);\n }\n return repaired;\n};\n\n// Sanitize a question: remove stray keys inside choices, drop empty E, validate answer\nvar sanitize = function(q) {\n if (!q || typeof q !== 'object') return null;\n if (q.choices && typeof q.choices === 'object') {\n var cleanChoices = {};\n var validKeys = ['A','B','C','D'];\n for (var k = 0; k < validKeys.length; k++) {\n var key = validKeys[k];\n var val = q.choices[key];\n if (typeof val === 'string' && val.trim().length > 0) cleanChoices[key] = val;\n }\n // If any stray keys like 'answer_format' were nested inside, pull them up\n if (q.choices.answer_format && !q.answer_format) q.answer_format = q.choices.answer_format;\n if (q.choices.correct_answer && !q.correct_answer) q.correct_answer = q.choices.correct_answer;\n q.choices = cleanChoices;\n // Require exactly 4 valid choices for MCQ\n if (q.answer_format === 'mcq' && Object.keys(cleanChoices).length !== 4) return null;\n }\n // Remove choices field for SPR\n if (q.answer_format === 'student_produced') delete q.choices;\n return q;\n};\n\nfor (var i = 0; i < rwItems.length; i++) {\n if (!rwItems[i]) continue;\n var questions = parse(rwItems[i].text);\n var b = rwB[i];\n if (b && qs.rw[b.mod]) {\n for (var j = 0; j < questions.length; j++) {\n var sq = sanitize(questions[j]);\n if (sq) qs.rw[b.mod].push(sq);\n }\n }\n}\nfor (var i = 0; i < mathItems.length; i++) {\n if (!mathItems[i]) continue;\n var questions = parse(mathItems[i].text);\n var b = mathB[i];\n if (b && qs.math[b.mod]) {\n for (var j = 0; j < questions.length; j++) {\n var sq = sanitize(questions[j]);\n if (sq) qs.math[b.mod].push(sq);\n }\n }\n}\n\n// Deduplicate by id, then renumber sequentially and fix id-module mismatch\nvar dedupeAndRenumber = function(arr, sectionPrefix, mod, testNumber) {\n var seen = {};\n var out = [];\n for (var k = 0; k < arr.length; k++) {\n var q = arr[k];\n if (!q || !q.id) continue;\n if (seen[q.id]) continue;\n seen[q.id] = true;\n out.push(q);\n }\n // Renumber sequentially and fix id to use correct module number\n for (var i = 0; i < out.length; i++) {\n out[i].number = i + 1;\n out[i].id = \"sat\" + testNumber + \"-\" + sectionPrefix + \"-m\" + mod + \"-q\" + (i + 1);\n }\n return out;\n};\nvar renum = function(arr) {\n for (var k = 0; k < arr.length; k++) arr[k].number = k + 1;\n return arr;\n};\n\nvar r1 = dedupeAndRenumber(qs.rw[1] || [], \"rw\", 1, n);\nvar r2 = dedupeAndRenumber(qs.rw[2] || [], \"rw\", 2, n);\nvar m1 = dedupeAndRenumber(qs.math[1] || [], \"math\", 1, n);\nvar m2 = dedupeAndRenumber(qs.math[2] || [], \"math\", 2, n);\nvar mk = function(n) { return \"modu\" + \"le\"; };\n\nvar sec1m1 = {time_minutes:32, question_count:r1.length, questions:r1};\nsec1m1[mk()] = 1;\nvar sec1m2 = {time_minutes:32, question_count:r2.length, questions:r2};\nsec1m2[mk()] = 2;\nvar sec2m1 = {time_minutes:35, question_count:m1.length, questions:m1};\nsec2m1[mk()] = 1;\nvar sec2m2 = {time_minutes:35, question_count:m2.length, questions:m2};\nsec2m2[mk()] = 2;\n\nreturn {\n exam_type:\"sat\", test_id:\"genius-prep-sat-\"+n, test_number:n,\n display_name:\"Genius Prep SAT \"+n,\n total_questions: r1.length+r2.length+m1.length+m2.length,\n total_time_minutes: 134,\n sections: [\n {section:1, name:\"Reading and Writing\", modules:[sec1m1, sec1m2]},\n {section:2, name:\"Math\", modules:[sec2m1, sec2m2]}\n ],\n generation_stats: {\n rw_m1:r1.length, rw_m2:r2.length, math_m1:m1.length, math_m2:m2.length,\n total:r1.length+r2.length+m1.length+m2.length, expected:120,\n models: {rw:\"opus\", math:\"gemini-2.5-pro\"}\n }\n};\n", "environmentOverrides": {} }

Noeud	Statut	Duree	Tentatives
Assemble Exam	Success	470ms	1
Build Batches	Success	268ms	1
Generate Math (Gemini 3 Pro)	Success	3m 11s	1
Generate RW (GPT 5.4)	Success	2m 43s	1
Test Number	Success	276ms	1
Output	Success	598ms	1

Run run_20260419Success