May-apple commited on
Commit
bc1f8bd
·
verified ·
1 Parent(s): 32261e6

restructure: drop old Pure_Reasoning_unchanged/

Browse files
This view is limited to 50 files because it contains too many changes.   See raw diff
Files changed (50) hide show
  1. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00000/final_frame.png +0 -3
  2. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00000/first_frame.png +0 -3
  3. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00000/ground_truth.mp4 +0 -3
  4. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00000/metadata.json +0 -59
  5. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00000/prompt.txt +0 -1
  6. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00001/final_frame.png +0 -3
  7. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00001/first_frame.png +0 -3
  8. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00001/ground_truth.mp4 +0 -3
  9. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00001/metadata.json +0 -47
  10. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00001/prompt.txt +0 -1
  11. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00002/final_frame.png +0 -3
  12. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00002/first_frame.png +0 -3
  13. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00002/ground_truth.mp4 +0 -3
  14. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00002/metadata.json +0 -47
  15. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00002/prompt.txt +0 -1
  16. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00003/final_frame.png +0 -3
  17. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00003/first_frame.png +0 -3
  18. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00003/ground_truth.mp4 +0 -3
  19. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00003/metadata.json +0 -51
  20. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00003/prompt.txt +0 -1
  21. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00004/final_frame.png +0 -3
  22. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00004/first_frame.png +0 -3
  23. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00004/ground_truth.mp4 +0 -3
  24. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00004/metadata.json +0 -71
  25. Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00004/prompt.txt +0 -1
  26. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00000/final_frame.png +0 -3
  27. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00000/first_frame.png +0 -3
  28. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00000/ground_truth.mp4 +0 -3
  29. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00000/metadata.json +0 -28
  30. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00000/prompt.txt +0 -1
  31. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00001/final_frame.png +0 -3
  32. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00001/first_frame.png +0 -3
  33. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00001/ground_truth.mp4 +0 -3
  34. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00001/metadata.json +0 -28
  35. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00001/prompt.txt +0 -1
  36. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00002/final_frame.png +0 -3
  37. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00002/first_frame.png +0 -3
  38. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00002/ground_truth.mp4 +0 -3
  39. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00002/metadata.json +0 -28
  40. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00002/prompt.txt +0 -1
  41. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00003/final_frame.png +0 -3
  42. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00003/first_frame.png +0 -3
  43. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00003/ground_truth.mp4 +0 -3
  44. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00003/metadata.json +0 -28
  45. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00003/prompt.txt +0 -1
  46. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00004/final_frame.png +0 -3
  47. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00004/first_frame.png +0 -3
  48. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00004/ground_truth.mp4 +0 -3
  49. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00004/metadata.json +0 -28
  50. Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00004/prompt.txt +0 -1
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00000/final_frame.png DELETED

Git LFS Details

  • SHA256: 86be84f0cfac6dcaee84d92678ec506e8d2cb165268b2ced5fb4a0df7d179434
  • Pointer size: 131 Bytes
  • Size of remote file: 235 kB
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00000/first_frame.png DELETED

Git LFS Details

  • SHA256: 59ab678cb3cc06abf7e7dd2431dcc7dd668d71551e42550b68ac5b0e1e08182f
  • Pointer size: 131 Bytes
  • Size of remote file: 313 kB
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00000/ground_truth.mp4 DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:1d4500a96b34717ecd0ba9847e1c24ba3624b5bee06581dc7e738141c15be750
3
- size 367511
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00000/metadata.json DELETED
@@ -1,59 +0,0 @@
1
- {
2
- "task_id": "grid_avoid_obstacles_00000000",
3
- "generator": "grid_avoid_obstacles",
4
- "timestamp": "2026-05-01T09:32:19.595985",
5
- "parameters": {
6
- "start": [
7
- 1,
8
- 0
9
- ],
10
- "end": [
11
- 4,
12
- 3
13
- ],
14
- "obstacles": [
15
- [
16
- 0,
17
- 0
18
- ],
19
- [
20
- 1,
21
- 3
22
- ],
23
- [
24
- 2,
25
- 1
26
- ],
27
- [
28
- 3,
29
- 8
30
- ],
31
- [
32
- 8,
33
- 1
34
- ],
35
- [
36
- 8,
37
- 3
38
- ],
39
- [
40
- 9,
41
- 0
42
- ],
43
- [
44
- 9,
45
- 6
46
- ]
47
- ]
48
- },
49
- "param_hash": "06b6271b8567408c",
50
- "generation": {
51
- "seed": 42,
52
- "git": {
53
- "commit": "dc0dd8452098983cbb6d169416ccea262b977d18",
54
- "branch": "main",
55
- "repo": "https://github.com/VBVR-DataFactory/G-15_grid_avoid_obstacles_data-generator",
56
- "is_dirty": false
57
- }
58
- }
59
- }
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00000/prompt.txt DELETED
@@ -1 +0,0 @@
1
- The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a red end square, and multiple black X marks indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right) each step. The goal is to move the agent to the red end square along the shortest path without entering any cells marked with black X obstacles.
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00001/final_frame.png DELETED

