| {"id":"navigation_v3:d151bec1a2d3de8f66823541","state_id":"navigation_v3:d151bec1a2d3de8f66823541","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(0,3); walls=(1,3),(2,0),(2,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . A G\nrow 1: . . . #\nrow 2: # . # .\nrow 3: . . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 1, column 2).","west":"Move west to (row 0, column 1).","east":"Move east to (row 0, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"south":0.0,"west":0.0,"east":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 1), (0, 3), (1, 2), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,3],[2,0],[2,2],[3,3]],"position":[0,2],"goal":[0,3]},"pre_transform_start":[1,3],"d4_symmetry":5,"physical_state_hash":"d151bec1a2d3de8f66823541ac5af25dbd9e477ec025de3ff5b090eb468f5cad","canonical_source_id":"navigation_v3:d151bec1a2d3de8f66823541","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":1,"south":0,"west":0},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0.98,"1":0.01,"2":0,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:5c75e358046a992f39896317","state_id":"navigation_v3:5c75e358046a992f39896317","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(1,2); walls=(2,0),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . .\nrow 1: . A G .\nrow 2: # . . .\nrow 3: . . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 1).","north":"Move north to (row 0, column 1).","east":"Move east to (row 1, column 2).","west":"Move west to (row 1, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"south":0.0,"north":0.0,"east":1.0,"west":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((1, 3), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[2,0],[3,2]],"position":[1,1],"goal":[1,2]},"pre_transform_start":[1,2],"d4_symmetry":3,"physical_state_hash":"5c75e358046a992f39896317bdafa766bc97a157b213732e95e7b9275de1fd3e","canonical_source_id":"navigation_v3:5c75e358046a992f39896317","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0,"north":0,"east":1,"west":0},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":1,"1":0,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:101cd6fefd40b27c29bc0427","state_id":"navigation_v3:101cd6fefd40b27c29bc0427","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(1,1); walls=(0,1),(2,3),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . .\nrow 1: . G A .\nrow 2: . . . #\nrow 3: . . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 2).","west":"Move west to (row 1, column 1).","east":"Move east to (row 1, column 3).","north":"Move north to (row 0, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"west","solvable":true,"value":0},"gold_probs":{"action":{"south":0.0,"west":1.0,"east":0.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 1), (2, 3), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[2,3],[3,3]],"position":[1,2],"goal":[1,1]},"pre_transform_start":[2,1],"d4_symmetry":7,"physical_state_hash":"101cd6fefd40b27c29bc0427cc212f8c23bba99c1fd3e3fddf0ca9028e36edea","canonical_source_id":"navigation_v3:101cd6fefd40b27c29bc0427","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0,"north":0,"south":0,"west":1},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":1,"1":0,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:cc18ff90308c16e762a206fe","state_id":"navigation_v3:cc18ff90308c16e762a206fe","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(1,3); walls=(0,2),(0,3),(1,2),(2,2),(2,3),(3,0),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # #\nrow 1: . . # G\nrow 2: . A # #\nrow 3: # . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 3, column 1).","west":"Move west to (row 2, column 0).","north":"Move north to (row 1, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":false,"value":3},"gold_probs":{"action":{"south":0.3333333333333333,"west":0.3333333333333333,"north":0.3333333333333333},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (0, 3), (1, 0), (1, 1), (1, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[0,3],[1,2],[2,2],[2,3],[3,0],[3,3]],"position":[2,1],"goal":[1,3]},"pre_transform_start":[1,2],"d4_symmetry":7,"physical_state_hash":"cc18ff90308c16e762a206fe924cadb6a8ae93a6066e180d99185fac379ebe7f","canonical_source_id":"navigation_v3:cc18ff90308c16e762a206fe","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.95,"south":0.03,"west":0.02},"solvable":{"false":0.4,"true":0.6},"value":{"0":0.05,"1":0.51,"2":0.22,"3":0.22}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:acbc20df41dc4fd8c395be90","state_id":"navigation_v3:acbc20df41dc4fd8c395be90","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,3); goal=(2,3); walls=(0,3),(1,0),(2,0),(3,0),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . #\nrow 1: # . . .\nrow 2: # . . G\nrow 3: # # . A","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 3, column 2).","north":"Move north to (row 2, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"west":0.0,"north":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 3), (2, 0), (3, 0), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,3],[1,0],[2,0],[3,0],[3,1]],"position":[3,3],"goal":[2,3]},"pre_transform_start":[3,3],"d4_symmetry":0,"physical_state_hash":"acbc20df41dc4fd8c395be90a7ca4895fbb9b1082e95d95c826e0314c183c074","canonical_source_id":"navigation_v3:acbc20df41dc4fd8c395be90","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.01,"north":0.99},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0.95,"1":0.04,"2":0.01,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:9afca69b91330ff0a2e73710","state_id":"navigation_v3:9afca69b91330ff0a2e73710","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,0); goal=(3,1); walls=(0,1),(0,3),(1,1),(2,1),(2,2),(2,3),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . #\nrow 1: . # . .\nrow 2: A # # #\nrow 3: . G . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 3, column 0).","north":"Move north to (row 1, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"south":1.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 3), (1, 1), (1, 2), (1, 3), (2, 1), (3, 1), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,3],[1,1],[2,1],[2,2],[2,3],[3,3]],"position":[2,0],"goal":[3,1]},"pre_transform_start":[2,0],"d4_symmetry":0,"physical_state_hash":"9afca69b91330ff0a2e7371058214d2b0e05f98d3f6f67e60cfcd7d35adc66a7","canonical_source_id":"navigation_v3:9afca69b91330ff0a2e73710","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.11,"south":0.89},"solvable":{"false":0.28,"true":0.72},"value":{"0":0.14,"1":0.54,"2":0.24,"3":0.08}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:c917f44e6867438dca56997d","state_id":"navigation_v3:c917f44e6867438dca56997d","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,1); goal=(1,2); walls=(2,3),(3,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . A . .\nrow 1: . . G .\nrow 2: . . . #\nrow 3: . . # #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 1, column 1).","east":"Move east to (row 0, column 2).","west":"Move west to (row 0, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"south":0.5,"east":0.5,"west":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 2), (0, 3), (1, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[2,3],[3,2],[3,3]],"position":[0,1],"goal":[1,2]},"pre_transform_start":[1,3],"d4_symmetry":3,"physical_state_hash":"c917f44e6867438dca56997d5e5b4c6ebf23d6a8b203c62820a34e451b7eab81","canonical_source_id":"navigation_v3:c917f44e6867438dca56997d","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.43,"south":0.5700000000000001,"west":0},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0.92,"1":0.08,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:1064b25c34bb1bfcb0501edd","state_id":"navigation_v3:1064b25c34bb1bfcb0501edd","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(1,3); walls=(0,2),(1,0),(1,1),(2,0),(2,1),(2,2),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # .\nrow 1: # # . G\nrow 2: # # # .\nrow 3: # . A .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 3, column 3).","west":"Move west to (row 3, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":1},"gold_probs":{"action":{"east":1.0,"west":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 0), (1, 2), (2, 1), (2, 2), (3, 1), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[1,0],[1,1],[2,0],[2,1],[2,2],[3,0]],"position":[3,2],"goal":[1,3]},"pre_transform_start":[3,2],"d4_symmetry":0,"physical_state_hash":"1064b25c34bb1bfcb0501eddca85a91f64143326cf7b685dd599e370bad746c9","canonical_source_id":"navigation_v3:1064b25c34bb1bfcb0501edd","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.21,"east":0.79},"solvable":{"false":0.17000000000000004,"true":0.83},"value":{"0":0.1,"1":0.65,"2":0.18,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:4b09b243cb6e4a544837099e","state_id":"navigation_v3:4b09b243cb6e4a544837099e","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(2,0); walls=(0,3),(1,0),(1,1),(1,3),(2,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . #\nrow 1: # # . #\nrow 2: G # A .\nrow 3: . . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 3, column 2).","north":"Move north to (row 1, column 2).","east":"Move east to (row 2, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"south":1.0,"north":0.0,"east":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 2), (1, 1), (1, 2), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,3],[1,0],[1,1],[1,3],[2,1]],"position":[2,2],"goal":[2,0]},"pre_transform_start":[1,2],"d4_symmetry":6,"physical_state_hash":"4b09b243cb6e4a544837099e546caaf1a4ac2ea6387dc67e32e708d3a0b4289b","canonical_source_id":"navigation_v3:4b09b243cb6e4a544837099e","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.08,"south":0.42,"north":0.5},"solvable":{"false":0.21999999999999997,"true":0.78},"value":{"0":0.05,"1":0.66,"2":0.23,"3":0.06}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:b71c6129c1d2274e70b941de","state_id":"navigation_v3:b71c6129c1d2274e70b941de","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(1,2); walls=(1,3),(3,0),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . .\nrow 1: . A G #\nrow 2: . . . .\nrow 3: # # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 1, column 0).","south":"Move south to (row 2, column 1).","east":"Move east to (row 1, column 2).","north":"Move north to (row 0, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"west":0.0,"south":0.0,"east":1.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 1), (2, 3), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,3],[3,0],[3,1]],"position":[1,1],"goal":[1,2]},"pre_transform_start":[1,2],"d4_symmetry":4,"physical_state_hash":"b71c6129c1d2274e70b941de3ecd35c231bf535ff95cb394dcf2156be58ffedf","canonical_source_id":"navigation_v3:b71c6129c1d2274e70b941de","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0,"east":1,"south":0,"north":0},"solvable":{"false":0.020000000000000018,"true":0.98},"value":{"0":1,"1":0,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:80de97368cd9a545c3a05ef2","state_id":"navigation_v3:80de97368cd9a545c3a05ef2","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,0); goal=(3,2); walls=(0,2),(1,3),(2,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: A . # .\nrow 1: . . . #\nrow 2: . . # .\nrow 3: . . G #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 1, column 0).","east":"Move east to (row 0, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":1},"gold_probs":{"action":{"south":0.5,"east":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 1), (2, 0), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[1,3],[2,2],[3,3]],"position":[0,0],"goal":[3,2]},"pre_transform_start":[3,0],"d4_symmetry":6,"physical_state_hash":"80de97368cd9a545c3a05ef2c07e537020152bbf8d85586961ecde88e4eec336","canonical_source_id":"navigation_v3:80de97368cd9a545c3a05ef2","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.36,"south":0.64},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0,"1":0.51,"2":0.47,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:6bff4882db9f1ff81b4ffa0e","state_id":"navigation_v3:6bff4882db9f1ff81b4ffa0e","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(3,2); walls=(0,0),(0,1),(0,3),(2,0),(3,0),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # . #\nrow 1: . A . .\nrow 2: # . . .\nrow 3: # # G .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 1).","east":"Move east to (row 1, column 2).","west":"Move west to (row 1, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":1},"gold_probs":{"action":{"south":0.5,"east":0.5,"west":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 2), (0, 3), (1, 3), (3, 0), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[0,3],[2,0],[3,0],[3,1]],"position":[1,1],"goal":[3,2]},"pre_transform_start":[1,2],"d4_symmetry":4,"physical_state_hash":"6bff4882db9f1ff81b4ffa0e6f8b286691f8bf1b49a38d827a64c1fda7a86787","canonical_source_id":"navigation_v3:6bff4882db9f1ff81b4ffa0e","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.31,"south":0.68,"west":0.01},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0.04,"1":0.83,"2":0.11,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:8ca16405fcec473eada5f1fc","state_id":"navigation_v3:8ca16405fcec473eada5f1fc","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,3); goal=(2,1); walls=(0,0),(2,0),(2,3),(3,0),(3,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . A\nrow 1: . . . .\nrow 2: # G . #\nrow 3: # # # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 0, column 2).","south":"Move south to (row 1, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"west":0.5,"south":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (0, 1), (0, 2), (1, 0), (1, 3), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[2,0],[2,3],[3,0],[3,1],[3,2]],"position":[0,3],"goal":[2,1]},"pre_transform_start":[0,3],"d4_symmetry":5,"physical_state_hash":"8ca16405fcec473eada5f1fc9757bfd9ee2ebabdfe24b7cba22bce3d783bcea2","canonical_source_id":"navigation_v3:8ca16405fcec473eada5f1fc","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.53,"west":0.47},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.01,"1":0.92,"2":0.07,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:202e952b9d6225b16d653062","state_id":"navigation_v3:202e952b9d6225b16d653062","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(2,3); walls=(2,0),(2,2),(3,1),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . .\nrow 1: . A . .\nrow 2: # . # G\nrow 3: . # . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 1, column 2).","west":"Move west to (row 1, column 0).","south":"Move south to (row 2, column 1).","north":"Move north to (row 0, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":1},"gold_probs":{"action":{"east":1.0,"west":0.0,"south":0.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 1), (2, 0), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[2,0],[2,2],[3,1],[3,3]],"position":[1,1],"goal":[2,3]},"pre_transform_start":[2,1],"d4_symmetry":1,"physical_state_hash":"202e952b9d6225b16d653062dc5e902e4c5e9756f0aa193afb4118ee741520fe","canonical_source_id":"navigation_v3:202e952b9d6225b16d653062","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.04,"south":0.41,"west":0,"east":0.55},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0.03,"1":0.8,"2":0.14,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:09f65ce971847d416ffb9a52","state_id":"navigation_v3:09f65ce971847d416ffb9a52","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(3,1); walls=(0,1),(1,0),(1,1),(2,1),(2,2),(2,3),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . .\nrow 1: # # A .\nrow 2: . # # #\nrow 3: # G . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 0, column 2).","east":"Move east to (row 1, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"north":0.5,"east":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 1), (1, 2), (1, 3), (2, 0), (2, 1), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[1,0],[1,1],[2,1],[2,2],[2,3],[3,0]],"position":[1,2],"goal":[3,1]},"pre_transform_start":[2,1],"d4_symmetry":7,"physical_state_hash":"09f65ce971847d416ffb9a52989c04038a20863daf4b3bcd57bb2f472b1fb4f1","canonical_source_id":"navigation_v3:09f65ce971847d416ffb9a52","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.24,"east":0.76},"solvable":{"false":0.42000000000000004,"true":0.58},"value":{"0":0.04,"1":0.56,"2":0.23,"3":0.17}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:d391a162cd771da88550d9d7","state_id":"navigation_v3:d391a162cd771da88550d9d7","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,0); goal=(2,0); walls=(1,1),(1,3),(2,2),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: A . . .\nrow 1: . # . #\nrow 2: G . # .\nrow 3: . . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 1, column 0).","east":"Move east to (row 0, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"south":1.0,"east":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 2), (2, 0), (2, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,1],[1,3],[2,2],[3,2]],"position":[0,0],"goal":[2,0]},"pre_transform_start":[0,3],"d4_symmetry":3,"physical_state_hash":"d391a162cd771da88550d9d7ae84cebeafe85a2309f7bc23dd5895624ee8338c","canonical_source_id":"navigation_v3:d391a162cd771da88550d9d7","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.99,"east":0.01},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0.62,"1":0.32,"2":0.05,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:8871f04de07bbb78a928b403","state_id":"navigation_v3:8871f04de07bbb78a928b403","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(0,0); walls=(0,1),(0,3),(1,2),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: G # . #\nrow 1: . . # .\nrow 2: . . . A\nrow 3: . . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 1, column 3).","south":"Move south to (row 3, column 3).","west":"Move west to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"west","solvable":true,"value":1},"gold_probs":{"action":{"north":0.0,"south":0.0,"west":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 1), (0, 3), (1, 2), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,3],[1,2],[3,2]],"position":[2,3],"goal":[0,0]},"pre_transform_start":[2,0],"d4_symmetry":4,"physical_state_hash":"8871f04de07bbb78a928b4038f719e00def909392cc0e35aed8a3417c11703ad","canonical_source_id":"navigation_v3:8871f04de07bbb78a928b403","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.68,"north":0.31,"south":0.01},"solvable":{"false":0.09999999999999998,"true":0.9},"value":{"0":0,"1":0.38,"2":0.58,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:e5c1aebc7b75292da3255402","state_id":"navigation_v3:e5c1aebc7b75292da3255402","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,0); goal=(2,1); walls=(0,0),(0,2),(2,3),(3,0),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . # .\nrow 1: . . . .\nrow 2: A G . #\nrow 3: # . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 1, column 0).","east":"Move east to (row 2, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"north":0.0,"east":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (0, 3), (1, 3), (3, 0), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,2],[2,3],[3,0],[3,3]],"position":[2,0],"goal":[2,1]},"pre_transform_start":[3,1],"d4_symmetry":5,"physical_state_hash":"e5c1aebc7b75292da32554029653763248409e47ac97ebd6f395baba777ca6b1","canonical_source_id":"navigation_v3:e5c1aebc7b75292da3255402","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0,"east":1},"solvable":{"false":0.020000000000000018,"true":0.98},"value":{"0":1,"1":0,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:a22d2eb4098de60f9ccc32c3","state_id":"navigation_v3:a22d2eb4098de60f9ccc32c3","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(2,2); walls=(0,0),(0,1),(1,2),(2,3),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # . .\nrow 1: . . # .\nrow 2: . A G #\nrow 3: . # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 2, column 2).","north":"Move north to (row 1, column 1).","west":"Move west to (row 2, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"east":1.0,"north":0.0,"west":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 1), (1, 2), (2, 0), (2, 3), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[1,2],[2,3],[3,1]],"position":[2,1],"goal":[2,2]},"pre_transform_start":[1,2],"d4_symmetry":7,"physical_state_hash":"a22d2eb4098de60f9ccc32c37582500a7738904538394f34d3f813b80ecc0e7a","canonical_source_id":"navigation_v3:a22d2eb4098de60f9ccc32c3","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":1,"west":0,"north":0},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":1,"1":0,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:18463266d31ef681a28e7364","state_id":"navigation_v3:18463266d31ef681a28e7364","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,0); goal=(2,1); walls=(0,1),(0,3),(1,2),(2,2),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . #\nrow 1: A . # .\nrow 2: . G # .\nrow 3: # . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 0).","east":"Move east to (row 1, column 1).","north":"Move north to (row 0, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"south":0.5,"east":0.5,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (1, 2), (2, 2), (3, 1), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,3],[1,2],[2,2],[3,0]],"position":[1,0],"goal":[2,1]},"pre_transform_start":[3,2],"d4_symmetry":5,"physical_state_hash":"18463266d31ef681a28e73649601f7cef6e6259a9623ebc4c977dcc033a34139","canonical_source_id":"navigation_v3:18463266d31ef681a28e7364","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.24,"east":0.76,"north":0},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0.72,"1":0.22,"2":0.04,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:99e27b6927f362d222398d80","state_id":"navigation_v3:99e27b6927f362d222398d80","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,3); goal=(3,2); walls=(0,1),(0,2),(0,3),(3,0),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # # #\nrow 1: . . . A\nrow 2: . . . .\nrow 3: # . G #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 1, column 2).","south":"Move south to (row 2, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"west":0.5,"south":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 3), (3, 0), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,2],[0,3],[3,0],[3,3]],"position":[1,3],"goal":[3,2]},"pre_transform_start":[3,1],"d4_symmetry":7,"physical_state_hash":"99e27b6927f362d222398d8062b74f8185a22d433908cf02c74f78d406f8f847","canonical_source_id":"navigation_v3:99e27b6927f362d222398d80","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.3,"south":0.7},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0.05,"1":0.89,"2":0.06,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:8e3aace95bf97bce7e3a6366","state_id":"navigation_v3:8e3aace95bf97bce7e3a6366","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,0); goal=(0,3); walls=(0,0),(0,1),(1,2),(1,3),(2,1),(2,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # . G\nrow 1: . . # #\nrow 2: A # . #\nrow 3: . . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 1, column 0).","south":"Move south to (row 3, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":false,"value":3},"gold_probs":{"action":{"north":0.5,"south":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 1), (0, 2), (1, 1), (2, 0), (2, 2), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[1,2],[1,3],[2,1],[2,3]],"position":[2,0],"goal":[0,3]},"pre_transform_start":[2,3],"d4_symmetry":4,"physical_state_hash":"8e3aace95bf97bce7e3a6366af97a92f96b14aa0ee8e78b29dcd5cdc9c56d543","canonical_source_id":"navigation_v3:8e3aace95bf97bce7e3a6366","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.44,"north":0.56},"solvable":{"false":0.17000000000000004,"true":0.83},"value":{"0":0,"1":0.32,"2":0.6,"3":0.08}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:4ae2683248fe93cfcdb608ee","state_id":"navigation_v3:4ae2683248fe93cfcdb608ee","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(1,1); walls=(0,0),(0,1),(0,2),(1,0),(1,3),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # # .\nrow 1: # G . #\nrow 2: . . A .\nrow 3: # . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 3, column 2).","east":"Move east to (row 2, column 3).","west":"Move west to (row 2, column 1).","north":"Move north to (row 1, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"south":0.0,"east":0.0,"west":0.5,"north":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (0, 1), (0, 2), (1, 0), (1, 3), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[0,2],[1,0],[1,3],[3,0]],"position":[2,2],"goal":[1,1]},"pre_transform_start":[1,2],"d4_symmetry":1,"physical_state_hash":"4ae2683248fe93cfcdb608ee58f13a3e48255d2da4befd371adbe074715a10d6","canonical_source_id":"navigation_v3:4ae2683248fe93cfcdb608ee","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0,"north":0.67,"south":0.01,"west":0.32},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0.79,"1":0.18,"2":0.02,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:6632b47af673cc641106a61c","state_id":"navigation_v3:6632b47af673cc641106a61c","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(3,1); walls=(0,1),(1,3),(2,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . .\nrow 1: . A . #\nrow 2: . . # .\nrow 3: . G . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 1).","east":"Move east to (row 1, column 2).","west":"Move west to (row 1, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"south":1.0,"east":0.0,"west":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 2), (2, 3), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[1,3],[2,2]],"position":[1,1],"goal":[3,1]},"pre_transform_start":[1,2],"d4_symmetry":3,"physical_state_hash":"6632b47af673cc641106a61cb6e4797d086f3f3936aaad9f461ced3c693cdb57","canonical_source_id":"navigation_v3:6632b47af673cc641106a61c","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.94,"west":0.03,"east":0.03},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0.81,"1":0.16,"2":0.02,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:1a4f261e0d46f14fddb1ebe4","state_id":"navigation_v3:1a4f261e0d46f14fddb1ebe4","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,1); goal=(1,3); walls=(0,0),(0,3),(1,2),(2,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . #\nrow 1: . . # G\nrow 2: . . . #\nrow 3: . A . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 3, column 2).","north":"Move north to (row 2, column 1).","west":"Move west to (row 3, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"east":0.3333333333333333,"north":0.3333333333333333,"west":0.3333333333333333},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (1, 1), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,3],[1,2],[2,3]],"position":[3,1],"goal":[1,3]},"pre_transform_start":[0,2],"d4_symmetry":2,"physical_state_hash":"1a4f261e0d46f14fddb1ebe47eec324708daaa532eb0cd518332d135139dded5","canonical_source_id":"navigation_v3:1a4f261e0d46f14fddb1ebe4","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.76,"west":0.01,"east":0.23},"solvable":{"false":0.15000000000000002,"true":0.85},"value":{"0":0.01,"1":0.54,"2":0.38,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:5b4a3175c074432c6f92d6d4","state_id":"navigation_v3:5b4a3175c074432c6f92d6d4","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,3); goal=(2,3); walls=(0,0),(1,0),(1,1),(1,2),(2,0),(2,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . .\nrow 1: # # # A\nrow 2: # # . G\nrow 3: . . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 0, column 3).","south":"Move south to (row 2, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"north":0.0,"south":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 0), (1, 2), (2, 1), (2, 2), (3, 1), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[1,0],[1,1],[1,2],[2,0],[2,1],[3,2]],"position":[1,3],"goal":[2,3]},"pre_transform_start":[2,3],"d4_symmetry":6,"physical_state_hash":"5b4a3175c074432c6f92d6d40094ca738773b88ae1027e1d081f596afdab6a1c","canonical_source_id":"navigation_v3:5b4a3175c074432c6f92d6d4","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":1,"north":0},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0.95,"1":0.03,"2":0.01,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:dc4a43f534f24b4a9769505b","state_id":"navigation_v3:dc4a43f534f24b4a9769505b","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,1); goal=(2,2); walls=(0,2),(0,3),(1,0),(3,0),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # #\nrow 1: # . . .\nrow 2: . . G .\nrow 3: # A . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 2, column 1).","east":"Move east to (row 3, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"north":0.5,"east":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (0, 3), (1, 3), (3, 0), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[0,3],[1,0],[3,0],[3,3]],"position":[3,1],"goal":[2,2]},"pre_transform_start":[3,2],"d4_symmetry":4,"physical_state_hash":"dc4a43f534f24b4a9769505b3089ce0ebe153259e404714fd7326c0e0b4bc21b","canonical_source_id":"navigation_v3:dc4a43f534f24b4a9769505b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.65,"east":0.35},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0.79,"1":0.2,"2":0.01,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:b9d1979e90e7e761eb672928","state_id":"navigation_v3:b9d1979e90e7e761eb672928","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,3); goal=(1,1); walls=(0,1),(1,0),(1,2),(2,0),(2,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . A\nrow 1: # G # .\nrow 2: # # . .\nrow 3: . . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 0, column 2).","south":"Move south to (row 1, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":false,"value":3},"gold_probs":{"action":{"west":0.5,"south":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 1), (0, 2), (1, 0), (1, 2), (2, 1), (2, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[1,0],[1,2],[2,0],[2,1],[3,2]],"position":[0,3],"goal":[1,1]},"pre_transform_start":[0,3],"d4_symmetry":0,"physical_state_hash":"b9d1979e90e7e761eb672928ca3da53e5005843a36212d4c97ce3b0e23d0bb6b","canonical_source_id":"navigation_v3:b9d1979e90e7e761eb672928","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.52,"west":0.48},"solvable":{"false":0.36,"true":0.64},"value":{"0":0.04,"1":0.45,"2":0.32,"3":0.19}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:b5c916a776da4a644f89e809","state_id":"navigation_v3:b5c916a776da4a644f89e809","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(0,2); walls=(1,0),(1,1),(1,2),(1,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . G .\nrow 1: # # # #\nrow 2: . A . .\nrow 3: . . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 2, column 0).","south":"Move south to (row 3, column 1).","east":"Move east to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"west":0.3333333333333333,"south":0.3333333333333333,"east":0.3333333333333333},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 0), (1, 1), (1, 2), (1, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,0],[1,1],[1,2],[1,3]],"position":[2,1],"goal":[0,2]},"pre_transform_start":[2,1],"d4_symmetry":0,"physical_state_hash":"b5c916a776da4a644f89e809909b8c77013f833d29a3e6b0a2276072dedb72d8","canonical_source_id":"navigation_v3:b5c916a776da4a644f89e809","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.48,"south":0.42,"west":0.1},"solvable":{"false":0.45999999999999996,"true":0.54},"value":{"0":0.02,"1":0.48,"2":0.35,"3":0.15}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:7cac63735a136b0404c646da","state_id":"navigation_v3:7cac63735a136b0404c646da","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,0); goal=(3,3); walls=(1,1),(1,2),(2,0),(2,3),(3,0),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: A . . .\nrow 1: . # # .\nrow 2: # . . #\nrow 3: # # . G","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 0, column 1).","south":"Move south to (row 1, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"east":0.5,"south":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 1), (1, 2), (2, 0), (2, 2), (3, 0), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,1],[1,2],[2,0],[2,3],[3,0],[3,1]],"position":[0,0],"goal":[3,3]},"pre_transform_start":[3,0],"d4_symmetry":1,"physical_state_hash":"7cac63735a136b0404c646dac01cd98221ffd7df00c4154711cce37f62b935e5","canonical_source_id":"navigation_v3:7cac63735a136b0404c646da","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.74,"south":0.26},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0,"1":0.18,"2":0.78,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:40e08d831e4f3f4930a3b298","state_id":"navigation_v3:40e08d831e4f3f4930a3b298","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(3,1); walls=(0,2),(1,0),(1,1),(2,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # .\nrow 1: # # . .\nrow 2: . . # A\nrow 3: . G . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 1, column 3).","south":"Move south to (row 3, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"north":0.0,"south":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 2), (2, 0), (2, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[1,0],[1,1],[2,2]],"position":[2,3],"goal":[3,1]},"pre_transform_start":[1,3],"d4_symmetry":6,"physical_state_hash":"40e08d831e4f3f4930a3b298157719bc6867ea05bf288023a88fc9dff0215aa8","canonical_source_id":"navigation_v3:40e08d831e4f3f4930a3b298","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.22,"south":0.78},"solvable":{"false":0.12,"true":0.88},"value":{"0":0.03,"1":0.68,"2":0.25,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:ef65f7d9c6a454000923b615","state_id":"navigation_v3:ef65f7d9c6a454000923b615","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,0); goal=(3,2); walls=(0,3),(2,1),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . #\nrow 1: . . . .\nrow 2: . # . .\nrow 3: A . G #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 2, column 0).","east":"Move east to (row 3, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"north":0.0,"east":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 2), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,3],[2,1],[3,3]],"position":[3,0],"goal":[3,2]},"pre_transform_start":[3,3],"d4_symmetry":1,"physical_state_hash":"ef65f7d9c6a454000923b6151e6b4b7734202c2c995e7a736fedd7934dad1ef7","canonical_source_id":"navigation_v3:ef65f7d9c6a454000923b615","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.02,"east":0.98},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0.96,"1":0.03,"2":0.01,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:26e65086f2e929b3dab81be5","state_id":"navigation_v3:26e65086f2e929b3dab81be5","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(2,2); walls=(0,0),(1,0),(1,3),(2,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . .\nrow 1: # A . #\nrow 2: . # G .\nrow 3: . . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 0, column 1).","east":"Move east to (row 1, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"north":0.0,"east":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 1), (1, 2), (2, 0), (2, 3), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[1,0],[1,3],[2,1],[3,2]],"position":[1,1],"goal":[2,2]},"pre_transform_start":[1,1],"d4_symmetry":0,"physical_state_hash":"26e65086f2e929b3dab81be51dace674a510aa115cf8fe9ac013859c7f8f3f53","canonical_source_id":"navigation_v3:26e65086f2e929b3dab81be5","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.03,"east":0.97},"solvable":{"false":0.14,"true":0.86},"value":{"0":0.81,"1":0.14,"2":0.03,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:28590242455ca788f65f55e2","state_id":"navigation_v3:28590242455ca788f65f55e2","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,0); goal=(3,2); walls=(0,0),(0,1),(2,1),(2,2),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # . .\nrow 1: . . . .\nrow 2: A # # .\nrow 3: . # G .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 3, column 0).","north":"Move north to (row 1, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":2},"gold_probs":{"action":{"south":0.0,"north":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":0.0,"2":1.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 2), (1, 1), (1, 2), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[2,1],[2,2],[3,1]],"position":[2,0],"goal":[3,2]},"pre_transform_start":[3,1],"d4_symmetry":5,"physical_state_hash":"28590242455ca788f65f55e29ccac5e86b934ecbd70e8801657d5bc277ea8831","canonical_source_id":"navigation_v3:28590242455ca788f65f55e2","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.67,"south":0.33},"solvable":{"false":0.13,"true":0.87},"value":{"0":0.02,"1":0.63,"2":0.29,"3":0.06}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:c6f407921c8269d4f6b2dc64","state_id":"navigation_v3:c6f407921c8269d4f6b2dc64","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(0,3); walls=(2,1),(2,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . G\nrow 1: . . . .\nrow 2: . # . #\nrow 3: . . A .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 3, column 1).","east":"Move east to (row 3, column 3).","north":"Move north to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"west":0.0,"east":0.0,"north":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 2), (2, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[2,1],[2,3]],"position":[3,2],"goal":[0,3]},"pre_transform_start":[1,3],"d4_symmetry":1,"physical_state_hash":"c6f407921c8269d4f6b2dc6474fb5d9448dfb0010cc6c2e2e9cc2f11bdd75a8b","canonical_source_id":"navigation_v3:c6f407921c8269d4f6b2dc64","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.19,"west":0.03,"north":0.78},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0.01,"1":0.54,"2":0.41,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:311bda532d5748fa2ebd956f","state_id":"navigation_v3:311bda532d5748fa2ebd956f","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,3); goal=(3,2); walls=(2,2),(2,3),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . A\nrow 1: . . . .\nrow 2: . . # #\nrow 3: . # G .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 1, column 3).","west":"Move west to (row 0, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":false,"value":3},"gold_probs":{"action":{"south":0.5,"west":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 2), (1, 0), (1, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[2,2],[2,3],[3,1]],"position":[0,3],"goal":[3,2]},"pre_transform_start":[3,0],"d4_symmetry":7,"physical_state_hash":"311bda532d5748fa2ebd956f9ce6e00d4bfab776f28678c1093f888df344ed9e","canonical_source_id":"navigation_v3:311bda532d5748fa2ebd956f","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.79,"west":0.21},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0,"1":0.44,"2":0.51,"3":0.05}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:c6418737d08393d7dc8dc891","state_id":"navigation_v3:c6418737d08393d7dc8dc891","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,3); goal=(2,1); walls=(0,0),(0,1),(1,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # . .\nrow 1: # . . .\nrow 2: . G . .\nrow 3: . . . A","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 3, column 2).","north":"Move north to (row 2, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"west":0.5,"north":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 2), (0, 3), (1, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[1,0]],"position":[3,3],"goal":[2,1]},"pre_transform_start":[0,3],"d4_symmetry":1,"physical_state_hash":"c6418737d08393d7dc8dc891a0aeab64d5860d1601f235e869621075bc6983af","canonical_source_id":"navigation_v3:c6418737d08393d7dc8dc891","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.55,"north":0.45},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0.01,"1":0.9,"2":0.09,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:d824900ade618f92a1e9bd67","state_id":"navigation_v3:d824900ade618f92a1e9bd67","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,3); goal=(0,2); walls=(0,0),(0,1),(1,0),(3,0),(3,1),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # G A\nrow 1: # . . .\nrow 2: . . . .\nrow 3: # # . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 0, column 2).","south":"Move south to (row 1, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"west","solvable":true,"value":0},"gold_probs":{"action":{"west":1.0,"south":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 2), (0, 3), (1, 3), (3, 0), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[1,0],[3,0],[3,1],[3,3]],"position":[0,3],"goal":[0,2]},"pre_transform_start":[3,0],"d4_symmetry":2,"physical_state_hash":"d824900ade618f92a1e9bd6763a35488153b5f47205360ed6dba038df63e45f2","canonical_source_id":"navigation_v3:d824900ade618f92a1e9bd67","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.01,"west":0.99},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0.94,"1":0.04,"2":0.01,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:a7840c19a3134f7603159d1a","state_id":"navigation_v3:a7840c19a3134f7603159d1a","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,0); goal=(2,3); walls=(0,2),(1,2),(2,2),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # .\nrow 1: A . # .\nrow 2: . . # G\nrow 3: . . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 1, column 1).","south":"Move south to (row 2, column 0).","north":"Move north to (row 0, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"east":0.3333333333333333,"south":0.3333333333333333,"north":0.3333333333333333},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","north","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 0), (1, 1), (1, 2), (1, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[1,2],[2,2],[3,2]],"position":[1,0],"goal":[2,3]},"pre_transform_start":[3,1],"d4_symmetry":1,"physical_state_hash":"a7840c19a3134f7603159d1a6117c6080763f1e180d6286f613d136caf039ba7","canonical_source_id":"navigation_v3:a7840c19a3134f7603159d1a","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.02,"east":0.66,"south":0.32},"solvable":{"false":0.35,"true":0.65},"value":{"0":0.01,"1":0.34,"2":0.38,"3":0.27}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:26825fa6bf04b63f1b4a325a","state_id":"navigation_v3:26825fa6bf04b63f1b4a325a","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(0,1); walls=(0,2),(1,0),(1,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . G # .\nrow 1: # # . .\nrow 2: . A . .\nrow 3: . . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 2, column 0).","south":"Move south to (row 3, column 1).","east":"Move east to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"west":0.3333333333333333,"south":0.3333333333333333,"east":0.3333333333333333},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 2), (1, 0), (1, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[1,0],[1,1]],"position":[2,1],"goal":[0,1]},"pre_transform_start":[2,1],"d4_symmetry":5,"physical_state_hash":"26825fa6bf04b63f1b4a325ad8c5ddc7ebc10e035f87a9a1f040b35ef46389eb","canonical_source_id":"navigation_v3:26825fa6bf04b63f1b4a325a","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.31,"west":0.27,"east":0.42},"solvable":{"false":0.31000000000000005,"true":0.69},"value":{"0":0.03,"1":0.58,"2":0.3,"3":0.09}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:3d6fca0ff1e1620e11d5498a","state_id":"navigation_v3:3d6fca0ff1e1620e11d5498a","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,1); goal=(0,0); walls=(0,2),(0,3),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: G A # #\nrow 1: . . . .\nrow 2: . . . .\nrow 3: . # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 0, column 0).","south":"Move south to (row 1, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"west","solvable":true,"value":0},"gold_probs":{"action":{"west":1.0,"south":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 2), (0, 3), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[0,3],[3,1]],"position":[0,1],"goal":[0,0]},"pre_transform_start":[3,1],"d4_symmetry":6,"physical_state_hash":"3d6fca0ff1e1620e11d5498a24d6151138c66060283ace7a48ac3e1a05dd4c40","canonical_source_id":"navigation_v3:3d6fca0ff1e1620e11d5498a","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":1,"south":0},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0.99,"1":0.01,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:7ec426c9cb84aca11f6165f1","state_id":"navigation_v3:7ec426c9cb84aca11f6165f1","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(0,0); walls=(1,0),(2,1),(2,3),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: G . . .\nrow 1: # . A .\nrow 2: . # . #\nrow 3: # . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 0, column 2).","south":"Move south to (row 2, column 2).","west":"Move west to (row 1, column 1).","east":"Move east to (row 1, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"north":0.5,"south":0.0,"west":0.5,"east":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 1), (0, 3), (1, 2), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,0],[2,1],[2,3],[3,0]],"position":[1,2],"goal":[0,0]},"pre_transform_start":[2,2],"d4_symmetry":3,"physical_state_hash":"7ec426c9cb84aca11f6165f17f603a9dbcd4504faf95c98f7fea92c72936be4b","canonical_source_id":"navigation_v3:7ec426c9cb84aca11f6165f1","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.01,"south":0.01,"west":0.4,"north":0.58},"solvable":{"false":0.13,"true":0.87},"value":{"0":0.14,"1":0.73,"2":0.11,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:2abd6c389f3472a591235895","state_id":"navigation_v3:2abd6c389f3472a591235895","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,0); goal=(3,3); walls=(1,1),(1,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . .\nrow 1: A # . #\nrow 2: . . . .\nrow 3: . . . G","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 0, column 0).","south":"Move south to (row 2, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"north":0.0,"south":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 2), (2, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,1],[1,3]],"position":[1,0],"goal":[3,3]},"pre_transform_start":[3,2],"d4_symmetry":5,"physical_state_hash":"2abd6c389f3472a591235895a382d98d07de48a4a09d42e718074bd3e4ebdbd9","canonical_source_id":"navigation_v3:2abd6c389f3472a591235895","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.04,"south":0.96},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0,"1":0.37,"2":0.62,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:466bfa5a7feb94ac092336f1","state_id":"navigation_v3:466bfa5a7feb94ac092336f1","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(3,2); walls=(0,1),(0,2),(1,0),(1,3),(2,0),(2,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # # .\nrow 1: # . . #\nrow 2: # # A .\nrow 3: . . G .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 3, column 2).","east":"Move east to (row 2, column 3).","north":"Move north to (row 1, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"south":1.0,"east":0.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 2), (1, 3), (2, 0), (2, 3), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,2],[1,0],[1,3],[2,0],[2,1]],"position":[2,2],"goal":[3,2]},"pre_transform_start":[1,2],"d4_symmetry":1,"physical_state_hash":"466bfa5a7feb94ac092336f154172894dba855dde2bade8c9186de7d65642e3e","canonical_source_id":"navigation_v3:466bfa5a7feb94ac092336f1","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.04,"south":0.94,"north":0.02},"solvable":{"false":0.14,"true":0.86},"value":{"0":0.75,"1":0.17,"2":0.05,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:318755e25487b4c319c4d6b4","state_id":"navigation_v3:318755e25487b4c319c4d6b4","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(1,2); walls=(2,0),(2,1),(2,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . A .\nrow 1: . . G .\nrow 2: # # # .\nrow 3: . . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 0, column 1).","south":"Move south to (row 1, column 2).","east":"Move east to (row 0, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"west":0.0,"south":1.0,"east":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 3), (1, 2), (2, 2), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[2,0],[2,1],[2,2],[3,3]],"position":[0,2],"goal":[1,2]},"pre_transform_start":[2,0],"d4_symmetry":7,"physical_state_hash":"318755e25487b4c319c4d6b40736b21ff6de50db26013285ded1d322d660b104","canonical_source_id":"navigation_v3:318755e25487b4c319c4d6b4","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0,"south":1,"west":0},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":1,"1":0,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:b5bb0c737cc6487c16bfd599","state_id":"navigation_v3:b5bb0c737cc6487c16bfd599","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,0); goal=(1,3); walls=(0,3),(1,1),(2,0),(2,3),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: A . . #\nrow 1: . # . G\nrow 2: # . . #\nrow 3: . # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 0, column 1).","south":"Move south to (row 1, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":1},"gold_probs":{"action":{"east":1.0,"south":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (2, 1), (2, 3), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,3],[1,1],[2,0],[2,3],[3,1]],"position":[0,0],"goal":[1,3]},"pre_transform_start":[3,0],"d4_symmetry":6,"physical_state_hash":"b5bb0c737cc6487c16bfd599062a3ce2e4732792ff68bf0a5a8259a59395455a","canonical_source_id":"navigation_v3:b5bb0c737cc6487c16bfd599","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.19,"east":0.81},"solvable":{"false":0.09999999999999998,"true":0.9},"value":{"0":0.01,"1":0.7,"2":0.24,"3":0.05}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:34cb2164aa5a3a2a753d21c0","state_id":"navigation_v3:34cb2164aa5a3a2a753d21c0","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,0); goal=(0,3); walls=(0,0),(0,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # . G\nrow 1: A . . .\nrow 2: . . . .\nrow 3: . . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 1, column 1).","south":"Move south to (row 2, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":1},"gold_probs":{"action":{"east":1.0,"south":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 2), (0, 3), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[3,2]],"position":[1,0],"goal":[0,3]},"pre_transform_start":[2,3],"d4_symmetry":2,"physical_state_hash":"34cb2164aa5a3a2a753d21c0139379a488e63423a12296e3df7f04f9d8af6cf7","canonical_source_id":"navigation_v3:34cb2164aa5a3a2a753d21c0","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.92,"south":0.08},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0.01,"1":0.75,"2":0.22,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:039d233a6798414462fd604c","state_id":"navigation_v3:039d233a6798414462fd604c","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(0,0); walls=(0,2),(2,3),(3,0),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: G . # .\nrow 1: . . . .\nrow 2: . . A #\nrow 3: # # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 1, column 2).","south":"Move south to (row 3, column 2).","west":"Move west to (row 2, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"north":0.5,"south":0.0,"west":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 2), (2, 3), (3, 0), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[2,3],[3,0],[3,1]],"position":[2,2],"goal":[0,0]},"pre_transform_start":[2,1],"d4_symmetry":3,"physical_state_hash":"039d233a6798414462fd604c6cee83b96541969641e6a27a4fc2421794c7b4ef","canonical_source_id":"navigation_v3:039d233a6798414462fd604c","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.37,"north":0.62,"south":0.01},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.01,"1":0.88,"2":0.1,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:8635bdabbbceba8f5ea40c96","state_id":"navigation_v3:8635bdabbbceba8f5ea40c96","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,0); goal=(2,0); walls=(0,0),(0,1),(0,3),(1,1),(2,1),(2,2),(2,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # . #\nrow 1: . # . .\nrow 2: G # # #\nrow 3: A . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 3, column 1).","north":"Move north to (row 2, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"east":0.0,"north":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 3), (1, 1), (1, 2), (1, 3), (2, 1), (3, 1), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[0,3],[1,1],[2,1],[2,2],[2,3]],"position":[3,0],"goal":[2,0]},"pre_transform_start":[3,0],"d4_symmetry":5,"physical_state_hash":"8635bdabbbceba8f5ea40c965eb056034d24f158084ecd094355a7e8b97858b3","canonical_source_id":"navigation_v3:8635bdabbbceba8f5ea40c96","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.99,"east":0.01},"solvable":{"false":0.22999999999999998,"true":0.77},"value":{"0":0.75,"1":0.16,"2":0.06,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:642ff7cd16aa32837295f73b","state_id":"navigation_v3:642ff7cd16aa32837295f73b","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,0); goal=(3,2); walls=(0,1),(0,2),(1,1),(1,2),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # # .\nrow 1: . # # .\nrow 2: A . . .\nrow 3: # . G .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 2, column 1).","north":"Move north to (row 1, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":1},"gold_probs":{"action":{"east":1.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 3), (2, 1), (2, 2), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,2],[1,1],[1,2],[3,0]],"position":[2,0],"goal":[3,2]},"pre_transform_start":[1,0],"d4_symmetry":6,"physical_state_hash":"642ff7cd16aa32837295f73b697c3d54fbd7eee73d28fb6fef3fe0a5c70c58d6","canonical_source_id":"navigation_v3:642ff7cd16aa32837295f73b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.03,"east":0.97},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0.04,"1":0.85,"2":0.09,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:b524bff7a28d5342b2957ba4","state_id":"navigation_v3:b524bff7a28d5342b2957ba4","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(1,3); walls=(0,0),(0,1),(1,0),(2,0),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # . .\nrow 1: # . . G\nrow 2: # . . A\nrow 3: . . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 2, column 2).","north":"Move north to (row 1, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"west":0.0,"north":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 3), (2, 0), (3, 0), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[1,0],[2,0],[3,3]],"position":[2,3],"goal":[1,3]},"pre_transform_start":[1,3],"d4_symmetry":6,"physical_state_hash":"b524bff7a28d5342b2957ba40b1d088bdc0711a3e26a3a19be394b9c4f87477e","canonical_source_id":"navigation_v3:b524bff7a28d5342b2957ba4","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0,"north":1},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.99,"1":0.01,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:ecb63bd8220e08b0af1e388d","state_id":"navigation_v3:ecb63bd8220e08b0af1e388d","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(3,3); walls=(0,3),(1,3),(2,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . #\nrow 1: . . A #\nrow 2: # . . .\nrow 3: . . . G","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 1, column 1).","south":"Move south to (row 2, column 2).","north":"Move north to (row 0, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"west":0.0,"south":1.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 2), (0, 3), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,3],[1,3],[2,0]],"position":[1,2],"goal":[3,3]},"pre_transform_start":[2,2],"d4_symmetry":3,"physical_state_hash":"ecb63bd8220e08b0af1e388d05a12416f6f504725bd646d3c72445d9ba8e4949","canonical_source_id":"navigation_v3:ecb63bd8220e08b0af1e388d","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.98,"west":0.02,"north":0},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.05,"1":0.85,"2":0.09,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:ed401fd0445ad9bdd71efc0e","state_id":"navigation_v3:ed401fd0445ad9bdd71efc0e","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(1,3); walls=(0,2),(0,3),(1,1),(2,0),(2,1),(3,0),(3,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # #\nrow 1: . # A G\nrow 2: # # . .\nrow 3: # # # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 1, column 3).","south":"Move south to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"east":1.0,"south":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 0), (1, 3), (2, 1), (2, 2), (2, 3), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[0,3],[1,1],[2,0],[2,1],[3,0],[3,1],[3,2]],"position":[1,2],"goal":[1,3]},"pre_transform_start":[1,1],"d4_symmetry":1,"physical_state_hash":"ed401fd0445ad9bdd71efc0ed131d84da1ff872e9623ea13253858ec9bc0cc1d","canonical_source_id":"navigation_v3:ed401fd0445ad9bdd71efc0e","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0,"east":1},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0.98,"1":0.01,"2":0,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:56c128056227269524510f91","state_id":"navigation_v3:56c128056227269524510f91","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(1,0); walls=(0,0),(0,2),(1,1),(1,2),(1,3),(2,1),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . # .\nrow 1: G # # #\nrow 2: . # . A\nrow 3: . # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 3, column 3).","west":"Move west to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":false,"value":3},"gold_probs":{"action":{"south":0.5,"west":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 1), (1, 2), (1, 3), (2, 0), (2, 1), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,2],[1,1],[1,2],[1,3],[2,1],[3,1]],"position":[2,3],"goal":[1,0]},"pre_transform_start":[2,0],"d4_symmetry":4,"physical_state_hash":"56c128056227269524510f916a9a6eb17b71169e96e72e14251c2f8a94988477","canonical_source_id":"navigation_v3:56c128056227269524510f91","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.25,"west":0.75},"solvable":{"false":0.43000000000000005,"true":0.57},"value":{"0":0.02,"1":0.36,"2":0.42,"3":0.2}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:c94f8eaa506dbccc415705c1","state_id":"navigation_v3:c94f8eaa506dbccc415705c1","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(3,1); walls=(0,1),(0,2),(1,1),(1,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # # .\nrow 1: . # # .\nrow 2: . . . .\nrow 3: . G A #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 3, column 1).","north":"Move north to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"west","solvable":true,"value":0},"gold_probs":{"action":{"west":1.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 3), (2, 1), (2, 2), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,2],[1,1],[1,2],[3,3]],"position":[3,2],"goal":[3,1]},"pre_transform_start":[0,1],"d4_symmetry":2,"physical_state_hash":"c94f8eaa506dbccc415705c1d6c4a2b3e68a1bf0482b6685a08a4689a916f9b2","canonical_source_id":"navigation_v3:c94f8eaa506dbccc415705c1","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.99,"north":0.01},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.97,"1":0.02,"2":0,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:39350450211c23b598eebc81","state_id":"navigation_v3:39350450211c23b598eebc81","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(0,2); walls=(0,0),(1,0),(1,1),(1,2),(2,2),(3,0),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . G .\nrow 1: # # # .\nrow 2: . . # A\nrow 3: # . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 1, column 3).","south":"Move south to (row 3, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"north":1.0,"south":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 3), (1, 1), (1, 2), (1, 3), (2, 1), (3, 1), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[1,0],[1,1],[1,2],[2,2],[3,0],[3,2]],"position":[2,3],"goal":[0,2]},"pre_transform_start":[1,0],"d4_symmetry":2,"physical_state_hash":"39350450211c23b598eebc81e2d696070b881f2ba96133b15aa19f0bc4d82959","canonical_source_id":"navigation_v3:39350450211c23b598eebc81","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.93,"south":0.07},"solvable":{"false":0.31000000000000005,"true":0.69},"value":{"0":0.05,"1":0.55,"2":0.29,"3":0.11}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:628854cb9932211fbbb1f124","state_id":"navigation_v3:628854cb9932211fbbb1f124","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,3); goal=(2,1); walls=(0,1),(1,0),(2,0),(3,0),(3,1),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . .\nrow 1: # . . A\nrow 2: # G . .\nrow 3: # # . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 3).","north":"Move north to (row 0, column 3).","west":"Move west to (row 1, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"south":0.5,"north":0.0,"west":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (0, 1), (0, 2), (1, 0), (1, 3), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[1,0],[2,0],[3,0],[3,1],[3,3]],"position":[1,3],"goal":[2,1]},"pre_transform_start":[1,3],"d4_symmetry":0,"physical_state_hash":"628854cb9932211fbbb1f12466602d9ee65911771c43df7fec18169ac9deeaa7","canonical_source_id":"navigation_v3:628854cb9932211fbbb1f124","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.14,"west":0.86,"north":0},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0.07,"1":0.8,"2":0.11,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:5d26300b1d45d7813ac3c87e","state_id":"navigation_v3:5d26300b1d45d7813ac3c87e","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,3); goal=(2,2); walls=(0,1),(2,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . A\nrow 1: . . . .\nrow 2: # . G .\nrow 3: . . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 0, column 2).","south":"Move south to (row 1, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"west":0.5,"south":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((1, 3), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[2,0]],"position":[0,3],"goal":[2,2]},"pre_transform_start":[0,3],"d4_symmetry":0,"physical_state_hash":"5d26300b1d45d7813ac3c87e89fac4984cca7e78051520cedae04c8830c9eec5","canonical_source_id":"navigation_v3:5d26300b1d45d7813ac3c87e","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.27,"south":0.73},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0.09,"1":0.89,"2":0.02,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:be14ee382698dd3e75769e75","state_id":"navigation_v3:be14ee382698dd3e75769e75","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,1); goal=(2,0); walls=(1,0),(2,1),(3,0),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . A . .\nrow 1: # . . .\nrow 2: G # . .\nrow 3: # . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 1, column 1).","east":"Move east to (row 0, column 2).","west":"Move west to (row 0, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"south":0.3333333333333333,"east":0.3333333333333333,"west":0.3333333333333333},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (1, 1), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,0],[2,1],[3,0],[3,3]],"position":[0,1],"goal":[2,0]},"pre_transform_start":[0,1],"d4_symmetry":0,"physical_state_hash":"be14ee382698dd3e75769e75f3e704105c4c80b23348c9fa42e59156668de286","canonical_source_id":"navigation_v3:be14ee382698dd3e75769e75","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.42,"south":0.51,"east":0.07},"solvable":{"false":0.18000000000000005,"true":0.82},"value":{"0":0.03,"1":0.68,"2":0.21,"3":0.08}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:c5cc4a0eb54876b45ededd27","state_id":"navigation_v3:c5cc4a0eb54876b45ededd27","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,1); goal=(3,2); walls=(0,0),(0,3),(1,2),(1,3),(2,0),(2,1),(3,1),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # A . #\nrow 1: . . # #\nrow 2: # # . .\nrow 3: . # G #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 0, column 2).","south":"Move south to (row 1, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"east":0.5,"south":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (1, 2), (1, 3), (2, 0), (2, 1), (3, 0), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,3],[1,2],[1,3],[2,0],[2,1],[3,1],[3,3]],"position":[0,1],"goal":[3,2]},"pre_transform_start":[3,1],"d4_symmetry":6,"physical_state_hash":"c5cc4a0eb54876b45ededd279344859f14a22d9e6814e4b01cada1deb80d2a4b","canonical_source_id":"navigation_v3:c5cc4a0eb54876b45ededd27","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.38,"south":0.62},"solvable":{"false":0.17000000000000004,"true":0.83},"value":{"0":0.01,"1":0.55,"2":0.35,"3":0.09}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:0190bbc9a0692ef890df0231","state_id":"navigation_v3:0190bbc9a0692ef890df0231","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,0); goal=(3,2); walls=(2,0),(2,1),(2,2),(2,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: A . . .\nrow 1: . . . .\nrow 2: # # # #\nrow 3: . . G .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 0, column 1).","south":"Move south to (row 1, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"east":0.5,"south":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 0), (1, 1), (1, 2), (1, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[2,0],[2,1],[2,2],[2,3]],"position":[0,0],"goal":[3,2]},"pre_transform_start":[3,0],"d4_symmetry":6,"physical_state_hash":"0190bbc9a0692ef890df0231c34be534b6a259ec6521607d81bbf799f85f86e1","canonical_source_id":"navigation_v3:0190bbc9a0692ef890df0231","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.36,"south":0.64},"solvable":{"false":0.5800000000000001,"true":0.42},"value":{"0":0,"1":0.16,"2":0.45,"3":0.39}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:f418136d7987ffc9a3b02a4b","state_id":"navigation_v3:f418136d7987ffc9a3b02a4b","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(1,1); walls=(0,0),(1,2),(2,2),(3,1),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . A .\nrow 1: . G # .\nrow 2: . . # .\nrow 3: . # . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 0, column 3).","west":"Move west to (row 0, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"west","solvable":true,"value":0},"gold_probs":{"action":{"east":0.0,"west":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (1, 2), (2, 2), (3, 1), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[1,2],[2,2],[3,1],[3,3]],"position":[0,2],"goal":[1,1]},"pre_transform_start":[1,0],"d4_symmetry":1,"physical_state_hash":"f418136d7987ffc9a3b02a4bab0cdd3dd83f4f7332808f7ec1ff475765d027c2","canonical_source_id":"navigation_v3:f418136d7987ffc9a3b02a4b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.99,"east":0.01},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0.76,"1":0.21,"2":0.02,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:da8096f465dff181b9f9e884","state_id":"navigation_v3:da8096f465dff181b9f9e884","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(3,1); walls=(0,2),(0,3),(1,1),(1,2),(1,3),(2,0),(2,3),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # #\nrow 1: . # # #\nrow 2: # . . #\nrow 3: # G A .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 3, column 1).","east":"Move east to (row 3, column 3).","north":"Move north to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"west","solvable":true,"value":0},"gold_probs":{"action":{"west":1.0,"east":0.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 0), (1, 3), (2, 1), (2, 2), (2, 3), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[0,3],[1,1],[1,2],[1,3],[2,0],[2,3],[3,0]],"position":[3,2],"goal":[3,1]},"pre_transform_start":[0,2],"d4_symmetry":6,"physical_state_hash":"da8096f465dff181b9f9e884aaec88fa8b1d488af86c553dca266c22b2c41a98","canonical_source_id":"navigation_v3:da8096f465dff181b9f9e884","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.01,"west":0.99,"east":0},"solvable":{"false":0.13,"true":0.87},"value":{"0":0.94,"1":0.03,"2":0.02,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:3059f2076f473c7d7b1f5766","state_id":"navigation_v3:3059f2076f473c7d7b1f5766","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(0,1); walls=(0,3),(2,1),(2,2),(3,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . G . #\nrow 1: . A . .\nrow 2: . # # .\nrow 3: . # # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 1, column 2).","west":"Move west to (row 1, column 0).","north":"Move north to (row 0, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"east":0.0,"west":0.0,"north":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 3), (2, 1), (2, 2), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,3],[2,1],[2,2],[3,1],[3,2]],"position":[1,1],"goal":[0,1]},"pre_transform_start":[1,2],"d4_symmetry":4,"physical_state_hash":"3059f2076f473c7d7b1f5766923ad45f156b74dc2147790adc555f6ac3b0e66d","canonical_source_id":"navigation_v3:3059f2076f473c7d7b1f5766","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0,"west":0,"north":1},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0.96,"1":0.02,"2":0.01,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:c115eda49ddf0dc46842309a","state_id":"navigation_v3:c115eda49ddf0dc46842309a","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(3,0); walls=(0,0),(0,1),(1,3),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # A .\nrow 1: . . . #\nrow 2: . . . .\nrow 3: G . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 0, column 3).","south":"Move south to (row 1, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"east":0.0,"south":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 2), (2, 3), (3, 0), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[1,3],[3,2]],"position":[0,2],"goal":[3,0]},"pre_transform_start":[2,0],"d4_symmetry":7,"physical_state_hash":"c115eda49ddf0dc46842309a51cea8f449a9ddbea1ff8bd6a3167ec10effd4ea","canonical_source_id":"navigation_v3:c115eda49ddf0dc46842309a","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.04,"south":0.96},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0,"1":0.72,"2":0.27,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:e17c8ceb138791cd35c25a18","state_id":"navigation_v3:e17c8ceb138791cd35c25a18","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(0,2); walls=(0,0),(0,3),(1,0),(1,1),(2,1),(2,3),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . G #\nrow 1: # # . .\nrow 2: . # . #\nrow 3: # . A .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 2, column 2).","east":"Move east to (row 3, column 3).","west":"Move west to (row 3, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"north":1.0,"east":0.0,"west":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 3), (1, 2), (1, 3), (2, 0), (2, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,3],[1,0],[1,1],[2,1],[2,3],[3,0]],"position":[3,2],"goal":[0,2]},"pre_transform_start":[3,2],"d4_symmetry":0,"physical_state_hash":"e17c8ceb138791cd35c25a1860374440199f04ec0d826ce4b89e3569c601217a","canonical_source_id":"navigation_v3:e17c8ceb138791cd35c25a18","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.06,"east":0.02,"north":0.92},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0.09,"1":0.62,"2":0.26,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:8f3670961165a488a40d226b","state_id":"navigation_v3:8f3670961165a488a40d226b","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,3); goal=(2,1); walls=(0,2),(1,0),(1,1),(2,0),(2,2),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # .\nrow 1: # # . A\nrow 2: # G # .\nrow 3: . # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 3).","west":"Move west to (row 1, column 2).","north":"Move north to (row 0, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":false,"value":3},"gold_probs":{"action":{"south":0.3333333333333333,"west":0.3333333333333333,"north":0.3333333333333333},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 1), (0, 2), (1, 0), (1, 2), (2, 1), (2, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[1,0],[1,1],[2,0],[2,2],[3,1]],"position":[1,3],"goal":[2,1]},"pre_transform_start":[2,3],"d4_symmetry":6,"physical_state_hash":"8f3670961165a488a40d226b07fd5d245a0ddeb26ad33abb9916a0918bc7aa07","canonical_source_id":"navigation_v3:8f3670961165a488a40d226b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.31,"west":0.65,"north":0.04},"solvable":{"false":0.25,"true":0.75},"value":{"0":0.06,"1":0.57,"2":0.24,"3":0.13}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:7825230706e8690ab6b17131","state_id":"navigation_v3:7825230706e8690ab6b17131","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,0); goal=(2,3); walls=(1,2),(3,0),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . .\nrow 1: A . # .\nrow 2: . . . G\nrow 3: # . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 1, column 1).","south":"Move south to (row 2, column 0).","north":"Move north to (row 0, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":1},"gold_probs":{"action":{"east":0.5,"south":0.5,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 2), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,2],[3,0],[3,3]],"position":[1,0],"goal":[2,3]},"pre_transform_start":[2,0],"d4_symmetry":6,"physical_state_hash":"7825230706e8690ab6b1713173db0a52d9da5e1d426b3d2340e570b3512dcf5f","canonical_source_id":"navigation_v3:7825230706e8690ab6b17131","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.45,"east":0.51,"north":0.04},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0,"1":0.82,"2":0.18,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:d460e3e018e3da30caf83e5d","state_id":"navigation_v3:d460e3e018e3da30caf83e5d","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,3); goal=(0,0); walls=(0,1),(0,2),(1,1),(2,0),(2,2),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: G # # .\nrow 1: . # . A\nrow 2: # . # .\nrow 3: # . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 3).","north":"Move north to (row 0, column 3).","west":"Move west to (row 1, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":false,"value":3},"gold_probs":{"action":{"south":0.3333333333333333,"north":0.3333333333333333,"west":0.3333333333333333},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 1), (0, 2), (1, 1), (2, 0), (2, 2), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,2],[1,1],[2,0],[2,2],[3,0]],"position":[1,3],"goal":[0,0]},"pre_transform_start":[3,1],"d4_symmetry":7,"physical_state_hash":"d460e3e018e3da30caf83e5d4b3927fc3e0346bab11a4342f1a3525301b26d0d","canonical_source_id":"navigation_v3:d460e3e018e3da30caf83e5d","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.43,"north":0.46,"south":0.11},"solvable":{"false":0.41000000000000003,"true":0.59},"value":{"0":0.02,"1":0.25,"2":0.53,"3":0.2}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:845b3a6d4a10591c1fb62331","state_id":"navigation_v3:845b3a6d4a10591c1fb62331","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,3); goal=(1,0); walls=(0,0),(0,3),(1,1),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . #\nrow 1: G # . .\nrow 2: . . . .\nrow 3: # . . A","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 2, column 3).","west":"Move west to (row 3, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"north":0.5,"west":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 3), (1, 1), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,3],[1,1],[3,0]],"position":[3,3],"goal":[1,0]},"pre_transform_start":[3,0],"d4_symmetry":3,"physical_state_hash":"845b3a6d4a10591c1fb62331268320ba581c94619e74254b6a871b3a562d9cb9","canonical_source_id":"navigation_v3:845b3a6d4a10591c1fb62331","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.64,"west":0.36},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0,"1":0.47,"2":0.5,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:2f04614fc8690d41681b02b4","state_id":"navigation_v3:2f04614fc8690d41681b02b4","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(0,2); walls=(0,1),(0,3),(1,3),(2,0),(2,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # G #\nrow 1: . A . #\nrow 2: # . . #\nrow 3: . . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 1, column 0).","east":"Move east to (row 1, column 2).","south":"Move south to (row 2, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"west":0.0,"east":1.0,"south":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (1, 0), (2, 0), (2, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,3],[1,3],[2,0],[2,3]],"position":[1,1],"goal":[0,2]},"pre_transform_start":[1,2],"d4_symmetry":4,"physical_state_hash":"2f04614fc8690d41681b02b45d1aac7b4e1a85ed85d0bf5ac030db819ea1e644","canonical_source_id":"navigation_v3:2f04614fc8690d41681b02b4","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.05,"east":0.89,"south":0.06},"solvable":{"false":0.13,"true":0.87},"value":{"0":0.72,"1":0.21,"2":0.04,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:bdfe17f5897a7979046573c6","state_id":"navigation_v3:bdfe17f5897a7979046573c6","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,0); goal=(1,2); walls=(0,1),(0,3),(1,1),(1,3),(2,2),(2,3),(3,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . #\nrow 1: A # G #\nrow 2: . . # #\nrow 3: . # # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 0).","north":"Move north to (row 0, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":false,"value":3},"gold_probs":{"action":{"south":0.5,"north":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (0, 1), (0, 2), (1, 2), (1, 3), (2, 0), (2, 1), (2, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,3],[1,1],[1,3],[2,2],[2,3],[3,1],[3,2]],"position":[1,0],"goal":[1,2]},"pre_transform_start":[1,0],"d4_symmetry":0,"physical_state_hash":"bdfe17f5897a7979046573c61d6a19846133a83cec95208d677de979222ffcdf","canonical_source_id":"navigation_v3:bdfe17f5897a7979046573c6","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.23,"south":0.77},"solvable":{"false":0.5900000000000001,"true":0.41},"value":{"0":0.07,"1":0.48,"2":0.21,"3":0.24}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:c8c305b0bf3bf35250416a24","state_id":"navigation_v3:c8c305b0bf3bf35250416a24","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(3,0); walls=(1,0),(1,2),(2,0),(2,1),(3,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . .\nrow 1: # . # .\nrow 2: # # . A\nrow 3: G . # #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 2, column 2).","north":"Move north to (row 1, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":false,"value":3},"gold_probs":{"action":{"west":0.5,"north":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 1), (0, 2), (1, 1), (2, 0), (2, 2), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,0],[1,2],[2,0],[2,1],[3,2],[3,3]],"position":[2,3],"goal":[3,0]},"pre_transform_start":[1,3],"d4_symmetry":6,"physical_state_hash":"c8c305b0bf3bf35250416a242cceb89b35a7844c03f593e39897dca259093a43","canonical_source_id":"navigation_v3:c8c305b0bf3bf35250416a24","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.37,"west":0.63},"solvable":{"false":0.19999999999999996,"true":0.8},"value":{"0":0.01,"1":0.48,"2":0.44,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:9495147c1e0802dc7bae18b7","state_id":"navigation_v3:9495147c1e0802dc7bae18b7","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,1); goal=(2,1); walls=(0,3),(1,0),(1,3),(2,2),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . A . #\nrow 1: # . . #\nrow 2: . G # .\nrow 3: . # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 1, column 1).","west":"Move west to (row 0, column 0).","east":"Move east to (row 0, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"south":1.0,"west":0.0,"east":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 1), (1, 2), (2, 0), (2, 3), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,3],[1,0],[1,3],[2,2],[3,1]],"position":[0,1],"goal":[2,1]},"pre_transform_start":[0,2],"d4_symmetry":4,"physical_state_hash":"9495147c1e0802dc7bae18b78cbeecd88153962e7aaa3749ada5475d920b6767","canonical_source_id":"navigation_v3:9495147c1e0802dc7bae18b7","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0,"east":0.02,"south":0.98},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0.83,"1":0.14,"2":0.02,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:4b19969bab387cc93a751df1","state_id":"navigation_v3:4b19969bab387cc93a751df1","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(2,0); walls=(0,1),(0,3),(1,0),(1,1),(2,2),(3,0),(3,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . #\nrow 1: # # A .\nrow 2: G . # .\nrow 3: # . # #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 0, column 2).","east":"Move east to (row 1, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"north":0.5,"east":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (1, 2), (1, 3), (2, 0), (2, 1), (3, 0), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,3],[1,0],[1,1],[2,2],[3,0],[3,2],[3,3]],"position":[1,2],"goal":[2,0]},"pre_transform_start":[2,1],"d4_symmetry":7,"physical_state_hash":"4b19969bab387cc93a751df1caa436871e9f2d71852bb291619e59366d07dfb3","canonical_source_id":"navigation_v3:4b19969bab387cc93a751df1","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.49,"north":0.51},"solvable":{"false":0.22999999999999998,"true":0.77},"value":{"0":0.23,"1":0.57,"2":0.12,"3":0.08}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:1fbb8bd56161ef60eb780962","state_id":"navigation_v3:1fbb8bd56161ef60eb780962","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(0,1); walls=(0,0),(1,1),(2,0),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # G . .\nrow 1: . # . .\nrow 2: # . . .\nrow 3: . # A .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 2, column 2).","east":"Move east to (row 3, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"north":1.0,"east":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 1), (2, 0), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[1,1],[2,0],[3,1]],"position":[3,2],"goal":[0,1]},"pre_transform_start":[3,1],"d4_symmetry":4,"physical_state_hash":"1fbb8bd56161ef60eb7809624bdc5bf7fdd8624456190a15320d0be5d53c4f4d","canonical_source_id":"navigation_v3:1fbb8bd56161ef60eb780962","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.08,"north":0.92},"solvable":{"false":0.13,"true":0.87},"value":{"0":0.01,"1":0.48,"2":0.46,"3":0.05}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:bc80fbf01c41f7ce0cd90aa0","state_id":"navigation_v3:bc80fbf01c41f7ce0cd90aa0","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(2,2); walls=(0,1),(1,1),(2,1),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # A .\nrow 1: . # . .\nrow 2: . # G .\nrow 3: # . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 1, column 2).","east":"Move east to (row 0, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"south":1.0,"east":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 3), (1, 2), (2, 2), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[1,1],[2,1],[3,0]],"position":[0,2],"goal":[2,2]},"pre_transform_start":[0,1],"d4_symmetry":4,"physical_state_hash":"bc80fbf01c41f7ce0cd90aa01273dc52c43850ed4c0e307d58aaa4b44ad4938d","canonical_source_id":"navigation_v3:bc80fbf01c41f7ce0cd90aa0","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.02,"south":0.98},"solvable":{"false":0.18999999999999995,"true":0.81},"value":{"0":0.32,"1":0.52,"2":0.1,"3":0.06}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:26c7aa433e46c9351dc3152e","state_id":"navigation_v3:26c7aa433e46c9351dc3152e","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(2,0); walls=(0,0),(0,1),(0,3),(1,0),(1,3),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # . #\nrow 1: # . . #\nrow 2: G . . .\nrow 3: . . A #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 3, column 1).","north":"Move north to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"west":0.5,"north":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 2), (0, 3), (1, 3), (3, 0), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[0,3],[1,0],[1,3],[3,3]],"position":[3,2],"goal":[2,0]},"pre_transform_start":[1,0],"d4_symmetry":5,"physical_state_hash":"26c7aa433e46c9351dc3152e228a4c48363468910458c5df150e82387720d133","canonical_source_id":"navigation_v3:26c7aa433e46c9351dc3152e","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.33,"north":0.67},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0.04,"1":0.8,"2":0.14,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:dc12d05745a7fce27d5656da","state_id":"navigation_v3:dc12d05745a7fce27d5656da","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,0); goal=(2,1); walls=(0,0),(0,2),(0,3),(2,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . # #\nrow 1: . . . .\nrow 2: A G # .\nrow 3: . . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 1, column 0).","south":"Move south to (row 3, column 0).","east":"Move east to (row 2, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"north":0.0,"south":0.0,"east":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 3), (2, 1), (2, 3), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,2],[0,3],[2,2]],"position":[2,0],"goal":[2,1]},"pre_transform_start":[0,2],"d4_symmetry":7,"physical_state_hash":"dc12d05745a7fce27d5656da6e79ca3bd5fa08744bfbfd483894d7a65285f9b5","canonical_source_id":"navigation_v3:dc12d05745a7fce27d5656da","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":1,"south":0,"north":0},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":1,"1":0,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:3400699b114d6dee4b1fd0a9","state_id":"navigation_v3:3400699b114d6dee4b1fd0a9","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,3); goal=(3,1); walls=(0,0),(2,2),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . A\nrow 1: . . . .\nrow 2: . . # .\nrow 3: # G . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 0, column 2).","south":"Move south to (row 1, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"west":0.5,"south":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 2), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[2,2],[3,0]],"position":[0,3],"goal":[3,1]},"pre_transform_start":[3,0],"d4_symmetry":7,"physical_state_hash":"3400699b114d6dee4b1fd0a921a5c1ef0713cbbaa00d7d248452f5e5f8f7ac1e","canonical_source_id":"navigation_v3:3400699b114d6dee4b1fd0a9","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.66,"west":0.34},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0,"1":0.6,"2":0.39,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:6a8482ebd2325d51ed824729","state_id":"navigation_v3:6a8482ebd2325d51ed824729","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,3); goal=(0,2); walls=(1,1),(2,2),(2,3),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . G .\nrow 1: . # . A\nrow 2: . . # #\nrow 3: . # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 1, column 2).","north":"Move north to (row 0, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"west":0.5,"north":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 2), (2, 0), (2, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,1],[2,2],[2,3],[3,1]],"position":[1,3],"goal":[0,2]},"pre_transform_start":[1,0],"d4_symmetry":4,"physical_state_hash":"6a8482ebd2325d51ed824729f018d1fa615d4a97bc864660217adc864508413c","canonical_source_id":"navigation_v3:6a8482ebd2325d51ed824729","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.73,"north":0.27},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0.61,"1":0.34,"2":0.04,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:59a4997cfc6bba9401742fda","state_id":"navigation_v3:59a4997cfc6bba9401742fda","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,0); goal=(1,2); walls=(0,2),(1,1),(1,3),(2,2),(2,3),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # .\nrow 1: A # G #\nrow 2: . . # #\nrow 3: . # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 0).","north":"Move north to (row 0, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":false,"value":3},"gold_probs":{"action":{"south":0.5,"north":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 1), (0, 2), (1, 0), (1, 2), (2, 1), (2, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[1,1],[1,3],[2,2],[2,3],[3,1]],"position":[1,0],"goal":[1,2]},"pre_transform_start":[1,3],"d4_symmetry":4,"physical_state_hash":"59a4997cfc6bba9401742fdaae577f80f53be2a0390e80b5fe6e05a31a0a5766","canonical_source_id":"navigation_v3:59a4997cfc6bba9401742fda","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.5,"south":0.5},"solvable":{"false":0.52,"true":0.48},"value":{"0":0.05,"1":0.47000000000000003,"2":0.29,"3":0.19}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:ce43a3eabe37252f3ad74b4d","state_id":"navigation_v3:ce43a3eabe37252f3ad74b4d","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,0); goal=(0,0); walls=(2,0),(2,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: G . . .\nrow 1: A . . .\nrow 2: # . # .\nrow 3: . . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 0, column 0).","east":"Move east to (row 1, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"north":1.0,"east":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 2), (2, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[2,0],[2,2]],"position":[1,0],"goal":[0,0]},"pre_transform_start":[0,1],"d4_symmetry":7,"physical_state_hash":"ce43a3eabe37252f3ad74b4dde6531968d84dd5a274fda4154109a1460421bac","canonical_source_id":"navigation_v3:ce43a3eabe37252f3ad74b4d","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.01,"north":0.99},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.99,"1":0.01,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:297bf121e88652b8af9f04ee","state_id":"navigation_v3:297bf121e88652b8af9f04ee","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(0,2); walls=(0,0),(0,1),(0,3),(1,1),(1,2),(1,3),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # G #\nrow 1: . # # #\nrow 2: . . . .\nrow 3: # . A .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 3, column 1).","east":"Move east to (row 3, column 3).","north":"Move north to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"west":0.3333333333333333,"east":0.3333333333333333,"north":0.3333333333333333},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (0, 3), (1, 0), (1, 1), (1, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[0,3],[1,1],[1,2],[1,3],[3,0]],"position":[3,2],"goal":[0,2]},"pre_transform_start":[0,1],"d4_symmetry":2,"physical_state_hash":"297bf121e88652b8af9f04ee4e990f316ffc2809011403c89552a84be681b526","canonical_source_id":"navigation_v3:297bf121e88652b8af9f04ee","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.86,"east":0.03,"west":0.11},"solvable":{"false":0.30000000000000004,"true":0.7},"value":{"0":0.02,"1":0.48,"2":0.38,"3":0.12}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:f6f8d68ac04ff3cf1801a3d3","state_id":"navigation_v3:f6f8d68ac04ff3cf1801a3d3","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,0); goal=(2,3); walls=(0,2),(1,2),(2,0),(2,1),(2,2),(3,1),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: A . # .\nrow 1: . . # .\nrow 2: # # # G\nrow 3: . # . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 0, column 1).","south":"Move south to (row 1, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"east":0.5,"south":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 1), (1, 2), (1, 3), (2, 0), (2, 1), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[1,2],[2,0],[2,1],[2,2],[3,1],[3,3]],"position":[0,0],"goal":[2,3]},"pre_transform_start":[3,0],"d4_symmetry":6,"physical_state_hash":"f6f8d68ac04ff3cf1801a3d3d595afeba2e7745d2d996c862a376473aae415b4","canonical_source_id":"navigation_v3:f6f8d68ac04ff3cf1801a3d3","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.5,"east":0.5},"solvable":{"false":0.29000000000000004,"true":0.71},"value":{"0":0,"1":0.4,"2":0.42,"3":0.18}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:2f352912e7d5287aa7a4a8f1","state_id":"navigation_v3:2f352912e7d5287aa7a4a8f1","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,0); goal=(3,1); walls=(0,2),(0,3),(2,1),(2,2),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # #\nrow 1: . . . .\nrow 2: . # # .\nrow 3: A G # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 2, column 0).","east":"Move east to (row 3, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"north":0.0,"east":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 2), (1, 1), (1, 2), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[0,3],[2,1],[2,2],[3,2]],"position":[3,0],"goal":[3,1]},"pre_transform_start":[0,0],"d4_symmetry":3,"physical_state_hash":"2f352912e7d5287aa7a4a8f1506aa1f64053195f89a33af22902a4d4d10e3f58","canonical_source_id":"navigation_v3:2f352912e7d5287aa7a4a8f1","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0,"east":1},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.99,"1":0.01,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:2d7aec431224e5cf07faf913","state_id":"navigation_v3:2d7aec431224e5cf07faf913","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(2,3); walls=(0,0),(0,2),(0,3),(1,1),(1,2),(3,1),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . # #\nrow 1: . # # .\nrow 2: . A . G\nrow 3: . # . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 2, column 2).","west":"Move west to (row 2, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"east":1.0,"west":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 3), (1, 2), (1, 3), (2, 0), (2, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,2],[0,3],[1,1],[1,2],[3,1],[3,3]],"position":[2,1],"goal":[2,3]},"pre_transform_start":[2,2],"d4_symmetry":1,"physical_state_hash":"2d7aec431224e5cf07faf913d226dac40b70a2fcc80fead70827114c2e2961bd","canonical_source_id":"navigation_v3:2d7aec431224e5cf07faf913","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.02,"east":0.98},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0.73,"1":0.18,"2":0.05,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:dfc2db3b186928f9681f86e3","state_id":"navigation_v3:dfc2db3b186928f9681f86e3","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(2,3); walls=(1,3),(2,2),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . A .\nrow 1: . . . #\nrow 2: . . # G\nrow 3: . . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 0, column 3).","south":"Move south to (row 1, column 2).","west":"Move west to (row 0, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"east":0.3333333333333333,"south":0.3333333333333333,"west":0.3333333333333333},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 2), (1, 0), (1, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,3],[2,2],[3,2]],"position":[0,2],"goal":[2,3]},"pre_transform_start":[0,2],"d4_symmetry":0,"physical_state_hash":"dfc2db3b186928f9681f86e31287699a98f68735bc10c78476f911457ec2b603","canonical_source_id":"navigation_v3:dfc2db3b186928f9681f86e3","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.4,"south":0.58,"west":0.02},"solvable":{"false":0.14,"true":0.86},"value":{"0":0.04,"1":0.64,"2":0.25,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:b8a0d262eb61cd9f08f6f27b","state_id":"navigation_v3:b8a0d262eb61cd9f08f6f27b","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(3,2); walls=(0,1),(1,0),(1,2),(3,1),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . .\nrow 1: # . # .\nrow 2: . . A .\nrow 3: . # G #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 2, column 3).","south":"Move south to (row 3, column 2).","west":"Move west to (row 2, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"east":0.0,"south":1.0,"west":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (2, 1), (2, 3), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[1,0],[1,2],[3,1],[3,3]],"position":[2,2],"goal":[3,2]},"pre_transform_start":[2,2],"d4_symmetry":7,"physical_state_hash":"b8a0d262eb61cd9f08f6f27b9c967b16b4ceebd5735aa38fa2c76186c12a3af5","canonical_source_id":"navigation_v3:b8a0d262eb61cd9f08f6f27b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.01,"south":0.97,"west":0.02},"solvable":{"false":0.16000000000000003,"true":0.84},"value":{"0":0.69,"1":0.18,"2":0.04,"3":0.09}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:6d7aa708325001b1bfa9a4f3","state_id":"navigation_v3:6d7aa708325001b1bfa9a4f3","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(0,1); walls=(0,0),(0,2),(1,0),(2,0),(2,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # G # .\nrow 1: # A . .\nrow 2: # . . #\nrow 3: . . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 1).","north":"Move north to (row 0, column 1).","east":"Move east to (row 1, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"south":0.0,"north":1.0,"east":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (1, 0), (2, 0), (2, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,2],[1,0],[2,0],[2,3]],"position":[1,1],"goal":[0,1]},"pre_transform_start":[1,1],"d4_symmetry":0,"physical_state_hash":"6d7aa708325001b1bfa9a4f3cc11d1436cd1992082b86e610161cca5c95d8430","canonical_source_id":"navigation_v3:6d7aa708325001b1bfa9a4f3","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.02,"south":0.01,"north":0.97},"solvable":{"false":0.16000000000000003,"true":0.84},"value":{"0":0.89,"1":0.06,"2":0.02,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:5f3f250c9c2fe7fe5d846e7e","state_id":"navigation_v3:5f3f250c9c2fe7fe5d846e7e","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(0,2); walls=(1,0),(1,1),(2,0),(2,3),(3,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . G .\nrow 1: # # . .\nrow 2: # . A #\nrow 3: . # # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 2, column 1).","north":"Move north to (row 1, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"west":0.0,"north":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 2), (1, 3), (2, 0), (2, 3), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,0],[1,1],[2,0],[2,3],[3,1],[3,2]],"position":[2,2],"goal":[0,2]},"pre_transform_start":[1,1],"d4_symmetry":5,"physical_state_hash":"5f3f250c9c2fe7fe5d846e7ebe712290cdedea417a0d563fe5cb71334036c0b7","canonical_source_id":"navigation_v3:5f3f250c9c2fe7fe5d846e7e","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.97,"west":0.03},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0.56,"1":0.38,"2":0.04,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:5ad7134c63943d2cf89d0ce6","state_id":"navigation_v3:5ad7134c63943d2cf89d0ce6","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,0); goal=(0,1); walls=(1,2),(2,3),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: A G . .\nrow 1: . . # .\nrow 2: . . . #\nrow 3: . # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 0, column 1).","south":"Move south to (row 1, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"east":1.0,"south":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 2), (2, 3), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,2],[2,3],[3,1]],"position":[0,0],"goal":[0,1]},"pre_transform_start":[0,0],"d4_symmetry":7,"physical_state_hash":"5ad7134c63943d2cf89d0ce6f4285f79616850fd2fbff2300e2ed0843f65dc46","canonical_source_id":"navigation_v3:5ad7134c63943d2cf89d0ce6","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":1,"south":0},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":1,"1":0,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:c1b01eb382542547b9d4c93f","state_id":"navigation_v3:c1b01eb382542547b9d4c93f","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,3); goal=(2,2); walls=(0,0),(1,0),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . .\nrow 1: # . . A\nrow 2: . . G .\nrow 3: . . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 1, column 2).","south":"Move south to (row 2, column 3).","north":"Move north to (row 0, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"west":0.5,"south":0.5,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 1), (2, 3), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[1,0],[3,2]],"position":[1,3],"goal":[2,2]},"pre_transform_start":[0,2],"d4_symmetry":5,"physical_state_hash":"c1b01eb382542547b9d4c93f641a6197867d26ba53a4299b30cb900896bd2a52","canonical_source_id":"navigation_v3:c1b01eb382542547b9d4c93f","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.23,"west":0.77,"north":0},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.81,"1":0.18,"2":0.01,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:4a7ad58ff7e32d3ee8b80b41","state_id":"navigation_v3:4a7ad58ff7e32d3ee8b80b41","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,1); goal=(2,0); walls=(0,0),(1,3),(2,3),(3,0),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # A . .\nrow 1: . . . #\nrow 2: G . . #\nrow 3: # . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 0, column 2).","south":"Move south to (row 1, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"east":0.0,"south":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 3), (3, 0), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[1,3],[2,3],[3,0],[3,3]],"position":[0,1],"goal":[2,0]},"pre_transform_start":[0,2],"d4_symmetry":4,"physical_state_hash":"4a7ad58ff7e32d3ee8b80b41ac06b655661558657fe7018d672b3677afeaf17f","canonical_source_id":"navigation_v3:4a7ad58ff7e32d3ee8b80b41","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.06,"south":0.94},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.25,"1":0.73,"2":0.02,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:70d9cf183ed80087d97baaba","state_id":"navigation_v3:70d9cf183ed80087d97baaba","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,1); goal=(1,0); walls=(0,0),(1,2),(2,0),(2,3),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . .\nrow 1: G . # .\nrow 2: # . . #\nrow 3: . A # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 3, column 0).","north":"Move north to (row 2, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"west":0.0,"north":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (2, 1), (2, 3), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[1,2],[2,0],[2,3],[3,2]],"position":[3,1],"goal":[1,0]},"pre_transform_start":[0,2],"d4_symmetry":2,"physical_state_hash":"70d9cf183ed80087d97baaba36e896bae1e112f3dd6a3fb96256951698447067","canonical_source_id":"navigation_v3:70d9cf183ed80087d97baaba","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.24,"north":0.76},"solvable":{"false":0.12,"true":0.88},"value":{"0":0.03,"1":0.66,"2":0.27,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:483d57ee42eeb764f8a5ff8d","state_id":"navigation_v3:483d57ee42eeb764f8a5ff8d","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(1,1); walls=(1,2),(3,0),(3,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . .\nrow 1: . G # .\nrow 2: . . A .\nrow 3: # . # #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 2, column 3).","west":"Move west to (row 2, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"west","solvable":true,"value":0},"gold_probs":{"action":{"east":0.0,"west":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 3), (2, 1), (2, 3), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,2],[3,0],[3,2],[3,3]],"position":[2,2],"goal":[1,1]},"pre_transform_start":[2,1],"d4_symmetry":3,"physical_state_hash":"483d57ee42eeb764f8a5ff8d0cd178f910a4634266030fe611193588bbe52a0f","canonical_source_id":"navigation_v3:483d57ee42eeb764f8a5ff8d","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.99,"east":0.01},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0.7,"1":0.27,"2":0.02,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:d3c8165fc749b62b39546b97","state_id":"navigation_v3:d3c8165fc749b62b39546b97","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(2,0); walls=(0,2),(1,0),(3,0),(3,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # .\nrow 1: # . . .\nrow 2: G . A .\nrow 3: # # # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 2, column 3).","west":"Move west to (row 2, column 1).","north":"Move north to (row 1, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"west","solvable":true,"value":0},"gold_probs":{"action":{"east":0.0,"west":1.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (1, 0), (2, 0), (2, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[1,0],[3,0],[3,1],[3,2]],"position":[2,2],"goal":[2,0]},"pre_transform_start":[2,1],"d4_symmetry":3,"physical_state_hash":"d3c8165fc749b62b39546b978b7fa1ac0c523659230f27d5f52df5438c92573c","canonical_source_id":"navigation_v3:d3c8165fc749b62b39546b97","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.03,"east":0,"west":0.97},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0.36,"1":0.54,"2":0.08,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:6723a7f54401e2f50d39c92f","state_id":"navigation_v3:6723a7f54401e2f50d39c92f","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,3); goal=(1,2); walls=(1,1),(3,0),(3,1),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . A\nrow 1: . # G .\nrow 2: . . . .\nrow 3: # # . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 0, column 2).","south":"Move south to (row 1, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"west":0.5,"south":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 3), (2, 1), (2, 3), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,1],[3,0],[3,1],[3,3]],"position":[0,3],"goal":[1,2]},"pre_transform_start":[0,3],"d4_symmetry":5,"physical_state_hash":"6723a7f54401e2f50d39c92fe35ec7dfe794d6f8c9bd5914c4c7ba8b3afa4a89","canonical_source_id":"navigation_v3:6723a7f54401e2f50d39c92f","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.42,"west":0.58},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0.74,"1":0.25,"2":0.01,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:c90d2faa9208f6f0fa15e762","state_id":"navigation_v3:c90d2faa9208f6f0fa15e762","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(0,1); walls=(0,0),(0,3),(1,2),(1,3),(2,0),(2,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # G . #\nrow 1: . A # #\nrow 2: # . # .\nrow 3: . . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 1).","west":"Move west to (row 1, column 0).","north":"Move north to (row 0, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"south":0.0,"west":0.0,"north":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 3), (1, 2), (1, 3), (2, 0), (2, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,3],[1,2],[1,3],[2,0],[2,2],[3,3]],"position":[1,1],"goal":[0,1]},"pre_transform_start":[1,2],"d4_symmetry":4,"physical_state_hash":"c90d2faa9208f6f0fa15e76262a35d948192c2a44ed79e6fa11350ca08072e33","canonical_source_id":"navigation_v3:c90d2faa9208f6f0fa15e762","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.01,"north":0.99,"south":0},"solvable":{"false":0.16000000000000003,"true":0.84},"value":{"0":0.94,"1":0.04,"2":0.01,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:70a62d34ecd7caa91653d92d","state_id":"navigation_v3:70a62d34ecd7caa91653d92d","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,3); goal=(2,3); walls=(0,1),(0,2),(1,0),(1,2),(2,0),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # # .\nrow 1: # . # A\nrow 2: # . . G\nrow 3: . # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 3).","north":"Move north to (row 0, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"south":1.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 2), (1, 3), (2, 0), (2, 3), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[0,2],[1,0],[1,2],[2,0],[3,1]],"position":[1,3],"goal":[2,3]},"pre_transform_start":[2,3],"d4_symmetry":6,"physical_state_hash":"70a62d34ecd7caa91653d92df7824e6d29dcdd2502932e5ab2bc009632a3dbf4","canonical_source_id":"navigation_v3:70a62d34ecd7caa91653d92d","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":1,"north":0},"solvable":{"false":0.13,"true":0.87},"value":{"0":0.88,"1":0.07,"2":0.02,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:1d1bc419a599516d2234269c","state_id":"navigation_v3:1d1bc419a599516d2234269c","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,0); goal=(3,3); walls=(0,2),(0,3),(1,1),(1,3),(2,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # #\nrow 1: A # . #\nrow 2: . # . .\nrow 3: . . # G","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 0, column 0).","south":"Move south to (row 2, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":false,"value":3},"gold_probs":{"action":{"north":0.5,"south":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 1), (1, 2), (2, 0), (2, 2), (3, 0), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[0,3],[1,1],[1,3],[2,1],[3,2]],"position":[1,0],"goal":[3,3]},"pre_transform_start":[2,0],"d4_symmetry":6,"physical_state_hash":"1d1bc419a599516d2234269cf32f479a1e98c2a39a9379c818d505060d9f68f2","canonical_source_id":"navigation_v3:1d1bc419a599516d2234269c","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.04,"south":0.96},"solvable":{"false":0.21999999999999997,"true":0.78},"value":{"0":0,"1":0.32,"2":0.56,"3":0.11}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:6e4619873b65ef2f50fa56d2","state_id":"navigation_v3:6e4619873b65ef2f50fa56d2","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(0,3); walls=(0,1),(2,0),(3,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . # . G\nrow 1: . . . .\nrow 2: # . A .\nrow 3: . . # #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 2, column 1).","north":"Move north to (row 1, column 2).","east":"Move east to (row 2, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":1},"gold_probs":{"action":{"west":0.0,"north":0.5,"east":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 2), (2, 3), (3, 0), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,1],[2,0],[3,2],[3,3]],"position":[2,2],"goal":[0,3]},"pre_transform_start":[1,1],"d4_symmetry":5,"physical_state_hash":"6e4619873b65ef2f50fa56d2dbd066fb22a41c766040ccf2e308b89bf8339f18","canonical_source_id":"navigation_v3:6e4619873b65ef2f50fa56d2","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.11,"west":0.03,"north":0.86},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0.15,"1":0.82,"2":0.03,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:799fecd7513171967364b49a","state_id":"navigation_v3:799fecd7513171967364b49a","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,1); goal=(0,0); walls=(0,2),(0,3),(1,0),(1,3),(2,1),(2,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: G . # #\nrow 1: # . . #\nrow 2: . # # .\nrow 3: . A . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 3, column 2).","west":"Move west to (row 3, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"east":0.5,"west":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 0):walls=((0, 1), (1, 2), (2, 0), (2, 2), (3, 0), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[0,3],[1,0],[1,3],[2,1],[2,2]],"position":[3,1],"goal":[0,0]},"pre_transform_start":[1,0],"d4_symmetry":3,"physical_state_hash":"799fecd7513171967364b49a568dfcb50a3c77948c95462a4b6492bee0af8d14","canonical_source_id":"navigation_v3:799fecd7513171967364b49a","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.34,"west":0.66},"solvable":{"false":0.21999999999999997,"true":0.78},"value":{"0":0.01,"1":0.41,"2":0.47000000000000003,"3":0.11}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:9d0e3f74af5d7fc3430ad776","state_id":"navigation_v3:9d0e3f74af5d7fc3430ad776","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(1,2); walls=(0,0),(0,1),(1,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # A .\nrow 1: # . G .\nrow 2: . . . .\nrow 3: . . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 0, column 3).","south":"Move south to (row 1, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"east":0.0,"south":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 2), (0, 3), (1, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[1,0]],"position":[0,2],"goal":[1,2]},"pre_transform_start":[3,2],"d4_symmetry":6,"physical_state_hash":"9d0e3f74af5d7fc3430ad77678d614eed1d682d767a8fce8ec1267d3de27e3f3","canonical_source_id":"navigation_v3:9d0e3f74af5d7fc3430ad776","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":1,"east":0},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0.97,"1":0.02,"2":0,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:3b739389b618461937d7c9ea","state_id":"navigation_v3:3b739389b618461937d7c9ea","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(3,1); walls=(0,0),(0,1),(0,2),(3,0),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # # .\nrow 1: . . A .\nrow 2: . . . .\nrow 3: # G . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 1, column 1).","east":"Move east to (row 1, column 3).","south":"Move south to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"west":0.5,"east":0.0,"south":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 3), (3, 0), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[0,2],[3,0],[3,3]],"position":[1,2],"goal":[3,1]},"pre_transform_start":[1,1],"d4_symmetry":1,"physical_state_hash":"3b739389b618461937d7c9ea06d67f57d0708473735495d74e469087696a211f","canonical_source_id":"navigation_v3:3b739389b618461937d7c9ea","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.37,"east":0.01,"south":0.62},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0.13,"1":0.85,"2":0.02,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:5cadfe99b09f8a9b19fc402e","state_id":"navigation_v3:5cadfe99b09f8a9b19fc402e","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,1); goal=(0,2); walls=(0,0),(0,3),(1,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . G #\nrow 1: . . # .\nrow 2: . . . .\nrow 3: . A . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 3, column 0).","east":"Move east to (row 3, column 2).","north":"Move north to (row 2, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"west":0.0,"east":0.0,"north":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 3), (1, 1), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,3],[1,2],[3,3]],"position":[3,1],"goal":[0,2]},"pre_transform_start":[3,1],"d4_symmetry":0,"physical_state_hash":"5cadfe99b09f8a9b19fc402efde395f5e88ba009c66d859cd16110f1e725b0f9","canonical_source_id":"navigation_v3:5cadfe99b09f8a9b19fc402e","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.81,"east":0.16,"west":0.02},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0.01,"1":0.59,"2":0.38,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:40323f481f1e57338f342939","state_id":"navigation_v3:40323f481f1e57338f342939","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(2,0); walls=(0,0),(1,3),(2,3),(3,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . .\nrow 1: . . A #\nrow 2: G . . #\nrow 3: . . # #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 2, column 2).","west":"Move west to (row 1, column 1).","north":"Move north to (row 0, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":1},"gold_probs":{"action":{"south":0.5,"west":0.5,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 3), (2, 0), (3, 0), (3, 1), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[1,3],[2,3],[3,2],[3,3]],"position":[1,2],"goal":[2,0]},"pre_transform_start":[1,1],"d4_symmetry":4,"physical_state_hash":"40323f481f1e57338f342939018083de302c3ebfd6aaa0c3365fcb339493c2da","canonical_source_id":"navigation_v3:40323f481f1e57338f342939","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.18,"west":0.82,"north":0},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0.19,"1":0.78,"2":0.03,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:4b860541d45d0b96a0e611f8","state_id":"navigation_v3:4b860541d45d0b96a0e611f8","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,0); goal=(2,0); walls=(0,3),(1,1),(1,2),(1,3),(2,2),(2,3),(3,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: A . . #\nrow 1: . # # #\nrow 2: G . # #\nrow 3: . # . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 1, column 0).","east":"Move east to (row 0, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":true,"value":0},"gold_probs":{"action":{"south":1.0,"east":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 0), (1, 2), (2, 1), (2, 2), (3, 1), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,3],[1,1],[1,2],[1,3],[2,2],[2,3],[3,1]],"position":[0,0],"goal":[2,0]},"pre_transform_start":[3,3],"d4_symmetry":2,"physical_state_hash":"4b860541d45d0b96a0e611f81965e5106b42928f03665c2e71db350f4468e7c9","canonical_source_id":"navigation_v3:4b860541d45d0b96a0e611f8","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.04,"south":0.96},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0.61,"1":0.3,"2":0.07,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:cf5739befb25573a5ff81ca6","state_id":"navigation_v3:cf5739befb25573a5ff81ca6","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,3); goal=(2,2); walls=(0,2),(1,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . # .\nrow 1: # . . .\nrow 2: . . G .\nrow 3: . . . A","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 3, column 2).","north":"Move north to (row 2, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"west":0.5,"north":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((1, 3), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,2],[1,0]],"position":[3,3],"goal":[2,2]},"pre_transform_start":[3,3],"d4_symmetry":7,"physical_state_hash":"cf5739befb25573a5ff81ca6b36c8e100f1a13c19db839d5954875b6493fe86f","canonical_source_id":"navigation_v3:cf5739befb25573a5ff81ca6","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.63,"west":0.37},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.93,"1":0.07,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:4c2f51c6fe277a526cd21fd6","state_id":"navigation_v3:4c2f51c6fe277a526cd21fd6","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(3,2); walls=(0,0),(0,1),(1,0),(1,1),(1,2),(2,0),(2,3),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # . .\nrow 1: # # # .\nrow 2: # A . #\nrow 3: . . G #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 2, column 2).","south":"Move south to (row 3, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":0},"gold_probs":{"action":{"east":0.5,"south":0.5},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (1, 0), (1, 3), (2, 1), (2, 2), (2, 3), (3, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[1,0],[1,1],[1,2],[2,0],[2,3],[3,3]],"position":[2,1],"goal":[3,2]},"pre_transform_start":[1,2],"d4_symmetry":2,"physical_state_hash":"4c2f51c6fe277a526cd21fd63d5c9231e8f8af5040720252c9b194fa29f0da6d","canonical_source_id":"navigation_v3:4c2f51c6fe277a526cd21fd6","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.44,"south":0.56},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0.67,"1":0.27,"2":0.05,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:ece5534a79d5b60ec5f6832b","state_id":"navigation_v3:ece5534a79d5b60ec5f6832b","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(2,3); walls=(1,3),(2,2),(3,0),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . .\nrow 1: . A . #\nrow 2: . . # G\nrow 3: # . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 1, column 0).","east":"Move east to (row 1, column 2).","south":"Move south to (row 2, column 1).","north":"Move north to (row 0, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"west":0.25,"east":0.25,"south":0.25,"north":0.25},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","north","south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (1, 1), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,3],[2,2],[3,0],[3,3]],"position":[1,1],"goal":[2,3]},"pre_transform_start":[1,2],"d4_symmetry":4,"physical_state_hash":"ece5534a79d5b60ec5f6832bc9b2c685a83620c9ce75c59ef65c86de7fb45ed5","canonical_source_id":"navigation_v3:ece5534a79d5b60ec5f6832b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.1,"east":0.64,"south":0.25,"west":0.01},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0.03,"1":0.76,"2":0.17,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:d87976129601f969d2db11b4","state_id":"navigation_v3:d87976129601f969d2db11b4","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(1,0); walls=(1,3),(2,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . .\nrow 1: G . . #\nrow 2: . # . A\nrow 3: . . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 3, column 3).","west":"Move west to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"west","solvable":true,"value":1},"gold_probs":{"action":{"south":0.0,"west":1.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((1, 2), (2, 3), (3, 1))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,3],[2,1],[3,2]],"position":[2,3],"goal":[1,0]},"pre_transform_start":[2,3],"d4_symmetry":0,"physical_state_hash":"d87976129601f969d2db11b4f4ab6fde2cd0c025f41fd683eef07a7d27e77390","canonical_source_id":"navigation_v3:d87976129601f969d2db11b4","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.93,"south":0.07},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0.01,"1":0.66,"2":0.31,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:229f1d906abd7b2cf1d4f7d0","state_id":"navigation_v3:229f1d906abd7b2cf1d4f7d0","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(1,3); walls=(0,0),(0,1),(0,3),(1,1),(2,2),(2,3),(3,0),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # # . #\nrow 1: . # . G\nrow 2: . A # #\nrow 3: # . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 3, column 1).","west":"Move west to (row 2, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"south","solvable":false,"value":3},"gold_probs":{"action":{"south":0.5,"west":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (1, 2), (1, 3), (2, 0), (2, 1), (3, 0), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,1],[0,3],[1,1],[2,2],[2,3],[3,0],[3,2]],"position":[2,1],"goal":[1,3]},"pre_transform_start":[2,1],"d4_symmetry":5,"physical_state_hash":"229f1d906abd7b2cf1d4f7d01e62362014224c529b579a59cfb8785c68472986","canonical_source_id":"navigation_v3:229f1d906abd7b2cf1d4f7d0","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.75,"south":0.25},"solvable":{"false":0.19999999999999996,"true":0.8},"value":{"0":0.07,"1":0.67,"2":0.18,"3":0.08}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:7b684f8b72e1710826fb409d","state_id":"navigation_v3:7b684f8b72e1710826fb409d","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(2,2); walls=(1,0),(1,2),(1,3),(2,0),(2,1),(3,1),(3,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . A .\nrow 1: # . # #\nrow 2: # # G .\nrow 3: . # # #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 0, column 1).","east":"Move east to (row 0, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"west":0.5,"east":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (0, 1), (0, 2), (1, 2), (1, 3), (2, 0), (2, 1), (2, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,0],[1,2],[1,3],[2,0],[2,1],[3,1],[3,2],[3,3]],"position":[0,2],"goal":[2,2]},"pre_transform_start":[1,0],"d4_symmetry":1,"physical_state_hash":"7b684f8b72e1710826fb409dd692cdc3724c30b585aca39cfd16207c224bb0e9","canonical_source_id":"navigation_v3:7b684f8b72e1710826fb409d","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.67,"east":0.33},"solvable":{"false":0.35,"true":0.65},"value":{"0":0.1,"1":0.51,"2":0.19,"3":0.2}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:b36af0245f66917cbc5c5c5e","state_id":"navigation_v3:b36af0245f66917cbc5c5c5e","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(1,1); walls=(2,1),(2,2),(2,3),(3,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . . .\nrow 1: . G A .\nrow 2: . # # #\nrow 3: # . . .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 1, column 1).","east":"Move east to (row 1, column 3).","north":"Move north to (row 0, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"west","solvable":true,"value":0},"gold_probs":{"action":{"west":1.0,"east":0.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 3), (1, 2), (2, 2), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[2,1],[2,2],[2,3],[3,0]],"position":[1,2],"goal":[1,1]},"pre_transform_start":[1,1],"d4_symmetry":1,"physical_state_hash":"b36af0245f66917cbc5c5c5e94ea1b638cc1e95750c1ae47e354c2d700fb76c5","canonical_source_id":"navigation_v3:b36af0245f66917cbc5c5c5e","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":1,"north":0,"east":0},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0.96,"1":0.03,"2":0.01,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:ea74d2e0c980756736eb0013","state_id":"navigation_v3:ea74d2e0c980756736eb0013","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(1,3); walls=(0,0),(0,3),(1,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . #\nrow 1: . . # G\nrow 2: . . . .\nrow 3: . . A #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 2, column 2).","west":"Move west to (row 3, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":1},"gold_probs":{"action":{"north":1.0,"west":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 3), (1, 1), (3, 0))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,3],[1,2],[3,3]],"position":[3,2],"goal":[1,3]},"pre_transform_start":[1,0],"d4_symmetry":5,"physical_state_hash":"ea74d2e0c980756736eb0013e1b921d209bc5faa36259a64955331180a82851b","canonical_source_id":"navigation_v3:ea74d2e0c980756736eb0013","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.03,"north":0.97},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0.02,"1":0.8,"2":0.16,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:27e33ead580afbee48cf606b","state_id":"navigation_v3:27e33ead580afbee48cf606b","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(1,1); walls=(0,0),(0,3),(1,3),(3,0),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . #\nrow 1: . G . #\nrow 2: . A . .\nrow 3: # . # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"south":"Move south to (row 3, column 1).","north":"Move north to (row 1, column 1).","west":"Move west to (row 2, column 0).","east":"Move east to (row 2, column 2)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"north","solvable":true,"value":0},"gold_probs":{"action":{"south":0.0,"north":1.0,"west":0.0,"east":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":1.0,"1":0.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (0, 3), (1, 3), (3, 0), (3, 2))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,3],[1,3],[3,0],[3,2]],"position":[2,1],"goal":[1,1]},"pre_transform_start":[2,2],"d4_symmetry":1,"physical_state_hash":"27e33ead580afbee48cf606b309a21a28ba42c1196b754816a6b97b02d3cff95","canonical_source_id":"navigation_v3:27e33ead580afbee48cf606b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":1,"west":0,"east":0,"south":0},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":1,"1":0,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:ed641bc1180d8ce3c004ac29","state_id":"navigation_v3:ed641bc1180d8ce3c004ac29","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,0); goal=(2,3); walls=(0,0),(0,3),(1,2),(1,3),(2,2),(3,2),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . . #\nrow 1: . . # #\nrow 2: . . # G\nrow 3: A . # #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"north":"Move north to (row 2, column 0).","east":"Move east to (row 3, column 1)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"north":0.5,"east":0.5},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(0, 1):walls=((0, 0), (0, 2), (0, 3), (1, 0), (1, 1), (1, 2), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,3],[1,2],[1,3],[2,2],[3,2],[3,3]],"position":[3,0],"goal":[2,3]},"pre_transform_start":[0,0],"d4_symmetry":3,"physical_state_hash":"ed641bc1180d8ce3c004ac29b83f61ed565ab52a0cd3abbea2d9b4dcb8fa5372","canonical_source_id":"navigation_v3:ed641bc1180d8ce3c004ac29","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.38,"north":0.62},"solvable":{"false":0.37,"true":0.63},"value":{"0":0.01,"1":0.45,"2":0.4,"3":0.14}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:d3ed0f65248484b916fa0e12","state_id":"navigation_v3:d3ed0f65248484b916fa0e12","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(2,1); walls=(1,0),(1,1),(1,3),(2,2),(2,3),(3,0),(3,1),(3,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: . . A .\nrow 1: # # . #\nrow 2: . G # #\nrow 3: # # # .","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"west":"Move west to (row 0, column 1).","south":"Move south to (row 1, column 2).","east":"Move east to (row 0, column 3)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":false,"value":3},"gold_probs":{"action":{"west":0.3333333333333333,"south":0.3333333333333333,"east":0.3333333333333333},"solvable":{"false":1.0,"true":0.0},"value":{"0":0.0,"1":0.0,"2":0.0,"3":1.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east","south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (0, 1), (0, 2), (1, 2), (1, 3), (2, 0), (2, 1), (2, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[1,0],[1,1],[1,3],[2,2],[2,3],[3,0],[3,1],[3,2]],"position":[0,2],"goal":[2,1]},"pre_transform_start":[2,0],"d4_symmetry":7,"physical_state_hash":"d3ed0f65248484b916fa0e1254abf18c74ad13f7fa11af84931158ab2a07983a","canonical_source_id":"navigation_v3:d3ed0f65248484b916fa0e12","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.81,"west":0.18,"east":0.01},"solvable":{"false":0.17000000000000004,"true":0.83},"value":{"0":0.14,"1":0.69,"2":0.1,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |
| {"id":"navigation_v3:eb4cce3a6056df47d45913d6","state_id":"navigation_v3:eb4cce3a6056df47d45913d6","family_id":"grid_navigation_coordinates_v3","split":"dev","state":"Navigation validation state:\nGrid 4x4. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,0); goal=(2,2); walls=(0,0),(0,2),(1,1),(2,1),(3,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3\nrow 0: # . # .\nrow 1: . # . .\nrow 2: . # G .\nrow 3: A . . #","questions":{"action":{"type":"choice","instructions":"Choose a legal next step on a shortest route to the goal. If the goal is unreachable, all legal moves tie. Walls cannot be crossed.","criteria":{"east":"Move east to (row 3, column 1).","north":"Move north to (row 2, column 0)."}},"solvable":{"type":"boolean","instructions":"Can the agent reach the goal by legal orthogonal moves?"},"value":{"type":"score","instructions":"Classify the minimum number of legal steps from the current agent cell to the goal; use the unreachable category if no route exists.","criteria":["The goal is reachable in one or two steps.","The goal is reachable in three to five steps.","The goal is reachable in six or more steps.","The goal cannot be reached."]}},"gold":{"action":"east","solvable":true,"value":1},"gold_probs":{"action":{"east":1.0,"north":0.0},"solvable":{"false":0.0,"true":1.0},"value":{"0":0.0,"1":1.0,"2":0.0,"3":0.0}},"gold_probs_kind":{"action":"optimal_action_policy","solvable":"deterministic_truth","value":"deterministic_truth"},"gold_label_kind":{"action":"reference_argmax_compatibility","solvable":"deterministic_truth","value":"deterministic_truth"},"optimal_actions":{"action":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:4:goal=(1, 1):walls=((0, 0), (1, 2), (2, 2), (3, 1), (3, 3))","template_id":"navigation_v3:dev","language":"en","environment_state":{"game":"grid_navigation","size":4,"walls":[[0,0],[0,2],[1,1],[2,1],[3,3]],"position":[3,0],"goal":[2,2]},"pre_transform_start":[0,0],"d4_symmetry":3,"physical_state_hash":"eb4cce3a6056df47d45913d6a30f6b9899614a10309c1106113861bd9b4da744","canonical_source_id":"navigation_v3:eb4cce3a6056df47d45913d6","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.64,"east":0.36},"solvable":{"false":0.12,"true":0.88},"value":{"0":0.01,"1":0.6900000000000001,"2":0.24,"3":0.06}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}} | |