Datasets:
id stringlengths 41 41 | input stringlengths 2.51k 5.3k | target stringlengths 208 939 | text stringlengths 2.74k 5.7k | family stringclasses 1
value | task_name stringclasses 1
value | source_repo stringclasses 1
value | source_config stringclasses 1
value | source_id stringlengths 46 46 | prompt_format stringclasses 1
value | icl_shots int64 5 5 | seed int64 1.07B 1.07B | index int64 0 999 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
clrs_style_clrs_bfs_arrow_5shot_icl_00000 | Find the shortest path from 6 to 5 in the unweighted graph with 9 nodes and edges [[0, 1], [0, 2], [0, 7], [1, 5], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [3, 4], [3, 8], [4, 6], [4, 7], [6, 7], [7, 8]] using BFS.
=> Step-by-step solution:
1. {"node": 6, "queue": []} -> {"new_neighbors": [2, 4, 7], "queue": [2, 4, 7]}
... | Step-by-step solution:
1. {"node": 3, "queue": []} -> {"new_neighbors": [2, 4, 6, 8], "queue": [2, 4, 6, 8]}
2. {"node": 2, "queue": [4, 6, 8]} -> {"new_neighbors": [0, 1], "queue": [4, 6, 8, 0, 1]}
3. {"node": 4, "queue": [6, 8, 0, 1]} -> {"new_neighbors": [5, 7], "queue": [6, 8, 0, 1, 5, 7]}
4. {"node": 6, "queue": [... | Find the shortest path from 6 to 5 in the unweighted graph with 9 nodes and edges [[0, 1], [0, 2], [0, 7], [1, 5], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [3, 4], [3, 8], [4, 6], [4, 7], [6, 7], [7, 8]] using BFS.
=> Step-by-step solution:
1. {"node": 6, "queue": []} -> {"new_neighbors": [2, 4, 7], "queue": [2, 4, 7]}
... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000000 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 0 |
clrs_style_clrs_bfs_arrow_5shot_icl_00001 | Find the shortest path from 8 to 6 in the unweighted graph with 9 nodes and edges [[0, 1], [0, 4], [0, 5], [0, 7], [0, 8], [1, 2], [2, 3], [2, 6], [2, 8], [3, 4], [3, 5], [3, 6], [4, 6], [5, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 8, "queue": []} -> {"new_neighbors": [0, 2], "queue": [0, 2]}
2. {"node": 0,... | Step-by-step solution:
1. {"node": 6, "queue": []} -> {"new_neighbors": [2, 4, 7], "queue": [2, 4, 7]}
2. {"node": 2, "queue": [4, 7]} -> {"new_neighbors": [0, 3, 5], "queue": [4, 7, 0, 3, 5]}
3. {"node": 4, "queue": [7, 0, 3, 5]} -> {"new_neighbors": [], "queue": [7, 0, 3, 5]}
4. {"node": 7, "queue": [0, 3, 5]} -> {"n... | Find the shortest path from 8 to 6 in the unweighted graph with 9 nodes and edges [[0, 1], [0, 4], [0, 5], [0, 7], [0, 8], [1, 2], [2, 3], [2, 6], [2, 8], [3, 4], [3, 5], [3, 6], [4, 6], [5, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 8, "queue": []} -> {"new_neighbors": [0, 2], "queue": [0, 2]}
2. {"node": 0,... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000001 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 1 |
clrs_style_clrs_bfs_arrow_5shot_icl_00002 | Find the shortest path from 5 to 2 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 5], [1, 2], [1, 3], [2, 3], [2, 4], [2, 5], [4, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 5, "queue": []} -> {"new_neighbors": [0, 2], "queue": [0, 2]}
2. {"node": 0, "queue": [2]} -> {"new_neighbor... | Step-by-step solution:
1. {"node": 8, "queue": []} -> {"new_neighbors": [0, 2], "queue": [0, 2]}
2. {"node": 0, "queue": [2]} -> {"new_neighbors": [1, 4, 5, 7], "queue": [2, 1, 4, 5, 7]}
3. {"node": 2, "queue": [1, 4, 5, 7]} -> {"new_neighbors": [3, 6], "queue": [1, 4, 5, 7, 3, 6]}
4. {"node": 1, "queue": [4, 5, 7, 3, ... | Find the shortest path from 5 to 2 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 5], [1, 2], [1, 3], [2, 3], [2, 4], [2, 5], [4, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 5, "queue": []} -> {"new_neighbors": [0, 2], "queue": [0, 2]}
2. {"node": 0, "queue": [2]} -> {"new_neighbor... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000002 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 2 |
clrs_style_clrs_bfs_arrow_5shot_icl_00003 | Find the shortest path from 4 to 8 in the unweighted graph with 10 nodes and edges [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 9], [1, 2], [1, 8], [2, 5], [3, 5], [4, 5], [4, 6], [4, 8], [5, 6], [6, 7], [6, 9]] using BFS.
=> Step-by-step solution:
1. {"node": 4, "queue": []} -> {"new_neighbors": [0, 5, 6, 8], "queue":... | Step-by-step solution:
1. {"node": 5, "queue": []} -> {"new_neighbors": [0, 2], "queue": [0, 2]}
2. {"node": 0, "queue": [2]} -> {"new_neighbors": [1, 3], "queue": [2, 1, 3]}
3. {"node": 2, "queue": [1, 3]} -> {"queue": [1, 3], "status": "target_found"}
So the final result: {"distance": 1, "path": [5, 2]}
| Find the shortest path from 4 to 8 in the unweighted graph with 10 nodes and edges [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 9], [1, 2], [1, 8], [2, 5], [3, 5], [4, 5], [4, 6], [4, 8], [5, 6], [6, 7], [6, 9]] using BFS.
=> Step-by-step solution:
1. {"node": 4, "queue": []} -> {"new_neighbors": [0, 5, 6, 8], "queue":... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000003 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 3 |
clrs_style_clrs_bfs_arrow_5shot_icl_00004 | Find the shortest path from 2 to 6 in the unweighted graph with 8 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [1, 6], [1, 7], [2, 3], [2, 4], [3, 4], [6, 7]] using BFS.
=> Step-by-step solution:
1. {"node": 2, "queue": []} -> {"new_neighbors": [0, 3, 4], "queue": [0, 3, 4]}
2. {"node": 0, "queue": [3, 4]} ... | Step-by-step solution:
1. {"node": 4, "queue": []} -> {"new_neighbors": [0, 5, 6, 8], "queue": [0, 5, 6, 8]}
2. {"node": 0, "queue": [5, 6, 8]} -> {"new_neighbors": [1, 3, 9], "queue": [5, 6, 8, 1, 3, 9]}
3. {"node": 5, "queue": [6, 8, 1, 3, 9]} -> {"new_neighbors": [2], "queue": [6, 8, 1, 3, 9, 2]}
4. {"node": 6, "que... | Find the shortest path from 2 to 6 in the unweighted graph with 8 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [1, 6], [1, 7], [2, 3], [2, 4], [3, 4], [6, 7]] using BFS.
=> Step-by-step solution:
1. {"node": 2, "queue": []} -> {"new_neighbors": [0, 3, 4], "queue": [0, 3, 4]}
2. {"node": 0, "queue": [3, 4]} ... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000004 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 4 |
clrs_style_clrs_bfs_arrow_5shot_icl_00005 | Find the shortest path from 8 to 9 in the unweighted graph with 10 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 6], [0, 7], [1, 4], [1, 5], [1, 7], [2, 9], [4, 7], [4, 8], [4, 9], [6, 7], [6, 8], [7, 8]] using BFS.
=> Step-by-step solution:
1. {"node": 8, "queue": []} -> {"new_neighbors": [4, 6, 7], "queue": [4, 6, 7]}... | Step-by-step solution:
1. {"node": 2, "queue": []} -> {"new_neighbors": [0, 3, 4], "queue": [0, 3, 4]}
2. {"node": 0, "queue": [3, 4]} -> {"new_neighbors": [1, 5, 6], "queue": [3, 4, 1, 5, 6]}
3. {"node": 3, "queue": [4, 1, 5, 6]} -> {"new_neighbors": [], "queue": [4, 1, 5, 6]}
4. {"node": 4, "queue": [1, 5, 6]} -> {"n... | Find the shortest path from 8 to 9 in the unweighted graph with 10 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 6], [0, 7], [1, 4], [1, 5], [1, 7], [2, 9], [4, 7], [4, 8], [4, 9], [6, 7], [6, 8], [7, 8]] using BFS.
=> Step-by-step solution:
1. {"node": 8, "queue": []} -> {"new_neighbors": [4, 6, 7], "queue": [4, 6, 7]}... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000005 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 5 |
clrs_style_clrs_bfs_arrow_5shot_icl_00006 | Find the shortest path from 2 to 0 in the unweighted graph with 6 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [2, 3]] using BFS.
=> Step-by-step solution:
1. {"node": 2, "queue": []} -> {"new_neighbors": [0, 3], "queue": [0, 3]}
2. {"node": 0, "queue": [3]} -> {"queue": [3], "status": "target_found"}
So th... | Step-by-step solution:
1. {"node": 8, "queue": []} -> {"new_neighbors": [4, 6, 7], "queue": [4, 6, 7]}
2. {"node": 4, "queue": [6, 7]} -> {"new_neighbors": [1, 9], "queue": [6, 7, 1, 9]}
3. {"node": 6, "queue": [7, 1, 9]} -> {"new_neighbors": [0], "queue": [7, 1, 9, 0]}
4. {"node": 7, "queue": [1, 9, 0]} -> {"new_neigh... | Find the shortest path from 2 to 0 in the unweighted graph with 6 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [2, 3]] using BFS.
=> Step-by-step solution:
1. {"node": 2, "queue": []} -> {"new_neighbors": [0, 3], "queue": [0, 3]}
2. {"node": 0, "queue": [3]} -> {"queue": [3], "status": "target_found"}
So th... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000006 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 6 |
clrs_style_clrs_bfs_arrow_5shot_icl_00007 | Find the shortest path from 6 to 4 in the unweighted graph with 7 nodes and edges [[0, 1], [1, 2], [1, 3], [2, 4], [2, 6], [4, 5]] using BFS.
=> Step-by-step solution:
1. {"node": 6, "queue": []} -> {"new_neighbors": [2], "queue": [2]}
2. {"node": 2, "queue": []} -> {"new_neighbors": [1, 4], "queue": [1, 4]}
3. {"node"... | Step-by-step solution:
1. {"node": 2, "queue": []} -> {"new_neighbors": [0, 3], "queue": [0, 3]}
2. {"node": 0, "queue": [3]} -> {"queue": [3], "status": "target_found"}
So the final result: {"distance": 1, "path": [2, 0]}
| Find the shortest path from 6 to 4 in the unweighted graph with 7 nodes and edges [[0, 1], [1, 2], [1, 3], [2, 4], [2, 6], [4, 5]] using BFS.
=> Step-by-step solution:
1. {"node": 6, "queue": []} -> {"new_neighbors": [2], "queue": [2]}
2. {"node": 2, "queue": []} -> {"new_neighbors": [1, 4], "queue": [1, 4]}
3. {"node"... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000007 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 7 |
clrs_style_clrs_bfs_arrow_5shot_icl_00008 | Find the shortest path from 2 to 3 in the unweighted graph with 6 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 4], [1, 3], [1, 4], [1, 5], [2, 5], [3, 5]] using BFS.
=> Step-by-step solution:
1. {"node": 2, "queue": []} -> {"new_neighbors": [0, 5], "queue": [0, 5]}
2. {"node": 0, "queue": [5]} -> {"new_neighbors": [1, ... | Step-by-step solution:
1. {"node": 6, "queue": []} -> {"new_neighbors": [2], "queue": [2]}
2. {"node": 2, "queue": []} -> {"new_neighbors": [1, 4], "queue": [1, 4]}
3. {"node": 1, "queue": [4]} -> {"new_neighbors": [0, 3], "queue": [4, 0, 3]}
4. {"node": 4, "queue": [0, 3]} -> {"queue": [0, 3], "status": "target_found"... | Find the shortest path from 2 to 3 in the unweighted graph with 6 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 4], [1, 3], [1, 4], [1, 5], [2, 5], [3, 5]] using BFS.
=> Step-by-step solution:
1. {"node": 2, "queue": []} -> {"new_neighbors": [0, 5], "queue": [0, 5]}
2. {"node": 0, "queue": [5]} -> {"new_neighbors": [1, ... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000008 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 8 |
clrs_style_clrs_bfs_arrow_5shot_icl_00009 | Find the shortest path from 0 to 4 in the unweighted graph with 9 nodes and edges [[0, 1], [0, 5], [0, 6], [0, 8], [1, 2], [1, 3], [1, 4], [1, 5], [2, 4], [2, 6], [2, 7], [2, 8], [3, 7], [4, 5], [6, 8]] using BFS.
=> Step-by-step solution:
1. {"node": 0, "queue": []} -> {"new_neighbors": [1, 5, 6, 8], "queue": [1, 5, 6... | Step-by-step solution:
1. {"node": 2, "queue": []} -> {"new_neighbors": [0, 5], "queue": [0, 5]}
2. {"node": 0, "queue": [5]} -> {"new_neighbors": [1, 3, 4], "queue": [5, 1, 3, 4]}
3. {"node": 5, "queue": [1, 3, 4]} -> {"new_neighbors": [], "queue": [1, 3, 4]}
4. {"node": 1, "queue": [3, 4]} -> {"new_neighbors": [], "q... | Find the shortest path from 0 to 4 in the unweighted graph with 9 nodes and edges [[0, 1], [0, 5], [0, 6], [0, 8], [1, 2], [1, 3], [1, 4], [1, 5], [2, 4], [2, 6], [2, 7], [2, 8], [3, 7], [4, 5], [6, 8]] using BFS.
=> Step-by-step solution:
1. {"node": 0, "queue": []} -> {"new_neighbors": [1, 5, 6, 8], "queue": [1, 5, 6... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000009 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 9 |
clrs_style_clrs_bfs_arrow_5shot_icl_00010 | Find the shortest path from 8 to 0 in the unweighted graph with 9 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 5], [0, 7], [1, 2], [1, 4], [1, 5], [1, 7], [1, 8], [2, 4], [3, 4], [3, 7], [3, 8], [4, 8], [5, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 8, "queue": []} -> {"new_neighbors": [1, 3, 4], "queue": [1,... | Step-by-step solution:
1. {"node": 0, "queue": []} -> {"new_neighbors": [1, 5, 6, 8], "queue": [1, 5, 6, 8]}
2. {"node": 1, "queue": [5, 6, 8]} -> {"new_neighbors": [2, 3, 4], "queue": [5, 6, 8, 2, 3, 4]}
3. {"node": 5, "queue": [6, 8, 2, 3, 4]} -> {"new_neighbors": [], "queue": [6, 8, 2, 3, 4]}
4. {"node": 6, "queue":... | Find the shortest path from 8 to 0 in the unweighted graph with 9 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 5], [0, 7], [1, 2], [1, 4], [1, 5], [1, 7], [1, 8], [2, 4], [3, 4], [3, 7], [3, 8], [4, 8], [5, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 8, "queue": []} -> {"new_neighbors": [1, 3, 4], "queue": [1,... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000010 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 10 |
clrs_style_clrs_bfs_arrow_5shot_icl_00011 | Find the shortest path from 1 to 3 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 3], [0, 4], [1, 2], [1, 5], [2, 4], [2, 6], [3, 4], [3, 5], [4, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 1, "queue": []} -> {"new_neighbors": [0, 2, 5], "queue": [0, 2, 5]}
2. {"node": 0, "queue": [2, 5]} -> {"new... | Step-by-step solution:
1. {"node": 8, "queue": []} -> {"new_neighbors": [1, 3, 4], "queue": [1, 3, 4]}
2. {"node": 1, "queue": [3, 4]} -> {"new_neighbors": [0, 2, 5, 7], "queue": [3, 4, 0, 2, 5, 7]}
3. {"node": 3, "queue": [4, 0, 2, 5, 7]} -> {"new_neighbors": [], "queue": [4, 0, 2, 5, 7]}
4. {"node": 4, "queue": [0, 2... | Find the shortest path from 1 to 3 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 3], [0, 4], [1, 2], [1, 5], [2, 4], [2, 6], [3, 4], [3, 5], [4, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 1, "queue": []} -> {"new_neighbors": [0, 2, 5], "queue": [0, 2, 5]}
2. {"node": 0, "queue": [2, 5]} -> {"new... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000011 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 11 |
clrs_style_clrs_bfs_arrow_5shot_icl_00012 | Find the shortest path from 0 to 1 in the unweighted graph with 10 nodes and edges [[0, 1], [0, 4], [0, 5], [0, 9], [1, 2], [1, 6], [1, 8], [2, 3], [2, 7], [2, 8], [3, 8], [4, 6], [5, 7]] using BFS.
=> Step-by-step solution:
1. {"node": 0, "queue": []} -> {"new_neighbors": [1, 4, 5, 9], "queue": [1, 4, 5, 9]}
2. {"node... | Step-by-step solution:
1. {"node": 1, "queue": []} -> {"new_neighbors": [0, 2, 5], "queue": [0, 2, 5]}
2. {"node": 0, "queue": [2, 5]} -> {"new_neighbors": [3, 4], "queue": [2, 5, 3, 4]}
3. {"node": 2, "queue": [5, 3, 4]} -> {"new_neighbors": [6], "queue": [5, 3, 4, 6]}
4. {"node": 5, "queue": [3, 4, 6]} -> {"new_neigh... | Find the shortest path from 0 to 1 in the unweighted graph with 10 nodes and edges [[0, 1], [0, 4], [0, 5], [0, 9], [1, 2], [1, 6], [1, 8], [2, 3], [2, 7], [2, 8], [3, 8], [4, 6], [5, 7]] using BFS.
=> Step-by-step solution:
1. {"node": 0, "queue": []} -> {"new_neighbors": [1, 4, 5, 9], "queue": [1, 4, 5, 9]}
2. {"node... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000012 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 12 |
clrs_style_clrs_bfs_arrow_5shot_icl_00013 | Find the shortest path from 5 to 3 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 3], [0, 5], [1, 2], [2, 5], [3, 4], [3, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 5, "queue": []} -> {"new_neighbors": [0, 2], "queue": [0, 2]}
2. {"node": 0, "queue": [2]} -> {"new_neighbors": [1, 3], "queue": [2,... | Step-by-step solution:
1. {"node": 0, "queue": []} -> {"new_neighbors": [1, 4, 5, 9], "queue": [1, 4, 5, 9]}
2. {"node": 1, "queue": [4, 5, 9]} -> {"queue": [4, 5, 9], "status": "target_found"}
Therefore, the answer: {"distance": 1, "path": [0, 1]}
| Find the shortest path from 5 to 3 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 3], [0, 5], [1, 2], [2, 5], [3, 4], [3, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 5, "queue": []} -> {"new_neighbors": [0, 2], "queue": [0, 2]}
2. {"node": 0, "queue": [2]} -> {"new_neighbors": [1, 3], "queue": [2,... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000013 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 13 |
clrs_style_clrs_bfs_arrow_5shot_icl_00014 | Find the shortest path from 4 to 6 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 2], [0, 4], [1, 2], [1, 5], [2, 3], [2, 5], [2, 6], [5, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 4, "queue": []} -> {"new_neighbors": [0], "queue": [0]}
2. {"node": 0, "queue": []} -> {"new_neighbors": [1, 2], "qu... | Step-by-step solution:
1. {"node": 5, "queue": []} -> {"new_neighbors": [0, 2], "queue": [0, 2]}
2. {"node": 0, "queue": [2]} -> {"new_neighbors": [1, 3], "queue": [2, 1, 3]}
3. {"node": 2, "queue": [1, 3]} -> {"new_neighbors": [], "queue": [1, 3]}
4. {"node": 1, "queue": [3]} -> {"new_neighbors": [], "queue": [3]}
5. ... | Find the shortest path from 4 to 6 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 2], [0, 4], [1, 2], [1, 5], [2, 3], [2, 5], [2, 6], [5, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 4, "queue": []} -> {"new_neighbors": [0], "queue": [0]}
2. {"node": 0, "queue": []} -> {"new_neighbors": [1, 2], "qu... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000014 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 14 |
clrs_style_clrs_bfs_arrow_5shot_icl_00015 | Find the shortest path from 9 to 5 in the unweighted graph with 10 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [1, 5], [2, 7], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [4, 5], [5, 7]] using BFS.
=> Step-by-step solution:
1. {"node": 9, "queue": []} -> {"new_neighbors": [3], "queue": [3]}
2. {"node": 3, "que... | Step-by-step solution:
1. {"node": 4, "queue": []} -> {"new_neighbors": [0], "queue": [0]}
2. {"node": 0, "queue": []} -> {"new_neighbors": [1, 2], "queue": [1, 2]}
3. {"node": 1, "queue": [2]} -> {"new_neighbors": [5], "queue": [2, 5]}
4. {"node": 2, "queue": [5]} -> {"new_neighbors": [3, 6], "queue": [5, 3, 6]}
5. {"... | Find the shortest path from 9 to 5 in the unweighted graph with 10 nodes and edges [[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [1, 5], [2, 7], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [4, 5], [5, 7]] using BFS.
=> Step-by-step solution:
1. {"node": 9, "queue": []} -> {"new_neighbors": [3], "queue": [3]}
2. {"node": 3, "que... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000015 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 15 |
clrs_style_clrs_bfs_arrow_5shot_icl_00016 | Find the shortest path from 0 to 1 in the unweighted graph with 6 nodes and edges [[0, 1], [0, 5], [1, 2], [1, 3], [3, 4]] using BFS.
=> Step-by-step solution:
1. {"node": 0, "queue": []} -> {"new_neighbors": [1, 5], "queue": [1, 5]}
2. {"node": 1, "queue": [5]} -> {"queue": [5], "status": "target_found"}
Final answer:... | Step-by-step solution:
1. {"node": 9, "queue": []} -> {"new_neighbors": [3], "queue": [3]}
2. {"node": 3, "queue": []} -> {"new_neighbors": [0, 5, 6, 7, 8], "queue": [0, 5, 6, 7, 8]}
3. {"node": 0, "queue": [5, 6, 7, 8]} -> {"new_neighbors": [1, 2, 4], "queue": [5, 6, 7, 8, 1, 2, 4]}
4. {"node": 5, "queue": [6, 7, 8, 1... | Find the shortest path from 0 to 1 in the unweighted graph with 6 nodes and edges [[0, 1], [0, 5], [1, 2], [1, 3], [3, 4]] using BFS.
=> Step-by-step solution:
1. {"node": 0, "queue": []} -> {"new_neighbors": [1, 5], "queue": [1, 5]}
2. {"node": 1, "queue": [5]} -> {"queue": [5], "status": "target_found"}
Final answer:... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000016 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 16 |
clrs_style_clrs_bfs_arrow_5shot_icl_00017 | Find the shortest path from 4 to 3 in the unweighted graph with 10 nodes and edges [[0, 1], [0, 2], [0, 7], [0, 8], [1, 3], [1, 6], [1, 7], [1, 8], [1, 9], [2, 5], [2, 7], [3, 4], [3, 5], [3, 6], [3, 7], [4, 5], [4, 6], [4, 9], [8, 9]] using BFS.
=> Step-by-step solution:
1. {"node": 4, "queue": []} -> {"new_neighbors"... | Step-by-step solution:
1. {"node": 0, "queue": []} -> {"new_neighbors": [1, 5], "queue": [1, 5]}
2. {"node": 1, "queue": [5]} -> {"queue": [5], "status": "target_found"}
Final answer: {"distance": 1, "path": [0, 1]}
| Find the shortest path from 4 to 3 in the unweighted graph with 10 nodes and edges [[0, 1], [0, 2], [0, 7], [0, 8], [1, 3], [1, 6], [1, 7], [1, 8], [1, 9], [2, 5], [2, 7], [3, 4], [3, 5], [3, 6], [3, 7], [4, 5], [4, 6], [4, 9], [8, 9]] using BFS.
=> Step-by-step solution:
1. {"node": 4, "queue": []} -> {"new_neighbors"... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000017 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 17 |
clrs_style_clrs_bfs_arrow_5shot_icl_00018 | Find the shortest path from 1 to 0 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 2], [0, 3], [1, 2], [1, 4], [2, 4], [2, 6], [3, 6], [4, 5], [4, 6], [5, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 1, "queue": []} -> {"new_neighbors": [0, 2, 4], "queue": [0, 2, 4]}
2. {"node": 0, "queue": [2, 4]} ... | Step-by-step solution:
1. {"node": 4, "queue": []} -> {"new_neighbors": [3, 5, 6, 9], "queue": [3, 5, 6, 9]}
2. {"node": 3, "queue": [5, 6, 9]} -> {"queue": [5, 6, 9], "status": "target_found"}
Final answer: {"distance": 1, "path": [4, 3]}
| Find the shortest path from 1 to 0 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 2], [0, 3], [1, 2], [1, 4], [2, 4], [2, 6], [3, 6], [4, 5], [4, 6], [5, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 1, "queue": []} -> {"new_neighbors": [0, 2, 4], "queue": [0, 2, 4]}
2. {"node": 0, "queue": [2, 4]} ... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000018 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 18 |
clrs_style_clrs_bfs_arrow_5shot_icl_00019 | Find the shortest path from 5 to 0 in the unweighted graph with 8 nodes and edges [[0, 1], [0, 3], [0, 4], [0, 7], [1, 2], [1, 3], [1, 5], [2, 4], [2, 6], [3, 4], [5, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 5, "queue": []} -> {"new_neighbors": [1, 6], "queue": [1, 6]}
2. {"node": 1, "queue": [6]} -> {"new_... | Step-by-step solution:
1. {"node": 1, "queue": []} -> {"new_neighbors": [0, 2, 4], "queue": [0, 2, 4]}
2. {"node": 0, "queue": [2, 4]} -> {"queue": [2, 4], "status": "target_found"}
Final answer: {"distance": 1, "path": [1, 0]}
| Find the shortest path from 5 to 0 in the unweighted graph with 8 nodes and edges [[0, 1], [0, 3], [0, 4], [0, 7], [1, 2], [1, 3], [1, 5], [2, 4], [2, 6], [3, 4], [5, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 5, "queue": []} -> {"new_neighbors": [1, 6], "queue": [1, 6]}
2. {"node": 1, "queue": [6]} -> {"new_... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000019 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 19 |
clrs_style_clrs_bfs_arrow_5shot_icl_00020 | Find the shortest path from 1 to 0 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 3], [0, 4], [0, 6], [1, 2], [1, 4], [1, 5], [4, 5], [4, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 1, "queue": []} -> {"new_neighbors": [0, 2, 4, 5], "queue": [0, 2, 4, 5]}
2. {"node": 0, "queue": [2, 4, 5]} -> {"qu... | Step-by-step solution:
1. {"node": 5, "queue": []} -> {"new_neighbors": [1, 6], "queue": [1, 6]}
2. {"node": 1, "queue": [6]} -> {"new_neighbors": [0, 2, 3], "queue": [6, 0, 2, 3]}
3. {"node": 6, "queue": [0, 2, 3]} -> {"new_neighbors": [], "queue": [0, 2, 3]}
4. {"node": 0, "queue": [2, 3]} -> {"queue": [2, 3], "statu... | Find the shortest path from 1 to 0 in the unweighted graph with 7 nodes and edges [[0, 1], [0, 3], [0, 4], [0, 6], [1, 2], [1, 4], [1, 5], [4, 5], [4, 6]] using BFS.
=> Step-by-step solution:
1. {"node": 1, "queue": []} -> {"new_neighbors": [0, 2, 4, 5], "queue": [0, 2, 4, 5]}
2. {"node": 0, "queue": [2, 4, 5]} -> {"qu... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000020 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 20 |
clrs_style_clrs_bfs_arrow_5shot_icl_00021 | Find the shortest path from 2 to 3 in the unweighted graph with 6 nodes and edges [[0, 1], [0, 4], [1, 2], [1, 3], [1, 4], [2, 4], [2, 5]] using BFS.
=> Step-by-step solution:
1. {"node": 2, "queue": []} -> {"new_neighbors": [1, 4, 5], "queue": [1, 4, 5]}
2. {"node": 1, "queue": [4, 5]} -> {"new_neighbors": [0, 3], "qu... | Step-by-step solution:
1. {"node": 1, "queue": []} -> {"new_neighbors": [0, 2, 4, 5], "queue": [0, 2, 4, 5]}
2. {"node": 0, "queue": [2, 4, 5]} -> {"queue": [2, 4, 5], "status": "target_found"}
Therefore, the answer: {"distance": 1, "path": [1, 0]}
| Find the shortest path from 2 to 3 in the unweighted graph with 6 nodes and edges [[0, 1], [0, 4], [1, 2], [1, 3], [1, 4], [2, 4], [2, 5]] using BFS.
=> Step-by-step solution:
1. {"node": 2, "queue": []} -> {"new_neighbors": [1, 4, 5], "queue": [1, 4, 5]}
2. {"node": 1, "queue": [4, 5]} -> {"new_neighbors": [0, 3], "qu... | clrs_style | clrs_bfs | marin-community/synth-bootstrap-trial | clrs_style_clrs_bfs_5shot_icl | clrs_style:clrs_bfs:clrs_bfs_1073741824_000021 | arrow_5shot_icl_v1 | 5 | 1,073,741,824 | 21 |
End of preview. Expand in Data Studio
Synthetic reasoning arrow ICL PPL
Generated 2026-05-11T19:18:18.209773+00:00 from marin-community/synth-bootstrap-trial.
Each config contains 1000 validation rows with supervised input/target fields. The prompt format is arrow_5shot_icl_v1: five solved in-context examples rendered as problem\n=> answer, followed by the held-out problem ending at => . This avoids User:/Assistant: role labels for base-model perplexity comparisons while preserving target-only scoring.
- Downloads last month
- 2,240