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 dict | model_responses__best_of_n_atags__metadata dict | 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 599 | model_responses__best_of_n_atags__eval_evaluation_metadata stringlengths 292 524 | 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 198 1.48k ⌀ | model_responses__best_of_n_atags__internal_answers__eval_evaluation_metadata stringlengths 87 641 ⌀ | model_responses__best_of_n_atags__metrics dict | eval_date stringdate 2025-11-02 00:00:00 2025-11-02 00:00:00 | split stringclasses 1
value | revision_name stringclasses 1
value | model_path stringclasses 1
value | checkpoint_step int64 0 0 | stage_name stringclasses 1
value | stage_number int64 1 1 | timestamp stringdate 2025-11-02 16:16:14 2025-11-02 16:16:14 | eval_repo_id stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
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 rearrange the given letters to form a valid English word that meets the specified conditions. Let's go through the steps:\n\n1. **Identify the given letters**: The input letters are ['y', 'a', 'b', 'b'].\n\n2. **Determine the word length**: The word should be at least 4 characters... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:59973/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... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360",
"n_responses": 4
} | [
true,
true,
true,
false
] | [
"baby",
"baby",
"baby",
"bay"
] | [{"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1141, "span_end": 1147, "original_span": "baby"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1229, "span_end": 1235, "original_span": "baby"}, {"extraction_type": "final", ... | [{"is_correct": true, "final_answer": "baby", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "baby", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "baby", "errors": "", "length": 4}, {"is_correct": false, "final_answer": "bay", "errors": "length_constraint_violated", "length": 3}] | [
[
true
],
[
true
],
[
true
],
[
false,
false,
false,
false
]
] | [
[
"baby"
],
[
"baby"
],
[
"baby"
],
[
"bay",
"bay",
"bya",
"bay"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 1141, "span_text": "baby", "extraction_type": "internal", "span_start": 1141, "span_end": 1147, "original_span": "baby"}], [{"pattern_used": "answer tag", "confidence": 1.0, "position": 1229, "span_text": "baby", "extraction_type": "internal", "span_start"... | [[{"is_correct": true, "final_answer": "baby", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "baby", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "baby", "errors": "", "length": 4}], [{"is_correct": false, "final_answer": "bay", "errors": "length_constraint_violated", "length"... | {
"flips_by": [
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 3,
"pass_at_n": 1,
"percent_correct": 0.75,
"skill_count": {
"answer_revision": [
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0
],
"reflect_close": [
0,
... | 2025-11-02 | test | main | TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360 | 0 | eval_rl | 1 | 2025-11-02T16:16:14.141349 | TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o-eval_rl | |
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 rearrange the given letters to form a valid English word that meets the specified conditions. Let's go through the steps:\n\n1. **Identify the given letters**: The input letters are ['n', 's', 'g', 'o'].\n\n2. **Determine the word length**: The word should be at least 4 characters... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:59973/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... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360",
"n_responses": 4
} | [
true,
true,
true,
true
] | [
"song",
"song",
"song",
"song"
] | [{"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1394, "span_end": 1400, "original_span": "song"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1413, "span_end": 1419, "original_span": "song"}, {"extraction_type": "final", ... | [{"is_correct": true, "final_answer": "song", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "song", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "song", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "song", "errors": "", "length": 4}] | [
[
true
],
[
true
],
[
true
],
[
true
]
] | [
[
"song"
],
[
"song"
],
[
"song"
],
[
"song"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 1394, "span_text": "song", "extraction_type": "internal", "span_start": 1394, "span_end": 1400, "original_span": "song"}], [{"pattern_used": "answer tag", "confidence": 1.0, "position": 1413, "span_text": "song", "extraction_type": "internal", "span_start"... | [[{"is_correct": true, "final_answer": "song", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "song", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "song", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "song", "errors": "", "length": 4}]] | {
"flips_by": [
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 4,
"pass_at_n": 1,
"percent_correct": 1,
"skill_count": {
"answer_revision": [
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0
],
"reflect_close": [
0,
0,
... | 2025-11-02 | test | main | TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360 | 0 | eval_rl | 1 | 2025-11-02T16:16:14.141358 | TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o-eval_rl | |
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 rearrange the given letters to form a valid English word that meets the specified conditions. Let's go through the steps:\n\n1. **Identify the given letters**: The input letters are ['r', 'o', 'd', 'w'].\n\n2. **Determine the word length**: The word should be at least 4 characters... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:59973/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... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360",
"n_responses": 4
} | [
true,
true,
true,
true
] | [
"word",
"word",
"word",
"word"
] | [{"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1309, "span_end": 1315, "original_span": "word"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1271, "span_end": 1277, "original_span": "word"}, {"extraction_type": "final", ... | [{"is_correct": true, "final_answer": "word", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "word", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "word", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "word", "errors": "", "length": 4}] | [
[
true
],
[
true
],
[
true
],
[
true
]
] | [
[
"word"
],
[
"word"
],
[
"word"
],
[
"word"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 1309, "span_text": "word", "extraction_type": "internal", "span_start": 1309, "span_end": 1315, "original_span": "word"}], [{"pattern_used": "answer tag", "confidence": 1.0, "position": 1271, "span_text": "word", "extraction_type": "internal", "span_start"... | [[{"is_correct": true, "final_answer": "word", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "word", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "word", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "word", "errors": "", "length": 4}]] | {
"flips_by": [
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 4,
"pass_at_n": 1,
"percent_correct": 1,
"skill_count": {
"answer_revision": [
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0
],
"reflect_close": [
0,
0,
... | 2025-11-02 | test | main | TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360 | 0 | eval_rl | 1 | 2025-11-02T16:16:14.141361 | TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o-eval_rl | |
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": "vage", "source": "gave", "length": 4, "task_config": "letter_countdown_4o", "task_source": "letter_countdown"} | test | 4 | vage | gave | [
"To solve this problem, we need to rearrange the given letters to form a valid English word that meets the specified conditions. Let's go through the steps:\n\n1. **Identify the given letters**: The input letters are ['v', 'a', 'g', 'e'].\n\n2. **Determine the word length**: The word should be at least 4 characters... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:59973/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... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360",
"n_responses": 4
} | [
true,
true,
true,
true
] | [
"gave",
"gave",
"gave",
"gave"
] | [{"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1349, "span_end": 1355, "original_span": "gave"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1349, "span_end": 1355, "original_span": "gave"}, {"extraction_type": "final", ... | [{"is_correct": true, "final_answer": "gave", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "gave", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "gave", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "gave", "errors": "", "length": 4}] | [
[
true
],
[
true
],
[
true
],
[
true
]
] | [
[
"gave"
],
[
"gave"
],
[
"gave"
],
[
"gave"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 1349, "span_text": "gave", "extraction_type": "internal", "span_start": 1349, "span_end": 1355, "original_span": "gave"}], [{"pattern_used": "answer tag", "confidence": 1.0, "position": 1349, "span_text": "gave", "extraction_type": "internal", "span_start"... | [[{"is_correct": true, "final_answer": "gave", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "gave", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "gave", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "gave", "errors": "", "length": 4}]] | {
"flips_by": [
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 4,
"pass_at_n": 1,
"percent_correct": 1,
"skill_count": {
"answer_revision": [
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0
],
"reflect_close": [
0,
0,
... | 2025-11-02 | test | main | TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360 | 0 | eval_rl | 1 | 2025-11-02T16:16:14.141362 | TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o-eval_rl | |
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": "gtes", "source": "gets", "length": 4, "task_config": "letter_countdown_4o", "task_source": "letter_countdown"} | test | 4 | gtes | gets | [
"To solve this problem, we need to rearrange the given letters to form a valid English word that meets the specified conditions. Let's go through the steps:\n\n1. **Identify the given letters**: The input letters are ['g', 't', 'e', 's'].\n\n2. **Determine the word length**: The word should be at least 4 characters... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:59973/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... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360",
"n_responses": 4
} | [
true,
true,
true,
true
] | [
"gets",
"gets",
"gets",
"gets"
] | [{"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1699, "span_end": 1705, "original_span": "gets"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1754, "span_end": 1760, "original_span": "gets"}, {"extraction_type": "final", ... | [{"is_correct": true, "final_answer": "gets", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "gets", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "gets", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "gets", "errors": "", "length": 4}] | [
[
true
],
[
true
],
[
true
],
[
true
]
] | [
[
"gets"
],
[
"gets"
],
[
"gets"
],
[
"gets"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 1699, "span_text": "gets", "extraction_type": "internal", "span_start": 1699, "span_end": 1705, "original_span": "gets"}], [{"pattern_used": "answer tag", "confidence": 1.0, "position": 1754, "span_text": "gets", "extraction_type": "internal", "span_start"... | [[{"is_correct": true, "final_answer": "gets", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "gets", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "gets", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "gets", "errors": "", "length": 4}]] | {
"flips_by": [
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 4,
"pass_at_n": 1,
"percent_correct": 1,
"skill_count": {
"answer_revision": [
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0
],
"reflect_close": [
0,
0,
... | 2025-11-02 | test | main | TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360 | 0 | eval_rl | 1 | 2025-11-02T16:16:14.141364 | TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o-eval_rl | |
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": "elsf", "source": "self", "length": 4, "task_config": "letter_countdown_4o", "task_source": "letter_countdown"} | test | 4 | elsf | self | [
"To solve this problem, we need to rearrange the given letters to form a valid English word that meets the specified conditions. Let's go through the steps:\n\n1. **Identify the given letters**: The input letters are ['e', 'l', 's', 'f'].\n\n2. **Determine the word length**: The word should be at least 4 characters... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:59973/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... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360",
"n_responses": 4
} | [
true,
true,
true,
true
] | [
"self",
"self",
"self",
"self"
] | [{"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1361, "span_end": 1367, "original_span": "self"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 1514, "span_end": 1520, "original_span": "self"}, {"extraction_type": "final", ... | [{"is_correct": true, "final_answer": "self", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "self", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "self", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "self", "errors": "", "length": 4}] | [
[
true
],
[
true
],
[
true
],
[
true
]
] | [
[
"self"
],
[
"self"
],
[
"self"
],
[
"self"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 1361, "span_text": "self", "extraction_type": "internal", "span_start": 1361, "span_end": 1367, "original_span": "self"}], [{"pattern_used": "answer tag", "confidence": 1.0, "position": 1514, "span_text": "self", "extraction_type": "internal", "span_start"... | [[{"is_correct": true, "final_answer": "self", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "self", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "self", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "self", "errors": "", "length": 4}]] | {
"flips_by": [
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 4,
"pass_at_n": 1,
"percent_correct": 1,
"skill_count": {
"answer_revision": [
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0
],
"reflect_close": [
0,
0,
... | 2025-11-02 | test | main | TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360 | 0 | eval_rl | 1 | 2025-11-02T16:16:14.141366 | TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o-eval_rl | |
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": "osct", "source": "cost", "length": 4, "task_config": "letter_countdown_4o", "task_source": "letter_countdown"} | test | 4 | osct | cost | [
"To solve this problem, we need to rearrange the given letters to form a valid English word that meets the specified conditions. Let's go through the steps:\n\n1. **Identify the given letters**: The input letters are ['o', 's', 'c', 't'].\n\n2. **Determine the word length**: The word should be at least 4 characters... | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:59973/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... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360",
"n_responses": 4
} | [
true,
true,
true,
true
] | [
"cots",
"cost",
"cost",
"cost"
] | [{"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 5270, "span_end": 5276, "original_span": "cots"}, {"extraction_type": "final", "total_spans_found": 1, "non_overlapping_spans": 1, "span_start": 2135, "span_end": 2141, "original_span": "cost"}, {"extraction_type": "final", ... | [{"is_correct": true, "final_answer": "cots", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "cost", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "cost", "errors": "", "length": 4}, {"is_correct": true, "final_answer": "cost", "errors": "", "length": 4}] | [
[
true
],
[
true
],
[
true
],
[
true
]
] | [
[
"cots"
],
[
"cost"
],
[
"cost"
],
[
"cost"
]
] | [[{"pattern_used": "answer tag", "confidence": 1.0, "position": 5270, "span_text": "cots", "extraction_type": "internal", "span_start": 5270, "span_end": 5276, "original_span": "cots"}], [{"pattern_used": "answer tag", "confidence": 1.0, "position": 2135, "span_text": "cost", "extraction_type": "internal", "span_start"... | [[{"is_correct": true, "final_answer": "cots", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "cost", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "cost", "errors": "", "length": 4}], [{"is_correct": true, "final_answer": "cost", "errors": "", "length": 4}]] | {
"flips_by": [
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 4,
"pass_at_n": 1,
"percent_correct": 1,
"skill_count": {
"answer_revision": [
0,
0,
0,
0
],
"best_of_n": [
0,
0,
0,
0
],
"reflect_close": [
0,
0,
... | 2025-11-02 | test | main | TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360 | 0 | eval_rl | 1 | 2025-11-02T16:16:14.141367 | TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o-eval_rl | |
"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 rearrange the given letters to form a valid English word that me(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:59973/v1","backend":"litellm","chat_template_applied":true,"generation_(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360"(...TRUNCATED) | [
false,
false,
false,
true
] | [
null,
"hled",
"hled",
"held"
] | "[{\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non(...TRUNCATED) | "[{\"evaluation_method\": \"response_processor\", \"reason\": \"no_extracted_answer\", \"extraction_(...TRUNCATED) | [
[],
[
false
],
[
false,
false,
false
],
[
true
]
] | [
[],
[
"hled"
],
[
"ledh",
"hled",
"hled"
],
[
"held"
]
] | "[[], [{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 17015, \"span_text\": \(...TRUNCATED) | "[[], [{\"is_correct\": false, \"final_answer\": \"hled\", \"errors\": \"not_a_valid_word\", \"lengt(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.25,"skill_co(...TRUNCATED) | 2025-11-02 | test | main | TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360 | 0 | eval_rl | 1 | 2025-11-02T16:16:14.141369 | TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o-eval_rl | |
"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 rearrange the given letters to form a valid English word that me(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:59973/v1","backend":"litellm","chat_template_applied":true,"generation_(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360"(...TRUNCATED) | [
true,
true,
true,
true
] | [
"main",
"main",
"main",
"main"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": true, \"final_answer\": \"main\", \"errors\": \"\", \"length\": 4}, {\"is_correct(...TRUNCATED) | [
[
true
],
[
true
],
[
true
],
[
true
]
] | [
[
"main"
],
[
"main"
],
[
"main"
],
[
"main"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1220, \"span_text\": \"main(...TRUNCATED) | "[[{\"is_correct\": true, \"final_answer\": \"main\", \"errors\": \"\", \"length\": 4}], [{\"is_corr(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":4,"pass_at_n":1,"percent_correct":1.0,"skill_cou(...TRUNCATED) | 2025-11-02 | test | main | TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360 | 0 | eval_rl | 1 | 2025-11-02T16:16:14.141371 | TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o-eval_rl | |
"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 rearrange the given letters to form a valid English word that me(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:59973/v1","backend":"litellm","chat_template_applied":true,"generation_(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360"(...TRUNCATED) | [
true,
true,
true,
true
] | [
"dora",
"dora",
"dora",
"dora"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": true, \"final_answer\": \"dora\", \"errors\": \"\", \"length\": 4}, {\"is_correct(...TRUNCATED) | [
[
true
],
[
true
],
[
true
],
[
true
]
] | [
[
"dora"
],
[
"dora"
],
[
"dora"
],
[
"dora"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1288, \"span_text\": \"dora(...TRUNCATED) | "[[{\"is_correct\": true, \"final_answer\": \"dora\", \"errors\": \"\", \"length\": 4}], [{\"is_corr(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":4,"pass_at_n":1,"percent_correct":1.0,"skill_cou(...TRUNCATED) | 2025-11-02 | test | main | TAUR-dev/M-rl_rlonly_AT_fixed-rl@checkpoint-step-360 | 0 | eval_rl | 1 | 2025-11-02T16:16:14.141373 | TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o-eval_rl |
End of preview. Expand in Data Studio
Experiment Tracker: FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o
Experiment Description: Evaluation experiment for task letter_countdown_4o from FinEval_16k_fulleval_AT_rlonly
Start Time: 2025-11-02T15:48:13.160888
Tracker Dataset: TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o__v1
Stages Completed
Total stages: 1
Models Created
Dataset Configurations
This tracker dataset contains the following configurations with immediate upload as stages complete:
Training Data (Complete Datasets)
Hyperparameters (Complete Configurations)
Logs (Stage-Specific)
Evaluation Results (Complete with Annotations)
Metadata
- experiment_metadata: Timeline and stage information
Usage
Load specific configurations with:
from datasets import load_dataset
# Load experiment metadata
metadata = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o__v1', 'experiment_metadata')
# Load complete training datasets
sft_data = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o__v1', 'training_data__sft')
sft_metadata = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o__v1', 'training_data__sft_metadata')
# Load complete configurations
sft_hyperparams = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o__v1', 'hyperparameters__sft')
rl_hyperparams = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o__v1', 'hyperparameters__rl')
# Load stage-specific logs
sft_logs = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o__v1', 'logs__sft')
rl_logs = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o__v1', 'logs__rl')
# Load evaluation results with annotations
sft_eval_results = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o__v1', 'evals_eval_sft')
rl_eval_results = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o__v1', 'evals_eval_rl')
Models
Registry
All models from this experiment are automatically registered in the SkillFactory Model Registry with:
- Complete training configuration (hyperparameters, datasets, methods)
- Experiment lineage (links back to this tracker dataset)
- Stage-specific metadata (SFT vs RL training details)
- Structured input data references (training datasets and configurations)
Registry entries follow the naming pattern: Model - FinEval_16k_fulleval_AT_rlonly-letter_countdown_4o - {stage_name} - {SFT/RL}
Generated by SkillFactory Experiment Management System All artifacts uploaded immediately as stages complete with perfect data provenance
- Downloads last month
- 2