<transcript><audio_11>when the number of records reaches which means the record list is is 4 of</transcript><transcript><audio_12>we use n log n time to open all the proofs see the proofs here are open or algorithm</transcript><transcript><audio_13>and now we can clear the record list and since uh all the proofs all the single proofs are updated so anytime if we need to get some single proof</transcript> when the number of records reaches which means the record list is is 4 of we use n log n time to open all the proofs see the proofs here are open or algorithm and now we can clear the record list and since uh all the proofs all the single proofs are updated so anytime if we need to get some single proof
{"source": "grass-yt-cc-by.-rZTckp-Urw|shard_10005_10|create_multimodal_data.extract_yt_and_generate_transcripts.28|shard_10005|create_multimodal_data.generate_captions.28|shard_10005|create_multimodal_data.generate_captions.28", "params": {"id": "-rZTckp-Urw", "channel_id": "UCJvMzILpV3b4AWXTEeQjcng", "duration": 780, "view_count": 103, "age_limit": 0, "like_count": 1, "channel_follower_count": 8710, "license": "Creative Commons Attribution license (reuse allowed)", "uploader_id": "@ProtocolLabs", "yt_tar_file": "/leonardo_work/EUHPC_E03_068/audio/fixed_download/grass-yt-cc-by//shard_10005/-rZTckp-Urw.tar.gz"}}