Git LFS Details

  • SHA256: 8c51fdbedd705b34b3e23e6a2d8a1656edfc39d8d1e8b6ab30670e0e0d3c6cd7
  • Pointer size: 131 Bytes
  • Size of remote file: 235 kB
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00001/first_frame.png DELETED

Git LFS Details

  • SHA256: 3c3d410fd14a2dfd74e1c9a299eaa711eb0876c6b1e55c0f575723de84884c27
  • Pointer size: 131 Bytes
  • Size of remote file: 312 kB
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00001/ground_truth.mp4 DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:5b44ae7453f6eeed08e38797446747f2fe5b36e914b2963f751721a4a6741299
3
- size 368070
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00001/metadata.json DELETED
@@ -1,47 +0,0 @@
1
- {
2
- "task_id": "grid_avoid_obstacles_00000001",
3
- "generator": "grid_avoid_obstacles",
4
- "timestamp": "2026-05-01T09:32:20.551884",
5
- "parameters": {
6
- "start": [
7
- 3,
8
- 7
9
- ],
10
- "end": [
11
- 9,
12
- 4
13
- ],
14
- "obstacles": [
15
- [
16
- 1,
17
- 6
18
- ],
19
- [
20
- 2,
21
- 3
22
- ],
23
- [
24
- 2,
25
- 6
26
- ],
27
- [
28
- 5,
29
- 1
30
- ],
31
- [
32
- 5,
33
- 4
34
- ]
35
- ]
36
- },
37
- "param_hash": "a5ac7064160ec8e4",
38
- "generation": {
39
- "seed": 42,
40
- "git": {
41
- "commit": "dc0dd8452098983cbb6d169416ccea262b977d18",
42
- "branch": "main",
43
- "repo": "https://github.com/VBVR-DataFactory/G-15_grid_avoid_obstacles_data-generator",
44
- "is_dirty": false
45
- }
46
- }
47
- }
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00001/prompt.txt DELETED
@@ -1 +0,0 @@
1
- The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a red end square, and multiple black X marks indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right) each step. The goal is to move the agent to the red end square along the shortest path without entering any cells marked with black X obstacles.
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00002/final_frame.png DELETED

Git LFS Details

  • SHA256: 66d63a87c65592738c550e9628b929f842e2b87161c357fb6765eec198a3e000
  • Pointer size: 131 Bytes
  • Size of remote file: 248 kB
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00002/first_frame.png DELETED

