Duplicate from openbmb/UltraData-Code

Co-authored-by: Yudong Wang <BigDong@users.noreply.huggingface.co>

.gitattributes

@@ -0,0 +1,60 @@
+*.7z filter=lfs diff=lfs merge=lfs -text
+*.arrow filter=lfs diff=lfs merge=lfs -text
+*.avro filter=lfs diff=lfs merge=lfs -text
+*.bin filter=lfs diff=lfs merge=lfs -text
+*.bz2 filter=lfs diff=lfs merge=lfs -text
+*.ckpt filter=lfs diff=lfs merge=lfs -text
+*.ftz filter=lfs diff=lfs merge=lfs -text
+*.gz filter=lfs diff=lfs merge=lfs -text
+*.h5 filter=lfs diff=lfs merge=lfs -text
+*.joblib filter=lfs diff=lfs merge=lfs -text
+*.lfs.* filter=lfs diff=lfs merge=lfs -text
+*.lz4 filter=lfs diff=lfs merge=lfs -text
+*.mds filter=lfs diff=lfs merge=lfs -text
+*.mlmodel filter=lfs diff=lfs merge=lfs -text
+*.model filter=lfs diff=lfs merge=lfs -text
+*.msgpack filter=lfs diff=lfs merge=lfs -text
+*.npy filter=lfs diff=lfs merge=lfs -text
+*.npz filter=lfs diff=lfs merge=lfs -text
+*.onnx filter=lfs diff=lfs merge=lfs -text
+*.ot filter=lfs diff=lfs merge=lfs -text
+*.parquet filter=lfs diff=lfs merge=lfs -text
+*.pb filter=lfs diff=lfs merge=lfs -text
+*.pickle filter=lfs diff=lfs merge=lfs -text
+*.pkl filter=lfs diff=lfs merge=lfs -text
+*.pt filter=lfs diff=lfs merge=lfs -text
+*.pth filter=lfs diff=lfs merge=lfs -text
+*.rar filter=lfs diff=lfs merge=lfs -text
+*.safetensors filter=lfs diff=lfs merge=lfs -text
+saved_model/**/* filter=lfs diff=lfs merge=lfs -text
+*.tar.* filter=lfs diff=lfs merge=lfs -text
+*.tar filter=lfs diff=lfs merge=lfs -text
+*.tflite filter=lfs diff=lfs merge=lfs -text
+*.tgz filter=lfs diff=lfs merge=lfs -text
+*.wasm filter=lfs diff=lfs merge=lfs -text
+*.xz filter=lfs diff=lfs merge=lfs -text
+*.zip filter=lfs diff=lfs merge=lfs -text
+*.zst filter=lfs diff=lfs merge=lfs -text
+*tfevents* filter=lfs diff=lfs merge=lfs -text
+# Audio files - uncompressed
+*.pcm filter=lfs diff=lfs merge=lfs -text
+*.sam filter=lfs diff=lfs merge=lfs -text
+*.raw filter=lfs diff=lfs merge=lfs -text
+# Audio files - compressed
+*.aac filter=lfs diff=lfs merge=lfs -text
+*.flac filter=lfs diff=lfs merge=lfs -text
+*.mp3 filter=lfs diff=lfs merge=lfs -text
+*.ogg filter=lfs diff=lfs merge=lfs -text
+*.wav filter=lfs diff=lfs merge=lfs -text
+# Image files - uncompressed
+*.bmp filter=lfs diff=lfs merge=lfs -text
+*.gif filter=lfs diff=lfs merge=lfs -text
+*.png filter=lfs diff=lfs merge=lfs -text
+*.tiff filter=lfs diff=lfs merge=lfs -text
+# Image files - compressed
+*.jpg filter=lfs diff=lfs merge=lfs -text
+*.jpeg filter=lfs diff=lfs merge=lfs -text
+*.webp filter=lfs diff=lfs merge=lfs -text
+# Video files - compressed
+*.mp4 filter=lfs diff=lfs merge=lfs -text
+*.webm filter=lfs diff=lfs merge=lfs -text

LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [OpenBMB] 
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

README.md

