question stringlengths 670 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 123 127 | original_split stringclasses 1
value | length int64 4 8 | letters stringlengths 4 8 | source stringlengths 4 4 | 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.07k 1.09k | 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 120 617 | model_responses__best_of_n_atags__eval_evaluation_metadata stringlengths 292 617 | 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 2 818 | model_responses__best_of_n_atags__internal_answers__eval_evaluation_metadata stringlengths 2 619 | model_responses__best_of_n_atags__metrics dict | eval_date stringdate 2025-10-27 00:00:00 2025-10-27 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_4o | 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": "yabb", "source": "baby", "length": 4, "task_config": "letter_countdown_4o", "task_source": "letter_countdown"} | test | 4 | yabb | baby | [
"To solve this problem, we need to follow these steps:\n\n1. Identify all unique letters in the given list.\n2. Create combinations of these letters to form words.\n3. Ensure each combination is at least 4 characters long.\n4. Select the longest valid word from the combinations.\n\nGiven letters: ['y', 'a', 'b', 'b... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {"api_url": "http://10.32.37.22: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-0918__bon_tuning_correct_sampl... | {"backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-0918__bon_tuning_correct_samples_3args_grpo-rl", "n_responses": 4} | [
false,
true,
false,
true
] | [
"aby",
"baby",
"yaba",
"baby"
] | [{"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 989, "span_end": 992, "original_span": "aby"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 973, "span_end": 977, "original_span": "baby"}, {"extraction_type": "final", "tota... | [{"is_correct": false, "final_answer": "aby", "errors": "length_constraint_violated", "length": 3}, {"is_correct": true, "final_answer": "baby", "errors": "", "length": 4}, {"is_correct": false, "final_answer": "yaba", "errors": "cannot_be_formed_from_letters", "length": 4}, {"is_correct": true, "final_answer": "baby",... | [
[
false
],
[
true
],
[
false
],
[
true
]
] | [
[
"aby"
],
[
"baby"
],
[
"yaba"
],
[
"baby"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 989, "span_text": "aby", "extraction_type": "internal", "span_start": 989, "span_end": 992, "original_span": "aby"}], [{"pattern_used": "answer tag", "confidence": 1.0, "position": 973, "span_text": "baby", "extraction_type": "internal", "span_start": 973,... | [[{"is_correct": false, "final_answer": "aby", "errors": "length_constraint_violated", "length": 3}], [{"is_correct": true, "final_answer": "baby", "errors": "", "length": 4}], [{"is_correct": false, "final_answer": "yaba", "errors": "cannot_be_formed_from_letters", "length": 4}], [{"is_correct": true, "final_answer": ... | {
"flips_by": [
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 2,
"pass_at_n": 1,
"percent_correct": 0.5,
"skill_count": {
"answer_revision": [
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0
],
"reflect_close": [
0,
0... | 2025-10-27 | |
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_4o | 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": "nsgo", "source": "song", "length": 4, "task_config": "letter_countdown_4o", "task_source": "letter_countdown"} | test | 4 | nsgo | song | [
"To solve this problem, we need to follow these steps:\n\n1. Identify all possible combinations of the given letters.\n2. Check each combination to see if it forms a valid English word.\n3. Ensure the word is at least 4 characters long.\n4. Select the longest valid word from the options.\n\nGiven letters: ['n', 's'... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {"api_url": "http://10.32.37.22: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-0918__bon_tuning_correct_sampl... | {"backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-0918__bon_tuning_correct_samples_3args_grpo-rl", "n_responses": 4} | [
false,
false,
false,
false
] | [
"No valid word found",
null,
"gone",
"No valid word"
] | [{"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 882, "span_end": 903, "original_span": "No valid word found"}, {"extraction_type": "final"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 4914, "span_end": 4918, "original_sp... | [{"is_correct": false, "final_answer": "Novalidwordfound", "errors": "not_a_valid_word, length_constraint_violated, cannot_be_formed_from_letters", "length": 16}, {"evaluation_method": "response_processor", "reason": "no_extracted_answer", "extraction_result": "{'extraction_type': 'final'}"}, {"is_correct": false, "fin... | [
[
false
],
[],
[
false
],
[
false
]
] | [
[
"No valid word found"
],
[],
[
"gone"
],
[
"No valid word"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 882, "span_text": "No valid word found", "extraction_type": "internal", "span_start": 882, "span_end": 903, "original_span": "No valid word found"}], [], [{"pattern_used": "answer tag", "confidence": 1.0, "position": 4914, "span_text": "gone", "extraction_... | [[{"is_correct": false, "final_answer": "Novalidwordfound", "errors": "not_a_valid_word, length_constraint_violated, cannot_be_formed_from_letters", "length": 16}], [], [{"is_correct": false, "final_answer": "gone", "errors": "cannot_be_formed_from_letters", "length": 4}], [{"is_correct": false, "final_answer": "Novali... | {
"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": [
0,
0,
0,
0
],
"reflect_close": [
0,
0,
... | 2025-10-27 | |
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_4o | 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": "rodw", "source": "word", "length": 4, "task_config": "letter_countdown_4o", "task_source": "letter_countdown"} | test | 4 | rodw | word | [
"To solve this problem, we need to follow these steps:\n\n1. Identify all possible combinations of the given letters.\n2. Check each combination to see if it forms a valid English word.\n3. Ensure the word is at least 4 characters long.\n4. Select the longest valid word from the combinations.\n\nGiven letters: ['r'... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {"api_url": "http://10.32.37.22: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-0918__bon_tuning_correct_sampl... | {"backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-0918__bon_tuning_correct_samples_3args_grpo-rl", "n_responses": 4} | [
false,
false,
false,
false
] | [
"No valid word found",
null,
"No valid word found",
"wood"
] | [{"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 865, "span_end": 884, "original_span": "No valid word found"}, {"extraction_type": "final"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 878, "span_end": 899, "original_span... | [{"is_correct": false, "final_answer": "Novalidwordfound", "errors": "not_a_valid_word, length_constraint_violated, cannot_be_formed_from_letters", "length": 16}, {"evaluation_method": "response_processor", "reason": "no_extracted_answer", "extraction_result": "{'extraction_type': 'final'}"}, {"is_correct": false, "fin... | [
[
false
],
[],
[
false
],
[
false
]
] | [
[
"No valid word found"
],
[],
[
"No valid word found"
],
[
"wood"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 865, "span_text": "No valid word found", "extraction_type": "internal", "span_start": 865, "span_end": 884, "original_span": "No valid word found"}], [], [{"pattern_used": "answer tag", "confidence": 1.0, "position": 878, "span_text": "No valid word found"... | [[{"is_correct": false, "final_answer": "Novalidwordfound", "errors": "not_a_valid_word, length_constraint_violated, cannot_be_formed_from_letters", "length": 16}], [], [{"is_correct": false, "final_answer": "Novalidwordfound", "errors": "not_a_valid_word, length_constraint_violated, cannot_be_formed_from_letters", "le... | {
"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": [
0,
0,
0,
0
],
"reflect_close": [
0,
0,
... | 2025-10-27 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_4o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"vage\", \"source\": \"gave\", \"length\": 4, \"task_config\": \"letter_countdown_4o(...TRUNCATED) | test | 4 | vage | gave | ["To solve this problem, we need to follow these steps:\n\n1. Identify all possible combinations of (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.22:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0918__bon_tuning_correct_sample(...TRUNCATED) | [
false,
false,
false,
false
] | [
"value",
"No valid word",
"value",
null
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"value\", \"errors\": \"length_constraint_violated, can(...TRUNCATED) | [
[
false
],
[
false
],
[
false
],
[]
] | [
[
"value"
],
[
"No valid word"
],
[
"value"
],
[]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1037, \"span_text\": \"valu(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"value\", \"errors\": \"length_constraint_violated, ca(...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-10-27 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_4o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"gtes\", \"source\": \"gets\", \"length\": 4, \"task_config\": \"letter_countdown_4o(...TRUNCATED) | test | 4 | gtes | gets | ["To solve this problem, we need to follow these steps:\n\n1. Identify all possible combinations of (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.22:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0918__bon_tuning_correct_sample(...TRUNCATED) | [
false,
false,
false,
false
] | [
null,
null,
"gesture",
"gestures"
] | "[{\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\(...TRUNCATED) | "[{\"evaluation_method\": \"response_processor\", \"reason\": \"no_extracted_answer\", \"extraction_(...TRUNCATED) | [
[],
[],
[
false
],
[
false
]
] | [
[],
[],
[
"gesture"
],
[
"gestures"
]
] | "[[], [], [{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1593, \"span_text\"(...TRUNCATED) | "[[], [], [{\"is_correct\": false, \"final_answer\": \"gesture\", \"errors\": \"length_constraint_vi(...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-10-27 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_4o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"elsf\", \"source\": \"self\", \"length\": 4, \"task_config\": \"letter_countdown_4o(...TRUNCATED) | test | 4 | elsf | self | ["To solve this problem, we need to follow these steps:\n\n1. Identify all possible combinations of (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.22:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0918__bon_tuning_correct_sample(...TRUNCATED) | [
false,
false,
false,
false
] | [
"flowers",
"elves",
"elles",
"No valid word found"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"flowers\", \"errors\": \"length_constraint_violated, c(...TRUNCATED) | [
[
false
],
[
false
],
[
false
],
[
false
]
] | [
[
"flowers"
],
[
"elves"
],
[
"elles"
],
[
"No valid word found"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1596, \"span_text\": \"flow(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"flowers\", \"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-10-27 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_4o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"osct\", \"source\": \"cost\", \"length\": 4, \"task_config\": \"letter_countdown_4o(...TRUNCATED) | test | 4 | osct | cost | ["To solve this problem, we need to follow these steps:\n\n1. Identify all possible combinations of (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.22:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0918__bon_tuning_correct_sample(...TRUNCATED) | [
false,
false,
false,
false
] | [
null,
null,
null,
"eat"
] | "[{\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\(...TRUNCATED) | "[{\"evaluation_method\": \"response_processor\", \"reason\": \"no_extracted_answer\", \"extraction_(...TRUNCATED) | [
[],
[],
[],
[
false
]
] | [
[],
[],
[],
[
"eat"
]
] | "[[], [], [], [{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 3217, \"span_te(...TRUNCATED) | "[[], [], [], [{\"is_correct\": false, \"final_answer\": \"eat\", \"errors\": \"length_constraint_vi(...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-10-27 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_4o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"dlhe\", \"source\": \"held\", \"length\": 4, \"task_config\": \"letter_countdown_4o(...TRUNCATED) | test | 4 | dlhe | held | ["To solve this problem, we need to follow these steps:\n\n1. Identify all possible combinations of (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.22:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0918__bon_tuning_correct_sample(...TRUNCATED) | [
false,
false,
false,
false
] | [
null,
null,
null,
"Hello!"
] | "[{\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\(...TRUNCATED) | "[{\"evaluation_method\": \"response_processor\", \"reason\": \"no_extracted_answer\", \"extraction_(...TRUNCATED) | [
[],
[],
[],
[
false
]
] | [
[],
[],
[],
[
"Hello!"
]
] | "[[], [], [], [{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 3099, \"span_te(...TRUNCATED) | "[[], [], [], [{\"is_correct\": false, \"final_answer\": \"Hello\", \"errors\": \"length_constraint_(...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-10-27 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_4o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"niam\", \"source\": \"main\", \"length\": 4, \"task_config\": \"letter_countdown_4o(...TRUNCATED) | test | 4 | niam | main | ["To solve this problem, we need to follow these steps:\n\n1. Identify all possible combinations of (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.22:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0918__bon_tuning_correct_sample(...TRUNCATED) | [
false,
true,
true,
false
] | [
null,
"NAIM",
"naim",
"name"
] | "[{\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non(...TRUNCATED) | "[{\"evaluation_method\": \"response_processor\", \"reason\": \"no_extracted_answer\", \"extraction_(...TRUNCATED) | [
[],
[
true
],
[
true
],
[
false
]
] | [
[],
[
"NAIM"
],
[
"naim"
],
[
"name"
]
] | "[[], [{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 845, \"span_text\": \"N(...TRUNCATED) | "[[], [{\"is_correct\": true, \"final_answer\": \"NAIM\", \"errors\": \"\", \"length\": 4}], [{\"is_(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":2,"pass_at_n":1,"percent_correct":0.5,"skill_cou(...TRUNCATED) | 2025-10-27 | |
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED) | letter_countdown_4o | letter_countdown | [{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED) | [] | [] | "{\"letters\": \"dora\", \"source\": \"road\", \"length\": 4, \"task_config\": \"letter_countdown_4o(...TRUNCATED) | test | 4 | dora | road | ["To solve this problem, we need to follow these steps:\n\n1. Identify all possible combinations of (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.22:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0918__bon_tuning_correct_sample(...TRUNCATED) | [
true,
false,
true,
false
] | [
"dora",
null,
"dora",
"drag"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": true, \"final_answer\": \"dora\", \"errors\": \"\", \"length\": 4}, {\"evaluation(...TRUNCATED) | [
[
true
],
[],
[
true
],
[
false
]
] | [
[
"dora"
],
[],
[
"dora"
],
[
"drag"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1237, \"span_text\": \"dora(...TRUNCATED) | "[[{\"is_correct\": true, \"final_answer\": \"dora\", \"errors\": \"\", \"length\": 4}], [], [{\"is_(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":2,"pass_at_n":1,"percent_correct":0.5,"skill_cou(...TRUNCATED) | 2025-10-27 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 2