Git LFS Details

  • SHA256: 6299fe614ae2374dbcc5c5ae49e585ec30b534ba0bc86f97e16d3ebc55cf2025
  • Pointer size: 131 Bytes
  • Size of remote file: 332 kB
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00002/ground_truth.mp4 DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:11dc0d89677b45a7039ed3f35e0559a8a047016504887a74118db0ca8da6f724
3
- size 285689
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00002/metadata.json DELETED
@@ -1,47 +0,0 @@
1
- {
2
- "task_id": "grid_avoid_obstacles_00000002",
3
- "generator": "grid_avoid_obstacles",
4
- "timestamp": "2026-05-01T09:32:20.982601",
5
- "parameters": {
6
- "start": [
7
- 5,
8
- 5
9
- ],
10
- "end": [
11
- 9,
12
- 4
13
- ],
14
- "obstacles": [
15
- [
16
- 1,
17
- 6
18
- ],
19
- [
20
- 1,
21
- 8
22
- ],
23
- [
24
- 4,
25
- 9
26
- ],
27
- [
28
- 5,
29
- 9
30
- ],
31
- [
32
- 7,
33
- 8
34
- ]
35
- ]
36
- },
37
- "param_hash": "80b8f07f95c0b977",
38
- "generation": {
39
- "seed": 42,
40
- "git": {
41
- "commit": "dc0dd8452098983cbb6d169416ccea262b977d18",
42
- "branch": "main",
43
- "repo": "https://github.com/VBVR-DataFactory/G-15_grid_avoid_obstacles_data-generator",
44
- "is_dirty": false
45
- }
46
- }
47
- }
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00002/prompt.txt DELETED
@@ -1 +0,0 @@
1
- The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a red end square, and multiple black X marks indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right) each step. The goal is to move the agent to the red end square along the shortest path without entering any cells marked with black X obstacles.
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00003/final_frame.png DELETED

Git LFS Details

  • SHA256: d5a520dd2a8909e72c3cc293b2e2c7189a89bdc71ae7f1a33e3db973c4e3701e
  • Pointer size: 131 Bytes
  • Size of remote file: 250 kB
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00003/first_frame.png DELETED

Git LFS Details

  • SHA256: a312ec1f0edf1801853bec138628ba91e5d2bf5346cee781326e80848e2f6317
  • Pointer size: 131 Bytes
  • Size of remote file: 335 kB
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00003/ground_truth.mp4 DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:121804cd40d3f91bfa47e3d57908bc989d86dbc347c265be1c5f3fb33bfda933
3
- size 501033
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00003/metadata.json DELETED
@@ -1,51 +0,0 @@
1
- {
2
- "task_id": "grid_avoid_obstacles_00000003",
3
- "generator": "grid_avoid_obstacles",
4
- "timestamp": "2026-05-01T09:32:21.500507",
5
- "parameters": {
6
- "start": [
7
- 1,
8
- 0
9
- ],
10
- "end": [
11
- 3,
12
- 4
13
- ],
14
- "obstacles": [
15
- [
16
- 2,
17
- 5
18
- ],
19
- [
20
- 3,
21
- 1
22
- ],
23
- [
24
- 4,
25
- 1
26
- ],
27
- [
28
- 5,
29
- 3
30
- ],
31
- [
32
- 6,
33
- 4
34
- ],
35
- [
36
- 7,
37
- 5
38
- ]
39
- ]
40
- },
41
- "param_hash": "e50deeca4cc08b84",
42
- "generation": {
43
- "seed": 42,
44
- "git": {
45
- "commit": "dc0dd8452098983cbb6d169416ccea262b977d18",
46
- "branch": "main",
47
- "repo": "https://github.com/VBVR-DataFactory/G-15_grid_avoid_obstacles_data-generator",
48
- "is_dirty": false
49
- }
50
- }
51
- }
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00003/prompt.txt DELETED
@@ -1 +0,0 @@
1
- The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a red end square, and multiple black X marks indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right) each step. The goal is to move the agent to the red end square along the shortest path without entering any cells marked with black X obstacles.
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00004/final_frame.png DELETED

Git LFS Details

  • SHA256: ec7335b4f719ce42da7cba31319dad276546e29846e675678fe223291c7b372f
  • Pointer size: 131 Bytes
  • Size of remote file: 243 kB
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00004/first_frame.png DELETED

