Datasets:
Add verified Python TACO v3 pilot part 3/5 (2 rows)
Browse filesPinned-source tests plus independent oracles; synthetic reviewed solution summaries; exact Qwen2.5-Coder full-chat token counts. Legacy data preserved.
- curation/v3/manifest.json +58 -8
- data/16k_context/taco_v3_pilot_003.jsonl +2 -0
- verification/taco_v3/00025.cases.json.gz +0 -0
- verification/taco_v3/00025.execution.json.gz +0 -0
- verification/taco_v3/00025.source.json.gz +0 -0
- verification/taco_v3/00026.cases.json.gz +0 -0
- verification/taco_v3/00026.execution.json.gz +0 -0
- verification/taco_v3/00026.source.json.gz +0 -0
curation/v3/manifest.json
CHANGED
|
@@ -11,21 +11,22 @@
|
|
| 11 |
"upload_complete": false,
|
| 12 |
"uploaded_parts": [
|
| 13 |
1,
|
| 14 |
-
2
|
|
|
|
| 15 |
],
|
| 16 |
"planned_parts": 5,
|
| 17 |
-
"new_rows_uploaded":
|
| 18 |
-
"new_under_or_equal_16k":
|
| 19 |
"new_above_16k": 0,
|
| 20 |
"legacy_rows_preserved_not_reaudited": 15,
|
| 21 |
-
"source_tests_per_final_version":
|
| 22 |
-
"supplemental_tests_per_final_version":
|
| 23 |
-
"final_successful_test_case_executions":
|
| 24 |
"test_case_definition": "One function invocation or one stdin program run; a stdin case may contain multiple queries. Repeated source inputs are not misrepresented as unique tests.",
|
| 25 |
"repairs_of_failing_code": 0,
|
| 26 |
-
"code_refactored_for_clarity":
|
| 27 |
"source_expected_answers_changed": false,
|
| 28 |
-
"token_count_min":
|
| 29 |
"token_count_max": 524,
|
| 30 |
"records": [
|
| 31 |
{
|
|
@@ -55,6 +56,20 @@
|
|
| 55 |
"tokens": 401,
|
| 56 |
"bucket": "16k_context",
|
| 57 |
"tests_passed": 121
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 58 |
}
|
| 59 |
],
|
| 60 |
"files": [
|
|
@@ -143,6 +158,11 @@
|
|
| 143 |
"bytes": 17310,
|
| 144 |
"sha256": "7afa5706f92c61d4c0db9fa78ebd9cf5358d021677b0c7676b69e160910e3dc9"
|
| 145 |
},
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 146 |
{
|
| 147 |
"path": "data/above_16k/README_v3.md",
|
| 148 |
"bytes": 300,
|
|
@@ -217,6 +237,36 @@
|
|
| 217 |
"path": "verification/taco_v3/00014.source.json.gz",
|
| 218 |
"bytes": 1232,
|
| 219 |
"sha256": "37d187264a49e358b1ee369bde7ac0cb4b031355b219bbb03c2a4a6d6bc5594e"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 220 |
}
|
| 221 |
],
|
| 222 |
"notes": [
|
|
|
|
| 11 |
"upload_complete": false,
|
| 12 |
"uploaded_parts": [
|
| 13 |
1,
|
| 14 |
+
2,
|
| 15 |
+
3
|
| 16 |
],
|
| 17 |
"planned_parts": 5,
|
| 18 |
+
"new_rows_uploaded": 6,
|
| 19 |
+
"new_under_or_equal_16k": 6,
|
| 20 |
"new_above_16k": 0,
|
| 21 |
"legacy_rows_preserved_not_reaudited": 15,
|
| 22 |
+
"source_tests_per_final_version": 210,
|
| 23 |
+
"supplemental_tests_per_final_version": 545,
|
| 24 |
+
"final_successful_test_case_executions": 755,
|
| 25 |
"test_case_definition": "One function invocation or one stdin program run; a stdin case may contain multiple queries. Repeated source inputs are not misrepresented as unique tests.",
|
| 26 |
"repairs_of_failing_code": 0,
|
| 27 |
+
"code_refactored_for_clarity": 6,
|
| 28 |
"source_expected_answers_changed": false,
|
| 29 |
+
"token_count_min": 332,
|
| 30 |
"token_count_max": 524,
|
| 31 |
"records": [
|
| 32 |
{
|
|
|
|
| 56 |
"tokens": 401,
|
| 57 |
"bucket": "16k_context",
|
| 58 |
"tests_passed": 121
|
| 59 |
+
},
|
| 60 |
+
{
|
| 61 |
+
"id": "taco-train-d593ed0a2bec-000025-v3",
|
| 62 |
+
"source_row": 25,
|
| 63 |
+
"tokens": 332,
|
| 64 |
+
"bucket": "16k_context",
|
| 65 |
+
"tests_passed": 107
|
| 66 |
+
},
|
| 67 |
+
{
|
| 68 |
+
"id": "taco-train-d593ed0a2bec-000026-v3",
|
| 69 |
+
"source_row": 26,
|
| 70 |
+
"tokens": 514,
|
| 71 |
+
"bucket": "16k_context",
|
| 72 |
+
"tests_passed": 197
|
| 73 |
}
|
| 74 |
],
|
| 75 |
"files": [
|
|
|
|
| 158 |
"bytes": 17310,
|
| 159 |
"sha256": "7afa5706f92c61d4c0db9fa78ebd9cf5358d021677b0c7676b69e160910e3dc9"
|
| 160 |
},
|
| 161 |
+
{
|
| 162 |
+
"path": "data/16k_context/taco_v3_pilot_003.jsonl",
|
| 163 |
+
"bytes": 17293,
|
| 164 |
+
"sha256": "e99880c37de3c4883571551e72190b8729dc2d6b9056873991ec873ca3831e4a"
|
| 165 |
+
},
|
| 166 |
{
|
| 167 |
"path": "data/above_16k/README_v3.md",
|
| 168 |
"bytes": 300,
|
|
|
|
| 237 |
"path": "verification/taco_v3/00014.source.json.gz",
|
| 238 |
"bytes": 1232,
|
| 239 |
"sha256": "37d187264a49e358b1ee369bde7ac0cb4b031355b219bbb03c2a4a6d6bc5594e"
|
| 240 |
+
},
|
| 241 |
+
{
|
| 242 |
+
"path": "verification/taco_v3/00025.cases.json.gz",
|
| 243 |
+
"bytes": 2659,
|
| 244 |
+
"sha256": "e5df1b4e69832e5f188a3040191e93e03d09e7f657c650b59738925240ac35ff"
|
| 245 |
+
},
|
| 246 |
+
{
|
| 247 |
+
"path": "verification/taco_v3/00025.execution.json.gz",
|
| 248 |
+
"bytes": 2913,
|
| 249 |
+
"sha256": "ab3a66f63e49100f549d1cadfd45f7ad1a6f56394debc700f401fe63f475c2e4"
|
| 250 |
+
},
|
| 251 |
+
{
|
| 252 |
+
"path": "verification/taco_v3/00025.source.json.gz",
|
| 253 |
+
"bytes": 1025,
|
| 254 |
+
"sha256": "4ae3156aa8302c1865c0038ba663c2fb37d67704f0ad6f08e1d90168be6d7cde"
|
| 255 |
+
},
|
| 256 |
+
{
|
| 257 |
+
"path": "verification/taco_v3/00026.cases.json.gz",
|
| 258 |
+
"bytes": 4195,
|
| 259 |
+
"sha256": "abaca0b2a9f5a391155ca57b0b2d3339e16c30f35ce254d937afdc92acdfb36f"
|
| 260 |
+
},
|
| 261 |
+
{
|
| 262 |
+
"path": "verification/taco_v3/00026.execution.json.gz",
|
| 263 |
+
"bytes": 3373,
|
| 264 |
+
"sha256": "f501fa4b7a07be28f086d77b4fbfc70dcde1f0f949502011219a3640db64815d"
|
| 265 |
+
},
|
| 266 |
+
{
|
| 267 |
+
"path": "verification/taco_v3/00026.source.json.gz",
|
| 268 |
+
"bytes": 2757,
|
| 269 |
+
"sha256": "7c9e15b81c1097a7ae9736f53214c12ce5c09ffe951cb956a3a4b6e9221b18f1"
|
| 270 |
}
|
| 271 |
],
|
| 272 |
"notes": [
|
data/16k_context/taco_v3_pilot_003.jsonl
ADDED
|
@@ -0,0 +1,2 @@
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"id":"taco-train-d593ed0a2bec-000025-v3","schema_version":"3.0","curation_date":"2026-08-01","title":"Maximum hindsight profit with unlimited single-share trades","language":"python","instruction":"Write a Python function maximum_profit(prices) for a historical list of daily stock prices. I want the best profit that could have been achieved in hindsight with any number of buys and sells, while holding at most one share at a time. Assume no fees, cooldown or short selling; doing no trades is allowed. Return only the profit and leave the list unchanged. There are 1 to 100,000 days with positive integer prices up to 100,000. For [7, 1, 5, 3, 6, 4], the result should be 7.","chain_of_thought":"On any rising stretch, buying at its start and selling at its end earns the sum of its positive adjacent increases. Falling steps should be excluded because selling before the drop and buying afterward cannot reduce profit when fees and cooldowns are absent. Adding every positive day-to-day increase therefore captures all profitable stretches without overlapping holdings. Flat or decreasing lists produce zero profit. The scan takes O(N) time and O(1) auxiliary space.","code":"def maximum_profit(prices: list[int]) -> int:\n return sum(\n max(0, prices[day] - prices[day - 1])\n for day in range(1, len(prices))\n )\n","doc":"Computes a hindsight optimum for the stated simplified trading rules, not a forecast. Its result would not generally apply unchanged if fees, limited trades or cooldowns were added.","messages":[{"role":"system","content":"You are a helpful Python coding assistant."},{"role":"user","content":"Write a Python function maximum_profit(prices) for a historical list of daily stock prices. I want the best profit that could have been achieved in hindsight with any number of buys and sells, while holding at most one share at a time. Assume no fees, cooldown or short selling; doing no trades is allowed. Return only the profit and leave the list unchanged. There are 1 to 100,000 days with positive integer prices up to 100,000. For [7, 1, 5, 3, 6, 4], the result should be 7."},{"role":"assistant","content":"### Approach\nOn any rising stretch, buying at its start and selling at its end earns the sum of its positive adjacent increases. Falling steps should be excluded because selling before the drop and buying afterward cannot reduce profit when fees and cooldowns are absent. Adding every positive day-to-day increase therefore captures all profitable stretches without overlapping holdings. Flat or decreasing lists produce zero profit. The scan takes O(N) time and O(1) auxiliary space.\n\n### Python\n```python\ndef maximum_profit(prices: list[int]) -> int:\n return sum(\n max(0, prices[day] - prices[day - 1])\n for day in range(1, len(prices))\n )\n```\n\n### Notes\nComputes a hindsight optimum for the stated simplified trading rules, not a forecast. Its result would not generally apply unchanged if fees, limited trades or cooldowns were added."}],"source":{"dataset":"BAAI/TACO","url":"https://huggingface.co/datasets/BAAI/TACO","revision":"d593ed0a2becbbc952230bb89be09189bf1056dc","split":"train","config":"ALL","shard":"ALL/train-00000-of-00009.parquet","row_index":25,"selected_solution_index":1,"problem_source":"geeksforgeeks","problem_url":"https://practice.geeksforgeeks.org/problems/buy-stock-2/1","difficulty":"MEDIUM","question_sha256":"7886af1af9774957789a375e6f8d3ed9bec05a3c978d0a5d5d6dc198d43d6410","original_code_sha256":"5b632751550e1a28ece204da14fdd6501221243511ba023408bb39bc3434c3c2","final_code_sha256":"a4e1d25ae5dac1217eabbd58dfd4c4cadeaefa0da1ab34d41c9cd476efe5be07","original_tests_blob_sha256":"8cc0b4a22d0990bbe6bf4fd51c8eaeb1dfbb1a119c5ed4b09b33b3f51f7080af","source_snapshot_path":"verification/taco_v3/00025.source.json.gz","source_snapshot_sha256":"4ae3156aa8302c1865c0038ba663c2fb37d67704f0ad6f08e1d90168be6d7cde","license_notice_path":"LICENSES/NOTICE.md","license_scope":"Upstream dataset card: Apache-2.0 plus MIT/CC-BY-4.0 and other source-specific terms; no blanket relicensing or independent per-source legal clearance claimed."},"annotations":{"instruction_is_synthetic":true,"rationale_type":"synthetic_solution_summary","source_rationale_present":false,"rationale_added":true,"author":"Qwen assistant, this conversation; exact serving-model version and parameter count not supplied","human_reviewed":false,"external_llm_judge_used":false,"code_changes":["Simplified the selected positive-difference implementation.","Removed redundant n parameter, index bookkeeping and judge wrapper.","Clarified the trading assumptions under which the formula is valid."],"contract_note":"Same unlimited-transactions optimization; explicit hindsight interpretation and unchanged input."},"tests":{"artifact_path":"verification/taco_v3/00025.cases.json.gz","artifact_sha256":"e5df1b4e69832e5f188a3040191e93e03d09e7f657c650b59738925240ac35ff","execution_mode":"call","entry_point":"maximum_profit","source_tests":1,"unique_source_inputs":1,"supplemental_tests":106,"supplemental_seed":20260826,"source_adapter":"parse labelled n/prices; verify n, omit redundant n for final call","comparison":"exact typed JSON result","source_expected_answers_changed":false,"vectors_are_training_text":false},"verification":{"status":"passed","python_version":"3.11.2","original_source_tests_passed":1,"final_tests_total":107,"final_tests_passed":107,"final_tests_failed":0,"test_log_path":"verification/taco_v3/00025.execution.json.gz","test_log_sha256":"ab3a66f63e49100f549d1cadfd45f7ad1a6f56394debc700f401fe63f475c2e4","sandbox":"fresh Python interpreter; empty chroot; uid/gid 65534; no_new_privs; seccomp network/process denial; resource limits","resource_limits":{"cpu_soft_seconds":3,"cpu_hard_seconds":4,"wall_seconds":6,"address_space_mib":256,"output_file_mib":4},"repair_attempts":0,"maximum_repair_attempts":2,"refactored":true,"known_wrong_negative_control_rejected":true,"contract_checks":{"known_wrong_zero_solution_rejected":true,"case_id":"source-0000","input_not_mutated":true},"code_sha256":"a4e1d25ae5dac1217eabbd58dfd4c4cadeaefa0da1ab34d41c9cd476efe5be07"},"quality":{"decision":"accepted","topics":["sequence optimization","greedy accounting"],"instruction_review":"assistant-reviewed: realistic synthetic goal/interface request, constraints retained, no prescribed solution technique","rationale_review":"assistant-reviewed: concise algorithm summary, correctness justification, edge cases and complexity agree with final code","duplicate_check":"No matching legacy source index or exact code hash among the checked rows; selected task semantics also reviewed in this pilot.","limitations":["Finite tests and assistant review are not a proof of correctness for all inputs.","No independent human or external-model review has been performed.","No comprehensive cross-benchmark or semantic decontamination has been completed.","Source provided only a few sample tests; independent oracle and boundary tests supplement but do not replace a private judge."]},"token_counts":{"tokenizer_id":"Qwen/Qwen2.5-Coder-7B-Instruct","tokenizer_revision":"c03e6d358207e414f1eca0bb1891e29f1db0e242","training_total":332,"limit":16384,"training_field":"messages","method":"apply_chat_template(tokenize=True, add_generation_prompt=False)","chat_template_sha256":"cd8e9439f0570856fd70470bf8889ebd8b5d1107207f67a5efb46e342330527f","rendered_training_text_sha256":"a5f8a5c9fd8e19eba987bcffd7eccc706d7e473688db99bfff8e6fcc4fe79667","field_counts_not_additive":{"instruction":128,"chain_of_thought":86,"code":47,"doc":34},"audit_metadata_excluded":true,"transformers_version":"4.57.6","tokenizers_version":"0.22.2"},"context_bucket":"16k_context"}
|
| 2 |
+
{"id":"taco-train-d593ed0a2bec-000026-v3","schema_version":"3.0","curation_date":"2026-08-01","title":"Longest strictly nestable chain from two doll collections","language":"python","instruction":"I have two collections of nesting dolls and want to find the longest single chain I can make using dolls from either collection. A doll fits inside another only when both its height and radius are strictly smaller; equal heights or equal radii do not fit. Please write a Python stdin program. Each dataset gives n, then n lines of height and radius, then m and another m such lines. A line containing 0 in place of n ends the input. Each collection has 1 to 100 dolls, dimensions are positive integers below 1,000, and no two dolls have identical dimensions. Print the largest possible number of dolls in one chain for each dataset.","chain_of_thought":"Combine the two collections and order dolls by increasing height. For equal heights, put larger radii first so that a strictly increasing sequence of radii cannot mistakenly use two dolls of the same height. Maintain the smallest possible ending radius for each achievable chain length; replacing the first ending radius that is at least the current radius keeps future extensions possible without allowing equal radii to extend a chain. The number of maintained endings is the maximum chain length. For M dolls, sorting and updates take O(M log M) time and O(M) auxiliary space.","code":"from bisect import bisect_left\nimport sys\n\n\ndef longest_chain(dolls: list[tuple[int, int]]) -> int:\n endings = []\n for height, radius in sorted(dolls, key=lambda doll: (doll[0], -doll[1])):\n position = bisect_left(endings, radius)\n if position == len(endings):\n endings.append(radius)\n else:\n endings[position] = radius\n return len(endings)\n\n\ndef main() -> None:\n values = iter(map(int, sys.stdin.buffer.read().split()))\n for first_count in values:\n if first_count == 0:\n break\n dolls = [(next(values), next(values)) for _ in range(first_count)]\n second_count = next(values)\n dolls.extend((next(values), next(values)) for _ in range(second_count))\n print(longest_chain(dolls))\n\n\nif __name__ == \"__main__\":\n main()\n","doc":"Uses both collections together and reports a chain length per input dataset. The strict comparisons in both dimensions are essential; merely sorting height and radius in the same ascending order would mishandle equal heights.","messages":[{"role":"system","content":"You are a helpful Python coding assistant."},{"role":"user","content":"I have two collections of nesting dolls and want to find the longest single chain I can make using dolls from either collection. A doll fits inside another only when both its height and radius are strictly smaller; equal heights or equal radii do not fit. Please write a Python stdin program. Each dataset gives n, then n lines of height and radius, then m and another m such lines. A line containing 0 in place of n ends the input. Each collection has 1 to 100 dolls, dimensions are positive integers below 1,000, and no two dolls have identical dimensions. Print the largest possible number of dolls in one chain for each dataset."},{"role":"assistant","content":"### Approach\nCombine the two collections and order dolls by increasing height. For equal heights, put larger radii first so that a strictly increasing sequence of radii cannot mistakenly use two dolls of the same height. Maintain the smallest possible ending radius for each achievable chain length; replacing the first ending radius that is at least the current radius keeps future extensions possible without allowing equal radii to extend a chain. The number of maintained endings is the maximum chain length. For M dolls, sorting and updates take O(M log M) time and O(M) auxiliary space.\n\n### Python\n```python\nfrom bisect import bisect_left\nimport sys\n\n\ndef longest_chain(dolls: list[tuple[int, int]]) -> int:\n endings = []\n for height, radius in sorted(dolls, key=lambda doll: (doll[0], -doll[1])):\n position = bisect_left(endings, radius)\n if position == len(endings):\n endings.append(radius)\n else:\n endings[position] = radius\n return len(endings)\n\n\ndef main() -> None:\n values = iter(map(int, sys.stdin.buffer.read().split()))\n for first_count in values:\n if first_count == 0:\n break\n dolls = [(next(values), next(values)) for _ in range(first_count)]\n second_count = next(values)\n dolls.extend((next(values), next(values)) for _ in range(second_count))\n print(longest_chain(dolls))\n\n\nif __name__ == \"__main__\":\n main()\n```\n\n### Notes\nUses both collections together and reports a chain length per input dataset. The strict comparisons in both dimensions are essential; merely sorting height and radius in the same ascending order would mishandle equal heights."}],"source":{"dataset":"BAAI/TACO","url":"https://huggingface.co/datasets/BAAI/TACO","revision":"d593ed0a2becbbc952230bb89be09189bf1056dc","split":"train","config":"ALL","shard":"ALL/train-00000-of-00009.parquet","row_index":26,"selected_solution_index":3,"problem_source":"aizu","problem_url":null,"difficulty":"UNKNOWN_DIFFICULTY","question_sha256":"afe65974c754f8ca6224cce76e7ed475e417d7289c3dbf9c561215d59fab5f31","original_code_sha256":"48a33e52be0102df6d7f37252d1c639fbe5c93a93074435fa1d3b1a5ffa0eef6","final_code_sha256":"aebcec51a8d442d842887f64c4767d26ba04ade72a288144e3c01563a135b2a4","original_tests_blob_sha256":"97250ab09ee9e863bea0423286dc6e7788e7bcc0915d07561abc39d3eeab2c87","source_snapshot_path":"verification/taco_v3/00026.source.json.gz","source_snapshot_sha256":"7c9e15b81c1097a7ae9736f53214c12ce5c09ffe951cb956a3a4b6e9221b18f1","license_notice_path":"LICENSES/NOTICE.md","license_scope":"Upstream dataset card: Apache-2.0 plus MIT/CC-BY-4.0 and other source-specific terms; no blanket relicensing or independent per-source legal clearance claimed."},"annotations":{"instruction_is_synthetic":true,"rationale_type":"synthetic_solution_summary","source_rationale_present":false,"rationale_added":true,"author":"Qwen assistant, this conversation; exact serving-model version and parameter count not supplied","human_reviewed":false,"external_llm_judge_used":false,"code_changes":["Replaced quadratic subsequence scanning with logarithmic ending-radius updates.","Preserved descending-radius ordering for equal heights.","Separated chain calculation from the original two-collection input protocol."],"contract_note":"Same explicit dimensional constraints and stdin protocol; decorative source illustration is not required."},"tests":{"artifact_path":"verification/taco_v3/00026.cases.json.gz","artifact_sha256":"abaca0b2a9f5a391155ca57b0b2d3339e16c30f35ce254d937afdc92acdfb36f","execution_mode":"stdin","entry_point":null,"source_tests":101,"unique_source_inputs":101,"supplemental_tests":96,"supplemental_seed":20260827,"source_adapter":"unchanged source stdin and expected text","comparison":"exact whitespace-token equality; no numeric tolerance","source_expected_answers_changed":false,"vectors_are_training_text":false},"verification":{"status":"passed","python_version":"3.11.2","original_source_tests_passed":101,"final_tests_total":197,"final_tests_passed":197,"final_tests_failed":0,"test_log_path":"verification/taco_v3/00026.execution.json.gz","test_log_sha256":"f501fa4b7a07be28f086d77b4fbfc70dcde1f0f949502011219a3640db64815d","sandbox":"fresh Python interpreter; empty chroot; uid/gid 65534; no_new_privs; seccomp network/process denial; resource limits","resource_limits":{"cpu_soft_seconds":3,"cpu_hard_seconds":4,"wall_seconds":6,"address_space_mib":256,"output_file_mib":4},"repair_attempts":0,"maximum_repair_attempts":2,"refactored":true,"known_wrong_negative_control_rejected":true,"contract_checks":{"known_wrong_zero_solution_rejected":true,"case_id":"source-0000"},"code_sha256":"aebcec51a8d442d842887f64c4767d26ba04ade72a288144e3c01563a135b2a4"},"quality":{"decision":"accepted","topics":["two-dimensional ordering","subsequences"],"instruction_review":"assistant-reviewed: realistic synthetic goal/interface request, constraints retained, no prescribed solution technique","rationale_review":"assistant-reviewed: concise algorithm summary, correctness justification, edge cases and complexity agree with final code","duplicate_check":"No matching legacy source index or exact code hash among the checked rows; selected task semantics also reviewed in this pilot.","limitations":["Finite tests and assistant review are not a proof of correctness for all inputs.","No independent human or external-model review has been performed.","No comprehensive cross-benchmark or semantic decontamination has been completed."]},"token_counts":{"tokenizer_id":"Qwen/Qwen2.5-Coder-7B-Instruct","tokenizer_revision":"c03e6d358207e414f1eca0bb1891e29f1db0e242","training_total":514,"limit":16384,"training_field":"messages","method":"apply_chat_template(tokenize=True, add_generation_prompt=False)","chat_template_sha256":"cd8e9439f0570856fd70470bf8889ebd8b5d1107207f67a5efb46e342330527f","rendered_training_text_sha256":"265716cb7d640fa1ee726a4d3e127fcaf18f31db81d2987d2cea6c00386a807a","field_counts_not_additive":{"instruction":137,"chain_of_thought":109,"code":193,"doc":38},"audit_metadata_excluded":true,"transformers_version":"4.57.6","tokenizers_version":"0.22.2"},"context_bucket":"16k_context"}
|
verification/taco_v3/00025.cases.json.gz
ADDED
|
Binary file (2.66 kB). View file
|
|
|
verification/taco_v3/00025.execution.json.gz
ADDED
|
Binary file (2.91 kB). View file
|
|
|
verification/taco_v3/00025.source.json.gz
ADDED
|
Binary file (1.03 kB). View file
|
|
|
verification/taco_v3/00026.cases.json.gz
ADDED
|
Binary file (4.2 kB). View file
|
|
|
verification/taco_v3/00026.execution.json.gz
ADDED
|
Binary file (3.37 kB). View file
|
|
|
verification/taco_v3/00026.source.json.gz
ADDED
|
Binary file (2.76 kB). View file
|
|
|