@@ -0,0 +1,203 @@
+---
+language:
+- en
+- zh
+license: apache-2.0
+size_categories:
+- 100M<n<1B
+task_categories:
+- text-generation
+pretty_name: UltraData-Code
+tags:
+- llm
+- code
+- code-pretraining
+- algorithmic-code
+- synthetic-data
+configs:
+- config_name: UltraData-Code-L2
+  data_files:
+  - split: cpp
+    path: "data/UltraData-Code-L2/cpp/*.parquet"
+  - split: cs
+    path: "data/UltraData-Code-L2/cs/*.parquet"
+  - split: go
+    path: "data/UltraData-Code-L2/go/*.parquet"
+  - split: java
+    path: "data/UltraData-Code-L2/java/*.parquet"
+  - split: js
+    path: "data/UltraData-Code-L2/js/*.parquet"
+  - split: php
+    path: "data/UltraData-Code-L2/php/*.parquet"
+  - split: py
+    path: "data/UltraData-Code-L2/py/*.parquet"
+  - split: r
+    path: "data/UltraData-Code-L2/r/*.parquet"
+  - split: rb
+    path: "data/UltraData-Code-L2/rb/*.parquet"
+  - split: rust
+    path: "data/UltraData-Code-L2/rust/*.parquet"
+  - split: sh
+    path: "data/UltraData-Code-L2/sh/*.parquet"
+- config_name: UltraData-Code-L3
+  data_files:
+  - split: cpp
+    path: "data/UltraData-Code-L3/cpp/*.parquet"
+  - split: cs
+    path: "data/UltraData-Code-L3/cs/*.parquet"
+  - split: go
+    path: "data/UltraData-Code-L3/go/*.parquet"
+  - split: java
+    path: "data/UltraData-Code-L3/java/*.parquet"
+  - split: js
+    path: "data/UltraData-Code-L3/js/*.parquet"
+  - split: php
+    path: "data/UltraData-Code-L3/php/*.parquet"
+  - split: py
+    path: "data/UltraData-Code-L3/py/*.parquet"
+  - split: r
+    path: "data/UltraData-Code-L3/r/*.parquet"
+  - split: rb
+    path: "data/UltraData-Code-L3/rb/*.parquet"
+  - split: rust
+    path: "data/UltraData-Code-L3/rs/*.parquet"
+  - split: sh
+    path: "data/UltraData-Code-L3/sh/*.parquet"
+default_config_name: UltraData-Code-L2
+---
+
+# UltraData-Code
+
+<div align="center">
+  <img src="assets/ultradata-code-logo.png" width="600" alt="UltraData-Code logo"/>
+</div>
+
+<p align="center">
+<a href="https://huggingface.co/collections/openbmb/ultradata">📦 UltraData Collection</a> |
+<a href="https://ultradata.openbmb.cn/">🌐 UltraData</a> |
+<a href="https://huggingface.co/collections/openbmb/minicpm5">🤗 MiniCPM5 Series</a> |
+📖 Tech Report (Coming Soon) |
+<a href="https://huggingface.co/openbmb/UltraData-Code-L2-Classifier">🤗 UltraData-Code-L2 Classifier</a>
+</p>
+
+<p align="center">English | <a href="https://huggingface.co/datasets/openbmb/UltraData-Code/blob/main/README_ZH.md">中文</a></p>
+
+## 📚 Introduction
+
+UltraData-Code is a complete implementation of the [UltraData](https://ultradata.openbmb.cn/) [L0-L4 tiered data management framework](https://arxiv.org/pdf/2602.09003). It covers four code data states from L0 through L3, with each level corresponding to a distinct construction stage. The pipeline starts from approximately **192 million** public GitHub repositories at L0. This release provides **UltraData-Code-L2** (\~**400B tokens**) and **UltraData-Code-L3** (\~**150B tokens**) across **11 programming languages**.
+
+<div align="center">
+  <img src="assets/ultradata-code-l0-l3-overview.png" width="760" alt="UltraData-Code L0-L3 construction pipeline"/>
+</div>
+
+**L0: Repository archival.** We preserve the latest revision on the default branch of approximately 192 million public [GitHub](https://github.com/) repositories, together with code, directory structure, file relationships, and provenance metadata. This archive provides complete raw data and traceability for subsequent processing.
+
+**L1: Standardized natural code.** Starting from L0, we perform large-scale filtering, cleaning, format normalization, and near-duplicate deduplication. General rules remove oversized files, invalid paths, unsupported text, and obvious anomalies. Checks tailored to each language and file type then normalize and clean the remaining content. For deduplication, files are partitioned by extension. MinHash signatures are generated and LSH retrieves near-duplicate candidates. Similarity edges define connected components. For groups containing multiple near-duplicates, the highest ranked 50% are retained. Files with no detected near duplicate are all kept. The result is a standardized natural code corpus.
+
+**L2: Algorithmically relevant code.** Across 11 programming languages, we select approximately **400B tokens** of algorithmically relevant code from L1. We develop a language-adaptive selection framework that combines file role supervision with language-specific heuristic cues to learn algorithmic relevance beyond explicit ALGO files. The framework reuses precomputed semantic embeddings across role, relevance, and quality models, and applies role and quality constraints during selection. Under controlled 10B-token continual pre-training of a 1B model, L2 improves over L1 by 7.80 and 5.13 points on EvalPlus and MultiPL-E, and over Stack-Edu by 4.37 and 3.05 points.
+
+**L3: Task-oriented synthesis.** We introduce a structured synthesis protocol that converts each algorithmically relevant implementation selected by L2 into a programming exercise, jointly generating a standalone task, analysis, solution, and test candidates from the same source implementation. This transformation preserves the source code's computational intent while adding explicit task and solution supervision for code generation. L3 covers the same 11 programming languages and contains approximately **150B tokens**. Under controlled 10B-token continual pre-training of a 1B model, replacing half of the L2 training tokens with L3 further improves EvalPlus and MultiPL-E by 8.42 and 8.07 points over L2-only training.
+
+## 📢 What's New
+
+- **[2026.09.07]** The [***UltraData-Code***](https://huggingface.co/datasets/openbmb/UltraData-Code) dataset is released! It is a complete implementation of the [UltraData](https://ultradata.openbmb.cn/) [L0-L4 tiered data management framework](https://arxiv.org/pdf/2602.09003). It covers four code data states from L0 through L3, with each level corresponding to a distinct construction stage. This release currently open-sources **L2** (\~400B tokens) and **L3** (\~150B tokens) across 11 programming languages. 🚀🚀🚀
+- **[2026.09.07]** ***[MiniCPM5-2B](https://huggingface.co/openbmb/MiniCPM5-2B) is released!***, the second model in the MiniCPM5 series after MiniCPM5-1B. It is a dense 2B Transformer that scales up the same training recipe, built for on-device, local deployment, and resource-constrained scenarios. It reaches **2B-class open-source SOTA**, remains competitive with 4B-class models, and shows particular advantages in coding, mathematics, long-context understanding, tool use, and agentic tasks. UltraData-RL-2609 serves as the core RL dataset for MiniCPM5-2B. 🚀🚀🚀
+- **[2026.02.08]** The [***UltraData***](https://ultradata.openbmb.cn/) platform is now live, introducing the [L0-L4 tiered data management framework](https://arxiv.org/pdf/2602.09003).  🔍🔍🔍
+
+## 💡 Highlights
+
+> **Abstract:** Code generation has become a core capability of large language models, and code data is a central part of the pre-training process that develops it. As code corpora continue to grow, their scale, diversity, and quality increasingly shape the capabilities learned during pre-training. Following a tiered data management perspective, we present **UltraData-Code** as a family of four connected data states, from repository archival at L0 through standardized natural code at L1, algorithmic selection at L2, and task-oriented synthesis at L3. L0 archives the latest revision on the default branch of each public GitHub repository with its file structure, relationships, and provenance. L1 applies scalable filtering, normalization, and near deduplication to obtain standardized natural code. L2 then selects algorithmically relevant files from L1 using language-adaptive signals from file roles and heuristics, together with code quality constraints, yielding approximately 400B tokens of **UltraData-Code-L2**, spanning 11 programming languages. L3 applies task-oriented synthesis to algorithmic files from L2, turning each implementation into a structured programming exercise, generating approximately 150B tokens of **UltraData-Code-L3** in the same 11 languages. Under controlled 10B-token continual pre-training of a 1B model, training on L2 instead of L1 raises pass@1 on EvalPlus by **7.80 points** and on MultiPL-E by **5.13 points**, while exceeding Stack-Edu by 4.37 and 3.05 points, respectively. Replacing half of the L2 training tokens with L3 yields a further gain of **8.42 points** on EvalPlus and **8.07 points** on MultiPL-E over L2-only training, while exceeding the strongest synthetic data baseline by 5.57 and 7.80 points, respectively. When the training budget increases to 100B tokens, gains from L2 selection and L3 synthesis further widen on both benchmarks.
+
+- **A connected code data construction pipeline.** UltraData-Code links repository archival and standardized natural code with selection and structured synthesis, yielding approximately 400B tokens at L2 and 150B tokens at L3 across 11 programming languages.
+- **Fine-grained curation of algorithmically relevant code.** We develop a language-adaptive selection framework that combines file role supervision with language-specific heuristic cues to learn algorithmic relevance beyond explicit ALGO files. The framework reuses precomputed semantic embeddings across role, relevance, and quality models, and applies role and quality constraints during selection.
+- **Implementation-grounded, task-oriented synthesis.** We introduce a structured synthesis protocol that converts each algorithmically relevant implementation selected by L2 into a programming exercise, jointly generating a standalone task, analysis, solution, and test candidates from the same source implementation. This transformation preserves the source code's computational intent while adding explicit task and solution supervision for code generation.
+
+## 📈 Evaluation Results
+
+The 10B-token comparisons use the same 1B foundation model, training settings, decontamination, and evaluation protocol.
+
+### Python Results
+
+- **Algorithmic selection yields the strongest natural code result.** UltraData-Code-L2-py improves the average EvalPlus pass@1 by **17.91 points** over UltraData-Code-L1-py and by **8.46 points** over Stack-Edu-py.
+- **Structured synthesis improves the matched mixture.** The equal-token UltraData-Code-L2-py + UltraData-Code-L3-py mixture reaches a **46.43** average pass@1, **3.30 points** above training on L2 alone and **4.46 points** above the matched L2 + SwallowCode-v2 mixture.
+
+<div align="center">
+  <img src="assets/python-training-dynamics.png" alt="Python training dynamics" width="760"/>
+</div>
+
+<div align="center">
+  <img src="assets/python_results.png" alt="Python main results table" width="900"/>
+</div>
+
+### Multilingual Results
+
+- **L2 selection improves over L1 baselines.** UltraData-Code-L2 exceeds UltraData-Code-L1 by **7.80 points** on EvalPlus and **5.13 points** on MultiPL-E, and exceeds Stack-Edu by **4.37** and **3.05 points**, respectively.
+- **L3 synthesis provides a further gain.** Replacing half of the L2 training tokens with L3 yields **8.42** and **8.07 points** over training on L2 alone on EvalPlus and MultiPL-E. Under the same 1:1 token mix, UltraData-Code-L2-L3 exceeds the strongest reported synthetic baseline by **5.57** and **7.80 points**, respectively.
+- **The advantage persists during scaling.** At 100B tokens, the L2-L3 mixture reaches 57.06 on EvalPlus and 39.54 on MultiPL-E, exceeding training on L2 alone by 10.11 and 12.39 points.
+
+<div align="center">
+  <img src="assets/multilingual-training-dynamics.png" alt="Multilingual training dynamics" width="760"/>
+</div>
+
+<div align="center">
+  <img src="assets/multilingual_results.png" alt="Multilingual main results table" width="900"/>
+</div>
+
+## 🧾 Data Formats
+
+### UltraData-Code-L2
+
+Each row represents one selected source file. The fields are:
+
+- `uuid`: unique file identifier.
+- `repo_name`: source repository name.
+- `relative_path`: file path relative to the repository.
+- `content`: source code text.
+- `category`: predicted file role, such as `ALGO`, `WEB`, `TOOL`, `DATA`, `TEST`, `CONFIG`.
+- `algo_rel_score`: algorithmic relevance score in `[0, 1]`.
+- `quality_score`: code quality score in `[0, 10]`.
+
+### UltraData-Code-L3
+
+Each row is a programming exercise grounded in a real implementation:
+
+- `uuid`: unique file identifier.
+- `content`: serialization containing task and solution.
+- `content_format`: serialization format for `content`.
+- `raw_content`: original generated record before serialization.
+- `task`: generated standalone problem statement.
+- `analysis`: algorithm, edge cases, and complexity discussion.
+- `solution`: generated self-contained reference implementation.
+- `test`: generated test candidates.
+- `full_content`: serialization containing all generated fields.
+- `full_content_format`: serialization format for `full_content`.
+
+## ❤️ Acknowledgements
+
+- The ***UltraData-Code-L2*** file-level semantic embeddings are computed with [Qwen3-Embedding-0.6B](https://huggingface.co/Qwen/Qwen3-Embedding-0.6B).
+
+Thanks for their awesome work! Open source contributions make UltraData-Code possible! 🙌
+
+## 💳 License and Data Sources
+
+This project is released under the [Apache 2.0](./LICENSE) license. ***UltraData-Code*** is built from code in multiple public repositories (L2) and from model-generated task records derived from those files (L3). Users must also comply with the **LICENSE of each source repository**. Apache 2.0 does not override those terms.
+
+Public availability of a repository is not a grant of redistribution, commercial use, or training rights. Rights holders may request removal via the contact channel on the dataset page.
+
+The dataset should not contain plaintext secrets or unauthorized personal data. Please report sensitive content or takedown requests through the same channel.
+
+**No unauthorized unchanged redistribution:** Without prior written permission from the original authors (or this organization), any institution, organization, or third-party platform is strictly prohibited from directly reposting, mirroring, re-hosting, or commercially repackaging and republishing any artifacts of this project in any form.
+
+## 📖 Citation
+
+If you find **UltraData-Code** useful in your research, please consider citing:
+
+```bibtex
+@misc{ultradata_code,
+  title        = {{UltraData-Code}: From Raw Repositories to Algorithmically Dense and Task-Oriented Code Data},
+  author       = {Chengying Tu and Hengyu Zhao and Shuaikang Xue and Zhongming Qu and Jihao Zhou and Xinle Lin and Junshao Guo and Zixuan Fu and Qiang Ma and Jie Zhou and Chaojun Xiao and Hongfei Yan and Yudong Wang and Xu Han and Zhiyuan Liu and Maosong Sun},
+  year         = {2026},
+  publisher    = {Hugging Face},
+  howpublished = {\url{https://huggingface.co/datasets/openbmb/UltraData-Code}}
+}
+```

README_ZH.md

@@ -0,0 +1,135 @@
+# UltraData-Code
+
+<div align="center">
+  <img src="assets/ultradata-code-logo.png" width="600" alt="UltraData-Code 标志"/>
+</div>
+
+<p align="center">
+<a href="https://huggingface.co/collections/openbmb/ultradata">📦 UltraData 合集</a> |
+<a href="https://ultradata.openbmb.cn/">🌐 UltraData</a> |
+<a href="https://huggingface.co/collections/openbmb/minicpm5">🤗 MiniCPM5 系列</a> |
+📖 技术报告（即将发布）|
+<a href="https://huggingface.co/openbmb/UltraData-Code-L2-Classifier">🤗 UltraData-Code-L2 分类器</a>
+</p>
+
+<p align="center"><a href="https://huggingface.co/datasets/openbmb/UltraData-Code/blob/main/README.md">English</a> | 中文</p>
+
+## 📚 简介
+
+UltraData-Code 是基于 [UltraData](https://ultradata.openbmb.cn/) [L0-L4 分级治理体系](https://arxiv.org/pdf/2602.09003) 的一次完整实现，覆盖 L0 至 L3 的分级代码数据，各层对应不同的数据构建阶段。流水线从 L0 约 **1.92 亿** 个公开 GitHub 仓库出发；本次发布包含 11 种编程语言上的 **UltraData-Code-L2**（约 **400B tokens**）和 **UltraData-Code-L3**（约 **150B tokens**）。
+
+<div align="center">
+  <img src="assets/ultradata-code-l0-l3-overview.png" width="760" alt="UltraData-Code L0-L3 construction pipeline"/>
+</div>
+
+**L0：仓库归档层。** 从约 1.92 亿个公开 [GitHub](https://github.com/) 仓库中保留默认分支上的最新版本，以及相应的代码、目录结构、文件关系和来源信息，为后续处理提供完整的原始数据和溯源记录。
+
+**L1：规范化自然代码层。** 在 L0 基础上进行规模化过滤清洗、格式规范化和近重复去重。通用规则排除过大文件、无效路径、不支持的文本和明显异常内容。随后根据语言和文件类型执行针对性的质量检查、归一化与内容清理。去重阶段按文件扩展名划分数据分区，使用 MinHash 生成签名并通过 LSH 检索候选近重复文件。相似度边用于构建连通分量。对于包含多个近重复文件的文件组，保留排名靠前的 50%。未发现近重复项的文件全部保留，最终形成标准化的自然代码语料。
+
+**L2：算法相关代码精筛层。** 面向 11 种编程语言，从 L1 中筛选约为 **400B tokens** 的算法相关代码。我们提出一种语言自适应筛选框架，将文件角色监督与语言特定启发式线索结合，学习超越显式 ALGO 文件的算法相关性。该框架在文件角色、算法相关性和代码质量模型之间复用预计算语义表征，最终结合角色与质量约束完成筛选。在相同的 1B 基座模型和 10B-token 持续预训练预算下，L2 相比 L1 在 EvalPlus 和 MultiPL-E 上分别提升 7.80 和 5.13 个百分点，相比 Stack-Edu 分别提升 4.37 和 3.05 个百分点。
+
+**L3：任务导向合成层。** 我们提出了一种结构化的合成协议，将 L2 选定的每个算法相关实现转换为编程练习，从而从同一源实现中共同生成独立的任务、分析、解决方案和测试用例。该变换在保留源代码计算意图的同时，为代码生成添加了明确的任务与解决方案监督。L3 覆盖相同的 11 种编程语言，规模约为 **150B tokens**。在相同的 1B 基座模型和 10B-token 持续预训练预算下，将一半 L2 训练 token 替换为 L3 后，模型在 EvalPlus 和 MultiPL-E 上较仅使用 L2 的训练分别进一步提升 8.42 和 8.07 个百分点。
+
+## 📢 最新动态
+
+- **[2026.09.07]** [***UltraData-Code***](https://huggingface.co/datasets/openbmb/UltraData-Code) 数据集正式发布！这是 [UltraData](https://ultradata.openbmb.cn/) [L0-L4 分级治理体系](https://arxiv.org/pdf/2602.09003) 的完整实现，覆盖 L0 至 L3 四个代码数据状态，各层对应不同的数据构建阶段。本次开源 **L2**（约 400B tokens）和 **L3**（约 150B tokens），覆盖 11 种编程语言。🚀🚀🚀
+- **[2026.09.07]** ***[MiniCPM5-2B](https://huggingface.co/openbmb/MiniCPM5-2B) 正式发布！*** 作为 MiniCPM5 系列在 MiniCPM5-1B 之后的第二款模型，这是一款沿用同一套训练配方放大的 2B 稠密 Transformer，面向端侧、本地部署与资源受限场景，达到 **2B 级开源 SOTA**，整体可与 4B 级模型竞争，并在代码、数学、长上下文、工具调用与 Agent 任务上相对同规模模型更具优势。UltraData-RL-2609 是 MiniCPM5-2B 的核心 RL 数据。🚀🚀🚀
+- **[2026.02.08]** [***UltraData***](https://ultradata.openbmb.cn/) 平台正式上线，并发布 [L0-L4 分级数据管理框架](https://arxiv.org/pdf/2602.09003)。🔍🔍🔍
+
+## 💡 亮点
+
+> **摘要：** 代码生成逐渐成为大语言模型的核心能力，而代码数据则是培养这一能力的预训练过程中的关键组成部分。随着代码语料规模不断增长，其规模、多样性与质量日益影响模型在预训练阶段习得的能力。遵循分级数据治理视角，我们提出 **UltraData-Code**，将其构建为由四个相互衔���的数据状态组成的数据家族：从 L0 的代码仓库归档，到 L1 的标准化自然代码、L2 的算法导向筛选，再到 L3 的任务导向合成。L0 归档每个公开 GitHub 仓库默认分支上的最新版本，并保留其文件结构、关联关系与来源信息。L1 通过可扩展的过滤、规范化与近重复去重，获得标准化自然代码。随后，L2 基于由文件角色与启发式规则构成的语言自适应信号，并结合代码质量约束，从 L1 中筛选与算法相关的文件，最终得到覆盖 11 种编程语言、规模约为 400B tokens 的 **UltraData-Code-L2**。L3 对 L2 中的算法文件实施任务导向合成，将每个实现转化为结构化编程练习，生成覆盖相同 11 种语言、规模约为 150B tokens 的 **UltraData-Code-L3**。在相同的 10B-token 持续预训练设置下，对一个 1B 模型使用 L2 而非 L1 进行训练，可使其在 EvalPlus 和 MultiPL-E 上的 pass@1 分别提高 **7.80 个百分点** 和 **5.13 个百分点**，同时分别超过 Stack-Edu 4.37 个百分点和 3.05 个百分点。将一半的 L2 训练 tokens 替换为 L3 后，相较于仅使用 L2 训练，模型在 EvalPlus 和 MultiPL-E 上可进一步提升 **8.42 个百分点** 和 **8.07 个百分点**，同时分别超过最强的合成数据基线 5.57 个百分点和 7.80 个百分点。当训练预算增加至 100B tokens 时，L2 筛选与 L3 合成在两个基准上的增益均进一步扩大。
+
+- **完整的代码数据构建流水线：** 将仓库归档和规范化自然代码与细粒度精筛、结构化合成连接起来，在 11 种编程语言上分别形成约 400B tokens 的 L2 和约 150B tokens 的 L3。
+- **细粒度算法相关代码精筛：** 我们提出一种语言自适应筛选框架，将文件角色监督与语言特定启发式线索结合，学习超越显式 ALGO 文件的算法相关性。该框架在文件角色、算法相关性和代码质量模型之间复用预计算语义表征，最终结合角色与质量约束完成筛选。
+- **任务导向合成：** 我们提出一种结构化合成方案，将 L2 筛选出的每个算法相关实现转化为一道编程练习，并基于同一源实现联合生成独立完整的任务、分析、解答与候选测试用例。该转换既保留了源代码的计算意图，又为代码生成引入了显式的任务监督与解答监督。
+
+## 📈 评测结果
+
+10B-token 对比均使用相同的 1B 基座模型、训练设置、去污流程和评测协议。
+
+### Python 结果
+
+- **算法相关性精筛带来最强的自然代码结果。** UltraData-Code-L2-py 的 EvalPlus 平均 pass@1 比 UltraData-Code-L1-py 提升 **17.91 个百分点**，比 Stack-Edu-py 提升 **8.46 个百分点**。
+- **结构化合成提升等 token 混合训练效果。** UltraData-Code-L2-py 与 UltraData-Code-L3-py 的等 token 混合训练平均 pass@1 达到 **46.43**，比仅使用 L2 高 **3.30 个百分点**，比对应的 L2 + SwallowCode-v2 混合训练高 **4.46 个百分点**。
+
+<div align="center">
+  <img src="assets/python-training-dynamics.png" alt="Python 训练动态" width="760"/>
+</div>
+
+<div align="center">
+  <img src="assets/python_results.png" alt="Python 主结果表" width="900"/>
+</div>
+
+### 多语言结果
+
+- **L2 精筛优于自然代码基线。** UltraData-Code-L2 相比 UltraData-Code-L1 在 EvalPlus 和 MultiPL-E 上分别提升 **7.80** 和 **5.13 个百分点**，相比 Stack-Edu 分别提升 **4.37** 和 **3.05 个百分点**。
+- **L3 合成带来进一步提升。** 将一半 L2 训练 token 替换为 L3 后，相比仅使用 L2 的训练，EvalPlus 和 MultiPL-E 分别提升 **8.42** 和 **8.07 个百分点**。在相同的 1:1 token 配比下，UltraData-Code-L2-L3 混合训练相比最强的合成数据基线，两个基准分别提升 **5.57** 和 **7.80 个百分点**。
+- **优势在规模扩展中持续存在。** 在 100B tokens 训练规模下，L2-L3 混合训练在 EvalPlus 和 MultiPL-E 上分别达到 57.06 和 39.54，相比仅使用 L2 的训练分别高 10.11 和 12.39 个百分点。
+
+<div align="center">
+  <img src="assets/multilingual-training-dynamics.png" alt="多语言训练动态" width="760"/>
+</div>
+
+<div align="center">
+  <img src="assets/multilingual_results.png" alt="多语言主结果表" width="900"/>
+</div>
+
+## 🧾 数据格式
+
+### UltraData-Code-L2
+
+每行对应一个精筛源代码文件，字段包括：
+
+- `uuid`：文件唯一标识。
+- `repo_name`：来源仓库名称。
+- `relative_path`：相对仓库根目录的文件路径。
+- `content`：代码文本。
+- `category`：预测的文件角色，如 `ALGO`、`WEB`、`TOOL`、`DATA`、`TEST`、`CONFIG`。
+- `algo_rel_score`：算法相关性分数，范围为 `[0, 1]`。
+- `quality_score`：代码质量分数，范围为 `[0, 10]`。
+
+### UltraData-Code-L3
+
+每行是一个基于真实实现构建的编程练习，字段包括：
+
+- `uuid`：文件唯一标识。
+- `content`：包含 task 和 solution 字段的序列化��本。
+- `content_format`：`content` 的序列化格式。
+- `raw_content`：序列化前的原始生成记录。
+- `task`：生成的独立任务描述。
+- `analysis`：算法、边界情况与复杂度分析。
+- `solution`：生成的自包含参考实现。
+- `test`：生成的测试候选。
+- `full_content`：包含全部生成字段的序列化文本。
+- `full_content_format`：`full_content` 的序列化格式。
+
+## ❤️ 致谢
+
+- ***UltraData-Code-L2*** 使用 [Qwen3-Embedding-0.6B](https://huggingface.co/Qwen/Qwen3-Embedding-0.6B) 计算文件级语义 embedding。
+
+感谢这些优秀开源工作，正是开源社区的贡献让 UltraData-Code 成为可能！🙌
+
+## 💳 许可与数据来源
+
+本项目按 [Apache 2.0](./LICENSE) 许可证发布。***UltraData-Code*** 来自多个公开代码仓库中的代码（L2），以及基于这些文件生成的任务记录（L3）。使用者还须遵守各源仓库的 **LICENSE**。Apache 2.0 不会覆盖或取代这些条款。
+
+仓库公开可访问不等于授予再分发、商用或训练许可。权利人可通过数据集页面的联系方式申请移除。
+
+本数据集不应包含明文密钥或未经授权的个人数据。如发现敏感内容或需要下架，请通过同一渠道报告。
+
+**禁止未经授权的原样转载：** 未经原作者（或本组织）事先书面许可，任何机构、组织或第三方平台严禁以任何形式直接转载、镜像、重新托管，或对项目产物进行商业化重新包装后再发布。
+
+## 📖 引用
+
+如果 **UltraData-Code** 对您的研究有帮助，请考虑引用：
+
+```bibtex
+@misc{ultradata_code,
+  title        = {{UltraData-Code}: From Raw Repositories to Algorithmically Dense and Task-Oriented Code Data},
+  author       = {Chengying Tu and Hengyu Zhao and Shuaikang Xue and Zhongming Qu and Jihao Zhou and Xinle Lin and Junshao Guo and Zixuan Fu and Qiang Ma and Jie Zhou and Chaojun Xiao and Hongfei Yan and Yudong Wang and Xu Han and Zhiyuan Liu and Maosong Sun},
+  year         = {2026},
+  publisher    = {Hugging Face},
+  howpublished = {\url{https://huggingface.co/datasets/openbmb/UltraData-Code}}
+}
+```

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00001-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c8eb72a175dfe45928bf5672360dfe7a9f3d85864d59173c65bfe91542a2b904
+size 1037447606

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00002-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6ba9f9851a48da218b2a19bde5f10d4cf24b8f495d14468c120f6ecd0d86e428
+size 1040268020

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00003-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3a8220a9e8b6971cbc6d7696e1c7e516951eb89614ce223ea7c8507177a926bd
+size 1042288829

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00004-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:53d9d9296b46ae7f7ce72844b24fcc351cf9aa5a52039f2229fc9e35cb8a210a
+size 1041157793

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00005-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3b812b12a8d78f7814b2d4d68e5bca3aeef6c17c4f0d64ad4b77ad678e0b5654
+size 1044900002

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00006-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0ad0fb7dd80be0acd495fe070604e79e9256a477000a523402d14240435c5d8c
+size 1043304465

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00007-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:41aaf55e9d388b411f4305cb041481f8f705674209683a8f1dab4eda57c64d26
+size 1044807232

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00008-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:826db7486efc5bcca7a914178c6d0f7d4f1ceacf5888d931401c41cee7ee474e
+size 1046231398

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00009-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d2ad7e94a3ad460c8e2d0dfc8043893ed9808f0768dace8325a932f1f7bc1ade
+size 1045720640

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00010-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8c1629f411579f88db650424ee4b9422eb95db5db7bb38eff200cc6247770751
+size 1042362906

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00011-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:aa607e696a5243c2d434ce1e9b86aa75206cd5e26944291f6f7e6793c2a6b774
+size 1048144862

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00012-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c636148dcee62be682cd8d54c3204202d1ed6780e2c79ef7f243311035d00469
+size 1042529003

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00013-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:928b8cc6e4109b2c6b10cd528f441a642191aae0e47d0160397b89ddf45c566e
+size 1043314132

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00014-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b18deb76b9ed1eb561f106705b99694b6bf850580098ffe0083673da82d3e8d5
+size 1049887974

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00015-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b2115278a1a7ab7d8b57a2d3fc220d849e4bcc3bc1a44dacceb4bfc4707e046e
+size 1045402009

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00016-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:84e9a2999e841d073b85dffe426050ceb5c6ef1f5b38b1b9f0671fdd0bb54b05
+size 1040028066

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00017-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c2c21eb3a387c8b81485c4c9899c4375a5d3e55d8b861987f69fe4294d132d59
+size 1042325513

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00018-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:fbcbfcefb28a2dd81491accd1983695d9df0a5b34f261b72e30dee1d721456f7
+size 1043873631

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00019-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ca679cd4389eb69ec27e8f16621e23585a4f20b95e166335e19b2adb9b14bb51
+size 1040233520

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00020-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:df4e8f0581c51012e50d8ccd7d037fa19cb6b4e31dbc930bb1ccef3487444652
+size 1046055656

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00021-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:219153e44a37e66d249b7deb2db29f3c551d9ddad4490b51438dbff89fe409e3
+size 1042847147

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00022-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bc83ee468cceb3ecda932731e6a31593c4e3b222b59fc369d0e9fb860eef942f
+size 1043464761

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00023-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8fb4df045a83ab8b58cf37a7c27415b0942fa4a5a24c00b94693435e40369ae6
+size 1051091105

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00024-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:57f066071aa49402a8c9eafaeb4429298ca5446dcd93d33fec08835ed3889697
+size 1046956098

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00025-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e90947765b64599cabbfdc1c3d76656553f3a8ec21e86359e5689c3051b8b6a1
+size 1044488218

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00026-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2a22dcc103ed17e59e0d01dd759943c77a37ec22aca88e9c4a162714c515758e
+size 1045532741

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00027-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3ac97bd3e609dc588e2a4db2b32f89560a539bb28988ba6ce8083b5fad39458a
+size 1042049263

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00028-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:70ac484b42dab20c6dd4609d3e0575275799593df405ae0e9c1597eab09d4064
+size 1041621539

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00029-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d002579970589a8fe101aa30fca1aacfcc45d81013cae79e2539c6d6fc23fcc4
+size 1040902744

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00030-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:96c991be44c4f1eb6b4bf1702724892361a6e60ede3660562e27e03949ae529e
+size 1044351633

data/UltraData-Code-L2/cpp/UltraData-Code-L2-cpp-part-00031-of-00031.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ab0ced7a9d9ff1756fe4e46d8864ade0cc02a609bb96fbdac9abe1eb4e313d83
+size 1040307466

data/UltraData-Code-L2/cs/UltraData-Code-L2-cs-part-00001-of-00050.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ac92729f2b8aaf04cc77d6ea38382f42ba1c2b20a6bdc7f3419263d56562e61f
+size 1104852112

data/UltraData-Code-L2/cs/UltraData-Code-L2-cs-part-00002-of-00050.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0a2b830e3d190c21c99b389c526eaa401d2ce4f230cfcdd5f4bf7bd2c47c961a
+size 1107639309

data/UltraData-Code-L2/cs/UltraData-Code-L2-cs-part-00003-of-00050.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4719eef1d8b0839c0627f568ef9fa88fd33526f721dd41b37c3dc49d798633d0
+size 1110045037

data/UltraData-Code-L2/cs/UltraData-Code-L2-cs-part-00004-of-00050.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3402ba5aceee76047147bb1e7da4b9da4ba72fddf8a811412304a0825e37360c
+size 1109329147

data/UltraData-Code-L2/cs/UltraData-Code-L2-cs-part-00005-of-00050.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a6de3955c00704bdc061f609c0fb0e9ba85ee965630d66252fc8545e54dcaf9f
+size 1108743879

data/UltraData-Code-L2/cs/UltraData-Code-L2-cs-part-00006-of-00050.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:feaf3d94000c4e8b22c4fba363c0b6fec0461482a543070872756efa56e9a511
+size 1112424403

data/UltraData-Code-L2/cs/UltraData-Code-L2-cs-part-00007-of-00050.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3fcc71c38e468808687a7ebd9a4ce3f7df9b91540aa06818aff55724ccd943d5
+size 1104009593

data/UltraData-Code-L2/cs/UltraData-Code-L2-cs-part-00008-of-00050.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d667db711cf5cdc8bbfe873c5414b98db4d424b70a155732c2c14d523bb01743
+size 1108438732

data/UltraData-Code-L2/cs/UltraData-Code-L2-cs-part-00009-of-00050.parquet

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6f0a3f7c7b4e6762b113f37adddf6bb6ef1e931554cda2ac8768483a7ee62fad
+size 1106373556