Git LFS Details

  • SHA256: 3c0ce63557f482de951582b39e8f853fadc2082d5fab31c3f5058c13fe4e3827
  • Pointer size: 131 Bytes
  • Size of remote file: 323 kB
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00004/ground_truth.mp4 DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:ea7f0ecb09aa0f3bd6659865e8cd643cb09e8f14821f59d0315408af0dcacc0c
3
- size 391867
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00004/metadata.json DELETED
@@ -1,71 +0,0 @@
1
- {
2
- "task_id": "grid_avoid_obstacles_00000004",
3
- "generator": "grid_avoid_obstacles",
4
- "timestamp": "2026-05-01T09:32:22.090558",
5
- "parameters": {
6
- "start": [
7
- 8,
8
- 3
9
- ],
10
- "end": [
11
- 2,
12
- 7
13
- ],
14
- "obstacles": [
15
- [
16
- 0,
17
- 3
18
- ],
19
- [
20
- 0,
21
- 5
22
- ],
23
- [
24
- 1,
25
- 3
26
- ],
27
- [
28
- 2,
29
- 3
30
- ],
31
- [
32
- 2,
33
- 4
34
- ],
35
- [
36
- 3,
37
- 5
38
- ],
39
- [
40
- 3,
41
- 7
42
- ],
43
- [
44
- 4,
45
- 8
46
- ],
47
- [
48
- 6,
49
- 4
50
- ],
51
- [
52
- 6,
53
- 7
54
- ],
55
- [
56
- 9,
57
- 5
58
- ]
59
- ]
60
- },
61
- "param_hash": "c30ce2ae83178fdd",
62
- "generation": {
63
- "seed": 42,
64
- "git": {
65
- "commit": "dc0dd8452098983cbb6d169416ccea262b977d18",
66
- "branch": "main",
67
- "repo": "https://github.com/VBVR-DataFactory/G-15_grid_avoid_obstacles_data-generator",
68
- "is_dirty": false
69
- }
70
- }
71
- }
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-15_grid_avoid_obstacles_data-generator/00004/prompt.txt DELETED
@@ -1 +0,0 @@
1
- The scene shows a 10x10 grid with a blue start square (containing a yellow circular agent), a red end square, and multiple black X marks indicating obstacles. Starting from the blue start square, the agent can move to adjacent cells (up, down, left, right) each step. The goal is to move the agent to the red end square along the shortest path without entering any cells marked with black X obstacles.
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00000/final_frame.png DELETED

Git LFS Details

  • SHA256: bbc9febd75f8a36a077b04b12e6c22f5e5d83e4053cc9f6efcb0a5f1bac6c7f1
  • Pointer size: 131 Bytes
  • Size of remote file: 144 kB
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00000/first_frame.png DELETED

Git LFS Details

  • SHA256: 52c64a7c180e3197ccb3fcdee069fdc962fcff9b2e62dc516c370cb8172cb5b5
  • Pointer size: 131 Bytes
  • Size of remote file: 181 kB
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00000/ground_truth.mp4 DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:cb361fb23d86b7096ad3921ef37c737931e8dfb923efeda9dc2b60ebd1177498
3
- size 329270
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00000/metadata.json DELETED
@@ -1,28 +0,0 @@
1
- {
2
- "task_id": "grid_shortest_path_00000000",
3
- "generator": "grid_shortest_path",
4
- "timestamp": "2026-05-01T09:32:19.201133",
5
- "parameters": {
6
- "start": [
7
- 1,
8
- 0
9
- ],
10
- "end": [
11
- 4,
12
- 3
13
- ],
14
- "start_color": "#00FF00",
15
- "end_color": "#800080",
16
- "agent_color": "#FF0000"
17
- },
18
- "param_hash": "83cd25197541d96f",
19
- "generation": {
20
- "seed": 42,
21
- "git": {
22
- "commit": "84e28cadfc4c1421cdea1a65c0dd18df8fcbd295",
23
- "branch": "main",
24
- "repo": "https://github.com/VBVR-DataFactory/G-18_grid_shortest_path_data-generator",
25
- "is_dirty": false
26
- }
27
- }
28
- }
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00000/prompt.txt DELETED
@@ -1 +0,0 @@
1
- The scene shows a 10x10 grid with a green start square (containing a purple circular agent) and a pink end square. Starting from the green start square, the agent can move to adjacent cells (up, down, left, right) each step. The goal is to move the agent to the pink end square along the shortest path.
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00001/final_frame.png DELETED

