question stringlengths 675 690 | answer stringclasses 1
value | task_config stringclasses 1
value | task_source stringclasses 1
value | prompt listlengths 1 1 | model_responses listlengths 0 0 | model_responses__eval_is_correct listlengths 0 0 | all_other_columns stringlengths 125 128 | original_split stringclasses 1
value | length int64 5 8 | letters stringlengths 5 8 | source stringlengths 5 5 | model_responses__best_of_n_atags listlengths 4 4 | model_responses__best_of_n_atags__finish_reason_length_flags listlengths 4 4 | model_responses__best_of_n_atags__length_partial_responses listlengths 4 4 | prompt__best_of_n_atags__metadata stringlengths 1.04k 1.06k | model_responses__best_of_n_atags__metadata stringclasses 1
value | model_responses__best_of_n_atags__eval_is_correct listlengths 4 4 | model_responses__best_of_n_atags__eval_extracted_answers listlengths 4 4 | model_responses__best_of_n_atags__eval_extraction_metadata stringlengths 354 618 | model_responses__best_of_n_atags__eval_evaluation_metadata stringlengths 331 605 | model_responses__best_of_n_atags__internal_answers__eval_is_correct listlengths 4 4 | model_responses__best_of_n_atags__internal_answers__eval_extracted_answers listlengths 4 4 | model_responses__best_of_n_atags__internal_answers__eval_extraction_metadata stringlengths 750 5.62k | model_responses__best_of_n_atags__internal_answers__eval_evaluation_metadata stringlengths 455 3.68k | model_responses__best_of_n_atags__metrics dict | eval_date stringdate 2025-11-10 00:00:00 2025-11-10 00:00:00 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Answer the following problem. Explain your reasoning step by step. When you are finished, give your answer in this format: <answer> (your answer) </answer>.
### Problem
Given a list of letters, rearrange the letters to create a valid English word. You should satisfy the following conditions:
1) Only use the lette... | letter_countdown_5o | letter_countdown | [
{
"content": "Answer the following problem. Explain your reasoning step by step. When you are finished, give your answer in this format: <answer> (your answer) </answer>.\n\n ### Problem\n\n\nGiven a list of letters, rearrange the letters to create a valid English word. You should satisfy the following conditi... | [] | [] | {"letters": "tansd", "source": "stand", "length": 5, "task_config": "letter_countdown_5o", "task_source": "letter_countdown"} | test | 5 | tansd | stand | [
"<think>\n<sample>\n### Plan\n\n#### Step 1: Understand the Input\n- **Input**: A string containing lowercase alphabetic characters.\n \n#### Step 2: Create a Dictionary or Set of Words\n- Convert each letter from the input into its corresponding ASCII value.\n- Use these values to build words using combinations o... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {"api_url": "http://10.32.37.26:9080/v1", "backend": "litellm", "chat_template_applied": true, "generation_params": {"chat_template_applied": true, "max_tokens": 16384, "n": 1, "repetition_penalty": 1.1, "temperature": 0.7, "top_k": 20, "top_p": 0.8}, "model_name": "hosted_vllm/TAUR-dev/M-AT_ours_sft-sft", "prompt": [{... | {"backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-AT_ours_sft-sft", "n_responses": 4} | [
false,
false,
false,
true
] | [
"tads",
"tands",
"ants",
"stand"
] | [{"extraction_type": "final", "total_spans_found": 4, "non_overlapping_spans": 4, "span_start": 7208, "span_end": 7214, "original_span": "tads"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 470, "span_end": 475, "original_span": "tands"}, {"extraction_type": "final", "... | [{"is_correct": false, "final_answer": "tads", "errors": "length_constraint_violated", "length": 4}, {"is_correct": false, "final_answer": "tands", "errors": "not_a_valid_word", "length": 5}, {"is_correct": false, "final_answer": "ants", "errors": "length_constraint_violated", "length": 4}, {"is_correct": true, "final_... | [
[
false,
false,
false,
false
],
[
false
],
[
false,
false,
false
],
[
true
]
] | [
[
"No solution found",
"tandsad",
"tads",
"tads"
],
[
"tands"
],
[
"(solving requires advanced techniques beyond simple letter permutations)",
"ants",
"ants"
],
[
"stand"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 2763, "span_text": "No solution found", "extraction_type": "internal", "span_start": 2763, "span_end": 2782, "original_span": "No solution found"}, {"pattern_used": "answer tag", "confidence": 1.0, "position": 5343, "span_text": "tandsad", "extraction_type... | [[{"is_correct": false, "final_answer": "Nosolutionfound", "errors": "not_a_valid_word, length_constraint_violated, cannot_be_formed_from_letters", "length": 15}, {"is_correct": false, "final_answer": "tandsad", "errors": "not_a_valid_word, length_constraint_violated, cannot_be_formed_from_letters", "length": 7}, {"is_... | {
"flips_by": [
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 1,
"pass_at_n": 1,
"percent_correct": 0.25,
"skill_count": {
"answer_revision": [
0,
0,
0,
0
],
"best_of_n": [
1,
0,
0,
0
],
"reflect_close": [
3,
... | 2025-11-10 | |
Answer the following problem. Explain your reasoning step by step. When you are finished, give your answer in this format: <answer> (your answer) </answer>.
### Problem
Given a list of letters, rearrange the letters to create a valid English word. You should satisfy the following conditions:
1) Only use the lette... | letter_countdown_5o | letter_countdown | [
{
"content": "Answer the following problem. Explain your reasoning step by step. When you are finished, give your answer in this format: <answer> (your answer) </answer>.\n\n ### Problem\n\n\nGiven a list of letters, rearrange the letters to create a valid English word. You should satisfy the following conditi... | [] | [] | {"letters": "ftusf", "source": "stuff", "length": 5, "task_config": "letter_countdown_5o", "task_source": "letter_countdown"} | test | 5 | ftusf | stuff | [
"<think>\n<sample>\nRewritten Question:\nCreate a single valid English word using all the given letters.\n\nStep-by-step solution:\n1. Identify the unique letters from the input.\n - Unique letters: f, t, u, s\n\n2. Determine possible combinations that form words longer than or equal to 5 characters.\n - Possib... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {"api_url": "http://10.32.37.26:9080/v1", "backend": "litellm", "chat_template_applied": true, "generation_params": {"chat_template_applied": true, "max_tokens": 16384, "n": 1, "repetition_penalty": 1.1, "temperature": 0.7, "top_k": 20, "top_p": 0.8}, "model_name": "hosted_vllm/TAUR-dev/M-AT_ours_sft-sft", "prompt": [{... | {"backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-AT_ours_sft-sft", "n_responses": 4} | [
false,
false,
false,
false
] | [
"fssf",
"futs",
"stu",
"futures"
] | [{"extraction_type": "final", "total_spans_found": 5, "non_overlapping_spans": 5, "span_start": 9269, "span_end": 9275, "original_span": "fssf"}, {"extraction_type": "final", "total_spans_found": 7, "non_overlapping_spans": 7, "span_start": 10688, "span_end": 10694, "original_span": "futs"}, {"extraction_type": "final"... | [{"is_correct": false, "final_answer": "fssf", "errors": "not_a_valid_word, length_constraint_violated, cannot_be_formed_from_letters", "length": 4}, {"is_correct": false, "final_answer": "futs", "errors": "not_a_valid_word, length_constraint_violated", "length": 4}, {"is_correct": false, "final_answer": "stu", "errors... | [
[
false,
false,
false,
false,
false
],
[
false,
false,
false,
false,
false,
false,
false
],
[
false,
false,
false,
false,
false,
false
],
[
false,
false,
false,
false,
false,
false,
false
]
] | [
[
"futust",
"futsu",
"fffffffffff",
"fssf",
"fssf"
],
[
"strup",
"fsufst",
"fusifut",
"fusuf",
"fusuf",
"futs",
"futs"
],
[
"fuss",
"No valid word found.",
"frustrated",
"suftes",
"stu",
"stu"
],
[
"No valid word",
"fun",
... | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 492, "span_text": "futust", "extraction_type": "internal", "span_start": 492, "span_end": 498, "original_span": "futust"}, {"pattern_used": "answer tag", "confidence": 1.0, "position": 3110, "span_text": "futsu", "extraction_type": "internal", "span_start"... | [[{"is_correct": false, "final_answer": "futust", "errors": "not_a_valid_word, length_constraint_violated, cannot_be_formed_from_letters", "length": 6}, {"is_correct": false, "final_answer": "futsu", "errors": "not_a_valid_word, cannot_be_formed_from_letters", "length": 5}, {"is_correct": false, "final_answer": "ffffff... | {
"flips_by": [
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 0,
"pass_at_n": 0,
"percent_correct": 0,
"skill_count": {
"answer_revision": [
0,
0,
0,
0
],
"best_of_n": [
1,
1,
1,
1
],
"reflect_close": [
4,
5,
... | 2025-11-10 | |
Answer the following problem. Explain your reasoning step by step. When you are finished, give your answer in this format: <answer> (your answer) </answer>.
### Problem
Given a list of letters, rearrange the letters to create a valid English word. You should satisfy the following conditions:
1) Only use the lette... | letter_countdown_5o | letter_countdown | [
{
"content": "Answer the following problem. Explain your reasoning step by step. When you are finished, give your answer in this format: <answer> (your answer) </answer>.\n\n ### Problem\n\n\nGiven a list of letters, rearrange the letters to create a valid English word. You should satisfy the following conditi... | [] | [] | {"letters": "daidv", "source": "david", "length": 5, "task_config": "letter_countdown_5o", "task_source": "letter_countdown"} | test | 5 | daidv | david | [
"<think>\n<sample>\nTo solve this problem, we need to find the longest possible word that can be formed using only the given letters and satisfies all the provided conditions.\n\n### Step-by-Step Reasoning\n\n1. **Identify Available Letters**: We have the letters `['d', 'a', 'i', 'd', 'v']`.\n \n2. **Check Length... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {"api_url": "http://10.32.37.26:9080/v1", "backend": "litellm", "chat_template_applied": true, "generation_params": {"chat_template_applied": true, "max_tokens": 16384, "n": 1, "repetition_penalty": 1.1, "temperature": 0.7, "top_k": 20, "top_p": 0.8}, "model_name": "hosted_vllm/TAUR-dev/M-AT_ours_sft-sft", "prompt": [{... | {"backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-AT_ours_sft-sft", "n_responses": 4} | [
false,
false,
false,
false
] | [
"viaduct",
"No valid English word can be formed.",
"avid",
"diava"
] | [{"extraction_type": "final", "total_spans_found": 2, "non_overlapping_spans": 2, "span_start": 2328, "span_end": 2337, "original_span": "viaduct"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1979, "span_end": 2015, "original_span": "No valid English word can be forme... | [{"is_correct": false, "final_answer": "viaduct", "errors": "length_constraint_violated, cannot_be_formed_from_letters", "length": 7}, {"is_correct": false, "final_answer": "NovalidEnglishwordcanbeformed", "errors": "not_a_valid_word, length_constraint_violated, cannot_be_formed_from_letters", "length": 29}, {"is_corre... | [
[
false,
false
],
[
false
],
[
false,
false,
false,
false
],
[
false,
true,
false,
false,
false,
false
]
] | [
[
"viaduct",
"viaduct"
],
[
"No valid English word can be formed."
],
[
"divided",
"vidav",
"avid",
"avid"
],
[
"vida",
"david",
"divided",
"\"viewed\"",
"diava",
"diava"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 1634, "span_text": "viaduct", "extraction_type": "internal", "span_start": 1634, "span_end": 1643, "original_span": "viaduct"}, {"pattern_used": "answer tag", "confidence": 1.0, "position": 2328, "span_text": "viaduct", "extraction_type": "internal", "span... | [[{"is_correct": false, "final_answer": "viaduct", "errors": "length_constraint_violated, cannot_be_formed_from_letters", "length": 7}, {"is_correct": false, "final_answer": "viaduct", "errors": "length_constraint_violated, cannot_be_formed_from_letters", "length": 7}], [{"is_correct": false, "final_answer": "NovalidEn... | {
"flips_by": [
0,
0,
0,
1
],
"flips_total": 1,
"num_correct": 0,
"pass_at_n": 0,
"percent_correct": 0,
"skill_count": {
"answer_revision": [
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0
],
"reflect_close": [
1,
1,
... | 2025-11-10 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_5o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"viedr\", \"source\": \"drive\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED) | test | 5 | viedr | drive | ["<think>\n<sample>\nTo solve this problem, we need to follow these steps:\n\n### Step 1: Identify P(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.26:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-AT_ours_sft-sft\", \"n_response(...TRUNCATED) | [
false,
false,
false,
false
] | [
"derive",
"ride",
"verder",
"verdict"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 7, \"non_overlapping_spans\": 7, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"derive\", \"errors\": \"length_constraint_violated, ca(...TRUNCATED) | [[false,false,false,false,false,false,false],[false,false,false,false],[false,false,false,false],[fa(...TRUNCATED) | [["vide","ride","No valid English word meets all the criteria.","fivedriver","fivedriver","derive","(...TRUNCATED) | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1038, \"span_text\": \"vide(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"vide\", \"errors\": \"length_constraint_violated\", \(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"skill_cou(...TRUNCATED) | 2025-11-10 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_5o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"enreg\", \"source\": \"green\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED) | test | 5 | enreg | green | ["<think>\n<sample>\nTo solve this problem, we need to follow these steps:\n\n### Step 1: Identify A(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.26:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-AT_ours_sft-sft\", \"n_response(...TRUNCATED) | [
false,
false,
false,
false
] | [
"enger",
"gereng",
"regenerated",
"range"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 7, \"non_overlapping_spans\": 7, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"enger\", \"errors\": \"not_a_valid_word\", \"length\":(...TRUNCATED) | [[false,false,false,false,false,false,false],[false,false,false,false,false,false],[false,false,fals(...TRUNCATED) | [["energe","enginer","eneger","engineer","engineer","enger","enger"],["engines","ergene","(greenie)"(...TRUNCATED) | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 942, \"span_text\": \"energ(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"energe\", \"errors\": \"not_a_valid_word, length_cons(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"skill_cou(...TRUNCATED) | 2025-11-10 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_5o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"chtma\", \"source\": \"match\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED) | test | 5 | chtma | match | ["<think>\n<sample>\n### Step-by-Step Reasoning\n\n1. **Identify Unique Letters**: First, we need to(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.26:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-AT_ours_sft-sft\", \"n_response(...TRUNCATED) | [
false,
false,
false,
false
] | [
"chat",
"chamt",
"chama",
"chromat"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 2, \"non_overlapping_spans\": 2, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"chat\", \"errors\": \"length_constraint_violated\", \"(...TRUNCATED) | [
[
false,
false
],
[
false,
false,
false,
false
],
[
false,
false
],
[
false,
false,
false,
false,
false,
false
]
] | [["chat","chat"],["cham","mac","chamt","chamt"],["chama","chama"],["chat","talk","cmthta","character(...TRUNCATED) | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1654, \"span_text\": \"chat(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"chat\", \"errors\": \"length_constraint_violated\", \(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"skill_cou(...TRUNCATED) | 2025-11-10 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_5o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"demlo\", \"source\": \"model\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED) | test | 5 | demlo | model | ["<think>\n<sample>\nRewritten Question: Given a set of letters, find the longest possible English w(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.26:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-AT_ours_sft-sft\", \"n_response(...TRUNCATED) | [
false,
false,
false,
false
] | [
"demollered",
"demoled",
"demol",
"delmo"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 5, \"non_overlapping_spans\": 5, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"demollered\", \"errors\": \"not_a_valid_word, length_c(...TRUNCATED) | [
[
false,
false,
false,
false,
false
],
[
false,
false
],
[
false
],
[
false,
false,
false
]
] | [["deleml","demol","oldemled","demollered","demollered"],["demoled","demoled"],["demol"],["demolish"(...TRUNCATED) | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 648, \"span_text\": \"delem(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"deleml\", \"errors\": \"not_a_valid_word, length_cons(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"skill_cou(...TRUNCATED) | 2025-11-10 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_5o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"rttsu\", \"source\": \"trust\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED) | test | 5 | rttsu | trust | ["<think>\n<sample>\nRewritten Question: Given a string containing duplicate letters, find the lexic(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.26:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-AT_ours_sft-sft\", \"n_response(...TRUNCATED) | [
false,
false,
false,
false
] | [
"rusty",
"rusty",
"turts",
"turts"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 3, \"non_overlapping_spans\": 3, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"rusty\", \"errors\": \"cannot_be_formed_from_letters\"(...TRUNCATED) | [
[
false,
false,
false
],
[
false,
false,
false
],
[
false,
false,
false
],
[
false,
false,
false,
false,
false
]
] | [["trtst","rusty","rusty"],["rt","rusty","rusty"],["No valid word found","turts","turts"],["rest","s(...TRUNCATED) | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 600, \"span_text\": \"trtst(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"trtst\", \"errors\": \"not_a_valid_word, cannot_be_fo(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"skill_cou(...TRUNCATED) | 2025-11-10 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_5o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"nraeg\", \"source\": \"range\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED) | test | 5 | nraeg | range | ["<think>\n<sample>\nTo solve this problem, we need to find a valid English word using only the give(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.26:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-AT_ours_sft-sft\", \"n_response(...TRUNCATED) | [
false,
false,
true,
false
] | [
"gran",
"regan",
"anger",
"grain"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 6, \"non_overlapping_spans\": 6, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"gran\", \"errors\": \"not_a_valid_word, length_constra(...TRUNCATED) | [[false,false,false,false,false,false],[false,false,false,false,false,false],[true,false,true,false,(...TRUNCATED) | [["gene","Reagan","fregnant","generator","gran","gran"],["granite","ranger","rane","2","regan","rega(...TRUNCATED) | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1319, \"span_text\": \"gene(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"gene\", \"errors\": \"length_constraint_violated, can(...TRUNCATED) | {"flips_by":[0,0,2,0],"flips_total":2,"num_correct":1,"pass_at_n":1,"percent_correct":0.25,"skill_co(...TRUNCATED) | 2025-11-10 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_5o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"reatd\", \"source\": \"trade\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED) | test | 5 | reatd | trade | ["<think>\n<sample>\nTo solve this problem, we need to follow these steps:\n\n### Step 1: Identify A(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.26:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-AT_ours_sft-sft\", \"n_response(...TRUNCATED) | [
false,
false,
false,
true
] | [
"radar",
"redder",
"radar",
"rated"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 4, \"non_overlapping_spans\": 4, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"radar\", \"errors\": \"cannot_be_formed_from_letters\"(...TRUNCATED) | [[false,false,false,false],[false,false,false],[false,false,false,false],[false,false,false,true,tru(...TRUNCATED) | [["read","target","radar","radar"],["reat","redder","redder"],["read","erare","radar","radar"],["rea(...TRUNCATED) | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1746, \"span_text\": \"read(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"read\", \"errors\": \"length_constraint_violated\", \(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.25,"skill_co(...TRUNCATED) | 2025-11-10 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 3