Upload folder using huggingface_hub (part 4)

vbvr-bench-10tasks/metadata/O-23_domino_chain_branch_path_prediction_data-generator__00049.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220408,
+  "generator_commit": "09c31bdeb26a724767883e600f0864033e9bd42d",
+  "output": {
+    "duration": 3.866667,
+    "fps": 15.0,
+    "frames": 58,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-23_domino_chain_branch_path_prediction_data-generator__00049/0.mp4",
+  "output_video_sha256": "3bb457af0a39e504842e38cfde45a3d0ec61d715efa1384186ad73984c3d16ae",
+  "param_hash": null,
+  "prompt": "Start the chain reaction. The dominos will propagate and branch, but a gap in one path will prevent some dominos from falling. Show the final state with fallen and standing dominos clearly marked.",
+  "sample_id": "00049",
+  "source": "generated",
+  "source_uid": "O-23_domino_chain_branch_path_prediction/candidate_008",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-23_domino_chain_branch_path_prediction/candidate_008/ground_truth.mp4",
+  "task": "O-23_domino_chain_branch_path_prediction_data-generator",
+  "task_prefix": "O-23"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00000.json

@@ -0,0 +1,18 @@
+{
+  "output": {
+    "duration": 8.9,
+    "fps": 10.0,
+    "frames": 89,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00000/0.mp4",
+  "output_video_sha256": "c326957024c14ce6c5c3c3bacd2c4b9dd23f26ef4a72657312fdfecaf20b504d",
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00000",
+  "source": "official",
+  "source_uid": "official/O-31_ball_eating_data-generator__00000",
+  "source_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2/video/O-31_ball_eating_data-generator__00000/0.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00001.json

@@ -0,0 +1,18 @@
+{
+  "output": {
+    "duration": 8.9,
+    "fps": 10.0,
+    "frames": 89,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00001/0.mp4",
+  "output_video_sha256": "7e9e4e7ba1ab949b0ea412d798fa50acf034f1da1e8c39bbb99cfc36669ef9c5",
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00001",
+  "source": "official",
+  "source_uid": "official/O-31_ball_eating_data-generator__00001",
+  "source_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2/video/O-31_ball_eating_data-generator__00001/0.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00002.json

@@ -0,0 +1,18 @@
+{
+  "output": {
+    "duration": 9.8,
+    "fps": 10.0,
+    "frames": 98,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00002/0.mp4",
+  "output_video_sha256": "8e2d8cbbfacd57d7fe5573735188c8885d84efd360a1f5e5f631fb54b79d58ad",
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00002",
+  "source": "official",
+  "source_uid": "official/O-31_ball_eating_data-generator__00002",
+  "source_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2/video/O-31_ball_eating_data-generator__00002/0.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00003.json

@@ -0,0 +1,18 @@
+{
+  "output": {
+    "duration": 9.2,
+    "fps": 10.0,
+    "frames": 92,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00003/0.mp4",
+  "output_video_sha256": "857b56114fe38331dfbb99df5114704ae8f10210ffa1a4c9a83299b8bd4807dd",
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00003",
+  "source": "official",
+  "source_uid": "official/O-31_ball_eating_data-generator__00003",
+  "source_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2/video/O-31_ball_eating_data-generator__00003/0.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00004.json

@@ -0,0 +1,18 @@
+{
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00004/0.mp4",
+  "output_video_sha256": "a83a4bcd25bc67e41ed6cd70141c4b973fe92d091c71dc6ccdd5ba2010f287e4",
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00004",
+  "source": "official",
+  "source_uid": "official/O-31_ball_eating_data-generator__00004",
+  "source_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2/video/O-31_ball_eating_data-generator__00004/0.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00005.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220509,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.2,
+    "fps": 10.0,
+    "frames": 92,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00005/0.mp4",
+  "output_video_sha256": "5895952fa23399f1f6251acd20414b4dbcc8683133b329e16fcbd6ab237225d5",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00005",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_009",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_009/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00006.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220524,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.2,
+    "fps": 10.0,
+    "frames": 92,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00006/0.mp4",
+  "output_video_sha256": "a84ba3baaa9079c6df93fb2e1e01a0244e95abf1e8ae63a43903782ac1aaddaa",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00006",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_024",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_024/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00007.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220545,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00007/0.mp4",
+  "output_video_sha256": "77f4acdc5786fd082e13f6e336762af71c30f7c9174532ddf652d0ab09d81ce1",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00007",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_045",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_045/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00008.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220552,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00008/0.mp4",
+  "output_video_sha256": "dc163f1c4573e5b30413b9598363b8eab02854cc6dd7968e81fd1b033254d00c",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00008",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_052",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_052/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00009.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220526,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.8,
+    "fps": 10.0,
+    "frames": 98,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00009/0.mp4",
+  "output_video_sha256": "f5eeba6994cbb5ce3a59e87c2b360a366d70bf9293b0bf1447aecbe1ac9f0fec",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00009",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_026",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_026/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00010.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220506,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00010/0.mp4",
+  "output_video_sha256": "af709b57c9fdc58ac24e33e8794be164a0a6209b70ee4afc0401424b54fd9ccf",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00010",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_006",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_006/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00011.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220520,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00011/0.mp4",
+  "output_video_sha256": "e8a365cbbbe4090b4debc0531e2ab7bea535f8ba3ee9772990281865e117c580",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00011",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_020",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_020/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00012.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220525,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 8.9,
+    "fps": 10.0,
+    "frames": 89,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00012/0.mp4",
+  "output_video_sha256": "60a768ce23f574033bbb73449423bf0a8e6ef5cab76f2dc924975cfa7ccb0b10",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00012",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_025",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_025/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00013.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220503,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00013/0.mp4",
+  "output_video_sha256": "757e171cb92f105bc4821db20335eadf6dd8a65a69795c6da7830f63b10cb58c",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00013",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_003",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_003/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00014.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220537,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00014/0.mp4",
+  "output_video_sha256": "5efa3d1199082e3754fd597e3dd8a204718f03c6372aef4477c1619b7367683a",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00014",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_037",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_037/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00015.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220522,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00015/0.mp4",
+  "output_video_sha256": "5a801578d39c52a1345967adcd9af8d6ea415ea479e1d227cd04447afa94a69a",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00015",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_022",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_022/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00016.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220504,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00016/0.mp4",
+  "output_video_sha256": "69be940d13589084ae136703590dc991aba14ab80c031b4be5b54ff78ad57b43",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00016",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_004",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_004/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00017.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220549,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00017/0.mp4",
+  "output_video_sha256": "32a53b767982ff93cdea43167fd93061d339a2eb456cd0156d01e53739b348a2",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00017",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_049",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_049/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00018.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220513,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.2,
+    "fps": 10.0,
+    "frames": 92,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00018/0.mp4",
+  "output_video_sha256": "a6833139203c34ff4fd02f5b672f17bc8198ddb0ebbddf2b44f0cee830bdea54",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00018",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_013",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_013/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00019.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220501,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00019/0.mp4",
+  "output_video_sha256": "92b3ec8c90ac12e6d51cc7669572e25e9180bb798247af01c043de7ae7634e46",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00019",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_001",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_001/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00020.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220510,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 8.9,
+    "fps": 10.0,
+    "frames": 89,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00020/0.mp4",
+  "output_video_sha256": "fd158426b87e62557bfe62520c2280083673413e1571299c6f89c65983d0e7c8",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00020",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_010",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_010/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00021.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220551,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.2,
+    "fps": 10.0,
+    "frames": 92,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00021/0.mp4",
+  "output_video_sha256": "fa35ac2a500bac416a590538bbe0d4b0026a6f4d1e279c73e0201752873c26a6",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00021",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_051",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_051/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00022.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220511,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00022/0.mp4",
+  "output_video_sha256": "6a2f4be1ba9ea325c3af257bda828f762e20d1b6ba143bd350c5cfb8ee2393a9",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00022",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_011",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_011/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00023.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220548,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00023/0.mp4",
+  "output_video_sha256": "a35fc0ac11da5e5c0b7803fbf5ad530ccf688524cfee030707df2e134621bf75",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00023",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_048",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_048/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00024.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220546,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00024/0.mp4",
+  "output_video_sha256": "0aeaed041be2b2a9bde5d307a6a12f92dae3f9ef09312b203f49912a36cf80df",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00024",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_046",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_046/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00025.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220539,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.8,
+    "fps": 10.0,
+    "frames": 98,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00025/0.mp4",
+  "output_video_sha256": "6263482c774eab507bcc37571cf973e6f35b2010d906c998f735db433e264e94",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00025",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_039",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_039/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00026.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220534,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.2,
+    "fps": 10.0,
+    "frames": 92,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00026/0.mp4",
+  "output_video_sha256": "4d8326bb5c9a61dcfd2c773650f0074a63d0731b2bfe49069339d97fde4d4824",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00026",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_034",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_034/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00027.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220538,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00027/0.mp4",
+  "output_video_sha256": "7e526db88cdbad376d1914933ffe13871578f1a5c6c6a65dd4681279e5b0162d",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00027",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_038",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_038/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00028.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220550,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00028/0.mp4",
+  "output_video_sha256": "aff1c4ee5e9ccab7cea1298c3296ca95fa96941461c7ba9d3fccf46981ae161c",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00028",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_050",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_050/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00029.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220554,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 8.9,
+    "fps": 10.0,
+    "frames": 89,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00029/0.mp4",
+  "output_video_sha256": "b98000b10f0f01b34ad364bf300960b4138f06dca12b6aa0fa62ccfe91009f68",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00029",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_054",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_054/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00030.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220512,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00030/0.mp4",
+  "output_video_sha256": "4780464ce9db55167e49c69a7401f271a8806e2fbae21a5813bce3576314b892",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00030",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_012",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_012/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00031.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220514,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00031/0.mp4",
+  "output_video_sha256": "3f475aa4c9f5e0d9a0fc89d80e0535589b46c91b3804281b0c983ace0eb20d48",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00031",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_014",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_014/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00032.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220518,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00032/0.mp4",
+  "output_video_sha256": "fce7cf6f2d7456e6ac03713d6fd9eea852db45880ae5ce3c066f0d165a2f1984",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00032",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_018",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_018/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00033.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220544,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 8.9,
+    "fps": 10.0,
+    "frames": 89,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00033/0.mp4",
+  "output_video_sha256": "dafa58a6292a76c956e5fc363ca6a553d37b4eed7682b6d71695d71fbe4f8b39",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00033",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_044",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_044/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00034.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220516,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00034/0.mp4",
+  "output_video_sha256": "3caec067a5f1a7113ec0d0cee9824fcd204c84fe965ba715e5f6b8b8f8a22090",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00034",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_016",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_016/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00035.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220502,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.2,
+    "fps": 10.0,
+    "frames": 92,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00035/0.mp4",
+  "output_video_sha256": "d766b9c2eb76ba80707565f1107c694a7592d38c701211542dd016da0170cfad",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00035",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_002",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_002/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00036.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220543,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 8.9,
+    "fps": 10.0,
+    "frames": 89,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00036/0.mp4",
+  "output_video_sha256": "fd56a7bf03884cf4753bc671baa633daf101b0f993eb5ed37483b11b1671d64b",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00036",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_043",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_043/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00037.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220508,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00037/0.mp4",
+  "output_video_sha256": "dcae1b24df78b302e711851137479584380ecb1fe70ce5c45995744e30b9c18d",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00037",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_008",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_008/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00038.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220536,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.2,
+    "fps": 10.0,
+    "frames": 92,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00038/0.mp4",
+  "output_video_sha256": "da08a91a2b355874aa87b5f4dd3af8b573ca12c830508d18f9e2cc085497b2b0",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00038",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_036",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_036/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00039.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220553,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.2,
+    "fps": 10.0,
+    "frames": 92,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00039/0.mp4",
+  "output_video_sha256": "6cf3153ff4d0abb4a2bda61afe0b541bc1a7c433961a93d04a40643837f6c68c",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00039",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_053",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_053/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00040.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220541,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00040/0.mp4",
+  "output_video_sha256": "1afbfee4e124bdfba154c861a7de307bc015f99777c93a12a97f5af51de99726",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00040",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_041",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_041/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00041.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220547,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 8.9,
+    "fps": 10.0,
+    "frames": 89,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00041/0.mp4",
+  "output_video_sha256": "4bfda1a56153af747af48fdb2eb6562aa772222e69edabb92f47d55c412bfc1f",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00041",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_047",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_047/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00042.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220505,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.8,
+    "fps": 10.0,
+    "frames": 98,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00042/0.mp4",
+  "output_video_sha256": "d0781529274501febbb1b60c4e55a2749994d2cefbf2963ba0f113c1dc43224b",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00042",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_005",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_005/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00043.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220542,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00043/0.mp4",
+  "output_video_sha256": "6e1afbdd1c5f396f0b92c6d7d30d14214bb5aea7d3f2ed4e622d63220aafe61b",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00043",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_042",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_042/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00044.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220530,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 8.9,
+    "fps": 10.0,
+    "frames": 89,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00044/0.mp4",
+  "output_video_sha256": "8563b0ef196b1de535c66a2a3a10d79d1912292627222ae25b60ea190df8727e",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00044",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_030",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_030/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00045.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220519,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.8,
+    "fps": 10.0,
+    "frames": 98,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00045/0.mp4",
+  "output_video_sha256": "6a1c284b3033161abb7e86bd87c88062bb7a2bf736a9130f1a47ddbaa646a0ef",
+  "param_hash": null,
+  "prompt": "Demonstrate the black ball systematically eating all red balls using a greedy largest-first algorithm. The black ball must always choose the largest red ball that is no larger than itself. Each time a red ball is eaten, it disappears and the black ball grows by a multiplicative factor. Animate the black ball moving smoothly to each target, consuming it, and growing. The sequence continues until all red balls are gone.",
+  "sample_id": "00045",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_019",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_019/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00046.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220521,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 7.8,
+    "fps": 10.0,
+    "frames": 78,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00046/0.mp4",
+  "output_video_sha256": "291462d3f814d5ffce56e35af746674060c022c17240f889cafb429da0ac5712",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00046",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_021",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_021/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00047.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220533,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 8.9,
+    "fps": 10.0,
+    "frames": 89,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00047/0.mp4",
+  "output_video_sha256": "e7f3273296787ad3472fbc5063f3e91d2dbf3a365e4d48513c496e41c2e311e2",
+  "param_hash": null,
+  "prompt": "Animate the black ball using a greedy largest-first strategy to eat all red balls. At each step, the black ball targets the largest red ball that is smaller than or equal to its current size. After eating each red ball, the black ball grows larger (1.4x). Show smooth movement as the black ball approaches each target, the red ball disappearing when eaten, and the black ball growing after each consumption. Continue until all red balls are eaten.",
+  "sample_id": "00047",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_033",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_033/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}

vbvr-bench-10tasks/metadata/O-31_ball_eating_data-generator__00048.json

@@ -0,0 +1,21 @@
+{
+  "generation_seed": 260220517,
+  "generator_commit": "d537e20e873025ef3dfe63ccdeadbfe5cae38a2f",
+  "output": {
+    "duration": 9.6,
+    "fps": 10.0,
+    "frames": 96,
+    "height": 512,
+    "width": 512
+  },
+  "output_video": "/data/sheng/linghui/ar-video-reasoning/vbvr-bench-10tasks2-50/video/O-31_ball_eating_data-generator__00048/0.mp4",
+  "output_video_sha256": "b4195b8841406473011bcd978d24db4dd387320e4c3ee2c6b421fb8fb6e79a58",
+  "param_hash": null,
+  "prompt": "Show the black ball eating all red balls in a greedy largest-first sequence. At each step, select the largest available red ball that is smaller than or equal to the current black ball size. Animate the black ball moving to each target, the red ball vanishing when eaten, and the black ball increasing in size. Continue until all red balls are consumed using this optimal strategy.",
+  "sample_id": "00048",
+  "source": "generated",
+  "source_uid": "O-31_ball_eating/candidate_017",
+  "source_video": "/data/sheng/linghui/vbvr-bench-10tasks2-candidates/O-31_ball_eating/candidate_017/ground_truth.mp4",
+  "task": "O-31_ball_eating_data-generator",
+  "task_prefix": "O-31"
+}