Git LFS Details

  • SHA256: 9f5d5ee6e39b1fdf22f21d5154d6895c38c955cd852c686079fde06f61cba695
  • Pointer size: 131 Bytes
  • Size of remote file: 143 kB
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00001/first_frame.png DELETED

Git LFS Details

  • SHA256: 99a5f586a0e042fcf73ea12729dc688e00896ee621f6457e34044d28b8807bcf
  • Pointer size: 131 Bytes
  • Size of remote file: 179 kB
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00001/ground_truth.mp4 DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:643deffb0c7b12a778bbd696f9bbf340df55f678d59b8e341491d0733a7cd0f6
3
- size 235573
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00001/metadata.json DELETED
@@ -1,28 +0,0 @@
1
- {
2
- "task_id": "grid_shortest_path_00000001",
3
- "generator": "grid_shortest_path",
4
- "timestamp": "2026-05-01T09:32:20.486290",
5
- "parameters": {
6
- "start": [
7
- 9,
8
- 6
9
- ],
10
- "end": [
11
- 0,
12
- 0
13
- ],
14
- "start_color": "#FF0000",
15
- "end_color": "#00FF00",
16
- "agent_color": "#FF1493"
17
- },
18
- "param_hash": "89cb2ec8d537003b",
19
- "generation": {
20
- "seed": 42,
21
- "git": {
22
- "commit": "84e28cadfc4c1421cdea1a65c0dd18df8fcbd295",
23
- "branch": "main",
24
- "repo": "https://github.com/VBVR-DataFactory/G-18_grid_shortest_path_data-generator",
25
- "is_dirty": false
26
- }
27
- }
28
- }
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00001/prompt.txt DELETED
@@ -1 +0,0 @@
1
- The scene shows a 10x10 grid with a purple start square (containing a pink circular agent) and a red end square. Starting from the purple start square, the agent can move to adjacent cells (up, down, left, right) each step. The goal is to move the agent to the red end square along the shortest path.
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00002/final_frame.png DELETED

Git LFS Details

  • SHA256: 0c9d3a5e000e3484d09ce60d1d12ddb99aceaeb2c1188c9dda80989367c9a895
  • Pointer size: 131 Bytes
  • Size of remote file: 143 kB
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00002/first_frame.png DELETED

Git LFS Details

  • SHA256: 3b6b01ae4e9abc0f5c85dc3bfac184f5c82dd5772c00464ed7dab39ddbe4e90b
  • Pointer size: 131 Bytes
  • Size of remote file: 181 kB
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00002/ground_truth.mp4 DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:085b81c6485489d203b4637d939f7e13412371f787ddb1b7973f3c3ac2335d0b
3
- size 155798
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00002/metadata.json DELETED
@@ -1,28 +0,0 @@
1
- {
2
- "task_id": "grid_shortest_path_00000002",
3
- "generator": "grid_shortest_path",
4
- "timestamp": "2026-05-01T09:32:20.833280",
5
- "parameters": {
6
- "start": [
7
- 8,
8
- 3
9
- ],
10
- "end": [
11
- 8,
12
- 6
13
- ],
14
- "start_color": "#00FF00",
15
- "end_color": "#FF1493",
16
- "agent_color": "#FFA500"
17
- },
18
- "param_hash": "77c1017801ba51f6",
19
- "generation": {
20
- "seed": 42,
21
- "git": {
22
- "commit": "84e28cadfc4c1421cdea1a65c0dd18df8fcbd295",
23
- "branch": "main",
24
- "repo": "https://github.com/VBVR-DataFactory/G-18_grid_shortest_path_data-generator",
25
- "is_dirty": false
26
- }
27
- }
28
- }
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00002/prompt.txt DELETED
@@ -1 +0,0 @@
1
- The scene shows a 10x10 grid with a purple start square (containing a orange circular agent) and a blue end square. Starting from the purple start square, the agent can move to adjacent cells (up, down, left, right) each step. The goal is to move the agent to the blue end square along the shortest path.
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00003/final_frame.png DELETED

