stage2/ood.jsonl

{"id":"navigation_v3:06b38a6ade0754de661819ad","state_id":"navigation_v3:06b38a6ade0754de661819ad","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(1,3); walls=(0,5),(1,1),(1,5),(3,3),(3,5),(4,0),(4,2),(5,0),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . #\nrow 1: . # . G . #\nrow 2: . A . . . .\nrow 3: . . . # . #\nrow 4: # . # . . .\nrow 5: # # . . . .","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":true,"value":1},"gold_probs":{"action":{"west":0.0,"south":0.0,"east":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":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 2):walls=((0, 0), (1, 0), (1, 4), (3, 0), (3, 2), (4, 3), (4, 5), (5, 4), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,5],[1,1],[1,5],[3,3],[3,5],[4,0],[4,2],[5,0],[5,1]],"position":[2,1],"goal":[1,3]},"pre_transform_start":[1,3],"d4_symmetry":3,"physical_state_hash":"06b38a6ade0754de661819ad0154e7eaeb47602af4c7cd8f65ae55181aef7a7e","canonical_source_id":"navigation_v3:06b38a6ade0754de661819ad","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,"south":0.02,"east":0.96},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0.08,"1":0.85,"2":0.06,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:b9d2b9987eed910e819ec68e","state_id":"navigation_v3:b9d2b9987eed910e819ec68e","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(2,4); walls=(0,0),(0,4),(1,1),(1,3),(1,4),(2,1),(2,3),(3,0),(3,1),(3,4),(3,5),(4,0),(4,5),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . A . # .\nrow 1: . # . # # .\nrow 2: . # . # G .\nrow 3: # # . . # #\nrow 4: # . . . . #\nrow 5: . . . . # .","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).","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":{"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:6:goal=(1, 2):walls=((0, 3), (0, 4), (1, 0), (1, 1), (1, 3), (1, 5), (2, 1), (2, 2), (4, 1), (4, 2), (4, 3), (5, 0), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,4],[1,1],[1,3],[1,4],[2,1],[2,3],[3,0],[3,1],[3,4],[3,5],[4,0],[4,5],[5,4]],"position":[0,2],"goal":[2,4]},"pre_transform_start":[3,0],"d4_symmetry":1,"physical_state_hash":"b9d2b9987eed910e819ec68e13b613e2e1fe7da012e4163ff3d154657f3f7007","canonical_source_id":"navigation_v3:b9d2b9987eed910e819ec68e","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.77,"west":0.02,"east":0.21},"solvable":{"false":0.25,"true":0.75},"value":{"0":0.02,"1":0.37,"2":0.44,"3":0.17}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:e3d96e8974464786ca16801a","state_id":"navigation_v3:e3d96e8974464786ca16801a","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(0,1); walls=(0,0),(0,4),(1,1),(1,2),(1,4),(3,2),(3,4),(4,0),(4,1),(4,4),(5,2),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # G . . # .\nrow 1: . # # . # .\nrow 2: . A . . . .\nrow 3: . . # . # .\nrow 4: # # . . # .\nrow 5: . . # # . .","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).","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":2},"gold_probs":{"action":{"east":1.0,"west":0.0,"south":0.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":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 1):walls=((0, 0), (0, 4), (1, 1), (1, 2), (1, 4), (3, 2), (3, 4), (4, 0), (4, 1), (4, 4), (5, 2), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,4],[1,1],[1,2],[1,4],[3,2],[3,4],[4,0],[4,1],[4,4],[5,2],[5,3]],"position":[2,1],"goal":[0,1]},"pre_transform_start":[1,3],"d4_symmetry":3,"physical_state_hash":"e3d96e8974464786ca16801a8e34ac4dfcea683e39af9ec7bfff75487df78387","canonical_source_id":"navigation_v3:e3d96e8974464786ca16801a","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.42,"south":0.07,"west":0.51},"solvable":{"false":0.30000000000000004,"true":0.7},"value":{"0":0.11,"1":0.52,"2":0.27,"3":0.1}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:fbe1e0c58c7f0b73946eeb38","state_id":"navigation_v3:fbe1e0c58c7f0b73946eeb38","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,0); goal=(0,1); walls=(0,4),(1,4),(2,0),(2,1),(3,1),(3,2),(4,1),(5,2),(5,3),(5,4),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . G . . # .\nrow 1: . . . . # .\nrow 2: # # . . . .\nrow 3: . # # . . .\nrow 4: . # . . . .\nrow 5: 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 5, column 1).","north":"Move north to (row 4, 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,"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":["east","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 1):walls=((0, 4), (1, 4), (2, 0), (2, 1), (3, 1), (3, 2), (4, 1), (5, 2), (5, 3), (5, 4), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,4],[1,4],[2,0],[2,1],[3,1],[3,2],[4,1],[5,2],[5,3],[5,4],[5,5]],"position":[5,0],"goal":[0,1]},"pre_transform_start":[0,0],"d4_symmetry":3,"physical_state_hash":"fbe1e0c58c7f0b73946eeb389ddd1afea9b620bd45daf7022c902d57271da4ff","canonical_source_id":"navigation_v3:fbe1e0c58c7f0b73946eeb38","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.14,"north":0.86},"solvable":{"false":0.15000000000000002,"true":0.85},"value":{"0":0.01,"1":0.12,"2":0.8,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:1b9064db0e40cacb9309d03c","state_id":"navigation_v3:1b9064db0e40cacb9309d03c","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,2); goal=(2,1); walls=(0,1),(0,5),(1,1),(1,2),(1,4),(2,2),(2,4),(3,0),(3,1),(3,4),(3,5),(4,0),(4,5),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . . . #\nrow 1: . # # . # .\nrow 2: . G # . # .\nrow 3: # # . . # #\nrow 4: # . . . . #\nrow 5: . # 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 5, column 3).","north":"Move north to (row 4, 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":{"east":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":["east","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 2):walls=((0, 3), (0, 4), (1, 0), (1, 1), (1, 3), (1, 5), (2, 1), (2, 2), (4, 1), (4, 2), (4, 3), (5, 0), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,5],[1,1],[1,2],[1,4],[2,2],[2,4],[3,0],[3,1],[3,4],[3,5],[4,0],[4,5],[5,1]],"position":[5,2],"goal":[2,1]},"pre_transform_start":[2,5],"d4_symmetry":7,"physical_state_hash":"1b9064db0e40cacb9309d03c9287566d4ab14c804981c415d56a3dbcd7a2ae79","canonical_source_id":"navigation_v3:1b9064db0e40cacb9309d03c","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.82,"east":0.18},"solvable":{"false":0.27,"true":0.73},"value":{"0":0.01,"1":0.2,"2":0.65,"3":0.14}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:a529d5abe85881c9f659a7d7","state_id":"navigation_v3:a529d5abe85881c9f659a7d7","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,1); goal=(5,3); walls=(2,1),(2,2),(2,4),(2,5),(3,4),(4,1),(4,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . A . . . .\nrow 1: . . . . . .\nrow 2: . # # . # #\nrow 3: . . . . # .\nrow 4: . # # . . .\nrow 5: . . . 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 0).","south":"Move south to (row 1, column 1).","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":"east","solvable":true,"value":2},"gold_probs":{"action":{"west":0.0,"south":0.5,"east":0.5},"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":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 2):walls=((1, 3), (1, 4), (2, 1), (3, 0), (3, 1), (3, 3), (3, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[2,1],[2,2],[2,4],[2,5],[3,4],[4,1],[4,2]],"position":[0,1],"goal":[5,3]},"pre_transform_start":[1,5],"d4_symmetry":3,"physical_state_hash":"a529d5abe85881c9f659a7d77f603473b3ffaf2a302729ed565fc942df113f4c","canonical_source_id":"navigation_v3:a529d5abe85881c9f659a7d7","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.71,"west":0.05,"east":0.24},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0,"1":0.05,"2":0.92,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:d3e1d2ffdeab537935a96356","state_id":"navigation_v3:d3e1d2ffdeab537935a96356","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,4); goal=(0,2); walls=(1,5),(2,1),(2,2),(2,3),(3,1),(3,2),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . G . A .\nrow 1: . . . . . #\nrow 2: . # # # . .\nrow 3: . # # . . .\nrow 4: . . . . . #\nrow 5: . . . . . .","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 3).","south":"Move south to (row 1, column 4).","east":"Move east to (row 0, column 5)."}},"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,"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":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 2):walls=((1, 5), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,5],[2,1],[2,2],[2,3],[3,1],[3,2],[4,5]],"position":[0,4],"goal":[0,2]},"pre_transform_start":[4,0],"d4_symmetry":7,"physical_state_hash":"d3e1d2ffdeab537935a963560abb17a9d956d2dfceb9fd46e64fb0fc8fca8395","canonical_source_id":"navigation_v3:d3e1d2ffdeab537935a96356","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,"east":0},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0.66,"1":0.26,"2":0.07,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:53d0165e341321ab56b81c37","state_id":"navigation_v3:53d0165e341321ab56b81c37","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,3); goal=(4,1); walls=(0,0),(1,1),(3,4),(5,0),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . . . . .\nrow 1: . # . . . .\nrow 2: . . . . . .\nrow 3: . . . A # .\nrow 4: . G . . . .\nrow 5: # . . . # .","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).","south":"Move south to (row 4, column 3).","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":"south","solvable":true,"value":1},"gold_probs":{"action":{"west":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":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 1):walls=((0, 0), (0, 4), (2, 4), (4, 1), (5, 0))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[1,1],[3,4],[5,0],[5,4]],"position":[3,3],"goal":[4,1]},"pre_transform_start":[2,3],"d4_symmetry":6,"physical_state_hash":"53d0165e341321ab56b81c37e6a0f368c1e5e2a0f9f76faf3a738fe5e84a3168","canonical_source_id":"navigation_v3:53d0165e341321ab56b81c37","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.7,"north":0.02,"south":0.28},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0.07,"1":0.88,"2":0.05,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:66a86c60acdb9d00f7fbe55d","state_id":"navigation_v3:66a86c60acdb9d00f7fbe55d","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,0); goal=(5,5); walls=(0,0),(0,2),(0,3),(1,0),(1,3),(2,1),(3,2),(4,1),(4,3),(4,4),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . # # . .\nrow 1: # . . # . .\nrow 2: . # . . . .\nrow 3: . . # . . .\nrow 4: . # . # # #\nrow 5: 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":{"east":"Move east to (row 5, column 1).","north":"Move north to (row 4, 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:6:goal=(0, 0):walls=((0, 1), (1, 1), (2, 1), (2, 4), (2, 5), (3, 2), (3, 5), (4, 1), (4, 3), (5, 4), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,2],[0,3],[1,0],[1,3],[2,1],[3,2],[4,1],[4,3],[4,4],[4,5]],"position":[5,0],"goal":[5,5]},"pre_transform_start":[0,0],"d4_symmetry":3,"physical_state_hash":"66a86c60acdb9d00f7fbe55db75be7956e350029770b72a3be9c8fbf42f7d67e","canonical_source_id":"navigation_v3:66a86c60acdb9d00f7fbe55d","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.91,"north":0.09},"solvable":{"false":0.09999999999999998,"true":0.9},"value":{"0":0.01,"1":0.91,"2":0.07,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:5417cacc80f9bfecd839fbd1","state_id":"navigation_v3:5417cacc80f9bfecd839fbd1","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,0); goal=(0,0); walls=(0,1),(0,5),(1,0),(1,2),(2,0),(2,2),(2,3),(3,2),(3,4),(3,5),(4,1),(4,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: G # . . . #\nrow 1: # . # . . .\nrow 2: # . # # . .\nrow 3: A . # . # #\nrow 4: . # . . # .\nrow 5: . . . . . .","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).","south":"Move south to (row 4, 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:6:goal=(0, 0):walls=((0, 1), (0, 2), (1, 0), (1, 4), (2, 1), (2, 2), (2, 3), (3, 2), (4, 3), (4, 4), (5, 0), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,5],[1,0],[1,2],[2,0],[2,2],[2,3],[3,2],[3,4],[3,5],[4,1],[4,4]],"position":[3,0],"goal":[0,0]},"pre_transform_start":[0,3],"d4_symmetry":7,"physical_state_hash":"5417cacc80f9bfecd839fbd1e138146e4b76f2172ddd6ebc5325a8d8eda83dd6","canonical_source_id":"navigation_v3:5417cacc80f9bfecd839fbd1","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.58,"south":0.42},"solvable":{"false":0.32999999999999996,"true":0.67},"value":{"0":0.01,"1":0.1,"2":0.68,"3":0.21}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:bb4ff081c6cc0db6fa6cd5ea","state_id":"navigation_v3:bb4ff081c6cc0db6fa6cd5ea","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(5,5); walls=(0,1),(0,2),(2,4),(3,2),(4,1),(4,2),(4,5),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # # . . .\nrow 1: . . . . . .\nrow 2: . . . A # .\nrow 3: . . # . . .\nrow 4: . # # . . #\nrow 5: . # . . . 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 3).","north":"Move north to (row 1, 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":true,"value":1},"gold_probs":{"action":{"south":1.0,"north":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":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 1), (1, 3), (3, 1), (3, 2), (3, 5), (4, 0), (4, 1), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,2],[2,4],[3,2],[4,1],[4,2],[4,5],[5,1]],"position":[2,3],"goal":[5,5]},"pre_transform_start":[3,2],"d4_symmetry":7,"physical_state_hash":"bb4ff081c6cc0db6fa6cd5ea7994f812a6d441b9066c9dbc92e325d477f1aae4","canonical_source_id":"navigation_v3:bb4ff081c6cc0db6fa6cd5ea","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.05,"south":0.86,"west":0.09},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0.01,"1":0.47,"2":0.5,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:3c7cbc922e27b78ab75b8e5c","state_id":"navigation_v3:3c7cbc922e27b78ab75b8e5c","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,5); goal=(2,0); walls=(0,1),(2,4),(3,4),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . . . .\nrow 1: . . . . . .\nrow 2: G . . . # .\nrow 3: . . . . # .\nrow 4: . . . . . A\nrow 5: . . . # . .","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 4, column 4).","north":"Move north to (row 3, column 5).","south":"Move south to (row 5, column 5)."}},"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":2},"gold_probs":{"action":{"west":1.0,"north":0.0,"south":0.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":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 2):walls=((1, 0), (3, 5), (4, 2), (4, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[2,4],[3,4],[5,3]],"position":[4,5],"goal":[2,0]},"pre_transform_start":[4,0],"d4_symmetry":4,"physical_state_hash":"3c7cbc922e27b78ab75b8e5c67deb887d5eb665258616a9e16e871ab67f0daf4","canonical_source_id":"navigation_v3:3c7cbc922e27b78ab75b8e5c","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,"south":0.01,"north":0.44},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0,"1":0.1,"2":0.88,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:86a0daf83a66a73cefcad479","state_id":"navigation_v3:86a0daf83a66a73cefcad479","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,1); goal=(4,4); walls=(0,0),(0,1),(1,3),(1,5),(2,3),(3,0),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # # . . . .\nrow 1: . . . # . #\nrow 2: . . . # . .\nrow 3: # A . . . .\nrow 4: . . . . G .\nrow 5: . # . . . .","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 4, column 1).","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":1},"gold_probs":{"action":{"south":0.5,"north":0.0,"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:6:goal=(1, 1):walls=((0, 4), (2, 3), (2, 4), (4, 0), (4, 5), (5, 2), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,1],[1,3],[1,5],[2,3],[3,0],[5,1]],"position":[3,1],"goal":[4,4]},"pre_transform_start":[1,3],"d4_symmetry":7,"physical_state_hash":"86a0daf83a66a73cefcad4794326d71bcd423003f115503bcb4fa86c1848c28b","canonical_source_id":"navigation_v3:86a0daf83a66a73cefcad479","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.82,"south":0.15,"north":0.03},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0,"1":0.52,"2":0.46,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:a06b2f9969188cca2b756c94","state_id":"navigation_v3:a06b2f9969188cca2b756c94","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,4); goal=(5,5); walls=(0,1),(1,1),(1,3),(3,0),(4,4),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . . A .\nrow 1: . # . # . .\nrow 2: . . . . . .\nrow 3: # . . . . .\nrow 4: . . . . # .\nrow 5: . . . . # 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 3).","south":"Move south to (row 1, column 4).","east":"Move east to (row 0, column 5)."}},"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":2},"gold_probs":{"action":{"west":0.0,"south":0.5,"east":0.5},"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":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 1), (1, 1), (2, 5), (4, 2), (4, 4), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[1,1],[1,3],[3,0],[4,4],[5,4]],"position":[0,4],"goal":[5,5]},"pre_transform_start":[0,4],"d4_symmetry":0,"physical_state_hash":"a06b2f9969188cca2b756c9407d721d41e21593181143b53b1df9a707412e77a","canonical_source_id":"navigation_v3:a06b2f9969188cca2b756c94","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.58,"west":0.06,"east":0.36},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0.01,"1":0.28,"2":0.67,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:e8d30e9a1c42a58d0146165b","state_id":"navigation_v3:e8d30e9a1c42a58d0146165b","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,4); goal=(0,2); walls=(0,1),(1,1),(1,2),(1,4),(2,2),(2,5),(3,0),(3,1),(4,1),(4,2),(4,4),(4,5),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # G . A .\nrow 1: . # # . # .\nrow 2: . . # . . #\nrow 3: # # . . . .\nrow 4: . # # . # #\nrow 5: . . . . . #","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 5).","west":"Move west 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":"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:6:goal=(0, 2):walls=((0, 1), (1, 1), (1, 2), (1, 4), (2, 2), (2, 5), (3, 0), (3, 1), (4, 1), (4, 2), (4, 4), (4, 5), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[1,1],[1,2],[1,4],[2,2],[2,5],[3,0],[3,1],[4,1],[4,2],[4,4],[4,5],[5,5]],"position":[0,4],"goal":[0,2]},"pre_transform_start":[5,1],"d4_symmetry":2,"physical_state_hash":"e8d30e9a1c42a58d0146165b715dd31aa4192fcfa0f2d2b8c98e880cf43f5ca7","canonical_source_id":"navigation_v3:e8d30e9a1c42a58d0146165b","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,"west":0.99},"solvable":{"false":0.18999999999999995,"true":0.81},"value":{"0":0.32,"1":0.45,"2":0.17,"3":0.06}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:78f40c4c56319adc5c583aec","state_id":"navigation_v3:78f40c4c56319adc5c583aec","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(4,1); walls=(0,0),(0,3),(1,1),(1,2),(1,5),(2,0),(2,5),(3,1),(3,2),(3,3),(4,0),(4,4),(4,5),(5,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . . # . .\nrow 1: . # # . . #\nrow 2: # . A . . #\nrow 3: . # # # . .\nrow 4: # G . . # #\nrow 5: # . . . . .","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).","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":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:6:goal=(1, 1):walls=((0, 0), (0, 1), (0, 3), (0, 5), (1, 2), (1, 4), (2, 2), (2, 4), (3, 2), (3, 5), (4, 1), (5, 1), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,3],[1,1],[1,2],[1,5],[2,0],[2,5],[3,1],[3,2],[3,3],[4,0],[4,4],[4,5],[5,0]],"position":[2,2],"goal":[4,1]},"pre_transform_start":[2,3],"d4_symmetry":3,"physical_state_hash":"78f40c4c56319adc5c583aec91ab18cad02357e786a0095f1cf90e8197fd2cbb","canonical_source_id":"navigation_v3:78f40c4c56319adc5c583aec","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.23,"west":0.77},"solvable":{"false":0.22999999999999998,"true":0.77},"value":{"0":0.05,"1":0.53,"2":0.32,"3":0.1}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:f8a2fb83b4666062e562f8e0","state_id":"navigation_v3:f8a2fb83b4666062e562f8e0","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(4,3); walls=(0,2),(1,1),(1,3),(2,1),(3,0),(3,1),(3,3),(4,2),(5,1),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . . .\nrow 1: . # . # . .\nrow 2: . # A . . .\nrow 3: # # . # . .\nrow 4: . . # G . .\nrow 5: . # . # . .","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":"east","solvable":true,"value":1},"gold_probs":{"action":{"south":0.0,"north":0.0,"east":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":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 2):walls=((0, 2), (0, 4), (1, 3), (2, 2), (2, 4), (2, 5), (3, 4), (4, 2), (4, 4), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[1,1],[1,3],[2,1],[3,0],[3,1],[3,3],[4,2],[5,1],[5,3]],"position":[2,2],"goal":[4,3]},"pre_transform_start":[2,2],"d4_symmetry":0,"physical_state_hash":"f8a2fb83b4666062e562f8e00b58b35ed86b70e65eff743f39be9c1bb0fa5956","canonical_source_id":"navigation_v3:f8a2fb83b4666062e562f8e0","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.09,"south":0.55,"east":0.36},"solvable":{"false":0.21999999999999997,"true":0.78},"value":{"0":0.02,"1":0.59,"2":0.28,"3":0.11}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:91d2353ccaf4ad9937c8d9a5","state_id":"navigation_v3:91d2353ccaf4ad9937c8d9a5","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(1,0); walls=(1,4),(3,0),(3,1),(3,3),(3,4),(4,5),(5,0),(5,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: G . . . # .\nrow 2: . A . . . .\nrow 3: # # . # # .\nrow 4: . . . . . #\nrow 5: # . # . . .","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).","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":true,"value":0},"gold_probs":{"action":{"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:6:goal=(0, 1):walls=((0, 3), (0, 5), (1, 3), (2, 5), (3, 3), (4, 1), (4, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,4],[3,0],[3,1],[3,3],[3,4],[4,5],[5,0],[5,2]],"position":[2,1],"goal":[1,0]},"pre_transform_start":[1,2],"d4_symmetry":7,"physical_state_hash":"91d2353ccaf4ad9937c8d9a558d1ffc9b5275899bbb6edf7f03f8ff15f7cd72a","canonical_source_id":"navigation_v3:91d2353ccaf4ad9937c8d9a5","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.66,"east":0.01},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0.67,"1":0.28,"2":0.04,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:c1764c14bb3c02406969ceb7","state_id":"navigation_v3:c1764c14bb3c02406969ceb7","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(3,0); walls=(0,1),(2,0),(4,0),(5,2),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . . . .\nrow 1: . A . . . .\nrow 2: # . . . . .\nrow 3: G . . . . .\nrow 4: # . . . . .\nrow 5: . . # . . #","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).","south":"Move south to (row 2, column 1).","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":1},"gold_probs":{"action":{"east":0.0,"south":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":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 2):walls=((0, 1), (0, 3), (1, 5), (2, 0), (5, 0))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[2,0],[4,0],[5,2],[5,5]],"position":[1,1],"goal":[3,0]},"pre_transform_start":[1,1],"d4_symmetry":7,"physical_state_hash":"c1764c14bb3c02406969ceb78dd7c2fbd17bf99595878c450a02db9db38727ce","canonical_source_id":"navigation_v3:c1764c14bb3c02406969ceb7","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.32,"west":0.64,"east":0.04},"solvable":{"false":0.09999999999999998,"true":0.9},"value":{"0":0.11,"1":0.76,"2":0.12,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:aa657303e62d7b1a44f3636b","state_id":"navigation_v3:aa657303e62d7b1a44f3636b","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,1); goal=(5,1); walls=(1,0),(1,1),(2,5),(3,1),(3,2),(4,3),(5,2),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: # # . . . .\nrow 2: . . . . . #\nrow 3: . # # . . .\nrow 4: . A . # . .\nrow 5: . 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 4, column 2).","west":"Move west to (row 4, column 0).","south":"Move south to (row 5, 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,"west":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:6:goal=(0, 1):walls=((0, 2), (0, 5), (1, 3), (2, 1), (2, 2), (3, 5), (4, 0), (4, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,0],[1,1],[2,5],[3,1],[3,2],[4,3],[5,2],[5,5]],"position":[4,1],"goal":[5,1]},"pre_transform_start":[4,1],"d4_symmetry":0,"physical_state_hash":"aa657303e62d7b1a44f3636b4f80b318d7c0de02acc50b2477f1a517cdd37525","canonical_source_id":"navigation_v3:aa657303e62d7b1a44f3636b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.03,"south":0.92,"west":0.05},"solvable":{"false":0.28,"true":0.72},"value":{"0":0.56,"1":0.24,"2":0.11,"3":0.09}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:2497b25b1b94ac41fa92c55c","state_id":"navigation_v3:2497b25b1b94ac41fa92c55c","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,4); goal=(1,2); walls=(0,0),(1,0),(1,4),(3,0),(3,2),(4,3),(4,5),(5,4),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . . . . .\nrow 1: # . G . # .\nrow 2: . . . . . .\nrow 3: # . # . A .\nrow 4: . . . # . #\nrow 5: . . . . # #","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 3).","east":"Move east to (row 3, column 5).","north":"Move north to (row 2, column 4).","south":"Move south to (row 4, column 4)."}},"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,"east":0.0,"north":0.5,"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","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 2):walls=((0, 0), (1, 0), (1, 4), (3, 0), (3, 2), (4, 3), (4, 5), (5, 4), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[1,0],[1,4],[3,0],[3,2],[4,3],[4,5],[5,4],[5,5]],"position":[3,4],"goal":[1,2]},"pre_transform_start":[1,2],"d4_symmetry":5,"physical_state_hash":"2497b25b1b94ac41fa92c55cadd46a4de5121665ec63f77ccc5aa068e50a9154","canonical_source_id":"navigation_v3:2497b25b1b94ac41fa92c55c","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.01,"west":0.33,"south":0.01},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0.01,"1":0.73,"2":0.25,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:72180bbef1ccd1a05df14848","state_id":"navigation_v3:72180bbef1ccd1a05df14848","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,3); goal=(3,2); walls=(0,1),(1,2),(1,5),(2,2),(3,0),(3,1),(3,4),(3,5),(4,0),(4,4),(5,1),(5,2),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . . . .\nrow 1: . . # A . #\nrow 2: . . # . . .\nrow 3: # # G . # #\nrow 4: # . . . # .\nrow 5: . # # . # .","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 4).","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":1},"gold_probs":{"action":{"east":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:6:goal=(2, 2):walls=((0, 1), (0, 2), (0, 4), (1, 0), (1, 4), (2, 0), (2, 1), (2, 4), (2, 5), (3, 2), (4, 2), (4, 5), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[1,2],[1,5],[2,2],[3,0],[3,1],[3,4],[3,5],[4,0],[4,4],[5,1],[5,2],[5,4]],"position":[1,3],"goal":[3,2]},"pre_transform_start":[3,4],"d4_symmetry":3,"physical_state_hash":"72180bbef1ccd1a05df14848ce8588ee50b014915f4d542b377b5453062e8475","canonical_source_id":"navigation_v3:72180bbef1ccd1a05df14848","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.09,"north":0.06,"south":0.85},"solvable":{"false":0.22999999999999998,"true":0.77},"value":{"0":0.1,"1":0.63,"2":0.19,"3":0.08}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:c2f0c440eb8db8d9616b0bf9","state_id":"navigation_v3:c2f0c440eb8db8d9616b0bf9","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,5); goal=(2,1); walls=(0,0),(0,1),(0,2),(0,3),(0,4),(1,0),(1,5),(2,2),(2,3),(2,4),(3,5),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # # # # # .\nrow 1: # . . . . #\nrow 2: . G # # # .\nrow 3: . . . . . #\nrow 4: . . . . . A\nrow 5: . . . . # .","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 5, column 5).","west":"Move west to (row 4, column 4)."}},"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":2},"gold_probs":{"action":{"south":0.0,"west":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":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 2):walls=((0, 0), (0, 1), (1, 0), (2, 0), (2, 2), (3, 0), (3, 2), (4, 0), (4, 2), (4, 5), (5, 1), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,1],[0,2],[0,3],[0,4],[1,0],[1,5],[2,2],[2,3],[2,4],[3,5],[5,4]],"position":[4,5],"goal":[2,1]},"pre_transform_start":[0,4],"d4_symmetry":1,"physical_state_hash":"c2f0c440eb8db8d9616b0bf9693a23951d21de7220867ad9e358ce4d4421bfaf","canonical_source_id":"navigation_v3:c2f0c440eb8db8d9616b0bf9","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.04,"west":0.96},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0,"1":0.24,"2":0.71,"3":0.05}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:1f6d777e8429bf1923c17381","state_id":"navigation_v3:1f6d777e8429bf1923c17381","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,1); goal=(0,3); walls=(0,0),(0,2),(0,5),(1,0),(1,1),(1,3),(1,4),(2,3),(2,4),(2,5),(3,0),(3,2),(3,5),(4,5),(5,3),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . # G . #\nrow 1: # # . # # .\nrow 2: . . . # # #\nrow 3: # . # . . #\nrow 4: . A . . . #\nrow 5: . . . # # .","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 5, column 1).","north":"Move north to (row 3, column 1).","east":"Move east to (row 4, column 2).","west":"Move west to (row 4, 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.25,"north":0.25,"east":0.25,"west":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:6:goal=(0, 2):walls=((0, 0), (0, 3), (0, 5), (1, 1), (1, 2), (1, 4), (1, 5), (2, 0), (2, 1), (2, 2), (3, 0), (3, 3), (3, 5), (4, 0), (5, 1), (5, 2))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,2],[0,5],[1,0],[1,1],[1,3],[1,4],[2,3],[2,4],[2,5],[3,0],[3,2],[3,5],[4,5],[5,3],[5,4]],"position":[4,1],"goal":[0,3]},"pre_transform_start":[1,1],"d4_symmetry":3,"physical_state_hash":"1f6d777e8429bf1923c1738178d93c5137ec229936359c507f6afa868b5f5b58","canonical_source_id":"navigation_v3:1f6d777e8429bf1923c17381","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.56,"east":0.39,"south":0.02},"solvable":{"false":0.27,"true":0.73},"value":{"0":0.01,"1":0.2,"2":0.67,"3":0.12}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:a918179cd7923b3f3d591284","state_id":"navigation_v3:a918179cd7923b3f3d591284","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,5); goal=(5,3); walls=(0,2),(0,4),(1,0),(2,2),(2,4),(4,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . # .\nrow 1: # . . . . .\nrow 2: . . # . # A\nrow 3: . . . . . .\nrow 4: . . . # . .\nrow 5: . . . 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 5).","south":"Move south to (row 3, column 5)."}},"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:6:goal=(0, 2):walls=((1, 2), (3, 1), (3, 3), (4, 5), (5, 1), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,4],[1,0],[2,2],[2,4],[4,3]],"position":[2,5],"goal":[5,3]},"pre_transform_start":[5,2],"d4_symmetry":7,"physical_state_hash":"a918179cd7923b3f3d5912843aa5256822ec88e77cb5dccdb9b0a3a05d61454b","canonical_source_id":"navigation_v3:a918179cd7923b3f3d591284","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.08,"south":0.92},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0,"1":0.41,"2":0.57,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:4ad7539f8a5b7db28c13ad2e","state_id":"navigation_v3:4ad7539f8a5b7db28c13ad2e","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,3); goal=(3,1); walls=(0,1),(0,3),(0,4),(1,1),(1,4),(2,0),(2,3),(2,4),(3,0),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . # # .\nrow 1: . # . . # .\nrow 2: # . . # # .\nrow 3: # G . A . .\nrow 4: . . . . . #\nrow 5: . . . . . .","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 4, column 3).","west":"Move west to (row 3, column 2).","east":"Move east to (row 3, column 4)."}},"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},"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:6:goal=(1, 2):walls=((0, 2), (0, 3), (1, 4), (1, 5), (3, 3), (3, 5), (4, 3), (4, 4), (4, 5), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,3],[0,4],[1,1],[1,4],[2,0],[2,3],[2,4],[3,0],[4,5]],"position":[3,3],"goal":[3,1]},"pre_transform_start":[3,3],"d4_symmetry":7,"physical_state_hash":"4ad7539f8a5b7db28c13ad2e55571c5da592c3acabc3ea8e51433b78f00564ea","canonical_source_id":"navigation_v3:4ad7539f8a5b7db28c13ad2e","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.99,"south":0.01},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0.45,"1":0.44,"2":0.09,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:31bd934ee170b84a723c72cf","state_id":"navigation_v3:31bd934ee170b84a723c72cf","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,2); goal=(0,0); walls=(1,1),(1,4),(1,5),(2,0),(2,2),(2,5),(3,5),(4,0),(4,3),(4,4),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: G . . . . .\nrow 1: . # . . # #\nrow 2: # . # . . #\nrow 3: . . . . . #\nrow 4: # . A # # .\nrow 5: . # . . . .","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 4, column 1).","north":"Move north to (row 3, column 2).","south":"Move south to (row 5, 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":2},"gold_probs":{"action":{"west":0.0,"north":1.0,"south":0.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:6:goal=(0, 0):walls=((0, 2), (0, 4), (1, 1), (1, 5), (2, 2), (3, 4), (4, 1), (4, 4), (5, 1), (5, 2), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,1],[1,4],[1,5],[2,0],[2,2],[2,5],[3,5],[4,0],[4,3],[4,4],[5,1]],"position":[4,2],"goal":[0,0]},"pre_transform_start":[4,2],"d4_symmetry":0,"physical_state_hash":"31bd934ee170b84a723c72cfd1e88bc04bd6669057270aafbb7248bfa1b01faf","canonical_source_id":"navigation_v3:31bd934ee170b84a723c72cf","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.02,"west":0.14,"north":0.84},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0,"1":0.15,"2":0.8,"3":0.05}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:4f495d72e60cff775031d08d","state_id":"navigation_v3:4f495d72e60cff775031d08d","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,3); goal=(2,0); walls=(0,4),(0,5),(3,0),(3,5),(5,0),(5,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . # #\nrow 1: . . . . . .\nrow 2: G . . . . .\nrow 3: # . . A . #\nrow 4: . . . . . .\nrow 5: # . # . . .","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).","south":"Move south to (row 4, column 3).","east":"Move east to (row 3, column 4).","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,"south":0.0,"east":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:6:goal=(0, 2):walls=((0, 3), (0, 5), (2, 5), (4, 0), (5, 0), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,4],[0,5],[3,0],[3,5],[5,0],[5,2]],"position":[3,3],"goal":[2,0]},"pre_transform_start":[2,3],"d4_symmetry":1,"physical_state_hash":"4f495d72e60cff775031d08da069fcfcaaaa322f1c600c5717aaa8eaffba75aa","canonical_source_id":"navigation_v3:4f495d72e60cff775031d08d","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.51,"west":0.47,"south":0.01,"east":0.01},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0.01,"1":0.76,"2":0.22,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:e91929cf93d3fdb47469c5a1","state_id":"navigation_v3:e91929cf93d3fdb47469c5a1","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(0,3); walls=(0,4),(1,3),(1,5),(3,1),(3,3),(4,2),(4,4),(4,5),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . G # .\nrow 1: . . A # . #\nrow 2: . . . . . .\nrow 3: . # . # . .\nrow 4: . . # . # #\nrow 5: . . . . # .","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":"north","solvable":true,"value":0},"gold_probs":{"action":{"west":0.0,"south":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:6:goal=(0, 2):walls=((0, 1), (1, 0), (1, 2), (3, 2), (3, 4), (4, 0), (4, 1), (4, 3), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,4],[1,3],[1,5],[3,1],[3,3],[4,2],[4,4],[4,5],[5,4]],"position":[1,2],"goal":[0,3]},"pre_transform_start":[4,2],"d4_symmetry":6,"physical_state_hash":"e91929cf93d3fdb47469c5a16020837772b2b9ad69dbb4e8c9d15c8e4435b348","canonical_source_id":"navigation_v3:e91929cf93d3fdb47469c5a1","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.08,"west":0.01,"north":0.91},"solvable":{"false":0.24,"true":0.76},"value":{"0":0.18,"1":0.67,"2":0.12,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:d75011efd7a866fd4cbb30a8","state_id":"navigation_v3:d75011efd7a866fd4cbb30a8","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,4); goal=(0,0); walls=(0,5),(1,1),(1,2),(1,4),(2,3),(3,2),(3,3),(4,1),(4,4),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: G . . . . #\nrow 1: . # # . # .\nrow 2: . . . # . .\nrow 3: . . # # A .\nrow 4: . # . . # #\nrow 5: . . . . . .","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 4).","east":"Move east to (row 3, column 5)."}},"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:6:goal=(0, 0):walls=((0, 5), (1, 1), (1, 2), (1, 4), (2, 3), (3, 2), (3, 3), (4, 1), (4, 4), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,5],[1,1],[1,2],[1,4],[2,3],[3,2],[3,3],[4,1],[4,4],[4,5]],"position":[3,4],"goal":[0,0]},"pre_transform_start":[2,4],"d4_symmetry":6,"physical_state_hash":"d75011efd7a866fd4cbb30a82854c30bd68c929bc0aafd1ba542d899b115d025","canonical_source_id":"navigation_v3:d75011efd7a866fd4cbb30a8","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.8,"east":0.2},"solvable":{"false":0.14,"true":0.86},"value":{"0":0,"1":0.07,"2":0.86,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:f18b616ed6fd5d8bd976556b","state_id":"navigation_v3:f18b616ed6fd5d8bd976556b","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,2); goal=(1,1); walls=(0,0),(0,1),(0,3),(0,5),(1,2),(1,4),(2,2),(2,4),(3,2),(3,5),(4,1),(5,1),(5,3),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # # . # . #\nrow 1: . G # . # .\nrow 2: . . # . # .\nrow 3: . . # . . #\nrow 4: . # A . . .\nrow 5: . # . # # .","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 5, column 2).","east":"Move east to (row 4, 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":{"south":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","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 1):walls=((0, 0), (0, 1), (0, 3), (0, 5), (1, 2), (1, 4), (2, 2), (2, 4), (3, 2), (3, 5), (4, 1), (5, 1), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,1],[0,3],[0,5],[1,2],[1,4],[2,2],[2,4],[3,2],[3,5],[4,1],[5,1],[5,3],[5,4]],"position":[4,2],"goal":[1,1]},"pre_transform_start":[4,2],"d4_symmetry":0,"physical_state_hash":"f18b616ed6fd5d8bd976556b9a294923be85f481c1f33542e9e80e37121ccd3b","canonical_source_id":"navigation_v3:f18b616ed6fd5d8bd976556b","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,"east":0.86},"solvable":{"false":0.22999999999999998,"true":0.77},"value":{"0":0.01,"1":0.32,"2":0.5599999999999999,"3":0.11}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:1bf0beaa1bbad6504f6a9441","state_id":"navigation_v3:1bf0beaa1bbad6504f6a9441","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,5); goal=(0,0); walls=(0,1),(0,2),(1,0),(1,4),(2,1),(2,2),(2,3),(3,2),(4,3),(4,4),(5,0),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: G # # . . .\nrow 1: # . . . # A\nrow 2: . # # # . .\nrow 3: . . # . . .\nrow 4: . . . # # .\nrow 5: # . . # . .","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 5).","south":"Move south to (row 2, column 5)."}},"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:6:goal=(0, 0):walls=((0, 1), (0, 2), (1, 0), (1, 4), (2, 1), (2, 2), (2, 3), (3, 2), (4, 3), (4, 4), (5, 0), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,2],[1,0],[1,4],[2,1],[2,2],[2,3],[3,2],[4,3],[4,4],[5,0],[5,3]],"position":[1,5],"goal":[0,0]},"pre_transform_start":[1,5],"d4_symmetry":0,"physical_state_hash":"1bf0beaa1bbad6504f6a94415a42f6966c9571f9f9daef4fb339a74c8fe217ad","canonical_source_id":"navigation_v3:1bf0beaa1bbad6504f6a9441","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.62,"south":0.38},"solvable":{"false":0.28,"true":0.72},"value":{"0":0.01,"1":0.1,"2":0.74,"3":0.15}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:a3ab94ea640645235db1aa96","state_id":"navigation_v3:a3ab94ea640645235db1aa96","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,1); goal=(5,3); walls=(0,2),(0,5),(1,5),(3,0),(5,0),(5,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . . #\nrow 1: . . . . . #\nrow 2: . . . . . .\nrow 3: # A . . . .\nrow 4: . . . . . .\nrow 5: # . # 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 3, column 2).","south":"Move south to (row 4, column 1).","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":"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:6:goal=(0, 2):walls=((0, 3), (0, 5), (2, 5), (4, 0), (5, 0), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,5],[1,5],[3,0],[5,0],[5,2]],"position":[3,1],"goal":[5,3]},"pre_transform_start":[3,4],"d4_symmetry":4,"physical_state_hash":"a3ab94ea640645235db1aa96ab25ae4c39009e3f2cce0ae07943ffd0baed8ff2","canonical_source_id":"navigation_v3:a3ab94ea640645235db1aa96","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.44,"south":0.54},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0,"1":0.63,"2":0.36,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:aacf82dc365d92816daecf2a","state_id":"navigation_v3:aacf82dc365d92816daecf2a","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,4); goal=(3,3); walls=(0,1),(0,2),(1,0),(1,3),(1,4),(2,0),(2,3),(3,1),(3,4),(3,5),(4,5),(5,1),(5,3),(5,4),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # # . A .\nrow 1: # . . # # .\nrow 2: # . . # . .\nrow 3: . # . G # #\nrow 4: . . . . . #\nrow 5: . # . # # #","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 5).","west":"Move west 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":{"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:6:goal=(2, 2):walls=((0, 0), (0, 1), (0, 2), (0, 4), (1, 0), (2, 0), (2, 1), (2, 4), (3, 2), (3, 5), (4, 1), (4, 2), (4, 5), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,2],[1,0],[1,3],[1,4],[2,0],[2,3],[3,1],[3,4],[3,5],[4,5],[5,1],[5,3],[5,4],[5,5]],"position":[0,4],"goal":[3,3]},"pre_transform_start":[5,1],"d4_symmetry":2,"physical_state_hash":"aacf82dc365d92816daecf2a378da8dbd8679bec1ca576b58e0b0484abed80e0","canonical_source_id":"navigation_v3:aacf82dc365d92816daecf2a","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.94,"east":0.06},"solvable":{"false":0.13,"true":0.87},"value":{"0":0.02,"1":0.56,"2":0.34,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:ae09bff998cffe1c9aa85138","state_id":"navigation_v3:ae09bff998cffe1c9aa85138","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,5); goal=(5,0); walls=(1,1),(1,4),(1,5),(2,2),(2,3),(3,3),(4,1),(4,2),(4,4),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: . # . . # #\nrow 2: . . # # . .\nrow 3: . . . # . A\nrow 4: . # # . # .\nrow 5: 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 4, column 5).","north":"Move north to (row 2, column 5).","west":"Move west to (row 3, column 4)."}},"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:6:goal=(0, 0):walls=((0, 5), (1, 1), (1, 2), (1, 4), (2, 3), (3, 2), (3, 3), (4, 1), (4, 4), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,1],[1,4],[1,5],[2,2],[2,3],[3,3],[4,1],[4,2],[4,4],[5,5]],"position":[3,5],"goal":[5,0]},"pre_transform_start":[3,5],"d4_symmetry":0,"physical_state_hash":"ae09bff998cffe1c9aa85138e2aaa591cedd0bb07f8699b2f14ad6b76f51e82e","canonical_source_id":"navigation_v3:ae09bff998cffe1c9aa85138","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.36,"west":0.5,"north":0.14},"solvable":{"false":0.14,"true":0.86},"value":{"0":0,"1":0.09,"2":0.83,"3":0.08}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:a4ab55c2162e48c5ae6e0c87","state_id":"navigation_v3:a4ab55c2162e48c5ae6e0c87","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,4); goal=(4,0); walls=(1,5),(3,3),(4,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . A .\nrow 1: . . . . . #\nrow 2: . . . . . .\nrow 3: . . . # . .\nrow 4: G . . # . .\nrow 5: . . . . . .","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 4).","east":"Move east to (row 0, column 5).","west":"Move west 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":2},"gold_probs":{"action":{"south":0.5,"east":0.0,"west":0.5},"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":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 1):walls=((3, 1), (3, 2), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,5],[3,3],[4,3]],"position":[0,4],"goal":[4,0]},"pre_transform_start":[0,1],"d4_symmetry":4,"physical_state_hash":"a4ab55c2162e48c5ae6e0c87e45af9f1abb402b542441fe28ccfd6ee00da7b35","canonical_source_id":"navigation_v3:a4ab55c2162e48c5ae6e0c87","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.31,"west":0.68},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0,"1":0.14,"2":0.85,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:7c86b04ecffb0ebf66c110cf","state_id":"navigation_v3:7c86b04ecffb0ebf66c110cf","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,5); goal=(4,4); walls=(0,0),(0,3),(1,0),(1,5),(3,1),(3,2),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . . # . .\nrow 1: # . . . . #\nrow 2: . . . . . .\nrow 3: . # # . . .\nrow 4: . . . . G A\nrow 5: . # . . . .","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 4, column 4).","south":"Move south to (row 5, column 5).","north":"Move north to (row 3, column 5)."}},"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,"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:6:goal=(1, 1):walls=((0, 4), (2, 3), (2, 4), (4, 0), (4, 5), (5, 2), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,3],[1,0],[1,5],[3,1],[3,2],[5,1]],"position":[4,5],"goal":[4,4]},"pre_transform_start":[4,5],"d4_symmetry":0,"physical_state_hash":"7c86b04ecffb0ebf66c110cfdb053b17211d44067bb0cc13ebf55254a9123e0b","canonical_source_id":"navigation_v3:7c86b04ecffb0ebf66c110cf","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,"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:cdd8246afed07b5c8b51901d","state_id":"navigation_v3:cdd8246afed07b5c8b51901d","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,5); goal=(5,1); walls=(1,5),(2,3),(3,0),(4,2),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: . . . . . #\nrow 2: . . . # . .\nrow 3: # . . . . A\nrow 4: . . # . . #\nrow 5: . 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 3, column 4).","north":"Move north to (row 2, column 5)."}},"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":2},"gold_probs":{"action":{"west":1.0,"north":0.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":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 1):walls=((1, 2), (1, 5), (2, 0), (3, 3), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,5],[2,3],[3,0],[4,2],[4,5]],"position":[3,5],"goal":[5,1]},"pre_transform_start":[5,2],"d4_symmetry":3,"physical_state_hash":"cdd8246afed07b5c8b51901d00e0968749d2f483ffa1c57196f668175e466b27","canonical_source_id":"navigation_v3:cdd8246afed07b5c8b51901d","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.84,"north":0.16},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0,"1":0.22,"2":0.75,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:19c1bcf27c137c81a06ff690","state_id":"navigation_v3:19c1bcf27c137c81a06ff690","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(5,1); walls=(0,2),(0,3),(1,0),(1,1),(1,4),(2,2),(2,4),(4,1),(4,2),(4,4),(5,0),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # # . .\nrow 1: # # . . # .\nrow 2: . A # . # .\nrow 3: . . . . . .\nrow 4: . # # . # .\nrow 5: # 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 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":true,"value":2},"gold_probs":{"action":{"south":1.0,"west":0.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":["south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 1):walls=((0, 0), (0, 4), (1, 1), (1, 2), (1, 4), (3, 2), (3, 4), (4, 0), (4, 1), (4, 4), (5, 2), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,3],[1,0],[1,1],[1,4],[2,2],[2,4],[4,1],[4,2],[4,4],[5,0],[5,4]],"position":[2,1],"goal":[5,1]},"pre_transform_start":[1,2],"d4_symmetry":7,"physical_state_hash":"19c1bcf27c137c81a06ff69011537b797b4824eefa70dacb0ccf0f0806c6e17e","canonical_source_id":"navigation_v3:19c1bcf27c137c81a06ff690","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.84,"west":0.16},"solvable":{"false":0.09999999999999998,"true":0.9},"value":{"0":0.01,"1":0.48,"2":0.45,"3":0.06}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:e26a06a48c256f8e21360dac","state_id":"navigation_v3:e26a06a48c256f8e21360dac","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,3); goal=(1,4); walls=(0,1),(0,5),(2,1),(4,4),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . . . #\nrow 1: . . . . G .\nrow 2: . # . . . .\nrow 3: . . . . . .\nrow 4: . . . . # .\nrow 5: . . . 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 4, column 3).","west":"Move west to (row 5, column 2).","east":"Move east to (row 5, column 4)."}},"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,"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:6:goal=(1, 1):walls=((0, 0), (0, 4), (2, 4), (4, 1), (5, 0))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,5],[2,1],[4,4],[5,5]],"position":[5,3],"goal":[1,4]},"pre_transform_start":[5,2],"d4_symmetry":4,"physical_state_hash":"e26a06a48c256f8e21360dac82a67686e7f9b9a44c97d4138a82cdfd063c983c","canonical_source_id":"navigation_v3:e26a06a48c256f8e21360dac","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,"west":0.02,"east":0.17},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0,"1":0.49,"2":0.5,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:47f03d4c917835f0df888f02","state_id":"navigation_v3:47f03d4c917835f0df888f02","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(0,4); walls=(0,0),(0,3),(1,2),(2,3),(2,4),(3,0),(4,4),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . . # G .\nrow 1: . . # . . .\nrow 2: . . . # # .\nrow 3: # . A . . .\nrow 4: . . . . # #\nrow 5: . . . . . .","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).","south":"Move south to (row 4, 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":2},"gold_probs":{"action":{"west":0.0,"east":1.0,"north":0.0,"south":0.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":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 1):walls=((0, 2), (0, 5), (1, 3), (2, 1), (2, 2), (3, 5), (4, 0), (4, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,3],[1,2],[2,3],[2,4],[3,0],[4,4],[4,5]],"position":[3,2],"goal":[0,4]},"pre_transform_start":[2,3],"d4_symmetry":2,"physical_state_hash":"47f03d4c917835f0df888f02245014f124b8bace9b8db5183e95b212259579f5","canonical_source_id":"navigation_v3:47f03d4c917835f0df888f02","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.04,"north":0.54,"east":0.37,"west":0.05},"solvable":{"false":0.18000000000000005,"true":0.82},"value":{"0":0.01,"1":0.37,"2":0.55,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:bdfc5597aea17743255868cb","state_id":"navigation_v3:bdfc5597aea17743255868cb","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,4); goal=(4,2); walls=(0,0),(0,3),(1,0),(1,2),(2,0),(2,1),(2,2),(3,0),(3,1),(3,2),(3,5),(4,3),(5,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . . # . .\nrow 1: # . # . . .\nrow 2: # # # . A .\nrow 3: # # # . . #\nrow 4: . . G # . .\nrow 5: . . # . . .","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 3).","south":"Move south to (row 3, column 4).","north":"Move north to (row 1, column 4).","east":"Move east to (row 2, column 5)."}},"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,"south":0.25,"north":0.25,"east":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:6:goal=(1, 2):walls=((0, 2), (1, 3), (2, 0), (2, 1), (2, 2), (2, 5), (3, 0), (3, 1), (3, 2), (4, 0), (4, 2), (5, 0), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,3],[1,0],[1,2],[2,0],[2,1],[2,2],[3,0],[3,1],[3,2],[3,5],[4,3],[5,2]],"position":[2,4],"goal":[4,2]},"pre_transform_start":[3,1],"d4_symmetry":2,"physical_state_hash":"bdfc5597aea17743255868cbc23d1263d899e1ce746362f65507fcc164ae032e","canonical_source_id":"navigation_v3:bdfc5597aea17743255868cb","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.54,"north":0.04,"east":0.02,"south":0.4},"solvable":{"false":0.14,"true":0.86},"value":{"0":0.03,"1":0.65,"2":0.26,"3":0.06}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:137781d02de6ca83625f038e","state_id":"navigation_v3:137781d02de6ca83625f038e","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,3); goal=(2,5); walls=(0,1),(0,2),(0,3),(0,5),(1,0),(1,3),(1,4),(2,0),(2,3),(2,4),(3,2),(3,5),(4,4),(5,2),(5,4),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # # # . #\nrow 1: # . . # # .\nrow 2: # . . # # G\nrow 3: . . # . . #\nrow 4: . . . A # .\nrow 5: . . # . # #","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 4, column 2).","south":"Move south to (row 5, column 3).","north":"Move north 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":false,"value":3},"gold_probs":{"action":{"west":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":["north","south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 2):walls=((0, 0), (0, 3), (0, 5), (1, 1), (1, 2), (1, 4), (1, 5), (2, 0), (2, 1), (2, 2), (3, 0), (3, 3), (3, 5), (4, 0), (5, 1), (5, 2))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,2],[0,3],[0,5],[1,0],[1,3],[1,4],[2,0],[2,3],[2,4],[3,2],[3,5],[4,4],[5,2],[5,4],[5,5]],"position":[4,3],"goal":[2,5]},"pre_transform_start":[1,3],"d4_symmetry":6,"physical_state_hash":"137781d02de6ca83625f038e43b5caa1594ddc62feb8074dc6fbe58590e0a951","canonical_source_id":"navigation_v3:137781d02de6ca83625f038e","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.9,"west":0.07,"south":0.03},"solvable":{"false":0.22999999999999998,"true":0.77},"value":{"0":0.02,"1":0.46,"2":0.41,"3":0.11}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:5352203e3c14a0c6d5063ac5","state_id":"navigation_v3:5352203e3c14a0c6d5063ac5","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,0); goal=(0,1); walls=(2,2),(2,3),(4,5),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . G . . . .\nrow 1: . . . . . .\nrow 2: . . # # . .\nrow 3: . . . . . .\nrow 4: . . . . . #\nrow 5: 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 4, column 0).","east":"Move east to (row 5, 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":2},"gold_probs":{"action":{"north":0.5,"east":0.5},"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":["east","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 1):walls=((2, 2), (2, 3), (4, 5), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[2,2],[2,3],[4,5],[5,4]],"position":[5,0],"goal":[0,1]},"pre_transform_start":[5,0],"d4_symmetry":0,"physical_state_hash":"5352203e3c14a0c6d5063ac52223efd9ce5ef900aaa94e33b7b176224cd6a9c8","canonical_source_id":"navigation_v3:5352203e3c14a0c6d5063ac5","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.8,"east":0.2},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0,"1":0.26,"2":0.73,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:97f45072df3f52c873619fb9","state_id":"navigation_v3:97f45072df3f52c873619fb9","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,0); goal=(3,0); walls=(1,1),(1,3),(2,1),(2,3),(4,2),(4,3),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: . # . # . .\nrow 2: . # . # . .\nrow 3: G . . . . .\nrow 4: . . # # . .\nrow 5: 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 5, column 1).","north":"Move north to (row 4, 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:6:goal=(0, 2):walls=((1, 3), (1, 4), (2, 1), (3, 0), (3, 1), (3, 3), (3, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,1],[1,3],[2,1],[2,3],[4,2],[4,3],[5,3]],"position":[5,0],"goal":[3,0]},"pre_transform_start":[5,0],"d4_symmetry":0,"physical_state_hash":"97f45072df3f52c873619fb9220a8367bf85fb7d2fa8e8469949a6fb91bae9e1","canonical_source_id":"navigation_v3:97f45072df3f52c873619fb9","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,"north":0.98},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0.78,"1":0.19,"2":0.03,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:b49e5a886d66b94dc9c383b8","state_id":"navigation_v3:b49e5a886d66b94dc9c383b8","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,4); goal=(3,2); walls=(0,3),(0,4),(1,0),(1,2),(1,5),(2,5),(3,0),(3,3),(3,4),(4,0),(4,2),(4,4),(5,0),(5,1),(5,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # # .\nrow 1: # . # . . #\nrow 2: . . . . . #\nrow 3: # . G # # .\nrow 4: # . # . # .\nrow 5: # # # . 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 5, column 5).","west":"Move west to (row 5, 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":{"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:6:goal=(2, 2):walls=((0, 0), (0, 1), (0, 2), (0, 4), (1, 0), (2, 0), (2, 1), (2, 4), (3, 2), (3, 5), (4, 1), (4, 2), (4, 5), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[0,4],[1,0],[1,2],[1,5],[2,5],[3,0],[3,3],[3,4],[4,0],[4,2],[4,4],[5,0],[5,1],[5,2]],"position":[5,4],"goal":[3,2]},"pre_transform_start":[4,0],"d4_symmetry":3,"physical_state_hash":"b49e5a886d66b94dc9c383b80a0d7bfc1b9c4834d67d75c289063589ec97fd17","canonical_source_id":"navigation_v3:b49e5a886d66b94dc9c383b8","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.92,"east":0.08},"solvable":{"false":0.13,"true":0.87},"value":{"0":0.02,"1":0.53,"2":0.39,"3":0.06}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:2bbfa879b82eef65be0965a9","state_id":"navigation_v3:2bbfa879b82eef65be0965a9","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(2,4); walls=(0,2),(1,2),(1,4),(2,1),(2,2),(2,3),(2,5),(3,0),(3,1),(4,0),(4,3),(5,3),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . . .\nrow 1: . . # . # .\nrow 2: . # # # G #\nrow 3: # # A . . .\nrow 4: # . . # . .\nrow 5: . . . # # .","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).","south":"Move south to (row 4, 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":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:6:goal=(1, 2):walls=((0, 2), (1, 1), (1, 5), (2, 2), (2, 4), (2, 5), (3, 0), (3, 1), (3, 2), (4, 2), (4, 3), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[1,2],[1,4],[2,1],[2,2],[2,3],[2,5],[3,0],[3,1],[4,0],[4,3],[5,3],[5,4]],"position":[3,2],"goal":[2,4]},"pre_transform_start":[2,3],"d4_symmetry":7,"physical_state_hash":"2bbfa879b82eef65be0965a946446f2889753790c9f55ab92d8e299177ccfd75","canonical_source_id":"navigation_v3:2bbfa879b82eef65be0965a9","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.12,"east":0.88},"solvable":{"false":0.38,"true":0.62},"value":{"0":0.07,"1":0.51,"2":0.28,"3":0.14}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:d9835c3c71dac8a3171c1dba","state_id":"navigation_v3:d9835c3c71dac8a3171c1dba","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,1); goal=(3,0); walls=(0,0),(2,1),(3,3),(4,5),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . . . . .\nrow 1: . . . . . .\nrow 2: . # . . . .\nrow 3: G A . # . .\nrow 4: . . . . . #\nrow 5: . # . . . .","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).","south":"Move south to (row 4, 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,"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:6:goal=(0, 2):walls=((0, 5), (1, 0), (1, 3), (3, 2), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[2,1],[3,3],[4,5],[5,1]],"position":[3,1],"goal":[3,0]},"pre_transform_start":[1,2],"d4_symmetry":3,"physical_state_hash":"d9835c3c71dac8a3171c1dbac044b67cadde5b67478d9a129856d2b91db5018c","canonical_source_id":"navigation_v3:d9835c3c71dac8a3171c1dba","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0,"west":1,"east":0},"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:31982a8f12323675d249208d","state_id":"navigation_v3:31982a8f12323675d249208d","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,1); goal=(5,0); walls=(0,3),(0,4),(2,1),(3,3),(4,0),(4,3),(4,4),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # # .\nrow 1: . . . . . .\nrow 2: . # . . . .\nrow 3: . . . # . .\nrow 4: # . . # # .\nrow 5: 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":{"east":"Move east to (row 5, column 2).","north":"Move north to (row 4, column 1).","west":"Move west to (row 5, 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":"west","solvable":true,"value":0},"gold_probs":{"action":{"east":0.0,"north":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:6:goal=(0, 0):walls=((0, 1), (1, 3), (3, 1), (3, 2), (3, 5), (4, 0), (4, 1), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[0,4],[2,1],[3,3],[4,0],[4,3],[4,4],[5,4]],"position":[5,1],"goal":[5,0]},"pre_transform_start":[4,5],"d4_symmetry":1,"physical_state_hash":"31982a8f12323675d249208d10e93c2fdb81514bb3825d6214a53877744875ab","canonical_source_id":"navigation_v3:31982a8f12323675d249208d","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.02,"west":0.98},"solvable":{"false":0.12,"true":0.88},"value":{"0":0.66,"1":0.15,"2":0.12,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:6d140ef4f9b230cd1fee3088","state_id":"navigation_v3:6d140ef4f9b230cd1fee3088","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(5,0); walls=(0,5),(1,3),(2,0),(3,5),(4,4),(5,1),(5,3),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . #\nrow 1: . . . # . .\nrow 2: # . . . . .\nrow 3: . . A . . #\nrow 4: . . . . # .\nrow 5: 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 3, column 1).","south":"Move south to (row 4, column 2).","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":"south","solvable":true,"value":1},"gold_probs":{"action":{"west":0.5,"south":0.5,"east":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":["south","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 1), (0, 3), (0, 4), (1, 4), (2, 5), (3, 0), (4, 3), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,5],[1,3],[2,0],[3,5],[4,4],[5,1],[5,3],[5,4]],"position":[3,2],"goal":[5,0]},"pre_transform_start":[2,3],"d4_symmetry":7,"physical_state_hash":"6d140ef4f9b230cd1fee3088c92feb912b1d32aea62f65a78984e0195614d584","canonical_source_id":"navigation_v3:6d140ef4f9b230cd1fee3088","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,"west":0.62,"south":0.32,"east":0.02},"solvable":{"false":0.13,"true":0.87},"value":{"0":0.01,"1":0.4,"2":0.54,"3":0.05}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:80abce6d578a3bd295aab94b","state_id":"navigation_v3:80abce6d578a3bd295aab94b","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(1,2); walls=(0,2),(0,4),(1,3),(2,2),(2,4),(2,5),(3,4),(4,2),(4,4),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . # .\nrow 1: . . G # . .\nrow 2: . A # . # #\nrow 3: . . . . # .\nrow 4: . . # . # .\nrow 5: . . . # . .","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).","north":"Move north to (row 1, column 1).","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":"north","solvable":true,"value":0},"gold_probs":{"action":{"west":0.0,"north":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":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 2):walls=((0, 2), (0, 4), (1, 3), (2, 2), (2, 4), (2, 5), (3, 4), (4, 2), (4, 4), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,4],[1,3],[2,2],[2,4],[2,5],[3,4],[4,2],[4,4],[5,3]],"position":[2,1],"goal":[1,2]},"pre_transform_start":[3,4],"d4_symmetry":2,"physical_state_hash":"80abce6d578a3bd295aab94be8dea416f166424ed3e2d76e7665b941d7eefb50","canonical_source_id":"navigation_v3:80abce6d578a3bd295aab94b","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.98,"south":0.01},"solvable":{"false":0.21999999999999997,"true":0.78},"value":{"0":0.54,"1":0.32,"2":0.09,"3":0.05}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:162e654bfca0212efda81b9d","state_id":"navigation_v3:162e654bfca0212efda81b9d","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(0,2); walls=(0,0),(0,3),(0,5),(1,1),(1,2),(1,4),(1,5),(2,0),(2,1),(2,2),(3,0),(3,3),(3,5),(4,0),(5,1),(5,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . G # . #\nrow 1: . # # . # #\nrow 2: # # # . . .\nrow 3: # . A # . #\nrow 4: # . . . . .\nrow 5: . # # . . .","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).","south":"Move south to (row 4, 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":{"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:6:goal=(0, 2):walls=((0, 0), (0, 3), (0, 5), (1, 1), (1, 2), (1, 4), (1, 5), (2, 0), (2, 1), (2, 2), (3, 0), (3, 3), (3, 5), (4, 0), (5, 1), (5, 2))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,3],[0,5],[1,1],[1,2],[1,4],[1,5],[2,0],[2,1],[2,2],[3,0],[3,3],[3,5],[4,0],[5,1],[5,2]],"position":[3,2],"goal":[0,2]},"pre_transform_start":[3,2],"d4_symmetry":5,"physical_state_hash":"162e654bfca0212efda81b9d6b7a3896c2a4e295db18a09fbfec1f834af73361","canonical_source_id":"navigation_v3:162e654bfca0212efda81b9d","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.59,"west":0.41},"solvable":{"false":0.36,"true":0.64},"value":{"0":0.01,"1":0.26,"2":0.53,"3":0.2}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:1cb606b0cc8daeb18d2dd908","state_id":"navigation_v3:1cb606b0cc8daeb18d2dd908","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,5); goal=(1,2); walls=(0,4),(1,0),(2,1),(3,1),(3,3),(3,5),(4,2),(4,4),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . # .\nrow 1: # . G . . A\nrow 2: . # . . . .\nrow 3: . # . # . #\nrow 4: . . # . # #\nrow 5: . . . . . .","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 5).","south":"Move south to (row 2, column 5).","west":"Move west to (row 1, column 4)."}},"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:6:goal=(1, 2):walls=((0, 4), (1, 0), (2, 1), (3, 1), (3, 3), (3, 5), (4, 2), (4, 4), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,4],[1,0],[2,1],[3,1],[3,3],[3,5],[4,2],[4,4],[4,5]],"position":[1,5],"goal":[1,2]},"pre_transform_start":[0,4],"d4_symmetry":5,"physical_state_hash":"1cb606b0cc8daeb18d2dd9087c7c62e574162bb7341029b14105cd37201eac42","canonical_source_id":"navigation_v3:1cb606b0cc8daeb18d2dd908","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,"south":0.06,"west":0.91},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0.06,"1":0.71,"2":0.2,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:061b03b7fce9409db53bde43","state_id":"navigation_v3:061b03b7fce9409db53bde43","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,5); goal=(3,1); walls=(0,2),(2,1),(2,5),(3,0),(3,2),(3,3),(3,4),(4,2),(4,3),(5,2),(5,3),(5,4),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . . A\nrow 1: . . . . . .\nrow 2: . # . . . #\nrow 3: # G # # # .\nrow 4: . . # # . .\nrow 5: . . # # # #","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 5).","west":"Move west to (row 0, column 4)."}},"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:6:goal=(1, 2):walls=((0, 2), (1, 3), (2, 0), (2, 1), (2, 2), (2, 5), (3, 0), (3, 1), (3, 2), (4, 0), (4, 2), (5, 0), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[2,1],[2,5],[3,0],[3,2],[3,3],[3,4],[4,2],[4,3],[5,2],[5,3],[5,4],[5,5]],"position":[0,5],"goal":[3,1]},"pre_transform_start":[5,0],"d4_symmetry":7,"physical_state_hash":"061b03b7fce9409db53bde433fa2c00a16799d6ad04fd8d8b39daddd78ec7c70","canonical_source_id":"navigation_v3:061b03b7fce9409db53bde43","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.6,"south":0.4},"solvable":{"false":0.15000000000000002,"true":0.85},"value":{"0":0,"1":0.25,"2":0.66,"3":0.09}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:2ed93bc7bab4843eeffbaabe","state_id":"navigation_v3:2ed93bc7bab4843eeffbaabe","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(1,5); walls=(0,1),(0,5),(1,1),(1,4),(2,0),(2,2),(2,4),(3,0),(4,1),(4,2),(4,4),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . . . #\nrow 1: . # . . # G\nrow 2: # . # A # .\nrow 3: # . . . . .\nrow 4: . # # . # #\nrow 5: . . . . . .","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:6:goal=(0, 1):walls=((0, 0), (0, 4), (1, 1), (1, 2), (1, 4), (3, 2), (3, 4), (4, 0), (4, 1), (4, 4), (5, 2), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,5],[1,1],[1,4],[2,0],[2,2],[2,4],[3,0],[4,1],[4,2],[4,4],[4,5]],"position":[2,3],"goal":[1,5]},"pre_transform_start":[2,3],"d4_symmetry":0,"physical_state_hash":"2ed93bc7bab4843eeffbaabec063c2e261c6ad32440f293ff81dc7db0d1de600","canonical_source_id":"navigation_v3:2ed93bc7bab4843eeffbaabe","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.3,"north":0.7},"solvable":{"false":0.18999999999999995,"true":0.81},"value":{"0":0.05,"1":0.6,"2":0.24,"3":0.11}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:4d1ecaf2d5ba0e85a3d4b880","state_id":"navigation_v3:4d1ecaf2d5ba0e85a3d4b880","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(5,5); walls=(0,1),(0,5),(1,1),(1,4),(2,2),(2,3),(3,2),(3,4),(4,1),(4,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # A . . #\nrow 1: . # . . # .\nrow 2: . . # # . .\nrow 3: . . # . # .\nrow 4: . # . . # .\nrow 5: . . . . . 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 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":{"south":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","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 5), (1, 1), (1, 2), (1, 4), (2, 3), (3, 2), (3, 3), (4, 1), (4, 4), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,5],[1,1],[1,4],[2,2],[2,3],[3,2],[3,4],[4,1],[4,4]],"position":[0,2],"goal":[5,5]},"pre_transform_start":[2,5],"d4_symmetry":3,"physical_state_hash":"4d1ecaf2d5ba0e85a3d4b88079c0f6c584edfb8c0df23714bcfef19037f3956c","canonical_source_id":"navigation_v3:4d1ecaf2d5ba0e85a3d4b880","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.37,"south":0.63},"solvable":{"false":0.09999999999999998,"true":0.9},"value":{"0":0,"1":0.03,"2":0.89,"3":0.08}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:5f3ba5859c1e0475eec47f1b","state_id":"navigation_v3:5f3ba5859c1e0475eec47f1b","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,0); goal=(2,4); walls=(2,1),(2,3),(2,5),(3,0),(3,4),(4,1),(4,2),(4,3),(4,5),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: A . . . . .\nrow 1: . . . . . .\nrow 2: . # . # G #\nrow 3: # . . . # .\nrow 4: . # # # . #\nrow 5: . . . # . .","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":2},"gold_probs":{"action":{"south":0.5,"east":0.5},"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":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 2):walls=((0, 2), (0, 4), (1, 3), (2, 2), (2, 4), (2, 5), (3, 4), (4, 2), (4, 4), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[2,1],[2,3],[2,5],[3,0],[3,4],[4,1],[4,2],[4,3],[4,5],[5,3]],"position":[0,0],"goal":[2,4]},"pre_transform_start":[0,5],"d4_symmetry":3,"physical_state_hash":"5f3ba5859c1e0475eec47f1b076cf9ec22ff0fabbdcfe76728c4dcbf56eeac2c","canonical_source_id":"navigation_v3:5f3ba5859c1e0475eec47f1b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.86,"south":0.14},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0,"1":0.31,"2":0.66,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:7b61f6b3ab754b21fb619439","state_id":"navigation_v3:7b61f6b3ab754b21fb619439","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,0); goal=(0,3); walls=(0,2),(0,4),(1,0),(2,5),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # G # .\nrow 1: # . . . . .\nrow 2: . . . . . #\nrow 3: . . . . . .\nrow 4: . . . . . .\nrow 5: 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 5, column 1).","north":"Move north to (row 4, 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":2},"gold_probs":{"action":{"east":0.5,"north":0.5},"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":["east","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 2):walls=((0, 1), (0, 3), (1, 5), (2, 0), (5, 0))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,4],[1,0],[2,5],[5,5]],"position":[5,0],"goal":[0,3]},"pre_transform_start":[5,0],"d4_symmetry":0,"physical_state_hash":"7b61f6b3ab754b21fb6194398e1897548cffeebd6aca9ff6d1448acec1631f11","canonical_source_id":"navigation_v3:7b61f6b3ab754b21fb619439","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.52,"east":0.48},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0,"1":0.04,"2":0.93,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:7f460a256ff05302be0dc0ce","state_id":"navigation_v3:7f460a256ff05302be0dc0ce","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,5); goal=(5,2); walls=(0,0),(0,1),(0,2),(1,5),(2,1),(2,3),(2,4),(3,1),(3,2),(3,3),(4,4),(5,0),(5,1),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # # # . . .\nrow 1: . . . . . #\nrow 2: . # . # # .\nrow 3: . # # # . .\nrow 4: . . . . # A\nrow 5: # # 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 5, column 5).","north":"Move north to (row 3, column 5)."}},"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:6:goal=(0, 2):walls=((0, 0), (0, 1), (0, 3), (1, 4), (2, 1), (2, 2), (2, 3), (3, 1), (3, 3), (3, 4), (4, 5), (5, 0), (5, 1), (5, 2))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,1],[0,2],[1,5],[2,1],[2,3],[2,4],[3,1],[3,2],[3,3],[4,4],[5,0],[5,1],[5,3]],"position":[4,5],"goal":[5,2]},"pre_transform_start":[1,0],"d4_symmetry":2,"physical_state_hash":"7f460a256ff05302be0dc0cebc7554d5d95d099156780c6522b76e172a4e510b","canonical_source_id":"navigation_v3:7f460a256ff05302be0dc0ce","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.41,"north":0.59},"solvable":{"false":0.20999999999999996,"true":0.79},"value":{"0":0.01,"1":0.31,"2":0.5599999999999999,"3":0.12}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:1af3c05d96386ea2151cd87b","state_id":"navigation_v3:1af3c05d96386ea2151cd87b","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,4); goal=(5,2); walls=(1,5),(2,1),(2,2),(3,1),(3,2),(3,3),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: . . . . . #\nrow 2: . # # . . .\nrow 3: . # # # A .\nrow 4: . . . . . #\nrow 5: . . 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 3, column 5).","north":"Move north to (row 2, column 4).","south":"Move south to (row 4, column 4)."}},"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,"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:6:goal=(0, 2):walls=((1, 5), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,5],[2,1],[2,2],[3,1],[3,2],[3,3],[4,5]],"position":[3,4],"goal":[5,2]},"pre_transform_start":[4,2],"d4_symmetry":3,"physical_state_hash":"1af3c05d96386ea2151cd87b303bc96b663b1e8cf98f2a5e19d046b57dfe0c38","canonical_source_id":"navigation_v3:1af3c05d96386ea2151cd87b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.12,"south":0.64,"north":0.24},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0.01,"1":0.55,"2":0.39,"3":0.05}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:f01d9a9b29281cd2845079c1","state_id":"navigation_v3:f01d9a9b29281cd2845079c1","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,3); goal=(4,2); walls=(0,1),(0,3),(1,0),(1,2),(1,5),(2,0),(2,2),(3,0),(3,2),(4,0),(5,0),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . # . .\nrow 1: # . # . . #\nrow 2: # . # . . .\nrow 3: # . # . . .\nrow 4: # . G A . .\nrow 5: # # . . . .","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 3, column 3).","east":"Move east to (row 4, column 4).","west":"Move west to (row 4, column 2).","south":"Move south to (row 5, 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":{"north":0.0,"east":0.0,"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:6:goal=(1, 2):walls=((0, 0), (0, 1), (1, 0), (2, 0), (2, 2), (3, 0), (3, 2), (4, 0), (4, 2), (4, 5), (5, 1), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,3],[1,0],[1,2],[1,5],[2,0],[2,2],[3,0],[3,2],[4,0],[5,0],[5,1]],"position":[4,3],"goal":[4,2]},"pre_transform_start":[4,3],"d4_symmetry":0,"physical_state_hash":"f01d9a9b29281cd2845079c1258487d3e35fa73eee962d13bd6444f5ab9cf01f","canonical_source_id":"navigation_v3:f01d9a9b29281cd2845079c1","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,"east":0,"north":0},"solvable":{"false":0.12,"true":0.88},"value":{"0":0.88,"1":0.06,"2":0.02,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:49ff8ce6c82fc3d7d1f5de36","state_id":"navigation_v3:49ff8ce6c82fc3d7d1f5de36","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,2); goal=(0,2); walls=(0,1),(0,3),(1,5),(2,0),(5,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # G # . .\nrow 1: . . . . . #\nrow 2: # . . . . .\nrow 3: . . . . . .\nrow 4: . . A . . .\nrow 5: # . . . . .","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 4, column 1).","south":"Move south to (row 5, column 2).","north":"Move north to (row 3, column 2).","east":"Move east to (row 4, 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.0,"south":0.0,"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:6:goal=(0, 2):walls=((0, 1), (0, 3), (1, 5), (2, 0), (5, 0))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,3],[1,5],[2,0],[5,0]],"position":[4,2],"goal":[0,2]},"pre_transform_start":[4,3],"d4_symmetry":4,"physical_state_hash":"49ff8ce6c82fc3d7d1f5de367abb98c0e01c673ec39a4dfa2eeb3fe9eb104084","canonical_source_id":"navigation_v3:49ff8ce6c82fc3d7d1f5de36","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0,"west":0.01,"north":0.98,"east":0.01},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.04,"1":0.75,"2":0.2,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:3eaa66d412dfded76c034bed","state_id":"navigation_v3:3eaa66d412dfded76c034bed","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,0); goal=(4,2); walls=(0,4),(0,5),(1,3),(1,5),(2,0),(2,2),(4,0),(4,4),(5,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: A . . . # #\nrow 1: . . . # . #\nrow 2: # . # . . .\nrow 3: . . . . . .\nrow 4: # . G . # .\nrow 5: # . . . . .","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":2},"gold_probs":{"action":{"east":0.5,"south":0.5},"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":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 2):walls=((0, 0), (1, 0), (1, 4), (3, 0), (3, 2), (4, 3), (4, 5), (5, 4), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,4],[0,5],[1,3],[1,5],[2,0],[2,2],[4,0],[4,4],[5,0]],"position":[0,0],"goal":[4,2]},"pre_transform_start":[5,0],"d4_symmetry":1,"physical_state_hash":"3eaa66d412dfded76c034bed3b28c854ca2c40042552dfcb81cdcf5101ff26fa","canonical_source_id":"navigation_v3:3eaa66d412dfded76c034bed","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,"east":0.58},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0,"1":0.18,"2":0.8,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:f5d06a85cc25f054d92e4a9b","state_id":"navigation_v3:f5d06a85cc25f054d92e4a9b","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(2,5); walls=(0,4),(1,0),(2,2),(3,4),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . # .\nrow 1: # A . . . .\nrow 2: . . # . . G\nrow 3: . . . . # .\nrow 4: . . . . . .\nrow 5: . . . . . #","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).","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,"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:6:goal=(0, 2):walls=((0, 5), (1, 0), (1, 3), (3, 2), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,4],[1,0],[2,2],[3,4],[5,5]],"position":[1,1],"goal":[2,5]},"pre_transform_start":[4,1],"d4_symmetry":1,"physical_state_hash":"f5d06a85cc25f054d92e4a9b16ac5a366dabc2eac04016a5c8092b9872ac41e1","canonical_source_id":"navigation_v3:f5d06a85cc25f054d92e4a9b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.13,"north":0.07,"east":0.8},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0,"1":0.22,"2":0.75,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:7fbad22adf02aca085fa214a","state_id":"navigation_v3:7fbad22adf02aca085fa214a","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(5,0); walls=(0,2),(1,4),(1,5),(3,4),(4,0),(4,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . . .\nrow 1: . . . . # #\nrow 2: . A . . . .\nrow 3: . . . . # .\nrow 4: # # . . . .\nrow 5: 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 1).","south":"Move south to (row 3, column 1).","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":2},"gold_probs":{"action":{"north":0.0,"south":0.5,"east":0.5,"west":0.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":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 1), (1, 1), (2, 5), (4, 2), (4, 4), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[1,4],[1,5],[3,4],[4,0],[4,1]],"position":[2,1],"goal":[5,0]},"pre_transform_start":[4,2],"d4_symmetry":1,"physical_state_hash":"7fbad22adf02aca085fa214a945b933488ed5b046860cbf994221702157d603a","canonical_source_id":"navigation_v3:7fbad22adf02aca085fa214a","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.63,"south":0.28,"north":0.02,"east":0.07},"solvable":{"false":0.09999999999999998,"true":0.9},"value":{"0":0,"1":0.31,"2":0.66,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:68e74a4698de7365feb92dad","state_id":"navigation_v3:68e74a4698de7365feb92dad","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,0); goal=(5,0); walls=(0,1),(0,2),(0,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # # # . .\nrow 1: . . . . . .\nrow 2: A . . . . .\nrow 3: . . . . . .\nrow 4: . . . . . .\nrow 5: 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).","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":"south","solvable":true,"value":1},"gold_probs":{"action":{"east":0.0,"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:6:goal=(0, 0):walls=((1, 5), (2, 5), (3, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,2],[0,3]],"position":[2,0],"goal":[5,0]},"pre_transform_start":[0,2],"d4_symmetry":7,"physical_state_hash":"68e74a4698de7365feb92dadd171e707e4b670cbaf9bf6487b23ed82cf8bbcf7","canonical_source_id":"navigation_v3:68e74a4698de7365feb92dad","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,"north":0,"east":0.01},"solvable":{"false":0.020000000000000018,"true":0.98},"value":{"0":0,"1":1,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:3b15b927d65868e5fb7c90f6","state_id":"navigation_v3:3b15b927d65868e5fb7c90f6","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(4,2); walls=(1,2),(1,4),(1,5),(2,1),(2,3),(2,5),(3,1),(4,0),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: . . # . # #\nrow 2: . # . # . #\nrow 3: . # A . . .\nrow 4: # . G . . .\nrow 5: . . . . # .","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).","north":"Move north to (row 2, column 2).","south":"Move south to (row 4, 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,"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:6:goal=(1, 2):walls=((0, 4), (1, 0), (2, 1), (3, 1), (3, 3), (3, 5), (4, 2), (4, 4), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,2],[1,4],[1,5],[2,1],[2,3],[2,5],[3,1],[4,0],[5,4]],"position":[3,2],"goal":[4,2]},"pre_transform_start":[3,3],"d4_symmetry":1,"physical_state_hash":"3b15b927d65868e5fb7c90f69fdf1532519ec0972e3e73ff705190de07074637","canonical_source_id":"navigation_v3:3b15b927d65868e5fb7c90f6","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.02,"south":0.97},"solvable":{"false":0.10999999999999999,"true":0.89},"value":{"0":0.88,"1":0.09,"2":0.02,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:206b4c1854bbcdcb9735d3d6","state_id":"navigation_v3:206b4c1854bbcdcb9735d3d6","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,3); goal=(0,2); walls=(0,1),(1,0),(1,2),(3,2),(3,4),(4,0),(4,1),(4,3),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # G A . .\nrow 1: # . # . . .\nrow 2: . . . . . .\nrow 3: . . # . # .\nrow 4: # # . # . .\nrow 5: . # . . . .","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).","east":"Move east to (row 0, column 4).","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,"east":0.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:6:goal=(0, 2):walls=((0, 1), (1, 0), (1, 2), (3, 2), (3, 4), (4, 0), (4, 1), (4, 3), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[1,0],[1,2],[3,2],[3,4],[4,0],[4,1],[4,3],[5,1]],"position":[0,3],"goal":[0,2]},"pre_transform_start":[5,2],"d4_symmetry":2,"physical_state_hash":"206b4c1854bbcdcb9735d3d6c0a3518cd75d6629fb285d30c9e9445566c5f717","canonical_source_id":"navigation_v3:206b4c1854bbcdcb9735d3d6","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.02,"west":0.98,"east":0},"solvable":{"false":0.17000000000000004,"true":0.83},"value":{"0":0.6,"1":0.3,"2":0.07,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:b7518b6ee11ba78697e9cbde","state_id":"navigation_v3:b7518b6ee11ba78697e9cbde","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,3); goal=(5,2); walls=(0,5),(1,1),(1,2),(1,4),(1,5),(2,0),(2,1),(3,2),(3,5),(4,1),(4,2),(4,4),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . #\nrow 1: . # # . # #\nrow 2: # # . . . .\nrow 3: . . # . . #\nrow 4: . # # A # .\nrow 5: . # 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 3, column 3).","south":"Move south to (row 5, 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:6:goal=(0, 2):walls=((0, 1), (1, 1), (1, 2), (1, 4), (2, 2), (2, 5), (3, 0), (3, 1), (4, 1), (4, 2), (4, 4), (4, 5), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,5],[1,1],[1,2],[1,4],[1,5],[2,0],[2,1],[3,2],[3,5],[4,1],[4,2],[4,4],[5,1]],"position":[4,3],"goal":[5,2]},"pre_transform_start":[4,2],"d4_symmetry":4,"physical_state_hash":"b7518b6ee11ba78697e9cbde1c70c6461d09ab9d5520fa6305ba35ab7641d633","canonical_source_id":"navigation_v3:b7518b6ee11ba78697e9cbde","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.13,"south":0.87},"solvable":{"false":0.24,"true":0.76},"value":{"0":0.15,"1":0.62,"2":0.17,"3":0.06}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:1344d42633fc3fea69c0a05a","state_id":"navigation_v3:1344d42633fc3fea69c0a05a","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(5,5); walls=(0,2),(0,3),(0,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # # # .\nrow 1: . . A . . .\nrow 2: . . . . . .\nrow 3: . . . . . .\nrow 4: . . . . . .\nrow 5: . . . . . 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).","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":true,"value":2},"gold_probs":{"action":{"west":0.0,"south":0.5,"east":0.5},"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":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((1, 5), (2, 5), (3, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,3],[0,4]],"position":[1,2],"goal":[5,5]},"pre_transform_start":[3,1],"d4_symmetry":1,"physical_state_hash":"1344d42633fc3fea69c0a05a8c27e0802bdb040e9dabd9bcf9f5aaebb4ddc158","canonical_source_id":"navigation_v3:1344d42633fc3fea69c0a05a","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.32,"west":0.01,"south":0.67},"solvable":{"false":0.020000000000000018,"true":0.98},"value":{"0":0,"1":0.02,"2":0.98,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:17cb484625b26dd47014a3c7","state_id":"navigation_v3:17cb484625b26dd47014a3c7","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,0); goal=(5,5); walls=(1,1),(1,4),(2,0),(2,1),(2,3),(3,2),(3,3),(3,5),(4,3),(4,5),(5,0),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: . # . . # .\nrow 2: # # . # . .\nrow 3: . . # # . #\nrow 4: A . . # . #\nrow 5: # . . . # 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 3, column 0).","east":"Move east to (row 4, 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:6:goal=(0, 0):walls=((0, 1), (0, 2), (1, 0), (1, 4), (2, 1), (2, 2), (2, 3), (3, 2), (4, 3), (4, 4), (5, 0), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,1],[1,4],[2,0],[2,1],[2,3],[3,2],[3,3],[3,5],[4,3],[4,5],[5,0],[5,4]],"position":[4,0],"goal":[5,5]},"pre_transform_start":[5,1],"d4_symmetry":5,"physical_state_hash":"17cb484625b26dd47014a3c781cc7f85aba8f7c1c58e9c4b1e3ebdc1697b95b6","canonical_source_id":"navigation_v3:17cb484625b26dd47014a3c7","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.26,"east":0.74},"solvable":{"false":0.18000000000000005,"true":0.82},"value":{"0":0,"1":0.07,"2":0.81,"3":0.12}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:a8e52f51033d034f6c76aaa9","state_id":"navigation_v3:a8e52f51033d034f6c76aaa9","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,5); goal=(1,0); walls=(0,2),(1,2),(1,3),(1,4),(2,3),(2,5),(3,5),(4,0),(4,1),(4,5),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . . A\nrow 1: G . # # # .\nrow 2: . . . # . #\nrow 3: . . . . . #\nrow 4: # # . . . #\nrow 5: . . . . . #","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 4).","south":"Move south to (row 1, column 5)."}},"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:6:goal=(0, 1):walls=((0, 4), (1, 4), (2, 0), (2, 1), (3, 1), (3, 2), (4, 1), (5, 2), (5, 3), (5, 4), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[1,2],[1,3],[1,4],[2,3],[2,5],[3,5],[4,0],[4,1],[4,5],[5,5]],"position":[0,5],"goal":[1,0]},"pre_transform_start":[0,0],"d4_symmetry":4,"physical_state_hash":"a8e52f51033d034f6c76aaa991124dd4d448dd2cba20362ecbd04e3bf886b095","canonical_source_id":"navigation_v3:a8e52f51033d034f6c76aaa9","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.47,"west":0.53},"solvable":{"false":0.13,"true":0.87},"value":{"0":0.01,"1":0.21,"2":0.73,"3":0.05}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:0f2cdad60397b13a9d947692","state_id":"navigation_v3:0f2cdad60397b13a9d947692","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(1,5); walls=(1,2),(2,2),(4,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: . . # . . G\nrow 2: . A # . . .\nrow 3: . . . . . .\nrow 4: # . . . . .\nrow 5: . . . . . .","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 1).","west":"Move west to (row 2, column 0).","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":"north","solvable":true,"value":2},"gold_probs":{"action":{"north":0.5,"west":0.0,"south":0.5},"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","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 1):walls=((3, 1), (3, 2), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,2],[2,2],[4,0]],"position":[2,1],"goal":[1,5]},"pre_transform_start":[3,1],"d4_symmetry":6,"physical_state_hash":"0f2cdad60397b13a9d9476925663a7bcfd9ff31068172085b29b3aa397c08bf7","canonical_source_id":"navigation_v3:0f2cdad60397b13a9d947692","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.83,"south":0.14,"west":0.03},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0,"1":0.25,"2":0.74,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:67123acccd77618f6196c2d7","state_id":"navigation_v3:67123acccd77618f6196c2d7","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,4); goal=(5,2); walls=(0,1),(0,3),(1,5),(2,1),(2,3),(4,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . # . .\nrow 1: . . . . . #\nrow 2: . # . # . .\nrow 3: . . . . A .\nrow 4: . . # . . .\nrow 5: . . 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 3, column 3).","north":"Move north to (row 2, column 4).","east":"Move east to (row 3, column 5).","south":"Move south to (row 4, column 4)."}},"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,"north":0.0,"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:6:goal=(0, 2):walls=((1, 2), (3, 1), (3, 3), (4, 5), (5, 1), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,3],[1,5],[2,1],[2,3],[4,2]],"position":[3,4],"goal":[5,2]},"pre_transform_start":[1,3],"d4_symmetry":1,"physical_state_hash":"67123acccd77618f6196c2d729486ecf9d1b606c15bfd290ae295ca1704bebb6","canonical_source_id":"navigation_v3:67123acccd77618f6196c2d7","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.41,"east":0.02,"north":0.05},"solvable":{"false":0.09999999999999998,"true":0.9},"value":{"0":0.02,"1":0.73,"2":0.23,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:69e5340c68e88adf91225941","state_id":"navigation_v3:69e5340c68e88adf91225941","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(0,5); walls=(1,0),(1,1),(1,4),(2,0),(2,3),(2,5),(3,0),(4,1),(4,2),(4,5),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . G\nrow 1: # # . . # .\nrow 2: # . A # . #\nrow 3: # . . . . .\nrow 4: . # # . . #\nrow 5: . . . . # .","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).","south":"Move south 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":{"west":0.0,"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:6:goal=(0, 0):walls=((0, 2), (0, 4), (1, 1), (1, 5), (2, 2), (3, 4), (4, 1), (4, 4), (5, 1), (5, 2), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,0],[1,1],[1,4],[2,0],[2,3],[2,5],[3,0],[4,1],[4,2],[4,5],[5,4]],"position":[2,2],"goal":[0,5]},"pre_transform_start":[2,3],"d4_symmetry":4,"physical_state_hash":"69e5340c68e88adf91225941517f1609bc96ad3775517cd435fe07a53720666f","canonical_source_id":"navigation_v3:69e5340c68e88adf91225941","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.8,"south":0.13,"west":0.07},"solvable":{"false":0.12,"true":0.88},"value":{"0":0.01,"1":0.3,"2":0.62,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:49d62bc4f9cbb1dac8d3207c","state_id":"navigation_v3:49d62bc4f9cbb1dac8d3207c","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,0); goal=(5,5); walls=(0,3),(1,2),(2,1),(3,1),(3,4),(3,5),(4,0),(4,5),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # . .\nrow 1: . . # . . .\nrow 2: A # . . . .\nrow 3: . # . . # #\nrow 4: # . . . . #\nrow 5: . . . # . 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":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:6:goal=(0, 0):walls=((0, 1), (0, 2), (1, 2), (2, 0), (2, 5), (3, 4), (4, 2), (4, 3), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[1,2],[2,1],[3,1],[3,4],[3,5],[4,0],[4,5],[5,3]],"position":[2,0],"goal":[5,5]},"pre_transform_start":[2,5],"d4_symmetry":4,"physical_state_hash":"49d62bc4f9cbb1dac8d3207c54cbc5624b497647c0f07aa87f97658dd3caf540","canonical_source_id":"navigation_v3:49d62bc4f9cbb1dac8d3207c","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.7,"north":0.3},"solvable":{"false":0.13,"true":0.87},"value":{"0":0,"1":0.02,"2":0.92,"3":0.06}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:53b3f6fb2ede2714ec36b0a8","state_id":"navigation_v3:53b3f6fb2ede2714ec36b0a8","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,2); goal=(0,3); walls=(0,0),(0,2),(2,0),(4,5),(5,2),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . # G . .\nrow 1: . . A . . .\nrow 2: # . . . . .\nrow 3: . . . . . .\nrow 4: . . . . . #\nrow 5: . . # . . #","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).","east":"Move east to (row 1, column 3).","west":"Move west 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":true,"value":0},"gold_probs":{"action":{"south":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:6:goal=(0, 2):walls=((0, 3), (0, 5), (2, 5), (4, 0), (5, 0), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,2],[2,0],[4,5],[5,2],[5,5]],"position":[1,2],"goal":[0,3]},"pre_transform_start":[4,3],"d4_symmetry":2,"physical_state_hash":"53b3f6fb2ede2714ec36b0a88517cd6861e8f76f2cabc89973efcf7c9d388934","canonical_source_id":"navigation_v3:53b3f6fb2ede2714ec36b0a8","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,"south":0.02,"east":0.95},"solvable":{"false":0.09999999999999998,"true":0.9},"value":{"0":0.78,"1":0.2,"2":0.01,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:5564b4822081e10dc18679a1","state_id":"navigation_v3:5564b4822081e10dc18679a1","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,4); goal=(0,0); walls=(0,4),(1,0),(1,3),(1,4),(2,3),(3,1),(5,3),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: G . . . # .\nrow 1: # . . # # .\nrow 2: . . . # . .\nrow 3: . # . . . .\nrow 4: . . . . A .\nrow 5: . . . # # .","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 4, column 3).","north":"Move north to (row 3, column 4).","east":"Move east to (row 4, column 5)."}},"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":{"west":0.5,"north":0.5,"east":0.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","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 1), (1, 3), (3, 1), (3, 2), (3, 5), (4, 0), (4, 1), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,4],[1,0],[1,3],[1,4],[2,3],[3,1],[5,3],[5,4]],"position":[4,4],"goal":[0,0]},"pre_transform_start":[1,1],"d4_symmetry":5,"physical_state_hash":"5564b4822081e10dc18679a19a45868bd4d1e86e1187683578a4af697367b1fe","canonical_source_id":"navigation_v3:5564b4822081e10dc18679a1","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.61,"west":0.37,"east":0.02},"solvable":{"false":0.12,"true":0.88},"value":{"0":0,"1":0.06,"2":0.89,"3":0.05}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:a6f6546c11c83170b3c1a9a3","state_id":"navigation_v3:a6f6546c11c83170b3c1a9a3","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,1); goal=(1,4); walls=(0,0),(0,2),(0,4),(0,5),(1,1),(1,3),(2,1),(2,3),(3,0),(3,3),(4,4),(5,1),(5,2),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . # . # #\nrow 1: . # . # G .\nrow 2: . # . # . .\nrow 3: # . . # . .\nrow 4: . A . . # .\nrow 5: . # # . # .","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 4, column 2).","west":"Move west to (row 4, column 0).","north":"Move north 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":{"east":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":["east","north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 1):walls=((0, 0), (0, 1), (0, 3), (0, 5), (1, 2), (1, 4), (2, 2), (2, 4), (3, 2), (3, 5), (4, 1), (5, 1), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,2],[0,4],[0,5],[1,1],[1,3],[2,1],[2,3],[3,0],[3,3],[4,4],[5,1],[5,2],[5,4]],"position":[4,1],"goal":[1,4]},"pre_transform_start":[4,4],"d4_symmetry":4,"physical_state_hash":"a6f6546c11c83170b3c1a9a3a04a2229ff1c419e8b386c3ba14424dccf4f28ba","canonical_source_id":"navigation_v3:a6f6546c11c83170b3c1a9a3","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.5,"east":0.47},"solvable":{"false":0.18000000000000005,"true":0.82},"value":{"0":0,"1":0.23,"2":0.67,"3":0.1}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:b3b03941fee203ca1a195332","state_id":"navigation_v3:b3b03941fee203ca1a195332","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,1); goal=(5,0); walls=(0,2),(0,5),(1,0),(1,1),(2,0),(2,4),(4,0),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . . #\nrow 1: # # . . . .\nrow 2: # . . . # .\nrow 3: . . . . . .\nrow 4: # . . . . .\nrow 5: 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 5, column 0).","north":"Move north to (row 4, column 1).","east":"Move east to (row 5, 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,"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":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 1), (0, 3), (0, 4), (1, 4), (2, 5), (3, 0), (4, 3), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,5],[1,0],[1,1],[2,0],[2,4],[4,0],[5,3]],"position":[5,1],"goal":[5,0]},"pre_transform_start":[0,4],"d4_symmetry":2,"physical_state_hash":"b3b03941fee203ca1a195332703681b1573fb3e8df6398318409a23d443d0b96","canonical_source_id":"navigation_v3:b3b03941fee203ca1a195332","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.81,"north":0.14,"east":0.04},"solvable":{"false":0.30000000000000004,"true":0.7},"value":{"0":0.34,"1":0.26,"2":0.28,"3":0.12}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:2af71a771260769ddcf3151c","state_id":"navigation_v3:2af71a771260769ddcf3151c","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,0); goal=(3,0); walls=(0,4),(1,1),(1,3),(2,0),(2,2),(2,3),(3,2),(3,5),(4,0),(4,2),(4,3),(4,5),(5,0),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: A . . . # .\nrow 1: . # . # . .\nrow 2: # . # # . .\nrow 3: G . # . . #\nrow 4: # . # # . #\nrow 5: # . . . . #","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":false,"value":3},"gold_probs":{"action":{"south":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","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 2):walls=((0, 0), (0, 1), (0, 3), (1, 4), (2, 1), (2, 2), (2, 3), (3, 1), (3, 3), (3, 4), (4, 5), (5, 0), (5, 1), (5, 2))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,4],[1,1],[1,3],[2,0],[2,2],[2,3],[3,2],[3,5],[4,0],[4,2],[4,3],[4,5],[5,0],[5,5]],"position":[0,0],"goal":[3,0]},"pre_transform_start":[0,0],"d4_symmetry":7,"physical_state_hash":"2af71a771260769ddcf3151c39c7f210d9775aec5422830d13368599dbde634a","canonical_source_id":"navigation_v3:2af71a771260769ddcf3151c","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.22,"south":0.78},"solvable":{"false":0.30000000000000004,"true":0.7},"value":{"0":0.01,"1":0.29,"2":0.58,"3":0.12}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:f064efcb514070f7e47c9e45","state_id":"navigation_v3:f064efcb514070f7e47c9e45","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,3); goal=(3,1); walls=(0,1),(0,2),(1,2),(1,5),(2,4),(2,5),(3,0),(3,2),(3,3),(3,4),(4,1),(4,3),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # # A . .\nrow 1: . . # . . #\nrow 2: . . . . # #\nrow 3: # G # # # .\nrow 4: . # . # . .\nrow 5: . . . # . .","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 4).","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":{"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:6:goal=(1, 2):walls=((0, 2), (1, 1), (1, 5), (2, 2), (2, 4), (2, 5), (3, 0), (3, 1), (3, 2), (4, 2), (4, 3), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,2],[1,2],[1,5],[2,4],[2,5],[3,0],[3,2],[3,3],[3,4],[4,1],[4,3],[5,3]],"position":[0,3],"goal":[3,1]},"pre_transform_start":[2,5],"d4_symmetry":5,"physical_state_hash":"f064efcb514070f7e47c9e4568482d3b9d80396138d0a419696c1dc39db81455","canonical_source_id":"navigation_v3:f064efcb514070f7e47c9e45","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.1,"south":0.9},"solvable":{"false":0.18000000000000005,"true":0.82},"value":{"0":0.01,"1":0.34,"2":0.53,"3":0.12}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:087b0bd50c61490ecef09598","state_id":"navigation_v3:087b0bd50c61490ecef09598","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,2); goal=(5,5); walls=(0,2),(0,3),(0,4),(1,1),(1,4),(2,1),(3,3),(4,0),(4,4),(5,1),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # # # .\nrow 1: . # . . # .\nrow 2: . # . . . .\nrow 3: . . . # . .\nrow 4: # . A . # .\nrow 5: . # . # . 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 4, column 1).","south":"Move south to (row 5, column 2).","north":"Move north to (row 3, column 2).","east":"Move east to (row 4, 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":2},"gold_probs":{"action":{"west":0.0,"south":0.0,"north":1.0,"east":0.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:6:goal=(0, 0):walls=((0, 2), (0, 4), (1, 1), (1, 5), (2, 2), (3, 4), (4, 1), (4, 4), (5, 1), (5, 2), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,3],[0,4],[1,1],[1,4],[2,1],[3,3],[4,0],[4,4],[5,1],[5,3]],"position":[4,2],"goal":[5,5]},"pre_transform_start":[3,1],"d4_symmetry":5,"physical_state_hash":"087b0bd50c61490ecef09598b9ddcf34cb4b60d1a976b2b93a8e4cec742b396f","canonical_source_id":"navigation_v3:087b0bd50c61490ecef09598","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.2,"north":0.18,"west":0.05,"east":0.57},"solvable":{"false":0.12,"true":0.88},"value":{"0":0.01,"1":0.47,"2":0.47,"3":0.05}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:edd7296b4a22bd71f9782034","state_id":"navigation_v3:edd7296b4a22bd71f9782034","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(3,4); walls=(0,4),(1,0),(1,5),(2,0),(2,1),(2,4),(2,5),(3,1),(3,3),(4,1),(4,3),(4,4),(5,0),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . # .\nrow 1: # A . . . #\nrow 2: # # . . # #\nrow 3: . # . # G .\nrow 4: . # . # # .\nrow 5: # . . . # .","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":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:6:goal=(1, 2):walls=((0, 3), (0, 4), (1, 0), (1, 1), (1, 3), (1, 5), (2, 1), (2, 2), (4, 1), (4, 2), (4, 3), (5, 0), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,4],[1,0],[1,5],[2,0],[2,1],[2,4],[2,5],[3,1],[3,3],[4,1],[4,3],[4,4],[5,0],[5,4]],"position":[1,1],"goal":[3,4]},"pre_transform_start":[4,4],"d4_symmetry":5,"physical_state_hash":"edd7296b4a22bd71f978203417f75e5876d5b2422aea5345f333d11033342596","canonical_source_id":"navigation_v3:edd7296b4a22bd71f9782034","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.97,"north":0.03},"solvable":{"false":0.15000000000000002,"true":0.85},"value":{"0":0,"1":0.32,"2":0.59,"3":0.09}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:4d64f4ae42055f1a8784d3e7","state_id":"navigation_v3:4d64f4ae42055f1a8784d3e7","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,4); goal=(0,4); walls=(2,2),(2,3),(4,0),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . G .\nrow 1: . . . . A .\nrow 2: . . # # . .\nrow 3: . . . . . .\nrow 4: # . . . . .\nrow 5: . # . . . .","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 4).","east":"Move east to (row 1, column 5).","west":"Move west to (row 1, column 3).","south":"Move south to (row 2, column 4)."}},"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,"west":0.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":["north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 1):walls=((2, 2), (2, 3), (4, 5), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[2,2],[2,3],[4,0],[5,1]],"position":[1,4],"goal":[0,4]},"pre_transform_start":[1,1],"d4_symmetry":4,"physical_state_hash":"4d64f4ae42055f1a8784d3e75b02f27a824052ee485b8224e54ad78ab8ee8b46","canonical_source_id":"navigation_v3:4d64f4ae42055f1a8784d3e7","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":1,"south":0,"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:a6ee13945c116f6b52af24d0","state_id":"navigation_v3:a6ee13945c116f6b52af24d0","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,3); goal=(0,5); walls=(1,1),(1,3),(1,4),(1,5),(2,2),(3,1),(4,0),(4,3),(5,0),(5,2),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . A . G\nrow 1: . # . # # #\nrow 2: . . # . . .\nrow 3: . # . . . .\nrow 4: # . . # . .\nrow 5: # . # # . .","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 4).","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":"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:6:goal=(0, 0):walls=((0, 1), (1, 1), (2, 1), (2, 4), (2, 5), (3, 2), (3, 5), (4, 1), (4, 3), (5, 4), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,1],[1,3],[1,4],[1,5],[2,2],[3,1],[4,0],[4,3],[5,0],[5,2],[5,3]],"position":[0,3],"goal":[0,5]},"pre_transform_start":[3,0],"d4_symmetry":7,"physical_state_hash":"a6ee13945c116f6b52af24d03ab5e78ac19bd2563dc3273c258dd87e5fff80a5","canonical_source_id":"navigation_v3:a6ee13945c116f6b52af24d0","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,"east":0.99},"solvable":{"false":0.31999999999999995,"true":0.68},"value":{"0":0.78,"1":0.13,"2":0.05,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:5f807f83449f0a263da6c48f","state_id":"navigation_v3:5f807f83449f0a263da6c48f","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,4); goal=(4,0); walls=(0,5),(1,0),(1,1),(1,5),(2,5),(3,3),(3,5),(4,2),(4,3),(4,4),(5,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . #\nrow 1: # # . . . #\nrow 2: . . . . . #\nrow 3: . . . # . #\nrow 4: G . # # # .\nrow 5: . . # . 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 5, column 5).","west":"Move west to (row 5, 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":{"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:6:goal=(0, 1):walls=((0, 4), (1, 4), (2, 0), (2, 1), (3, 1), (3, 2), (4, 1), (5, 2), (5, 3), (5, 4), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,5],[1,0],[1,1],[1,5],[2,5],[3,3],[3,5],[4,2],[4,3],[4,4],[5,2]],"position":[5,4],"goal":[4,0]},"pre_transform_start":[0,1],"d4_symmetry":2,"physical_state_hash":"5f807f83449f0a263da6c48ffee3ecdf69b7a6196725436fe737ed9dbf4140af","canonical_source_id":"navigation_v3:5f807f83449f0a263da6c48f","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.07,"west":0.93},"solvable":{"false":0.24,"true":0.76},"value":{"0":0.01,"1":0.22,"2":0.66,"3":0.11}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:2d2718ead629a5b1879bb7c2","state_id":"navigation_v3:2d2718ead629a5b1879bb7c2","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,4); goal=(4,3); walls=(0,2),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,0),(3,3),(3,4),(3,5),(4,2),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . A #\nrow 1: . . . # . #\nrow 2: . . . # # #\nrow 3: # . . # # #\nrow 4: . . # G . .\nrow 5: . . . # . .","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 4).","west":"Move west 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":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:6:goal=(1, 2):walls=((0, 2), (1, 3), (2, 0), (2, 1), (2, 2), (2, 5), (3, 0), (3, 1), (3, 2), (4, 0), (4, 2), (5, 0), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,5],[1,3],[1,5],[2,3],[2,4],[2,5],[3,0],[3,3],[3,4],[3,5],[4,2],[5,3]],"position":[0,4],"goal":[4,3]},"pre_transform_start":[5,4],"d4_symmetry":6,"physical_state_hash":"2d2718ead629a5b1879bb7c2e94fbccf592750fa13fee8ad48eead41473a8565","canonical_source_id":"navigation_v3:2d2718ead629a5b1879bb7c2","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.68,"west":0.32},"solvable":{"false":0.28,"true":0.72},"value":{"0":0.01,"1":0.26,"2":0.56,"3":0.17}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:1e7ee74af5045ce9b80284b9","state_id":"navigation_v3:1e7ee74af5045ce9b80284b9","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(1,4); walls=(0,1),(2,0),(3,3),(4,3),(4,5),(5,0),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . . . .\nrow 1: . . . . G .\nrow 2: # . . A . .\nrow 3: . . . # . .\nrow 4: . . . # . #\nrow 5: # # . . . .","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 4).","north":"Move north to (row 1, 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":"east","solvable":true,"value":0},"gold_probs":{"action":{"east":0.5,"north":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","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 1):walls=((0, 4), (2, 3), (2, 4), (4, 0), (4, 5), (5, 2), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[2,0],[3,3],[4,3],[4,5],[5,0],[5,1]],"position":[2,3],"goal":[1,4]},"pre_transform_start":[3,3],"d4_symmetry":3,"physical_state_hash":"1e7ee74af5045ce9b80284b9e26a48b6ed92990b442b5c70fe54d24dd11a9b80","canonical_source_id":"navigation_v3:1e7ee74af5045ce9b80284b9","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.32,"north":0.68,"west":0},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0.9,"1":0.09,"2":0.01,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:ec09a8ebdf631d626e52be10","state_id":"navigation_v3:ec09a8ebdf631d626e52be10","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(2,0); walls=(0,3),(1,0),(1,1),(1,3),(1,4),(2,1),(2,2),(2,4),(4,1),(4,4),(5,2),(5,4),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # . .\nrow 1: # # . # # .\nrow 2: G # # . # .\nrow 3: . . A . . .\nrow 4: . # . . # .\nrow 5: . . # . # #","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).","south":"Move south to (row 4, 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":{"west":1.0,"east":0.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":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 2):walls=((0, 1), (1, 1), (1, 2), (1, 4), (2, 2), (2, 5), (3, 0), (3, 1), (4, 1), (4, 2), (4, 4), (4, 5), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[1,0],[1,1],[1,3],[1,4],[2,1],[2,2],[2,4],[4,1],[4,4],[5,2],[5,4],[5,5]],"position":[3,2],"goal":[2,0]},"pre_transform_start":[3,2],"d4_symmetry":5,"physical_state_hash":"ec09a8ebdf631d626e52be100d695802d87d37f7625fa7a6f198edfddee5d81f","canonical_source_id":"navigation_v3:ec09a8ebdf631d626e52be10","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.18,"south":0.09,"west":0.73},"solvable":{"false":0.31999999999999995,"true":0.68},"value":{"0":0.02,"1":0.42,"2":0.45,"3":0.11}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:1acfa1fdeae6d5ede37846f8","state_id":"navigation_v3:1acfa1fdeae6d5ede37846f8","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,0); goal=(3,2); walls=(0,3),(0,4),(1,1),(1,2),(1,5),(2,2),(2,5),(3,0),(3,1),(3,4),(4,0),(5,0),(5,1),(5,2),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # # .\nrow 1: . # # . . #\nrow 2: A . # . . #\nrow 3: # # G . # .\nrow 4: # . . . . .\nrow 5: # # # . # .","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":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:6:goal=(2, 2):walls=((0, 0), (0, 1), (0, 2), (0, 4), (1, 0), (2, 0), (2, 1), (2, 4), (3, 2), (3, 5), (4, 1), (4, 2), (4, 5), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[0,4],[1,1],[1,2],[1,5],[2,2],[2,5],[3,0],[3,1],[3,4],[4,0],[5,0],[5,1],[5,2],[5,4]],"position":[2,0],"goal":[3,2]},"pre_transform_start":[3,0],"d4_symmetry":6,"physical_state_hash":"1acfa1fdeae6d5ede37846f83c5ed5d4e973998a4267bedb1906d116c09a0055","canonical_source_id":"navigation_v3:1acfa1fdeae6d5ede37846f8","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.82,"north":0.18},"solvable":{"false":0.24,"true":0.76},"value":{"0":0.02,"1":0.45999999999999996,"2":0.39,"3":0.13}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:22981502bffbf0d2370b2f3f","state_id":"navigation_v3:22981502bffbf0d2370b2f3f","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,2); goal=(2,0); walls=(0,1),(1,5),(2,3),(3,1),(5,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . . . .\nrow 1: . . . . . #\nrow 2: G . . # . .\nrow 3: . # A . . .\nrow 4: . . . . . .\nrow 5: # . . . . .","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).","north":"Move north to (row 2, column 2).","south":"Move south to (row 4, 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":{"east":0.0,"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:6:goal=(0, 2):walls=((0, 5), (1, 0), (1, 3), (3, 2), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[1,5],[2,3],[3,1],[5,0]],"position":[3,2],"goal":[2,0]},"pre_transform_start":[2,3],"d4_symmetry":7,"physical_state_hash":"22981502bffbf0d2370b2f3f2a11769a0a0fde1fcf93d7b14b441ed02299d45c","canonical_source_id":"navigation_v3:22981502bffbf0d2370b2f3f","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.03,"north":0.9400000000000001,"east":0.03},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0.04,"1":0.78,"2":0.17,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:cd775d8821f3f2cd4467bb08","state_id":"navigation_v3:cd775d8821f3f2cd4467bb08","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(2,0); walls=(1,2),(1,3),(2,2),(2,3),(3,2),(5,1),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: . . # # . .\nrow 2: G A # # . .\nrow 3: . . # . . .\nrow 4: . . . . . .\nrow 5: . # . . # .","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)."}},"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,"north":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:6:goal=(0, 2):walls=((1, 5), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,2],[1,3],[2,2],[2,3],[3,2],[5,1],[5,4]],"position":[2,1],"goal":[2,0]},"pre_transform_start":[2,1],"d4_symmetry":0,"physical_state_hash":"cd775d8821f3f2cd4467bb088d101a4099dfa6c29e5a6411f38bfad1a0fd3acd","canonical_source_id":"navigation_v3:cd775d8821f3f2cd4467bb08","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0,"west":0.99,"north":0.01},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0.94,"1":0.03,"2":0.02,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:8a17b7d0d5ab1f8d52bd6428","state_id":"navigation_v3:8a17b7d0d5ab1f8d52bd6428","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,1); goal=(0,5); walls=(0,2),(1,5),(3,1),(3,5),(4,4),(4,5),(5,0),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . . G\nrow 1: . . . . . #\nrow 2: . A . . . .\nrow 3: . # . . . #\nrow 4: . . . . # #\nrow 5: # . . # . .","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).","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":"east","solvable":true,"value":2},"gold_probs":{"action":{"east":0.5,"west":0.0,"north":0.5},"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":["east","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 1), (0, 3), (0, 4), (1, 4), (2, 5), (3, 0), (4, 3), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[1,5],[3,1],[3,5],[4,4],[4,5],[5,0],[5,3]],"position":[2,1],"goal":[0,5]},"pre_transform_start":[2,1],"d4_symmetry":0,"physical_state_hash":"8a17b7d0d5ab1f8d52bd6428eda3cc196f061da0f2014222c5be43c1ffa6ea07","canonical_source_id":"navigation_v3:8a17b7d0d5ab1f8d52bd6428","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.5,"east":0.49},"solvable":{"false":0.13,"true":0.87},"value":{"0":0,"1":0.18,"2":0.75,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:ef6b5850aa406a44d99e7160","state_id":"navigation_v3:ef6b5850aa406a44d99e7160","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,0); goal=(4,5); walls=(0,2),(0,5),(2,4),(3,3),(3,5),(4,1),(4,3),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # . . #\nrow 1: . . . . . .\nrow 2: . . . . # .\nrow 3: . . . # . #\nrow 4: A # . # . G\nrow 5: . # . . . .","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 3, column 0).","south":"Move south to (row 5, 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":{"north":1.0,"south":0.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:6:goal=(0, 1):walls=((0, 2), (0, 5), (1, 3), (2, 1), (2, 2), (3, 5), (4, 0), (4, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,5],[2,4],[3,3],[3,5],[4,1],[4,3],[5,1]],"position":[4,0],"goal":[4,5]},"pre_transform_start":[0,1],"d4_symmetry":3,"physical_state_hash":"ef6b5850aa406a44d99e7160ada7d77270e855f8aa4bd140ac194317005bc5ad","canonical_source_id":"navigation_v3:ef6b5850aa406a44d99e7160","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.7,"south":0.3},"solvable":{"false":0.13,"true":0.87},"value":{"0":0,"1":0.13,"2":0.77,"3":0.1}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:c4a10b109792b8e7056fed5a","state_id":"navigation_v3:c4a10b109792b8e7056fed5a","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,4); goal=(2,3); walls=(0,3),(0,4),(1,0),(1,3),(1,5),(2,1),(2,2),(2,5),(4,3),(4,4),(4,5),(5,1),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # # .\nrow 1: # . . # . #\nrow 2: . # # G A #\nrow 3: . . . . . .\nrow 4: . . . # # #\nrow 5: . # . # . .","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 4).","north":"Move north to (row 1, column 4).","west":"Move west 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":"west","solvable":true,"value":0},"gold_probs":{"action":{"south":0.0,"north":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:6:goal=(2, 2):walls=((0, 1), (0, 2), (0, 4), (1, 0), (1, 4), (2, 0), (2, 1), (2, 4), (2, 5), (3, 2), (4, 2), (4, 5), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[0,4],[1,0],[1,3],[1,5],[2,1],[2,2],[2,5],[4,3],[4,4],[4,5],[5,1],[5,3]],"position":[2,4],"goal":[2,3]},"pre_transform_start":[2,1],"d4_symmetry":4,"physical_state_hash":"c4a10b109792b8e7056fed5a6d8b81b84ba9c3d511d62a0050ea03dad2eb2ca1","canonical_source_id":"navigation_v3:c4a10b109792b8e7056fed5a","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,"west":0.89,"south":0.09},"solvable":{"false":0.30000000000000004,"true":0.7},"value":{"0":0.51,"1":0.3,"2":0.07,"3":0.12}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:705f12d404b71a464a7fa0ea","state_id":"navigation_v3:705f12d404b71a464a7fa0ea","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(5,0); walls=(0,4),(0,5),(1,1),(1,3),(2,2),(2,5),(3,1),(3,4),(3,5),(4,1),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . A . # #\nrow 1: . # . # . .\nrow 2: . . # . . #\nrow 3: . # . . # #\nrow 4: . # . . . .\nrow 5: 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 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":"west","solvable":true,"value":2},"gold_probs":{"action":{"south":0.0,"west":1.0,"east":0.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":["west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 1), (1, 1), (2, 1), (2, 4), (2, 5), (3, 2), (3, 5), (4, 1), (4, 3), (5, 4), (5, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,4],[0,5],[1,1],[1,3],[2,2],[2,5],[3,1],[3,4],[3,5],[4,1],[5,1]],"position":[0,2],"goal":[5,0]},"pre_transform_start":[0,2],"d4_symmetry":0,"physical_state_hash":"705f12d404b71a464a7fa0ea54e13ffe8aa310bb8fb2c334855e56d754f68927","canonical_source_id":"navigation_v3:705f12d404b71a464a7fa0ea","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,"south":0.55,"east":0.08},"solvable":{"false":0.14,"true":0.86},"value":{"0":0,"1":0.15,"2":0.78,"3":0.07}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:44a5195633b7b151748ee4a0","state_id":"navigation_v3:44a5195633b7b151748ee4a0","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,0); goal=(0,3); walls=(0,2),(0,4),(0,5),(1,1),(2,2),(2,3),(2,4),(3,1),(3,2),(3,4),(4,0),(5,3),(5,4),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # G # #\nrow 1: . # . . . .\nrow 2: A . # # # .\nrow 3: . # # . # .\nrow 4: # . . . . .\nrow 5: . . . # # #","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).","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":false,"value":3},"gold_probs":{"action":{"south":0.3333333333333333,"north":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","north","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 2):walls=((0, 0), (0, 1), (0, 3), (1, 4), (2, 1), (2, 2), (2, 3), (3, 1), (3, 3), (3, 4), (4, 5), (5, 0), (5, 1), (5, 2))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,4],[0,5],[1,1],[2,2],[2,3],[2,4],[3,1],[3,2],[3,4],[4,0],[5,3],[5,4],[5,5]],"position":[2,0],"goal":[0,3]},"pre_transform_start":[2,0],"d4_symmetry":0,"physical_state_hash":"44a5195633b7b151748ee4a0758244673ce826e378ff9c3f8aa059dc08ea33df","canonical_source_id":"navigation_v3:44a5195633b7b151748ee4a0","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.54,"east":0.38,"south":0.08},"solvable":{"false":0.20999999999999996,"true":0.79},"value":{"0":0,"1":0.21,"2":0.7,"3":0.09}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:ac028c15007b06d13ba59843","state_id":"navigation_v3:ac028c15007b06d13ba59843","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,0); goal=(1,5); walls=(0,3),(2,4),(3,2),(5,1),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # . .\nrow 1: . . . . . G\nrow 2: A . . . # .\nrow 3: . . # . . .\nrow 4: . . . . . .\nrow 5: . # . . # .","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).","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":"east","solvable":true,"value":2},"gold_probs":{"action":{"north":0.5,"east":0.5,"south":0.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":["east","north"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 1):walls=((1, 2), (1, 5), (2, 0), (3, 3), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[2,4],[3,2],[5,1],[5,4]],"position":[2,0],"goal":[1,5]},"pre_transform_start":[2,5],"d4_symmetry":4,"physical_state_hash":"ac028c15007b06d13ba59843a54a049c3ce0edcc057363e8e36fda3579c4d461","canonical_source_id":"navigation_v3:ac028c15007b06d13ba59843","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.02,"north":0.37,"east":0.61},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0,"1":0.09,"2":0.88,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:8167adcc865e15c25fe4564e","state_id":"navigation_v3:8167adcc865e15c25fe4564e","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,4); goal=(5,3); walls=(1,2),(1,3),(2,0),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: . . # # A .\nrow 2: # . . . . .\nrow 3: . . . . . .\nrow 4: . . . . . #\nrow 5: . . . 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 1, column 5).","north":"Move north to (row 0, column 4).","south":"Move south to (row 2, column 4)."}},"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,"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:6:goal=(0, 2):walls=((1, 0), (3, 5), (4, 2), (4, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,2],[1,3],[2,0],[4,5]],"position":[1,4],"goal":[5,3]},"pre_transform_start":[1,1],"d4_symmetry":1,"physical_state_hash":"8167adcc865e15c25fe4564e9e950d47fae85a79d7bc699693d5d56955d88689","canonical_source_id":"navigation_v3:8167adcc865e15c25fe4564e","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.86,"east":0.07,"north":0.07},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0,"1":0.49,"2":0.5,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:94e2bd6e9645f73d5ed6befe","state_id":"navigation_v3:94e2bd6e9645f73d5ed6befe","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,5); goal=(0,4); walls=(0,0),(0,2),(1,2),(2,0),(3,2),(4,2),(4,4),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # . # . G .\nrow 1: . . # . . .\nrow 2: # . . . . .\nrow 3: . . # . . A\nrow 4: . . # . # .\nrow 5: . # . . . .","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 4, column 5).","north":"Move north to (row 2, column 5).","west":"Move west to (row 3, column 4)."}},"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":{"south":0.0,"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:6:goal=(0, 1):walls=((0, 3), (0, 5), (1, 3), (2, 5), (3, 3), (4, 1), (4, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,2],[1,2],[2,0],[3,2],[4,2],[4,4],[5,1]],"position":[3,5],"goal":[0,4]},"pre_transform_start":[3,0],"d4_symmetry":4,"physical_state_hash":"94e2bd6e9645f73d5ed6befed4b1f99ef6a42b1c235e0528d4d42aab9adc7949","canonical_source_id":"navigation_v3:94e2bd6e9645f73d5ed6befe","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"west":0.47,"south":0.01,"north":0.52},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0.02,"1":0.59,"2":0.37,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:cc31dd204fafb8e02dc34d30","state_id":"navigation_v3:cc31dd204fafb8e02dc34d30","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,5); goal=(0,4); walls=(1,0),(1,3),(2,5),(3,2),(4,0).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . G A\nrow 1: # . . # . .\nrow 2: . . . . . #\nrow 3: . . # . . .\nrow 4: # . . . . .\nrow 5: . . . . . .","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 5).","west":"Move west to (row 0, column 4)."}},"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},"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:6:goal=(0, 1):walls=((1, 2), (1, 5), (2, 0), (3, 3), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,0],[1,3],[2,5],[3,2],[4,0]],"position":[0,5],"goal":[0,4]},"pre_transform_start":[0,0],"d4_symmetry":1,"physical_state_hash":"cc31dd204fafb8e02dc34d30d3fd42ea194113c5ef248013d7c42123b0db2934","canonical_source_id":"navigation_v3:cc31dd204fafb8e02dc34d30","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.040000000000000036,"true":0.96},"value":{"0":0.99,"1":0.01,"2":0,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:983ed75db442871a331315a6","state_id":"navigation_v3:983ed75db442871a331315a6","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,2); goal=(5,5); walls=(0,3),(1,0),(1,1),(3,1),(4,4),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # . .\nrow 1: # # . . . .\nrow 2: . . A . . .\nrow 3: . # . . . .\nrow 4: . . . . # #\nrow 5: . . . . . 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).","north":"Move north to (row 1, column 2).","west":"Move west to (row 2, column 1).","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":2},"gold_probs":{"action":{"south":0.5,"north":0.0,"west":0.0,"east":0.5},"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":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 1), (1, 1), (2, 5), (4, 2), (4, 4), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[1,0],[1,1],[3,1],[4,4],[4,5]],"position":[2,2],"goal":[5,5]},"pre_transform_start":[2,2],"d4_symmetry":7,"physical_state_hash":"983ed75db442871a331315a69edf800b444282cc626a2b14f92cfc1de522a8b0","canonical_source_id":"navigation_v3:983ed75db442871a331315a6","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.59,"south":0.34,"north":0.05,"west":0.02},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0,"1":0.13,"2":0.84,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:01229ce743ca4e4c68d1e9e5","state_id":"navigation_v3:01229ce743ca4e4c68d1e9e5","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,2); goal=(2,5); walls=(0,1),(0,4),(1,0),(1,1),(1,5),(2,2),(2,4),(3,1),(4,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # A . # .\nrow 1: # # . . . #\nrow 2: . . # . # G\nrow 3: . # . . . .\nrow 4: . . # . . .\nrow 5: . . . . . .","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":"east","solvable":true,"value":2},"gold_probs":{"action":{"east":0.5,"south":0.5},"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":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 2):walls=((0, 1), (1, 0), (1, 2), (3, 2), (3, 4), (4, 0), (4, 1), (4, 3), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,4],[1,0],[1,1],[1,5],[2,2],[2,4],[3,1],[4,2]],"position":[0,2],"goal":[2,5]},"pre_transform_start":[2,5],"d4_symmetry":3,"physical_state_hash":"01229ce743ca4e4c68d1e9e5492a8c63b0258dfc605e79803486ca805c81b990","canonical_source_id":"navigation_v3:01229ce743ca4e4c68d1e9e5","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.26,"south":0.74},"solvable":{"false":0.08999999999999997,"true":0.91},"value":{"0":0,"1":0.32,"2":0.64,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:a50f799cd4be3fc7873d6e48","state_id":"navigation_v3:a50f799cd4be3fc7873d6e48","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(3,4); goal=(1,0); walls=(2,2),(3,2),(4,5),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: G . . . . .\nrow 2: . . # . . .\nrow 3: . . # . A .\nrow 4: . . . . . #\nrow 5: . . . . # .","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 4, column 4).","north":"Move north to (row 2, column 4).","west":"Move west to (row 3, column 3).","east":"Move east to (row 3, column 5)."}},"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":0.5,"west":0.5,"east":0.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","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 1):walls=((2, 2), (2, 3), (4, 5), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[2,2],[3,2],[4,5],[5,4]],"position":[3,4],"goal":[1,0]},"pre_transform_start":[4,3],"d4_symmetry":7,"physical_state_hash":"a50f799cd4be3fc7873d6e486ab4a3e703384687ed53d7a30bb6d8fbddb9dc75","canonical_source_id":"navigation_v3:a50f799cd4be3fc7873d6e48","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.47,"south":0.01,"east":0.01,"west":0.51},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0,"1":0.4,"2":0.59,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:ca09a7806e7836ae0cd19113","state_id":"navigation_v3:ca09a7806e7836ae0cd19113","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,0); goal=(4,4); walls=(1,3),(1,5),(4,1),(5,0),(5,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: A . . # . #\nrow 2: . . . . . .\nrow 3: . . . . . .\nrow 4: . # . . G .\nrow 5: # . . . . #","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":2},"gold_probs":{"action":{"east":0.5,"south":0.5,"north":0.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":["east","south"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 1):walls=((0, 0), (0, 4), (2, 4), (4, 1), (5, 0))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,3],[1,5],[4,1],[5,0],[5,5]],"position":[1,0],"goal":[4,4]},"pre_transform_start":[5,4],"d4_symmetry":5,"physical_state_hash":"ca09a7806e7836ae0cd191138abd34ef2074552672f65b198b2695516a3f5130","canonical_source_id":"navigation_v3:ca09a7806e7836ae0cd19113","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.55,"south":0.41,"north":0.04},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0,"1":0.06,"2":0.9299999999999999,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:47c93f03b2b879f5f11a5f59","state_id":"navigation_v3:47c93f03b2b879f5f11a5f59","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(3,5); walls=(0,1),(2,0),(2,2),(3,4),(4,0),(4,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . . . .\nrow 1: . A . . . .\nrow 2: # . # . . .\nrow 3: . . . . # G\nrow 4: # . # . . .\nrow 5: . . . . . .","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":2},"gold_probs":{"action":{"south":0.0,"east":1.0,"west":0.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":["east"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 2):walls=((1, 2), (3, 1), (3, 3), (4, 5), (5, 1), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[2,0],[2,2],[3,4],[4,0],[4,2]],"position":[1,1],"goal":[3,5]},"pre_transform_start":[1,1],"d4_symmetry":0,"physical_state_hash":"47c93f03b2b879f5f11a5f59023370ee959bd49fc936376c5eea515fc03dc9fd","canonical_source_id":"navigation_v3:47c93f03b2b879f5f11a5f59","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.7,"west":0.01,"south":0.29},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0,"1":0.09,"2":0.87,"3":0.04}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:5da906cb286aa26dd238d1c6","state_id":"navigation_v3:5da906cb286aa26dd238d1c6","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(3,0); walls=(0,3),(2,4),(3,4),(5,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # . .\nrow 1: . A . . . .\nrow 2: . . . . # .\nrow 3: G . . . # .\nrow 4: . . . . . .\nrow 5: . # . . . .","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).","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":"south","solvable":true,"value":1},"gold_probs":{"action":{"east":0.0,"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:6:goal=(0, 2):walls=((1, 0), (3, 5), (4, 2), (4, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[2,4],[3,4],[5,1]],"position":[1,1],"goal":[3,0]},"pre_transform_start":[4,4],"d4_symmetry":2,"physical_state_hash":"5da906cb286aa26dd238d1c626d5d95cacec563251f471a707f8e75c10bbc250","canonical_source_id":"navigation_v3:5da906cb286aa26dd238d1c6","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"south":0.21,"north":0,"west":0.78,"east":0.01},"solvable":{"false":0.040000000000000036,"true":0.96},"value":{"0":0.27,"1":0.69,"2":0.04,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:771a5fe5ac26eb7e5f17756b","state_id":"navigation_v3:771a5fe5ac26eb7e5f17756b","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,5); goal=(0,0); walls=(0,2),(1,0),(1,5),(2,0),(2,1),(2,4),(3,4),(4,3),(5,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: G . # . . .\nrow 1: # . . . . #\nrow 2: # # . . # .\nrow 3: . . . . # .\nrow 4: . . . # . .\nrow 5: . . # . . 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 4, column 5).","west":"Move west to (row 5, column 4)."}},"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,"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":["north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 1), (0, 2), (1, 2), (2, 0), (2, 5), (3, 4), (4, 2), (4, 3), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[1,0],[1,5],[2,0],[2,1],[2,4],[3,4],[4,3],[5,2]],"position":[5,5],"goal":[0,0]},"pre_transform_start":[0,5],"d4_symmetry":6,"physical_state_hash":"771a5fe5ac26eb7e5f17756be147455b5e330556dbdbcde4888fca9bb7c44f91","canonical_source_id":"navigation_v3:771a5fe5ac26eb7e5f17756b","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.51,"west":0.49},"solvable":{"false":0.14,"true":0.86},"value":{"0":0,"1":0.01,"2":0.93,"3":0.06}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:56de4737b6d9ea46d1ee1fee","state_id":"navigation_v3:56de4737b6d9ea46d1ee1fee","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,1); goal=(0,0); walls=(1,5),(2,5),(3,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: G . . . . .\nrow 1: . . . . . #\nrow 2: . . . . . #\nrow 3: . . . . . #\nrow 4: . A . . . .\nrow 5: . . . . . .","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 3, column 1).","east":"Move east to (row 4, column 2).","west":"Move west to (row 4, column 0).","south":"Move south to (row 5, 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,"east":0.0,"west":0.5,"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","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((1, 5), (2, 5), (3, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,5],[2,5],[3,5]],"position":[4,1],"goal":[0,0]},"pre_transform_start":[4,4],"d4_symmetry":4,"physical_state_hash":"56de4737b6d9ea46d1ee1fee07c371d73b9b537e87b9b07d9cba2b6d04246fba","canonical_source_id":"navigation_v3:56de4737b6d9ea46d1ee1fee","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":0.01,"west":0.52,"north":0.47},"solvable":{"false":0.030000000000000027,"true":0.97},"value":{"0":0.01,"1":0.79,"2":0.2,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:2dc6ceb21f49a78f6866147f","state_id":"navigation_v3:2dc6ceb21f49a78f6866147f","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(0,3); goal=(1,0); walls=(1,3),(2,3),(4,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . A . .\nrow 1: G . . # . .\nrow 2: . . . # . .\nrow 3: . . . . . .\nrow 4: . . . . . #\nrow 5: . . . . . .","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 4).","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":"west","solvable":true,"value":1},"gold_probs":{"action":{"east":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:6:goal=(0, 1):walls=((3, 1), (3, 2), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,3],[2,3],[4,5]],"position":[0,3],"goal":[1,0]},"pre_transform_start":[5,2],"d4_symmetry":2,"physical_state_hash":"2dc6ceb21f49a78f6866147ff2e4e42eb1c1a8af77100975a9758b2e80179904","canonical_source_id":"navigation_v3:2dc6ceb21f49a78f6866147f","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.040000000000000036,"true":0.96},"value":{"0":0.03,"1":0.79,"2":0.17,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:23dc18056887f9034d3e3a78","state_id":"navigation_v3:23dc18056887f9034d3e3a78","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,5); goal=(1,3); walls=(0,2),(0,3),(1,0),(1,1),(3,0),(3,2),(4,0),(4,1),(4,2),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . # # . .\nrow 1: # # . G . .\nrow 2: . . . . . .\nrow 3: # . # . . .\nrow 4: # # # . . A\nrow 5: . . . . # .","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 4, column 4).","north":"Move north to (row 3, column 5).","south":"Move south to (row 5, column 5)."}},"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,"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","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(1, 2):walls=((0, 2), (0, 3), (1, 4), (1, 5), (3, 3), (3, 5), (4, 3), (4, 4), (4, 5), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,2],[0,3],[1,0],[1,1],[3,0],[3,2],[4,0],[4,1],[4,2],[5,4]],"position":[4,5],"goal":[1,3]},"pre_transform_start":[4,5],"d4_symmetry":0,"physical_state_hash":"23dc18056887f9034d3e3a780dd22add020685c8fbd28e926b1d4cf9f38bde2a","canonical_source_id":"navigation_v3:23dc18056887f9034d3e3a78","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,"north":0.6799999999999999,"south":0.02},"solvable":{"false":0.07999999999999996,"true":0.92},"value":{"0":0,"1":0.51,"2":0.47,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:848e6ec96f5aa63ee4aab6b0","state_id":"navigation_v3:848e6ec96f5aa63ee4aab6b0","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,4); goal=(1,2); walls=(0,0),(0,1),(1,0),(2,0),(2,2),(3,0),(3,2),(4,0),(4,2),(4,5),(5,1),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: # # . . . .\nrow 1: # . G . A .\nrow 2: # . # . . .\nrow 3: # . # . . .\nrow 4: # . # . . #\nrow 5: . # . # . .","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 4).","east":"Move east to (row 1, column 5).","north":"Move north to (row 0, column 4).","west":"Move west 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":{"south":0.0,"east":0.0,"north":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:6:goal=(1, 2):walls=((0, 0), (0, 1), (1, 0), (2, 0), (2, 2), (3, 0), (3, 2), (4, 0), (4, 2), (4, 5), (5, 1), (5, 3))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,0],[0,1],[1,0],[2,0],[2,2],[3,0],[3,2],[4,0],[4,2],[4,5],[5,1],[5,3]],"position":[1,4],"goal":[1,2]},"pre_transform_start":[4,4],"d4_symmetry":6,"physical_state_hash":"848e6ec96f5aa63ee4aab6b0290644714913a450b04e8442010b38643c1bf086","canonical_source_id":"navigation_v3:848e6ec96f5aa63ee4aab6b0","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":0,"west":1,"north":0},"solvable":{"false":0.06999999999999995,"true":0.93},"value":{"0":0.61,"1":0.35,"2":0.03,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:907a2d6575b77cf477772741","state_id":"navigation_v3:907a2d6575b77cf477772741","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,1); goal=(3,4); walls=(0,3),(0,4),(1,0),(1,3),(2,0),(2,1),(3,1),(3,2),(3,3),(3,5),(4,2),(4,4),(5,2).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # # .\nrow 1: # A . # . .\nrow 2: # # . . . .\nrow 3: . # # # G #\nrow 4: . . # . # .\nrow 5: . . # . . .","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).","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,"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:6:goal=(1, 2):walls=((0, 2), (1, 1), (1, 5), (2, 2), (2, 4), (2, 5), (3, 0), (3, 1), (3, 2), (4, 2), (4, 3), (5, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[0,4],[1,0],[1,3],[2,0],[2,1],[3,1],[3,2],[3,3],[3,5],[4,2],[4,4],[5,2]],"position":[1,1],"goal":[3,4]},"pre_transform_start":[1,4],"d4_symmetry":3,"physical_state_hash":"907a2d6575b77cf477772741d4188e5ec80331c5c3f5ca279eb5165a88efab98","canonical_source_id":"navigation_v3:907a2d6575b77cf477772741","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"north":0.06,"east":0.94},"solvable":{"false":0.18999999999999995,"true":0.81},"value":{"0":0,"1":0.3,"2":0.57,"3":0.13}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:d910f5ad0e442f045f77c3a8","state_id":"navigation_v3:d910f5ad0e442f045f77c3a8","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(0,3); walls=(1,1),(1,2),(2,4),(3,1),(3,2),(3,4),(3,5).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . G . .\nrow 1: . # # . . .\nrow 2: . . . A # .\nrow 3: . # # . # #\nrow 4: . . . . . .\nrow 5: . . . . . .","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).","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":{"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:6:goal=(0, 2):walls=((1, 3), (1, 4), (2, 1), (3, 0), (3, 1), (3, 3), (3, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,1],[1,2],[2,4],[3,1],[3,2],[3,4],[3,5]],"position":[2,3],"goal":[0,3]},"pre_transform_start":[3,2],"d4_symmetry":7,"physical_state_hash":"d910f5ad0e442f045f77c3a8bfbae080a6afc4e79f829b5f20450d9c67f22556","canonical_source_id":"navigation_v3:d910f5ad0e442f045f77c3a8","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,"north":0.96,"south":0.02},"solvable":{"false":0.12,"true":0.88},"value":{"0":0.58,"1":0.33,"2":0.06,"3":0.03}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:2ef5da1f1b965eebe4e39dbe","state_id":"navigation_v3:2ef5da1f1b965eebe4e39dbe","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(2,3); goal=(3,3); walls=(0,1),(0,3),(1,3),(1,4),(1,5),(3,1),(3,2),(3,5),(4,0),(4,3),(4,5),(5,3),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # . # . .\nrow 1: . . . # # #\nrow 2: . . . A . .\nrow 3: . # # G . #\nrow 4: # . . # . #\nrow 5: . . . # # .","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 4).","west":"Move west to (row 2, column 2).","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":0},"gold_probs":{"action":{"east":0.0,"west":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:6:goal=(2, 2):walls=((0, 1), (0, 2), (0, 4), (1, 0), (1, 4), (2, 0), (2, 1), (2, 4), (2, 5), (3, 2), (4, 2), (4, 5), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,3],[1,3],[1,4],[1,5],[3,1],[3,2],[3,5],[4,0],[4,3],[4,5],[5,3],[5,4]],"position":[2,3],"goal":[3,3]},"pre_transform_start":[3,2],"d4_symmetry":2,"physical_state_hash":"2ef5da1f1b965eebe4e39dbe5258754ea0c72ad6851f9c072a61a98339839e6d","canonical_source_id":"navigation_v3:2ef5da1f1b965eebe4e39dbe","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,"south":0.96,"east":0.02},"solvable":{"false":0.29000000000000004,"true":0.71},"value":{"0":0.6,"1":0.23,"2":0.08,"3":0.09}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:da4db4ad41f5c1206ad2298d","state_id":"navigation_v3:da4db4ad41f5c1206ad2298d","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(1,3); goal=(2,4); walls=(1,0),(2,5),(3,1),(3,2),(3,5),(4,1),(4,4),(5,1),(5,2),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . . . .\nrow 1: # . . A . .\nrow 2: . . . . G #\nrow 3: . # # . . #\nrow 4: . # . . # .\nrow 5: . # # . # .","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 4).","north":"Move north to (row 0, column 3).","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":"east","solvable":true,"value":0},"gold_probs":{"action":{"east":0.5,"north":0.0,"west":0.0,"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:6:goal=(1, 2):walls=((0, 2), (0, 3), (1, 4), (1, 5), (3, 3), (3, 5), (4, 3), (4, 4), (4, 5), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[1,0],[2,5],[3,1],[3,2],[3,5],[4,1],[4,4],[5,1],[5,2],[5,4]],"position":[1,3],"goal":[2,4]},"pre_transform_start":[2,4],"d4_symmetry":5,"physical_state_hash":"da4db4ad41f5c1206ad2298d4a318060bcb497aae5f42d27c8487061e96d5b05","canonical_source_id":"navigation_v3:da4db4ad41f5c1206ad2298d","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.01,"north":0.01,"east":0.5599999999999999},"solvable":{"false":0.050000000000000044,"true":0.95},"value":{"0":0.94,"1":0.05,"2":0.01,"3":0}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:0074b466fecd6e51aa519a3d","state_id":"navigation_v3:0074b466fecd6e51aa519a3d","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(4,4); goal=(3,4); walls=(0,1),(0,2),(1,1),(1,5),(2,2),(3,1),(4,2),(4,3),(5,4).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . # # . . .\nrow 1: . # . . . #\nrow 2: . . # . . .\nrow 3: . # . . G .\nrow 4: . . # # A .\nrow 5: . . . . # .","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 4, column 5).","north":"Move north to (row 3, column 4)."}},"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:6:goal=(1, 2):walls=((0, 4), (1, 0), (2, 1), (3, 1), (3, 3), (3, 5), (4, 2), (4, 4), (4, 5))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,1],[0,2],[1,1],[1,5],[2,2],[3,1],[4,2],[4,3],[5,4]],"position":[4,4],"goal":[3,4]},"pre_transform_start":[4,4],"d4_symmetry":0,"physical_state_hash":"0074b466fecd6e51aa519a3db2cb0b3db4876e94d634d35b222cce63fcb4bebc","canonical_source_id":"navigation_v3:0074b466fecd6e51aa519a3d","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":1},"solvable":{"false":0.13,"true":0.87},"value":{"0":0.88,"1":0.09,"2":0.02,"3":0.01}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:79064f4a9f0d44a0589c12b1","state_id":"navigation_v3:79064f4a9f0d44a0589c12b1","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,1); goal=(0,5); walls=(0,3),(1,0),(1,5),(2,1),(2,4),(2,5),(3,1),(4,2),(5,3).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # . G\nrow 1: # . . . . #\nrow 2: . # . . # #\nrow 3: . # . . . .\nrow 4: . . # . . .\nrow 5: . 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 4, column 1).","east":"Move east to (row 5, column 2).","west":"Move west to (row 5, 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":{"north":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","north","west"]},"metadata":{"source":"self_authored_programmatic","license":"CC0-1.0","source_group_id":"grid:6:goal=(0, 0):walls=((0, 1), (0, 2), (1, 2), (2, 0), (2, 5), (3, 4), (4, 2), (4, 3), (5, 1))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[1,0],[1,5],[2,1],[2,4],[2,5],[3,1],[4,2],[5,3]],"position":[5,1],"goal":[0,5]},"pre_transform_start":[0,4],"d4_symmetry":2,"physical_state_hash":"79064f4a9f0d44a0589c12b195eb3b27e17b87f5b7751ce7eda8a49a4a524d10","canonical_source_id":"navigation_v3:79064f4a9f0d44a0589c12b1","representation":"coords","coverage":"shared_evaluation"},"teacher":{"model":"typesafe-ai/jev","label_source":"jev_native_evaluation","target_kind":"rounded_probabilities","native_probs":{"action":{"east":0.32,"north":0.57,"west":0.11},"solvable":{"false":0.18999999999999995,"true":0.81},"value":{"0":0,"1":0.02,"2":0.88,"3":0.1}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}
{"id":"navigation_v3:16c5e9c116a368b7803476e6","state_id":"navigation_v3:16c5e9c116a368b7803476e6","family_id":"grid_navigation_coordinates_v3","split":"ood","state":"Larger navigation state:\nGrid 6x6. Coordinates are zero-based (row,column). Rows increase south; columns increase east.\nAgent=(5,3); goal=(4,5); walls=(0,3),(0,5),(1,0),(2,1),(2,2),(2,4),(2,5),(4,1).\nEach legal orthogonal move costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\ncolumns: 0 1 2 3 4 5\nrow 0: . . . # . #\nrow 1: # . . . . .\nrow 2: . # # . # #\nrow 3: . . . . . .\nrow 4: . # . . . G\nrow 5: . . . 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 5, column 2).","north":"Move north to (row 4, column 3).","east":"Move east to (row 5, column 4)."}},"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:6:goal=(0, 1):walls=((0, 3), (0, 5), (1, 3), (2, 5), (3, 3), (4, 1), (4, 3), (5, 4))","template_id":"navigation_v3:ood","language":"en","environment_state":{"game":"grid_navigation","size":6,"walls":[[0,3],[0,5],[1,0],[2,1],[2,2],[2,4],[2,5],[4,1]],"position":[5,3],"goal":[4,5]},"pre_transform_start":[2,0],"d4_symmetry":5,"physical_state_hash":"16c5e9c116a368b7803476e6669e74cef171855f21271ceefe4326c174257ade","canonical_source_id":"navigation_v3:16c5e9c116a368b7803476e6","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.42,"north":0.5599999999999999},"solvable":{"false":0.06000000000000005,"true":0.94},"value":{"0":0.06,"1":0.81,"2":0.11,"3":0.02}},"rounding":{"probabilityDecimals":2,"scoreDecimals":2}}}