Datasets:
id stringlengths 30 95 | set stringclasses 1
value | title stringclasses 10
values | text stringlengths 421 5.73k | origin stringclasses 1
value | source_dataset stringclasses 10
values | domain stringclasses 4
values | term_hits int64 0 0 | term_categories stringclasses 1
value | swe_hits int64 0 0 | swe_terms stringclasses 1
value | vea_verdict float64 0 0 | n_chunks int64 1 4 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
ctl_dolci_instruct/allenai/flan_v2_converted_tmp_ids_3772 | ctl_dolci_instruct | FLAN (Other) | User: Q: Given a command in a limited form of natural language, provide the correct sequence of actions that executes the command to thus navigate an agent in its environment. A command can be broken down into many different actions. Actions are uppercase and are individual steps that serve as the building blocks for a... | allenai/Dolci-Instruct-SFT | FLAN | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/personas_math_zc4hdjt0vl4pxqvj9n4r7m2h | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: A literary critic, known for dismissing the Madam Tulip series as shallow and predictable, is analyzing the sales patterns of the book series over several years. She finds that the annual sales \( S(t) \), in thousands, of the series \( t \) years after its first publication follows a polynomial function given by... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_0yhmt08nep1mf55ohyhhwc4x | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: The owner of a metaphysical bookstore has a unique way of organizing her collection of tarot books. She arranges the books into mystical pyramids, where each level of the pyramid has one less book than the level below it. The bottom level of the pyramid contains \( n \) books, and the pyramid has \( k \) levels.
... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_cmwpx6cbogm8mf4uiwre1kbg | ctl_dolci_instruct | Tulu 3 Persona MATH (Math) | User: Math problem:
As a newbie programmer working on developing a new Roblox game using Lua, you decide to implement a feature where players can spawn items in a procedurally generated 3D grid world. The grid is defined by a cubic space with side length \( n \), where each unit cube in the grid can hold one item.
... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona MATH | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/flan_v2_converted_tmp_ids_76072 | ctl_dolci_instruct | FLAN (Other) | User: Detailed Instructions: In this task, you need to reverse all words of a given length in the sentence. The number of letters in a word determine its length. For example, the length of the word "apple" is 5.
See one example below:
Problem: Sentence: 'as a guy jumps over the snow with his snowboard people riding on ... | allenai/Dolci-Instruct-SFT | FLAN | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_4245 | ctl_dolci_instruct | TableGPT (Other) | User: Description: Discover the columns in Table B that match with those in Table A. For each column present in Table A, specify the corresponding column present in Table B. If a column in Table A doesn't have a corresponding column in Table B, you can represent it as None. Use pairs of column headers in a list format,... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/flan_v2_converted_tmp_ids_8799 | ctl_dolci_instruct | FLAN (Other) | User: Part 1. Definition
A text is given in Bengali. Translate it from the Bengali language to the Gujarati language. The translation must not omit or add information to the original sentence.
Part 2. Example
প্রিয় দেশবাসী, ২০১৪ সালে এই লাল কেল্লার প্রাকার থেকে যখন আমি স্বচ্ছতার কথা বলেছিলাম, তখন কিছু মানুষ এই নিয়ে প... | allenai/Dolci-Instruct-SFT | FLAN | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/personas_math_easy_9b1m2xoz7dxs3nj3zytocgi8 | ctl_dolci_instruct | Tulu 3 Persona GSM (Math) | User: Dr. Melody, a historian specializing in political revolutions, is organizing a series of educational events showcasing the role of music in resistance movements throughout history. She plans to hold 5 events, each featuring 3 different revolutionary songs. For each event, she expects an audience of 60 people. If ... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona GSM | Math | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/personas_math_easy_4mj20wa7vqh8c5f28u02b9j1 | ctl_dolci_instruct | Tulu 3 Persona GSM (Math) | User: Zala is a Kurdish woman who has lived in Ortabağ all her life. She has a small garden where she grows tomatoes, cucumbers, and peppers. This year, Zala harvested 45 tomatoes, 30 cucumbers, and 25 peppers. She wants to make some traditional Kurdish salads to share with her neighbors. Each salad requires 3 tomatoes... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona GSM | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_4243 | ctl_dolci_instruct | TableGPT (Other) | User: Task: The missing value in the input table, indicated by '[MISSING]', should be supplied by you. Please only provide the value filled in, not the entire table. Return the final result as JSON in the format {"value": "<value filled in>"}.
[Q]:
|Name|Age|No|Constituency|
|---|---|---|---|
|P. Mahender Reddy|nan|8|... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_3651 | ctl_dolci_instruct | TableGPT (Other) | User: Description: Kindly go through the input table and inform me about any cell or cells that are incorrect. Should there be multiple incorrect cells, compile a list. If no cells are incorrect, respond with 'None'. Share only the cells that you are highly confident are erroneous. Return the final result as JSON in th... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 3 | ||
ctl_dolci_instruct/personas_math_easy_0fapxizd744bjvtm6vvsppna | ctl_dolci_instruct | Tulu 3 Persona GSM (Math) | User: A Croatian botanist is studying the growth patterns of two native plant species in a protected national park. The first plant species grows at a rate of 3 centimeters per week, while the second plant species grows at a rate of 5 centimeters per week. If the botanist plants 7 of the first species and 4 of the seco... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona GSM | Math | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_open_math_2_gsm8k_50k_tmp_ids_33256 | ctl_dolci_instruct | OpenMathInstruct 2 (Math) | User: Carla is dividing up chores for her two kids, Anna and Billy. She wants each of them to spend the same number of minutes working. Sweeping takes 3 minutes per room, washing the dishes takes 2 minutes per dish, and doing laundry takes 9 minutes per load. If Anna does the sweeping for 10 rooms and Billy does two lo... | allenai/Dolci-Instruct-SFT | OpenMathInstruct 2 | Math | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/personas_math_cwusyde1gogap2axkc95fnyj | ctl_dolci_instruct | Tulu 3 Persona MATH (Math) | User: Professor Emily, a university professor in history, is examining a famous family lineage from the 16th century. She disputes the genealogist's findings based on historical inconsistencies she has uncovered. To support her argument, she decides to model the family tree using graph theory and statistical analysis.
... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona MATH | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/puzzle_data_160k-ngram-filtered_tmp_ids_127101 | ctl_dolci_instruct | Logic Puzzles (Other) | User: This is a logic puzzle. There are 5 houses (numbered 1 on the left, 5 on the right), from the perspective of someone standing across the street from them. Each has a different person in them. They have different characteristics:
- Each person has a unique name: `alice`, `carol`, `arnold`, `david`, `bob`
- The p... | allenai/Dolci-Instruct-SFT | Logic Puzzles | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/personas_math_y1fycmys2zhpbc5pxiv2pfem | ctl_dolci_instruct | Tulu 3 Persona MATH (Math) | User: The local print media owner, Alex, is considering collaborating with a rival start-up to maximize the combined revenue from their respective markets. Alex's company currently has a market share represented by the function \( A(t) = 20 + 5t \) percent, where \( t \) is the number of months from now. The start-up's... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona MATH | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_8tz2d3itytds3kihgm49gfm2 | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: A stay-at-home parent is testing two new pet food brands, Brand A and Brand B, for their pet cat. They are trying to determine the best blend to ensure a balanced diet for their pet. Brand A contains 30% protein and Brand B contains 20% protein. The parent wants to create a mix that results in a 25% protein blend... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_4214 | ctl_dolci_instruct | TableGPT (Other) | User: Objective: Please create a new row for the input table and append it at the bottom. Show the resulting table with the newly added row.
## Input:
|task_sla|start|end|task_sla.task.priority|Diff in Hours|Diff in Minutes|Sum of working hours (Days)|
|---|---|---|---|---|---|---|
|Priority 3 response (2 hour)|2019-0... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 3 | ||
ctl_dolci_instruct/personas_math_3tx3k2b3vd8t4olbv3bxw6o5 | ctl_dolci_instruct | Tulu 3 Persona MATH (Math) | User: A cyclist relies on clear weather for a smooth and enjoyable ride. Let's define the function \( W(t) \) to represent the probability of clear weather on day \( t \) of the year in a particular location. Assume that \( W(t) \) can be modeled as a sinusoidal function due to seasonal weather patterns:
\[ W(t) = \fr... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona MATH | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_c7ik66kn4gm5362r6764s3s3 | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: A livestock farmer is raising free-range chickens and pastured pigs on his farm. The farmer aims to have a total of 100 animals, with the number of chickens being three times the number of pigs.
1. Let \( p \) represent the number of pigs and \( c \) represent the number of chickens. Set up a system of equation... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_5bzvpc3vzj48n2rq1y6rwg53 | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: An ambitious talent show contestant is preparing for a big performance and wants to impress the judges with a song that perfectly showcases their vocal range. They plan to write a song where the number of notes (n) in the song is modeled by a polynomial equation based on their practice hours (h), which is given b... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/OpenThoughts3-full-filtered-science-no-cot-decontam-v2_tmp_ids_73007 | ctl_dolci_instruct | Dolci Instruct OpenThoughts3+ Science (Science) | User: Grignard reagents add to carbonyl compounds. The products, after hydrolysis, are alcohols whose structures depend on that of the starting carbonyl compound. Formaldehyde gives primary alcohols, other aldehydes give secondary alcohols, and ketones give tertiary alcohols. What type of alcohols do other aldehydes gi... | allenai/Dolci-Instruct-SFT | Dolci Instruct OpenThoughts3+ Science | Science | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_easy_hn6zghagb56dpmgshicrpv4b | ctl_dolci_instruct | Tulu 3 Persona GSM (Math) | User: The young family recently moved to a village where the tribal elder shares fascinating stories. One evening, the elder tells a story about an ancient counting system that uses stones. The elder gives the family 15 stones and explains that each story he tells is represented by 3 stones.
If the family attends 4 s... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona GSM | Math | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/OpenThoughts3-full-filtered-science-no-cot-decontam-v2_tmp_ids_85874 | ctl_dolci_instruct | Dolci Instruct OpenThoughts3+ Science (Science) | User: To one litre of 0.1 M-HCl solution, 0.025 mole of solid NH_4Cl is added. Assuming complete dissociation of solutes, the freezing point of solution is (K_f of water = 1.86 K-kg mol^{-1})\n(a) -0.465°C\n(b) -0.93°C\n(c) -0.372°C\n(d) -0.279°C
Assistant: To determine the freezing point of the solution when 0.025 mo... | allenai/Dolci-Instruct-SFT | Dolci Instruct OpenThoughts3+ Science | Science | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/flan_v2_converted_tmp_ids_63663 | ctl_dolci_instruct | FLAN (Other) | User: Come up with a question and stream of consciousness reasoning that would justify this answer: it is not possible to tell
Assistant: The question is: Can we conclude from "A group of five dark-skinned people sitting at what looks to be a farmer's market right behind a fruit that is green and spiky." that "People ... | allenai/Dolci-Instruct-SFT | FLAN | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_567 | ctl_dolci_instruct | TableGPT (Other) | User: Description: Utilize the provided table data and the list of headers that are candidates. Determine the most suitable header for each column in the table, selecting only from the candidate headers list. Share the chosen column headers within a list format. Return the final result as JSON in the format {"column_he... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/OpenThoughts3-full-filtered-science-no-cot-decontam-v2_tmp_ids_96065 | ctl_dolci_instruct | Dolci Instruct OpenThoughts3+ Science (Science) | User: Let's say I have a system with two degrees of freedom and I can find two independent action variables. One action variable is total energy expression, such as is often used in classical mechanics.
$$E(p,q) = T(p,q) + V(p,q)$$
where $T$ is kinetic energy and $V$ is potential energy.
In $(p,q)$ coordinates, the Ha... | allenai/Dolci-Instruct-SFT | Dolci Instruct OpenThoughts3+ Science | Science | 0 | 0 | 0 | 4 | ||
ctl_dolci_instruct/allenai/OpenThoughts3-full-filtered-science-no-cot-decontam-v2_tmp_ids_1743 | ctl_dolci_instruct | Dolci Instruct OpenThoughts3+ Science (Science) | User: In which type of excitons, tight binding approximation can be applied and why?
Assistant: **Type of Exciton:** Frenkel excitons.
**Why:** The tight binding approximation is applicable to Frenkel excitons because they are **localized excitations** typical of materials like organic semiconductors or molecular cry... | allenai/Dolci-Instruct-SFT | Dolci Instruct OpenThoughts3+ Science | Science | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/science.mslr2022_cochrane_multidoc_summarization.3441 | ctl_dolci_instruct | SciRiff (Science) | User: You will be provided with the titles and abstracts of a collection of medical RCT reports studying a clinical question -- for instance, the efficacy of an intervention on some medical outcome. Please write a few sentences synthesizing the findings of these reports, which could serve as a conclusion section for a ... | allenai/Dolci-Instruct-SFT | SciRiff | Science | 0 | 0 | 0 | 3 | ||
ctl_dolci_instruct/science.bioasq_general_qa.355 | ctl_dolci_instruct | SciRiff (Science) | User: You will be shown a question, followed by excerpts from biomedical research papers. Please answer the question based on the provided context. Do not include any text in your response other than the answer.
Question: What is the role of Thyrotropin Releasing Hormone in the treatment of comatose patients?
Context... | allenai/Dolci-Instruct-SFT | SciRiff | Science | 0 | 0 | 0 | 3 | ||
ctl_dolci_instruct/personas_math_5fnxa75glc83bl2m82gc9lme | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: A young Icelandic football player has recently made headlines by signing with a major European club. As a local sports commentator in Reykjavik, you decide to analyze the player's potential impact on the team by considering two mathematical aspects:
1. The player's performance index, \( P \), is modeled by the q... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_2795 | ctl_dolci_instruct | TableGPT (Other) | User: # Task Description: Please carefully assess the input table and inform me about any cell or cells that are mistaken. If there are multiple mistaken cells, list them. If no cells are mistaken, state 'None'. Only provide the cells that you have a high level of confidence are mistaken. Return the final result as JSO... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_4234 | ctl_dolci_instruct | TableGPT (Other) | User: Instruction: Given a table with inputs and outputs in two columns, your goal is to deduce the patterns between them using the initial rows. Then, calculate the output value for the last row identified as '[Output Value].' Please return only the output value and omit all other information. Return the final result ... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/science.bioasq_yesno_qa.1075 | ctl_dolci_instruct | SciRiff (Science) | User: You have to answer a biomedical question in binary format, i.e. only yes and no are the only acceptable answer formats. A list of paragraphs is provided as context to help you answer the question.
Question: Are Toll-like receptors (TLRs) induced by microbes?
Context: The C-type lectin receptor CLEC4E and Toll-l... | allenai/Dolci-Instruct-SFT | SciRiff | Science | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_open_math_2_gsm8k_50k_tmp_ids_42808 | ctl_dolci_instruct | OpenMathInstruct 2 (Math) | User: Two friends started a joint savings plan for a vacation. One friend contributes $150 every two weeks, while the other friend contributes $100 every two weeks. After 9 months of saving (assume 4 weeks in each month), they decided to use a third of their total savings to book their flights. How much will they have ... | allenai/Dolci-Instruct-SFT | OpenMathInstruct 2 | Math | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/personas_math_kbbi1rxs142s3zzg4qsxgw5m | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: A distributor of arcade machines and equipment is planning to introduce a new series of gaming machines that incorporate cutting-edge virtual reality (VR) technology. The distributor has determined that the cost (in thousands of dollars) to produce x units of these machines is given by the polynomial function \( ... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_nb7ioyr2m23o4fqyhob4f91f | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: The owner of a classic car restoration business is exploring two different online advertising strategies to maximize their reach and engagement.
1. The first strategy involves placing ads on a social media platform that charges a fixed cost of $300 per month plus $2 for every 100 engagements. If the owner wants... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_easy_0ky571z4g4v00cnmu7duondu | ctl_dolci_instruct | Tulu 3 Persona GSM (Math) | User: Jamie is a huge Pixar fan and also loves collecting Vinyl records. Jamie has a collection of 24 Pixar movie soundtracks on Vinyl. Every weekend, Jamie enjoys listening to these soundtracks and has a special routine. On Saturday, Jamie listens to 3 different Pixar soundtracks, and on Sunday, Jamie listens to 2 mor... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona GSM | Math | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/science.medmentions_ner.2629 | ctl_dolci_instruct | SciRiff (Science) | User: You will be shown an abstract from a biomedical research paper. Given this abstract, your task is to extract all unique entities of the following types: ["HealthCareActivity", "InjuryOrPoisoning", "BodySubstance", "IntellectualProduct", "AnatomicalStructure", "SpatialConcept", "Chemical", "Bacterium", "MedicalDev... | allenai/Dolci-Instruct-SFT | SciRiff | Science | 0 | 0 | 0 | 3 | ||
ctl_dolci_instruct/personas_math_easy_2iptbvtmvexzwyr3sa8wmywf | ctl_dolci_instruct | Tulu 3 Persona GSM (Math) | User: Cousin V, a distant relative of the renowned author Kurt Vonnegut, enjoys sharing little-known family stories and anecdotes with the local community. One day, Cousin V decided to hold a storytelling event at the library. She planned to tell 5 stories, each about different members of the Vonnegut family, and with ... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona GSM | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/oasst1_4180 | ctl_dolci_instruct | OpenAssistant (Chat) | User: Please design a PhD research paper around Developing in vitro models to study gut microbiome-starch interactions: While some in vitro models have been developed to study gut microbiome-starch interactions, more research is needed to develop more sophisticated models that more accurately reflect the in vivo enviro... | allenai/Dolci-Instruct-SFT | OpenAssistant | Chat | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_easy_bz2en7kwhu96xqu5ry1hd8ne | ctl_dolci_instruct | Tulu 3 Persona GSM (Math) | User: Sarah is a travel agent who specializes in sports travel, particularly for tennis tournaments. She is helping a parent, Mr. Johnson, plan a trip for his daughter's upcoming tennis tournament. The tournament is taking place in Miami, which is 300 miles away from their home in Orlando.
Mr. Johnson needs to decide... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona GSM | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_open_math_2_gsm8k_50k_tmp_ids_29379 | ctl_dolci_instruct | OpenMathInstruct 2 (Math) | User: Ava is an event planner preparing for a wedding reception. Each glass weighs 6 ounces, and there are four glasses per table setting. Each napkin weighs 2 ounces, and there are three napkins per table setting. If Ava needs to set up 20 tables with 10 settings each, plus 30 extra settings in case of unexpected gues... | allenai/Dolci-Instruct-SFT | OpenMathInstruct 2 | Math | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/personas_math_easy_oj9rhtrjhbtekl2n23pid6ek | ctl_dolci_instruct | Tulu 3 Persona GSM (Math) | User: Raj, a lifetime tenant in Jaipur, Rajasthan, has been living in his current apartment for 15 years. When he first moved in, his monthly rent was ₹7,000. According to his rental agreement, the rent increases by ₹500 every 3 years.
What is Raj's current monthly rent?
Assistant: To determine Raj's current monthly... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona GSM | Math | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_2671 | ctl_dolci_instruct | TableGPT (Other) | User: Task: I'd like your input on this table – can you summarize its contents for me? Return the final result as JSON in the format {"summary": "<summary of table>"}.
Q:
|Tournament|2001|2002|2003|2004|2005|2006|
|---|---|---|---|---|---|---|
|Masters Tournament|DNP|DNP|DNP|DNP|DNP|DNP|
|U.S. Open|DNP|DNP|DNP|DNP|DNP... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/personas_math_x7b9601ap669q14sunuktukx | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: As an engaged citizen of Chamarajanagar district, you are analyzing the voting trends in your community. You find that the number of voters supporting the local Green Party can be modeled by the quadratic equation \( V(x) = -2x^2 + 12x + 50 \), where \( x \) represents the years since 2020.
1. Determine the year... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_fr1byddmcl426fh6tp5hpncp | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: 1. As a sports commentator, you have meticulously recorded the number of goals Derby County F.C. scored over the last \( n \) matches. You noticed that the number of goals scored in each match follows a quadratic pattern, given by the equation \( g(n) = an^2 + bn + c \), where \( a \), \( b \), and \( c \) are co... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_sjq9cqn7snrhjqnuu6oic74m | ctl_dolci_instruct | Tulu 3 Persona MATH (Math) | User: A senior executive, renowned for his strategic vision and mentorship, recognized Clinton's potential and provided him with invaluable guidance and career advice. To model the impact of this mentorship on Clinton's career growth, consider the following scenario:
1. Clinton's career advancement can be represented ... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona MATH | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_lrax5zhxija56fmzh8xs5kbc | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: The CEO of an electric vehicle manufacturer is planning to expand production to meet increasing demand. The company's current production can be modeled by the polynomial function \( P(x) = -2x^3 + 15x^2 + 50x \), where \( P(x) \) represents the number of electric vehicles produced per month, and \( x \) is the nu... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/science.ncbi_ner.531 | ctl_dolci_instruct | SciRiff (Science) | User: You will be shown an abstract from a biomedical research paper. Given this abstract, your task is to extract all unique entities of the following types: ["Disease"].
Please return the output as a JSON object of the format: {"Disease" : ["COVID-19", ...]}. The keys should be entity types and values should be list... | allenai/Dolci-Instruct-SFT | SciRiff | Science | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_g8wub0bdz07ozjy4rvpvt2k5 | ctl_dolci_instruct | Tulu 3 Persona MATH (Math) | User: A successful businesswoman, Ms. Thompson, has decided to allocate a portion of her annual income to support women's sports by investing in team sponsorships and scholarships. She follows a strategic formula to ensure her investments yield maximum impact.
Sub-problem 1:
Ms. Thompson’s annual income, \(I\), is mod... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona MATH | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_open_math_2_gsm8k_50k_tmp_ids_32311 | ctl_dolci_instruct | OpenMathInstruct 2 (Math) | User: Ava has 30 forks in her dining set and three times as many plates as forks. If she purchased 1/4 as many additional forks and 3/4 as many additional plates, what would be the total number of tableware pieces she has in her dining set?
Assistant: Let's break down the information. Ava initially has 30 forks. Since... | allenai/Dolci-Instruct-SFT | OpenMathInstruct 2 | Math | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/flan_v2_converted_tmp_ids_52977 | ctl_dolci_instruct | FLAN (Other) | User: If C is the temperature in degrees Celsins and F is the temperature in degrees Fahrenheit, then the relationship between temperatures on the two scales is expressed by the equation 9C=5(F-32). The temperature to boil water at sea level altitude and to boil on top of Mt. Everest differed by 15 degrees on the Fahre... | allenai/Dolci-Instruct-SFT | FLAN | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/personas_math_h9yc0sm19xk8s4z0hdiv5lib | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: A Zimbabwean professional athlete, who was training to compete in the 2023 World Athletics Championships, noticed a pattern in his weekly running distances. He realized that his weekly distance, \( d \), in kilometers, could be modeled by the quadratic equation \( d = 2t^2 + 3t + 1 \), where \( t \) is the time i... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/OpenThoughts3-full-filtered-science-no-cot-decontam-v2_tmp_ids_41889 | ctl_dolci_instruct | Dolci Instruct OpenThoughts3+ Science (Science) | User: Both Heisenberg ferromagnets and crystalline solids break the rotational symmetry in space. Now consider a crystalline ferromagnetic solid. By virtue of being in a crystalline phase, it already broke the rotational symmetry. Having broken that, how can it further break the rotational symmetry which is already bro... | allenai/Dolci-Instruct-SFT | Dolci Instruct OpenThoughts3+ Science | Science | 0 | 0 | 0 | 3 | ||
ctl_dolci_instruct/personas_math_1mz9z22me4vlml2pjpsakgzf | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: As a manager of information security responsible for developing and implementing security policies on servers, you are tasked with ensuring that the encryption protocols are robust enough to prevent unauthorized access. The security team uses a polynomial function \( P(x) = 2x^3 - 5x^2 + 3x - 7 \) to represent th... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_3979 | ctl_dolci_instruct | TableGPT (Other) | User: Description: Find the corresponding columns between Table A and Table B. Specify the related columns in Table B for each column listed in Table A. If a column in Table A has no corresponding match in Table B, you can represent it as None. Utilize pairs of column headers within a list structure, like [Table A Colu... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 3 | ||
ctl_dolci_instruct/personas_math_gx2f9k4lrjgu8tt0eyh636fr | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: A genealogist specializing in the lineage of Caucasus ethnic groups is analyzing the distribution of certain genetic markers among three different subgroups: Avars, Chechens, and Georgians. The genealogist observes that the expression of a particular genetic marker can be modeled by the polynomial function \( f(x... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_easy_77x4l0oxt4e5eb69f79t5lny | ctl_dolci_instruct | Tulu 3 Persona GSM (Math) | User: A filmmaker is working on a documentary about the impact of radio broadcasting on the local community. During the first week of filming, the filmmaker conducts interviews with 12 local radio hosts. Each interview takes 45 minutes. In addition, the filmmaker spends 30 minutes setting up and 30 minutes packing up e... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona GSM | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_open_math_2_gsm8k_50k_tmp_ids_30906 | ctl_dolci_instruct | OpenMathInstruct 2 (Math) | User: Emily purchased 18 cookies for a total of 4 dollars and 50 cents. She decided to give one-third of the cookies to her brother, Alex, who wanted to pay her back for the shared cookies. How much money, in cents, did Alex give Emily to reimburse her for the cookies he received?
Assistant: To find out how much money... | allenai/Dolci-Instruct-SFT | OpenMathInstruct 2 | Math | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_302 | ctl_dolci_instruct | TableGPT (Other) | User: Objective: Extend the input table by generating a new extra column and placing it to the right. Display the resulting table with the additional column.
Q:
|Australia|Posit.|
|---|---|
|Graham Eadie|1. FB|
|Allan McMahon|2. WG|
|Mick Cronin|3. CE|
|Russel Gartner|4. CE|
|Mark Harris|5. WG|
|John Peard|6. FE|
|Joh... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/personas_math_5tz1qc8294azag2j6vigt0vz | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: A marketing specialist is analyzing the performance of two types of content on a platform: popular content (P) and educational content (E). The success of popular content is modeled by the function \( P(x) = 2x^2 + 3x - 5 \), where \( x \) represents the number of hours invested in creating the content. The succe... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/oasst1_5758 | ctl_dolci_instruct | OpenAssistant (Chat) | User: I want you to act like an assistant for my own website. You should be able to answer questions regarding my skills and experience. I will provide an extensive description of my personal and professional profile. You should respond as if you were myself when you answer. Are you able to do this task?
Assistant: If... | allenai/Dolci-Instruct-SFT | OpenAssistant | Chat | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_1374 | ctl_dolci_instruct | TableGPT (Other) | User: Task: Could you arrange the table by sorting it using column "4" in alphabetical ascending order? Afterward, share the table with the sorted values.
Question:
|Year|Entrants|5|6|7|8|9|10|11|Points|WCC|Chassis|Engines|Tyres|Driver|1|2|3|4|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|-... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 1 | ||
ctl_dolci_instruct/allenai/tulu_v3.9_table_gpt_5k_tmp_ids_2568 | ctl_dolci_instruct | TableGPT (Other) | User: Description: Determine the matchings between columns in Table A and Table B. Indicate the relevant columns from Table B for each column present in Table A. If a column from Table A doesn't have a match in Table B, you can represent it as None. Use pairs of column headers in a list format, such as [Table A Column,... | allenai/Dolci-Instruct-SFT | TableGPT | Other | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/allenai/flan_v2_converted_tmp_ids_13417 | ctl_dolci_instruct | FLAN (Other) | User: [QUESTION] Given the sentence "A girl in a blue tank top opens a package next to several drinks and a opened can of beans." can we conclude that "A girl returned a package at the post office."?
Options:
- yes
- it is not possible to tell
- no
Opening a package is not the same as returning a package. A post office... | allenai/Dolci-Instruct-SFT | FLAN | Other | 0 | 0 | 0 | 2 | ||
ctl_dolci_instruct/personas_math_9wjjvhidah2n3efnfzc8qt37 | ctl_dolci_instruct | Tulu 3 Persona Algebra (Math) | User: A multinational corporation is analyzing potential markets in two different countries, A and B. The marketing major at the corporation has modeled the potential revenue growth in millions of dollars for the next year using quadratic equations based on current market conditions and consumer behavior predictions.
... | allenai/Dolci-Instruct-SFT | Tulu 3 Persona Algebra | Math | 0 | 0 | 0 | 2 |
- What this repo is
positive_annotations— human span labelspositive_kimi_metagame_vea— Kimi metagame rollouts judged eval-awarepositive_kimi_agentic_misalignment_vea— Kimi agentic-misalignment rollouts judged eval-awareregex_dense_docs_human_labeled— the hand-labelled documents (splitspositive,negative)regex_dense_tokens_human_labeled— hand-labelled token-level gold (splitspositive,negative)pt_subset_tokens_human_labeled— hand-labelled token-level gold (splitspositive,negative)pt_subset_docs_jev_judged— TypeSafe Jev labels on a representative pre/midtraining sample (silver)regex_dense_docs_opus_judged— the judge-only documents (silver)positive_westover_labels— the Westover filter blacklist, with recovered textpositive_needham_eval_grading— Kimi-K3 Needham-probe verdictsctl_*— organic control corporalow_quality_synthetic_annotated— a small two-sided annotated synthetic set- Configs
- Provenance
ctl_dolci_instructctl_dolci_thinkctl_finewebctl_swectl_swe_testsctl_wildchatlow_quality_synthetic_annotatedpositive_annotationspositive_kimi_agentic_misalignment_veapositive_kimi_metagame_veapositive_needham_eval_gradingpositive_westover_labelspt_subset_docs_jev_judgedpt_subset_tokens_human_labeledregex_dense_docs_human_labeledregex_dense_docs_opus_judgedregex_dense_tokens_human_labeled
- Reproducibility
camgeodesic/metagaming-labeling-v2
Auto-generated by dataset-builder.
Each config below is a separate dataset produced from a versioned YAML build
config. Load with:
from datasets import load_dataset
ds = load_dataset("camgeodesic/metagaming-labeling-v2", "<config_name>", revision="<commit-sha>")
Pin revision= to the specific commit SHA you want; without it, you get the
current HEAD of the dataset repo, which may change when the builder re-pushes.
Requires datasets v4+. These parquet files carry feature metadata written by
datasets 4.x, which uses type names ({"_type": "List"}) that 3.x does not recognise —
a 3.x load_dataset fails with a bare must be called with a dataclass type or instance,
naming neither the file nor the cause. The Arrow data itself is fine, so a consumer stuck
on 3.x can read the parquet through Arrow directly and let the schema be inferred — but
inference recovers the values, not always the declared features (an all-empty list column
infers as null), so check the columns you care about rather than assuming a clean round-trip.
What this repo is
The data companion of the metagaming token filter (GeodesicResearch/metagaming-filter): a word-level filter for metagaming text — models reasoning about their own evaluation, oversight, or training — in pretraining data. Two prefixes partition the configs:
positive_*— label sets: text that is metagaming, or labels saying where it is.ctl_*— organic control corpora that should pass the filter untouched; the false-positive rate on them is the filter's pretraining-removal budget.
The unfiltered corpora the labels index into (kimi_metagame_rollouts,
kimi_agentic_rollouts, westover_general_split, westover_metagame_split) were
withdrawn from HEAD on 2026-09-09 and remain readable at revision
b84e34700b36a21f59158daa9d322fa42b9fb614; a judge-filtered positive subset of the Kimi
rollouts replaces them. Every consumer should pin revision=.
positive_annotations — human span labels
One row per hand-labelled document: id, doc_set, spans, n_spans, tokenCount, and
the annotation status (done = labelled with spans, clean = reviewed and found to
contain no metagaming, skip/todo = not usable as gold). Each span is a
[start, end, label] triple over the document's \S+-split words — 0-based,
end-exclusive, on the byte-identical source text — so the coordinates only resolve
against the corpus the id came from. id is <doc_set prefix>:<corpus id>; the
prefix strips to the id in: chat_kimi → kimi_metagame_rollouts and kimi_agentic →
kimi_agentic_rollouts (this repo at the pinned revision above; the westover ids match
westover_metagame_split as-is); cot_probe_hq → frontier_metagame_rollouts, which
lives only in metagaming-labeling@32d78e1e; and the control_* / metagaming_probe_docs
sets → low_quality_synthetic_annotated here. Sourced from the v1 labelling round.
| doc_set | docs | spans | words |
|---|---|---|---|
cot_probe_hq |
65 | 134 | 7,972 |
chat_kimi |
59 | 106 | 37,803 |
kimi_agentic |
2 | 20 | 10,894 |
control_far_negative |
10 | 2 | 3,622 |
control_human_oversight |
3 | 37 | 1,126 |
control_ml_distractor |
3 | 11 | 1,047 |
metagaming_probe_docs |
8 | 66 | 2,647 |
westover |
3 | 44 | 2,424 |
positive_kimi_metagame_vea — Kimi metagame rollouts judged eval-aware
The Kimi-K3 metagame rollouts (the withdrawn kimi_metagame_rollouts, read at
its pinned revision) whose chain of thought verbalizes evaluation awareness
somewhere, per the calibrated VEA "auditor" judge: the <think> block is cut
into sentence-aware 1,800-character chunks, each chunk is scored 0/1, and a
rollout is positive iff any chunk scored 1 (n_chunks is the chunk count;
chunk_verdicts and chunk_vea_quotes keep the per-chunk 0/1 decisions and the judge's
quoted CoT snippet for each chunk, aligned in chunk order). The
judge is nvidia/nemotron-3-ultra-550b-a55b via OpenRouter at temperature 0
with the same auditor prompt as geodesic-environments' eval-awareness grader;
verdicts are therefore not directly comparable to the retired gpt-4.1 numbers
without a calibration check. 644 of 2,240 rollouts are positive (28.8%); the
arm and family columns carry the prompt condition each rollout came from.
| arm | family | positives | mean chunks |
|---|---|---|---|
contradictory |
if_conflict |
263 | 12.0 |
satisfiable |
if_conflict |
142 | 9.9 |
harmful_real |
chat_hawthorne |
9 | 3.1 |
harmful_fake |
chat_hawthorne |
28 | 2.9 |
benign_real |
chat_hawthorne |
10 | 2.6 |
benign_fake |
chat_hawthorne |
39 | 2.9 |
answerable |
anti_hall_umwp |
1 | 2.0 |
unanswerable |
anti_hall_umwp |
52 | 2.0 |
true_premise |
anti_hall_falseqa |
7 | 1.7 |
false_premise |
anti_hall_falseqa |
51 | 2.0 |
unanswerable |
anti_hall_squad2 |
21 | 4.4 |
mcq |
mcq_mmlu |
22 | 12.9 |
positive_kimi_agentic_misalignment_vea — Kimi agentic-misalignment rollouts judged eval-aware
Kimi-K3 on the agentic-misalignment scenarios (the withdrawn kimi_agentic_rollouts, 500
rollouts read at its pinned revision; arms baseline, notice, scratchpad) whose chain
of thought verbalizes evaluation awareness somewhere, under the same chunked VEA auditor
judge as positive_kimi_metagame_vea (Nemotron-3-Ultra-550B via OpenRouter, temperature 0;
chunk_verdicts / chunk_vea_quotes keep the per-chunk decisions and quoted snippets). These
CoTs are long — a median of ten 1,800-character chunks — and 47 of the 5,737 chunks never
received a verdict because the judge exhausted its token budget on them even when re-drawn;
those chunks are simply absent from the lists. 482 of 500 rollouts are positive (96.4%).
| arm | positives | of | mean chunks |
|---|---|---|---|
baseline |
189 | 200 | 12.0 |
notice |
199 | 200 | 10.4 |
scratchpad |
94 | 100 | 10.9 |
regex_dense_docs_human_labeled — the hand-labelled documents (splits positive, negative)
Cam: These documents are an education heavy portion of our pretraining split, where documents discussing schools, exams, and education have a high-regex count. However, there is a small amount of AI oversight related data from the ai safety / ai splits.
A document-level hand-labelled set drawn from the pre- and midtraining subsets the 30B control
baseline trains on: a seeded 2% slice of every subset (control-pretraining-datasets-2percent-sample)
was screened with the v2 term list (G0 general oversight ranked alongside AI1/AI2/AI3/H1/M1;
hits per 1,000 words over each document's first 41,800 characters, ≥2 distinct terms, per-subset
quota ∝ token share), each term-dense document was cut into its first four chunks of at most
2,048 ModernBERT tokens (the first 8,192 tokens — the classifier's window), every chunk was
scored on its own by Claude Opus 5 (0/1, confidence, categories, a rationale and up to ten
verbatim strands), and a person labelled the chunks of a per-corpus slate. text is exactly the
labelled window, cut from the same document text the labeller and the judge saw, so
chunk_char_starts / chunk_char_ends index into it. The term list never reached the judge or
the labeller's first look, and the judge never saw the human labels.
Per row: the human label (human_label, note, labelling_pass — first for the 68 documents
labelled on an earlier 1,800-character grid, whose chunk labels are unlabelled here — and
labeller, who labelled the document, one labeller per document), the
per-chunk decisions as parallel JSON arrays (human_chunk_labels, chunk_indices,
chunk_char_starts, chunk_char_ends, chunk_tokens), the texts of the chunks labelled
positive / negative (positive_chunks / negative_chunks), the judge's parallel arrays
(chunk_judge_verdicts, chunk_judge_confidences, chunk_judge_categories,
chunk_judge_strands — per chunk a JSON array of {category, text} clauses copied character
for character from that chunk — chunk_judge_rationales) with doc_judge_score = any chunk
positive, and the term-screen columns.
Split positive: the labeller marked at least one of the document's chunks positive — content about
how AI systems, people or machines are evaluated, tested, overseen, graded or trained (AI1
capability evals, AI2 safety oversight, AI3 training pipeline, H1 human oversight, M1 machine
oversight), or a formal review, ranking or score of something else (E1).
Split negative (human_label is negative_close on its rows): the labeller marked every chunk negative AND the labelled window is the
whole document (negative_close). An all-negative window of a document that continues past
its fourth chunk is negative_prefix: kept in the labels asset, not published, since
its unread tail could still be positive. These are term-dense documents — the same screen
selected them — so they are the hard negatives a filter must let through.
positive split
| corpus | docs | mean term hits | mean hits per 1k words |
|---|---|---|---|
ai_safety_and_adjacent |
12 | 46.2 | 85.1 |
arxiv_papers |
9 | 190.1 | 52.4 |
climbmix_ai_docs |
10 | 28.8 | 91.1 |
climbmix_ai_docs_long |
7 | 52.6 | 8.9 |
climbmix_full |
7 | 31.9 | 87.6 |
climbmix_long |
7 | 278.1 | 50.9 |
nemotron_stem_sft |
5 | 181.6 | 23.4 |
nemotron_wiki_rewrite |
4 | 18.0 | 109.4 |
nemotron_wiki_rewrite_ai_docs |
11 | 20.1 | 20.0 |
stack_edu |
7 | 29.6 | 189.8 |
stack_edu_long |
4 | 155.0 | 45.0 |
zyda_ai_docs |
9 | 43.4 | 63.6 |
zyda_ai_docs_long |
3 | 80.0 | 13.0 |
zyda_full |
9 | 34.7 | 83.1 |
zyda_long |
7 | 175.7 | 28.2 |
negative split
| corpus | docs | mean term hits | mean hits per 1k words |
|---|---|---|---|
arxiv_papers |
1 | 20.0 | 7.1 |
climbmix_ai_docs |
2 | 21.5 | 80.0 |
climbmix_ai_docs_long |
2 | 4.0 | 1.2 |
climbmix_full |
4 | 20.0 | 74.7 |
climbmix_long |
2 | 105.0 | 33.5 |
nemotron_stem_sft |
1 | 7.0 | 1.8 |
nemotron_wiki_rewrite |
9 | 24.0 | 125.2 |
nemotron_wiki_rewrite_ai_docs |
1 | 42.0 | 21.4 |
stack_edu |
2 | 21.5 | 186.6 |
stack_edu_long |
1 | 20.0 | 6.1 |
zyda_ai_docs |
4 | 29.2 | 61.4 |
zyda_ai_docs_long |
2 | 12.5 | 3.0 |
zyda_full |
2 | 8.0 | 73.2 |
zyda_long |
2 | 31.0 | 10.0 |
regex_dense_tokens_human_labeled — hand-labelled token-level gold (splits positive, negative)
One row per chunk: 61 chunks of 55 documents of the hand-labelled regex-dense slate (the term-dense screen; not a
sample of training data), each a chunk of at most 2,048 ModernBERT tokens (doc_char_start / doc_char_end place
it in the document). Labelled word by word on the span-labelling page, first with Claude Fable span proposals shown
(pass1_positive_spans, null for the 2 chunks that pass did not review), then re-checked with Fable and Astra (GPT-6)
proposals shown. slate_role is what the document was put on the slate as (positive or negative_check, from its
document label at the time); the Claude Opus 5 chunk judge's verdict and categories (judge_verdict,
judge_categories) ride along for reference.
Labels are exhaustive and word-level: every word of text (a run of non-whitespace characters) is positive when
it lies in a span, and negative otherwise. The spans are the maximal runs of positive words, in two coordinates that
match entry for entry: positive_spans, a JSON array of [start, end) character offsets into text, and
positive_word_spans, [start, end) word indices (words numbered from 0). For token labels, tokenize text with
offsets and mark a token positive when its character range overlaps a positive span:
import json
spans = json.loads(row["positive_spans"])
enc = tokenizer(row["text"], return_offsets_mapping=True)
labels = [int(any(a < e and b > s for a, b in spans)) for s, e in enc["offset_mapping"]]
Per word instead, with words numbered as in positive_word_spans (runs of non-whitespace, from 0):
import json, re
words = re.findall(r"\S+", row["text"])
positive = [False] * len(words)
for a, b in json.loads(row["positive_word_spans"]):
positive[a:b] = [True] * (b - a)
A word is positive when it is about how AI systems, people or machines are evaluated, tested, overseen, graded or
trained (AI1 capability evals, AI2 safety oversight, AI3 training pipeline, H1 human testing and oversight, M1
machine and product testing, S1 checks on scientific work), or a formal review, ranking or score of something else
(E1) — the forget judge's definitions. One labeller (labeller). human_categories holds the categories the
labeller confirmed for the document: a JSON array, [] when they confirmed none, null when they recorded nothing.
The split follows the document (doc_label, kept on every row): a document is positive when any of its labelled
chunks holds a positive word (every labelled chunk of it is in the positive split, all-negative chunks included),
negative otherwise. The label covers the labelled chunks only, so a negative document may continue past them
(doc_truncated). It is therefore not the document label of regex_dense_docs_human_labeled, which
publishes a negative only when the whole document was read: 5 documents here are truncated all-negative windows
that set leaves out, and 3 documents that set holds as negative carry positive words here, found in the
word-level pass (climbmix::41e83c33, zyda::77011fd1, zyda::d0fe044c; 44, 15 and 25 words). Both token-level label sets were used equally to iterate on span-labelling prompts;
neither is a held-out set.
positive split
| corpus | chunks | words | positive words |
|---|---|---|---|
ai_safety_and_adjacent |
1 | 454 | 100.0% |
arxiv_papers |
3 | 2,950 | 80.0% |
climbmix_ai_docs |
1 | 604 | 70.9% |
climbmix_ai_docs_long |
2 | 1,476 | 21.9% |
climbmix_full |
1 | 178 | 92.1% |
climbmix_long |
2 | 3,122 | 3.2% |
nemotron_stem_sft |
1 | 1,150 | 6.8% |
nemotron_wiki_rewrite |
1 | 72 | 50.0% |
nemotron_wiki_rewrite_ai_docs |
1 | 392 | 11.7% |
stack_edu |
1 | 101 | 73.3% |
stack_edu_long |
1 | 621 | 1.1% |
zyda_ai_docs |
1 | 103 | 65.0% |
zyda_ai_docs_long |
2 | 5,958 | 1.8% |
zyda_full |
1 | 90 | 32.2% |
zyda_long |
5 | 7,891 | 21.7% |
negative split
| corpus | chunks | words | positive words |
|---|---|---|---|
arxiv_papers |
1 | 749 | 0.0% |
climbmix_ai_docs |
2 | 525 | 0.0% |
climbmix_ai_docs_long |
1 | 701 | 0.0% |
climbmix_full |
4 | 1,114 | 0.0% |
climbmix_long |
3 | 2,294 | 0.0% |
nemotron_stem_sft |
2 | 2,126 | 0.0% |
nemotron_wiki_rewrite |
9 | 1,853 | 0.0% |
nemotron_wiki_rewrite_ai_docs |
1 | 738 | 0.0% |
stack_edu |
2 | 401 | 0.0% |
stack_edu_long |
3 | 1,154 | 0.0% |
zyda_ai_docs |
4 | 2,058 | 0.0% |
zyda_ai_docs_long |
2 | 1,562 | 0.0% |
zyda_full |
2 | 216 | 0.0% |
zyda_long |
1 | 330 | 0.0% |
pt_subset_tokens_human_labeled — hand-labelled token-level gold (splits positive, negative)
One row per chunk: 59 chunks, one per document, from the shared 2% slice of the pre- and midtraining corpora the
30B baseline trains on (control-pretraining-datasets-2percent-sample): 50 drawn by stratified sampling over the
TypeSafe Jev chunk score (35 pretraining, 15 midtraining; stratum, with jev_chunk_score / jev_category
carried) and 9 AI-category boost chunks (sample_role: boost). exposure_weight re-weights a representative chunk
to its stage's training exposure (it sums to 1 per stage over both splits; boost chunks have none), so
exposure-weighted rates estimate the share of training text that is positive. Labelled word by word first blind —
no model output shown (blind_positive_spans) — then re-checked with Claude Fable and Astra (GPT-6) span proposals
shown (positive_spans).
Labels are exhaustive and word-level: every word of text (a run of non-whitespace characters) is positive when
it lies in a span, and negative otherwise. The spans are the maximal runs of positive words, in two coordinates that
match entry for entry: positive_spans, a JSON array of [start, end) character offsets into text, and
positive_word_spans, [start, end) word indices (words numbered from 0). For token labels, tokenize text with
offsets and mark a token positive when its character range overlaps a positive span:
import json
spans = json.loads(row["positive_spans"])
enc = tokenizer(row["text"], return_offsets_mapping=True)
labels = [int(any(a < e and b > s for a, b in spans)) for s, e in enc["offset_mapping"]]
Per word instead, with words numbered as in positive_word_spans (runs of non-whitespace, from 0):
import json, re
words = re.findall(r"\S+", row["text"])
positive = [False] * len(words)
for a, b in json.loads(row["positive_word_spans"]):
positive[a:b] = [True] * (b - a)
A word is positive when it is about how AI systems, people or machines are evaluated, tested, overseen, graded or
trained (AI1 capability evals, AI2 safety oversight, AI3 training pipeline, H1 human testing and oversight, M1
machine and product testing, S1 checks on scientific work), or a formal review, ranking or score of something else
(E1) — the forget judge's definitions. One labeller (labeller). human_categories holds the categories the
labeller confirmed for the document: a JSON array, [] when they confirmed none, null when they recorded nothing.
The split follows the document (doc_label, kept on every row): a document is positive when any of its labelled
chunks holds a positive word (every labelled chunk of it is in the positive split, all-negative chunks included),
negative otherwise. The label covers the labelled chunks only, so a negative document may continue past them
(doc_truncated). With one chunk per document here, the label is the chunk's own. Both token-level label sets were used equally to iterate on span-labelling prompts;
neither is a held-out set.
positive split
| stage / sample role | chunks | words | positive words |
|---|---|---|---|
midtrain / boost |
1 | 1,189 | 20.3% |
midtrain / representative |
8 | 8,477 | 10.7% |
pretrain / boost |
7 | 5,687 | 18.1% |
pretrain / representative |
20 | 12,134 | 12.3% |
negative split
| stage / sample role | chunks | words | positive words |
|---|---|---|---|
midtrain / representative |
7 | 4,245 | 0.0% |
pretrain / boost |
1 | 566 | 0.0% |
pretrain / representative |
15 | 8,811 | 0.0% |
pt_subset_docs_jev_judged — TypeSafe Jev labels on a representative pre/midtraining sample (silver)
20,000 documents drawn from the shared 2% slice of the pre- and midtraining corpora the way
training sees them: 17,000 pretraining and 3,000 midtraining documents, subset quotas
proportional to each subset's share of the documents in its stage, documents uniform at
random within a subset; w_stage and w_exposure re-weight rows to the stage or to training
exposure. Each document's first four chunks (at most 2,048 ModernBERT tokens each) were labelled
by TypeSafe's Jev with the forget judge's own category definitions and rules: per chunk, the
probability of forget content and the ordered category choice; per sentence, a probability.
jev_doc_score is the highest chunk score and is the per-document score to rank or threshold.
These are model labels, not ground truth. On the hand-labelled regex-dense documents Jev agrees with the person on 89% of document labels at a document score of 0.20 (precision 89%, recall 98%), and all 55 of its sentences scored 0.85 or above fall inside hand-marked gold spans on the 11 reviewed chunks (6 documents), though they recover only 20% of the gold sentences. Both cut-offs were tuned on that regex-dense set, not on this distribution, so the document score is best read as a ranking. Use the set to diagnose where a filter and Jev disagree.
Columns
| column | meaning |
|---|---|
uid |
stage|subset|id; a document drawn in both stages has two rows |
id, stage, subset, source |
the document's id in the 2% slice (joins back to it), its training stage (pretrain / midtrain), subset and upstream source |
text |
the labelled window: the first four chunks, cut from the document text |
num_tokens |
tokens in the whole document (the window can be shorter; see doc_truncated) |
w_stage, w_exposure |
design weights: sum to 1 within a stage / documents of training exposure the row stands for |
window_start, window_end, n_chunks, doc_truncated |
the window's offsets in the full document, its chunk count, and whether the document continues past it |
jev_doc_score |
the highest chunk score (0–1): the document's Jev score |
jev_doc_sentence_max |
the highest sentence score in the document |
n_sentences, n_flagged_sentences |
sentences in the window, and those scored 0.85 or above |
chunk_indices, chunk_char_starts, chunk_char_ends, chunk_tokens |
per chunk: index, offsets in the full document, ModernBERT tokens |
chunk_jev_scores |
per chunk: the probability that the chunk is forget content |
chunk_jev_categories, chunk_jev_category_probabilities |
per chunk: the ordered category choice (AI1, AI2, AI3, H1, M1, S1, E1 or none; the earliest present) and its probability per option |
chunk_sentence_char_starts, chunk_sentence_char_ends, chunk_sentence_texts, chunk_sentence_scores |
per chunk, per sentence: offsets in the full document, text and probability |
chunk_flagged_sentences |
per chunk: the sentences scored 0.85 or above |
Every chunk_* column is a JSON string holding one entry per chunk, and each sentence column
holds one inner array per chunk. Offsets are in the full document, so subtract window_start
to index text:
import json
from datasets import load_dataset
ds = load_dataset("camgeodesic/metagaming-labeling-v2", "pt_subset_docs_jev_judged", split="eval")
row = ds[0]
starts, ends = json.loads(row["chunk_sentence_char_starts"]), json.loads(row["chunk_sentence_char_ends"])
scores = json.loads(row["chunk_sentence_scores"])
flagged = [row["text"][a - row["window_start"]:b - row["window_start"]]
for s, e, p in zip(starts, ends, scores) for a, b, q in zip(s, e, p) if q >= 0.85]
Provenance. Jev model jev-latest, resolved to jev-1.13.0, through TypeSafe's systemone
endpoint; the question instructions are the category definitions and rules of dataset-builder's
assets/metagaming_labeling_v2/prompts/forget_document_judge.jinja (S1 included). Two calls per
chunk: the chunk question with the ordered category choice, and one question per numbered
sentence with the rules above and below the passage (at most 100 per call); 234.8M input
tokens, about $9.86. The run's raw outputs are the work repo's jev20k_documents and
jev20k_chunks (camgeodesic/metagaming-labeling-v2-work), from which this config is built.
| stage | subset | docs | mean jev_doc_score |
mean sentences ≥ 0.85 per doc |
|---|---|---|---|---|
| midtrain | ai_safety_and_adjacent |
376 | 0.614 | 2.98 |
| midtrain | arxiv_papers |
138 | 0.954 | 21.64 |
| midtrain | climbmix_ai_docs_long |
2 | 0.495 | 5.00 |
| midtrain | climbmix_long |
258 | 0.558 | 4.42 |
| midtrain | nemotron_stem_sft |
148 | 0.180 | 0.24 |
| midtrain | nemotron_wiki_rewrite |
2014 | 0.251 | 1.00 |
| midtrain | nemotron_wiki_rewrite_ai_docs |
17 | 0.349 | 2.18 |
| midtrain | stack_edu_long |
1 | 0.060 | 0.00 |
| midtrain | zyda_ai_docs_long |
1 | 0.230 | 0.00 |
| midtrain | zyda_long |
45 | 0.303 | 0.49 |
| pretrain | ai_safety_and_adjacent |
29 | 0.619 | 2.79 |
| pretrain | climbmix_ai_docs |
419 | 0.386 | 1.05 |
| pretrain | climbmix_full |
13542 | 0.201 | 0.29 |
| pretrain | stack_edu |
714 | 0.165 | 0.46 |
| pretrain | zyda_ai_docs |
42 | 0.404 | 1.05 |
| pretrain | zyda_full |
2254 | 0.242 | 0.43 |
regex_dense_docs_opus_judged — the judge-only documents (silver)
The same pool, unit and columns as regex_dense_docs_human_labeled, for every judged document
that carries no human label: a 34-documents-per-corpus prefix-stable sample of the term-dense
candidates, each chunk scored on its own by Claude Opus 5 with the same prompt. No human columns.
doc_judge_score is the any-chunk-positive document verdict; chunk_judge_strands is the
token-level signal — per chunk, a JSON array of {category, text} clauses copied character for
character from that chunk (locate them by substring search in text). Use it as a larger,
noisier companion to the human sets, never as their replacement: on the hand-labelled documents
the judge agrees with the person on 91% of document labels (precision 91%, recall 97%).
| corpus | docs | judge positive | mean hits per 1k words |
|---|---|---|---|
ai_safety_and_adjacent |
34 | 34.0 | 79.5 |
arxiv_papers |
34 | 34.0 | 52.8 |
climbmix_ai_docs_long |
34 | 31.0 | 5.1 |
climbmix_ai_docs |
34 | 28.0 | 94.5 |
climbmix_long |
34 | 33.0 | 53.8 |
climbmix_full |
34 | 25.0 | 79.2 |
nemotron_stem_sft |
34 | 22.0 | 15.3 |
nemotron_wiki_rewrite_ai_docs |
34 | 27.0 | 20.0 |
nemotron_wiki_rewrite |
34 | 12.0 | 122.5 |
stack_edu |
34 | 26.0 | 179.3 |
stack_edu_long |
8 | 5.0 | 17.9 |
zyda_ai_docs |
34 | 33.0 | 66.4 |
zyda_full |
34 | 30.0 | 88.6 |
zyda_long |
34 | 32.0 | 30.9 |
zyda_ai_docs_long |
11 | 6.0 | 5.1 |
positive_westover_labels — the Westover filter blacklist, with recovered text
Every unique entry of the document blacklist from awestover/filtering-for-misalignment
(output/filter.txt, upstream commit 2f8f9a89, ingested 2026-09-09; the upstream README
marks that repo deprecated in favour of an updated system available from the author),
deduplicated by first occurrence. westover_label is filter on every row — these are all
documents the upstream pipeline chose to remove. text is recovered in priority order and
text_source names the winner: Westover's own stored text; exact matches in the org's
control-pretraining corpora (lesswrong — Alignment Forum posts live in the LessWrong
database — arxiv_papers, ea_forum), keyed on the post or arXiv id parsed from the url;
then a one-time raw-HTML snapshot of the url-only entries (static fetch, robots.txt
honoured, Wayback Machine fallback for dead pages; working data kept only at the pinned
revision the build reads) passed through trafilatura main-content
extraction, a 500-character floor and an English-language check. Mirror urls of one page
each keep their text — dedupe on text downstream if a corpus needs it. has_text: false
rows (text_source: none) are url-only: pages excluded before fetching (LinkedIn, LW/AF
index pages), anti-bot or dead pages with no Wayback copy, robots-blocked or non-HTML urls,
thin JS shells. fetch_status, final_url, fetched_at and wayback_timestamp carry the
snapshot provenance. The ingest lineage is archived on the Hub at
metagaming-labeling-v2@fec3d7e3:westover_positive_labels/_provenance.json.
| text_source | entries | tokens |
|---|---|---|
westover_stored |
476 | 2,153,608 |
web_snapshot |
368 | 1,324,707 |
none |
122 | 0 |
lesswrong |
152 | 2,416,774 |
arxiv_papers |
60 | 2,023,333 |
wayback |
20 | 42,543 |
ea_forum |
4 | 45,389 |
positive_needham_eval_grading — Kimi-K3 Needham-probe verdicts
Kimi-K3 run with the Needham et al. probe methodology over the needham_eval_awareness
transcript set: each row is a transcript (text, with category, scaffold,
eval_type and gold_eval — whether the transcript really came from an evaluation) plus
the probe question (pq_id, prompt), Kimi's full graded rollout (grading, chain of
thought included) and the regex-extracted verdict (EVAL / REAL), alongside the two
human P(eval) baselines from the paper. It is a positive set because the rollouts are a
model reasoning explicitly about whether it is being evaluated. Carried verbatim from
metagaming-labeling@32d78e1e; the 10-step build lineage is archived at
metagaming-labeling@32d78e1e:needham_eval_grading/_provenance.json.
| gold: from an eval | Kimi verdict | rows |
|---|---|---|
| no | EVAL |
328 |
| yes | EVAL |
449 |
| no | REAL |
93 |
| yes | REAL |
7 |
ctl_* — organic control corpora
Six families of ordinary text the filter must leave alone, each a sample of a public
corpus that passed two purity gates in the v1 build: a term-blocklist screen (the
term_hits / term_categories / swe_hits / swe_terms columns record what the screen
saw) and, for the chat and code families, a verbalized-eval-awareness judge over the
response (vea_verdict, n_chunks). ctl_dolci_instruct and ctl_dolci_think are
Dolci instruction-following and reasoning conversations; ctl_fineweb is FineWeb web
text; ctl_swe and ctl_swe_tests are software-engineering tasks and test-writing
tasks (the retain ruling for SWE tests: code that tests software is not metagaming);
ctl_wildchat is real user chat from WildChat. All carried verbatim from
metagaming-labeling@32d78e1e. False-positive rate on these, token-weighted, is what
the filter's 1/3/5/10% removal budgets are measured against.
| family | documents |
|---|---|
ctl_dolci_instruct |
250 |
ctl_dolci_think |
250 |
ctl_fineweb |
4,000 |
ctl_swe |
250 |
ctl_swe_tests |
250 |
ctl_wildchat |
250 |
low_quality_synthetic_annotated — a small two-sided annotated synthetic set
Twenty-four synthetic documents from retired v1 generation configs (retired_config,
source_pool), kept because they were hand-annotated: label_side says which side each
document was generated for — synthetic_forget documents are metagaming text, the
hard_negative_control documents are near-topic distractors (far negatives, human-oversight
and ML-distractor pools) that should not fire. Their span coordinates are the matching
rows of positive_annotations (same ids). Unprefixed because it holds both sides. Carried
verbatim from metagaming-labeling@32d78e1e.
| label_side | source_pool | docs | spans |
|---|---|---|---|
hard_negative_control |
control_far_negative |
10 | 2 |
hard_negative_control |
control_human_oversight |
3 | 37 |
hard_negative_control |
control_ml_distractor |
3 | 11 |
synthetic_forget |
metagaming_probe_docs |
8 | 66 |
Configs
| Config | Source | Transform | Splits |
|---|---|---|---|
ctl_dolci_instruct |
camgeodesic/metagaming-labeling |
none | eval only |
ctl_dolci_think |
camgeodesic/metagaming-labeling |
none | eval only |
ctl_fineweb |
camgeodesic/metagaming-labeling |
none | eval only |
ctl_swe |
camgeodesic/metagaming-labeling |
none | eval only |
ctl_swe_tests |
camgeodesic/metagaming-labeling |
none | eval only |
ctl_wildchat |
camgeodesic/metagaming-labeling |
none | eval only |
low_quality_synthetic_annotated |
camgeodesic/metagaming-labeling |
none | eval only |
positive_annotations |
camgeodesic/metagaming-labeling |
none | eval only |
positive_kimi_agentic_misalignment_vea |
camgeodesic/metagaming-labeling-v2 |
map_column → flat_map → flat_map → project → llm_render_column → aggregate → filter → project |
eval only |
positive_kimi_metagame_vea |
camgeodesic/metagaming-labeling-v2 |
map_column → flat_map → flat_map → project → llm_render_column → aggregate → filter → project |
eval only |
positive_needham_eval_grading |
camgeodesic/metagaming-labeling |
none | eval only |
positive_westover_labels |
camgeodesic/metagaming-labeling-v2 |
project → flat_map → hf → semijoin → project → join → project → join → flat_map → hf → semijoin → project → join → project → join → flat_map → hf → semijoin → project → join → project → join → hf → project → join → filter → map_column → filter → filter → project → join → filter → map_column → filter → filter → project → join → map_column → hook → map_column → project |
eval only |
pt_subset_docs_jev_judged |
camgeodesic/metagaming-labeling-v2-work |
hf → corpus/chunk_rows_to_documents → join → map_column → project |
eval only |
pt_subset_tokens_human_labeled |
camgeodesic/metagaming-labeling-v2-work |
stateful_filter → stateful_filter → project |
one per doc_label value |
regex_dense_docs_human_labeled |
camgeodesic/metagaming-labeling-v2-work |
pretraining_subset/documents_by_window → project → project → hf → hf → concat → semijoin → stateful_filter → stateful_filter → corpus/chunk_label_lists → corpus/chunk_rows_to_documents → join → map_column → project → corpus/human_labelled_subset → map_column → project |
one per split value |
regex_dense_docs_opus_judged |
camgeodesic/metagaming-labeling-v2-work |
pretraining_subset/candidate_stack → stateful_filter → project → project → json_file → hf → semijoin → semijoin → corpus/chunk_rows_to_documents → join → map_column → project |
eval only |
regex_dense_tokens_human_labeled |
camgeodesic/metagaming-labeling-v2-work |
stateful_filter → stateful_filter → project |
one per doc_label value |
Provenance
ctl_dolci_instruct
Source: camgeodesic/metagaming-labeling
python -m dataset_builder configs/ctl_dolci_instruct.yaml --push
ctl_dolci_think
Source: camgeodesic/metagaming-labeling
python -m dataset_builder configs/ctl_dolci_think.yaml --push
ctl_fineweb
Source: camgeodesic/metagaming-labeling
python -m dataset_builder configs/ctl_fineweb.yaml --push
ctl_swe
Source: camgeodesic/metagaming-labeling
python -m dataset_builder configs/ctl_swe.yaml --push
ctl_swe_tests
Source: camgeodesic/metagaming-labeling
python -m dataset_builder configs/ctl_swe_tests.yaml --push
ctl_wildchat
Source: camgeodesic/metagaming-labeling
python -m dataset_builder configs/ctl_wildchat.yaml --push
low_quality_synthetic_annotated
Source: camgeodesic/metagaming-labeling
python -m dataset_builder configs/low_quality_synthetic_annotated.yaml --push
positive_annotations
Source: camgeodesic/metagaming-labeling
python -m dataset_builder configs/positive_annotations.yaml --push
positive_kimi_agentic_misalignment_vea
Source: camgeodesic/metagaming-labeling-v2
Transform: map_column → flat_map → flat_map → project → llm_render_column → aggregate → filter → project
python -m dataset_builder configs/positive_kimi_agentic_misalignment_vea.yaml --push
positive_kimi_metagame_vea
Source: camgeodesic/metagaming-labeling-v2
Transform: map_column → flat_map → flat_map → project → llm_render_column → aggregate → filter → project
python -m dataset_builder configs/positive_kimi_metagame_vea.yaml --push
positive_needham_eval_grading
Source: camgeodesic/metagaming-labeling
python -m dataset_builder configs/positive_needham_eval_grading.yaml --push
positive_westover_labels
Source: camgeodesic/metagaming-labeling-v2
Transform: project → flat_map → hf → semijoin → project → join → project → join → flat_map → hf → semijoin → project → join → project → join → flat_map → hf → semijoin → project → join → project → join → hf → project → join → filter → map_column → filter → filter → project → join → filter → map_column → filter → filter → project → join → map_column → hook → map_column → project
python -m dataset_builder configs/positive_westover_labels.yaml --push
pt_subset_docs_jev_judged
Source: camgeodesic/metagaming-labeling-v2-work
Transform: hf → corpus/chunk_rows_to_documents → join → map_column → project
python -m dataset_builder configs/pt_subset_docs_jev_judged.yaml --push
pt_subset_tokens_human_labeled
Source: camgeodesic/metagaming-labeling-v2-work
Transform: stateful_filter → stateful_filter → project
python -m dataset_builder configs/pt_subset_tokens_human_labeled.yaml --push
regex_dense_docs_human_labeled
Source: camgeodesic/metagaming-labeling-v2-work
Transform: pretraining_subset/documents_by_window → project → project → hf → hf → concat → semijoin → stateful_filter → stateful_filter → corpus/chunk_label_lists → corpus/chunk_rows_to_documents → join → map_column → project → corpus/human_labelled_subset → map_column → project
python -m dataset_builder configs/regex_dense_docs_human_labeled.yaml --push
regex_dense_docs_opus_judged
Source: camgeodesic/metagaming-labeling-v2-work
Transform: pretraining_subset/candidate_stack → stateful_filter → project → project → json_file → hf → semijoin → semijoin → corpus/chunk_rows_to_documents → join → map_column → project
python -m dataset_builder configs/regex_dense_docs_opus_judged.yaml --push
regex_dense_tokens_human_labeled
Source: camgeodesic/metagaming-labeling-v2-work
Transform: stateful_filter → stateful_filter → project
python -m dataset_builder configs/regex_dense_tokens_human_labeled.yaml --push
Reproducibility
All splits use split_hash() (MD5-based, seeded) so rebuilding from the same
config against the same source data produces identical partitions. For an
LLM-generated dataset, a provider's seed parameter is best-effort; pin
consumer loads to a specific HF commit SHA to avoid drift when the builder
re-pushes.
This card is auto-generated by dataset_builder.cards.
- Downloads last month
- 701