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 | metadata null | 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.09k 1.11k | 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 606 | model_responses__best_of_n_atags__eval_evaluation_metadata stringlengths 292 547 | 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 934 | model_responses__best_of_n_atags__internal_answers__eval_evaluation_metadata stringlengths 2 609 | model_responses__best_of_n_atags__metrics dict | eval_date stringdate 2025-10-26 00:00:00 2025-10-26 00:00:00 | answer_index null | answer_key null | choices null | id null | difficulty null | domain null | evaluation_type null | expected_answer_format null | original_answer null | source stringlengths 4 4 | task_type null | variant null | acronym null | formed_acronym null | word_count null | words null | length int64 4 8 | letters stringlengths 4 8 | question_idx int64 0 299 | response_idx int64 0 3 | original_response_idx_in_16 int64 0 3 | original_response stringlengths 413 72.6k | budget_forced_continuations dict | model_responses__budget_forced listlengths 2 4 | model_responses__budget_forced__eval_is_correct listlengths 2 4 | model_responses__budget_forced__eval_extracted_answers listlengths 2 4 | model_responses__budget_forced__eval_extraction_metadata stringlengths 60 648 | model_responses__budget_forced__eval_evaluation_metadata stringlengths 146 656 | model_responses__budget_forced__internal_answers__eval_is_correct listlengths 2 4 ⌀ | model_responses__budget_forced__internal_answers__eval_extracted_answers listlengths 2 4 ⌀ | model_responses__budget_forced__internal_answers__eval_extraction_metadata stringlengths 202 119k ⌀ | model_responses__budget_forced__internal_answers__eval_evaluation_metadata stringlengths 119 73.5k ⌀ | model_responses__budget_forced__metrics dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"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\": \"kocktol\", \"source\": \"took\", \"length\": 7, \"task_config\": \"letter_countdown(...TRUNCATED) | test | null | ["To solve this problem, we need to find the longest possible word that can be formed using only the(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.12:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0903_rl_reflect__0epoch_3args__(...TRUNCATED) | [
false,
false,
false,
false
] | [
"kctlk",
null,
"cocktail",
"oktokol"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"kctlk\", \"errors\": \"not_a_valid_word\", \"length\":(...TRUNCATED) | [
[
false
],
[],
[
false
],
[
false
]
] | [
[
"kctlk"
],
[],
[
"cocktail"
],
[
"oktokol"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1821, \"span_text\": \"kctl(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"kctlk\", \"errors\": \"not_a_valid_word\", \"length\"(...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-26 | null | null | null | null | null | null | null | null | null | took | null | null | null | null | null | null | 7 | kocktol | 252 | 2 | 2 | "To solve this problem, we need to find the longest word that can be formed using only the given let(...TRUNCATED) | {"response":"To solve this problem, we need to find the longest word that can be formed using only t(...TRUNCATED) | ["To solve this problem, we need to find the longest word that can be formed using only the given le(...TRUNCATED) | [
false,
false,
false,
false
] | [
"cocktail",
"kots",
"kool",
"kool"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"cocktail\", \"errors\": \"length_constraint_violated, (...TRUNCATED) | [
[
false
],
[
false,
false
],
[
false,
false,
false
],
[
false,
false,
false
]
] | [
[
"cocktail"
],
[
"cocktail",
"kots"
],
[
"cocktail",
"kots",
"kool"
],
[
"cocktail",
"kots",
"kool"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1143, \"span_text\": \"cock(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"cocktail\", \"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) | |
"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\": \"moswskyt\", \"source\": \"most\", \"length\": 8, \"task_config\": \"letter_countdow(...TRUNCATED) | test | null | ["To solve this problem, we need to find the longest word that can be formed using only the letters (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.12:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0903_rl_reflect__0epoch_3args__(...TRUNCATED) | [
false,
false,
false,
false
] | [
"mowsyk",
"stems",
null,
"motky"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"mowsyk\", \"errors\": \"not_a_valid_word\", \"length\"(...TRUNCATED) | [
[
false
],
[
false
],
[],
[
false
]
] | [
[
"mowsyk"
],
[
"stems"
],
[],
[
"motky"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1113, \"span_text\": \"mows(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"mowsyk\", \"errors\": \"not_a_valid_word\", \"length\(...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-26 | null | null | null | null | null | null | null | null | null | most | null | null | null | null | null | null | 8 | moswskyt | 269 | 2 | 2 | "To solve this problem, we need to find the longest possible word that can be formed using only the (...TRUNCATED) | {"response":"To solve this problem, we need to find the longest possible word that can be formed usi(...TRUNCATED) | ["To solve this problem, we need to find the longest possible word that can be formed using only the(...TRUNCATED) | [
false,
false,
false,
false
] | [
null,
null,
null,
null
] | "[{\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\(...TRUNCATED) | "[{\"evaluation_method\": \"response_processor\", \"reason\": \"no_extracted_answer\", \"extraction_(...TRUNCATED) | null | null | null | null | {"flips_by":null,"flips_total":null,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"skill_count(...TRUNCATED) | |
"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\": \"seol\", \"source\": \"lose\", \"length\": 4, \"task_config\": \"letter_countdown_4o(...TRUNCATED) | test | null | ["To solve this problem, we need to find the longest word that can be formed using only the letters (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.12:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0903_rl_reflect__0epoch_3args__(...TRUNCATED) | [
true,
true,
true,
false
] | [
"sole",
"sole",
"sole",
null
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": true, \"final_answer\": \"sole\", \"errors\": \"\", \"length\": 4}, {\"is_correct(...TRUNCATED) | [
[
true
],
[
true
],
[
true
],
[]
] | [
[
"sole"
],
[
"sole"
],
[
"sole"
],
[]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 824, \"span_text\": \"sole\(...TRUNCATED) | "[[{\"is_correct\": true, \"final_answer\": \"sole\", \"errors\": \"\", \"length\": 4}], [{\"is_corr(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":3,"pass_at_n":1,"percent_correct":0.75,"skill_co(...TRUNCATED) | 2025-10-26 | null | null | null | null | null | null | null | null | null | lose | null | null | null | null | null | null | 4 | seol | 69 | 1 | 1 | "To solve this problem, we need to find the longest word that can be formed using only the letters p(...TRUNCATED) | {"response":"To solve this problem, we need to find the longest word that can be formed using only t(...TRUNCATED) | ["To solve this problem, we need to find the longest word that can be formed using only the letters (...TRUNCATED) | [
true,
false,
false,
false
] | [
"sole",
"seoul",
"osel",
"loes"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": true, \"final_answer\": \"sole\", \"errors\": \"\", \"length\": 4}, {\"is_correct(...TRUNCATED) | [
[
true
],
[
true,
false
],
[
true,
false,
false
],
[
true,
false,
false,
false,
false
]
] | [
[
"sole"
],
[
"sole",
"seoul"
],
[
"sole",
"seoul",
"osel"
],
[
"sole",
"seoul",
"osel",
"oesl",
"loes"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 814, \"span_text\": \"sole\(...TRUNCATED) | "[[{\"is_correct\": true, \"final_answer\": \"sole\", \"errors\": \"\", \"length\": 4}], [{\"is_corr(...TRUNCATED) | {"flips_by":[0,1,1,1],"flips_total":3,"num_correct":1,"pass_at_n":1,"percent_correct":0.25,"skill_co(...TRUNCATED) | |
"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\": \"sepon\", \"source\": \"open\", \"length\": 5, \"task_config\": \"letter_countdown_4(...TRUNCATED) | test | null | ["To solve this problem, we need to find the longest word that can be formed using only the given le(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.12:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0903_rl_reflect__0epoch_3args__(...TRUNCATED) | [
true,
true,
false,
false
] | [
"pons",
"enos",
null,
null
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": true, \"final_answer\": \"pons\", \"errors\": \"\", \"length\": 4}, {\"is_correct(...TRUNCATED) | [
[
true
],
[
true
],
[],
[]
] | [
[
"pons"
],
[
"enos"
],
[],
[]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 663, \"span_text\": \"pons\(...TRUNCATED) | "[[{\"is_correct\": true, \"final_answer\": \"pons\", \"errors\": \"\", \"length\": 4}], [{\"is_corr(...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-26 | null | null | null | null | null | null | null | null | null | open | null | null | null | null | null | null | 5 | sepon | 174 | 3 | 3 | "To solve this problem, we need to find the longest word that can be formed using only the given let(...TRUNCATED) | {"response":"To solve this problem, we need to find the longest word that can be formed using only t(...TRUNCATED) | ["To solve this problem, we need to find the longest word that can be formed using only the given le(...TRUNCATED) | [
false,
false,
false,
false
] | [
null,
null,
null,
null
] | "[{\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\(...TRUNCATED) | "[{\"evaluation_method\": \"response_processor\", \"reason\": \"no_extracted_answer\", \"extraction_(...TRUNCATED) | null | null | null | null | {"flips_by":null,"flips_total":null,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"skill_count(...TRUNCATED) | |
"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 | null | ["To solve this problem, we need to find the longest word that can be formed using only the letters (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.12:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0903_rl_reflect__0epoch_3args__(...TRUNCATED) | [
false,
false,
false,
false
] | [
"elf",
"elsf",
"eslf",
"elsf"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"elf\", \"errors\": \"length_constraint_violated\", \"l(...TRUNCATED) | [
[
false
],
[
false
],
[
false
],
[
false
]
] | [
[
"elf"
],
[
"elsf"
],
[
"eslf"
],
[
"elsf"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 588, \"span_text\": \"elf\"(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"elf\", \"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-26 | null | null | null | null | null | null | null | null | null | self | null | null | null | null | null | null | 4 | elsf | 5 | 1 | 1 | "To solve this problem, we need to find the longest word that can be formed using only the letters p(...TRUNCATED) | {"response":"To solve this problem, we need to find the longest word that can be formed using only t(...TRUNCATED) | ["To solve this problem, we need to find the longest word that can be formed using only the letters (...TRUNCATED) | [
false,
false,
false,
false
] | [
"elsf",
"elsf",
"elfs",
"elves"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"elsf\", \"errors\": \"not_a_valid_word\", \"length\": (...TRUNCATED) | [[false],[false,false],[false,false,false,false,false],[false,false,false,false,false,false,false,fa(...TRUNCATED) | [["elsf"],["elsf","elsf"],["elsf","elsf","fsle","efsl","elfs"],["elsf","elsf","fsle","efsl","elfs","(...TRUNCATED) | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 740, \"span_text\": \"elsf\(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"elsf\", \"errors\": \"not_a_valid_word\", \"length\":(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"skill_cou(...TRUNCATED) | |
"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\": \"elivg\", \"source\": \"give\", \"length\": 5, \"task_config\": \"letter_countdown_4(...TRUNCATED) | test | null | ["To solve this problem, we need to find the longest possible English word that can be formed using (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.12:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0903_rl_reflect__0epoch_3args__(...TRUNCATED) | [
false,
true,
false,
true
] | [
"level",
"evil",
"elivig",
"evil"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"level\", \"errors\": \"cannot_be_formed_from_letters\"(...TRUNCATED) | [
[
false
],
[
true
],
[
false
],
[
true
]
] | [
[
"level"
],
[
"evil"
],
[
"elivig"
],
[
"evil"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 804, \"span_text\": \"level(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"level\", \"errors\": \"cannot_be_formed_from_letters\(...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-26 | null | null | null | null | null | null | null | null | null | give | null | null | null | null | null | null | 5 | elivg | 165 | 3 | 3 | "To solve this problem, we need to find the longest word that can be formed using only the given let(...TRUNCATED) | {"response":"To solve this problem, we need to find the longest word that can be formed using only t(...TRUNCATED) | ["To solve this problem, we need to find the longest word that can be formed using only the given le(...TRUNCATED) | [
true,
false,
false,
false
] | [
"evil",
"level",
"view",
"elite"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": true, \"final_answer\": \"evil\", \"errors\": \"\", \"length\": 4}, {\"is_correct(...TRUNCATED) | [
[
true
],
[
true,
false
],
[
true,
false,
false
],
[
true,
false,
false,
false
]
] | [
[
"evil"
],
[
"evil",
"level"
],
[
"evil",
"level",
"view"
],
[
"evil",
"level",
"view",
"elite"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 679, \"span_text\": \"evil\(...TRUNCATED) | "[[{\"is_correct\": true, \"final_answer\": \"evil\", \"errors\": \"\", \"length\": 4}], [{\"is_corr(...TRUNCATED) | {"flips_by":[0,1,1,1],"flips_total":3,"num_correct":1,"pass_at_n":1,"percent_correct":0.25,"skill_co(...TRUNCATED) | |
"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\": \"nneo\", \"source\": \"none\", \"length\": 4, \"task_config\": \"letter_countdown_4o(...TRUNCATED) | test | null | ["To solve this problem, we need to find the longest word that can be formed using only the letters (...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.12:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0903_rl_reflect__0epoch_3args__(...TRUNCATED) | [
false,
true,
false,
false
] | [
"noen",
"neon",
"one",
null
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"noen\", \"errors\": \"not_a_valid_word\", \"length\": (...TRUNCATED) | [
[
false
],
[
true
],
[
false
],
[]
] | [
[
"noen"
],
[
"neon"
],
[
"one"
],
[]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 794, \"span_text\": \"noen\(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"noen\", \"errors\": \"not_a_valid_word\", \"length\":(...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-10-26 | null | null | null | null | null | null | null | null | null | none | null | null | null | null | null | null | 4 | nneo | 122 | 2 | 2 | "To solve this problem, we need to find the longest word that can be formed using only the given let(...TRUNCATED) | {"response":"To solve this problem, we need to find the longest word that can be formed using only t(...TRUNCATED) | ["To solve this problem, we need to find the longest word that can be formed using only the given le(...TRUNCATED) | [
false,
false,
false,
false
] | [
"one",
"neno",
"enao",
"enao"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"one\", \"errors\": \"length_constraint_violated\", \"l(...TRUNCATED) | [
[
false
],
[
false,
false
],
[
false,
false,
false
],
[
false,
false,
false,
false
]
] | [
[
"one"
],
[
"one",
"neno"
],
[
"one",
"neno",
"enao"
],
[
"one",
"neno",
"enao",
"enao"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 666, \"span_text\": \"one\"(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"one\", \"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) | |
"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\": \"rnaec\", \"source\": \"near\", \"length\": 5, \"task_config\": \"letter_countdown_4(...TRUNCATED) | test | null | ["To solve this problem, we need to find the longest word that can be formed using only the given le(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.12:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0903_rl_reflect__0epoch_3args__(...TRUNCATED) | [
true,
true,
true,
true
] | [
"race",
"care",
"race",
"race"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": true, \"final_answer\": \"race\", \"errors\": \"\", \"length\": 4}, {\"is_correct(...TRUNCATED) | [
[
true
],
[
true
],
[
true
],
[
true
]
] | [
[
"race"
],
[
"care"
],
[
"race"
],
[
"race"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1093, \"span_text\": \"race(...TRUNCATED) | "[[{\"is_correct\": true, \"final_answer\": \"race\", \"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-10-26 | null | null | null | null | null | null | null | null | null | near | null | null | null | null | null | null | 5 | rnaec | 181 | 1 | 1 | "To solve this problem, we need to find the longest word that can be formed using only the letters p(...TRUNCATED) | {"response":"To solve this problem, we need to find the longest word that can be formed using only t(...TRUNCATED) | ["To solve this problem, we need to find the longest word that can be formed using only the letters (...TRUNCATED) | [
true,
true,
false,
false
] | [
"care",
"crane",
"ranec",
"ranec"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": true, \"final_answer\": \"care\", \"errors\": \"\", \"length\": 4}, {\"is_correct(...TRUNCATED) | [[true],[true,true],[true,true,false,false,false,false,false,false,false,false,false,false,false,fal(...TRUNCATED) | [["care"],["care","crane"],["care","crane","ranec","ranec","ranec","ranec","ranec","ranec","ranec","(...TRUNCATED) | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 794, \"span_text\": \"care\(...TRUNCATED) | "[[{\"is_correct\": true, \"final_answer\": \"care\", \"errors\": \"\", \"length\": 4}], [{\"is_corr(...TRUNCATED) | {"flips_by":[0,0,1,1],"flips_total":2,"num_correct":2,"pass_at_n":1,"percent_correct":0.5,"skill_cou(...TRUNCATED) | |
"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\": \"dpro\", \"source\": \"drop\", \"length\": 4, \"task_config\": \"letter_countdown_4o(...TRUNCATED) | test | null | ["To solve this problem, we need to find the longest possible word that can be formed using only the(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.12:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0903_rl_reflect__0epoch_3args__(...TRUNCATED) | [
false,
false,
false,
false
] | [
"do",
null,
null,
"None"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"do\", \"errors\": \"length_constraint_violated\", \"le(...TRUNCATED) | [
[
false
],
[],
[],
[
false
]
] | [
[
"do"
],
[],
[],
[
"None"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 954, \"span_text\": \"do\",(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"do\", \"errors\": \"length_constraint_violated\", \"l(...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-26 | null | null | null | null | null | null | null | null | null | drop | null | null | null | null | null | null | 4 | dpro | 106 | 2 | 2 | "To solve this problem, we need to find the longest possible word that can be formed using only the (...TRUNCATED) | {"response":"To solve this problem, we need to find the longest possible word that can be formed usi(...TRUNCATED) | ["To solve this problem, we need to find the longest possible word that can be formed using only the(...TRUNCATED) | [
false,
false,
false,
false
] | [
null,
null,
null,
null
] | "[{\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\(...TRUNCATED) | "[{\"evaluation_method\": \"response_processor\", \"reason\": \"no_extracted_answer\", \"extraction_(...TRUNCATED) | null | null | null | null | {"flips_by":null,"flips_total":null,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"skill_count(...TRUNCATED) | |
"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\": \"ebtnedn\", \"source\": \"need\", \"length\": 7, \"task_config\": \"letter_countdown(...TRUNCATED) | test | null | ["To solve this problem, we need to follow these steps:\n\n1. Identify all unique letters in the inp(...TRUNCATED) | [
false,
false,
false,
false
] | [
"",
"",
"",
""
] | "{\"api_url\": \"http://10.32.37.12:9080/v1\", \"backend\": \"litellm\", \"chat_template_applied\": (...TRUNCATED) | "{\"backend\": \"litellm\", \"model_name\": \"hosted_vllm/TAUR-dev/M-0903_rl_reflect__0epoch_3args__(...TRUNCATED) | [
false,
false,
true,
false
] | [
null,
"team",
"need",
"event"
] | "[{\"extraction_type\": \"final\"}, {\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non(...TRUNCATED) | "[{\"evaluation_method\": \"response_processor\", \"reason\": \"no_extracted_answer\", \"extraction_(...TRUNCATED) | [
[],
[
false
],
[
true
],
[
false
]
] | [
[],
[
"team"
],
[
"need"
],
[
"event"
]
] | "[[], [{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1670, \"span_text\": \"(...TRUNCATED) | "[[], [{\"is_correct\": false, \"final_answer\": \"team\", \"errors\": \"cannot_be_formed_from_lette(...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-10-26 | null | null | null | null | null | null | null | null | null | need | null | null | null | null | null | null | 7 | ebtnedn | 235 | 1 | 1 | "To solve this problem, we need to find the longest possible word that can be formed using only the (...TRUNCATED) | {"response":"To solve this problem, we need to find the longest possible word that can be formed usi(...TRUNCATED) | ["To solve this problem, we need to find the longest possible word that can be formed using only the(...TRUNCATED) | [
false,
false,
false,
false
] | [
"team",
"tenet",
"team",
"team"
] | "[{\"extraction_type\": \"final\", \"total_spans_found\": 1, \"non_overlapping_spans\": 1, \"span_st(...TRUNCATED) | "[{\"is_correct\": false, \"final_answer\": \"team\", \"errors\": \"cannot_be_formed_from_letters\",(...TRUNCATED) | [
[
false
],
[
false,
false
],
[
false,
false,
false
],
[
false,
false,
false
]
] | [
[
"team"
],
[
"team",
"tenet"
],
[
"team",
"tenet",
"team"
],
[
"team",
"tenet",
"team"
]
] | "[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1670, \"span_text\": \"team(...TRUNCATED) | "[[{\"is_correct\": false, \"final_answer\": \"team\", \"errors\": \"cannot_be_formed_from_letters\"(...TRUNCATED) | {"flips_by":[0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"skill_cou(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 3