Git LFS Details

  • SHA256: fc0fd06bd29f3ac1c9cb8a76174a355991c0d6364b3edcf286cd2af79fd95d9c
  • Pointer size: 131 Bytes
  • Size of remote file: 143 kB
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00003/first_frame.png DELETED

Git LFS Details

  • SHA256: 094d5134bf2d426f17fc1c7e3e4759d3c400e993da299e9cca9c1bfa7972458f
  • Pointer size: 131 Bytes
  • Size of remote file: 180 kB
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00003/ground_truth.mp4 DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:7dadfd2b71af07d1ccd41e0c8ead52f1b8843c6c0a19699273b67af1f4cc2ef9
3
- size 237139
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00003/metadata.json DELETED
@@ -1,28 +0,0 @@
1
- {
2
- "task_id": "grid_shortest_path_00000003",
3
- "generator": "grid_shortest_path",
4
- "timestamp": "2026-05-01T09:32:21.360778",
5
- "parameters": {
6
- "start": [
7
- 0,
8
- 2
9
- ],
10
- "end": [
11
- 6,
12
- 5
13
- ],
14
- "start_color": "#0000FF",
15
- "end_color": "#00FF00",
16
- "agent_color": "#FF1493"
17
- },
18
- "param_hash": "73531b293c67ddf0",
19
- "generation": {
20
- "seed": 42,
21
- "git": {
22
- "commit": "84e28cadfc4c1421cdea1a65c0dd18df8fcbd295",
23
- "branch": "main",
24
- "repo": "https://github.com/VBVR-DataFactory/G-18_grid_shortest_path_data-generator",
25
- "is_dirty": false
26
- }
27
- }
28
- }
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00003/prompt.txt DELETED
@@ -1 +0,0 @@
1
- The scene shows a 10x10 grid with a red start square (containing a purple circular agent) and a blue end square. Starting from the red start square, the agent can move to adjacent cells (up, down, left, right) each step. The goal is to move the agent to the blue end square along the shortest path.
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00004/final_frame.png DELETED

Git LFS Details

  • SHA256: 9837f09e6af4bc69a64d585c86e79e8212f7826c463d93e4f550a5efbd3a5c5c
  • Pointer size: 131 Bytes
  • Size of remote file: 142 kB
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00004/first_frame.png DELETED

Git LFS Details

  • SHA256: 7431715c1b44f753b2ba6dcdaf5fde26dd27c3e74e6d70de99315404d1ad2ff2
  • Pointer size: 131 Bytes
  • Size of remote file: 180 kB
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00004/ground_truth.mp4 DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:eb311f0f38a380688201f52ba1e8b617b1fb4a13065b2848e585ae57386a23ee
3
- size 156886
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00004/metadata.json DELETED
@@ -1,28 +0,0 @@
1
- {
2
- "task_id": "grid_shortest_path_00000004",
3
- "generator": "grid_shortest_path",
4
- "timestamp": "2026-05-01T09:32:21.747921",
5
- "parameters": {
6
- "start": [
7
- 1,
8
- 1
9
- ],
10
- "end": [
11
- 6,
12
- 1
13
- ],
14
- "start_color": "#0000FF",
15
- "end_color": "#FFA500",
16
- "agent_color": "#FF1493"
17
- },
18
- "param_hash": "12510b5ea96cfdc5",
19
- "generation": {
20
- "seed": 42,
21
- "git": {
22
- "commit": "84e28cadfc4c1421cdea1a65c0dd18df8fcbd295",
23
- "branch": "main",
24
- "repo": "https://github.com/VBVR-DataFactory/G-18_grid_shortest_path_data-generator",
25
- "is_dirty": false
26
- }
27
- }
28
- }
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Pure_Reasoning_unchanged/In-Domain_50/G-18_grid_shortest_path_data-generator/00004/prompt.txt DELETED
@@ -1 +0,0 @@
1
- The scene shows a 10x10 grid with a yellow start square (containing a pink circular agent) and a blue end square. Starting from the yellow start square, the agent can move to adjacent cells (up, down, left, right) each step. The goal is to move the agent to the blue end square along the shortest path.