letters stringlengths 4 4 | answer stringlengths 2 4 | all_best listlengths 1 8 | length int64 2 4 | letters_length int64 4 4 | prompt listlengths 2 2 | task_source stringclasses 1
value | model_responses__example_annotation listlengths 8 8 | model_responses__example_annotation__finish_reason_length_flags listlengths 8 8 | model_responses__example_annotation__length_partial_responses listlengths 8 8 | prompt__example_annotation__metadata dict | model_responses__example_annotation__metadata dict | model_responses__example_annotation__eval_is_correct listlengths 8 8 | model_responses__example_annotation__eval_extracted_answers listlengths 8 8 | model_responses__example_annotation__eval_extraction_metadata listlengths 8 8 | model_responses__example_annotation__eval_evaluation_metadata listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_is_correct listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_extracted_answers listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_extraction_metadata listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_evaluation_metadata listlengths 8 8 | model_responses__example_annotation__metrics dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
eanw | anew | [
"anew",
"wane",
"wean"
] | 4 | 4 | [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. E... | letter_countdown | [
"<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed using the given letters 'e', 'a', 'n', and 'w'. Let's break down the process:\n\n1. **Identify Possible Words**: We will try different combinations of these letters to see which form valid words.\n \n - Start with sho... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:47103",
"backend": "litellm",
"chat_template_applied": true,
"generation_params": {
"chat_template_applied": true,
"max_tokens": 4096,
"n": 3,
"repetition_penalty": 1.1,
"temperature": 0.7,
"top_k": 20,
"top_p": 0.8
},
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"prompt": [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"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\nGiven a list of letters, create the longest possible valid word using only the given letters.\n\nFor examples: if the input letters are: ['f','t','s','r','e','a']; the word is: <answer> faster </answer>\n\nSolve for the following:\nINPUT: ['e', 'a', 'n', 'w']\n\nOnly use the letters in the input to create a word. Do not use additional letters.\n\n\nLet's think step by step.",
"role": "user"
}
]
} | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"enough",
"enaw",
"enwa",
"No valid word found",
"eat",
"warn",
null,
"enew"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "enough",
"span_end": 1492,
"span_start": 1484,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "enaw",
"span_end": 1271,
"span_start": 1265... | [
{
"details": "{'letters': 'eanw', 'length': 6}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "enough",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': ... | [
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false
],
[
false,
false
],
[
false
],
[],
[
false,
false
]
] | [
[
"enough",
"enough"
],
[
"enaw",
"enaw"
],
[
"enwa",
"enwa"
],
[
"No valid word found"
],
[
"eat",
"eat"
],
[
"warn"
],
[],
[
"ENEW",
"enew"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "enough",
"pattern_used": "answer tag",
"position": 1150,
"span_end": 1158,
"span_start": 1150,
"span_text": "enough"
},
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'eanw', 'length': 6}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "enough",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'eanw', 'length': 6}",
"errors": [
"cannot... | {
"flips_by": [
0,
0,
0,
0,
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,
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0,
0,
0,
0,
0
],
"reflect_close": [
1,
1,
1,
1,
1,
1,
0,
1
],
"reflect_open": [
1,
1,
1,
2,
1,
1,
0,
1
],
"reflection_sbon": [
0,
0,
0,
0,
0,
0,
0,
0
],
"sample_close": [
1,
1,
1,
2,
1,
1,
0,
1
],
"sample_open": [
1,
1,
1,
2,
1,
1,
1,
1
],
"vote_close": [
0,
0,
0,
0,
0,
0,
0,
0
],
"vote_open": [
0,
0,
0,
0,
0,
0,
0,
0
],
"voting": [
0,
0,
0,
0,
0,
0,
0,
0
]
},
"total_responses": 8
} |
opmm | mom | [
"mom",
"mop",
"pom"
] | 3 | 4 | [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. E... | letter_countdown | [
"<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed using only the given letters. Let's start by listing all the letters:\n\n- o\n- p\n- m\n- m\n\nNow, let's try combining these letters to see if any meaningful words can be created:\n\n1. **Combining \"om\"**: \n - This ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:47103",
"backend": "litellm",
"chat_template_applied": true,
"generation_params": {
"chat_template_applied": true,
"max_tokens": 4096,
"n": 3,
"repetition_penalty": 1.1,
"temperature": 0.7,
"top_k": 20,
"top_p": 0.8
},
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"prompt": [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"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\nGiven a list of letters, create the longest possible valid word using only the given letters.\n\nFor examples: if the input letters are: ['f','t','s','r','e','a']; the word is: <answer> faster </answer>\n\nSolve for the following:\nINPUT: ['o', 'p', 'm', 'm']\n\nOnly use the letters in the input to create a word. Do not use additional letters.\n\n\nLet's think step by step.",
"role": "user"
}
]
} | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
false,
true,
true,
false,
false,
false,
false
] | [
"mmo",
"omp",
"mom",
"pm",
"more",
"home",
"prompt",
"ommp"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "mmo",
"span_end": 1889,
"span_start": 1884,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 3,
"original_span": "omp",
"span_end": 4934,
"span_start": 4931,
... | [
{
"details": "{'letters': 'opmm', 'length': 3}",
"errors": [
"not_a_valid_word"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "mmo",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'opmm', 'length'... | [
[
false
],
[
false,
false,
false
],
[
true,
true
],
[
true,
true
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false
]
] | [
[
"mmo"
],
[
"pop",
"omp",
"omp"
],
[
"mom",
"mom"
],
[
"pm",
"pm"
],
[
"more",
"more"
],
[
"home",
"home"
],
[
"prompt",
"prompt"
],
[
"ommp"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "mmo",
"pattern_used": "answer tag",
"position": 1884,
"span_end": 1889,
"span_start": 1884,
"span_text": "mmo"
}
],
[
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'opmm', 'length': 3}",
"errors": [
"not_a_valid_word"
],
"final_answer": "mmo",
"is_correct": false,
"target_matches": false
}
],
[
{
"details": "{'letters': 'opmm', 'length': 3}",
"errors": [
"cannot_be_form... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 2,
"pass_at_n": 1,
"percent_correct": 0.25,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0,
0,
0,
0,
0
],
"reflect_close": [
1,
2,
1,
1,
1,
1,
1,
1
],
"reflect_open": [
1,
2,
1,
1,
1,
1,
1,
1
],
"reflection_sbon": [
0,
0,
0,
0,
0,
0,
0,
0
],
"sample_close": [
1,
2,
1,
1,
1,
1,
1,
1
],
"sample_open": [
1,
2,
1,
1,
1,
1,
1,
1
],
"vote_close": [
0,
0,
0,
0,
0,
0,
0,
0
],
"vote_open": [
0,
0,
0,
0,
0,
0,
0,
0
],
"voting": [
0,
0,
0,
0,
0,
0,
0,
0
]
},
"total_responses": 8
} |
iwhj | hi | [
"hi",
"hw",
"iw",
"ji",
"wh",
"wi"
] | 2 | 4 | [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. E... | letter_countdown | [
"<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed using the given letters 'i', 'w', 'h', and 'j'. Let's break down the process:\n\n1. **Identify Possible Words**: We will try combining these letters to form words.\n \n - Start with short combinations first:\n - \... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:47103",
"backend": "litellm",
"chat_template_applied": true,
"generation_params": {
"chat_template_applied": true,
"max_tokens": 4096,
"n": 3,
"repetition_penalty": 1.1,
"temperature": 0.7,
"top_k": 20,
"top_p": 0.8
},
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"prompt": [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"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\nGiven a list of letters, create the longest possible valid word using only the given letters.\n\nFor examples: if the input letters are: ['f','t','s','r','e','a']; the word is: <answer> faster </answer>\n\nSolve for the following:\nINPUT: ['i', 'w', 'h', 'j']\n\nOnly use the letters in the input to create a word. Do not use additional letters.\n\n\nLet's think step by step.",
"role": "user"
}
]
} | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"ij",
"whij",
"inch",
"ijh",
"ihwj",
"high",
"ihj",
"hijack"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "ij",
"span_end": 1045,
"span_start": 1043,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "whij",
"span_end": 1659,
"span_start": 1655,
... | [
{
"details": "{'letters': 'iwhj', 'length': 2}",
"errors": [
"not_a_valid_word"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "ij",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'iwhj', 'length':... | [
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false,
false
],
[
false,
false
]
] | [
[
"ij",
"ij"
],
[
"whij",
"whij"
],
[
"inch",
"inch"
],
[
"ijh",
"ijh"
],
[
"ihwj",
"ihwj"
],
[
"high",
"high"
],
[
"No valid word can be formed.",
"No valid word can be formed.",
"ihj"
],
[
"hijack",
"hijack"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "ij",
"pattern_used": "answer tag",
"position": 738,
"span_end": 742,
"span_start": 738,
"span_text": "ij"
},
{
"confidence": 1,
"extraction_type": "internal",
"original... | [
[
{
"details": "{'letters': 'iwhj', 'length': 2}",
"errors": [
"not_a_valid_word"
],
"final_answer": "ij",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'iwhj', 'length': 2}",
"errors": [
"not_a_valid_word"
... | {
"flips_by": [
0,
0,
0,
0,
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,
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0,
0,
0,
0,
0
],
"reflect_close": [
1,
1,
1,
2,
1,
1,
2,
1
],
"reflect_open": [
1,
1,
1,
3,
1,
1,
2,
1
],
"reflection_sbon": [
0,
0,
0,
0,
0,
0,
0,
0
],
"sample_close": [
1,
1,
1,
5,
1,
1,
2,
1
],
"sample_open": [
1,
1,
1,
3,
1,
1,
2,
1
],
"vote_close": [
0,
0,
0,
0,
0,
0,
0,
0
],
"vote_open": [
0,
0,
0,
0,
0,
0,
0,
0
],
"voting": [
0,
0,
0,
0,
0,
0,
0,
0
]
},
"total_responses": 8
} |
uumf | fum | [
"fum",
"umu"
] | 3 | 4 | [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. E... | letter_countdown | [
"<think>\n<sample>\nTo solve this problem, we need to find the longest possible word that can be formed using only the given letters. Let's analyze the input:\n\nInput: ['u', 'u', 'm', 'f']\n\nStep 1: Identify all unique characters in the input.\n- The unique characters are: u, m, f\n\nStep 2: Determine the length ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:47103",
"backend": "litellm",
"chat_template_applied": true,
"generation_params": {
"chat_template_applied": true,
"max_tokens": 4096,
"n": 3,
"repetition_penalty": 1.1,
"temperature": 0.7,
"top_k": 20,
"top_p": 0.8
},
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"prompt": [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"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\nGiven a list of letters, create the longest possible valid word using only the given letters.\n\nFor examples: if the input letters are: ['f','t','s','r','e','a']; the word is: <answer> faster </answer>\n\nSolve for the following:\nINPUT: ['u', 'u', 'm', 'f']\n\nOnly use the letters in the input to create a word. Do not use additional letters.\n\n\nLet's think step by step.",
"role": "user"
}
]
} | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
false,
true,
false,
false,
true,
false,
false
] | [
"umf",
"ufm",
"um",
"umph",
"uff",
"mf",
"mmuffin",
"umf"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "umf",
"span_end": 3914,
"span_start": 3909,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 4,
"original_span": "ufm",
"span_end": 8865,
"span_start": 8862,
... | [
{
"details": "{'letters': 'uumf', 'length': 3}",
"errors": [
"not_a_valid_word"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "umf",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'uumf', 'length'... | [
[
false,
false
],
[
false,
false,
false,
false
],
[
true,
true
],
[
false,
false
],
[
false,
false
],
[
true
],
[
false,
false
],
[
false
]
] | [
[
"umf",
"umf"
],
[
"mmmu",
"umf",
"ufm",
"ufm"
],
[
"um",
"um"
],
[
"umph",
"umph"
],
[
"uff",
"uff"
],
[
"mf"
],
[
"mmmuffin",
"mmuffin"
],
[
"umf"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "umf",
"pattern_used": "answer tag",
"position": 3472,
"span_end": 3477,
"span_start": 3472,
"span_text": "umf"
},
{
"confidence": 1,
"extraction_type": "internal",
"ori... | [
[
{
"details": "{'letters': 'uumf', 'length': 3}",
"errors": [
"not_a_valid_word"
],
"final_answer": "umf",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'uumf', 'length': 3}",
"errors": [
"not_a_valid_word"
... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 2,
"pass_at_n": 1,
"percent_correct": 0.25,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0,
0,
0,
0,
0
],
"reflect_close": [
2,
3,
1,
1,
1,
1,
1,
1
],
"reflect_open": [
2,
3,
1,
1,
1,
1,
1,
1
],
"reflection_sbon": [
0,
0,
0,
0,
0,
0,
0,
0
],
"sample_close": [
2,
3,
1,
1,
1,
1,
1,
1
],
"sample_open": [
1,
3,
1,
1,
1,
1,
1,
1
],
"vote_close": [
0,
0,
0,
0,
0,
0,
0,
0
],
"vote_open": [
0,
0,
0,
0,
0,
0,
0,
0
],
"voting": [
0,
0,
0,
0,
0,
0,
0,
0
]
},
"total_responses": 8
} |
oakl | kalo | [
"kalo",
"kola",
"loka"
] | 4 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed usin(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:47103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
true,
false,
false,
false,
true,
false
] | [
"okakl",
"okl",
"oka",
"okak",
"okla",
"okla",
"oka",
null
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"okakl","span_end":5362,"span_(...TRUNCATED) | [{"details":"{'letters': 'oakl', 'length': 5}","errors":["not_a_valid_word","cannot_be_formed_from_l(...TRUNCATED) | [
[
false,
false
],
[
false,
false,
false
],
[
true,
true
],
[
true,
false
],
[
false
],
[
false,
false
],
[
true,
true
],
[]
] | [["oil","okakl"],["okla","okl","okl"],["oka","oka"],["oka","okak"],["okla"],["okla","okla"],["oka","(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"oil","pattern_used":"answer tag","(...TRUNCATED) | [[{"details":"{'letters': 'oakl', 'length': 3}","errors":["cannot_be_formed_from_letters"],"final_an(...TRUNCATED) | {"flips_by":[0,0,0,1,0,0,0,0],"flips_total":1,"num_correct":2,"pass_at_n":1,"percent_correct":0.25,"(...TRUNCATED) |
avnh | avn | [
"avn",
"han",
"hav",
"nav",
"van"
] | 3 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed usin(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:47103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"vanh",
"avhn",
"vehicle",
"avenue",
"haven",
"haven",
"anchor",
"navaho"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"vanh","span_end":1127,"span_s(...TRUNCATED) | [{"details":"{'letters': 'avnh', 'length': 4}","errors":["not_a_valid_word"],"evaluation_method":nul(...TRUNCATED) | [[false,false],[false,false],[false,false],[false,false],[false,false,false,false,false],[false,fals(...TRUNCATED) | [["vanh","vanh"],["avhn","avhn"],["vehicle","vehicle"],["avenue","avenue"],["haven","haven","haven",(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"vanh","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'avnh', 'length': 4}","errors":["not_a_valid_word"],"final_answer":"vanh",(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED) |
ejfh | feh | [
"feh",
"jef"
] | 3 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed usin(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:47103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"fjeh",
"fish",
"ejf",
"eff",
"Jeff",
"efhj",
"ej",
"eff"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"fjeh","span_end":1918,"span_s(...TRUNCATED) | [{"details":"{'letters': 'ejfh', 'length': 4}","errors":["not_a_valid_word"],"evaluation_method":nul(...TRUNCATED) | [[false,false],[false],[false,false],[false],[false,false],[false,false],[false],[false,false,false](...TRUNCATED) | [["fjeh","fjeh"],["fish"],["ejf","ejf"],["eff"],["Jeff","Jeff"],["efhj","efhj"],["ej"],["feed","eff"(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"fjeh","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'ejfh', 'length': 4}","errors":["not_a_valid_word"],"final_answer":"fjeh",(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED) |
itzt | tit | [
"tit",
"zit"
] | 3 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest possible word that can be fo(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:47103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"itz",
"itzt",
"itzt",
"itztiz",
"itzt",
"itt",
"itz",
"itzt"
] | [{"extraction_type":"final","non_overlapping_spans":3,"original_span":"itz","span_end":3196,"span_st(...TRUNCATED) | [{"details":"{'letters': 'itzt', 'length': 3}","errors":["not_a_valid_word"],"evaluation_method":nul(...TRUNCATED) | [[false,false,false],[false,false],[false,false],[false],[false,false,false],[false,false],[false,fa(...TRUNCATED) | [["its or itz","its","itz"],["itzt","itzt"],["itzt","itzt"],["itztiz"],["cannot be formed","itzt","i(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"its or itz","pattern_used":"answer(...TRUNCATED) | [[{"details":"{'letters': 'itzt', 'length': 8}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED) |
rwuz | wur | [
"wur"
] | 3 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed usin(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:47103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"curry",
"rule",
"wruzw",
"WUZ",
"rutz",
"rzw",
"rule",
"uzzu"
] | [{"extraction_type":"final","non_overlapping_spans":4,"original_span":"curry","span_end":3008,"span_(...TRUNCATED) | [{"details":"{'letters': 'rwuz', 'length': 5}","errors":["cannot_be_formed_from_letters"],"evaluatio(...TRUNCATED) | [[false,false,false,false],[false],[false,false],[false,false],[false,false,false,false,false,false](...TRUNCATED) | [["wow oruzz","wuzzle","curry","curry"],["rule"],["zruw","wruzw"],["WUZ","WUZ"],["row","row","worksh(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"wow oruzz","pattern_used":"answer (...TRUNCATED) | [[{"details":"{'letters': 'rwuz', 'length': 8}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED) |
unig | gin | [
"gin",
"gnu",
"gun",
"ign",
"ing",
"nig",
"ung",
"uni"
] | 3 | 4 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest possible word that can be fo(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:47103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
true,
false,
false,
false
] | [
"unigainly",
null,
"guni",
"unit",
"gun",
"unic",
"unit",
"UNIGNU"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"unigainly","span_end":1211,"s(...TRUNCATED) | [{"details":"{'letters': 'unig', 'length': 9}","errors":["not_a_valid_word","cannot_be_formed_from_l(...TRUNCATED) | [[false],[],[false,false],[false,false],[true,true],[false,false],[false,false],[false,false,false,f(...TRUNCATED) | [["unigainly"],[],["guni","guni"],["unit","unit"],["gun","gun"],["unic","unic"],["unit","unit"],["no(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"unigainly","pattern_used":"answer (...TRUNCATED) | [[{"details":"{'letters': 'unig', 'length': 9}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4