letters stringlengths 5 5 | answer stringlengths 3 5 | all_best listlengths 1 9 | length int64 3 5 | letters_length int64 5 5 | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ymiai | aim | [
"aim",
"ami",
"amy",
"ima",
"imi",
"may",
"mia",
"mya",
"yam"
] | 3 | 5 | [
{
"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 from the input list. Let's break down the process:\n\n1. **Identify the available letters**: The input list contains the characters `['y', 'm', 'i', 'a', 'i']`.\n \n2. **Consider all possibl... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48157",
"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/TAU... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
true,
true,
true,
false,
false,
false,
false
] | [
"maid",
"aim",
"ima",
"aim",
"year",
"idea",
"yamina",
"maami"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "maid",
"span_end": 1754,
"span_start": 1748,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "aim",
"span_end": 1790,
"span_start": 1785,
... | [
{
"details": "{'letters': 'ymiai', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "maid",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': '... | [
[
false,
false
],
[
true,
true
],
[
false,
false,
true,
true
],
[
true,
true
],
[
false,
false,
false,
false,
false,
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false,
false
... | [
[
"maid",
"maid"
],
[
"aim",
"aim"
],
[
"No valid word found",
"No valid word",
"ima",
"ima"
],
[
"aim",
"aim"
],
[
"No valid word can be formed",
"ymai",
"ymai",
"myai",
"ymai",
"myai",
"year"
],
[
"idea",
"idea"
],
... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "maid",
"pattern_used": "answer tag",
"position": 1613,
"span_end": 1619,
"span_start": 1613,
"span_text": "maid"
},
{
"confidence": 1,
"extraction_type": "internal",
"o... | [
[
{
"details": "{'letters': 'ymiai', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "maid",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'ymiai', 'length': 4}",
"errors": [
"cannot... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 3,
"pass_at_n": 1,
"percent_correct": 0.375,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
... |
ruziz | uri | [
"uri"
] | 3 | 5 | [
{
"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 'r', 'u', 'z', 'i', and 'z'. Let's break down the process:\n\n1. **Identify all unique combinations**: First, let's consider all possible permutations of these five letters.\n \n Possible combi... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48157",
"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/TAU... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"ruler",
"rui",
"zipper",
"ris",
"run",
null,
null,
"risu"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "ruler",
"span_end": 1466,
"span_start": 1461,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "rui",
"span_end": 1111,
"span_start": 1108,
... | [
{
"details": "{'letters': 'ruziz', 'length': 5}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "ruler",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': ... | [
[
false,
false
],
[
false,
false
],
[
false,
false,
false
],
[
false,
false
],
[
false,
false
],
[],
[],
[
false,
false
]
] | [
[
"ruler",
"ruler"
],
[
"rui",
"rui"
],
[
"zuri",
"zipper",
"zipper"
],
[
"ris",
"ris"
],
[
"run",
"run"
],
[],
[],
[
"uirz",
"risu"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "ruler",
"pattern_used": "answer tag",
"position": 1108,
"span_end": 1113,
"span_start": 1108,
"span_text": "ruler"
},
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'ruziz', 'length': 5}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "ruler",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'ruziz', 'length': 5}",
"errors": [
"canno... | {
"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,
... |
cjloe | cole | [
"cole",
"ecol",
"joel",
"jole"
] | 4 | 5 | [
{
"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 break down the process:\n\n1. **Identify available letters**: The input contains the letters `['c', 'j', 'l', 'o', 'e']`.\n \n2. **Consider all possible combinations**:\n - We will ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48157",
"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/TAU... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
true,
false,
false
] | [
"cool",
"code",
"code",
"code",
"cool",
"cole",
"cool",
null
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "cool",
"span_end": 1712,
"span_start": 1708,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "code",
"span_end": 1520,
"span_start": 1514,
... | [
{
"details": "{'letters': 'cjloe', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "cool",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': '... | [
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
true,
false
],
[
false,
true
],
[
false,
false
],
[]
] | [
[
"cool",
"cool"
],
[
"code",
"code"
],
[
"code",
"code"
],
[
"code",
"code"
],
[
"cole",
"cool"
],
[
"No valid longer word can be formed.",
"cole"
],
[
"cool",
"cool"
],
[]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "cool",
"pattern_used": "answer tag",
"position": 1372,
"span_end": 1378,
"span_start": 1372,
"span_text": "cool"
},
{
"confidence": 1,
"extraction_type": "internal",
"o... | [
[
{
"details": "{'letters': 'cjloe', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "cool",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'cjloe', 'length': 4}",
"errors": [
"cannot... | {
"flips_by": [
0,
0,
0,
0,
1,
0,
0,
0
],
"flips_total": 1,
"num_correct": 1,
"pass_at_n": 1,
"percent_correct": 0.125,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
... |
bvoeu | bove | [
"bove"
] | 4 | 5 | [
{
"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. Let's break down the process:\n\n1. **Identify available letters**: The input contains the letters `['b', 'v', 'o', 'e', 'u']`.\n \n2. **Consider all possible combinations**:\n - We will try d... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48157",
"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/TAU... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"over",
"value",
"book",
null,
"overbu",
"beau",
"above",
"bovie"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "over",
"span_end": 1798,
"span_start": 1794,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "value",
"span_end": 1415,
"span_start": 1408,... | [
{
"details": "{'letters': 'bvoeu', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "over",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': '... | [
[
false,
false
],
[
false,
false
],
[
false,
false
],
[],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false,
false,
false
]
] | [
[
"over",
"over"
],
[
"value",
"value"
],
[
"book",
"book"
],
[],
[
"ovebu",
"overbu"
],
[
"beau",
"beau"
],
[
"above",
"above"
],
[
"None",
"beau",
"bovie",
"bovie"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "over",
"pattern_used": "answer tag",
"position": 1374,
"span_end": 1380,
"span_start": 1374,
"span_text": "over"
},
{
"confidence": 1,
"extraction_type": "internal",
"o... | [
[
{
"details": "{'letters': 'bvoeu', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "over",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'bvoeu', 'length': 4}",
"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,
... |
ukozc | coz | [
"coz",
"kou",
"ock"
] | 3 | 5 | [{"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:48157","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"kucchini",
"ukaz",
null,
"kuzco",
"cut",
"book",
"uko",
"cook"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"kucchini","span_end":1696,"sp(...TRUNCATED) | [{"details":"{'letters': 'ukozc', 'length': 8}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | [
[
false,
false
],
[
false,
false
],
[],
[
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
]
] | [["KUOCZ","kucchini"],["ukaz","ukaz"],[],["kuzco"],["cut","cut"],["book","book"],["uko","uko"],["coo(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"KUOCZ","pattern_used":"answer tag"(...TRUNCATED) | [[{"details":"{'letters': 'ukozc', 'length': 5}","errors":["not_a_valid_word"],"final_answer":"KUOCZ(...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) |
uwsox | sou | [
"sou",
"sow",
"sox",
"usw",
"wos",
"wus"
] | 3 | 5 | [{"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:48157","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED) | [
true,
true,
false,
false,
false,
false,
false,
false
] | [
"ux",
"us",
"words",
"usox",
null,
"oo",
"usxo",
"suspect"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"ux","span_end":1250,"span_sta(...TRUNCATED) | [{"details":"{'letters': 'uwsox', 'length': 2}","errors":[],"evaluation_method":null,"extraction_res(...TRUNCATED) | [[true,true],[true,true],[false,false],[false,false],[],[false,false],[false,false],[false,false,fal(...TRUNCATED) | [["ux","ux"],["us","us"],["None of the above","words"],["usox","usox"],[],["oo","oo"],["usxo","usxo"(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"ux","pattern_used":"answer tag","p(...TRUNCATED) | [[{"details":"{'letters': 'uwsox', 'length': 2}","errors":[],"final_answer":"ux","is_correct":true,"(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":2,"pass_at_n":1,"percent_correct":0.25,"(...TRUNCATED) |
odrli | droil | [
"droil"
] | 5 | 5 | [{"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:48157","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
true,
false
] | [
"bird",
"bird",
"road",
"literary",
"order",
"iodine",
"oil",
"odoril"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"bird","span_end":1108,"span_s(...TRUNCATED) | [{"details":"{'letters': 'odrli', 'length': 4}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED) | [[false,false],[false,false],[false,false],[false,false],[false,false,true,false],[false,false],[tru(...TRUNCATED) | [["bird","bird"],["bird","bird"],["Road","road"],["literary","literary"],["more","more","lord","orde(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"bird","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'odrli', 'length': 4}","errors":["cannot_be_formed_from_letters"],"final_a(...TRUNCATED) | {"flips_by":[0,0,0,0,1,0,0,0],"flips_total":1,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED) |
ijhja | hajji | [
"hajji"
] | 5 | 5 | [{"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:48157","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
true,
false,
false,
false,
false,
false
] | [
"No valid word found",
"hijah",
"jah",
"hair",
"ijjah",
"iahja",
"iahe",
"ijjah"
] | [{"extraction_type":"final","non_overlapping_spans":5,"original_span":"No valid word found","span_en(...TRUNCATED) | [{"details":"{'letters': 'ijhja', 'length': 16}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | [[false,false,false,false,false],[false,false,false],[true,true],[false,false],[false,false,false,fa(...TRUNCATED) | [["No valid word found","No valid word found","No valid word found","No valid word found","No valid (...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"No valid word found","pattern_used(...TRUNCATED) | [[{"details":"{'letters': 'ijhja', 'length': 16}","errors":["not_a_valid_word","cannot_be_formed_fro(...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) |
azoid | azido | [
"azido",
"diazo"
] | 5 | 5 | [{"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:48157","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
true,
false,
false,
false
] | [
"No valid word",
"azoo",
"audit",
null,
"ido",
"ozi",
"zdz",
"adiz"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"No valid word","span_end":171(...TRUNCATED) | [{"details":"{'letters': 'azoid', 'length': 11}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | [
[
false
],
[
false,
false
],
[
false,
false
],
[],
[
true,
true
],
[
false,
false
],
[
false,
false
],
[
false,
false
]
] | [["No valid word"],["azoo","azoo"],["audit","audit"],[],["ido","ido"],["ozi","ozi"],["zdz","zdz"],["(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"No valid word","pattern_used":"ans(...TRUNCATED) | [[{"details":"{'letters': 'azoid', 'length': 11}","errors":["not_a_valid_word","cannot_be_formed_fro(...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) |
ufozi | fiz | [
"fiz",
"fou",
"iof",
"iou",
"ouf",
"oui",
"ufo"
] | 3 | 5 | [{"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:48157","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
true,
false,
false,
false,
false,
false,
false
] | [
"fit",
"ufo",
"zuiz",
"zigzag",
"foot",
"faster",
"ufozi",
"funny"
] | [{"extraction_type":"final","non_overlapping_spans":3,"original_span":"fit","span_end":1921,"span_st(...TRUNCATED) | [{"details":"{'letters': 'ufozi', 'length': 3}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED) | [[false,false,false],[true,true],[false,false],[false,false],[false,false],[false,false,false,false,(...TRUNCATED) | [["fit","fit","fit"],["ufo","ufo"],["zuiz","zuiz"],["zigzag","zigzag"],["foot","foot"],["foziu","FOI(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"fit","pattern_used":"answer tag","(...TRUNCATED) | [[{"details":"{'letters': 'ufozi', 'length': 3}","errors":["cannot_be_formed_from_letters"],"final_a(...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