Datasets:
id large_stringlengths 16 16 | domain large_stringclasses 4
values | source large_stringclasses 12
values | difficulty large_stringclasses 2
values | messages listlengths 3 3 | ground_truth large_stringlengths 0 26k | quality_score float64 7 10 | teacher_model large_stringclasses 1
value | completion_tokens int64 78 2.99k | generation_time large_stringlengths 32 32 |
|---|---|---|---|---|---|---|---|---|---|
9edf40c4af524e8f | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | A | 9.5 | qwen3.8-max-preview | 312 | 2026-07-21T15:39:47.327898+00:00 |
0be844138860624b | code | Evol-Code | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | Here is a possible implementation of the function:
```python
def repeat_string(n, s):
# Check if n is a positive integer
if not isinstance(n, int) or n <= 0:
raise ValueError("n must be a positive integer")
# Check if s is a non-empty string
if not isinstance(s, str) or len(s) == 0:
ra... | 9 | qwen3.8-max-preview | 866 | 2026-07-21T22:50:22.101017+00:00 |
77dd24b9a4e73329 | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | # Code
def armstrong_numbers(n):
# Empty list to store Armstrong numbers
lst = []
for i in range(1, n + 1):
s = 0
# To find the power
m = len(str(i))
# Finding Armstrong numbers
temp = i
while temp > 0:
digit = temp % 10
... | 9 | qwen3.8-max-preview | 1,012 | 2026-07-22T04:24:50.540164+00:00 |
692339bf19f79f82 | code | Evol-Code | hard | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | def convert_distance_to_kilometers(distance, time):
try:
distance_km = distance * 1.60934 # Conversion factor from miles to kilometers
time_hr = time / 60 # Conversion factor from minutes to hours
speed = distance_km / time_hr
return speed
except Exception as e:
print("... | 9 | qwen3.8-max-preview | 1,405 | 2026-07-21T22:58:47.729769+00:00 |
64e748ab6c3b9abe | instruction | tulu-3 | medium | [
{
"role": "system",
"content": "You are a helpful, precise assistant. Follow instructions exactly.\n\nFormat your response as:\n<think>\n[Understand what is being asked. Identify constraints and requirements.\nPlan your response structure.]\n</think>\n\n[Your complete, well-structured response following all... | 7.5 | qwen3.8-max-preview | 459 | 2026-07-21T15:54:58.664296+00:00 | |
d76cbf7e873a0518 | reasoning | CommonsenseQA | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | A | 9.5 | qwen3.8-max-preview | 832 | 2026-07-22T05:36:39.088086+00:00 |
64a1ff257917ee46 | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | A | 9.5 | qwen3.8-max-preview | 455 | 2026-07-22T06:34:29.028373+00:00 |
0011564ebf84d597 | reasoning | QASC | hard | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | B | 9.5 | qwen3.8-max-preview | 901 | 2026-07-21T21:07:42.106711+00:00 |
642bfd761767e861 | code | Evol-Code | hard | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | To find the Nth Fibonacci number with a time complexity of O(1) and a space complexity of O(1), we can use the formula for the Fibonacci sequence:
Fib(N) = (phi^N - (-phi)^(-N)) / sqrt(5)
where phi is the golden ratio, approximately equal to 1.61803398875.
Here is the code:
```python
import math
def fibonacci(n):
... | 9 | qwen3.8-max-preview | 855 | 2026-07-21T13:08:50.295679+00:00 |
0065e54a84f7084e | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | def mean(numbers):
nums = numbers
avg = sum(nums) / len(nums)
return round(avg, 2) | 9 | qwen3.8-max-preview | 440 | 2026-07-22T09:09:39.520219+00:00 |
d00e8338d60d6b2b | code | Evol-Code | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | To solve this problem, we can iterate through the list and check if each element is greater than both its neighbors. If it is, we add a tuple of the index and value of that element to our result list.
Here is the implementation of the "find_local_maxima" function:
def find_local_maxima(arr):
result = []
for i... | 9 | qwen3.8-max-preview | 1,064 | 2026-07-22T08:22:18.568066+00:00 |
0b30c33a33506e7f | code | Evol-Code | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | Here is a possible implementation in Python:
```python
def normalize_vector(vector):
total_sum = sum(vector)
normalized_vector = []
for element in vector:
normalized_element = element / total_sum
if element < 0:
normalized_element = int(normalized_element)
else:
... | 9 | qwen3.8-max-preview | 1,121 | 2026-07-22T01:16:00.729775+00:00 |
de5d290b4116e791 | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | D | 9.5 | qwen3.8-max-preview | 374 | 2026-07-22T02:42:30.691493+00:00 |
533be58a4df63f05 | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | C | 9.5 | qwen3.8-max-preview | 391 | 2026-07-21T18:35:33.103503+00:00 |
73b90a2093b6ca87 | code | HumanEval | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | opening_bracket_index = []
closing_bracket_index = []
for i in range(len(string)):
if string[i] == '[':
opening_bracket_index.append(i)
else:
closing_bracket_index.append(i)
closing_bracket_index.reverse()
cnt = 0
i = 0
l = len(closing_bracket_index)
... | 9 | qwen3.8-max-preview | 1,540 | 2026-07-21T22:35:26.210360+00:00 |
c7ffed04c6593dfb | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | B | 9.5 | qwen3.8-max-preview | 456 | 2026-07-21T18:22:31.925153+00:00 |
28e878d50496a3d9 | reasoning | OpenBookQA | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | A | 9.5 | qwen3.8-max-preview | 347 | 2026-07-21T20:15:18.480246+00:00 |
6f3c3c2e69fc5b09 | reasoning | CommonsenseQA | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | C | 9.5 | qwen3.8-max-preview | 524 | 2026-07-21T12:30:43.356735+00:00 |
4b57192749b542fc | instruction | tulu-3 | medium | [
{
"role": "system",
"content": "You are a helpful, precise assistant. Follow instructions exactly.\n\nFormat your response as:\n<think>\n[Understand what is being asked. Identify constraints and requirements.\nPlan your response structure.]\n</think>\n\n[Your complete, well-structured response following all... | 7.5 | qwen3.8-max-preview | 524 | 2026-07-21T15:12:53.417848+00:00 | |
8615fbcab72ee20d | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | C | 9.5 | qwen3.8-max-preview | 531 | 2026-07-21T14:41:08.562047+00:00 |
4aa0ed51a5fc9ca9 | reasoning | CommonsenseQA | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | A | 9.5 | qwen3.8-max-preview | 536 | 2026-07-22T03:34:56.306972+00:00 |
6d874da034085cfd | reasoning | CommonsenseQA | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | E | 9.5 | qwen3.8-max-preview | 422 | 2026-07-22T10:04:09.656986+00:00 |
8ef0133641092de8 | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | C | 9.5 | qwen3.8-max-preview | 358 | 2026-07-21T12:49:40.224818+00:00 |
3f71101f948af6da | reasoning | QASC | hard | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | F | 9.5 | qwen3.8-max-preview | 716 | 2026-07-21T21:18:44.886033+00:00 |
99046215b74233bd | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | B | 9.5 | qwen3.8-max-preview | 639 | 2026-07-21T14:01:54.473705+00:00 |
4aac5a234bb79229 | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | # Generate a list with numbers in range 3 to 12
my_list = list(range(3, 13))
print(my_list) # [3, 4, 5, 6, 7, 8, 9, 10, 11, 12] | 9 | qwen3.8-max-preview | 413 | 2026-07-21T15:49:02.421335+00:00 |
aeb10d6f48a403cd | code | Evol-Code | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | Here is a function in Python that sums up all numbers greater than 10 and not divisible by 3 in the given array:
```python
def sum_greater_than_10_not_divisible_by_3(numbers):
# Initialize sum variable
total = 0
# Iterate through each number in the array
for number in numbers:
# Check if t... | 9 | qwen3.8-max-preview | 783 | 2026-07-21T17:38:53.886940+00:00 |
a02b2d507fc14b24 | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | def three_most_common(lst):
"""This function takes in an array and returns an array of the three most common elements."""
lst_len = len(lst)
lst_dic = dict()
for n in lst:
if n in lst_dic:
lst_dic[n] += 1
else:
lst_dic[n] = 1
max_val = 0
max_key = 0
... | 9 | qwen3.8-max-preview | 732 | 2026-07-21T21:23:56.362324+00:00 |
77cbdf76e61bed76 | code | Evol-Code | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | Here's a way to reverse a string without using any built-in functions, loops, recursion, or additional variables in R:
```R
reverse_string <- function(string) {
if (nchar(string) <= 1) {
return(string)
} else {
substring(string, nchar(string), nchar(string)) %s+%
Recall(substring(string, 1, nchar(str... | 8.5 | qwen3.8-max-preview | 1,998 | 2026-07-21T22:09:35.437862+00:00 |
dc47058e043bd928 | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | func stringASCIICode(s string) int {
code := 0
for _, c := range s {
code += int(c)
}
return code
} | 8.5 | qwen3.8-max-preview | 776 | 2026-07-21T21:43:53.062301+00:00 |
540173cd16a42242 | reasoning | OpenBookQA | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | A | 9.5 | qwen3.8-max-preview | 361 | 2026-07-22T01:39:26.831253+00:00 |
d7c82f51f5d389ed | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | array.sort() | 10 | qwen3.8-max-preview | 368 | 2026-07-21T18:57:50.141171+00:00 |
0c67b8c966b5861b | code | Evol-Code | hard | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | To find the most common string in the given array, we can use the Boyer-Moore majority vote algorithm.
The algorithm works by iterating through the array and keeping track of the current candidate for the most common string and its count. Initially, we set the candidate as the first string in the array and the count ... | 9 | qwen3.8-max-preview | 1,909 | 2026-07-22T07:12:21.730459+00:00 |
e04977102b1a2ec2 | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | def print_word_lengths(input_string):
#Split the string into individual words
words = input_string.split()
#Iterate over each word
for word in words:
#Print the word and the length of the word
print('{}: {}'.format(word, len(word)))
print_word_lengths('Hello World')
Output:
Hello: 5
World: 5 | 8.5 | qwen3.8-max-preview | 337 | 2026-07-22T08:27:02.922678+00:00 |
969b40e0fedade02 | code | Evol-Code | hard | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | To reverse the order of elements in a list using a recursive algorithm with O(1) space complexity, we can use the following approach:
1. Define a recursive function `reverseList` that takes two parameters: `list` (the input list) and `start` (the starting index of the sublist to be reversed).
2. Base Case: If `start`... | 9 | qwen3.8-max-preview | 1,461 | 2026-07-21T19:58:50.584441+00:00 |
49b66c515c2f277e | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | D | 9.5 | qwen3.8-max-preview | 433 | 2026-07-21T23:09:45.278241+00:00 |
9e69fc59988d2be5 | reasoning | CommonsenseQA | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | A | 9.5 | qwen3.8-max-preview | 495 | 2026-07-22T03:48:06.992748+00:00 |
5802e4bf50f6c961 | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | /\b100\b/ | 9 | qwen3.8-max-preview | 511 | 2026-07-21T16:38:23.840447+00:00 |
7fd164512e751c0c | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | C | 9.5 | qwen3.8-max-preview | 449 | 2026-07-21T19:49:58.329716+00:00 |
3ad3a018dcca4923 | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | def convert_to_uppercase(string):
return string.upper()
if __name__ == '__main__':
print(convert_to_uppercase("this is a string")) | 9 | qwen3.8-max-preview | 337 | 2026-07-22T01:16:17.744401+00:00 |
fbebe19655370006 | code | Evol-Code | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | Here is a JavaScript code snippet that appends the contents of one array to another array, satisfying the given constraints:
```javascript
function appendArrays(arr1, arr2) {
if (arr1.length !== arr2.length) {
throw new Error('Input arrays must be of the same length');
}
const appendedArray = Object.value... | 8.5 | qwen3.8-max-preview | 1,645 | 2026-07-21T20:55:23.955232+00:00 |
34abc2666f2046f3 | instruction | tulu-3 | medium | [
{
"role": "system",
"content": "You are a helpful, precise assistant. Follow instructions exactly.\n\nFormat your response as:\n<think>\n[Understand what is being asked. Identify constraints and requirements.\nPlan your response structure.]\n</think>\n\n[Your complete, well-structured response following all... | 7.5 | qwen3.8-max-preview | 344 | 2026-07-21T23:31:13.093602+00:00 | |
60d3b50741c12475 | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | 55 | 10 | qwen3.8-max-preview | 279 | 2026-07-21T15:03:05.292064+00:00 |
e595829f93967f26 | reasoning | QASC | hard | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | H | 9.5 | qwen3.8-max-preview | 1,121 | 2026-07-22T02:31:21.557764+00:00 |
fa04f90c8ed41f1a | instruction | Dolly | medium | [
{
"role": "system",
"content": "You are a helpful, precise assistant. Follow instructions exactly.\n\nFormat your response as:\n<think>\n[Understand what is being asked. Identify constraints and requirements.\nPlan your response structure.]\n</think>\n\n[Your complete, well-structured response following all... | Include more whole foods in Diet
Try to avoid crash diet
Get Professional help in beginning
Include and surround yourself with healthy foods
Include healthy snack and carry it with you
Plan alternative before going out
Monitor yourself your progress and be patient
Break old Habits one at a time | 7.5 | qwen3.8-max-preview | 768 | 2026-07-22T00:21:37.174352+00:00 |
43e509ede1c41014 | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 | 10 | qwen3.8-max-preview | 464 | 2026-07-21T13:12:21.026636+00:00 |
f980c9f3a0a475ae | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | #include <stdio.h>
int main()
{
printf("Hello World");
return 0;
} | 8.5 | qwen3.8-max-preview | 114 | 2026-07-21T21:57:01.810456+00:00 |
baea48149eafed09 | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | D | 9.5 | qwen3.8-max-preview | 366 | 2026-07-21T19:48:35.111046+00:00 |
67bd431175614464 | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | <html>
<head>
<title>Product Prices</title>
</head>
<body>
<h1>Product Prices</h1>
<table>
<tr>
<th>Product Name</th><th>Price</th>
</tr>
<tr>
<td>Laptop</td><td>1000</td>
</tr>
<tr>
<td>Keyboard</td><td>50</td>
</tr>
<tr>
<td>Monitor</td><td>200</td>
</tr>
<tr>
<... | 8.5 | qwen3.8-max-preview | 1,690 | 2026-07-21T15:30:01.388308+00:00 |
6b992e6b40437421 | reasoning | SciQ | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | C | 9.5 | qwen3.8-max-preview | 451 | 2026-07-22T09:55:53.917078+00:00 |
b239db15af58afcb | code | Evol-Code | hard | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | The purpose of the function is to calculate the mean (average) of a given list of numbers. It does this by summing up all the elements in the list and then dividing the sum by the length of the list. The calculated mean is then returned.
The time complexity of the function is O(n), where n is the length of the input l... | 9 | qwen3.8-max-preview | 846 | 2026-07-21T17:02:27.025647+00:00 |
c8a58116aa80c12d | code | CodeAlpaca | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | for i in my_list:
print(i) | 8.5 | qwen3.8-max-preview | 226 | 2026-07-21T15:46:39.821560+00:00 |
5424d6b644fa084c | code | Evol-Code | hard | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | To generate a random hexadecimal color code in Ruby that meets the requirements of alternating characters, alternating colors, and alternating shades, you can use the following code:
```ruby
class ColorGenerator
attr_reader :last_color_code
def initialize
@last_color_code = nil
end
def generate_alter... | 9 | qwen3.8-max-preview | 1,778 | 2026-07-22T00:06:13.616377+00:00 |
38859bb7da97254a | code | Evol-Code | medium | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | <!DOCTYPE html>
<html>
<head>
<title>Example</title>
</head>
<body>
<h1>This is a Heading</h1>
<p>This is a paragraph.<sup>[1]</sup></p>
<p>This is another paragraph.<sup>[2]</sup></p>
<p>This is a third paragraph.<sup>[3]</sup></p>
<section id="footnotes">
<h2>Footnotes</h2>
... | 8.5 | qwen3.8-max-preview | 1,001 | 2026-07-21T21:49:48.153157+00:00 |
eac313f77289000e | code | Evol-Code | hard | [
{
"role": "system",
"content": "You are an expert software engineer. Write complete, correct, runnable code.\n\nFormat your response EXACTLY as:\n<think>\n[Analyze the problem, consider edge cases, choose your approach,\nexplain your algorithm and data structure choices.]\n</think>\n\n```python\n[Complete, ... | Here is a possible implementation for the function:
def sort_reverse(input_list):
unique_list = list(set(input_list))
unique_list.sort()
unique_list.reverse()
return unique_list
# testing the function with the given example
input_list = [3, 8, 10, 1, 9]
print(sort_reverse(input_list)) | 9 | qwen3.8-max-preview | 1,495 | 2026-07-21T17:04:48.698040+00:00 |
977d548064a56830 | reasoning | CommonsenseQA | medium | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | B | 9.5 | qwen3.8-max-preview | 494 | 2026-07-22T02:06:02.791429+00:00 |
5a87820235306999 | instruction | tulu-3 | medium | [
{
"role": "system",
"content": "You are a helpful, precise assistant. Follow instructions exactly.\n\nFormat your response as:\n<think>\n[Understand what is being asked. Identify constraints and requirements.\nPlan your response structure.]\n</think>\n\n[Your complete, well-structured response following all... | 7.5 | qwen3.8-max-preview | 524 | 2026-07-21T17:39:51.882982+00:00 | |
81f92ff8b2a7a3e3 | reasoning | QASC | hard | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | F | 9.5 | qwen3.8-max-preview | 803 | 2026-07-21T16:53:48.171455+00:00 |
d50e718c3f064b3e | reasoning | QASC | hard | [
{
"role": "system",
"content": "You are an expert logical reasoner. Think through the problem carefully.\n\nFormat your response EXACTLY as:\n<think>\n[Break down the problem into components.\nConsider multiple hypotheses if applicable.\nEliminate incorrect paths explicitly.\nBuild toward the conclusion ste... | C | 9.5 | qwen3.8-max-preview | 596 | 2026-07-21T20:59:38.741289+00:00 |
Qwen3.8-Max Distillation
A quality-filtered derivative of Qwen3.8-Max Distillation 50K by r0b0tlab, prepared for local training and fine-tuning on consumer hardware.
This repository takes the original 49,772-example dataset and produces a substantially smaller training set focused on coding, reasoning, instruction following, and tool use.
Terms and provenance notice — not cleared for unrestricted commercial/model-training use.
This dataset was generated through Alibaba Cloud Model Studio. The current Alibaba Cloud International Product Terms, §4.48(d)(v), restrict using Model Studio, its hosted models, or their outputs to train or develop products or services that compete with Alibaba Cloud or its affiliates unless expressly authorized.
In addition, at least 12,106 rows (24.3%) of the original dataset originate from explicitly noncommercial sources: Evol-Instruct-Code (CC BY-NC-SA 4.0) and SciQ (CC BY-NC 3.0). Other sources have heterogeneous attribution and share-alike obligations.
Public availability of the upstream repository is not a grant of rights.
Before training, redistribution, or commercial use, review the agreement applicable to your account/region/plan and every upstream source license.
See
PROVENANCE.mdfor the detailed provenance and terms notice.
Overview
For this project, the objective was not to preserve the entire original distribution. Instead, the dataset was filtered to create a smaller and more focused training corpus for a student model where training compute and training time are limited.
The final dataset contains:
| Particulars | Original | Final |
|---|---|---|
| Examples | 49,772 | 21,402 |
| Completion tokens | 47,646,032 | 15,526,829 |
| Rows retained | 100% | 43.00% |
| Tokens retained | 100% | 32.59% |
The filtering therefore removes 57.00% of the examples and 67.41% of the completion tokens while increasing the measured quality of the retained data:
| Metric | Original | Final | Change |
|---|---|---|---|
| Row-weighted quality | 8.5923 | 9.0315 | +0.4392 |
| Token-weighted quality | 8.1170 | 8.9981 | +0.8810 |
The quality score is a heuristic quality indicator, not a guarantee of factual correctness.
Why was this dataset filtered?
The original dataset is a broad mixture intended to cover multiple capabilities. For this project, the intended student model is focused more heavily on coding, reasoning, instruction following, and tool use.
Training on the entire dataset would require approximately 47.6 million completion tokens.
Instead, the filtering process was designed to:
- Remove the entire math domain.
- Remove low-quality core code/reasoning examples.
- Remove easy core examples.
- Apply separate quality thresholds to instruction-following data.
- Apply a separate quality threshold to tool-use data.
- Preserve useful examples from the smaller instruction and tool-use domains.
- Reduce the overall training-token requirement.
- Increase the concentration of higher-scoring examples.
The final dataset contains 21,402 examples and 15.53 million completion tokens.
Why was mathematics excluded?
Mathematics was deliberately excluded from this derivative dataset.
The original dataset contains 16,597 math examples, representing approximately 33.3% of the complete dataset.
Math is also responsible for approximately 12.88 million completion tokens in the original dataset.
The purpose of this derivative is to concentrate training on the capabilities currently targeted by the project:
- Coding
- General reasoning
- Instruction following
- Tool use
Keeping the math data would substantially increase the amount of training work while allocating a large portion of the training corpus to a capability that is not the primary focus of this particular training run.
What we gain by excluding math
- A substantially smaller training corpus.
- Lower total training-token requirements.
- Less training compute.
- Less training time.
- A greater concentration of coding and reasoning examples.
- More training capacity devoted to the intended target capabilities.
What we lose by excluding math
This is an intentional trade-off.
Removing all math examples means the resulting dataset provides substantially less direct mathematical supervision.
Potentially reduced coverage includes:
- Mathematical problem solving.
- Symbolic manipulation.
- Mathematical reasoning patterns.
- Math-specific chain-of-thought examples.
- Math benchmark-style problem solving.
Therefore, this dataset should not be considered a math-oriented training dataset.
The exclusion of math is a specialization decision for this particular training objective, not a claim that mathematical data is inherently undesirable.
Filtering methodology
The original dataset was first analyzed to establish its domain, quality, difficulty, token, and source distributions. We then tested different quality thresholds and applied separate filters to each relevant domain.
For the final dataset:
- Math was excluded entirely.
- Code and reasoning were limited to medium/hard examples with
quality_score >= 8.4. - Instruction-following examples were retained at
quality_score >= 7.5. - Tool-use examples were retained at
quality_score >= 6.5. - The original train/validation/test boundaries were preserved.
- Each split was deterministically shuffled with seed
3407.
The final result is a smaller dataset of 21,402 examples and 15.53M completion tokens, focused on coding, reasoning, instruction following, and tool use.
Python scripts
original-dataset-analsis.py
Analyzes the original dataset and reports its:
- Domain distribution
- Difficulty distribution
- Quality distribution
- Completion-token statistics
- Source distribution
- Train/validation/test split sizes
- Per-domain quality and token statistics
This establishes the baseline used for filtering.
filter-original-dataset.py
Applies the final filtering strategy to the original dataset.
It:
- Excludes math.
- Filters code/reasoning by domain, difficulty, and quality.
- Applies separate thresholds to instruction and tool-use data.
- Preserves the original dataset splits.
- Shuffles each split with seed
3407. - Saves the filtered Parquet files and dataset summary.
analyze-pruned-dataset.py
Analyzes the resulting filtered dataset and compares it against the original dataset.
It verifies:
- Examples retained/removed
- Tokens retained/removed
- Quality changes
- Token-length statistics
- Final domain distribution
- Final dataset statistics
- Downloads last month
- 194