Dataset Viewer
Auto-converted to Parquet Duplicate
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>\nLet's start by analyzing the given list of letters: ['y', 'm', 'i', 'a', 'i'].\n\nFirstly, let’s consider how we can form words from these letters. We need to ensure that our chosen sequence forms a meaningful word when concatenated together.\n\nOne approach is to try different combinations and see which ...
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{ "api_url": "http://127.0.0.1:45103", "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-0910__qrepeat3_ref3_3args_grpo-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: ['y', 'm', 'i', 'a', 'i']\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-0910__qrepeat3_ref3_3args_grpo-rl", "n_responses": 8 }
[ false, false, false, false, false, false, false, false ]
[ "ymiiai", "yakima", "ymai", "No valid word can be formed using the given letters.", null, "yami", "No valid word", "MaybeAir" ]
[ { "extraction_type": "final", "non_overlapping_spans": 2, "original_span": "ymiiai", "span_end": 1485, "span_start": 1477, "total_spans_found": 2 }, { "extraction_type": "final", "non_overlapping_spans": 3, "original_span": "yakima", "span_end": 11518, "span_start": 1...
[ { "details": "{'letters': 'ymiai', 'length': 6}", "errors": [ "not_a_valid_word", "cannot_be_formed_from_letters" ], "evaluation_method": null, "extraction_result": null, "final_answer": "ymiiai", "is_correct": false, "reason": null, "target_matches": false }, { ...
[ [ false, false ], [ false, false, false ], [ false, false ], [ false, false ], [], [ false ], [ false, false ], [ false, false ] ]
[ [ "ymiiai", "ymiiai" ], [ "yaimk", "yaimk", "yakima" ], [ "ymai", "ymai" ], [ "No valid word can be formed using the given letters.", "No valid word can be formed using the given letters." ], [], [ "yami" ], [ "No valid word", "No valid word" ]...
[ [ { "confidence": 1, "extraction_type": "internal", "original_span": "ymiiai", "pattern_used": "answer tag", "position": 1380, "span_end": 1388, "span_start": 1380, "span_text": "ymiiai" }, { "confidence": 1, "extraction_type": "internal", ...
[ [ { "details": "{'letters': 'ymiai', 'length': 6}", "errors": [ "not_a_valid_word", "cannot_be_formed_from_letters" ], "final_answer": "ymiiai", "is_correct": false, "target_matches": false }, { "details": "{'letters': 'ymiai', 'length': 6}", ...
{ "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, 1, 0, 0, 0, 0, 1, 0 ], "reflect_close": [ 0, 1, 0, 0, 0, 0, 1, 0 ], "reflect_open": [ 0, 2, 0, 0, 0, 0, 1, 0 ], "reflection_sbon": [ 0, 0, 0, 0, 0, 0, 0, 0 ], "sample_close": [ 0, 2, 0, 0, 0, 0, 1, 0 ], "sample_open": [ 0, 2, 0, 0, 0, 0, 2, 0 ], "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 }
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>\nLet's start by examining the given letters: ['r', 'u', 'z', 'i', 'z']. We need to form the longest possible word using these letters without repeating any letter.\n\nFirstly, let’s try combining some of the letters:\n\n- RZI (This doesn't make sense as we don’t have ZI).\n- RUZ (Still not forming a meanin...
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{ "api_url": "http://127.0.0.1:45103", "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-0910__qrepeat3_ref3_3args_grpo-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: ['r', 'u', 'z', 'i', 'z']\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-0910__qrepeat3_ref3_3args_grpo-rl", "n_responses": 8 }
[ false, false, false, false, false, false, false, false ]
[ "risuz", "rise", "No valid word can be formed.", "uziri", "No valid word found.", "Rizi", "None Found", "zuizir" ]
[ { "extraction_type": "final", "non_overlapping_spans": 2, "original_span": "risuz", "span_end": 1101, "span_start": 1094, "total_spans_found": 2 }, { "extraction_type": "final", "non_overlapping_spans": 6, "original_span": "rise", "span_end": 12779, "span_start": 1277...
[ { "details": "{'letters': 'ruziz', 'length': 5}", "errors": [ "not_a_valid_word", "cannot_be_formed_from_letters" ], "evaluation_method": null, "extraction_result": null, "final_answer": "risuz", "is_correct": false, "reason": null, "target_matches": false }, { ...
[ [ false, false ], [ false, false, false, false, false, false ], [ false, false ], [ false, false ], [ false, false, false, false ], [ false, false ], [ false, false ], [ false ] ]
[ [ "risuz", "risuz" ], [ "right after i got up early today", "right after i got up early today", "rise", "rise", "rise", "rise" ], [ "RIZUI", "No valid word can be formed." ], [ "uziri", "uziri" ], [ "No valid word found.", "No valid word found....
[ [ { "confidence": 1, "extraction_type": "internal", "original_span": "risuz", "pattern_used": "answer tag", "position": 1031, "span_end": 1038, "span_start": 1031, "span_text": "risuz" }, { "confidence": 1, "extraction_type": "internal", ...
[ [ { "details": "{'letters': 'ruziz', 'length': 5}", "errors": [ "not_a_valid_word", "cannot_be_formed_from_letters" ], "final_answer": "risuz", "is_correct": false, "target_matches": false }, { "details": "{'letters': 'ruziz', 'length': 5}", ...
{ "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, 1, 1, 0, 2, 0, 0, 0 ], "reflect_close": [ 0, 1, 1, 0, 2, 0, 0, 0 ], "reflect_open": [ 0, 2, 1, 0, 2, 0, 0, 0 ], "reflection_sbon": [ 0, 0, 0, 0, 0, 0, 0, 0 ], "sample_close": [ 0, 2, 1, 0, 2, 0, 0, 0 ], "sample_open": [ 0, 2, 2, 0, 3, 0, 0, 0 ], "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 }
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(...TRUNCATED)
letter_countdown
["<think>\nLet's start by trying different combinations of the given letters ['c', 'j', 'l', 'o', 'e(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{"api_url":"http://127.0.0.1:45103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
["Not Possible","circle","cool","No valid word can be formed using the given letters.","occled","ind(...TRUNCATED)
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"Not Possible","span_end":3182(...TRUNCATED)
[{"details":"{'letters': 'cjloe', 'length': 11}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED)
[ [ false, false ], [ false, false, false ], [ false ], [ false, false ], [ false, false ], [ false, false ], [], [ false ] ]
[["Not Possible","Not Possible"],["city","circle","circle"],["cool"],["No valid word can be formed u(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"Not Possible","pattern_used":"answ(...TRUNCATED)
[[{"details":"{'letters': 'cjloe', '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":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED)
bvoeu
bove
[ "bove" ]
4
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 find the longest possible valid word using only the given letters ['b', 'v',(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{"api_url":"http://127.0.0.1:45103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "ue", null, "\"Book\"", null, "voice", null, "love", "beuv" ]
[{"extraction_type":"final","non_overlapping_spans":13,"original_span":"ue","span_end":13348,"span_s(...TRUNCATED)
[{"details":"{'letters': 'bvoeu', 'length': 2}","errors":["not_a_valid_word"],"evaluation_method":nu(...TRUNCATED)
[[false,false,false,false,false,false,false,false,false,false,false,false,false],[],[false],[],[fals(...TRUNCATED)
[["ove","ue","ue","ue","ue","ue","ue","ue","ue","ue","ue","ue","ue"],[],["\"Book\""],[],["voice"],[](...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"ove","pattern_used":"answer tag","(...TRUNCATED)
[[{"details":"{'letters': 'bvoeu', 'length': 3}","errors":["not_a_valid_word"],"final_answer":"ove",(...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)
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>\nLet's start by analyzing the given list of letters: ['u', 'k', 'o', 'z', 'c'].\n\nStep 1:(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{"api_url":"http://127.0.0.1:45103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "No valid word can be created.", "impossibility", "ounce", "oukcuz", "COUCKZ", "ukuza", "you", "Zuka" ]
[{"extraction_type":"final","non_overlapping_spans":1,"original_span":"No valid word can be created.(...TRUNCATED)
[{"details":"{'letters': 'ukozc', 'length': 23}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED)
[ [ false ], [ false ], [ false, false ], [ false, false ], [ false, false ], [ false ], [ false, false ], [ false, false ] ]
[["No valid word can be created."],["impossibility"],["ounce","ounce"],["oukcuz","oukcuz"],["COUCKZ"(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"No valid word can be created.","pa(...TRUNCATED)
[[{"details":"{'letters': 'ukozc', 'length': 23}","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":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>\nLet's start by trying different combinations of the given letters ['u', 'w', 's', 'o', 'x(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{"api_url":"http://127.0.0.1:45103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
["speedy","uses","No valid word can be formed.","uxus","luxery","Not Possible","woodcutter","None of(...TRUNCATED)
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"speedy","span_end":2982,"span(...TRUNCATED)
[{"details":"{'letters': 'uwsox', 'length': 6}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED)
[[false,false],[false,false],[false,false],[false,false],[false,false],[false,false],[false,false],[(...TRUNCATED)
[["speedy","speedy"],["uses","uses"],["No valid word can be formed.","No valid word can be formed."](...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"speedy","pattern_used":"answer tag(...TRUNCATED)
[[{"details":"{'letters': 'uwsox', 'length': 6}","errors":["cannot_be_formed_from_letters"],"final_a(...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)
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>\nLet's start by examining the given list of letters: ['o', 'd', 'r', 'l', 'i'].\n\nFirstly(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{"api_url":"http://127.0.0.1:45103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
["odd","orderly","bird","lordli","There exists no valid word formed solely from the letters O, D, R,(...TRUNCATED)
[{"extraction_type":"final","non_overlapping_spans":1,"original_span":"odd","span_end":3249,"span_st(...TRUNCATED)
[{"details":"{'letters': 'odrli', 'length': 3}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED)
[ [ false ], [ false, false, false ], [ false, false ], [ false ], [ false ], [], [ false, false ], [ false ] ]
[["odd"],["orderly","orderly","orderly"],["bird","bird"],["lordli"],["There exists no valid word for(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"odd","pattern_used":"answer tag","(...TRUNCATED)
[[{"details":"{'letters': 'odrli', '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":0,"pass_at_n":0,"percent_correct":0.0,"s(...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>\nLet's start by examining the given letters: ['i', 'j', 'h', 'j', 'a']. Our goal is to for(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{"api_url":"http://127.0.0.1:45103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "ijhad", null, "ij", "ijha", "No valid word exists.", "ijjah", "iai", "ijhjha" ]
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"ijhad","span_end":2206,"span_(...TRUNCATED)
[{"details":"{'letters': 'ijhja', 'length': 5}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED)
[[false,false],[],[false,false],[false,false],[false],[false,false],[false,false,false,false,false,f(...TRUNCATED)
[["ijhad","ijhad"],[],["ij","ij"],["ijha","ijha"],["No valid word exists."],["ijjah","ijjah"],["iai"(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"ijhad","pattern_used":"answer tag"(...TRUNCATED)
[[{"details":"{'letters': 'ijhja', 'length': 5}","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)
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>\nLet's start by examining the given list of letters: ['a', 'z', 'o', 'i', 'd']. Our goal i(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{"api_url":"http://127.0.0.1:45103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
["zioda","azoidi","No valid word can be formed.","No valid word can be formed.","dictionary","AZOID"(...TRUNCATED)
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"zioda","span_end":2397,"span_(...TRUNCATED)
[{"details":"{'letters': 'azoid', 'length': 5}","errors":["not_a_valid_word"],"evaluation_method":nu(...TRUNCATED)
[[false,false],[false,false],[false,false],[false],[false,false],[false,false],[false,false],[false,(...TRUNCATED)
[["zioda","zioda"],["azoidi","azoidi"],["No valid word can be formed.","No valid word can be formed.(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"zioda","pattern_used":"answer tag"(...TRUNCATED)
[[{"details":"{'letters': 'azoid', 'length': 5}","errors":["not_a_valid_word"],"final_answer":"zioda(...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)
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>\nLet's start by examining the given letters: u, f, o, z, i.\nNow let's try combining them (...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{"api_url":"http://127.0.0.1:45103","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0910__qrepeat3_ref3_3args_grpo-rl","n_resp(...TRUNCATED)
[ false, true, true, false, true, false, false, false ]
["fuzzy","UFO","UFO","None of the provided letters can form a single-word valid English phrase.","UF(...TRUNCATED)
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"fuzzy","span_end":842,"span_s(...TRUNCATED)
[{"details":"{'letters': 'ufozi', 'length': 5}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED)
[ [ false, false ], [ true ], [ true ], [ false, false ], [ true, true ], [], [], [] ]
[["fuzzy","fuzzy"],["UFO"],["UFO"],["None of the provided letters can form a single-word valid Engli(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"fuzzy","pattern_used":"answer tag"(...TRUNCATED)
[[{"details":"{'letters': 'ufozi', 'length': 5}","errors":["cannot_be_formed_from_letters"],"final_a(...TRUNCATED)
{"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":3,"pass_at_n":1,"percent_correct":0.375,(...TRUNCATED)
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
7