Dataset Viewer
Auto-converted to Parquet Duplicate
episode_id
int64
0
532
frame_start
int64
0
34.5k
frame_end
int64
4
35.2k
task_index
int64
0
7
verdict
stringclasses
4 values
failure_category
stringclasses
7 values
reviewer
stringclasses
1 value
reviewed_at
stringdate
2026-07-19 22:17:48+0900
2026-08-01 15:56:23+0900
schema_version
int64
4
4
0
0
77
1
optimal
null
hara
2026-07-19T22:17:48+09:00
4
0
78
431
4
optimal
null
hara
2026-07-19T22:18:00+09:00
4
0
432
4,234
0
failure
fail_insert
hara
2026-07-19T22:18:36+09:00
4
0
4,235
4,792
0
success
null
hara
2026-07-19T22:19:00+09:00
4
0
4,793
6,028
3
optimal
null
hara
2026-07-19T22:20:37+09:00
4
0
6,029
6,113
3
failure
lazy_buffer
hara
2026-07-19T22:21:13+09:00
4
0
6,114
6,371
5
optimal
null
hara
2026-07-19T22:21:23+09:00
4
0
6,372
6,653
4
optimal
null
hara
2026-07-19T22:21:34+09:00
4
0
6,654
6,843
0
optimal
null
hara
2026-07-19T22:21:42+09:00
4
0
6,844
8,602
3
optimal
null
hara
2026-07-19T22:22:16+09:00
4
0
8,603
8,664
5
optimal
null
hara
2026-07-19T22:22:47+09:00
4
0
8,665
8,705
5
failure
lazy_buffer
hara
2026-07-19T22:22:51+09:00
4
0
8,706
8,768
1
failure
lazy_buffer
hara
2026-07-19T22:22:58+09:00
4
0
8,769
9,159
4
optimal
null
hara
2026-07-19T22:24:26+09:00
4
0
9,160
9,583
0
optimal
null
hara
2026-07-19T22:25:37+09:00
4
0
9,584
12,385
0
failure
fail_insert
hara
2026-07-19T22:26:22+09:00
4
0
12,386
13,988
3
optimal
null
hara
2026-07-19T22:27:25+09:00
4
0
13,989
14,346
4
optimal
null
hara
2026-07-19T22:27:42+09:00
4
0
14,347
14,503
1
failure
lazy_buffer
hara
2026-07-19T22:27:52+09:00
4
0
14,504
14,702
5
ambiguous
null
hara
2026-07-19T22:28:21+09:00
4
0
14,703
21,770
0
failure
fail_insert
hara
2026-07-19T22:30:06+09:00
4
0
21,771
22,064
0
optimal
null
hara
2026-07-19T22:30:24+09:00
4
0
22,065
23,403
3
optimal
null
hara
2026-07-19T22:30:57+09:00
4
0
23,404
23,624
3
failure
lazy_buffer
hara
2026-07-19T22:31:28+09:00
4
0
23,625
24,493
2
optimal
null
hara
2026-07-19T22:31:45+09:00
4
1
0
135
1
optimal
null
hara
2026-07-19T22:40:11+09:00
4
1
136
463
4
optimal
null
hara
2026-07-19T22:40:25+09:00
4
1
464
5,838
0
failure
fail_insert
hara
2026-07-19T22:46:13+09:00
4
1
5,839
6,344
0
success
null
hara
2026-07-19T22:49:15+09:00
4
1
6,345
7,722
3
optimal
null
hara
2026-07-19T22:50:14+09:00
4
1
7,723
7,821
5
ambiguous
null
hara
2026-07-19T22:53:46+09:00
4
1
7,822
8,169
4
optimal
null
hara
2026-07-19T22:54:13+09:00
4
1
8,170
19,494
0
failure
fail_insert
hara
2026-07-19T22:58:14+09:00
4
1
19,495
19,780
0
optimal
null
hara
2026-07-19T23:00:14+09:00
4
1
19,781
21,236
3
optimal
null
hara
2026-07-19T23:00:45+09:00
4
1
21,237
21,395
5
ambiguous
null
hara
2026-07-19T23:01:01+09:00
4
1
21,396
21,468
1
failure
lazy_buffer
hara
2026-07-19T23:01:06+09:00
4
1
21,469
21,807
4
optimal
null
hara
2026-07-19T23:01:23+09:00
4
1
21,808
21,906
1
failure
lazy_buffer
hara
2026-07-19T23:01:47+09:00
4
1
21,907
22,118
0
optimal
null
hara
2026-07-19T23:05:17+09:00
4
1
22,119
24,186
0
failure
fail_insert
hara
2026-07-19T23:05:09+09:00
4
1
24,187
24,641
0
success
null
hara
2026-07-19T23:05:22+09:00
4
1
24,642
26,094
3
optimal
null
hara
2026-07-19T23:05:30+09:00
4
1
26,095
26,548
5
failure
unknown
hara
2026-07-19T23:07:11+09:00
4
1
26,549
26,696
1
failure
lazy_buffer
hara
2026-07-19T23:07:19+09:00
4
1
26,697
26,985
4
optimal
null
hara
2026-07-19T23:07:31+09:00
4
1
26,986
27,259
1
failure
lazy_buffer
hara
2026-07-19T23:07:38+09:00
4
1
27,260
27,453
0
optimal
null
hara
2026-07-19T23:08:52+09:00
4
1
27,454
27,828
1
failure
lazy_buffer
hara
2026-07-19T23:08:12+09:00
4
1
27,829
28,021
0
optimal
null
hara
2026-07-19T23:08:46+09:00
4
1
28,022
33,063
0
failure
lazy_buffer
hara
2026-07-19T23:12:01+09:00
4
1
33,064
34,532
3
optimal
null
hara
2026-07-19T23:12:44+09:00
4
1
34,533
35,166
2
failure
side_flip
hara
2026-07-22T15:54:07+09:00
4
2
0
118
6
failure
lazy_buffer
hara
2026-07-20T13:21:05+09:00
4
2
119
172
1
optimal
null
hara
2026-07-20T13:21:11+09:00
4
2
173
344
5
ambiguous
null
hara
2026-07-20T13:21:56+09:00
4
2
345
758
4
optimal
null
hara
2026-07-20T13:22:33+09:00
4
2
759
1,022
4
failure
lazy_buffer
hara
2026-07-20T13:22:37+09:00
4
2
1,023
1,352
0
failure
fail_insert
hara
2026-07-20T13:26:53+09:00
4
2
1,353
1,802
0
success
null
hara
2026-07-20T13:26:59+09:00
4
2
1,803
3,025
3
optimal
null
hara
2026-07-20T13:28:13+09:00
4
2
3,026
3,101
5
ambiguous
null
hara
2026-07-20T13:32:10+09:00
4
2
3,102
3,488
4
optimal
null
hara
2026-07-20T13:32:55+09:00
4
2
3,489
8,677
0
failure
fail_insert
hara
2026-07-20T13:37:33+09:00
4
2
8,678
8,943
0
optimal
null
hara
2026-07-20T13:37:41+09:00
4
2
8,944
10,013
3
optimal
null
hara
2026-07-20T13:38:23+09:00
4
2
10,014
10,162
5
optimal
null
hara
2026-07-20T13:38:51+09:00
4
2
10,163
10,475
4
optimal
null
hara
2026-07-20T13:39:26+09:00
4
2
10,476
10,614
0
success
null
hara
2026-07-20T13:41:57+09:00
4
2
10,615
12,439
0
failure
lazy_buffer
hara
2026-07-20T13:41:43+09:00
4
2
12,440
12,688
0
success
null
hara
2026-07-20T13:41:59+09:00
4
2
12,689
13,674
3
optimal
null
hara
2026-07-20T13:45:43+09:00
4
2
13,675
13,767
3
optimal
null
hara
2026-07-20T13:45:55+09:00
4
2
13,768
14,102
4
optimal
null
hara
2026-07-20T13:46:17+09:00
4
2
14,103
14,226
0
success
null
hara
2026-07-20T13:48:16+09:00
4
2
14,227
16,807
0
failure
fail_insert
hara
2026-07-20T13:47:36+09:00
4
2
16,808
17,202
0
success
null
hara
2026-07-20T13:48:18+09:00
4
2
17,203
18,675
3
optimal
null
hara
2026-07-20T13:49:01+09:00
4
2
18,676
19,249
2
failure
side_flip
hara
2026-07-22T15:54:38+09:00
4
3
0
130
1
optimal
null
hara
2026-07-20T14:13:46+09:00
4
3
131
277
7
optimal
null
hara
2026-07-20T14:14:37+09:00
4
3
278
604
4
optimal
null
hara
2026-07-20T14:15:24+09:00
4
3
605
671
4
failure
lazy_buffer
hara
2026-07-20T14:15:30+09:00
4
3
672
1,536
0
failure
fail_insert
hara
2026-07-20T14:16:23+09:00
4
3
1,537
2,113
0
optimal
null
hara
2026-07-20T14:16:26+09:00
4
3
2,114
3,206
3
success
null
hara
2026-07-20T14:17:05+09:00
4
3
3,207
3,476
5
success
null
hara
2026-07-20T14:17:47+09:00
4
3
3,477
3,835
4
optimal
null
hara
2026-07-20T14:18:08+09:00
4
3
3,836
4,001
4
success
null
hara
2026-07-20T14:19:00+09:00
4
3
4,002
5,011
4
failure
fail_insert
hara
2026-07-20T14:19:29+09:00
4
3
5,012
5,353
0
success
null
hara
2026-07-20T14:21:01+09:00
4
3
5,354
6,516
3
optimal
null
hara
2026-07-20T14:20:32+09:00
4
3
6,517
6,876
5
optimal
null
hara
2026-07-20T14:22:17+09:00
4
3
6,877
7,331
4
optimal
null
hara
2026-07-20T14:22:46+09:00
4
3
7,332
7,852
0
optimal
null
hara
2026-07-20T14:22:55+09:00
4
3
7,853
8,944
3
optimal
null
hara
2026-07-20T14:23:06+09:00
4
3
8,945
9,222
5
optimal
null
hara
2026-07-20T14:23:16+09:00
4
3
9,223
9,579
4
optimal
null
hara
2026-07-20T14:24:51+09:00
4
3
9,580
9,687
4
failure
lazy_buffer
hara
2026-07-20T14:25:13+09:00
4
3
9,688
10,452
4
optimal
null
hara
2026-07-20T14:25:57+09:00
4
End of preview. Expand in Data Studio

