stage1/dev.jsonl

{"id": "smart_home_v2:dev:1", "state_id": "smart_home_v2:dev:1", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room garden, device speaker, action on. Permission no. Occupancy 0. Hour 2.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "bedroom lamp", "unit_1": "garden speaker", "unit_2": "balcony heater"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_1", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 1, "unit_2": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"garden\",\"speaker\",false,0]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 0, "unit_2": 0, "unit_1": 1}, "execute": {"false": 0.43999999999999995, "true": 0.56}, "risk": {"0": 0.49, "1": 0.1, "2": 0.41}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:0", "state_id": "smart_home_v2:dev:0", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room attic, device fan, action on. Permission yes. Occupancy 0. Hour 13.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "library fan", "unit_1": "attic fan"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_1", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 1}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"attic\",\"fan\",true,0]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_1": 1, "unit_0": 0}, "execute": {"false": 0.020000000000000018, "true": 0.98}, "risk": {"0": 0.99, "1": 0.01, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:2", "state_id": "smart_home_v2:dev:2", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room library, device speaker, action on. Permission yes. Occupancy 3. Hour 13.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "library speaker", "unit_1": "garden speaker", "unit_2": "garage fan", "unit_3": "attic fan", "unit_4": "office lamp"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_0", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 1, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"library\",\"speaker\",true,3]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 1, "unit_2": 0, "unit_1": 0, "unit_4": 0, "unit_3": 0}, "execute": {"false": 0.040000000000000036, "true": 0.96}, "risk": {"0": 0.99, "1": 0, "2": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:7", "state_id": "smart_home_v2:dev:7", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room bedroom, device speaker, action off. Permission no. Occupancy 2. Hour 20.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "balcony heater", "unit_1": "bedroom speaker", "unit_2": "garden fan", "unit_3": "bathroom heater", "unit_4": "living room heater"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_1", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 1, "unit_2": 0, "unit_3": 0, "unit_4": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"bedroom\",\"speaker\",false,2]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 0, "unit_2": 0, "unit_4": 0, "unit_3": 0, "unit_1": 1}, "execute": {"false": 0.6799999999999999, "true": 0.32}, "risk": {"0": 0.64, "1": 0, "2": 0.36}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:3", "state_id": "smart_home_v2:dev:3", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room office, device lamp, action on. Permission no. Occupancy 3. Hour 4.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "library fan", "unit_1": "kitchen fan", "unit_2": "hall heater", "unit_3": "kitchen heater", "unit_4": "garden lamp", "unit_5": "office lamp", "unit_6": "living room fan", "unit_7": "kitchen lamp"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_5", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 0, "unit_5": 1, "unit_6": 0, "unit_7": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"office\",\"lamp\",false,3]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_6": 0, "unit_5": 1, "unit_2": 0, "unit_7": 0, "unit_3": 0, "unit_4": 0}, "execute": {"false": 0.39, "true": 0.61}, "risk": {"0": 0.85, "1": 0, "2": 0.15}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:6", "state_id": "smart_home_v2:dev:6", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room dining room, device heater, action off. Permission yes. Occupancy 3. Hour 5.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "hall speaker", "unit_1": "dining room heater", "unit_2": "kitchen lamp"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_1", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 1, "unit_2": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"dining room\",\"heater\",true,3]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_1": 1, "unit_2": 0, "unit_0": 0}, "execute": {"false": 0.020000000000000018, "true": 0.98}, "risk": {"0": 1, "1": 0, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:5", "state_id": "smart_home_v2:dev:5", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room garden, device speaker, action off. Permission yes. Occupancy 1. Hour 18.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "garden speaker", "unit_1": "garden lamp"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_0", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 1, "unit_1": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"garden\",\"speaker\",true,1]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_1": 0, "unit_0": 1}, "execute": {"false": 0.030000000000000027, "true": 0.97}, "risk": {"0": 0.99, "1": 0, "2": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:9", "state_id": "smart_home_v2:dev:9", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room garden, device heater, action on. Permission yes. Occupancy 3. Hour 20.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "dining room lamp", "unit_1": "garden speaker", "unit_2": "balcony speaker", "unit_3": "bedroom lamp", "unit_4": "dining room heater", "unit_5": "garage heater", "unit_6": "garden heater", "unit_7": "living room lamp", "unit_8": "bathroom lamp", "unit_9": "library speaker", "unit_10": "balcony fan", "unit_11": "office lamp"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_6", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 0, "unit_5": 0, "unit_6": 1, "unit_7": 0, "unit_8": 0, "unit_9": 0, "unit_10": 0, "unit_11": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"garden\",\"heater\",true,3]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 0, "unit_2": 0, "unit_4": 0, "unit_7": 0, "unit_5": 0, "unit_10": 0, "unit_1": 0, "unit_11": 0, "unit_8": 0, "unit_6": 1, "unit_3": 0, "unit_9": 0}, "execute": {"false": 0.020000000000000018, "true": 0.98}, "risk": {"0": 1, "1": 0, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:8", "state_id": "smart_home_v2:dev:8", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room kitchen, device fan, action on. Permission no. Occupancy 3. Hour 15.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "kitchen lamp", "unit_1": "garden speaker", "unit_2": "office lamp", "unit_3": "bathroom lamp", "unit_4": "office fan", "unit_5": "dining room speaker", "unit_6": "attic lamp", "unit_7": "kitchen fan"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_7", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 0, "unit_5": 0, "unit_6": 0, "unit_7": 1}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"kitchen\",\"fan\",false,3]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_2": 0, "unit_4": 0, "unit_3": 0, "unit_7": 1, "unit_1": 0, "unit_6": 0, "unit_0": 0, "unit_5": 0}, "execute": {"false": 0.5900000000000001, "true": 0.41}, "risk": {"0": 0.79, "1": 0, "2": 0.21}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:11", "state_id": "smart_home_v2:dev:11", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room balcony, device lamp, action off. Permission yes. Occupancy 3. Hour 11.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "balcony lamp", "unit_1": "office heater", "unit_2": "garage speaker"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_0", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 1, "unit_1": 0, "unit_2": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"balcony\",\"lamp\",true,3]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_1": 0, "unit_0": 1, "unit_2": 0}, "execute": {"false": 0.030000000000000027, "true": 0.97}, "risk": {"0": 1, "1": 0, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:4", "state_id": "smart_home_v2:dev:4", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room garden, device speaker, action off. Permission no. Occupancy 1. Hour 20.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "living room speaker", "unit_1": "garage fan", "unit_2": "dining room fan", "unit_3": "dining room speaker", "unit_4": "garage lamp", "unit_5": "office heater", "unit_6": "balcony lamp", "unit_7": "office speaker", "unit_8": "garden speaker", "unit_9": "garden lamp", "unit_10": "kitchen lamp", "unit_11": "hall heater"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_8", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 0, "unit_5": 0, "unit_6": 0, "unit_7": 0, "unit_8": 1, "unit_9": 0, "unit_10": 0, "unit_11": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"garden\",\"speaker\",false,1]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_1": 0, "unit_2": 0, "unit_8": 1, "unit_5": 0, "unit_9": 0, "unit_0": 0, "unit_11": 0, "unit_7": 0, "unit_4": 0, "unit_10": 0, "unit_6": 0, "unit_3": 0}, "execute": {"false": 0.8, "true": 0.2}, "risk": {"0": 0.51, "1": 0, "2": 0.49}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:10", "state_id": "smart_home_v2:dev:10", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room garden, device fan, action on. Permission no. Occupancy 1. Hour 14.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "garden fan", "unit_1": "library heater"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_0", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 1, "unit_1": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"garden\",\"fan\",false,1]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 1, "unit_1": 0}, "execute": {"false": 0.25, "true": 0.75}, "risk": {"0": 0.96, "1": 0, "2": 0.04}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:13", "state_id": "smart_home_v2:dev:13", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room office, device lamp, action on. Permission no. Occupancy 1. Hour 13.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "office lamp", "unit_1": "living room speaker", "unit_2": "garden heater", "unit_3": "office speaker", "unit_4": "library lamp", "unit_5": "library heater", "unit_6": "balcony fan", "unit_7": "hall heater"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_0", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 1, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 0, "unit_5": 0, "unit_6": 0, "unit_7": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"office\",\"lamp\",false,1]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_2": 0, "unit_1": 0, "unit_6": 0, "unit_7": 0, "unit_0": 1, "unit_3": 0, "unit_5": 0, "unit_4": 0}, "execute": {"false": 0.19999999999999996, "true": 0.8}, "risk": {"0": 0.93, "1": 0, "2": 0.07}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:14", "state_id": "smart_home_v2:dev:14", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room bathroom, device fan, action off. Permission yes. Occupancy 2. Hour 2.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "office heater", "unit_1": "kitchen lamp", "unit_2": "garage fan", "unit_3": "office lamp", "unit_4": "bathroom fan", "unit_5": "kitchen speaker", "unit_6": "kitchen fan", "unit_7": "living room lamp", "unit_8": "attic lamp", "unit_9": "hall speaker", "unit_10": "dining room speaker", "unit_11": "bathroom speaker"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_4", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 1, "unit_5": 0, "unit_6": 0, "unit_7": 0, "unit_8": 0, "unit_9": 0, "unit_10": 0, "unit_11": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"bathroom\",\"fan\",true,2]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_6": 0, "unit_2": 0, "unit_1": 0, "unit_7": 0, "unit_8": 0, "unit_0": 0, "unit_5": 0, "unit_3": 0, "unit_11": 0, "unit_4": 1, "unit_9": 0, "unit_10": 0}, "execute": {"false": 0.020000000000000018, "true": 0.98}, "risk": {"0": 1, "1": 0, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:12", "state_id": "smart_home_v2:dev:12", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room kitchen, device heater, action off. Permission no. Occupancy 2. Hour 16.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "hall fan", "unit_1": "garage speaker", "unit_2": "bathroom fan", "unit_3": "living room lamp", "unit_4": "kitchen heater"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_4", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 1}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"kitchen\",\"heater\",false,2]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_2": 0, "unit_1": 0, "unit_4": 1, "unit_0": 0, "unit_3": 0}, "execute": {"false": 0.79, "true": 0.21}, "risk": {"0": 0.71, "1": 0, "2": 0.29}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:16", "state_id": "smart_home_v2:dev:16", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room garden, device fan, action on. Permission yes. Occupancy 2. Hour 16.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "garden fan", "unit_1": "attic speaker", "unit_2": "office heater"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_0", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 1, "unit_1": 0, "unit_2": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"garden\",\"fan\",true,2]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_2": 0, "unit_1": 0, "unit_0": 1}, "execute": {"false": 0.030000000000000027, "true": 0.97}, "risk": {"0": 1, "1": 0, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:15", "state_id": "smart_home_v2:dev:15", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room bathroom, device heater, action on. Permission yes. Occupancy 1. Hour 13.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "bathroom heater", "unit_1": "living room heater"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_0", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 1, "unit_1": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"bathroom\",\"heater\",true,1]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 1, "unit_1": 0}, "execute": {"false": 0.020000000000000018, "true": 0.98}, "risk": {"0": 1, "1": 0, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:19", "state_id": "smart_home_v2:dev:19", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room bedroom, device lamp, action on. Permission yes. Occupancy 0. Hour 18.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "living room heater", "unit_1": "library speaker", "unit_2": "garage heater", "unit_3": "bedroom lamp", "unit_4": "dining room speaker", "unit_5": "living room fan", "unit_6": "bathroom heater", "unit_7": "office lamp", "unit_8": "library heater", "unit_9": "hall heater", "unit_10": "balcony heater", "unit_11": "garden speaker"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_3", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 0, "unit_3": 1, "unit_4": 0, "unit_5": 0, "unit_6": 0, "unit_7": 0, "unit_8": 0, "unit_9": 0, "unit_10": 0, "unit_11": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"bedroom\",\"lamp\",true,0]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_2": 0, "unit_0": 0, "unit_11": 0, "unit_4": 0, "unit_3": 1, "unit_9": 0, "unit_7": 0, "unit_1": 0, "unit_6": 0, "unit_10": 0, "unit_8": 0, "unit_5": 0}, "execute": {"false": 0.030000000000000027, "true": 0.97}, "risk": {"0": 0.99, "1": 0, "2": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:17", "state_id": "smart_home_v2:dev:17", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room attic, device heater, action off. Permission yes. Occupancy 2. Hour 1.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "attic heater", "unit_1": "living room fan", "unit_2": "office heater", "unit_3": "living room speaker", "unit_4": "garage heater"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_0", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 1, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"attic\",\"heater\",true,2]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_1": 0, "unit_2": 0, "unit_4": 0, "unit_0": 1, "unit_3": 0}, "execute": {"false": 0.030000000000000027, "true": 0.97}, "risk": {"0": 1, "1": 0, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:18", "state_id": "smart_home_v2:dev:18", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room dining room, device speaker, action off. Permission no. Occupancy 3. Hour 10.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "kitchen speaker", "unit_1": "dining room speaker", "unit_2": "bathroom fan", "unit_3": "garage heater", "unit_4": "balcony heater", "unit_5": "living room lamp", "unit_6": "bedroom fan", "unit_7": "hall speaker"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_1", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 1, "unit_2": 0, "unit_3": 0, "unit_4": 0, "unit_5": 0, "unit_6": 0, "unit_7": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"dining room\",\"speaker\",false,3]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 0, "unit_1": 1, "unit_6": 0, "unit_7": 0, "unit_5": 0, "unit_2": 0, "unit_3": 0, "unit_4": 0}, "execute": {"false": 0.79, "true": 0.21}, "risk": {"0": 0.6, "1": 0, "2": 0.4}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:20", "state_id": "smart_home_v2:dev:20", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room balcony, device heater, action on. Permission no. Occupancy 2. Hour 23.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "balcony heater", "unit_1": "attic lamp"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_0", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 1, "unit_1": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"balcony\",\"heater\",false,2]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_1": 0, "unit_0": 1}, "execute": {"false": 0.18000000000000005, "true": 0.82}, "risk": {"0": 0.92, "1": 0, "2": 0.08}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:21", "state_id": "smart_home_v2:dev:21", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room living room, device fan, action on. Permission no. Occupancy 3. Hour 23.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "living room fan", "unit_1": "balcony heater", "unit_2": "garage speaker"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_0", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 1, "unit_1": 0, "unit_2": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"living room\",\"fan\",false,3]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 1, "unit_2": 0, "unit_1": 0}, "execute": {"false": 0.5700000000000001, "true": 0.43}, "risk": {"0": 0.76, "1": 0, "2": 0.24}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:22", "state_id": "smart_home_v2:dev:22", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room office, device speaker, action on. Permission no. Occupancy 3. Hour 16.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "library speaker", "unit_1": "balcony lamp", "unit_2": "office speaker", "unit_3": "hall speaker", "unit_4": "bathroom heater"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_2", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 1, "unit_3": 0, "unit_4": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"office\",\"speaker\",false,3]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_4": 0, "unit_1": 0, "unit_2": 1, "unit_0": 0, "unit_3": 0}, "execute": {"false": 0.36, "true": 0.64}, "risk": {"0": 0.86, "1": 0, "2": 0.14}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:23", "state_id": "smart_home_v2:dev:23", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room office, device fan, action off. Permission no. Occupancy 2. Hour 1.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "garden lamp", "unit_1": "balcony speaker", "unit_2": "bedroom lamp", "unit_3": "dining room speaker", "unit_4": "attic heater", "unit_5": "bathroom lamp", "unit_6": "office fan", "unit_7": "kitchen speaker"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_6", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 0, "unit_5": 0, "unit_6": 1, "unit_7": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"office\",\"fan\",false,2]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_4": 0, "unit_7": 0, "unit_2": 0, "unit_5": 0, "unit_1": 0, "unit_0": 0, "unit_3": 0, "unit_6": 1}, "execute": {"false": 0.76, "true": 0.24}, "risk": {"0": 0.56, "1": 0, "2": 0.44}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:24", "state_id": "smart_home_v2:dev:24", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room garage, device speaker, action on. Permission yes. Occupancy 1. Hour 0.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "dining room speaker", "unit_1": "library speaker", "unit_2": "attic speaker", "unit_3": "dining room heater", "unit_4": "balcony fan", "unit_5": "garden fan", "unit_6": "hall heater", "unit_7": "garage speaker", "unit_8": "bedroom speaker", "unit_9": "library fan", "unit_10": "bathroom heater", "unit_11": "hall lamp"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_7", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 0, "unit_5": 0, "unit_6": 0, "unit_7": 1, "unit_8": 0, "unit_9": 0, "unit_10": 0, "unit_11": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"garage\",\"speaker\",true,1]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 0, "unit_4": 0, "unit_10": 0, "unit_8": 0, "unit_7": 1, "unit_11": 0, "unit_3": 0, "unit_9": 0, "unit_1": 0, "unit_5": 0, "unit_6": 0, "unit_2": 0}, "execute": {"false": 0.040000000000000036, "true": 0.96}, "risk": {"0": 1, "1": 0, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:25", "state_id": "smart_home_v2:dev:25", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room office, device speaker, action on. Permission no. Occupancy 0. Hour 11.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "attic lamp", "unit_1": "office speaker"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_1", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 1}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"office\",\"speaker\",false,0]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_1": 1, "unit_0": 0}, "execute": {"false": 0.45999999999999996, "true": 0.54}, "risk": {"0": 0.56, "1": 0.06, "2": 0.38}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:27", "state_id": "smart_home_v2:dev:27", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room dining room, device heater, action on. Permission no. Occupancy 2. Hour 2.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "dining room fan", "unit_1": "attic heater", "unit_2": "hall lamp", "unit_3": "dining room heater", "unit_4": "kitchen fan"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_3", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 0, "unit_3": 1, "unit_4": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"dining room\",\"heater\",false,2]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_2": 0, "unit_0": 0, "unit_3": 1, "unit_4": 0, "unit_1": 0}, "execute": {"false": 0.13, "true": 0.87}, "risk": {"0": 0.96, "1": 0, "2": 0.04}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:28", "state_id": "smart_home_v2:dev:28", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room dining room, device lamp, action off. Permission no. Occupancy 3. Hour 7.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "garden speaker", "unit_1": "library fan", "unit_2": "dining room fan", "unit_3": "bathroom lamp", "unit_4": "dining room lamp", "unit_5": "garden fan", "unit_6": "hall speaker", "unit_7": "attic fan"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_4", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 0, "unit_3": 0, "unit_4": 1, "unit_5": 0, "unit_6": 0, "unit_7": 0}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"dining room\",\"lamp\",false,3]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 0, "unit_4": 1, "unit_7": 0, "unit_3": 0, "unit_2": 0, "unit_1": 0, "unit_6": 0, "unit_5": 0}, "execute": {"false": 0.87, "true": 0.13}, "risk": {"0": 0.54, "1": 0, "2": 0.46}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:29", "state_id": "smart_home_v2:dev:29", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room kitchen, device fan, action off. Permission yes. Occupancy 2. Hour 8.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "hall lamp", "unit_1": "garage speaker", "unit_2": "kitchen fan", "unit_3": "attic heater", "unit_4": "attic lamp", "unit_5": "hall heater", "unit_6": "office heater", "unit_7": "dining room lamp", "unit_8": "attic speaker", "unit_9": "garage lamp", "unit_10": "garden fan", "unit_11": "garage fan"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_2", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 1, "unit_3": 0, "unit_4": 0, "unit_5": 0, "unit_6": 0, "unit_7": 0, "unit_8": 0, "unit_9": 0, "unit_10": 0, "unit_11": 0}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"kitchen\",\"fan\",true,2]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_6": 0, "unit_8": 0, "unit_10": 0, "unit_3": 0, "unit_2": 1, "unit_1": 0, "unit_9": 0, "unit_11": 0, "unit_5": 0, "unit_0": 0, "unit_4": 0, "unit_7": 0}, "execute": {"false": 0.020000000000000018, "true": 0.98}, "risk": {"0": 1, "1": 0, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:30", "state_id": "smart_home_v2:dev:30", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room living room, device lamp, action on. Permission no. Occupancy 0. Hour 2.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "bedroom heater", "unit_1": "living room lamp"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_1", "execute": false, "risk": 2}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 1}, "execute": {"false": 1, "true": 0}, "risk": {"0": 0, "1": 0, "2": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"living room\",\"lamp\",false,0]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 0, "unit_1": 1}, "execute": {"false": 0.47, "true": 0.53}, "risk": {"0": 0.78, "1": 0.01, "2": 0.21}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:26", "state_id": "smart_home_v2:dev:26", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room office, device fan, action on. Permission yes. Occupancy 1. Hour 0.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "balcony heater", "unit_1": "balcony speaker", "unit_2": "office fan"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_2", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 1}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"office\",\"fan\",true,1]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 1}, "execute": {"false": 0.030000000000000027, "true": 0.97}, "risk": {"0": 1, "1": 0, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:0", "state_id": "catalog_lookup_v2:dev:0", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00151; color=black; size=small; status=shipped; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "green, large", "candidate_1": "black, small"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_1", "ready": false, "stage": 3}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 1}, "ready": {"false": 1, "true": 0}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00151\",\"black\",\"small\",\"shipped\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_0": 0, "candidate_1": 1}, "ready": {"false": 0.98, "true": 0.02}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:2", "state_id": "catalog_lookup_v2:dev:2", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00072; color=yellow; size=small; status=new; expedited=yes.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "gray, medium", "candidate_1": "brown, small", "candidate_2": "yellow, small", "candidate_3": "white, large", "candidate_4": "purple, medium", "candidate_5": "purple, large", "candidate_6": "pink, large", "candidate_7": "pink, medium"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_2", "ready": false, "stage": 0}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 1, "candidate_3": 0, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00072\",\"yellow\",\"small\",\"new\",\"yes\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_5": 0, "candidate_0": 0, "candidate_2": 1, "candidate_4": 0, "candidate_1": 0, "candidate_6": 0, "candidate_3": 0, "candidate_7": 0}, "ready": {"false": 0.72, "true": 0.28}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "smart_home_v2:dev:31", "state_id": "smart_home_v2:dev:31", "family_id": "smart_home_v2", "split": "dev", "state": "Device command received: room bedroom, device lamp, action off. Permission yes. Occupancy 1. Hour 17.", "questions": {"device": {"type": "choice", "instructions": "Select exactly the room and device named in the request. Ignore authorization and occupancy for this question.", "criteria": {"unit_0": "bedroom fan", "unit_1": "library lamp", "unit_2": "bedroom lamp"}}, "execute": {"type": "boolean", "instructions": "Is execution allowed? Rule: authorization is required for every command; additionally any heater command requires at least one person present. Other devices do not require occupancy."}, "risk": {"type": "score", "instructions": "Classify the control request using these mutually exclusive rules.", "criteria": ["Authorized, and either not a heater or at least one person present", "Authorized heater request with zero people present", "Not authorized, regardless of device or occupancy"]}}, "gold": {"device": "unit_2", "execute": true, "risk": 0}, "gold_probs": {"device": {"unit_0": 0, "unit_1": 0, "unit_2": 1}, "execute": {"false": 0, "true": 1}, "risk": {"0": 1, "1": 0, "2": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "home:[\"bedroom\",\"lamp\",true,1]", "template_id": "smart_home_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"device": {"unit_2": 1, "unit_1": 0, "unit_0": 0}, "execute": {"false": 0.020000000000000018, "true": 0.98}, "risk": {"0": 1, "1": 0, "2": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:1", "state_id": "catalog_lookup_v2:dev:1", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00009; color=red; size=medium; status=new; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "gray, large", "candidate_1": "red, medium", "candidate_2": "blue, large", "candidate_3": "white, large", "candidate_4": "black, large"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_1", "ready": false, "stage": 0}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 1, "candidate_2": 0, "candidate_3": 0, "candidate_4": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00009\",\"red\",\"medium\",\"new\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_1": 1, "candidate_4": 0, "candidate_3": 0, "candidate_0": 0, "candidate_2": 0}, "ready": {"false": 0.75, "true": 0.25}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:3", "state_id": "catalog_lookup_v2:dev:3", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00167; color=black; size=large; status=shipped; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "gray, large", "candidate_1": "yellow, small", "candidate_2": "green, large", "candidate_3": "green, small", "candidate_4": "blue, small", "candidate_5": "blue, medium", "candidate_6": "red, small", "candidate_7": "pink, medium", "candidate_8": "yellow, medium", "candidate_9": "cyan, large", "candidate_10": "black, large", "candidate_11": "gray, small"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_10", "ready": false, "stage": 3}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 0, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0, "candidate_8": 0, "candidate_9": 0, "candidate_10": 1, "candidate_11": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00167\",\"black\",\"large\",\"shipped\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_1": 0, "candidate_4": 0, "candidate_11": 0, "candidate_10": 1, "candidate_6": 0, "candidate_3": 0, "candidate_5": 0, "candidate_0": 0, "candidate_9": 0, "candidate_8": 0, "candidate_2": 0, "candidate_7": 0}, "ready": {"false": 0.98, "true": 0.02}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:6", "state_id": "catalog_lookup_v2:dev:6", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00133; color=white; size=medium; status=packed; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "gray, small", "candidate_1": "blue, medium", "candidate_2": "orange, medium", "candidate_3": "white, medium", "candidate_4": "blue, small"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_3", "ready": true, "stage": 2}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 1, "candidate_4": 0}, "ready": {"false": 0, "true": 1}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00133\",\"white\",\"medium\",\"packed\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_3": 1, "candidate_1": 0, "candidate_2": 0, "candidate_0": 0, "candidate_4": 0}, "ready": {"false": 0.12, "true": 0.88}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:5", "state_id": "catalog_lookup_v2:dev:5", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00105; color=purple; size=medium; status=new; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "cyan, medium", "candidate_1": "purple, medium"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_1", "ready": false, "stage": 0}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 1}, "ready": {"false": 1, "true": 0}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00105\",\"purple\",\"medium\",\"new\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_0": 0, "candidate_1": 1}, "ready": {"false": 0.74, "true": 0.26}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:8", "state_id": "catalog_lookup_v2:dev:8", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00176; color=orange; size=medium; status=new; expedited=yes.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "purple, small", "candidate_1": "purple, large", "candidate_2": "yellow, small", "candidate_3": "orange, medium", "candidate_4": "green, large", "candidate_5": "yellow, medium", "candidate_6": "brown, large", "candidate_7": "brown, medium", "candidate_8": "yellow, large", "candidate_9": "black, small", "candidate_10": "orange, large", "candidate_11": "gray, small"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_3", "ready": false, "stage": 0}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 1, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0, "candidate_8": 0, "candidate_9": 0, "candidate_10": 0, "candidate_11": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00176\",\"orange\",\"medium\",\"new\",\"yes\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_5": 0, "candidate_0": 0, "candidate_2": 0, "candidate_9": 0, "candidate_10": 0, "candidate_4": 0, "candidate_8": 0, "candidate_11": 0, "candidate_1": 0, "candidate_3": 1, "candidate_6": 0, "candidate_7": 0}, "ready": {"false": 0.71, "true": 0.29}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:10", "state_id": "catalog_lookup_v2:dev:10", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00227; color=brown; size=medium; status=picked; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "cyan, large", "candidate_1": "brown, medium"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_1", "ready": false, "stage": 1}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 1}, "ready": {"false": 1, "true": 0}, "stage": {"0": 0, "1": 1, "2": 0, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00227\",\"brown\",\"medium\",\"picked\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_0": 0, "candidate_1": 1}, "ready": {"false": 0.88, "true": 0.12}, "stage": {"0": 0, "1": 1, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:11", "state_id": "catalog_lookup_v2:dev:11", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00109; color=purple; size=medium; status=packed; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "brown, small", "candidate_1": "pink, medium", "candidate_2": "purple, medium", "candidate_3": "yellow, small", "candidate_4": "red, medium"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_2", "ready": true, "stage": 2}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 1, "candidate_3": 0, "candidate_4": 0}, "ready": {"false": 0, "true": 1}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00109\",\"purple\",\"medium\",\"packed\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_0": 0, "candidate_4": 0, "candidate_3": 0, "candidate_1": 0, "candidate_2": 1}, "ready": {"false": 0.09999999999999998, "true": 0.9}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:12", "state_id": "catalog_lookup_v2:dev:12", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00117; color=purple; size=large; status=packed; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "purple, large", "candidate_1": "pink, medium", "candidate_2": "black, small", "candidate_3": "yellow, large", "candidate_4": "green, large", "candidate_5": "orange, large", "candidate_6": "white, medium", "candidate_7": "red, medium"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_0", "ready": true, "stage": 2}, "gold_probs": {"match": {"candidate_0": 1, "candidate_1": 0, "candidate_2": 0, "candidate_3": 0, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0}, "ready": {"false": 0, "true": 1}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00117\",\"purple\",\"large\",\"packed\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_1": 0, "candidate_5": 0, "candidate_6": 0, "candidate_2": 0, "candidate_4": 0, "candidate_0": 1, "candidate_7": 0, "candidate_3": 0}, "ready": {"false": 0.10999999999999999, "true": 0.89}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:7", "state_id": "catalog_lookup_v2:dev:7", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00235; color=brown; size=large; status=picked; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "black, medium", "candidate_1": "cyan, large", "candidate_2": "red, medium", "candidate_3": "brown, large", "candidate_4": "green, small", "candidate_5": "orange, medium", "candidate_6": "gray, large", "candidate_7": "orange, small"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_3", "ready": false, "stage": 1}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 1, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 0, "1": 1, "2": 0, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00235\",\"brown\",\"large\",\"picked\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_5": 0, "candidate_6": 0, "candidate_3": 1, "candidate_0": 0, "candidate_7": 0, "candidate_2": 0, "candidate_4": 0, "candidate_1": 0}, "ready": {"false": 0.89, "true": 0.11}, "stage": {"0": 0, "1": 1, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:4", "state_id": "catalog_lookup_v2:dev:4", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00248; color=gray; size=medium; status=new; expedited=yes.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "cyan, medium", "candidate_1": "gray, medium", "candidate_2": "red, medium", "candidate_3": "brown, large", "candidate_4": "gray, large", "candidate_5": "purple, small", "candidate_6": "pink, medium", "candidate_7": "red, large", "candidate_8": "black, small", "candidate_9": "gray, small", "candidate_10": "cyan, large", "candidate_11": "cyan, small", "candidate_12": "orange, medium", "candidate_13": "green, medium", "candidate_14": "blue, small", "candidate_15": "red, small", "candidate_16": "yellow, small", "candidate_17": "black, medium", "candidate_18": "green, large", "candidate_19": "brown, small"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_1", "ready": false, "stage": 0}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 1, "candidate_2": 0, "candidate_3": 0, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0, "candidate_8": 0, "candidate_9": 0, "candidate_10": 0, "candidate_11": 0, "candidate_12": 0, "candidate_13": 0, "candidate_14": 0, "candidate_15": 0, "candidate_16": 0, "candidate_17": 0, "candidate_18": 0, "candidate_19": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00248\",\"gray\",\"medium\",\"new\",\"yes\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_14": 0, "candidate_9": 0, "candidate_0": 0, "candidate_13": 0, "candidate_2": 0, "candidate_7": 0, "candidate_18": 0, "candidate_12": 0, "candidate_11": 0, "candidate_16": 0, "candidate_10": 0, "candidate_5": 0, "candidate_15": 0, "candidate_19": 0, "candidate_1": 1, "candidate_4": 0, "candidate_6": 0, "candidate_17": 0, "candidate_8": 0, "candidate_3": 0}, "ready": {"false": 0.74, "true": 0.26}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:13", "state_id": "catalog_lookup_v2:dev:13", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00232; color=brown; size=large; status=new; expedited=yes.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "purple, medium", "candidate_1": "black, large", "candidate_2": "red, large", "candidate_3": "yellow, large", "candidate_4": "brown, small", "candidate_5": "pink, medium", "candidate_6": "cyan, small", "candidate_7": "yellow, small", "candidate_8": "brown, large", "candidate_9": "pink, large", "candidate_10": "orange, medium", "candidate_11": "gray, medium"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_8", "ready": false, "stage": 0}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 0, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0, "candidate_8": 1, "candidate_9": 0, "candidate_10": 0, "candidate_11": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00232\",\"brown\",\"large\",\"new\",\"yes\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_3": 0, "candidate_2": 0, "candidate_10": 0, "candidate_0": 0, "candidate_11": 0, "candidate_1": 0, "candidate_8": 1, "candidate_4": 0, "candidate_6": 0, "candidate_5": 0, "candidate_7": 0, "candidate_9": 0}, "ready": {"false": 0.72, "true": 0.28}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:14", "state_id": "catalog_lookup_v2:dev:14", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00245; color=gray; size=small; status=packed; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "white, small", "candidate_1": "orange, large", "candidate_2": "pink, small", "candidate_3": "purple, small", "candidate_4": "pink, large", "candidate_5": "red, large", "candidate_6": "cyan, medium", "candidate_7": "cyan, small", "candidate_8": "brown, small", "candidate_9": "green, medium", "candidate_10": "gray, medium", "candidate_11": "pink, medium", "candidate_12": "black, small", "candidate_13": "brown, large", "candidate_14": "red, medium", "candidate_15": "orange, medium", "candidate_16": "gray, small", "candidate_17": "green, small", "candidate_18": "blue, large", "candidate_19": "white, large"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_16", "ready": true, "stage": 2}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 0, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0, "candidate_8": 0, "candidate_9": 0, "candidate_10": 0, "candidate_11": 0, "candidate_12": 0, "candidate_13": 0, "candidate_14": 0, "candidate_15": 0, "candidate_16": 1, "candidate_17": 0, "candidate_18": 0, "candidate_19": 0}, "ready": {"false": 0, "true": 1}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00245\",\"gray\",\"small\",\"packed\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_15": 0, "candidate_19": 0, "candidate_4": 0, "candidate_10": 0, "candidate_9": 0, "candidate_18": 0, "candidate_6": 0, "candidate_13": 0, "candidate_7": 0, "candidate_0": 0, "candidate_8": 0, "candidate_11": 0, "candidate_3": 0, "candidate_2": 0, "candidate_14": 0, "candidate_12": 0, "candidate_16": 1, "candidate_17": 0, "candidate_1": 0, "candidate_5": 0}, "ready": {"false": 0.10999999999999999, "true": 0.89}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:9", "state_id": "catalog_lookup_v2:dev:9", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00183; color=orange; size=medium; status=shipped; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "gray, small", "candidate_1": "brown, large", "candidate_2": "orange, small", "candidate_3": "red, large", "candidate_4": "black, large", "candidate_5": "cyan, large", "candidate_6": "purple, medium", "candidate_7": "red, small", "candidate_8": "green, small", "candidate_9": "purple, small", "candidate_10": "orange, medium", "candidate_11": "gray, large", "candidate_12": "white, small", "candidate_13": "green, medium", "candidate_14": "yellow, small", "candidate_15": "pink, large", "candidate_16": "blue, small", "candidate_17": "blue, large", "candidate_18": "orange, large", "candidate_19": "gray, medium"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_10", "ready": false, "stage": 3}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 0, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0, "candidate_8": 0, "candidate_9": 0, "candidate_10": 1, "candidate_11": 0, "candidate_12": 0, "candidate_13": 0, "candidate_14": 0, "candidate_15": 0, "candidate_16": 0, "candidate_17": 0, "candidate_18": 0, "candidate_19": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00183\",\"orange\",\"medium\",\"shipped\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_0": 0, "candidate_3": 0, "candidate_18": 0, "candidate_6": 0, "candidate_13": 0, "candidate_17": 0, "candidate_4": 0, "candidate_11": 0, "candidate_16": 0, "candidate_19": 0, "candidate_14": 0, "candidate_8": 0, "candidate_9": 0, "candidate_15": 0, "candidate_5": 0, "candidate_10": 1, "candidate_7": 0, "candidate_2": 0, "candidate_12": 0, "candidate_1": 0}, "ready": {"false": 0.98, "true": 0.02}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:15", "state_id": "catalog_lookup_v2:dev:15", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00013; color=red; size=medium; status=packed; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "orange, small", "candidate_1": "red, medium"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_1", "ready": true, "stage": 2}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 1}, "ready": {"false": 0, "true": 1}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00013\",\"red\",\"medium\",\"packed\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_1": 1, "candidate_0": 0}, "ready": {"false": 0.10999999999999999, "true": 0.89}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:18", "state_id": "catalog_lookup_v2:dev:18", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00147; color=black; size=small; status=picked; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "yellow, large", "candidate_1": "green, small", "candidate_2": "gray, large", "candidate_3": "white, small", "candidate_4": "gray, medium", "candidate_5": "blue, medium", "candidate_6": "orange, medium", "candidate_7": "white, medium", "candidate_8": "orange, small", "candidate_9": "cyan, large", "candidate_10": "black, large", "candidate_11": "black, small"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_11", "ready": false, "stage": 1}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 0, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0, "candidate_8": 0, "candidate_9": 0, "candidate_10": 0, "candidate_11": 1}, "ready": {"false": 1, "true": 0}, "stage": {"0": 0, "1": 1, "2": 0, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00147\",\"black\",\"small\",\"picked\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_8": 0, "candidate_3": 0, "candidate_4": 0, "candidate_9": 0, "candidate_10": 0, "candidate_7": 0, "candidate_1": 0, "candidate_5": 0, "candidate_6": 0, "candidate_0": 0, "candidate_11": 1, "candidate_2": 0}, "ready": {"false": 0.84, "true": 0.16}, "stage": {"0": 0, "1": 1, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:19", "state_id": "catalog_lookup_v2:dev:19", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00014; color=red; size=medium; status=shipped; expedited=yes.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "blue, medium", "candidate_1": "blue, small", "candidate_2": "black, medium", "candidate_3": "white, medium", "candidate_4": "red, large", "candidate_5": "gray, medium", "candidate_6": "red, small", "candidate_7": "brown, medium", "candidate_8": "gray, small", "candidate_9": "purple, large", "candidate_10": "cyan, medium", "candidate_11": "cyan, large", "candidate_12": "yellow, medium", "candidate_13": "orange, large", "candidate_14": "black, large", "candidate_15": "white, small", "candidate_16": "red, medium", "candidate_17": "white, large", "candidate_18": "purple, small", "candidate_19": "gray, large"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_16", "ready": false, "stage": 3}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 0, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0, "candidate_8": 0, "candidate_9": 0, "candidate_10": 0, "candidate_11": 0, "candidate_12": 0, "candidate_13": 0, "candidate_14": 0, "candidate_15": 0, "candidate_16": 1, "candidate_17": 0, "candidate_18": 0, "candidate_19": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00014\",\"red\",\"medium\",\"shipped\",\"yes\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_16": 1, "candidate_8": 0, "candidate_4": 0, "candidate_11": 0, "candidate_0": 0, "candidate_1": 0, "candidate_6": 0, "candidate_10": 0, "candidate_13": 0, "candidate_5": 0, "candidate_9": 0, "candidate_2": 0, "candidate_3": 0, "candidate_7": 0, "candidate_12": 0, "candidate_14": 0, "candidate_15": 0, "candidate_17": 0, "candidate_19": 0, "candidate_18": 0}, "ready": {"false": 0.98, "true": 0.02}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:17", "state_id": "catalog_lookup_v2:dev:17", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00188; color=orange; size=large; status=packed; expedited=yes.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "orange, large", "candidate_1": "gray, small", "candidate_2": "yellow, small", "candidate_3": "pink, large", "candidate_4": "purple, small", "candidate_5": "black, small", "candidate_6": "cyan, medium", "candidate_7": "green, medium"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_0", "ready": true, "stage": 2}, "gold_probs": {"match": {"candidate_0": 1, "candidate_1": 0, "candidate_2": 0, "candidate_3": 0, "candidate_4": 0, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0}, "ready": {"false": 0, "true": 1}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00188\",\"orange\",\"large\",\"packed\",\"yes\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_3": 0, "candidate_1": 0, "candidate_6": 0, "candidate_5": 0, "candidate_4": 0, "candidate_0": 1, "candidate_7": 0, "candidate_2": 0}, "ready": {"false": 0.18000000000000005, "true": 0.82}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:16", "state_id": "catalog_lookup_v2:dev:16", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00263; color=gray; size=large; status=shipped; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "gray, large", "candidate_1": "brown, small", "candidate_2": "yellow, large", "candidate_3": "cyan, large", "candidate_4": "white, medium"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_0", "ready": false, "stage": 3}, "gold_probs": {"match": {"candidate_0": 1, "candidate_1": 0, "candidate_2": 0, "candidate_3": 0, "candidate_4": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00263\",\"gray\",\"large\",\"shipped\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_3": 0, "candidate_4": 0, "candidate_1": 0, "candidate_2": 0, "candidate_0": 1}, "ready": {"false": 0.98, "true": 0.02}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:20", "state_id": "catalog_lookup_v2:dev:20", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00280; color=cyan; size=large; status=new; expedited=yes.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "cyan, large", "candidate_1": "brown, small"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_0", "ready": false, "stage": 0}, "gold_probs": {"match": {"candidate_0": 1, "candidate_1": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00280\",\"cyan\",\"large\",\"new\",\"yes\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_0": 1, "candidate_1": 0}, "ready": {"false": 0.73, "true": 0.27}, "stage": {"0": 1, "1": 0, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:22", "state_id": "catalog_lookup_v2:dev:22", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00062; color=green; size=medium; status=shipped; expedited=yes.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "orange, medium", "candidate_1": "brown, large", "candidate_2": "yellow, small", "candidate_3": "black, medium", "candidate_4": "green, medium", "candidate_5": "gray, small", "candidate_6": "red, medium", "candidate_7": "pink, large"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_4", "ready": false, "stage": 3}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 0, "candidate_4": 1, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00062\",\"green\",\"medium\",\"shipped\",\"yes\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_0": 0, "candidate_3": 0, "candidate_4": 1, "candidate_6": 0, "candidate_1": 0, "candidate_5": 0, "candidate_2": 0, "candidate_7": 0}, "ready": {"false": 0.98, "true": 0.02}, "stage": {"0": 0, "1": 0, "2": 0, "3": 1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:21", "state_id": "catalog_lookup_v2:dev:21", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00125; color=white; size=small; status=packed; expedited=no.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "red, medium", "candidate_1": "gray, small", "candidate_2": "yellow, large", "candidate_3": "white, small", "candidate_4": "yellow, small"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_3", "ready": true, "stage": 2}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 1, "candidate_4": 0}, "ready": {"false": 0, "true": 1}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00125\",\"white\",\"small\",\"packed\",\"no\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_1": 0, "candidate_4": 0, "candidate_0": 0, "candidate_3": 1, "candidate_2": 0}, "ready": {"false": 0.12, "true": 0.88}, "stage": {"0": 0, "1": 0, "2": 1, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:2", "state_id": "known_chance_v2:dev:2", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: red=7, brown=7, purple=1, green=5, cyan=6. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"cyan": "The sampled ball is cyan", "purple": "The sampled ball is purple", "red": "The sampled ball is red", "brown": "The sampled ball is brown", "green": "The sampled ball is green"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a red ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: red, green", "The drawn color is one of: brown, cyan", "The drawn color is one of: purple"]}}, "gold": {}, "gold_probs": {"outcome": {"cyan": 0.23076923076923078, "purple": 0.038461538461538464, "red": 0.2692307692307692, "brown": 0.2692307692307692, "green": 0.19230769230769232}, "focus": {"false": 0.7307692307692308, "true": 0.2692307692307692}, "group": {"0": 0.46153846153846156, "1": 0.5, "2": 0.038461538461538464}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"brown\",\"7/26\"],[\"cyan\",\"3/13\"],[\"green\",\"5/26\"],[\"purple\",\"1/26\"],[\"red\",\"7/26\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"cyan": 0.05, "purple": 0.06, "green": 0.04, "red": 0.76, "brown": 0.09}, "focus": {"false": 0.78, "true": 0.22}, "group": {"0": 0.65, "1": 0.31, "2": 0.04}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "catalog_lookup_v2:dev:23", "state_id": "catalog_lookup_v2:dev:23", "family_id": "catalog_lookup_v2", "split": "dev", "state": "Warehouse audit: item=SKU-00026; color=blue; size=small; status=picked; expedited=yes.", "questions": {"match": {"type": "choice", "instructions": "Choose the candidate whose color AND size both match this item. Ignore item code and shipping status.", "criteria": {"candidate_0": "brown, medium", "candidate_1": "green, medium", "candidate_2": "blue, medium", "candidate_3": "orange, small", "candidate_4": "blue, small", "candidate_5": "cyan, medium", "candidate_6": "red, small", "candidate_7": "purple, small", "candidate_8": "purple, medium", "candidate_9": "black, medium", "candidate_10": "black, small", "candidate_11": "yellow, small"}}, "ready": {"type": "boolean", "instructions": "Is this item currently packed but not yet shipped? New, picked, and already shipped items do not qualify."}, "stage": {"type": "score", "instructions": "Select the stage explicitly reported in the record; expedited shipping does not change the current stage.", "criteria": ["New item, not picked", "Picked, not packed", "Packed, not shipped", "Already shipped"]}}, "gold": {"match": "candidate_4", "ready": false, "stage": 1}, "gold_probs": {"match": {"candidate_0": 0, "candidate_1": 0, "candidate_2": 0, "candidate_3": 0, "candidate_4": 1, "candidate_5": 0, "candidate_6": 0, "candidate_7": 0, "candidate_8": 0, "candidate_9": 0, "candidate_10": 0, "candidate_11": 0}, "ready": {"false": 1, "true": 0}, "stage": {"0": 0, "1": 1, "2": 0, "3": 0}}, "gold_probs_kind": "deterministic_truth", "gold_label_kind": "deterministic_truth", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "lookup:[\"SKU-00026\",\"blue\",\"small\",\"picked\",\"yes\"]", "template_id": "catalog_lookup_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"match": {"candidate_4": 1, "candidate_1": 0, "candidate_6": 0, "candidate_9": 0, "candidate_0": 0, "candidate_2": 0, "candidate_8": 0, "candidate_7": 0, "candidate_10": 0, "candidate_11": 0, "candidate_3": 0, "candidate_5": 0}, "ready": {"false": 0.85, "true": 0.15}, "stage": {"0": 0, "1": 1, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:4", "state_id": "known_chance_v2:dev:4", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: black=7, red=4, orange=3, green=4, gray=3, brown=5, pink=1, cyan=4, white=4, yellow=4, blue=3, purple=8. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"orange": "The sampled ball is orange", "blue": "The sampled ball is blue", "pink": "The sampled ball is pink", "purple": "The sampled ball is purple", "green": "The sampled ball is green", "cyan": "The sampled ball is cyan", "white": "The sampled ball is white", "black": "The sampled ball is black", "red": "The sampled ball is red", "brown": "The sampled ball is brown", "gray": "The sampled ball is gray", "yellow": "The sampled ball is yellow"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a orange ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: black, green, pink, yellow", "The drawn color is one of: red, gray, cyan, blue", "The drawn color is one of: orange, brown, white, purple"]}}, "gold": {}, "gold_probs": {"outcome": {"orange": 0.06, "blue": 0.06, "pink": 0.02, "purple": 0.16, "green": 0.08, "cyan": 0.08, "white": 0.08, "black": 0.14, "red": 0.08, "brown": 0.1, "gray": 0.06, "yellow": 0.08}, "focus": {"false": 0.94, "true": 0.06}, "group": {"0": 0.32, "1": 0.28, "2": 0.4}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"7/50\"],[\"blue\",\"3/50\"],[\"brown\",\"1/10\"],[\"cyan\",\"2/25\"],[\"gray\",\"3/50\"],[\"green\",\"2/25\"],[\"orange\",\"3/50\"],[\"pink\",\"1/50\"],[\"purple\",\"4/25\"],[\"red\",\"2/25\"],[\"white\",\"2/25\"],[\"yellow\",\"2/25\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"green": 0, "yellow": 0, "gray": 0, "red": 0, "purple": 0.84, "cyan": 0, "pink": 0.03, "black": 0.13, "blue": 0, "white": 0, "brown": 0, "orange": 0}, "focus": {"false": 0.88, "true": 0.12}, "group": {"0": 0.13, "1": 0.1, "2": 0.77}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:0", "state_id": "known_chance_v2:dev:0", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: blue=5, white=7, brown=3. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"brown": "The sampled ball is brown", "blue": "The sampled ball is blue", "white": "The sampled ball is white"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a blue ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: blue", "The drawn color is one of: white", "The drawn color is one of: brown"]}}, "gold": {}, "gold_probs": {"outcome": {"brown": 0.2, "blue": 0.3333333333333333, "white": 0.4666666666666667}, "focus": {"false": 0.6666666666666667, "true": 0.3333333333333333}, "group": {"0": 0.3333333333333333, "1": 0.4666666666666667, "2": 0.2}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"blue\",\"1/3\"],[\"brown\",\"1/5\"],[\"white\",\"7/15\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"brown": 0.02, "blue": 0.34, "white": 0.64}, "focus": {"false": 0.76, "true": 0.24}, "group": {"0": 0.05, "1": 0.9299999999999999, "2": 0.02}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:1", "state_id": "known_chance_v2:dev:1", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: orange=7, blue=2, green=7, white=1. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"blue": "The sampled ball is blue", "orange": "The sampled ball is orange", "white": "The sampled ball is white", "green": "The sampled ball is green"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a white ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: orange, white", "The drawn color is one of: blue", "The drawn color is one of: green"]}}, "gold": {}, "gold_probs": {"outcome": {"blue": 0.11764705882352941, "orange": 0.4117647058823529, "white": 0.058823529411764705, "green": 0.4117647058823529}, "focus": {"false": 0.9411764705882353, "true": 0.058823529411764705}, "group": {"0": 0.47058823529411764, "1": 0.11764705882352941, "2": 0.4117647058823529}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"blue\",\"2/17\"],[\"green\",\"7/17\"],[\"orange\",\"7/17\"],[\"white\",\"1/17\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"green": 0.07, "orange": 0.91, "white": 0.01, "blue": 0.01}, "focus": {"false": 0.9299999999999999, "true": 0.07}, "group": {"0": 0.67, "1": 0.01, "2": 0.32}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:3", "state_id": "known_chance_v2:dev:3", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: brown=7, pink=7, purple=9, cyan=7, green=6, black=2, yellow=8, orange=2. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"yellow": "The sampled ball is yellow", "black": "The sampled ball is black", "cyan": "The sampled ball is cyan", "orange": "The sampled ball is orange", "brown": "The sampled ball is brown", "green": "The sampled ball is green", "purple": "The sampled ball is purple", "pink": "The sampled ball is pink"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a black ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: brown, cyan, yellow", "The drawn color is one of: pink, green, orange", "The drawn color is one of: purple, black"]}}, "gold": {}, "gold_probs": {"outcome": {"yellow": 0.16666666666666666, "black": 0.041666666666666664, "cyan": 0.14583333333333334, "orange": 0.041666666666666664, "brown": 0.14583333333333334, "green": 0.125, "purple": 0.1875, "pink": 0.14583333333333334}, "focus": {"false": 0.9583333333333334, "true": 0.041666666666666664}, "group": {"0": 0.45833333333333337, "1": 0.3125, "2": 0.22916666666666666}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"1/24\"],[\"brown\",\"7/48\"],[\"cyan\",\"7/48\"],[\"green\",\"1/8\"],[\"orange\",\"1/24\"],[\"pink\",\"7/48\"],[\"purple\",\"3/16\"],[\"yellow\",\"1/6\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"pink": 0.01, "purple": 0.82, "cyan": 0.01, "brown": 0.11, "yellow": 0.02, "black": 0.01, "orange": 0.01, "green": 0.01}, "focus": {"false": 0.92, "true": 0.08}, "group": {"0": 0.72, "1": 0.05, "2": 0.23}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:5", "state_id": "known_chance_v2:dev:5", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: orange=8, purple=5, gray=9. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"orange": "The sampled ball is orange", "gray": "The sampled ball is gray", "purple": "The sampled ball is purple"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a orange ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: orange", "The drawn color is one of: purple", "The drawn color is one of: gray"]}}, "gold": {}, "gold_probs": {"outcome": {"orange": 0.36363636363636365, "gray": 0.4090909090909091, "purple": 0.22727272727272727}, "focus": {"false": 0.6363636363636364, "true": 0.36363636363636365}, "group": {"0": 0.36363636363636365, "1": 0.22727272727272727, "2": 0.4090909090909091}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"gray\",\"9/22\"],[\"orange\",\"4/11\"],[\"purple\",\"5/22\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"purple": 0.02, "orange": 0.32, "gray": 0.66}, "focus": {"false": 0.71, "true": 0.29}, "group": {"0": 0.11, "1": 0.02, "2": 0.87}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:6", "state_id": "known_chance_v2:dev:6", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: brown=4, orange=1, gray=5, blue=4. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"orange": "The sampled ball is orange", "brown": "The sampled ball is brown", "blue": "The sampled ball is blue", "gray": "The sampled ball is gray"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a orange ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: brown, blue", "The drawn color is one of: orange", "The drawn color is one of: gray"]}}, "gold": {}, "gold_probs": {"outcome": {"orange": 0.07142857142857142, "brown": 0.2857142857142857, "blue": 0.2857142857142857, "gray": 0.35714285714285715}, "focus": {"false": 0.9285714285714286, "true": 0.07142857142857142}, "group": {"0": 0.5714285714285714, "1": 0.07142857142857142, "2": 0.35714285714285715}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"blue\",\"2/7\"],[\"brown\",\"2/7\"],[\"gray\",\"5/14\"],[\"orange\",\"1/14\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"brown": 0.16, "orange": 0.02, "gray": 0.8, "blue": 0.01}, "focus": {"false": 0.88, "true": 0.12}, "group": {"0": 0.21, "1": 0.01, "2": 0.78}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:9", "state_id": "known_chance_v2:dev:9", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: pink=6, white=1, brown=3, purple=3, red=5, blue=7, orange=9, gray=6, black=9, green=2, cyan=1, yellow=1. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"orange": "The sampled ball is orange", "black": "The sampled ball is black", "red": "The sampled ball is red", "green": "The sampled ball is green", "cyan": "The sampled ball is cyan", "gray": "The sampled ball is gray", "pink": "The sampled ball is pink", "white": "The sampled ball is white", "blue": "The sampled ball is blue", "purple": "The sampled ball is purple", "brown": "The sampled ball is brown", "yellow": "The sampled ball is yellow"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a pink ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: pink, purple, orange, green", "The drawn color is one of: white, red, gray, cyan", "The drawn color is one of: brown, blue, black, yellow"]}}, "gold": {}, "gold_probs": {"outcome": {"orange": 0.16981132075471697, "black": 0.16981132075471697, "red": 0.09433962264150944, "green": 0.03773584905660377, "cyan": 0.018867924528301886, "gray": 0.11320754716981132, "pink": 0.11320754716981132, "white": 0.018867924528301886, "blue": 0.1320754716981132, "purple": 0.05660377358490566, "brown": 0.05660377358490566, "yellow": 0.018867924528301886}, "focus": {"false": 0.8867924528301887, "true": 0.11320754716981132}, "group": {"0": 0.3773584905660377, "1": 0.24528301886792453, "2": 0.3773584905660377}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"9/53\"],[\"blue\",\"7/53\"],[\"brown\",\"3/53\"],[\"cyan\",\"1/53\"],[\"gray\",\"6/53\"],[\"green\",\"2/53\"],[\"orange\",\"9/53\"],[\"pink\",\"6/53\"],[\"purple\",\"3/53\"],[\"red\",\"5/53\"],[\"white\",\"1/53\"],[\"yellow\",\"1/53\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"purple": 0.01, "cyan": 0.02, "yellow": 0.01, "white": 0.01, "gray": 0.02, "red": 0.01, "blue": 0.11, "orange": 0.53, "pink": 0.11, "green": 0, "black": 0.16, "brown": 0.01}, "focus": {"false": 0.87, "true": 0.13}, "group": {"0": 0.4, "1": 0.03, "2": 0.57}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:13", "state_id": "known_chance_v2:dev:13", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: green=4, pink=2, white=4, black=9, yellow=4, blue=6, orange=2, gray=2. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"blue": "The sampled ball is blue", "orange": "The sampled ball is orange", "black": "The sampled ball is black", "green": "The sampled ball is green", "yellow": "The sampled ball is yellow", "pink": "The sampled ball is pink", "white": "The sampled ball is white", "gray": "The sampled ball is gray"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a black ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: green, black, orange", "The drawn color is one of: pink, yellow, gray", "The drawn color is one of: white, blue"]}}, "gold": {}, "gold_probs": {"outcome": {"blue": 0.18181818181818182, "orange": 0.06060606060606061, "black": 0.2727272727272727, "green": 0.12121212121212122, "yellow": 0.12121212121212122, "pink": 0.06060606060606061, "white": 0.12121212121212122, "gray": 0.06060606060606061}, "focus": {"false": 0.7272727272727273, "true": 0.2727272727272727}, "group": {"0": 0.45454545454545453, "1": 0.24242424242424243, "2": 0.30303030303030304}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"3/11\"],[\"blue\",\"2/11\"],[\"gray\",\"2/33\"],[\"green\",\"4/33\"],[\"orange\",\"2/33\"],[\"pink\",\"2/33\"],[\"white\",\"4/33\"],[\"yellow\",\"4/33\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"white": 0, "pink": 0, "yellow": 0, "green": 0.03, "gray": 0, "black": 0.96, "orange": 0, "blue": 0.01}, "focus": {"false": 0.74, "true": 0.26}, "group": {"0": 0.8, "1": 0.02, "2": 0.18}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:7", "state_id": "known_chance_v2:dev:7", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: red=2, gray=9, purple=7, black=8, brown=3. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"black": "The sampled ball is black", "purple": "The sampled ball is purple", "gray": "The sampled ball is gray", "red": "The sampled ball is red", "brown": "The sampled ball is brown"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a gray ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: red, black", "The drawn color is one of: gray, brown", "The drawn color is one of: purple"]}}, "gold": {}, "gold_probs": {"outcome": {"black": 0.27586206896551724, "purple": 0.2413793103448276, "gray": 0.3103448275862069, "red": 0.06896551724137931, "brown": 0.10344827586206896}, "focus": {"false": 0.6896551724137931, "true": 0.3103448275862069}, "group": {"0": 0.3448275862068966, "1": 0.41379310344827586, "2": 0.2413793103448276}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"8/29\"],[\"brown\",\"3/29\"],[\"gray\",\"9/29\"],[\"purple\",\"7/29\"],[\"red\",\"2/29\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"gray": 0.9, "purple": 0.01, "red": 0.07, "brown": 0, "black": 0.02}, "focus": {"false": 0.72, "true": 0.28}, "group": {"0": 0.1, "1": 0.83, "2": 0.07}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:10", "state_id": "known_chance_v2:dev:10", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: blue=4, black=2, gray=9. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"black": "The sampled ball is black", "gray": "The sampled ball is gray", "blue": "The sampled ball is blue"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a black ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: blue", "The drawn color is one of: black", "The drawn color is one of: gray"]}}, "gold": {}, "gold_probs": {"outcome": {"black": 0.13333333333333333, "gray": 0.6, "blue": 0.26666666666666666}, "focus": {"false": 0.8666666666666667, "true": 0.13333333333333333}, "group": {"0": 0.26666666666666666, "1": 0.13333333333333333, "2": 0.6}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"2/15\"],[\"blue\",\"4/15\"],[\"gray\",\"3/5\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"black": 0.01, "blue": 0.04, "gray": 0.95}, "focus": {"false": 0.8200000000000001, "true": 0.18}, "group": {"0": 0.01, "1": 0.01, "2": 0.98}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:12", "state_id": "known_chance_v2:dev:12", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: blue=1, cyan=3, pink=4, red=1, black=3. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"red": "The sampled ball is red", "pink": "The sampled ball is pink", "cyan": "The sampled ball is cyan", "black": "The sampled ball is black", "blue": "The sampled ball is blue"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a red ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: blue, red", "The drawn color is one of: cyan, black", "The drawn color is one of: pink"]}}, "gold": {}, "gold_probs": {"outcome": {"red": 0.08333333333333333, "pink": 0.3333333333333333, "cyan": 0.25, "black": 0.25, "blue": 0.08333333333333333}, "focus": {"false": 0.9166666666666666, "true": 0.08333333333333333}, "group": {"0": 0.16666666666666666, "1": 0.5, "2": 0.3333333333333333}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"1/4\"],[\"blue\",\"1/12\"],[\"cyan\",\"1/4\"],[\"pink\",\"1/3\"],[\"red\",\"1/12\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"pink": 0.92, "black": 0.01, "cyan": 0.03, "red": 0, "blue": 0.04}, "focus": {"false": 0.86, "true": 0.14}, "group": {"0": 0.01, "1": 0.32, "2": 0.67}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:8", "state_id": "known_chance_v2:dev:8", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: orange=2, green=8, yellow=9, purple=4, cyan=5, gray=1, red=7, brown=4. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"green": "The sampled ball is green", "orange": "The sampled ball is orange", "yellow": "The sampled ball is yellow", "purple": "The sampled ball is purple", "red": "The sampled ball is red", "gray": "The sampled ball is gray", "brown": "The sampled ball is brown", "cyan": "The sampled ball is cyan"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a red ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: orange, purple, red", "The drawn color is one of: green, cyan, brown", "The drawn color is one of: yellow, gray"]}}, "gold": {}, "gold_probs": {"outcome": {"green": 0.2, "orange": 0.05, "yellow": 0.225, "purple": 0.1, "red": 0.175, "gray": 0.025, "brown": 0.1, "cyan": 0.125}, "focus": {"false": 0.825, "true": 0.175}, "group": {"0": 0.325, "1": 0.42500000000000004, "2": 0.25}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"brown\",\"1/10\"],[\"cyan\",\"1/8\"],[\"gray\",\"1/40\"],[\"green\",\"1/5\"],[\"orange\",\"1/20\"],[\"purple\",\"1/10\"],[\"red\",\"7/40\"],[\"yellow\",\"9/40\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"brown": 0, "green": 0.02, "purple": 0, "cyan": 0, "red": 0.01, "orange": 0.01, "gray": 0.01, "yellow": 0.9400000000000001}, "focus": {"false": 0.85, "true": 0.15}, "group": {"0": 0.02, "1": 0.54, "2": 0.44}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:11", "state_id": "known_chance_v2:dev:11", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: cyan=7, yellow=5, green=2, gray=4. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"yellow": "The sampled ball is yellow", "cyan": "The sampled ball is cyan", "gray": "The sampled ball is gray", "green": "The sampled ball is green"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a green ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: cyan, gray", "The drawn color is one of: yellow", "The drawn color is one of: green"]}}, "gold": {}, "gold_probs": {"outcome": {"yellow": 0.2777777777777778, "cyan": 0.3888888888888889, "gray": 0.2222222222222222, "green": 0.1111111111111111}, "focus": {"false": 0.8888888888888888, "true": 0.1111111111111111}, "group": {"0": 0.6111111111111112, "1": 0.2777777777777778, "2": 0.1111111111111111}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"cyan\",\"7/18\"],[\"gray\",\"2/9\"],[\"green\",\"1/9\"],[\"yellow\",\"5/18\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"gray": 0, "green": 0.01, "yellow": 0.01, "cyan": 0.98}, "focus": {"false": 0.88, "true": 0.12}, "group": {"0": 0.97, "1": 0.02, "2": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:16", "state_id": "known_chance_v2:dev:16", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: gray=5, purple=7, orange=2, brown=3. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"gray": "The sampled ball is gray", "orange": "The sampled ball is orange", "purple": "The sampled ball is purple", "brown": "The sampled ball is brown"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a brown ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: gray, brown", "The drawn color is one of: purple", "The drawn color is one of: orange"]}}, "gold": {}, "gold_probs": {"outcome": {"gray": 0.29411764705882354, "orange": 0.11764705882352941, "purple": 0.4117647058823529, "brown": 0.17647058823529413}, "focus": {"false": 0.8235294117647058, "true": 0.17647058823529413}, "group": {"0": 0.47058823529411764, "1": 0.4117647058823529, "2": 0.11764705882352941}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"brown\",\"3/17\"],[\"gray\",\"5/17\"],[\"orange\",\"2/17\"],[\"purple\",\"7/17\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"purple": 0.77, "orange": 0.01, "brown": 0.01, "gray": 0.21}, "focus": {"false": 0.83, "true": 0.17}, "group": {"0": 0.24, "1": 0.75, "2": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:17", "state_id": "known_chance_v2:dev:17", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: yellow=9, black=5, brown=8, pink=4, purple=2. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"black": "The sampled ball is black", "pink": "The sampled ball is pink", "brown": "The sampled ball is brown", "purple": "The sampled ball is purple", "yellow": "The sampled ball is yellow"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a yellow ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: yellow, pink", "The drawn color is one of: black, purple", "The drawn color is one of: brown"]}}, "gold": {}, "gold_probs": {"outcome": {"black": 0.17857142857142858, "pink": 0.14285714285714285, "brown": 0.2857142857142857, "purple": 0.07142857142857142, "yellow": 0.32142857142857145}, "focus": {"false": 0.6785714285714286, "true": 0.32142857142857145}, "group": {"0": 0.4642857142857143, "1": 0.25, "2": 0.2857142857142857}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"5/28\"],[\"brown\",\"2/7\"],[\"pink\",\"1/7\"],[\"purple\",\"1/14\"],[\"yellow\",\"9/28\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"purple": 0.01, "yellow": 0.98, "black": 0, "brown": 0.01, "pink": 0}, "focus": {"false": 0.73, "true": 0.27}, "group": {"0": 0.82, "1": 0.04, "2": 0.14}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:18", "state_id": "known_chance_v2:dev:18", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: black=1, white=5, blue=3, brown=5, gray=5, pink=8, red=3, cyan=8. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"pink": "The sampled ball is pink", "black": "The sampled ball is black", "red": "The sampled ball is red", "white": "The sampled ball is white", "cyan": "The sampled ball is cyan", "brown": "The sampled ball is brown", "blue": "The sampled ball is blue", "gray": "The sampled ball is gray"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a blue ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: black, brown, red", "The drawn color is one of: white, gray, cyan", "The drawn color is one of: blue, pink"]}}, "gold": {}, "gold_probs": {"outcome": {"pink": 0.21052631578947367, "black": 0.02631578947368421, "red": 0.07894736842105263, "white": 0.13157894736842105, "cyan": 0.21052631578947367, "brown": 0.13157894736842105, "blue": 0.07894736842105263, "gray": 0.13157894736842105}, "focus": {"false": 0.9210526315789473, "true": 0.07894736842105263}, "group": {"0": 0.23684210526315788, "1": 0.47368421052631576, "2": 0.2894736842105263}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"1/38\"],[\"blue\",\"3/38\"],[\"brown\",\"5/38\"],[\"cyan\",\"4/19\"],[\"gray\",\"5/38\"],[\"pink\",\"4/19\"],[\"red\",\"3/38\"],[\"white\",\"5/38\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"pink": 0.42, "white": 0.04, "cyan": 0.18, "brown": 0.02, "blue": 0.01, "gray": 0.01, "red": 0.01, "black": 0.31}, "focus": {"false": 0.87, "true": 0.13}, "group": {"0": 0.03, "1": 0.58, "2": 0.39}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:14", "state_id": "known_chance_v2:dev:14", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: red=4, pink=5, blue=1, white=3, cyan=6, orange=5, black=1, green=9, purple=5, gray=8, yellow=4, brown=5. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"green": "The sampled ball is green", "pink": "The sampled ball is pink", "purple": "The sampled ball is purple", "white": "The sampled ball is white", "blue": "The sampled ball is blue", "cyan": "The sampled ball is cyan", "black": "The sampled ball is black", "red": "The sampled ball is red", "orange": "The sampled ball is orange", "brown": "The sampled ball is brown", "gray": "The sampled ball is gray", "yellow": "The sampled ball is yellow"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a white ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: red, white, black, gray", "The drawn color is one of: pink, cyan, green, yellow", "The drawn color is one of: blue, orange, purple, brown"]}}, "gold": {}, "gold_probs": {"outcome": {"green": 0.16071428571428573, "pink": 0.08928571428571429, "purple": 0.08928571428571429, "white": 0.05357142857142857, "blue": 0.017857142857142856, "cyan": 0.10714285714285714, "black": 0.017857142857142856, "red": 0.07142857142857142, "orange": 0.08928571428571429, "brown": 0.08928571428571429, "gray": 0.14285714285714285, "yellow": 0.07142857142857142}, "focus": {"false": 0.9464285714285714, "true": 0.05357142857142857}, "group": {"0": 0.2857142857142857, "1": 0.4285714285714286, "2": 0.2857142857142857}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"1/56\"],[\"blue\",\"1/56\"],[\"brown\",\"5/56\"],[\"cyan\",\"3/28\"],[\"gray\",\"1/7\"],[\"green\",\"9/56\"],[\"orange\",\"5/56\"],[\"pink\",\"5/56\"],[\"purple\",\"5/56\"],[\"red\",\"1/14\"],[\"white\",\"3/56\"],[\"yellow\",\"1/14\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"white": 0, "purple": 0, "brown": 0, "orange": 0, "black": 0, "pink": 0.01, "yellow": 0, "gray": 0.02, "cyan": 0.02, "blue": 0.02, "green": 0.9, "red": 0.03}, "focus": {"false": 0.9, "true": 0.1}, "group": {"0": 0.03, "1": 0.96, "2": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:19", "state_id": "known_chance_v2:dev:19", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: blue=5, cyan=9, orange=8, green=7, brown=7, purple=2, black=2, white=6, gray=4, yellow=1, red=9, pink=6. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"black": "The sampled ball is black", "white": "The sampled ball is white", "green": "The sampled ball is green", "purple": "The sampled ball is purple", "cyan": "The sampled ball is cyan", "pink": "The sampled ball is pink", "orange": "The sampled ball is orange", "blue": "The sampled ball is blue", "yellow": "The sampled ball is yellow", "gray": "The sampled ball is gray", "red": "The sampled ball is red", "brown": "The sampled ball is brown"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a green ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: blue, green, black, yellow", "The drawn color is one of: cyan, brown, white, red", "The drawn color is one of: orange, purple, gray, pink"]}}, "gold": {}, "gold_probs": {"outcome": {"black": 0.030303030303030304, "white": 0.09090909090909091, "green": 0.10606060606060606, "purple": 0.030303030303030304, "cyan": 0.13636363636363635, "pink": 0.09090909090909091, "orange": 0.12121212121212122, "blue": 0.07575757575757576, "yellow": 0.015151515151515152, "gray": 0.06060606060606061, "red": 0.13636363636363635, "brown": 0.10606060606060606}, "focus": {"false": 0.8939393939393939, "true": 0.10606060606060606}, "group": {"0": 0.2272727272727273, "1": 0.46969696969696967, "2": 0.30303030303030304}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"1/33\"],[\"blue\",\"5/66\"],[\"brown\",\"7/66\"],[\"cyan\",\"3/22\"],[\"gray\",\"2/33\"],[\"green\",\"7/66\"],[\"orange\",\"4/33\"],[\"pink\",\"1/11\"],[\"purple\",\"1/33\"],[\"red\",\"3/22\"],[\"white\",\"1/11\"],[\"yellow\",\"1/66\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"blue": 0.12, "red": 0.22, "gray": 0.01, "orange": 0.03, "green": 0.01, "black": 0.01, "white": 0.01, "yellow": 0.1, "pink": 0.01, "purple": 0, "cyan": 0.47, "brown": 0.01}, "focus": {"false": 0.87, "true": 0.13}, "group": {"0": 0.01, "1": 0.98, "2": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:21", "state_id": "known_chance_v2:dev:21", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: black=5, cyan=7, brown=4, blue=7. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"blue": "The sampled ball is blue", "black": "The sampled ball is black", "cyan": "The sampled ball is cyan", "brown": "The sampled ball is brown"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a cyan ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: black, blue", "The drawn color is one of: cyan", "The drawn color is one of: brown"]}}, "gold": {}, "gold_probs": {"outcome": {"blue": 0.30434782608695654, "black": 0.21739130434782608, "cyan": 0.30434782608695654, "brown": 0.17391304347826086}, "focus": {"false": 0.6956521739130435, "true": 0.30434782608695654}, "group": {"0": 0.5217391304347826, "1": 0.30434782608695654, "2": 0.17391304347826086}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"5/23\"],[\"blue\",\"7/23\"],[\"brown\",\"4/23\"],[\"cyan\",\"7/23\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"cyan": 0.4, "blue": 0.13, "brown": 0.03, "black": 0.44}, "focus": {"false": 0.74, "true": 0.26}, "group": {"0": 0.34, "1": 0.64, "2": 0.02}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:20", "state_id": "known_chance_v2:dev:20", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: black=5, brown=5, red=9. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"brown": "The sampled ball is brown", "black": "The sampled ball is black", "red": "The sampled ball is red"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a black ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: black", "The drawn color is one of: brown", "The drawn color is one of: red"]}}, "gold": {}, "gold_probs": {"outcome": {"brown": 0.2631578947368421, "black": 0.2631578947368421, "red": 0.47368421052631576}, "focus": {"false": 0.736842105263158, "true": 0.2631578947368421}, "group": {"0": 0.2631578947368421, "1": 0.2631578947368421, "2": 0.47368421052631576}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"5/19\"],[\"brown\",\"5/19\"],[\"red\",\"9/19\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"black": 0.16, "brown": 0.02, "red": 0.82}, "focus": {"false": 0.77, "true": 0.23}, "group": {"0": 0.03, "1": 0.01, "2": 0.96}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:15", "state_id": "known_chance_v2:dev:15", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: black=2, gray=3, white=4. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"white": "The sampled ball is white", "black": "The sampled ball is black", "gray": "The sampled ball is gray"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a white ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: black", "The drawn color is one of: gray", "The drawn color is one of: white"]}}, "gold": {}, "gold_probs": {"outcome": {"white": 0.4444444444444444, "black": 0.2222222222222222, "gray": 0.3333333333333333}, "focus": {"false": 0.5555555555555556, "true": 0.4444444444444444}, "group": {"0": 0.2222222222222222, "1": 0.3333333333333333, "2": 0.4444444444444444}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"2/9\"],[\"gray\",\"1/3\"],[\"white\",\"4/9\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"gray": 0.03, "black": 0.18, "white": 0.79}, "focus": {"false": 0.6699999999999999, "true": 0.33}, "group": {"0": 0.04, "1": 0.03, "2": 0.9299999999999999}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:22", "state_id": "known_chance_v2:dev:22", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: purple=5, orange=5, red=9, white=6, black=9. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"purple": "The sampled ball is purple", "white": "The sampled ball is white", "orange": "The sampled ball is orange", "red": "The sampled ball is red", "black": "The sampled ball is black"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a red ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: purple, white", "The drawn color is one of: orange, black", "The drawn color is one of: red"]}}, "gold": {}, "gold_probs": {"outcome": {"purple": 0.14705882352941177, "white": 0.17647058823529413, "orange": 0.14705882352941177, "red": 0.2647058823529412, "black": 0.2647058823529412}, "focus": {"false": 0.7352941176470589, "true": 0.2647058823529412}, "group": {"0": 0.3235294117647059, "1": 0.4117647058823529, "2": 0.2647058823529412}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"9/34\"],[\"orange\",\"5/34\"],[\"purple\",\"5/34\"],[\"red\",\"9/34\"],[\"white\",\"3/17\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"white": 0.03, "black": 0.11, "purple": 0.15, "orange": 0.02, "red": 0.69}, "focus": {"false": 0.73, "true": 0.27}, "group": {"0": 0.05, "1": 0.28, "2": 0.67}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:23", "state_id": "known_chance_v2:dev:23", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: yellow=4, purple=5, gray=6, cyan=6, pink=2, blue=8, white=4, orange=2. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"blue": "The sampled ball is blue", "pink": "The sampled ball is pink", "gray": "The sampled ball is gray", "white": "The sampled ball is white", "cyan": "The sampled ball is cyan", "orange": "The sampled ball is orange", "yellow": "The sampled ball is yellow", "purple": "The sampled ball is purple"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a white ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: yellow, cyan, white", "The drawn color is one of: purple, pink, orange", "The drawn color is one of: gray, blue"]}}, "gold": {}, "gold_probs": {"outcome": {"blue": 0.21621621621621623, "pink": 0.05405405405405406, "gray": 0.16216216216216217, "white": 0.10810810810810811, "cyan": 0.16216216216216217, "orange": 0.05405405405405406, "yellow": 0.10810810810810811, "purple": 0.13513513513513514}, "focus": {"false": 0.8918918918918919, "true": 0.10810810810810811}, "group": {"0": 0.3783783783783784, "1": 0.24324324324324326, "2": 0.3783783783783784}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"blue\",\"8/37\"],[\"cyan\",\"6/37\"],[\"gray\",\"6/37\"],[\"orange\",\"2/37\"],[\"pink\",\"2/37\"],[\"purple\",\"5/37\"],[\"white\",\"4/37\"],[\"yellow\",\"4/37\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"gray": 0.02, "yellow": 0.03, "purple": 0.01, "blue": 0.9, "white": 0.01, "cyan": 0.02, "orange": 0.01, "pink": 0}, "focus": {"false": 0.86, "true": 0.14}, "group": {"0": 0.04, "1": 0.01, "2": 0.95}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:24", "state_id": "known_chance_v2:dev:24", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: white=2, yellow=3, purple=9, black=9, gray=2, cyan=9, blue=6, red=1, orange=1, pink=7, green=9, brown=5. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"blue": "The sampled ball is blue", "cyan": "The sampled ball is cyan", "orange": "The sampled ball is orange", "yellow": "The sampled ball is yellow", "brown": "The sampled ball is brown", "white": "The sampled ball is white", "green": "The sampled ball is green", "gray": "The sampled ball is gray", "red": "The sampled ball is red", "purple": "The sampled ball is purple", "black": "The sampled ball is black", "pink": "The sampled ball is pink"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a black ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: white, black, blue, pink", "The drawn color is one of: yellow, gray, red, green", "The drawn color is one of: purple, cyan, orange, brown"]}}, "gold": {}, "gold_probs": {"outcome": {"blue": 0.09523809523809523, "cyan": 0.14285714285714285, "orange": 0.015873015873015872, "yellow": 0.047619047619047616, "brown": 0.07936507936507936, "white": 0.031746031746031744, "green": 0.14285714285714285, "gray": 0.031746031746031744, "red": 0.015873015873015872, "purple": 0.14285714285714285, "black": 0.14285714285714285, "pink": 0.1111111111111111}, "focus": {"false": 0.8571428571428572, "true": 0.14285714285714285}, "group": {"0": 0.38095238095238093, "1": 0.23809523809523808, "2": 0.38095238095238093}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"1/7\"],[\"blue\",\"2/21\"],[\"brown\",\"5/63\"],[\"cyan\",\"1/7\"],[\"gray\",\"2/63\"],[\"green\",\"1/7\"],[\"orange\",\"1/63\"],[\"pink\",\"1/9\"],[\"purple\",\"1/7\"],[\"red\",\"1/63\"],[\"white\",\"2/63\"],[\"yellow\",\"1/21\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"green": 0.09, "orange": 0.01, "red": 0.02, "purple": 0.55, "pink": 0.01, "gray": 0, "brown": 0.01, "white": 0.07, "cyan": 0.05, "black": 0.15, "blue": 0.03, "yellow": 0.01}, "focus": {"false": 0.83, "true": 0.17}, "group": {"0": 0.23, "1": 0.07, "2": 0.7}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:25", "state_id": "known_chance_v2:dev:25", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: yellow=1, cyan=8, pink=7. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"yellow": "The sampled ball is yellow", "pink": "The sampled ball is pink", "cyan": "The sampled ball is cyan"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a cyan ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: yellow", "The drawn color is one of: cyan", "The drawn color is one of: pink"]}}, "gold": {}, "gold_probs": {"outcome": {"yellow": 0.0625, "pink": 0.4375, "cyan": 0.5}, "focus": {"false": 0.5, "true": 0.5}, "group": {"0": 0.0625, "1": 0.5, "2": 0.4375}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"cyan\",\"1/2\"],[\"pink\",\"7/16\"],[\"yellow\",\"1/16\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"pink": 0.02, "yellow": 0.08, "cyan": 0.9}, "focus": {"false": 0.56, "true": 0.44}, "group": {"0": 0.01, "1": 0.96, "2": 0.03}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:26", "state_id": "known_chance_v2:dev:26", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: green=7, yellow=2, black=7, cyan=9. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"black": "The sampled ball is black", "cyan": "The sampled ball is cyan", "green": "The sampled ball is green", "yellow": "The sampled ball is yellow"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a cyan ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: green, cyan", "The drawn color is one of: yellow", "The drawn color is one of: black"]}}, "gold": {}, "gold_probs": {"outcome": {"black": 0.28, "cyan": 0.36, "green": 0.28, "yellow": 0.08}, "focus": {"false": 0.64, "true": 0.36}, "group": {"0": 0.64, "1": 0.08, "2": 0.28}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"7/25\"],[\"cyan\",\"9/25\"],[\"green\",\"7/25\"],[\"yellow\",\"2/25\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"yellow": 0.02, "green": 0.15, "cyan": 0.81, "black": 0.02}, "focus": {"false": 0.73, "true": 0.27}, "group": {"0": 0.98, "1": 0.01, "2": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:29", "state_id": "known_chance_v2:dev:29", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: pink=9, black=9, purple=5, red=5, cyan=3, orange=4, green=5, blue=9, brown=9, yellow=5, white=2, gray=3. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"pink": "The sampled ball is pink", "brown": "The sampled ball is brown", "cyan": "The sampled ball is cyan", "gray": "The sampled ball is gray", "purple": "The sampled ball is purple", "black": "The sampled ball is black", "green": "The sampled ball is green", "yellow": "The sampled ball is yellow", "red": "The sampled ball is red", "white": "The sampled ball is white", "blue": "The sampled ball is blue", "orange": "The sampled ball is orange"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a red ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: pink, red, green, yellow", "The drawn color is one of: black, cyan, blue, white", "The drawn color is one of: purple, orange, brown, gray"]}}, "gold": {}, "gold_probs": {"outcome": {"pink": 0.1323529411764706, "brown": 0.1323529411764706, "cyan": 0.04411764705882353, "gray": 0.04411764705882353, "purple": 0.07352941176470588, "black": 0.1323529411764706, "green": 0.07352941176470588, "yellow": 0.07352941176470588, "red": 0.07352941176470588, "white": 0.029411764705882353, "blue": 0.1323529411764706, "orange": 0.058823529411764705}, "focus": {"false": 0.9264705882352942, "true": 0.07352941176470588}, "group": {"0": 0.35294117647058826, "1": 0.3382352941176471, "2": 0.3088235294117647}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"9/68\"],[\"blue\",\"9/68\"],[\"brown\",\"9/68\"],[\"cyan\",\"3/68\"],[\"gray\",\"3/68\"],[\"green\",\"5/68\"],[\"orange\",\"1/17\"],[\"pink\",\"9/68\"],[\"purple\",\"5/68\"],[\"red\",\"5/68\"],[\"white\",\"1/34\"],[\"yellow\",\"5/68\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"brown": 0.02, "green": 0.01, "white": 0.09, "purple": 0.01, "cyan": 0.01, "red": 0.01, "orange": 0.01, "gray": 0.02, "black": 0.1, "blue": 0.09, "pink": 0.62, "yellow": 0.01}, "focus": {"false": 0.87, "true": 0.13}, "group": {"0": 0.46, "1": 0.42, "2": 0.12}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:27", "state_id": "known_chance_v2:dev:27", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: red=5, green=2, cyan=3, white=8, brown=5. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"white": "The sampled ball is white", "green": "The sampled ball is green", "brown": "The sampled ball is brown", "cyan": "The sampled ball is cyan", "red": "The sampled ball is red"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a green ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: red, white", "The drawn color is one of: green, brown", "The drawn color is one of: cyan"]}}, "gold": {}, "gold_probs": {"outcome": {"white": 0.34782608695652173, "green": 0.08695652173913043, "brown": 0.21739130434782608, "cyan": 0.13043478260869565, "red": 0.21739130434782608}, "focus": {"false": 0.9130434782608696, "true": 0.08695652173913043}, "group": {"0": 0.5652173913043478, "1": 0.30434782608695654, "2": 0.13043478260869565}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"brown\",\"5/23\"],[\"cyan\",\"3/23\"],[\"green\",\"2/23\"],[\"red\",\"5/23\"],[\"white\",\"8/23\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"white": 0.9299999999999999, "brown": 0.01, "red": 0.04, "cyan": 0.01, "green": 0.01}, "focus": {"false": 0.86, "true": 0.14}, "group": {"0": 0.98, "1": 0.01, "2": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:28", "state_id": "known_chance_v2:dev:28", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: orange=5, cyan=5, white=3, blue=7, purple=7, black=7, green=7, yellow=6. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"blue": "The sampled ball is blue", "black": "The sampled ball is black", "orange": "The sampled ball is orange", "white": "The sampled ball is white", "purple": "The sampled ball is purple", "cyan": "The sampled ball is cyan", "yellow": "The sampled ball is yellow", "green": "The sampled ball is green"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a green ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: orange, blue, green", "The drawn color is one of: cyan, purple, yellow", "The drawn color is one of: white, black"]}}, "gold": {}, "gold_probs": {"outcome": {"blue": 0.14893617021276595, "black": 0.14893617021276595, "orange": 0.10638297872340426, "white": 0.06382978723404255, "purple": 0.14893617021276595, "cyan": 0.10638297872340426, "yellow": 0.1276595744680851, "green": 0.14893617021276595}, "focus": {"false": 0.851063829787234, "true": 0.14893617021276595}, "group": {"0": 0.40425531914893614, "1": 0.3829787234042553, "2": 0.21276595744680848}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"black\",\"7/47\"],[\"blue\",\"7/47\"],[\"cyan\",\"5/47\"],[\"green\",\"7/47\"],[\"orange\",\"5/47\"],[\"purple\",\"7/47\"],[\"white\",\"3/47\"],[\"yellow\",\"6/47\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"cyan": 0.02, "green": 0.05, "blue": 0.42, "purple": 0.06, "white": 0.06, "black": 0.04, "orange": 0.28, "yellow": 0.07}, "focus": {"false": 0.8200000000000001, "true": 0.18}, "group": {"0": 0.84, "1": 0.11, "2": 0.05}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:31", "state_id": "known_chance_v2:dev:31", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: pink=2, blue=8, yellow=4, purple=8. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"yellow": "The sampled ball is yellow", "blue": "The sampled ball is blue", "pink": "The sampled ball is pink", "purple": "The sampled ball is purple"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a purple ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: pink, purple", "The drawn color is one of: blue", "The drawn color is one of: yellow"]}}, "gold": {}, "gold_probs": {"outcome": {"yellow": 0.18181818181818182, "blue": 0.36363636363636365, "pink": 0.09090909090909091, "purple": 0.36363636363636365}, "focus": {"false": 0.6363636363636364, "true": 0.36363636363636365}, "group": {"0": 0.4545454545454546, "1": 0.36363636363636365, "2": 0.18181818181818182}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"blue\",\"4/11\"],[\"pink\",\"1/11\"],[\"purple\",\"4/11\"],[\"yellow\",\"2/11\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"blue": 0.8, "purple": 0.05, "pink": 0.13, "yellow": 0.02}, "focus": {"false": 0.74, "true": 0.26}, "group": {"0": 0.17, "1": 0.81, "2": 0.02}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "known_chance_v2:dev:30", "state_id": "known_chance_v2:dev:30", "family_id": "known_chance_v2", "split": "dev", "state": "Sampling experiment: exactly one ball is drawn uniformly from a bag. Counts: purple=6, orange=7, yellow=4. All possible colors are listed; the draw has NOT happened.", "questions": {"outcome": {"type": "choice", "instructions": "Predict the unobserved random draw. Return the conditional probability of each candidate event given the bag. These events are mutually exclusive and exhaustive.", "criteria": {"yellow": "The sampled ball is yellow", "purple": "The sampled ball is purple", "orange": "The sampled ball is orange"}}, "focus": {"type": "boolean", "instructions": "Will the unobserved draw produce a orange ball? Use the conditional probability given only this bag."}, "group": {"type": "score", "instructions": "Predict which mutually exclusive group the unobserved sampled color belongs to. Probabilities are determined by the bag counts.", "criteria": ["The drawn color is one of: purple", "The drawn color is one of: orange", "The drawn color is one of: yellow"]}}, "gold": {}, "gold_probs": {"outcome": {"yellow": 0.23529411764705882, "purple": 0.35294117647058826, "orange": 0.4117647058823529}, "focus": {"false": 0.5882352941176471, "true": 0.4117647058823529}, "group": {"0": 0.35294117647058826, "1": 0.4117647058823529, "2": 0.23529411764705882}}, "gold_probs_kind": "programmatic_conditional_distribution", "gold_label_kind": "unobserved", "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "chance:[[\"orange\",\"7/17\"],[\"purple\",\"6/17\"],[\"yellow\",\"4/17\"]]", "template_id": "known_chance_v2:dev"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"outcome": {"orange": 0.78, "yellow": 0.01, "purple": 0.21}, "focus": {"false": 0.6599999999999999, "true": 0.34}, "group": {"0": 0.05, "1": 0.9299999999999999, "2": 0.02}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:333cf30b0343539c590a9c9a", "state_id": "grid_navigation:333cf30b0343539c590a9c9a", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\nG . # #\nA . # .\n# . . #\n. . # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"north": "Move one cell north.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "north", "solvable": true, "value": 0}, "gold_probs": {"action": {"north": 1.0, "east": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["north"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 0):walls=((0, 2), (0, 3), (1, 2), (2, 0), (2, 3), (3, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 2], [0, 3], [1, 2], [2, 0], [2, 3], [3, 2]], "position": [1, 0], "goal": [0, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"north": 0.86, "east": 0.14}, "solvable": {"false": 0.31000000000000005, "true": 0.69}, "value": {"0": 0.4, "1": 0.36, "2": 0.13, "3": 0.11}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:e071dea538bde195d47a3d7d", "state_id": "grid_navigation:e071dea538bde195d47a3d7d", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# # # .\n. . # G\n# # # A\n. # # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"south": "Move one cell south.", "north": "Move one cell north."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "north", "solvable": true, "value": 0}, "gold_probs": {"action": {"south": 0.0, "north": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["north"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((1, 0), (1, 1), (1, 2), (1, 3), (2, 0), (2, 2), (2, 3), (3, 0), (3, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [0, 1], [0, 2], [1, 2], [2, 0], [2, 1], [2, 2], [3, 1], [3, 2]], "position": [2, 3], "goal": [1, 3]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"north": 0.84, "south": 0.16}, "solvable": {"false": 0.55, "true": 0.45}, "value": {"0": 0.22, "1": 0.3, "2": 0.15, "3": 0.33}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:8854fcd843ae09633a1142ac", "state_id": "tic_tac_toe:8854fcd843ae09633a1142ac", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO . .\nX . X\n. O X\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_2": "Place O in row 1, column 2 (cell 2).", "cell_7": "Place O in row 3, column 1 (cell 7).", "cell_5": "Place O in row 2, column 2 (cell 5).", "cell_3": "Place O in row 1, column 3 (cell 3)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_2", "solvable": false, "value": 0}, "gold_probs": {"action": {"cell_2": 0.25, "cell_7": 0.25, "cell_5": 0.25, "cell_3": 0.25}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_2", "cell_3", "cell_5", "cell_7"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..OX.XXO.:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "O..X.X.OX", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_3": 0.19, "cell_7": 0.21, "cell_2": 0.16, "cell_5": 0.44}, "solvable": {"false": 0.9, "true": 0.1}, "value": {"0": 0.54, "1": 0.3, "2": 0.16}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:20a1596920e53d0073f4d79f", "state_id": "grid_navigation:20a1596920e53d0073f4d79f", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# # . #\n. . # .\n. . . A\nG # # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"north": "Move one cell north.", "west": "Move one cell west.", "south": "Move one cell south."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "west", "solvable": true, "value": 1}, "gold_probs": {"action": {"north": 0.0, "west": 1.0, "south": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 0):walls=((0, 1), (0, 2), (2, 2), (3, 0), (3, 1), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [0, 1], [0, 3], [1, 2], [3, 1], [3, 2]], "position": [2, 3], "goal": [3, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"north": 0.13, "west": 0.7, "south": 0.17}, "solvable": {"false": 0.26, "true": 0.74}, "value": {"0": 0.03, "1": 0.42, "2": 0.38, "3": 0.17}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:3e31f23d39e8f27ef640d127", "state_id": "tic_tac_toe:3e31f23d39e8f27ef640d127", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX . O\nX X O\n. O .\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_7": "Place X in row 3, column 1 (cell 7).", "cell_2": "Place X in row 1, column 2 (cell 2).", "cell_9": "Place X in row 3, column 3 (cell 9)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_7", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_7": 0.5, "cell_2": 0.0, "cell_9": 0.5}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_7", "cell_9"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.O.OXXO.X:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "X.OXXO.O.", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_2": 0.25, "cell_7": 0.46, "cell_9": 0.29}, "solvable": {"false": 0.74, "true": 0.26}, "value": {"0": 0.36, "1": 0.37, "2": 0.27}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:994efb03dbfa8a5b227dc85d", "state_id": "tic_tac_toe:994efb03dbfa8a5b227dc85d", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO X O\nO . .\nX X .\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_9": "Place X in row 3, column 3 (cell 9).", "cell_6": "Place X in row 2, column 3 (cell 6).", "cell_5": "Place X in row 2, column 2 (cell 5)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_5", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_9": 0.3333333333333333, "cell_6": 0.3333333333333333, "cell_5": 0.3333333333333333}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_5", "cell_6", "cell_9"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..OX.XXOO:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "OXOO..XX.", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_9": 0.55, "cell_6": 0.17, "cell_5": 0.28}, "solvable": {"false": 0.39, "true": 0.61}, "value": {"0": 0.12, "1": 0.15, "2": 0.73}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:706e9f06a03a858739833f77", "state_id": "tic_tac_toe:706e9f06a03a858739833f77", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. . O\nX O X\n. X .\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_9": "Place O in row 3, column 3 (cell 9).", "cell_2": "Place O in row 1, column 2 (cell 2).", "cell_1": "Place O in row 1, column 1 (cell 1).", "cell_7": "Place O in row 3, column 1 (cell 7)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_1", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_9": 0.25, "cell_2": 0.25, "cell_1": 0.25, "cell_7": 0.25}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_1", "cell_2", "cell_7", "cell_9"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..OXOX.X.:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "..OXOX.X.", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_2": 0.22, "cell_1": 0.31, "cell_9": 0.24, "cell_7": 0.23}, "solvable": {"false": 0.91, "true": 0.09}, "value": {"0": 0.3, "1": 0.5, "2": 0.2}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:c97753e5ae4f469f1224843d", "state_id": "tic_tac_toe:c97753e5ae4f469f1224843d", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX O .\n. O X\nO X .\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_3": "Place X in row 1, column 3 (cell 3).", "cell_4": "Place X in row 2, column 1 (cell 4).", "cell_9": "Place X in row 3, column 3 (cell 9)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_3", "solvable": false, "value": 1}, "gold_probs": {"action": {"cell_3": 1.0, "cell_4": 0.0, "cell_9": 0.0}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_3"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.OXXO..XO:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "XO..OXOX.", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_3": 0.28, "cell_9": 0.47, "cell_4": 0.25}, "solvable": {"false": 0.78, "true": 0.22}, "value": {"0": 0.41000000000000003, "1": 0.37, "2": 0.22}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:745e57abfbc8996356b160e5", "state_id": "grid_navigation:745e57abfbc8996356b160e5", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. . . .\n# . . .\n# G # #\n# A . #", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"north": "Move one cell north.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "north", "solvable": true, "value": 0}, "gold_probs": {"action": {"north": 1.0, "east": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["north"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(1, 1):walls=((0, 0), (0, 1), (0, 2), (2, 1), (3, 0), (3, 1))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[1, 0], [2, 0], [2, 2], [2, 3], [3, 0], [3, 3]], "position": [3, 1], "goal": [2, 1]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"north": 0.66, "east": 0.34}, "solvable": {"false": 0.30000000000000004, "true": 0.7}, "value": {"0": 0.41, "1": 0.38, "2": 0.09, "3": 0.12}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:dc49dae0ae2ccdc8a58c31db", "state_id": "tic_tac_toe:dc49dae0ae2ccdc8a58c31db", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX O X\nO . .\n. O X\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_7": "Place X in row 3, column 1 (cell 7).", "cell_5": "Place X in row 2, column 2 (cell 5).", "cell_6": "Place X in row 2, column 3 (cell 6)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_5", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_7": 0.0, "cell_5": 0.5, "cell_6": 0.5}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_5", "cell_6"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.OXO..XOX:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "XOXO...OX", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_5": 0.62, "cell_7": 0.19, "cell_6": 0.19}, "solvable": {"false": 0.74, "true": 0.26}, "value": {"0": 0.18, "1": 0.46, "2": 0.36}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:d896b943317c5edbd43fcc86", "state_id": "grid_navigation:d896b943317c5edbd43fcc86", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# . . #\n# . A G\n. . . .\n. # # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"north": "Move one cell north.", "south": "Move one cell south.", "west": "Move one cell west.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": true, "value": 0}, "gold_probs": {"action": {"north": 0.0, "south": 0.0, "west": 0.0, "east": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 0), (1, 3), (2, 3), (3, 0), (3, 1))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [0, 3], [1, 0], [3, 1], [3, 2]], "position": [1, 2], "goal": [1, 3]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"south": 0.01, "north": 0, "west": 0.01, "east": 0.98}, "solvable": {"false": 0.020000000000000018, "true": 0.98}, "value": {"0": 1, "1": 0, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:ec9807802da066e186543409", "state_id": "tic_tac_toe:ec9807802da066e186543409", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO X .\n. O .\nO X X\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_6": "Place X in row 2, column 3 (cell 6).", "cell_4": "Place X in row 2, column 1 (cell 4).", "cell_3": "Place X in row 1, column 3 (cell 3)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_3", "solvable": false, "value": 0}, "gold_probs": {"action": {"cell_6": 0.3333333333333333, "cell_4": 0.3333333333333333, "cell_3": 0.3333333333333333}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_3", "cell_4", "cell_6"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..XXOXO.O:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "OX..O.OXX", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_4": 0.38, "cell_3": 0.35, "cell_6": 0.27}, "solvable": {"false": 0.62, "true": 0.38}, "value": {"0": 0.29, "1": 0.31, "2": 0.4}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:3c6d27084e9e53391709956a", "state_id": "tic_tac_toe:3c6d27084e9e53391709956a", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX X O\nX . .\nO . .\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_8": "Place O in row 3, column 2 (cell 8).", "cell_5": "Place O in row 2, column 2 (cell 5).", "cell_9": "Place O in row 3, column 3 (cell 9).", "cell_6": "Place O in row 2, column 3 (cell 6)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_5", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_8": 0.25, "cell_5": 0.25, "cell_9": 0.25, "cell_6": 0.25}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_5", "cell_6", "cell_8", "cell_9"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..O..XOXX:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "XXOX..O..", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_6": 0.14, "cell_9": 0.1, "cell_5": 0.66, "cell_8": 0.1}, "solvable": {"false": 0.92, "true": 0.08}, "value": {"0": 0.72, "1": 0.18, "2": 0.1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:ad31d2e9953534b3dcd00aee", "state_id": "tic_tac_toe:ad31d2e9953534b3dcd00aee", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO X X\nX . O\n. O .\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_9": "Place X in row 3, column 3 (cell 9).", "cell_7": "Place X in row 3, column 1 (cell 7).", "cell_5": "Place X in row 2, column 2 (cell 5)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_5", "solvable": false, "value": 1}, "gold_probs": {"action": {"cell_9": 0.3333333333333333, "cell_7": 0.3333333333333333, "cell_5": 0.3333333333333333}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_5", "cell_7", "cell_9"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.O.O.XXXO:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "OXXX.O.O.", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_7": 0.25, "cell_9": 0.2, "cell_5": 0.55}, "solvable": {"false": 0.63, "true": 0.37}, "value": {"0": 0.26, "1": 0.41, "2": 0.33}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:2fb54d6f7ad94c1fee331f9d", "state_id": "grid_navigation:2fb54d6f7ad94c1fee331f9d", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# G . .\n# . . #\n. . . #\n. A . #", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"east": "Move one cell east.", "west": "Move one cell west.", "north": "Move one cell north."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "north", "solvable": true, "value": 1}, "gold_probs": {"action": {"east": 0.0, "west": 0.0, "north": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["north"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 0), (1, 0), (1, 3), (2, 3), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [1, 0], [1, 3], [2, 3], [3, 3]], "position": [3, 1], "goal": [0, 1]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.11, "north": 0.73, "west": 0.16}, "solvable": {"false": 0.22999999999999998, "true": 0.77}, "value": {"0": 0.02, "1": 0.51, "2": 0.32, "3": 0.15}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:021e638a2f914d9195088a74", "state_id": "grid_navigation:021e638a2f914d9195088a74", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\nG . . #\n# # . #\n. A # #\n# . # #", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "south": "Move one cell south."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "south", "solvable": false, "value": 3}, "gold_probs": {"action": {"west": 0.5, "south": 0.5}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 0.0, "2": 0.0, "3": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["south", "west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 0):walls=((0, 1), (0, 3), (1, 1), (2, 2), (2, 3), (3, 0), (3, 1), (3, 2), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 3], [1, 0], [1, 1], [1, 3], [2, 2], [2, 3], [3, 0], [3, 2], [3, 3]], "position": [2, 1], "goal": [0, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"south": 0.38, "west": 0.62}, "solvable": {"false": 0.51, "true": 0.49}, "value": {"0": 0.08, "1": 0.41, "2": 0.23, "3": 0.28}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:8bc9d5ab36f6028775c5dcc6", "state_id": "grid_navigation:8bc9d5ab36f6028775c5dcc6", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# . # #\n. . . G\n. A # .\n# . . .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"south": "Move one cell south.", "north": "Move one cell north.", "west": "Move one cell west."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "north", "solvable": true, "value": 1}, "gold_probs": {"action": {"south": 0.0, "north": 1.0, "west": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["north"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 0), (1, 0), (1, 2), (3, 0), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [0, 2], [0, 3], [2, 2], [3, 0]], "position": [2, 1], "goal": [1, 3]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"west": 0.2, "north": 0.7, "south": 0.1}, "solvable": {"false": 0.17000000000000004, "true": 0.83}, "value": {"0": 0.13, "1": 0.63, "2": 0.17, "3": 0.07}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:2d53cfc0ce6ddc1006157e94", "state_id": "tic_tac_toe:2d53cfc0ce6ddc1006157e94", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX . .\n. X O\n. . O\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_4": "Place X in row 2, column 1 (cell 4).", "cell_2": "Place X in row 1, column 2 (cell 2).", "cell_3": "Place X in row 1, column 3 (cell 3).", "cell_7": "Place X in row 3, column 1 (cell 7).", "cell_8": "Place X in row 3, column 2 (cell 8)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_3", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_4": 0.0, "cell_2": 0.0, "cell_3": 1.0, "cell_7": 0.0, "cell_8": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_3"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..O.XOX..:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "X...XO..O", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_3": 0.18, "cell_7": 0.17, "cell_2": 0.22, "cell_4": 0.2, "cell_8": 0.23}, "solvable": {"false": 0.84, "true": 0.16}, "value": {"0": 0.34, "1": 0.45, "2": 0.21}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:92d98a727f6eae7ae56e2077", "state_id": "grid_navigation:92d98a727f6eae7ae56e2077", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# # . #\n. # # .\n. . G A\n# . . #", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "north": "Move one cell north."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "west", "solvable": true, "value": 0}, "gold_probs": {"action": {"west": 1.0, "north": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(1, 1):walls=((0, 0), (0, 3), (1, 2), (2, 2), (2, 3), (3, 0), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [0, 1], [0, 3], [1, 1], [1, 2], [3, 0], [3, 3]], "position": [2, 3], "goal": [2, 2]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"north": 0.05, "west": 0.95}, "solvable": {"false": 0.08999999999999997, "true": 0.91}, "value": {"0": 0.86, "1": 0.1, "2": 0.03, "3": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:b6fe7b865892738dbbdba5b2", "state_id": "grid_navigation:b6fe7b865892738dbbdba5b2", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. . A .\nG . . .\n# # . #\n. . . .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"east": "Move one cell east.", "south": "Move one cell south.", "west": "Move one cell west."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "south", "solvable": true, "value": 1}, "gold_probs": {"action": {"east": 0.0, "south": 0.5, "west": 0.5}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["south", "west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 2), (1, 2), (3, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[2, 0], [2, 1], [2, 3]], "position": [0, 2], "goal": [1, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.01, "south": 0.15, "west": 0.84}, "solvable": {"false": 0.12, "true": 0.88}, "value": {"0": 0.2, "1": 0.64, "2": 0.12, "3": 0.04}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:97bb2d037cc9fb7bc4504530", "state_id": "tic_tac_toe:97bb2d037cc9fb7bc4504530", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX X O\n. . O\nX O .\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_5": "Place X in row 2, column 2 (cell 5).", "cell_9": "Place X in row 3, column 3 (cell 9).", "cell_4": "Place X in row 2, column 1 (cell 4)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_4", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_5": 0.0, "cell_9": 0.5, "cell_4": 0.5}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_4", "cell_9"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.OOO.XX.X:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "XXO..OXO.", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_5": 0.32, "cell_9": 0.47, "cell_4": 0.21}, "solvable": {"false": 0.76, "true": 0.24}, "value": {"0": 0.3, "1": 0.45, "2": 0.25}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:1c6a677bbaef40e852f0585c", "state_id": "tic_tac_toe:1c6a677bbaef40e852f0585c", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX X O\nO O .\n. X X\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_6": "Place O in row 2, column 3 (cell 6).", "cell_7": "Place O in row 3, column 1 (cell 7)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_6", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_6": 0.5, "cell_7": 0.5}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_6", "cell_7"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.OXXOXX.O:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "XXOOO..XX", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_6": 0.67, "cell_7": 0.33}, "solvable": {"false": 0.79, "true": 0.21}, "value": {"0": 0.3, "1": 0.36, "2": 0.34}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:afb4ff0f839aa62a75fad20a", "state_id": "grid_navigation:afb4ff0f839aa62a75fad20a", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. # . .\n. . G .\nA # . .\n. . . .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"north": "Move one cell north.", "south": "Move one cell south."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "north", "solvable": true, "value": 1}, "gold_probs": {"action": {"north": 1.0, "south": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["north"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(1, 1):walls=((0, 2), (2, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 1], [2, 1]], "position": [2, 0], "goal": [1, 2]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"south": 0.25, "north": 0.75}, "solvable": {"false": 0.16000000000000003, "true": 0.84}, "value": {"0": 0.1, "1": 0.71, "2": 0.15, "3": 0.04}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:3b2cc34bf80930183b327743", "state_id": "tic_tac_toe:3b2cc34bf80930183b327743", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO . O\nX X .\n. . X\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_8": "Place O in row 3, column 2 (cell 8).", "cell_2": "Place O in row 1, column 2 (cell 2).", "cell_7": "Place O in row 3, column 1 (cell 7).", "cell_6": "Place O in row 2, column 3 (cell 6)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_2", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_8": 0.0, "cell_2": 1.0, "cell_7": 0.0, "cell_6": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_2"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..XXX.O.O:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "O.OXX...X", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_8": 0.17, "cell_7": 0.15, "cell_2": 0.16, "cell_6": 0.52}, "solvable": {"false": 0.86, "true": 0.14}, "value": {"0": 0.47, "1": 0.36, "2": 0.17}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:88b67d80d2e01653a7d07a05", "state_id": "grid_navigation:88b67d80d2e01653a7d07a05", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# . . A\n. . . .\nG . # #\n# . # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "south": "Move one cell south."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "south", "solvable": true, "value": 1}, "gold_probs": {"action": {"west": 0.5, "south": 0.5}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["south", "west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 0), (0, 3), (2, 0), (2, 1), (3, 1))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [2, 2], [2, 3], [3, 0], [3, 2]], "position": [0, 3], "goal": [2, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"south": 0.51, "west": 0.49}, "solvable": {"false": 0.15000000000000002, "true": 0.85}, "value": {"0": 0.01, "1": 0.63, "2": 0.29, "3": 0.07}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:27105926830f0bc7bbcd34cf", "state_id": "grid_navigation:27105926830f0bc7bbcd34cf", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. # # .\n# . A .\n. # # G\n. . . #", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"east": "Move one cell east.", "west": "Move one cell west."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": true, "value": 0}, "gold_probs": {"action": {"east": 1.0, "west": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 0), (1, 1), (1, 3), (2, 1), (2, 3), (3, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 1], [0, 2], [1, 0], [2, 1], [2, 2], [3, 3]], "position": [1, 2], "goal": [2, 3]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.66, "west": 0.34}, "solvable": {"false": 0.55, "true": 0.45}, "value": {"0": 0.12, "1": 0.43, "2": 0.22, "3": 0.23}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:909e1e80331eb17724cb5f45", "state_id": "tic_tac_toe:909e1e80331eb17724cb5f45", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. X .\n. X O\n. . O\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_1": "Place X in row 1, column 1 (cell 1).", "cell_3": "Place X in row 1, column 3 (cell 3).", "cell_4": "Place X in row 2, column 1 (cell 4).", "cell_8": "Place X in row 3, column 2 (cell 8).", "cell_7": "Place X in row 3, column 1 (cell 7)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_3", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_1": 0.0, "cell_3": 0.5, "cell_4": 0.0, "cell_8": 0.5, "cell_7": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_3", "cell_8"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:....XXOO.:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": ".X..XO..O", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_4": 0.21, "cell_3": 0.13, "cell_7": 0.26, "cell_8": 0.17, "cell_1": 0.23}, "solvable": {"false": 0.73, "true": 0.27}, "value": {"0": 0.35, "1": 0.35, "2": 0.3}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:bad5dc473dab4b80017c23d8", "state_id": "grid_navigation:bad5dc473dab4b80017c23d8", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# . # .\n# . . #\n# . A .\n. G . .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"south": "Move one cell south.", "east": "Move one cell east.", "north": "Move one cell north.", "west": "Move one cell west."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "south", "solvable": true, "value": 0}, "gold_probs": {"action": {"south": 0.5, "east": 0.0, "north": 0.0, "west": 0.5}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["south", "west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((1, 0), (2, 0), (2, 3), (3, 0), (3, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [0, 2], [1, 0], [1, 3], [2, 0]], "position": [2, 2], "goal": [3, 1]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"west": 0.51, "north": 0.04, "south": 0.44, "east": 0.01}, "solvable": {"false": 0.12, "true": 0.88}, "value": {"0": 0.25, "1": 0.63, "2": 0.07, "3": 0.05}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:09a9fcbe6420de93d556f1f6", "state_id": "grid_navigation:09a9fcbe6420de93d556f1f6", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. # # G\n. # . .\n# A . .\n# . # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"south": "Move one cell south.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": true, "value": 1}, "gold_probs": {"action": {"south": 0.0, "east": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 0):walls=((0, 1), (0, 2), (1, 2), (2, 3), (3, 1), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 1], [0, 2], [1, 1], [2, 0], [3, 0], [3, 2]], "position": [2, 1], "goal": [0, 3]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.91, "south": 0.09}, "solvable": {"false": 0.5700000000000001, "true": 0.43}, "value": {"0": 0.02, "1": 0.33, "2": 0.35, "3": 0.3}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:b73cc3d3225e9d7b6715b9cf", "state_id": "tic_tac_toe:b73cc3d3225e9d7b6715b9cf", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO X .\nX O X\n. O X\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_3": "Place O in row 1, column 3 (cell 3).", "cell_7": "Place O in row 3, column 1 (cell 7)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_3", "solvable": false, "value": 1}, "gold_probs": {"action": {"cell_3": 1.0, "cell_7": 0.0}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_3"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.OXXOXOX.:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "OX.XOX.OX", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_7": 0.6, "cell_3": 0.4}, "solvable": {"false": 0.9299999999999999, "true": 0.07}, "value": {"0": 0.71, "1": 0.23, "2": 0.06}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:6633607d723d5edfabde6c66", "state_id": "tic_tac_toe:6633607d723d5edfabde6c66", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. X X\n. O X\nO X O\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_4": "Place O in row 2, column 1 (cell 4).", "cell_1": "Place O in row 1, column 1 (cell 1)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_1", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_4": 0.0, "cell_1": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_1"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..OXOXXXO:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": ".XX.OXOXO", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_1": 0.6, "cell_4": 0.4}, "solvable": {"false": 0.88, "true": 0.12}, "value": {"0": 0.44, "1": 0.39, "2": 0.17}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:02e96a9fe5e28dc9b13bee57", "state_id": "tic_tac_toe:02e96a9fe5e28dc9b13bee57", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. . .\n. O O\n. X X\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_3": "Place X in row 1, column 3 (cell 3).", "cell_4": "Place X in row 2, column 1 (cell 4).", "cell_7": "Place X in row 3, column 1 (cell 7).", "cell_2": "Place X in row 1, column 2 (cell 2).", "cell_1": "Place X in row 1, column 1 (cell 1)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_7", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_3": 0.0, "cell_4": 0.0, "cell_7": 1.0, "cell_2": 0.0, "cell_1": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_7"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:....OO.XX:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "....OO.XX", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_4": 0.27, "cell_7": 0.35, "cell_3": 0.1, "cell_1": 0.15, "cell_2": 0.13}, "solvable": {"false": 0.6, "true": 0.4}, "value": {"0": 0.22, "1": 0.34, "2": 0.44}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:543f4ceda4e1c72d246f72bf", "state_id": "tic_tac_toe:543f4ceda4e1c72d246f72bf", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO O .\nO . X\nX . X\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_5": "Place X in row 2, column 2 (cell 5).", "cell_8": "Place X in row 3, column 2 (cell 8).", "cell_3": "Place X in row 1, column 3 (cell 3)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_3", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_5": 0.0, "cell_8": 0.5, "cell_3": 0.5}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_3", "cell_8"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.OOX.OX.X:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "OO.O.XX.X", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_3": 0.2, "cell_8": 0.23, "cell_5": 0.56}, "solvable": {"false": 0.6, "true": 0.4}, "value": {"0": 0.4, "1": 0.27, "2": 0.33}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:ca0b4bb94407809644e92dee", "state_id": "tic_tac_toe:ca0b4bb94407809644e92dee", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. . O\nX O X\n. O X\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_7": "Place X in row 3, column 1 (cell 7).", "cell_1": "Place X in row 1, column 1 (cell 1).", "cell_2": "Place X in row 1, column 2 (cell 2)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_1", "solvable": false, "value": 0}, "gold_probs": {"action": {"cell_7": 0.3333333333333333, "cell_1": 0.3333333333333333, "cell_2": 0.3333333333333333}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_1", "cell_2", "cell_7"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..OXOX.OX:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "..OXOX.OX", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_1": 0.4, "cell_2": 0.2, "cell_7": 0.39999999999999997}, "solvable": {"false": 0.6799999999999999, "true": 0.32}, "value": {"0": 0.32, "1": 0.4, "2": 0.28}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:593ae89c1f152814ea0c5c3b", "state_id": "grid_navigation:593ae89c1f152814ea0c5c3b", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. . . A\n. . . .\n. . # G\n# . . #", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"south": "Move one cell south.", "west": "Move one cell west."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "south", "solvable": true, "value": 0}, "gold_probs": {"action": {"south": 1.0, "west": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["south"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 0), (1, 1), (3, 0))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[2, 2], [3, 0], [3, 3]], "position": [0, 3], "goal": [2, 3]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"west": 0.19, "south": 0.81}, "solvable": {"false": 0.18000000000000005, "true": 0.82}, "value": {"0": 0.01, "1": 0.6, "2": 0.29, "3": 0.1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:69b680f0d4f4f8387ac233a7", "state_id": "grid_navigation:69b680f0d4f4f8387ac233a7", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# . A .\n# . . G\n. . . .\n# . . .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "east": "Move one cell east.", "south": "Move one cell south."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": true, "value": 0}, "gold_probs": {"action": {"west": 0.0, "east": 0.5, "south": 0.5}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east", "south"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((3, 0), (3, 1), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [1, 0], [3, 0]], "position": [0, 2], "goal": [1, 3]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"south": 0.21, "west": 0.05, "east": 0.74}, "solvable": {"false": 0.06999999999999995, "true": 0.93}, "value": {"0": 0.66, "1": 0.3, "2": 0.03, "3": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:eb45f5d4d02ec420efbaa956", "state_id": "grid_navigation:eb45f5d4d02ec420efbaa956", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. A . .\n. # . G\n. # . .\n. . # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": true, "value": 1}, "gold_probs": {"action": {"west": 0.0, "east": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((1, 3), (2, 1), (2, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[1, 1], [2, 1], [3, 2]], "position": [0, 1], "goal": [1, 3]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"west": 0.1, "east": 0.9}, "solvable": {"false": 0.25, "true": 0.75}, "value": {"0": 0.06, "1": 0.71, "2": 0.17, "3": 0.06}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:56719bae51ddad611d9f4ac1", "state_id": "grid_navigation:56719bae51ddad611d9f4ac1", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. . # #\n. . # .\n. A # #\n. # G .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "north": "Move one cell north."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "north", "solvable": false, "value": 3}, "gold_probs": {"action": {"west": 0.5, "north": 0.5}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 0.0, "2": 0.0, "3": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["north", "west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 2), (1, 0), (1, 1), (2, 1), (3, 0), (3, 1))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 2], [0, 3], [1, 2], [2, 2], [2, 3], [3, 1]], "position": [2, 1], "goal": [3, 2]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"west": 0.47, "north": 0.53}, "solvable": {"false": 0.63, "true": 0.37}, "value": {"0": 0.15, "1": 0.35000000000000003, "2": 0.2, "3": 0.3}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:8b4d5c9b8bdbd7d9e2d1af5a", "state_id": "tic_tac_toe:8b4d5c9b8bdbd7d9e2d1af5a", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO X O\n. . .\nX . .\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_6": "Place X in row 2, column 3 (cell 6).", "cell_4": "Place X in row 2, column 1 (cell 4).", "cell_8": "Place X in row 3, column 2 (cell 8).", "cell_9": "Place X in row 3, column 3 (cell 9).", "cell_5": "Place X in row 2, column 2 (cell 5)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_8", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_6": 0.0, "cell_4": 0.0, "cell_8": 1.0, "cell_9": 0.0, "cell_5": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_8"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..O..XX.O:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "OXO...X..", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_5": 0.51, "cell_9": 0.09, "cell_8": 0.09, "cell_6": 0.06, "cell_4": 0.25}, "solvable": {"false": 0.84, "true": 0.16}, "value": {"0": 0.26, "1": 0.51, "2": 0.23}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:875daa108051d1ccf3766987", "state_id": "tic_tac_toe:875daa108051d1ccf3766987", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO . .\nX O X\n. . .\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_3": "Place X in row 1, column 3 (cell 3).", "cell_9": "Place X in row 3, column 3 (cell 9).", "cell_2": "Place X in row 1, column 2 (cell 2).", "cell_8": "Place X in row 3, column 2 (cell 8).", "cell_7": "Place X in row 3, column 1 (cell 7)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_2", "solvable": false, "value": 0}, "gold_probs": {"action": {"cell_3": 0.2, "cell_9": 0.2, "cell_2": 0.2, "cell_8": 0.2, "cell_7": 0.2}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_2", "cell_3", "cell_7", "cell_8", "cell_9"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:...XOX..O:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "O..XOX...", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_9": 0.15, "cell_7": 0.24, "cell_3": 0.21, "cell_8": 0.15, "cell_2": 0.25}, "solvable": {"false": 0.78, "true": 0.22}, "value": {"0": 0.2, "1": 0.49, "2": 0.31}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:fc28fb280580938d827383db", "state_id": "grid_navigation:fc28fb280580938d827383db", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. # # .\nG # # #\n# # A .\n# # . .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"east": "Move one cell east.", "south": "Move one cell south."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": false, "value": 3}, "gold_probs": {"action": {"east": 0.5, "south": 0.5}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 0.0, "2": 0.0, "3": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east", "south"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 2), (0, 3), (1, 0), (1, 1), (1, 2), (1, 3), (2, 0), (2, 1), (3, 1))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 1], [0, 2], [1, 1], [1, 2], [1, 3], [2, 0], [2, 1], [3, 0], [3, 1]], "position": [2, 2], "goal": [1, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.63, "south": 0.37}, "solvable": {"false": 0.78, "true": 0.22}, "value": {"0": 0.03, "1": 0.14, "2": 0.15, "3": 0.6799999999999999}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:b3ca27f3f0695f7d8ac8989c", "state_id": "tic_tac_toe:b3ca27f3f0695f7d8ac8989c", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX X .\nX X O\n. O O\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_7": "Place O in row 3, column 1 (cell 7).", "cell_3": "Place O in row 1, column 3 (cell 3)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_3", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_7": 0.5, "cell_3": 0.5}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_3", "cell_7"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.OOXXOXX.:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "XX.XXO.OO", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_3": 0.55, "cell_7": 0.45}, "solvable": {"false": 0.85, "true": 0.15}, "value": {"0": 0.44, "1": 0.31, "2": 0.25}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:6429a0a5f4beacbb44d3dc3b", "state_id": "tic_tac_toe:6429a0a5f4beacbb44d3dc3b", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO . .\nX . O\nO X X\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_3": "Place X in row 1, column 3 (cell 3).", "cell_5": "Place X in row 2, column 2 (cell 5).", "cell_2": "Place X in row 1, column 2 (cell 2)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_2", "solvable": false, "value": 1}, "gold_probs": {"action": {"cell_3": 0.3333333333333333, "cell_5": 0.3333333333333333, "cell_2": 0.3333333333333333}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_2", "cell_3", "cell_5"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..OO.XXXO:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "O..X.OOXX", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_3": 0.26, "cell_5": 0.46, "cell_2": 0.28}, "solvable": {"false": 0.6699999999999999, "true": 0.33}, "value": {"0": 0.23, "1": 0.34, "2": 0.43}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:471c0ab381833e92c06f78e5", "state_id": "grid_navigation:471c0ab381833e92c06f78e5", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. . # .\n. # # #\n. A G #\n. # . .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": true, "value": 0}, "gold_probs": {"action": {"west": 0.0, "east": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(1, 1):walls=((0, 1), (0, 2), (1, 2), (1, 3), (2, 0), (2, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 2], [1, 1], [1, 2], [1, 3], [2, 3], [3, 1]], "position": [2, 1], "goal": [2, 2]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.98, "west": 0.02}, "solvable": {"false": 0.06999999999999995, "true": 0.93}, "value": {"0": 0.96, "1": 0.01, "2": 0.01, "3": 0.02}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:fccbc0876bbdda40191c3593", "state_id": "grid_navigation:fccbc0876bbdda40191c3593", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# . # .\n. A # .\n. # . .\n# . G #", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "north": "Move one cell north."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "north", "solvable": false, "value": 3}, "gold_probs": {"action": {"west": 0.5, "north": 0.5}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 0.0, "2": 0.0, "3": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["north", "west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 0), (0, 3), (1, 2), (2, 1), (3, 1), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [0, 2], [1, 2], [2, 1], [3, 0], [3, 3]], "position": [1, 1], "goal": [3, 2]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"north": 0.28, "west": 0.72}, "solvable": {"false": 0.39, "true": 0.61}, "value": {"0": 0.03, "1": 0.47, "2": 0.33, "3": 0.17}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:526a0f8017a1f55fe31f3ee7", "state_id": "tic_tac_toe:526a0f8017a1f55fe31f3ee7", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. X X\n. O O\nO X X\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_1": "Place O in row 1, column 1 (cell 1).", "cell_4": "Place O in row 2, column 1 (cell 4)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_4", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_1": 0.0, "cell_4": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_4"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..OXOXXOX:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": ".XX.OOOXX", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_4": 0.5, "cell_1": 0.5}, "solvable": {"false": 0.8, "true": 0.2}, "value": {"0": 0.48, "1": 0.27, "2": 0.25}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:f3788570fc62728f3d92a8eb", "state_id": "tic_tac_toe:f3788570fc62728f3d92a8eb", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX X .\nX O O\n. O .\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_7": "Place X in row 3, column 1 (cell 7).", "cell_9": "Place X in row 3, column 3 (cell 9).", "cell_3": "Place X in row 1, column 3 (cell 3)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_3", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_7": 0.3333333333333333, "cell_9": 0.3333333333333333, "cell_3": 0.3333333333333333}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_3", "cell_7", "cell_9"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.O.OOX.XX:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "XX.XOO.O.", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_7": 0.34, "cell_3": 0.42, "cell_9": 0.24}, "solvable": {"false": 0.73, "true": 0.27}, "value": {"0": 0.32, "1": 0.29, "2": 0.39}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:0d0c9584582e57ea6217c54e", "state_id": "grid_navigation:0d0c9584582e57ea6217c54e", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# . # #\n. . . .\nA . . #\n. . # G", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"east": "Move one cell east.", "south": "Move one cell south.", "north": "Move one cell north."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": false, "value": 3}, "gold_probs": {"action": {"east": 0.3333333333333333, "south": 0.3333333333333333, "north": 0.3333333333333333}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 0.0, "2": 0.0, "3": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east", "north", "south"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 0):walls=((0, 1), (0, 3), (1, 0), (1, 3), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [0, 2], [0, 3], [2, 3], [3, 2]], "position": [2, 0], "goal": [3, 3]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.55, "south": 0.34, "north": 0.11}, "solvable": {"false": 0.19999999999999996, "true": 0.8}, "value": {"0": 0.01, "1": 0.47, "2": 0.38, "3": 0.14}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:8661e21e32acae2776712dd5", "state_id": "tic_tac_toe:8661e21e32acae2776712dd5", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. O X\nX . .\nX O .\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_9": "Place O in row 3, column 3 (cell 9).", "cell_5": "Place O in row 2, column 2 (cell 5).", "cell_1": "Place O in row 1, column 1 (cell 1).", "cell_6": "Place O in row 2, column 3 (cell 6)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_5", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_9": 0.0, "cell_5": 1.0, "cell_1": 0.0, "cell_6": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_5"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..XO.OXX.:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": ".OXX..XO.", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_1": 0.13, "cell_6": 0.19, "cell_9": 0.26, "cell_5": 0.42}, "solvable": {"false": 0.9, "true": 0.1}, "value": {"0": 0.64, "1": 0.22, "2": 0.14}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:2913f781bd43e05f4fd10343", "state_id": "grid_navigation:2913f781bd43e05f4fd10343", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# G . .\n# . . #\n. . # .\n# # . A", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "north": "Move one cell north."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "north", "solvable": false, "value": 3}, "gold_probs": {"action": {"west": 0.5, "north": 0.5}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 0.0, "2": 0.0, "3": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["north", "west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 0), (1, 0), (1, 3), (2, 2), (3, 0), (3, 1))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [1, 0], [1, 3], [2, 2], [3, 0], [3, 1]], "position": [3, 3], "goal": [0, 1]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"north": 0.8, "west": 0.2}, "solvable": {"false": 0.32999999999999996, "true": 0.67}, "value": {"0": 0.01, "1": 0.29, "2": 0.53, "3": 0.17}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:cba0cd7995a712593efab7b0", "state_id": "grid_navigation:cba0cd7995a712593efab7b0", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. A . #\n# . # .\n# # . G\n. . # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"south": "Move one cell south.", "west": "Move one cell west.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": false, "value": 3}, "gold_probs": {"action": {"south": 0.3333333333333333, "west": 0.3333333333333333, "east": 0.3333333333333333}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 0.0, "2": 0.0, "3": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east", "south", "west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 3), (1, 0), (1, 2), (2, 1), (3, 1), (3, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 3], [1, 0], [1, 2], [2, 0], [2, 1], [3, 2]], "position": [0, 1], "goal": [2, 3]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"west": 0.05, "east": 0.05, "south": 0.9}, "solvable": {"false": 0.33999999999999997, "true": 0.66}, "value": {"0": 0.01, "1": 0.45, "2": 0.34, "3": 0.2}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:64d8b75bfb3b9ff363b40131", "state_id": "tic_tac_toe:64d8b75bfb3b9ff363b40131", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX . .\nO O X\nX O X\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_2": "Place O in row 1, column 2 (cell 2).", "cell_3": "Place O in row 1, column 3 (cell 3)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_2", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_2": 1.0, "cell_3": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_2"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..XXOOXOX:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "X..OOXXOX", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_3": 0.43, "cell_2": 0.57}, "solvable": {"false": 0.89, "true": 0.11}, "value": {"0": 0.37, "1": 0.46, "2": 0.17}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:e5edc91280a1a86ebfd3c01b", "state_id": "tic_tac_toe:e5edc91280a1a86ebfd3c01b", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX . X\n. . O\nX O .\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_9": "Place O in row 3, column 3 (cell 9).", "cell_4": "Place O in row 2, column 1 (cell 4).", "cell_2": "Place O in row 1, column 2 (cell 2).", "cell_5": "Place O in row 2, column 2 (cell 5)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_2", "solvable": false, "value": 0}, "gold_probs": {"action": {"cell_9": 0.25, "cell_4": 0.25, "cell_2": 0.25, "cell_5": 0.25}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_2", "cell_4", "cell_5", "cell_9"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.OXO..X.X:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "X.X..OXO.", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_9": 0.31, "cell_4": 0.18, "cell_5": 0.3, "cell_2": 0.21}, "solvable": {"false": 0.87, "true": 0.13}, "value": {"0": 0.5, "1": 0.32, "2": 0.18}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:012cf3fc89c0d31e088c12af", "state_id": "tic_tac_toe:012cf3fc89c0d31e088c12af", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX O O\n. . X\nO X .\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_9": "Place X in row 3, column 3 (cell 9).", "cell_4": "Place X in row 2, column 1 (cell 4).", "cell_5": "Place X in row 2, column 2 (cell 5)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_5", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_9": 0.0, "cell_4": 0.0, "cell_5": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_5"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.XOX..OOX:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "XOO..XOX.", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_9": 0.38, "cell_4": 0.3, "cell_5": 0.32}, "solvable": {"false": 0.78, "true": 0.22}, "value": {"0": 0.26, "1": 0.48, "2": 0.26}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:4c13c27e92362d796f09d7c9", "state_id": "tic_tac_toe:4c13c27e92362d796f09d7c9", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX . X\nO O X\n. X O\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_7": "Place O in row 3, column 1 (cell 7).", "cell_2": "Place O in row 1, column 2 (cell 2)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_2", "solvable": false, "value": 1}, "gold_probs": {"action": {"cell_7": 0.0, "cell_2": 1.0}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_2"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.OXXO.OXX:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "X.XOOX.XO", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_2": 0.41, "cell_7": 0.59}, "solvable": {"false": 0.88, "true": 0.12}, "value": {"0": 0.54, "1": 0.32, "2": 0.14}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:cf03de0b99c364d26015347d", "state_id": "grid_navigation:cf03de0b99c364d26015347d", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# G . .\n# . . #\n. A . .\n. . . .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"south": "Move one cell south.", "west": "Move one cell west.", "east": "Move one cell east.", "north": "Move one cell north."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "north", "solvable": true, "value": 0}, "gold_probs": {"action": {"south": 0.0, "west": 0.0, "east": 0.0, "north": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["north"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 0), (1, 0), (1, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [1, 0], [1, 3]], "position": [2, 1], "goal": [0, 1]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.14, "north": 0.68, "south": 0.03, "west": 0.15}, "solvable": {"false": 0.21999999999999997, "true": 0.78}, "value": {"0": 0.06, "1": 0.53, "2": 0.26, "3": 0.15}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:0f364fd511f2e93666bab70b", "state_id": "grid_navigation:0f364fd511f2e93666bab70b", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. A . G\n# # # #\n. . . .\n. . # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": true, "value": 0}, "gold_probs": {"action": {"west": 0.0, "east": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 0):walls=((0, 1), (1, 1), (1, 3), (2, 1), (3, 1))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[1, 0], [1, 1], [1, 2], [1, 3], [3, 2]], "position": [0, 1], "goal": [0, 3]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.89, "west": 0.11}, "solvable": {"false": 0.6799999999999999, "true": 0.32}, "value": {"0": 0.82, "1": 0.05, "2": 0.04, "3": 0.09}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:e82e5052a9041244a4c3a150", "state_id": "tic_tac_toe:e82e5052a9041244a4c3a150", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX X .\nX O .\nO . .\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_6": "Place O in row 2, column 3 (cell 6).", "cell_9": "Place O in row 3, column 3 (cell 9).", "cell_8": "Place O in row 3, column 2 (cell 8).", "cell_3": "Place O in row 1, column 3 (cell 3)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_3", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_6": 0.0, "cell_9": 0.0, "cell_8": 0.0, "cell_3": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_3"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:....OXOXX:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "XX.XO.O..", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_6": 0.28, "cell_8": 0.26, "cell_9": 0.17, "cell_3": 0.29}, "solvable": {"false": 0.88, "true": 0.12}, "value": {"0": 0.6, "1": 0.2, "2": 0.2}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:c72288a20081a91c10dbfaa6", "state_id": "grid_navigation:c72288a20081a91c10dbfaa6", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. . . #\n. . . #\nG # A .\n. # . .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"north": "Move one cell north.", "south": "Move one cell south.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "north", "solvable": true, "value": 1}, "gold_probs": {"action": {"north": 1.0, "south": 0.0, "east": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["north"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((1, 0), (1, 1), (3, 2), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 3], [1, 3], [2, 1], [3, 1]], "position": [2, 2], "goal": [2, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"north": 0.51, "east": 0.15, "south": 0.34}, "solvable": {"false": 0.6599999999999999, "true": 0.34}, "value": {"0": 0.05, "1": 0.34, "2": 0.33, "3": 0.28}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:525c14031ab8794a1c7a67e3", "state_id": "grid_navigation:525c14031ab8794a1c7a67e3", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. A # #\n# . . .\n. # # .\n. G # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"south": "Move one cell south.", "west": "Move one cell west."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "south", "solvable": false, "value": 3}, "gold_probs": {"action": {"south": 0.5, "west": 0.5}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 0.0, "2": 0.0, "3": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["south", "west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 2), (1, 1), (1, 2), (2, 0), (3, 2), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 2], [0, 3], [1, 0], [2, 1], [2, 2], [3, 2]], "position": [0, 1], "goal": [3, 1]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"south": 0.51, "west": 0.49}, "solvable": {"false": 0.48, "true": 0.52}, "value": {"0": 0.04, "1": 0.43, "2": 0.28, "3": 0.25}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:8f42d959b143ecb4f82766f8", "state_id": "grid_navigation:8f42d959b143ecb4f82766f8", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. . . #\n. . # .\nG A . .\n. # . .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "east": "Move one cell east.", "north": "Move one cell north."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "west", "solvable": true, "value": 0}, "gold_probs": {"action": {"west": 1.0, "east": 0.0, "north": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((1, 0), (2, 2), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 3], [1, 2], [3, 1]], "position": [2, 1], "goal": [2, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"west": 0.97, "north": 0.02, "east": 0.01}, "solvable": {"false": 0.18999999999999995, "true": 0.81}, "value": {"0": 0.81, "1": 0.11, "2": 0.04, "3": 0.03}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:f76f45dadc5536a5d69ab114", "state_id": "tic_tac_toe:f76f45dadc5536a5d69ab114", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nX . .\nO O X\n. X O\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_3": "Place X in row 1, column 3 (cell 3).", "cell_7": "Place X in row 3, column 1 (cell 7).", "cell_2": "Place X in row 1, column 2 (cell 2)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_2", "solvable": false, "value": 1}, "gold_probs": {"action": {"cell_3": 0.3333333333333333, "cell_7": 0.3333333333333333, "cell_2": 0.3333333333333333}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_2", "cell_3", "cell_7"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..XXOOOX.:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "X..OOX.XO", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_2": 0.29, "cell_7": 0.48, "cell_3": 0.23}, "solvable": {"false": 0.6799999999999999, "true": 0.32}, "value": {"0": 0.21, "1": 0.36, "2": 0.43}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:67641381b96f984775e01e3e", "state_id": "tic_tac_toe:67641381b96f984775e01e3e", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. O .\nO X .\n. . X\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_6": "Place X in row 2, column 3 (cell 6).", "cell_8": "Place X in row 3, column 2 (cell 8).", "cell_7": "Place X in row 3, column 1 (cell 7).", "cell_3": "Place X in row 1, column 3 (cell 3).", "cell_1": "Place X in row 1, column 1 (cell 1)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_1", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_6": 0.2, "cell_8": 0.2, "cell_7": 0.2, "cell_3": 0.2, "cell_1": 0.2}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_1", "cell_3", "cell_6", "cell_7", "cell_8"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..XOX..O.:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": ".O.OX...X", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_1": 0.2, "cell_6": 0.27, "cell_8": 0.17, "cell_3": 0.21, "cell_7": 0.15}, "solvable": {"false": 0.75, "true": 0.25}, "value": {"0": 0.19, "1": 0.42, "2": 0.39}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:b2093370e93a61874d25fde5", "state_id": "grid_navigation:b2093370e93a61874d25fde5", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. # . .\nG # . .\n# # A .\n. . . .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"east": "Move one cell east.", "south": "Move one cell south.", "north": "Move one cell north."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": false, "value": 3}, "gold_probs": {"action": {"east": 0.3333333333333333, "south": 0.3333333333333333, "north": 0.3333333333333333}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 0.0, "2": 0.0, "3": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east", "north", "south"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 2), (1, 0), (1, 1), (1, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 1], [1, 1], [2, 0], [2, 1]], "position": [2, 2], "goal": [1, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"north": 0.32, "south": 0.42, "east": 0.26}, "solvable": {"false": 0.5700000000000001, "true": 0.43}, "value": {"0": 0.02, "1": 0.37, "2": 0.41, "3": 0.2}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:353807ed124fac49898cf0d8", "state_id": "tic_tac_toe:353807ed124fac49898cf0d8", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. X O\nO X O\nX . .\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_9": "Place X in row 3, column 3 (cell 9).", "cell_8": "Place X in row 3, column 2 (cell 8).", "cell_1": "Place X in row 1, column 1 (cell 1)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_8", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_9": 0.5, "cell_8": 0.5, "cell_1": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_8", "cell_9"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..XOXOOX.:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": ".XOOXOX..", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_1": 0.23, "cell_9": 0.25, "cell_8": 0.52}, "solvable": {"false": 0.64, "true": 0.36}, "value": {"0": 0.16, "1": 0.35, "2": 0.49}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:017df13168256e8b9599c559", "state_id": "tic_tac_toe:017df13168256e8b9599c559", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. X .\nX . O\n. O X\nTo move: O.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_1": "Place O in row 1, column 1 (cell 1).", "cell_5": "Place O in row 2, column 2 (cell 5).", "cell_3": "Place O in row 1, column 3 (cell 3).", "cell_7": "Place O in row 3, column 1 (cell 7)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_1", "solvable": false, "value": 1}, "gold_probs": {"action": {"cell_1": 1.0, "cell_5": 0.0, "cell_3": 0.0, "cell_7": 0.0}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_1"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:.OXX.O.X.:O", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": ".X.X.O.OX", "player": "O"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_1": 0.15, "cell_7": 0.13, "cell_3": 0.11, "cell_5": 0.61}, "solvable": {"false": 0.92, "true": 0.08}, "value": {"0": 0.34, "1": 0.52, "2": 0.14}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:5c32e7a71d328f033d0a834c", "state_id": "grid_navigation:5c32e7a71d328f033d0a834c", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. . G A\n# . # .\n. . . .\n. . # #", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"south": "Move one cell south.", "west": "Move one cell west."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "west", "solvable": true, "value": 0}, "gold_probs": {"action": {"south": 0.0, "west": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((1, 1), (1, 3), (3, 0), (3, 1))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[1, 0], [1, 2], [3, 2], [3, 3]], "position": [0, 3], "goal": [0, 2]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"west": 0.91, "south": 0.09}, "solvable": {"false": 0.16000000000000003, "true": 0.84}, "value": {"0": 0.69, "1": 0.2, "2": 0.06, "3": 0.05}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:cc79ed92bc435fe3230b484b", "state_id": "tic_tac_toe:cc79ed92bc435fe3230b484b", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO X O\n. O .\n. X X\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_4": "Place X in row 2, column 1 (cell 4).", "cell_7": "Place X in row 3, column 1 (cell 7).", "cell_6": "Place X in row 2, column 3 (cell 6)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_7", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_4": 0.0, "cell_7": 1.0, "cell_6": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_7"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..OXOXX.O:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "OXO.O..XX", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_7": 0.35, "cell_6": 0.25, "cell_4": 0.4}, "solvable": {"false": 0.6599999999999999, "true": 0.34}, "value": {"0": 0.29, "1": 0.36, "2": 0.35}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:90e1a0dbb0d48adc08156520", "state_id": "grid_navigation:90e1a0dbb0d48adc08156520", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. . . .\nG # # #\n# A . .\n. . # #", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"south": "Move one cell south.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": false, "value": 3}, "gold_probs": {"action": {"south": 0.5, "east": 0.5}, "solvable": {"false": 1.0, "true": 0.0}, "value": {"0": 0.0, "1": 0.0, "2": 0.0, "3": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east", "south"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 2), (1, 1), (2, 1), (2, 3), (3, 1), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[1, 1], [1, 2], [1, 3], [2, 0], [3, 2], [3, 3]], "position": [2, 1], "goal": [1, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.66, "south": 0.34}, "solvable": {"false": 0.62, "true": 0.38}, "value": {"0": 0.09, "1": 0.29, "2": 0.16, "3": 0.46}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:add0d530e3f912b118be57cf", "state_id": "grid_navigation:add0d530e3f912b118be57cf", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# # # #\n. . . .\n. . # #\n. A G .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"north": "Move one cell north.", "east": "Move one cell east.", "west": "Move one cell west."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": true, "value": 0}, "gold_probs": {"action": {"north": 0.0, "east": 1.0, "west": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((1, 0), (1, 1), (3, 0), (3, 1), (3, 2), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [0, 1], [0, 2], [0, 3], [2, 2], [2, 3]], "position": [3, 1], "goal": [3, 2]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"north": 0.02, "east": 0.98, "west": 0}, "solvable": {"false": 0.040000000000000036, "true": 0.96}, "value": {"0": 0.99, "1": 0.01, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:397c35b9d7fa193644643678", "state_id": "tic_tac_toe:397c35b9d7fa193644643678", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\nO O .\n. . .\nX . X\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_5": "Place X in row 2, column 2 (cell 5).", "cell_4": "Place X in row 2, column 1 (cell 4).", "cell_8": "Place X in row 3, column 2 (cell 8).", "cell_6": "Place X in row 2, column 3 (cell 6).", "cell_3": "Place X in row 1, column 3 (cell 3)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_3", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_5": 0.0, "cell_4": 0.0, "cell_8": 0.5, "cell_6": 0.0, "cell_3": 0.5}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_3", "cell_8"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..XO..O.X:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "OO....X.X", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_8": 0.23, "cell_5": 0.32, "cell_4": 0.11, "cell_3": 0.22, "cell_6": 0.12}, "solvable": {"false": 0.62, "true": 0.38}, "value": {"0": 0.18, "1": 0.37, "2": 0.45}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:9f39743adbf0140e5fee4365", "state_id": "grid_navigation:9f39743adbf0140e5fee4365", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n# # . #\n. . . #\nA G # .\n. . # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"east": "Move one cell east.", "south": "Move one cell south.", "north": "Move one cell north."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": true, "value": 0}, "gold_probs": {"action": {"east": 1.0, "south": 0.0, "north": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(1, 1):walls=((0, 2), (1, 2), (2, 3), (3, 0), (3, 1), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 0], [0, 1], [0, 3], [1, 3], [2, 2], [3, 2]], "position": [2, 0], "goal": [2, 1]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.8, "north": 0.15, "south": 0.05}, "solvable": {"false": 0.040000000000000036, "true": 0.96}, "value": {"0": 1, "1": 0, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:8c6fc2d08425c92da5b23366", "state_id": "tic_tac_toe:8c6fc2d08425c92da5b23366", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. . O\n. X .\nO . X\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_4": "Place X in row 2, column 1 (cell 4).", "cell_1": "Place X in row 1, column 1 (cell 1).", "cell_2": "Place X in row 1, column 2 (cell 2).", "cell_6": "Place X in row 2, column 3 (cell 6).", "cell_8": "Place X in row 3, column 2 (cell 8)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_1", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_4": 0.2, "cell_1": 0.2, "cell_2": 0.2, "cell_6": 0.2, "cell_8": 0.2}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_1", "cell_2", "cell_4", "cell_6", "cell_8"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..O.X.O.X:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "..O.X.O.X", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_8": 0.29, "cell_6": 0.16, "cell_1": 0.2, "cell_2": 0.17, "cell_4": 0.18}, "solvable": {"false": 0.83, "true": 0.17}, "value": {"0": 0.21, "1": 0.51, "2": 0.28}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:79d4b237b630995118426d83", "state_id": "grid_navigation:79d4b237b630995118426d83", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. # # .\nG # A .\n. . . #\n. . . #", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"east": "Move one cell east.", "south": "Move one cell south."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "south", "solvable": true, "value": 1}, "gold_probs": {"action": {"east": 0.0, "south": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["south"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((1, 0), (1, 1), (2, 0), (3, 2), (3, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 1], [0, 2], [1, 1], [2, 3], [3, 3]], "position": [1, 2], "goal": [1, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"south": 0.83, "east": 0.17}, "solvable": {"false": 0.54, "true": 0.46}, "value": {"0": 0.11, "1": 0.52, "2": 0.21, "3": 0.16}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:072d7982809b97243c3740bb", "state_id": "grid_navigation:072d7982809b97243c3740bb", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. . . .\n# . . #\n. . . A\nG . # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"south": "Move one cell south.", "west": "Move one cell west."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "west", "solvable": true, "value": 1}, "gold_probs": {"action": {"south": 0.0, "west": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 1.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 0):walls=((0, 2), (2, 0), (2, 3))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[1, 0], [1, 3], [3, 2]], "position": [2, 3], "goal": [3, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"south": 0.27, "west": 0.73}, "solvable": {"false": 0.24, "true": 0.76}, "value": {"0": 0.07, "1": 0.61, "2": 0.23, "3": 0.09}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:5d1b8a9f3cf84ce59aff6c73", "state_id": "grid_navigation:5d1b8a9f3cf84ce59aff6c73", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. A G #\n. # . .\n. # . #\n. . . #", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": true, "value": 0}, "gold_probs": {"action": {"west": 0.0, "east": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 0), (1, 2), (2, 0), (2, 2), (3, 0))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 3], [1, 1], [2, 1], [2, 3], [3, 3]], "position": [0, 1], "goal": [0, 2]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.98, "west": 0.02}, "solvable": {"false": 0.06000000000000005, "true": 0.94}, "value": {"0": 0.97, "1": 0.01, "2": 0.01, "3": 0.01}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:a90bc5ed8fecdd14fada7c1a", "state_id": "grid_navigation:a90bc5ed8fecdd14fada7c1a", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. A . #\nG # . #\n# # # #\n. . # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"west": "Move one cell west.", "east": "Move one cell east."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "west", "solvable": true, "value": 0}, "gold_probs": {"action": {"west": 1.0, "east": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["west"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(0, 1):walls=((0, 2), (1, 1), (1, 2), (2, 2), (2, 3), (3, 0), (3, 1), (3, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 3], [1, 1], [1, 3], [2, 0], [2, 1], [2, 2], [2, 3], [3, 2]], "position": [0, 1], "goal": [1, 0]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"east": 0.13, "west": 0.87}, "solvable": {"false": 0.6599999999999999, "true": 0.34}, "value": {"0": 0.16, "1": 0.14, "2": 0.06, "3": 0.64}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "grid_navigation:b2e537e7789ee6193e66686d", "state_id": "grid_navigation:b2e537e7789ee6193e66686d", "family_id": "grid_navigation_bfs_v1", "split": "dev", "state": "Review this game position:\nGrid navigation. Each legal orthogonal step costs 1; no diagonals. A=agent, G=goal, #=wall, .=open.\n. # . .\n# G . #\nA . . #\n. . # .", "questions": {"action": {"type": "choice", "instructions": "Choose a legal next step on a shortest route to G. If G is unreachable, all legal moves tie. Walls cannot be crossed.", "criteria": {"east": "Move one cell east.", "south": "Move one cell south."}}, "solvable": {"type": "boolean", "instructions": "Can the agent reach G by legal orthogonal moves?"}, "value": {"type": "score", "instructions": "Classify the minimum number of legal steps from A to G; use the unreachable category if no route exists.", "criteria": ["The goal is reachable in one or two steps.", "The goal is reachable in three to five steps.", "The goal is reachable in six or more steps.", "The goal cannot be reached."]}}, "gold": {"action": "east", "solvable": true, "value": 0}, "gold_probs": {"action": {"east": 1.0, "south": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 1.0, "1": 0.0, "2": 0.0, "3": 0.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["east"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "grid:4:goal=(1, 1):walls=((0, 1), (1, 0), (1, 3), (2, 3), (3, 2))", "template_id": "grid_navigation:dev:en:v1", "language": "en", "environment_state": {"game": "grid_navigation", "size": 4, "walls": [[0, 1], [1, 0], [1, 3], [2, 3], [3, 2]], "position": [2, 0], "goal": [1, 1]}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"south": 0.11, "east": 0.89}, "solvable": {"false": 0.19999999999999996, "true": 0.8}, "value": {"0": 0.22, "1": 0.59, "2": 0.1, "3": 0.09}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:38065352b535aaa47e7fc2eb", "state_id": "tic_tac_toe:38065352b535aaa47e7fc2eb", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. . .\n. X O\n. O X\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_1": "Place X in row 1, column 1 (cell 1).", "cell_4": "Place X in row 2, column 1 (cell 4).", "cell_3": "Place X in row 1, column 3 (cell 3).", "cell_7": "Place X in row 3, column 1 (cell 7).", "cell_2": "Place X in row 1, column 2 (cell 2)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_1", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_1": 0.3333333333333333, "cell_4": 0.0, "cell_3": 0.3333333333333333, "cell_7": 0.3333333333333333, "cell_2": 0.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_1", "cell_3", "cell_7"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:....XO.OX:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "....XO.OX", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_4": 0.28, "cell_7": 0.21, "cell_3": 0.19, "cell_1": 0.18, "cell_2": 0.14}, "solvable": {"false": 0.83, "true": 0.17}, "value": {"0": 0.26, "1": 0.48, "2": 0.26}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "tic_tac_toe:84cc3cb3edd4ac68aef899ba", "state_id": "tic_tac_toe:84cc3cb3edd4ac68aef899ba", "family_id": "tic_tac_toe_minimax_v1", "split": "dev", "state": "Review this game position:\nTic-tac-toe. X starts; turns alternate. Three in a row wins. Empty=.; cells 1-9 go row by row.\n. . O\nO O X\nX X .\nTo move: X.", "questions": {"action": {"type": "choice", "instructions": "Choose a legal move maximizing win/draw/loss under perfect play by both sides. Earlier wins are not preferred; all equally best moves count.", "criteria": {"cell_2": "Place X in row 1, column 2 (cell 2).", "cell_1": "Place X in row 1, column 1 (cell 1).", "cell_9": "Place X in row 3, column 3 (cell 9)."}}, "solvable": {"type": "boolean", "instructions": "Can the player to move force a win against perfect opposing play?"}, "value": {"type": "score", "instructions": "What is the best attainable outcome for the player to move, assuming perfect play by both sides?", "criteria": ["The player to move loses under perfect play.", "The game is a draw under perfect play.", "The player to move wins under perfect play."]}}, "gold": {"action": "cell_9", "solvable": true, "value": 2}, "gold_probs": {"action": {"cell_2": 0.0, "cell_1": 0.0, "cell_9": 1.0}, "solvable": {"false": 0.0, "true": 1.0}, "value": {"0": 0.0, "1": 0.0, "2": 1.0}}, "gold_probs_kind": {"action": "optimal_action_policy", "solvable": "deterministic_truth", "value": "deterministic_truth"}, "optimal_actions": {"action": ["cell_9"]}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "ttt:..OOOXXX.:X", "template_id": "tic_tac_toe:dev:en:v1", "language": "en", "environment_state": {"game": "tic_tac_toe", "board": "..OOOXXX.", "player": "X"}}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"action": {"cell_9": 0.76, "cell_2": 0.1, "cell_1": 0.14}, "solvable": {"false": 0.35, "true": 0.65}, "value": {"0": 0.11, "1": 0.2, "2": 0.69}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:account:denied:0", "state_id": "support:account:denied:0", "family_id": "support_decisions_v1", "split": "dev", "state": "客户反馈忘记账户密码；财务状态为退款申请已拒绝，未付款；当前情况是功能正常，没有使用障碍。", "questions": {"route": {"type": "choice", "instructions": "请核对当前事实后判断：只按工单主诉选择支持团队；退款记录和功能影响是另外两个字段。", "criteria": {"technical": "软件功能错误与故障", "account": "账户密码与身份验证"}}, "completed": {"type": "boolean", "instructions": "请核对当前事实后判断：退款是否已经实际到账完成？申请、处理中、批准或拒绝均不算到账。"}, "severity": {"type": "score", "instructions": "请核对当前事实后判断：按明确记载的使用影响，选择最匹配的严重程度。", "criteria": ["功能正常，无使用障碍", "次要功能受阻，有替代办法", "核心功能受阻，有替代办法", "服务完全中断，无替代办法"]}}, "gold": {"route": "account", "completed": false, "severity": 0}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:account:denied:0", "template_id": "support:dev:zh", "language": "zh"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"account": 1, "technical": 0}, "completed": {"false": 0.98, "true": 0.02}, "severity": {"0": 0.95, "1": 0.02, "2": 0.03, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:privacy:denied:2", "state_id": "support:privacy:denied:2", "family_id": "support_decisions_v1", "split": "dev", "state": "The customer reports a request to delete personal data; finance says the refund was denied and not paid; currently a core feature is blocked with a workaround.", "questions": {"route": {"type": "choice", "instructions": "Check the current facts: Choose a support team from the main topic only; refund and impact are separate fields.", "criteria": {"account": "Passwords and identity checks", "billing": "Charges, payments, and refunds", "privacy": "Personal data deletion and privacy"}}, "completed": {"type": "boolean", "instructions": "Check the current facts: Has the refund actually been paid and completed? Requests, processing, approval, or denial do not count."}, "severity": {"type": "score", "instructions": "Check the current facts: Choose the severity level matching the explicitly recorded impact.", "criteria": ["All features work normally", "Minor feature blocked; workaround exists", "Core feature blocked; workaround exists", "Entire service down; no workaround"]}}, "gold": {"route": "privacy", "completed": false, "severity": 2}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:privacy:denied:2", "template_id": "support:dev:en", "language": "en"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"privacy": 0.99, "account": 0, "billing": 0.01}, "completed": {"false": 0.94, "true": 0.06}, "severity": {"0": 0, "1": 0, "2": 1, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:documentation:processing:1", "state_id": "support:documentation:processing:1", "family_id": "support_decisions_v1", "split": "dev", "state": "客户反馈询问操作手册位置；财务状态为退款正在处理中，尚未完成；当前情况是次要功能受阻，有替代办法。", "questions": {"route": {"type": "choice", "instructions": "请核对当前事实后判断：只按工单主诉选择支持团队；退款记录和功能影响是另外两个字段。", "criteria": {"technical": "软件功能错误与故障", "documentation": "查找说明文档与使用指南", "account": "账户密码与身份验证", "shipping": "包裹运输与投递问题"}}, "completed": {"type": "boolean", "instructions": "请核对当前事实后判断：退款是否已经实际到账完成？申请、处理中、批准或拒绝均不算到账。"}, "severity": {"type": "score", "instructions": "请核对当前事实后判断：按明确记载的使用影响，选择最匹配的严重程度。", "criteria": ["功能正常，无使用障碍", "次要功能受阻，有替代办法", "核心功能受阻，有替代办法", "服务完全中断，无替代办法"]}}, "gold": {"route": "documentation", "completed": false, "severity": 1}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:documentation:processing:1", "template_id": "support:dev:zh", "language": "zh"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"technical": 0.06, "shipping": 0, "documentation": 0.94, "account": 0}, "completed": {"false": 0.98, "true": 0.02}, "severity": {"0": 0, "1": 1, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:billing:denied:0", "state_id": "support:billing:denied:0", "family_id": "support_decisions_v1", "split": "dev", "state": "客户反馈重复扣款；财务状态为退款申请已拒绝，未付款；当前情况是功能正常，没有使用障碍。", "questions": {"route": {"type": "choice", "instructions": "请核对当前事实后判断：只按工单主诉选择支持团队；退款记录和功能影响是另外两个字段。", "criteria": {"shipping": "包裹运输与投递问题", "billing": "扣费、付款与退款问题"}}, "completed": {"type": "boolean", "instructions": "请核对当前事实后判断：退款是否已经实际到账完成？申请、处理中、批准或拒绝均不算到账。"}, "severity": {"type": "score", "instructions": "请核对当前事实后判断：按明确记载的使用影响，选择最匹配的严重程度。", "criteria": ["功能正常，无使用障碍", "次要功能受阻，有替代办法", "核心功能受阻，有替代办法", "服务完全中断，无替代办法"]}}, "gold": {"route": "billing", "completed": false, "severity": 0}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:billing:denied:0", "template_id": "support:dev:zh", "language": "zh"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"shipping": 0, "billing": 1}, "completed": {"false": 0.98, "true": 0.02}, "severity": {"0": 1, "1": 0, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:documentation:issued:0", "state_id": "support:documentation:issued:0", "family_id": "support_decisions_v1", "split": "dev", "state": "The customer reports a request for the user manual; finance says the refund was paid and completed; currently all features work without obstruction.", "questions": {"route": {"type": "choice", "instructions": "Check the current facts: Choose a support team from the main topic only; refund and impact are separate fields.", "criteria": {"documentation": "Finding manuals and usage guides", "billing": "Charges, payments, and refunds", "technical": "Software errors and broken features"}}, "completed": {"type": "boolean", "instructions": "Check the current facts: Has the refund actually been paid and completed? Requests, processing, approval, or denial do not count."}, "severity": {"type": "score", "instructions": "Check the current facts: Choose the severity level matching the explicitly recorded impact.", "criteria": ["All features work normally", "Minor feature blocked; workaround exists", "Core feature blocked; workaround exists", "Entire service down; no workaround"]}}, "gold": {"route": "documentation", "completed": true, "severity": 0}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:documentation:issued:0", "template_id": "support:dev:en", "language": "en"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"billing": 0.01, "documentation": 0.99, "technical": 0}, "completed": {"false": 0.31000000000000005, "true": 0.69}, "severity": {"0": 1, "1": 0, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:account:none:0", "state_id": "support:account:none:0", "family_id": "support_decisions_v1", "split": "dev", "state": "客户反馈忘记账户密码；财务状态为尚未提出退款申请；当前情况是功能正常，没有使用障碍。", "questions": {"route": {"type": "choice", "instructions": "请核对当前事实后判断：只按工单主诉选择支持团队；退款记录和功能影响是另外两个字段。", "criteria": {"privacy": "个人资料删除与隐私请求", "shipping": "包裹运输与投递问题", "account": "账户密码与身份验证", "technical": "软件功能错误与故障"}}, "completed": {"type": "boolean", "instructions": "请核对当前事实后判断：退款是否已经实际到账完成？申请、处理中、批准或拒绝均不算到账。"}, "severity": {"type": "score", "instructions": "请核对当前事实后判断：按明确记载的使用影响，选择最匹配的严重程度。", "criteria": ["功能正常，无使用障碍", "次要功能受阻，有替代办法", "核心功能受阻，有替代办法", "服务完全中断，无替代办法"]}}, "gold": {"route": "account", "completed": false, "severity": 0}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:account:none:0", "template_id": "support:dev:zh", "language": "zh"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"technical": 0, "privacy": 0, "account": 1, "shipping": 0}, "completed": {"false": 0.98, "true": 0.02}, "severity": {"0": 0.95, "1": 0.02, "2": 0.03, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:privacy:issued:2", "state_id": "support:privacy:issued:2", "family_id": "support_decisions_v1", "split": "dev", "state": "客户反馈要求删除个人资料；财务状态为退款已到账，处理完成；当前情况是核心功能受阻，有替代办法。", "questions": {"route": {"type": "choice", "instructions": "请核对当前事实后判断：只按工单主诉选择支持团队；退款记录和功能影响是另外两个字段。", "criteria": {"account": "账户密码与身份验证", "privacy": "个人资料删除与隐私请求"}}, "completed": {"type": "boolean", "instructions": "请核对当前事实后判断：退款是否已经实际到账完成？申请、处理中、批准或拒绝均不算到账。"}, "severity": {"type": "score", "instructions": "请核对当前事实后判断：按明确记载的使用影响，选择最匹配的严重程度。", "criteria": ["功能正常，无使用障碍", "次要功能受阻，有替代办法", "核心功能受阻，有替代办法", "服务完全中断，无替代办法"]}}, "gold": {"route": "privacy", "completed": true, "severity": 2}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:privacy:issued:2", "template_id": "support:dev:zh", "language": "zh"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"privacy": 0.99, "account": 0.01}, "completed": {"false": 0.17000000000000004, "true": 0.83}, "severity": {"0": 0, "1": 0, "2": 1, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:privacy:requested:3", "state_id": "support:privacy:requested:3", "family_id": "support_decisions_v1", "split": "dev", "state": "The customer reports a request to delete personal data; finance says a refund was requested but not processed; currently the entire service is down without a workaround.", "questions": {"route": {"type": "choice", "instructions": "Check the current facts: Choose a support team from the main topic only; refund and impact are separate fields.", "criteria": {"account": "Passwords and identity checks", "privacy": "Personal data deletion and privacy", "technical": "Software errors and broken features", "shipping": "Parcel transport and delivery", "documentation": "Finding manuals and usage guides"}}, "completed": {"type": "boolean", "instructions": "Check the current facts: Has the refund actually been paid and completed? Requests, processing, approval, or denial do not count."}, "severity": {"type": "score", "instructions": "Check the current facts: Choose the severity level matching the explicitly recorded impact.", "criteria": ["All features work normally", "Minor feature blocked; workaround exists", "Core feature blocked; workaround exists", "Entire service down; no workaround"]}}, "gold": {"route": "privacy", "completed": false, "severity": 3}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:privacy:requested:3", "template_id": "support:dev:en", "language": "en"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"privacy": 0.92, "documentation": 0, "shipping": 0, "technical": 0.08, "account": 0}, "completed": {"false": 0.96, "true": 0.04}, "severity": {"0": 0, "1": 0, "2": 0, "3": 1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:account:processing:0", "state_id": "support:account:processing:0", "family_id": "support_decisions_v1", "split": "dev", "state": "The customer reports a forgotten account password; finance says the refund is processing and not complete; currently all features work without obstruction.", "questions": {"route": {"type": "choice", "instructions": "Check the current facts: Choose a support team from the main topic only; refund and impact are separate fields.", "criteria": {"billing": "Charges, payments, and refunds", "technical": "Software errors and broken features", "documentation": "Finding manuals and usage guides", "privacy": "Personal data deletion and privacy", "account": "Passwords and identity checks"}}, "completed": {"type": "boolean", "instructions": "Check the current facts: Has the refund actually been paid and completed? Requests, processing, approval, or denial do not count."}, "severity": {"type": "score", "instructions": "Check the current facts: Choose the severity level matching the explicitly recorded impact.", "criteria": ["All features work normally", "Minor feature blocked; workaround exists", "Core feature blocked; workaround exists", "Entire service down; no workaround"]}}, "gold": {"route": "account", "completed": false, "severity": 0}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:account:processing:0", "template_id": "support:dev:en", "language": "en"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"privacy": 0, "billing": 0, "account": 1, "documentation": 0, "technical": 0}, "completed": {"false": 0.92, "true": 0.08}, "severity": {"0": 0.74, "1": 0.19, "2": 0.07, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:account:processing:2", "state_id": "support:account:processing:2", "family_id": "support_decisions_v1", "split": "dev", "state": "The customer reports a forgotten account password; finance says the refund is processing and not complete; currently a core feature is blocked with a workaround.", "questions": {"route": {"type": "choice", "instructions": "Check the current facts: Choose a support team from the main topic only; refund and impact are separate fields.", "criteria": {"shipping": "Parcel transport and delivery", "technical": "Software errors and broken features", "account": "Passwords and identity checks"}}, "completed": {"type": "boolean", "instructions": "Check the current facts: Has the refund actually been paid and completed? Requests, processing, approval, or denial do not count."}, "severity": {"type": "score", "instructions": "Check the current facts: Choose the severity level matching the explicitly recorded impact.", "criteria": ["All features work normally", "Minor feature blocked; workaround exists", "Core feature blocked; workaround exists", "Entire service down; no workaround"]}}, "gold": {"route": "account", "completed": false, "severity": 2}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:account:processing:2", "template_id": "support:dev:en", "language": "en"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"shipping": 0, "account": 0.92, "technical": 0.08}, "completed": {"false": 0.9299999999999999, "true": 0.07}, "severity": {"0": 0, "1": 0, "2": 1, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:privacy:requested:1", "state_id": "support:privacy:requested:1", "family_id": "support_decisions_v1", "split": "dev", "state": "客户反馈要求删除个人资料；财务状态为已申请退款，尚未处理；当前情况是次要功能受阻，有替代办法。", "questions": {"route": {"type": "choice", "instructions": "请核对当前事实后判断：只按工单主诉选择支持团队；退款记录和功能影响是另外两个字段。", "criteria": {"documentation": "查找说明文档与使用指南", "shipping": "包裹运输与投递问题", "privacy": "个人资料删除与隐私请求", "account": "账户密码与身份验证"}}, "completed": {"type": "boolean", "instructions": "请核对当前事实后判断：退款是否已经实际到账完成？申请、处理中、批准或拒绝均不算到账。"}, "severity": {"type": "score", "instructions": "请核对当前事实后判断：按明确记载的使用影响，选择最匹配的严重程度。", "criteria": ["功能正常，无使用障碍", "次要功能受阻，有替代办法", "核心功能受阻，有替代办法", "服务完全中断，无替代办法"]}}, "gold": {"route": "privacy", "completed": false, "severity": 1}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:privacy:requested:1", "template_id": "support:dev:zh", "language": "zh"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"shipping": 0, "privacy": 1, "account": 0, "documentation": 0}, "completed": {"false": 0.97, "true": 0.03}, "severity": {"0": 0, "1": 1, "2": 0, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:account:issued:2", "state_id": "support:account:issued:2", "family_id": "support_decisions_v1", "split": "dev", "state": "The customer reports a forgotten account password; finance says the refund was paid and completed; currently a core feature is blocked with a workaround.", "questions": {"route": {"type": "choice", "instructions": "Check the current facts: Choose a support team from the main topic only; refund and impact are separate fields.", "criteria": {"documentation": "Finding manuals and usage guides", "shipping": "Parcel transport and delivery", "billing": "Charges, payments, and refunds", "account": "Passwords and identity checks", "technical": "Software errors and broken features"}}, "completed": {"type": "boolean", "instructions": "Check the current facts: Has the refund actually been paid and completed? Requests, processing, approval, or denial do not count."}, "severity": {"type": "score", "instructions": "Check the current facts: Choose the severity level matching the explicitly recorded impact.", "criteria": ["All features work normally", "Minor feature blocked; workaround exists", "Core feature blocked; workaround exists", "Entire service down; no workaround"]}}, "gold": {"route": "account", "completed": true, "severity": 2}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:account:issued:2", "template_id": "support:dev:en", "language": "en"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"billing": 0, "documentation": 0, "account": 0.98, "shipping": 0, "technical": 0.02}, "completed": {"false": 0.38, "true": 0.62}, "severity": {"0": 0, "1": 0, "2": 1, "3": 0}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:technical:denied:3", "state_id": "support:technical:denied:3", "family_id": "support_decisions_v1", "split": "dev", "state": "客户反馈软件按钮报错；财务状态为退款申请已拒绝，未付款；当前情况是服务完全中断，无替代办法。", "questions": {"route": {"type": "choice", "instructions": "请核对当前事实后判断：只按工单主诉选择支持团队；退款记录和功能影响是另外两个字段。", "criteria": {"technical": "软件功能错误与故障", "account": "账户密码与身份验证"}}, "completed": {"type": "boolean", "instructions": "请核对当前事实后判断：退款是否已经实际到账完成？申请、处理中、批准或拒绝均不算到账。"}, "severity": {"type": "score", "instructions": "请核对当前事实后判断：按明确记载的使用影响，选择最匹配的严重程度。", "criteria": ["功能正常，无使用障碍", "次要功能受阻，有替代办法", "核心功能受阻，有替代办法", "服务完全中断，无替代办法"]}}, "gold": {"route": "technical", "completed": false, "severity": 3}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:technical:denied:3", "template_id": "support:dev:zh", "language": "zh"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"account": 0, "technical": 1}, "completed": {"false": 0.97, "true": 0.03}, "severity": {"0": 0, "1": 0, "2": 0, "3": 1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:account:requested:3", "state_id": "support:account:requested:3", "family_id": "support_decisions_v1", "split": "dev", "state": "The customer reports a forgotten account password; finance says a refund was requested but not processed; currently the entire service is down without a workaround.", "questions": {"route": {"type": "choice", "instructions": "Check the current facts: Choose a support team from the main topic only; refund and impact are separate fields.", "criteria": {"account": "Passwords and identity checks", "documentation": "Finding manuals and usage guides", "technical": "Software errors and broken features"}}, "completed": {"type": "boolean", "instructions": "Check the current facts: Has the refund actually been paid and completed? Requests, processing, approval, or denial do not count."}, "severity": {"type": "score", "instructions": "Check the current facts: Choose the severity level matching the explicitly recorded impact.", "criteria": ["All features work normally", "Minor feature blocked; workaround exists", "Core feature blocked; workaround exists", "Entire service down; no workaround"]}}, "gold": {"route": "account", "completed": false, "severity": 3}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:account:requested:3", "template_id": "support:dev:en", "language": "en"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"account": 0.93, "technical": 0.07, "documentation": 0}, "completed": {"false": 0.95, "true": 0.05}, "severity": {"0": 0, "1": 0, "2": 0, "3": 1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:account:none:3", "state_id": "support:account:none:3", "family_id": "support_decisions_v1", "split": "dev", "state": "客户反馈忘记账户密码；财务状态为尚未提出退款申请；当前情况是服务完全中断，无替代办法。", "questions": {"route": {"type": "choice", "instructions": "请核对当前事实后判断：只按工单主诉选择支持团队；退款记录和功能影响是另外两个字段。", "criteria": {"technical": "软件功能错误与故障", "privacy": "个人资料删除与隐私请求", "account": "账户密码与身份验证", "shipping": "包裹运输与投递问题"}}, "completed": {"type": "boolean", "instructions": "请核对当前事实后判断：退款是否已经实际到账完成？申请、处理中、批准或拒绝均不算到账。"}, "severity": {"type": "score", "instructions": "请核对当前事实后判断：按明确记载的使用影响，选择最匹配的严重程度。", "criteria": ["功能正常，无使用障碍", "次要功能受阻，有替代办法", "核心功能受阻，有替代办法", "服务完全中断，无替代办法"]}}, "gold": {"route": "account", "completed": false, "severity": 3}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:account:none:3", "template_id": "support:dev:zh", "language": "zh"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"privacy": 0, "shipping": 0, "account": 1, "technical": 0}, "completed": {"false": 0.98, "true": 0.02}, "severity": {"0": 0, "1": 0, "2": 0, "3": 1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}
{"id": "support:documentation:denied:3", "state_id": "support:documentation:denied:3", "family_id": "support_decisions_v1", "split": "dev", "state": "The customer reports a request for the user manual; finance says the refund was denied and not paid; currently the entire service is down without a workaround.", "questions": {"route": {"type": "choice", "instructions": "Check the current facts: Choose a support team from the main topic only; refund and impact are separate fields.", "criteria": {"documentation": "Finding manuals and usage guides", "shipping": "Parcel transport and delivery", "account": "Passwords and identity checks", "privacy": "Personal data deletion and privacy", "technical": "Software errors and broken features"}}, "completed": {"type": "boolean", "instructions": "Check the current facts: Has the refund actually been paid and completed? Requests, processing, approval, or denial do not count."}, "severity": {"type": "score", "instructions": "Check the current facts: Choose the severity level matching the explicitly recorded impact.", "criteria": ["All features work normally", "Minor feature blocked; workaround exists", "Core feature blocked; workaround exists", "Entire service down; no workaround"]}}, "gold": {"route": "documentation", "completed": false, "severity": 3}, "metadata": {"source": "self_authored_programmatic", "license": "CC0-1.0", "source_group_id": "support:documentation:denied:3", "template_id": "support:dev:en", "language": "en"}, "teacher": {"model": "typesafe-ai/jev", "label_source": "jev_native_evaluation", "target_kind": "rounded_probabilities", "native_probs": {"route": {"technical": 0.32, "privacy": 0, "shipping": 0, "account": 0, "documentation": 0.68}, "completed": {"false": 0.95, "true": 0.05}, "severity": {"0": 0, "1": 0, "2": 0, "3": 1}}, "rounding": {"probabilityDecimals": 2, "scoreDecimals": 2}}}