<transcript><audio_58>different way so it's it can be hybrid between newest to oldest uh and oldest to newest but the newest copy is always going to be in the main table through which you start the access and that's the main point A2 is the newest one but you can</transcript><transcript><audio_59>imagine a weird scheme in which A2 is in the main table but that points to something else that you know if the chain will become A1 A2 A3 and A3 in the main table you could say yeah A3 points to A1 from the main table to the time travel table you can come up with</transcript><transcript><audio_60>schemes like that to be not purely newest to oldest but if you had to say which one it sort of makes more sense it's like the main table has a newest stuff right which is where you're starting your access from so you can do all kinds of fiber and with all of this stuff that's I'm going to speed through it a little bit you can find like 50 different schemes and there's a</transcript><transcript><audio_61>full-fledged paper which I'll leave you with because we could spend like four weeks just talking about mbcc all right so Master version in this case is going to be get written in</transcript> different way so it's it can be hybrid between newest to oldest uh and oldest to newest but the newest copy is always going to be in the main table through which you start the access and that's the main point A2 is the newest one but you can imagine a weird scheme in which A2 is in the main table but that points to something else that you know if the chain will become A1 A2 A3 and A3 in the main table you could say yeah A3 points to A1 from the main table to the time travel table you can come up with schemes like that to be not purely newest to oldest but if you had to say which one it sort of makes more sense it's like the main table has a newest stuff right which is where you're starting your access from so you can do all kinds of fiber and with all of this stuff that's I'm going to speed through it a little bit you can find like 50 different schemes and there's a full-fledged paper which I'll leave you with because we could spend like four weeks just talking about mbcc all right so Master version in this case is going to be get written in
{"source": "grass-yt-cc-by.-mY8ALcJVTk|shard_1_1|create_multimodal_data.extract_yt_and_generate_transcripts.62|shard_1|create_multimodal_data.generate_captions.62|shard_1|create_multimodal_data.generate_captions.62", "params": {"id": "-mY8ALcJVTk", "channel_id": "UCHnBsf2rH-K7pn09rb3qvkA", "duration": 5000, "view_count": 4483, "age_limit": 0, "like_count": 50, "channel_follower_count": 71100, "license": "Creative Commons Attribution license (reuse allowed)", "uploader_id": "@CMUDatabaseGroup", "yt_tar_file": "/leonardo_work/EUHPC_E03_068/audio/fixed_download/grass-yt-cc-by//shard_1/-mY8ALcJVTk.tar.gz"}}