RAMEN G1 IKEA Assembly — segment curation labels

Per-segment quality labels for all 533 episodes of BitRobot/G1_WBT_Dex1_Building-Children-Table (revision 4b5961c6f8b97ececa75ee73041b30bcbf463ae2), made by Team RAMEN for the IROS 2026 Humanoid IKEA Assembly Challenge (Unitree G1 + Dex1-1 assembling a children's table).

Each label marks a frame range of one episode, says which skill the robot performs there, and grades how well it is done. We used the labels to cut the episodes into clean per-skill training sets. This repository holds labels only, no images or robot data.

Files

file content
labels.parquet The final labels: 15,928 segments, one row each
labels.jsonl The edit log behind them (16,958 lines). A later line with the same key replaces an earlier one; a line with "__delete__": true removes the segment. Folding the log this way gives exactly labels.parquet
failure_categories.json The failure categories (keys and their original Japanese labels)

Columns

The key of a segment is (episode_id, frame_start).

column content
episode_id Episode index in the BitRobot dataset (0–532)
frame_start, frame_end Frame indices within the episode at 30 fps; both ends included
task_index Skill, using the BitRobot dataset's task indices (below)
verdict optimal, success, ambiguous or failure (below)
failure_category For failure only (below); empty otherwise
reviewer Who labelled it (one reviewer for all segments)
reviewed_at When it was labelled (ISO 8601, 2026-07-19 to 2026-08-01)
schema_version 4

Skills and verdicts

task_index BitRobot task optimal success ambiguous failure
0 insert table leg to table base 1,664 466 576 725
1 move to table 452 53 108 898
2 flip table 5 945 26 218
3 rotate leg to tighten 439 291 1,331 1,726
4 pick table leg 786 433 1,083 220
5 rotate table base 1,430 61 81 1,390
6 building children table 0 0 2 36
7 move table base 387 34 28 34
total 5,163 2,283 3,235 5,247
  • optimal: the skill is done cleanly.
  • success: the skill is done, but not cleanly (for example it needed two adjustments, or the result is slightly off).
  • ambiguous: hard to judge.
  • failure: the skill fails or the segment is unusable.

Failure categories (failure segments only):

key original label meaning segments
unknown フレーム落ちかつありえない変な行動 dropped frames together with implausible, odd motion 4,133
fail_insert 挿入失敗 the insertion fails 616
hold_stack 固まった the robot freezes 322
lazy_buffer いらない行動 unnecessary motion 125
side_flip 横型のまま回す the table is turned while still on its side 25
fail_env 環境が違う a different setup 22
slip 滑り落ち the part slips out of the hand 4

How we used it

We built one training set per skill from these labels with data/bitrobot_lerobot_subtask_datasets/scripts/build_curated_task_dataset.py in the code repository:

skill (task_index) segments used episodes dataset
insert_table_leg (0) optimal 1,664 ramen-g1-ikea-assembly-ramen-ori-insert-table-leg
flip_table (2) success, only the last one in each episode (earlier ones are practice or a turn of the table) 429 ramen-g1-ikea-assembly-ramen-ori-flip-table
rotate_leg_to_tighten (3) success (tight enough without over-tightening, and short) 290 ramen-g1-ikea-assembly-ramen-ori-rotate-leg-to-tighten
pick_table_leg (4) optimal 786 ramen-g1-ikea-assembly-ramen-ori-pick-table-leg
rotate_table_base (5) optimal, only after the first pick (or the first insert / tighten when there is no pick) 1,401 ramen-g1-ikea-assembly-ramen-ori-rotate-table-base
move_table_base (7) optimal, only before the first pick 384 ramen-g1-ikea-assembly-ramen-ori-move-table-base

Each segment becomes one episode of the training set. Where the counts are a little lower than in the table above, the order and overlap filters (see Known issues) dropped segments. We did not use move to table (1; the robot walks with the SDK instead) or building children table (6).

Known issues

  • One reviewer. All labels come from one person watching the videos; the verdicts are a judgement call.
  • A few overlapping segments. Sometimes an old label was not deleted after a correction, so two segments of the same episode overlap. Our build script keeps the one with the later reviewed_at.
  • move table base (7) and rotate table base (5) can be mixed up. The two motions look alike and differ mainly in when they happen (before or after the legs are picked). Our build script filters them by that order.

License and attribution

These labels are released under CC BY 4.0. They describe episodes of BitRobot/G1_WBT_Dex1_Building-Children-Table by BitRobot, licensed under CC BY 4.0; the skill names in task_index are that dataset's task names.

Downloads last month
60

Collection including Team-RAMEN/ramen-g1-ikea-assembly-curation