| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def bead_sort(sequence: list) -> list:\n \"\"\"\n >>> bead_sort([6, 11, 12, 4, 1, 5])\n [1, 4, 5, 6, 11, 12]\n\n >>> bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])\n [1, 2, 3, 4, 5, 6, 7, 8, 9]\n\n >>> bead_sort([5, 0, 4, 3])\n [0, 3, 4, 5]\n\n >>> bead_sort([8, 2, 1])\n [1, 2, 8]\n\n >>> bead_sort([1, .9, 0.0, 0, -1, -.9])\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n\n >>> bead_sort(\"Hello world\")\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n \"\"\"\n if any(not isinstance(x, int) or x < 0 for x in sequence):\n raise TypeError(\"Sequence must be list of non-negative integers\")\n for _ in range(len(sequence)):\n for i, (rod_upper, rod_lower) in enumerate(zip(sequence, sequence[1:])): # noqa: RUF007\n if rod_upper > rod_lower:\n sequence[i] -= rod_upper - rod_lower\n sequence[i + 1] += rod_upper - rod_lower\n return sequence\n"}, "sha256": "04acca9b29ce716f4c2fd5e9b104a182869370d2aee8c78cba925da19bea0f83"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "04acca9b29ce716f4c2fd5e9b104a182869370d2aee8c78cba925da19bea0f83", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "3ae2e265e6706d7b49dd21c63ae10cf7422ef5f524694b1de6c1e539fdbcd82f", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00000"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00000", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 24, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def bead_sort(sequence: list) -> list:\n \"\"\"\n >>> bead_sort([6, 11, 12, 4, 1, 5])\n [1, 4, 5, 6, 11, 12]\n\n >>> bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])\n [1, 2, 3, 4, 5, 6, 7, 8, 9]\n\n >>> bead_sort([5, 0, 4, 3])\n [0, 3, 4, 5]\n\n >>> bead_sort([8, 2, 1])\n [1, 2, 8]\n\n >>> bead_sort([1, .9, 0.0, 0, -1, -.9])\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n\n >>> bead_sort(\"Hello world\")\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n \"\"\"\n if any(not isinstance(x, int) or x < 0 for x in sequence):\n raise TypeError(\"Sequence must be list of non-negative integers\")\n for _ in range(len(sequence)):\n for i, (rod_upper, rod_lower) in enumerate(zip(sequence, sequence[1:])): # noqa: RUF007\n if rod_upper > rod_lower:\n sequence[i] -= rod_upper - rod_lower\n sequence[i + 1] += rod_upper + rod_lower\n return sequence\n"}, "sha256": "98037881f73b13b3747796e4e4dd8bfdfe690916348d38cb6d7cc40cb31cbbfe"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "bead_sort:0", "got": "[1, 5, 16, 26, 31, 32]\n", "source": "bead_sort([6, 11, 12, 4, 1, 5])\n", "truncated": false, "want": "[1, 4, 5, 6, 11, 12]\n"}, {"example_id": "bead_sort:1", "got": "[1, 4, 9, 16, 25, 36, 49, 64, 81]\n", "source": "bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])\n", "truncated": false, "want": "[1, 2, 3, 4, 5, 6, 7, 8, 9]\n"}, {"example_id": "bead_sort:2", "got": "[0, 3, 10, 19]\n", "source": "bead_sort([5, 0, 4, 3])\n", "truncated": false, "want": "[0, 3, 4, 5]\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "arithmetic_operator", "seed": 7, "span": {"col_offset": 45, "end_byte": 1005, "lineno": 31, "node": "BinOp", "node_col_offset": 35, "node_end_col_offset": 56, "node_end_lineno": 31, "node_lineno": 31, "op_index": 0, "original_text": "-", "replacement_text": "+", "start_byte": 1004}}, "public_tests": {"examples": [{"example_id": "bead_sort:0", "source": "bead_sort([6, 11, 12, 4, 1, 5])\n", "want": "[1, 4, 5, 6, 11, 12]\n"}, {"example_id": "bead_sort:1", "source": "bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])\n", "want": "[1, 2, 3, 4, 5, 6, 7, 8, 9]\n"}, {"example_id": "bead_sort:2", "source": "bead_sort([5, 0, 4, 3])\n", "want": "[0, 3, 4, 5]\n"}, {"example_id": "bead_sort:3", "source": "bead_sort([8, 2, 1])\n", "want": "[1, 2, 8]\n"}, {"example_id": "bead_sort:4", "source": "bead_sort([1, .9, 0.0, 0, -1, -.9])\n", "want": "Traceback (most recent call last):\n ...\nTypeError: Sequence must be list of non-negative integers\n"}, {"example_id": "bead_sort:5", "source": "bead_sort(\"Hello world\")\n", "want": "Traceback (most recent call last):\n ...\nTypeError: Sequence must be list of non-negative integers\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-f6e1300fe8386192", "tree_sha256": "04acca9b29ce716f4c2fd5e9b104a182869370d2aee8c78cba925da19bea0f83", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:sorts/bead_sort.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def bead_sort(sequence: list) -> list:\n \"\"\"\n >>> bead_sort([6, 11, 12, 4, 1, 5])\n [1, 4, 5, 6, 11, 12]\n\n >>> bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])\n [1, 2, 3, 4, 5, 6, 7, 8, 9]\n\n >>> bead_sort([5, 0, 4, 3])\n [0, 3, 4, 5]\n\n >>> bead_sort([8, 2, 1])\n [1, 2, 8]\n\n >>> bead_sort([1, .9, 0.0, 0, -1, -.9])\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n\n >>> bead_sort(\"Hello world\")\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n \"\"\"\n if any(not isinstance(x, int) or x < 0 for x in sequence):\n raise TypeError(\"Sequence must be list of non-negative integers\")\n for _ in range(len(sequence)):\n for i, (rod_upper, rod_lower) in enumerate(zip(sequence, sequence[1:])): # noqa: RUF007\n if rod_upper > rod_lower:\n sequence[i] -= rod_upper - rod_lower\n sequence[i + 1] += rod_upper - rod_lower\n return sequence\n"}, "sha256": "04acca9b29ce716f4c2fd5e9b104a182869370d2aee8c78cba925da19bea0f83"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "04acca9b29ce716f4c2fd5e9b104a182869370d2aee8c78cba925da19bea0f83", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "011ae930200051d97855c696e2e988d458ceb70681075eba3f78d210c69816a0", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00035"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00035", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 24, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def bead_sort(sequence: list) -> list:\n \"\"\"\n >>> bead_sort([6, 11, 12, 4, 1, 5])\n [1, 4, 5, 6, 11, 12]\n\n >>> bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])\n [1, 2, 3, 4, 5, 6, 7, 8, 9]\n\n >>> bead_sort([5, 0, 4, 3])\n [0, 3, 4, 5]\n\n >>> bead_sort([8, 2, 1])\n [1, 2, 8]\n\n >>> bead_sort([1, .9, 0.0, 0, -1, -.9])\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n\n >>> bead_sort(\"Hello world\")\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n \"\"\"\n if any(not isinstance(x, int) or x <= 0 for x in sequence):\n raise TypeError(\"Sequence must be list of non-negative integers\")\n for _ in range(len(sequence)):\n for i, (rod_upper, rod_lower) in enumerate(zip(sequence, sequence[1:])): # noqa: RUF007\n if rod_upper > rod_lower:\n sequence[i] -= rod_upper - rod_lower\n sequence[i + 1] += rod_upper - rod_lower\n return sequence\n"}, "sha256": "bd42bac8409265fcf308d4521462732544b5993ee039bc780650611a2f107dbc"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "bead_sort:2", "got": "TypeError: Sequence must be list of non-negative integers", "source": "bead_sort([5, 0, 4, 3])\n", "truncated": false, "want": "[0, 3, 4, 5]\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "comparison_boundary", "seed": 7, "span": {"col_offset": 39, "end_byte": 639, "lineno": 25, "node": "Compare", "node_col_offset": 37, "node_end_col_offset": 42, "node_end_lineno": 25, "node_lineno": 25, "op_index": 0, "original_text": "<", "replacement_text": "<=", "start_byte": 638}}, "public_tests": {"examples": [{"example_id": "bead_sort:0", "source": "bead_sort([6, 11, 12, 4, 1, 5])\n", "want": "[1, 4, 5, 6, 11, 12]\n"}, {"example_id": "bead_sort:1", "source": "bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])\n", "want": "[1, 2, 3, 4, 5, 6, 7, 8, 9]\n"}, {"example_id": "bead_sort:2", "source": "bead_sort([5, 0, 4, 3])\n", "want": "[0, 3, 4, 5]\n"}, {"example_id": "bead_sort:3", "source": "bead_sort([8, 2, 1])\n", "want": "[1, 2, 8]\n"}, {"example_id": "bead_sort:4", "source": "bead_sort([1, .9, 0.0, 0, -1, -.9])\n", "want": "Traceback (most recent call last):\n ...\nTypeError: Sequence must be list of non-negative integers\n"}, {"example_id": "bead_sort:5", "source": "bead_sort(\"Hello world\")\n", "want": "Traceback (most recent call last):\n ...\nTypeError: Sequence must be list of non-negative integers\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-f6e1300fe8386192", "tree_sha256": "04acca9b29ce716f4c2fd5e9b104a182869370d2aee8c78cba925da19bea0f83", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:sorts/bead_sort.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "import re\n\n\ndef is_sri_lankan_phone_number(phone: str) -> bool:\n \"\"\"\n Determine whether the string is a valid sri lankan mobile phone number or not\n References: https://aye.sh/blog/sri-lankan-phone-number-regex\n\n >>> is_sri_lankan_phone_number(\"+94773283048\")\n True\n >>> is_sri_lankan_phone_number(\"+9477-3283048\")\n True\n >>> is_sri_lankan_phone_number(\"0718382399\")\n True\n >>> is_sri_lankan_phone_number(\"0094702343221\")\n True\n >>> is_sri_lankan_phone_number(\"075 3201568\")\n True\n >>> is_sri_lankan_phone_number(\"07779209245\")\n False\n >>> is_sri_lankan_phone_number(\"0957651234\")\n False\n \"\"\"\n\n pattern = re.compile(r\"^(?:0|94|\\+94|0{2}94)7(0|1|2|4|5|6|7|8)(-| |)\\d{7}$\")\n\n return bool(re.search(pattern, phone))\n"}, "sha256": "5a7572266c5a72477b3cda42ba8412d2d279e7d575edaa2490464725eeb68272"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "5a7572266c5a72477b3cda42ba8412d2d279e7d575edaa2490464725eeb68272", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "b3ab5103bf73d4697967ac521828bcefeaa1a453b647a44fc2b59400b0864995", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00064"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00064", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 24, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "import re\n\n\ndef is_sri_lankan_phone_number(phone: str) -> bool:\n \"\"\"\n Determine whether the string is a valid sri lankan mobile phone number or not\n References: https://aye.sh/blog/sri-lankan-phone-number-regex\n\n >>> is_sri_lankan_phone_number(\"+94773283048\")\n True\n >>> is_sri_lankan_phone_number(\"+9477-3283048\")\n True\n >>> is_sri_lankan_phone_number(\"0718382399\")\n True\n >>> is_sri_lankan_phone_number(\"0094702343221\")\n True\n >>> is_sri_lankan_phone_number(\"075 3201568\")\n True\n >>> is_sri_lankan_phone_number(\"07779209245\")\n False\n >>> is_sri_lankan_phone_number(\"0957651234\")\n False\n \"\"\"\n\n pattern = re.compile(r\"^(?:0|94|\\+94|0{2}94)7(0|1|2|4|5|6|7|8)(-| |)\\d{7}$\")\n\n return not bool(re.search(pattern, phone))\n"}, "sha256": "4af90134d08c07eefd78892ad77baaa169c720a3603b2e7f95357f65f7194cf6"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "is_sri_lankan_phone_number:0", "got": "False\n", "source": "is_sri_lankan_phone_number(\"+94773283048\")\n", "truncated": false, "want": "True\n"}, {"example_id": "is_sri_lankan_phone_number:1", "got": "False\n", "source": "is_sri_lankan_phone_number(\"+9477-3283048\")\n", "truncated": false, "want": "True\n"}, {"example_id": "is_sri_lankan_phone_number:2", "got": "False\n", "source": "is_sri_lankan_phone_number(\"0718382399\")\n", "truncated": false, "want": "True\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "return_value", "seed": 7, "span": {"col_offset": 11, "end_byte": 772, "lineno": 27, "node": "Return", "node_col_offset": 4, "node_end_col_offset": 42, "node_end_lineno": 27, "node_lineno": 27, "op_index": 0, "original_text": "bool(re.search(pattern, phone))", "replacement_text": "not bool(re.search(pattern, phone))", "start_byte": 741}}, "public_tests": {"examples": [{"example_id": "is_sri_lankan_phone_number:0", "source": "is_sri_lankan_phone_number(\"+94773283048\")\n", "want": "True\n"}, {"example_id": "is_sri_lankan_phone_number:1", "source": "is_sri_lankan_phone_number(\"+9477-3283048\")\n", "want": "True\n"}, {"example_id": "is_sri_lankan_phone_number:2", "source": "is_sri_lankan_phone_number(\"0718382399\")\n", "want": "True\n"}, {"example_id": "is_sri_lankan_phone_number:3", "source": "is_sri_lankan_phone_number(\"0094702343221\")\n", "want": "True\n"}, {"example_id": "is_sri_lankan_phone_number:4", "source": "is_sri_lankan_phone_number(\"075 3201568\")\n", "want": "True\n"}, {"example_id": "is_sri_lankan_phone_number:5", "source": "is_sri_lankan_phone_number(\"07779209245\")\n", "want": "False\n"}, {"example_id": "is_sri_lankan_phone_number:6", "source": "is_sri_lankan_phone_number(\"0957651234\")\n", "want": "False\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-1ff3dd3475137408", "tree_sha256": "5a7572266c5a72477b3cda42ba8412d2d279e7d575edaa2490464725eeb68272", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:strings/is_srilankan_phone_number.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def abbr(a: str, b: str) -> bool:\n \"\"\"\n >>> abbr(\"daBcd\", \"ABC\")\n True\n >>> abbr(\"dBcd\", \"ABC\")\n False\n \"\"\"\n n = len(a)\n m = len(b)\n dp = [[False for _ in range(m + 1)] for _ in range(n + 1)]\n dp[0][0] = True\n for i in range(n):\n for j in range(m + 1):\n if dp[i][j]:\n if j < m and a[i].upper() == b[j]:\n dp[i + 1][j + 1] = True\n if a[i].islower():\n dp[i + 1][j] = True\n return dp[n][m]\n"}, "sha256": "cd136025e5ea57571936488aba726152741ac63fb7330ecdde85e6a628cfdde8"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "cd136025e5ea57571936488aba726152741ac63fb7330ecdde85e6a628cfdde8", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "91028567e23b4c780fa39eec515b99b452045d8799307cc526d9d7334d0a204c", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00079"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00079", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 18, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def abbr(a: str, b: str) -> bool:\n \"\"\"\n >>> abbr(\"daBcd\", \"ABC\")\n True\n >>> abbr(\"dBcd\", \"ABC\")\n False\n \"\"\"\n n = len(a)\n m = len(b)\n dp = [[False for _ in range(m + 1)] for _ in range(n + 1)]\n dp[0][0] = True\n for i in range(n):\n for j in range(m + 1):\n if dp[i][j]:\n if j < m and a[i].upper() == b[j]:\n dp[i + 1][j + 1] = True\n if a[i].islower():\n dp[i + 1][j] = True\n return not dp[n][m]\n"}, "sha256": "60d43a8d6f9f85e7c4c6e39fe89fac14b88024f3b0845ad6b95af4a3463a1e43"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "abbr:0", "got": "False\n", "source": "abbr(\"daBcd\", \"ABC\")\n", "truncated": false, "want": "True\n"}, {"example_id": "abbr:1", "got": "True\n", "source": "abbr(\"dBcd\", \"ABC\")\n", "truncated": false, "want": "False\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "return_value", "seed": 7, "span": {"col_offset": 11, "end_byte": 507, "lineno": 19, "node": "Return", "node_col_offset": 4, "node_end_col_offset": 19, "node_end_lineno": 19, "node_lineno": 19, "op_index": 0, "original_text": "dp[n][m]", "replacement_text": "not dp[n][m]", "start_byte": 499}}, "public_tests": {"examples": [{"example_id": "abbr:0", "source": "abbr(\"daBcd\", \"ABC\")\n", "want": "True\n"}, {"example_id": "abbr:1", "source": "abbr(\"dBcd\", \"ABC\")\n", "want": "False\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-23c1180811834dc3", "tree_sha256": "cd136025e5ea57571936488aba726152741ac63fb7330ecdde85e6a628cfdde8", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:dynamic_programming/abbreviation.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def excel_title_to_column(column_title: str) -> int:\n \"\"\"\n Given a string column_title that represents\n the column title in an Excel sheet, return\n its corresponding column number.\n\n >>> excel_title_to_column(\"A\")\n 1\n >>> excel_title_to_column(\"B\")\n 2\n >>> excel_title_to_column(\"AB\")\n 28\n >>> excel_title_to_column(\"Z\")\n 26\n \"\"\"\n assert column_title.isupper()\n answer = 0\n index = len(column_title) - 1\n power = 0\n\n while index >= 0:\n value = (ord(column_title[index]) - 64) * pow(26, power)\n answer += value\n power += 1\n index -= 1\n\n return answer\n"}, "sha256": "d2bccdede1a957988862c6af768012638c8b7d82a528cb15dfb77d43150c3a1f"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "d2bccdede1a957988862c6af768012638c8b7d82a528cb15dfb77d43150c3a1f", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "66362fb19e5f9516fd569ef6c3d7ce26a31011754ba2b2bcbeccd1f5f6b43863", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00083"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00083", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 9, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def excel_title_to_column(column_title: str) -> int:\n \"\"\"\n Given a string column_title that represents\n the column title in an Excel sheet, return\n its corresponding column number.\n\n >>> excel_title_to_column(\"A\")\n 1\n >>> excel_title_to_column(\"B\")\n 2\n >>> excel_title_to_column(\"AB\")\n 28\n >>> excel_title_to_column(\"Z\")\n 26\n \"\"\"\n assert column_title.isupper()\n answer = 0\n index = len(column_title) - 1\n power = 0\n\n while index >= 1:\n value = (ord(column_title[index]) - 64) * pow(26, power)\n answer += value\n power += 1\n index -= 1\n\n return answer\n"}, "sha256": "fb68afd9d1ae3b7b13ff13d7c593254e82e98b6c2253f0c1cb95b3cf272baacb"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "excel_title_to_column:0", "got": "0\n", "source": "excel_title_to_column(\"A\")\n", "truncated": false, "want": "1\n"}, {"example_id": "excel_title_to_column:1", "got": "0\n", "source": "excel_title_to_column(\"B\")\n", "truncated": false, "want": "2\n"}, {"example_id": "excel_title_to_column:2", "got": "2\n", "source": "excel_title_to_column(\"AB\")\n", "truncated": false, "want": "28\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "off_by_one", "seed": 7, "span": {"col_offset": 19, "end_byte": 487, "lineno": 21, "node": "Constant", "node_col_offset": 19, "node_end_col_offset": 20, "node_end_lineno": 21, "node_lineno": 21, "op_index": 0, "original_text": "0", "replacement_text": "1", "start_byte": 486}}, "public_tests": {"examples": [{"example_id": "excel_title_to_column:0", "source": "excel_title_to_column(\"A\")\n", "want": "1\n"}, {"example_id": "excel_title_to_column:1", "source": "excel_title_to_column(\"B\")\n", "want": "2\n"}, {"example_id": "excel_title_to_column:2", "source": "excel_title_to_column(\"AB\")\n", "want": "28\n"}, {"example_id": "excel_title_to_column:3", "source": "excel_title_to_column(\"Z\")\n", "want": "26\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-0cc8693ce86c522e", "tree_sha256": "d2bccdede1a957988862c6af768012638c8b7d82a528cb15dfb77d43150c3a1f", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:conversions/excel_title_to_column.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def bin_to_decimal(bin_string: str) -> int:\n \"\"\"\n Convert a binary value to its decimal equivalent\n\n >>> bin_to_decimal(\"101\")\n 5\n >>> bin_to_decimal(\" 1010 \")\n 10\n >>> bin_to_decimal(\"-11101\")\n -29\n >>> bin_to_decimal(\"0\")\n 0\n >>> bin_to_decimal(\"a\")\n Traceback (most recent call last):\n ...\n ValueError: Non-binary value was passed to the function\n >>> bin_to_decimal(\"\")\n Traceback (most recent call last):\n ...\n ValueError: Empty string was passed to the function\n >>> bin_to_decimal(\"39\")\n Traceback (most recent call last):\n ...\n ValueError: Non-binary value was passed to the function\n \"\"\"\n bin_string = str(bin_string).strip()\n if not bin_string:\n raise ValueError(\"Empty string was passed to the function\")\n is_negative = bin_string[0] == \"-\"\n if is_negative:\n bin_string = bin_string[1:]\n if not all(char in \"01\" for char in bin_string):\n raise ValueError(\"Non-binary value was passed to the function\")\n decimal_number = 0\n for char in bin_string:\n decimal_number = 2 * decimal_number + int(char)\n return -decimal_number if is_negative else decimal_number\n"}, "sha256": "008c9c223d79a417b1ebbae3a9d726e9db2e2b79be07ca32bdd9a73631759a99"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "008c9c223d79a417b1ebbae3a9d726e9db2e2b79be07ca32bdd9a73631759a99", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "01889c8f0ee27e5cb023438b4d8ac8fd1845fb446a48efa26e8d676d086740a7", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00107"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00107", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 9, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def bin_to_decimal(bin_string: str) -> int:\n \"\"\"\n Convert a binary value to its decimal equivalent\n\n >>> bin_to_decimal(\"101\")\n 5\n >>> bin_to_decimal(\" 1010 \")\n 10\n >>> bin_to_decimal(\"-11101\")\n -29\n >>> bin_to_decimal(\"0\")\n 0\n >>> bin_to_decimal(\"a\")\n Traceback (most recent call last):\n ...\n ValueError: Non-binary value was passed to the function\n >>> bin_to_decimal(\"\")\n Traceback (most recent call last):\n ...\n ValueError: Empty string was passed to the function\n >>> bin_to_decimal(\"39\")\n Traceback (most recent call last):\n ...\n ValueError: Non-binary value was passed to the function\n \"\"\"\n bin_string = str(bin_string).strip()\n if not bin_string:\n raise ValueError(\"Empty string was passed to the function\")\n is_negative = bin_string[0] == \"-\"\n if is_negative:\n bin_string = bin_string[1:]\n if not all(char in \"01\" for char in bin_string):\n raise ValueError(\"Non-binary value was passed to the function\")\n decimal_number = 0\n for char in bin_string:\n decimal_number = 2 * decimal_number + int(char)\n return (-decimal_number if is_negative else decimal_number) - 1\n"}, "sha256": "d5461aa6834d002ba10392b3d84a3129acae41802b6cf17de9fe30318bf9ddbc"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "bin_to_decimal:0", "got": "4\n", "source": "bin_to_decimal(\"101\")\n", "truncated": false, "want": "5\n"}, {"example_id": "bin_to_decimal:1", "got": "9\n", "source": "bin_to_decimal(\" 1010 \")\n", "truncated": false, "want": "10\n"}, {"example_id": "bin_to_decimal:2", "got": "-30\n", "source": "bin_to_decimal(\"-11101\")\n", "truncated": false, "want": "-29\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "return_value", "seed": 7, "span": {"col_offset": 11, "end_byte": 1200, "lineno": 37, "node": "Return", "node_col_offset": 4, "node_end_col_offset": 61, "node_end_lineno": 37, "node_lineno": 37, "op_index": 0, "original_text": "-decimal_number if is_negative else decimal_number", "replacement_text": "(-decimal_number if is_negative else decimal_number) - 1", "start_byte": 1150}}, "public_tests": {"examples": [{"example_id": "bin_to_decimal:0", "source": "bin_to_decimal(\"101\")\n", "want": "5\n"}, {"example_id": "bin_to_decimal:1", "source": "bin_to_decimal(\" 1010 \")\n", "want": "10\n"}, {"example_id": "bin_to_decimal:2", "source": "bin_to_decimal(\"-11101\")\n", "want": "-29\n"}, {"example_id": "bin_to_decimal:3", "source": "bin_to_decimal(\"0\")\n", "want": "0\n"}, {"example_id": "bin_to_decimal:4", "source": "bin_to_decimal(\"a\")\n", "want": "Traceback (most recent call last):\n ...\nValueError: Non-binary value was passed to the function\n"}, {"example_id": "bin_to_decimal:5", "source": "bin_to_decimal(\"\")\n", "want": "Traceback (most recent call last):\n ...\nValueError: Empty string was passed to the function\n"}, {"example_id": "bin_to_decimal:6", "source": "bin_to_decimal(\"39\")\n", "want": "Traceback (most recent call last):\n ...\nValueError: Non-binary value was passed to the function\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-647461df6a22f6b6", "tree_sha256": "008c9c223d79a417b1ebbae3a9d726e9db2e2b79be07ca32bdd9a73631759a99", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:conversions/binary_to_decimal.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def bead_sort(sequence: list) -> list:\n \"\"\"\n >>> bead_sort([6, 11, 12, 4, 1, 5])\n [1, 4, 5, 6, 11, 12]\n\n >>> bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])\n [1, 2, 3, 4, 5, 6, 7, 8, 9]\n\n >>> bead_sort([5, 0, 4, 3])\n [0, 3, 4, 5]\n\n >>> bead_sort([8, 2, 1])\n [1, 2, 8]\n\n >>> bead_sort([1, .9, 0.0, 0, -1, -.9])\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n\n >>> bead_sort(\"Hello world\")\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n \"\"\"\n if any(not isinstance(x, int) or x < 0 for x in sequence):\n raise TypeError(\"Sequence must be list of non-negative integers\")\n for _ in range(len(sequence)):\n for i, (rod_upper, rod_lower) in enumerate(zip(sequence, sequence[1:])): # noqa: RUF007\n if rod_upper > rod_lower:\n sequence[i] -= rod_upper - rod_lower\n sequence[i + 1] += rod_upper - rod_lower\n return sequence\n"}, "sha256": "04acca9b29ce716f4c2fd5e9b104a182869370d2aee8c78cba925da19bea0f83"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "04acca9b29ce716f4c2fd5e9b104a182869370d2aee8c78cba925da19bea0f83", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "d46bed4a321719795c6dcb0bcbce259c019ba3018375c1d37c4c79ceb26079ba", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00119"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00119", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 24, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def bead_sort(sequence: list) -> list:\n \"\"\"\n >>> bead_sort([6, 11, 12, 4, 1, 5])\n [1, 4, 5, 6, 11, 12]\n\n >>> bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])\n [1, 2, 3, 4, 5, 6, 7, 8, 9]\n\n >>> bead_sort([5, 0, 4, 3])\n [0, 3, 4, 5]\n\n >>> bead_sort([8, 2, 1])\n [1, 2, 8]\n\n >>> bead_sort([1, .9, 0.0, 0, -1, -.9])\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n\n >>> bead_sort(\"Hello world\")\n Traceback (most recent call last):\n ...\n TypeError: Sequence must be list of non-negative integers\n \"\"\"\n if any(not isinstance(x, int) or x < 0 for x in sequence):\n raise TypeError(\"Sequence must be list of non-negative integers\")\n for _ in range(len(sequence)):\n for i, (rod_upper, rod_lower) in enumerate(zip(sequence, sequence[1:])): # noqa: RUF007\n if rod_upper > rod_lower:\n sequence[i] += rod_upper - rod_lower\n sequence[i + 1] += rod_upper - rod_lower\n return sequence\n"}, "sha256": "38c33c7c59e6642f060ba2dbb52ec228b0d68a24c6c8f56c0ea1b40a4f2132f0"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "bead_sort:0", "got": "[6, 11, 20, 27, 78, 67]\n", "source": "bead_sort([6, 11, 12, 4, 1, 5])\n", "truncated": false, "want": "[1, 4, 5, 6, 11, 12]\n"}, {"example_id": "bead_sort:1", "got": "[10, 11, 12, 13, 14, 15, 16, 81, 73]\n", "source": "bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])\n", "truncated": false, "want": "[1, 2, 3, 4, 5, 6, 7, 8, 9]\n"}, {"example_id": "bead_sort:2", "got": "[16, 15, 25, 20]\n", "source": "bead_sort([5, 0, 4, 3])\n", "truncated": false, "want": "[0, 3, 4, 5]\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "arithmetic_operator", "seed": 7, "span": {"col_offset": 28, "end_byte": 936, "lineno": 30, "node": "AugAssign", "node_col_offset": 16, "node_end_col_offset": 52, "node_end_lineno": 30, "node_lineno": 30, "op_index": 0, "original_text": "-=", "replacement_text": "+=", "start_byte": 934}}, "public_tests": {"examples": [{"example_id": "bead_sort:0", "source": "bead_sort([6, 11, 12, 4, 1, 5])\n", "want": "[1, 4, 5, 6, 11, 12]\n"}, {"example_id": "bead_sort:1", "source": "bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])\n", "want": "[1, 2, 3, 4, 5, 6, 7, 8, 9]\n"}, {"example_id": "bead_sort:2", "source": "bead_sort([5, 0, 4, 3])\n", "want": "[0, 3, 4, 5]\n"}, {"example_id": "bead_sort:3", "source": "bead_sort([8, 2, 1])\n", "want": "[1, 2, 8]\n"}, {"example_id": "bead_sort:4", "source": "bead_sort([1, .9, 0.0, 0, -1, -.9])\n", "want": "Traceback (most recent call last):\n ...\nTypeError: Sequence must be list of non-negative integers\n"}, {"example_id": "bead_sort:5", "source": "bead_sort(\"Hello world\")\n", "want": "Traceback (most recent call last):\n ...\nTypeError: Sequence must be list of non-negative integers\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-f6e1300fe8386192", "tree_sha256": "04acca9b29ce716f4c2fd5e9b104a182869370d2aee8c78cba925da19bea0f83", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:sorts/bead_sort.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def climb_stairs(number_of_steps: int) -> int:\n \"\"\"\n LeetCdoe No.70: Climbing Stairs\n Distinct ways to climb a number_of_steps staircase where each time you can either\n climb 1 or 2 steps.\n\n Args:\n number_of_steps: number of steps on the staircase\n\n Returns:\n Distinct ways to climb a number_of_steps staircase\n\n Raises:\n AssertionError: number_of_steps not positive integer\n\n >>> climb_stairs(3)\n 3\n >>> climb_stairs(1)\n 1\n >>> climb_stairs(-7) # doctest: +ELLIPSIS\n Traceback (most recent call last):\n ...\n AssertionError: number_of_steps needs to be positive integer, your input -7\n \"\"\"\n assert isinstance(number_of_steps, int) and number_of_steps > 0, (\n f\"number_of_steps needs to be positive integer, your input {number_of_steps}\"\n )\n if number_of_steps == 1:\n return 1\n previous, current = 1, 1\n for _ in range(number_of_steps - 1):\n current, previous = current + previous, current\n return current\n"}, "sha256": "8d8f5f5d6158112073728e8b0642e39e7537ea3fd5b5309e9be88002803fb14c"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "8d8f5f5d6158112073728e8b0642e39e7537ea3fd5b5309e9be88002803fb14c", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "5d7c448220f35bb6af6945943651d70024ccf2ff11077ab92f03aab369b31542", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00132"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00132", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 10, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def climb_stairs(number_of_steps: int) -> int:\n \"\"\"\n LeetCdoe No.70: Climbing Stairs\n Distinct ways to climb a number_of_steps staircase where each time you can either\n climb 1 or 2 steps.\n\n Args:\n number_of_steps: number of steps on the staircase\n\n Returns:\n Distinct ways to climb a number_of_steps staircase\n\n Raises:\n AssertionError: number_of_steps not positive integer\n\n >>> climb_stairs(3)\n 3\n >>> climb_stairs(1)\n 1\n >>> climb_stairs(-7) # doctest: +ELLIPSIS\n Traceback (most recent call last):\n ...\n AssertionError: number_of_steps needs to be positive integer, your input -7\n \"\"\"\n assert isinstance(number_of_steps, int) and number_of_steps > 0, (\n f\"number_of_steps needs to be positive integer, your input {number_of_steps}\"\n )\n if number_of_steps == 1:\n return 2\n previous, current = 1, 1\n for _ in range(number_of_steps - 1):\n current, previous = current + previous, current\n return current\n"}, "sha256": "d823be68e275f8b61463686d5e42e114c85e7d4881ddb7e52d63dfe112b15db3"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "climb_stairs:1", "got": "2\n", "source": "climb_stairs(1)\n", "truncated": false, "want": "1\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "return_value", "seed": 7, "span": {"col_offset": 15, "end_byte": 872, "lineno": 29, "node": "Return", "node_col_offset": 8, "node_end_col_offset": 16, "node_end_lineno": 29, "node_lineno": 29, "op_index": 0, "original_text": "1", "replacement_text": "2", "start_byte": 871}}, "public_tests": {"examples": [{"example_id": "climb_stairs:0", "source": "climb_stairs(3)\n", "want": "3\n"}, {"example_id": "climb_stairs:1", "source": "climb_stairs(1)\n", "want": "1\n"}, {"example_id": "climb_stairs:2", "source": "climb_stairs(-7) # doctest: +ELLIPSIS\n", "want": "Traceback (most recent call last):\n ...\nAssertionError: number_of_steps needs to be positive integer, your input -7\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-b26e714447eb592d", "tree_sha256": "8d8f5f5d6158112073728e8b0642e39e7537ea3fd5b5309e9be88002803fb14c", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:dynamic_programming/climbing_stairs.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def binomial_coefficient(n: int, r: int) -> int:\n \"\"\"\n Find binomial coefficient using Pascal's triangle.\n\n Calculate C(n, r) using Pascal's triangle.\n\n :param n: The total number of items.\n :param r: The number of items to choose.\n :return: The binomial coefficient C(n, r).\n\n >>> binomial_coefficient(10, 5)\n 252\n >>> binomial_coefficient(10, 0)\n 1\n >>> binomial_coefficient(0, 10)\n 1\n >>> binomial_coefficient(10, 10)\n 1\n >>> binomial_coefficient(5, 2)\n 10\n >>> binomial_coefficient(5, 6)\n 0\n >>> binomial_coefficient(3, 5)\n 0\n >>> binomial_coefficient(-2, 3)\n Traceback (most recent call last):\n ...\n ValueError: n and r must be non-negative integers\n >>> binomial_coefficient(5, -1)\n Traceback (most recent call last):\n ...\n ValueError: n and r must be non-negative integers\n >>> binomial_coefficient(10.1, 5)\n Traceback (most recent call last):\n ...\n TypeError: 'float' object cannot be interpreted as an integer\n >>> binomial_coefficient(10, 5.1)\n Traceback (most recent call last):\n ...\n TypeError: 'float' object cannot be interpreted as an integer\n \"\"\"\n if n < 0 or r < 0:\n raise ValueError(\"n and r must be non-negative integers\")\n if 0 in (n, r):\n return 1\n c = [0 for i in range(r + 1)]\n # nc0 = 1\n c[0] = 1\n for i in range(1, n + 1):\n # to compute current row from previous row.\n j = min(i, r)\n while j > 0:\n c[j] += c[j - 1]\n j -= 1\n return c[r]\n"}, "sha256": "2fe48261ef4fe8f41022c2fb421c158f2a9f4673f636ad2eb70231612b644cd4"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "2fe48261ef4fe8f41022c2fb421c158f2a9f4673f636ad2eb70231612b644cd4", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "49ce17811a65451c8193aec2523abc7a4d6074f7942359ee746e4e38929c6f1d", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00145"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00145", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 24, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def binomial_coefficient(n: int, r: int) -> int:\n \"\"\"\n Find binomial coefficient using Pascal's triangle.\n\n Calculate C(n, r) using Pascal's triangle.\n\n :param n: The total number of items.\n :param r: The number of items to choose.\n :return: The binomial coefficient C(n, r).\n\n >>> binomial_coefficient(10, 5)\n 252\n >>> binomial_coefficient(10, 0)\n 1\n >>> binomial_coefficient(0, 10)\n 1\n >>> binomial_coefficient(10, 10)\n 1\n >>> binomial_coefficient(5, 2)\n 10\n >>> binomial_coefficient(5, 6)\n 0\n >>> binomial_coefficient(3, 5)\n 0\n >>> binomial_coefficient(-2, 3)\n Traceback (most recent call last):\n ...\n ValueError: n and r must be non-negative integers\n >>> binomial_coefficient(5, -1)\n Traceback (most recent call last):\n ...\n ValueError: n and r must be non-negative integers\n >>> binomial_coefficient(10.1, 5)\n Traceback (most recent call last):\n ...\n TypeError: 'float' object cannot be interpreted as an integer\n >>> binomial_coefficient(10, 5.1)\n Traceback (most recent call last):\n ...\n TypeError: 'float' object cannot be interpreted as an integer\n \"\"\"\n if n <= 0 or r < 0:\n raise ValueError(\"n and r must be non-negative integers\")\n if 0 in (n, r):\n return 1\n c = [0 for i in range(r + 1)]\n # nc0 = 1\n c[0] = 1\n for i in range(1, n + 1):\n # to compute current row from previous row.\n j = min(i, r)\n while j > 0:\n c[j] += c[j - 1]\n j -= 1\n return c[r]\n"}, "sha256": "55ecf6d36638345b88b7ab6a2cd3875c9513700a9ae8e4e8c493782b94ea6220"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "binomial_coefficient:2", "got": "ValueError: n and r must be non-negative integers", "source": "binomial_coefficient(0, 10)\n", "truncated": false, "want": "1\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "comparison_boundary", "seed": 7, "span": {"col_offset": 9, "end_byte": 1200, "lineno": 42, "node": "Compare", "node_col_offset": 7, "node_end_col_offset": 12, "node_end_lineno": 42, "node_lineno": 42, "op_index": 0, "original_text": "<", "replacement_text": "<=", "start_byte": 1199}}, "public_tests": {"examples": [{"example_id": "binomial_coefficient:0", "source": "binomial_coefficient(10, 5)\n", "want": "252\n"}, {"example_id": "binomial_coefficient:1", "source": "binomial_coefficient(10, 0)\n", "want": "1\n"}, {"example_id": "binomial_coefficient:2", "source": "binomial_coefficient(0, 10)\n", "want": "1\n"}, {"example_id": "binomial_coefficient:3", "source": "binomial_coefficient(10, 10)\n", "want": "1\n"}, {"example_id": "binomial_coefficient:4", "source": "binomial_coefficient(5, 2)\n", "want": "10\n"}, {"example_id": "binomial_coefficient:5", "source": "binomial_coefficient(5, 6)\n", "want": "0\n"}, {"example_id": "binomial_coefficient:6", "source": "binomial_coefficient(3, 5)\n", "want": "0\n"}, {"example_id": "binomial_coefficient:7", "source": "binomial_coefficient(-2, 3)\n", "want": "Traceback (most recent call last):\n ...\nValueError: n and r must be non-negative integers\n"}, {"example_id": "binomial_coefficient:8", "source": "binomial_coefficient(5, -1)\n", "want": "Traceback (most recent call last):\n ...\nValueError: n and r must be non-negative integers\n"}, {"example_id": "binomial_coefficient:9", "source": "binomial_coefficient(10.1, 5)\n", "want": "Traceback (most recent call last):\n ...\nTypeError: 'float' object cannot be interpreted as an integer\n"}, {"example_id": "binomial_coefficient:10", "source": "binomial_coefficient(10, 5.1)\n", "want": "Traceback (most recent call last):\n ...\nTypeError: 'float' object cannot be interpreted as an integer\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-d8e9fdff824fcd8a", "tree_sha256": "2fe48261ef4fe8f41022c2fb421c158f2a9f4673f636ad2eb70231612b644cd4", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:maths/binomial_coefficient.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def binomial_coefficient(n: int, r: int) -> int:\n \"\"\"\n Find binomial coefficient using Pascal's triangle.\n\n Calculate C(n, r) using Pascal's triangle.\n\n :param n: The total number of items.\n :param r: The number of items to choose.\n :return: The binomial coefficient C(n, r).\n\n >>> binomial_coefficient(10, 5)\n 252\n >>> binomial_coefficient(10, 0)\n 1\n >>> binomial_coefficient(0, 10)\n 1\n >>> binomial_coefficient(10, 10)\n 1\n >>> binomial_coefficient(5, 2)\n 10\n >>> binomial_coefficient(5, 6)\n 0\n >>> binomial_coefficient(3, 5)\n 0\n >>> binomial_coefficient(-2, 3)\n Traceback (most recent call last):\n ...\n ValueError: n and r must be non-negative integers\n >>> binomial_coefficient(5, -1)\n Traceback (most recent call last):\n ...\n ValueError: n and r must be non-negative integers\n >>> binomial_coefficient(10.1, 5)\n Traceback (most recent call last):\n ...\n TypeError: 'float' object cannot be interpreted as an integer\n >>> binomial_coefficient(10, 5.1)\n Traceback (most recent call last):\n ...\n TypeError: 'float' object cannot be interpreted as an integer\n \"\"\"\n if n < 0 or r < 0:\n raise ValueError(\"n and r must be non-negative integers\")\n if 0 in (n, r):\n return 1\n c = [0 for i in range(r + 1)]\n # nc0 = 1\n c[0] = 1\n for i in range(1, n + 1):\n # to compute current row from previous row.\n j = min(i, r)\n while j > 0:\n c[j] += c[j - 1]\n j -= 1\n return c[r]\n"}, "sha256": "2fe48261ef4fe8f41022c2fb421c158f2a9f4673f636ad2eb70231612b644cd4"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "2fe48261ef4fe8f41022c2fb421c158f2a9f4673f636ad2eb70231612b644cd4", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "e1c0c20d6af920d889d17a4a06da2106fef81e5f464aa27526679a284920479f", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00214"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00214", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 24, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def binomial_coefficient(n: int, r: int) -> int:\n \"\"\"\n Find binomial coefficient using Pascal's triangle.\n\n Calculate C(n, r) using Pascal's triangle.\n\n :param n: The total number of items.\n :param r: The number of items to choose.\n :return: The binomial coefficient C(n, r).\n\n >>> binomial_coefficient(10, 5)\n 252\n >>> binomial_coefficient(10, 0)\n 1\n >>> binomial_coefficient(0, 10)\n 1\n >>> binomial_coefficient(10, 10)\n 1\n >>> binomial_coefficient(5, 2)\n 10\n >>> binomial_coefficient(5, 6)\n 0\n >>> binomial_coefficient(3, 5)\n 0\n >>> binomial_coefficient(-2, 3)\n Traceback (most recent call last):\n ...\n ValueError: n and r must be non-negative integers\n >>> binomial_coefficient(5, -1)\n Traceback (most recent call last):\n ...\n ValueError: n and r must be non-negative integers\n >>> binomial_coefficient(10.1, 5)\n Traceback (most recent call last):\n ...\n TypeError: 'float' object cannot be interpreted as an integer\n >>> binomial_coefficient(10, 5.1)\n Traceback (most recent call last):\n ...\n TypeError: 'float' object cannot be interpreted as an integer\n \"\"\"\n if n < 1 or r < 0:\n raise ValueError(\"n and r must be non-negative integers\")\n if 0 in (n, r):\n return 1\n c = [0 for i in range(r + 1)]\n # nc0 = 1\n c[0] = 1\n for i in range(1, n + 1):\n # to compute current row from previous row.\n j = min(i, r)\n while j > 0:\n c[j] += c[j - 1]\n j -= 1\n return c[r]\n"}, "sha256": "b44572dde88d31ae5bd4aaaa51e429729b6b623d2a1b8230fb01e428406ac696"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "binomial_coefficient:2", "got": "ValueError: n and r must be non-negative integers", "source": "binomial_coefficient(0, 10)\n", "truncated": false, "want": "1\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "off_by_one", "seed": 7, "span": {"col_offset": 11, "end_byte": 1202, "lineno": 42, "node": "Constant", "node_col_offset": 11, "node_end_col_offset": 12, "node_end_lineno": 42, "node_lineno": 42, "op_index": 0, "original_text": "0", "replacement_text": "1", "start_byte": 1201}}, "public_tests": {"examples": [{"example_id": "binomial_coefficient:0", "source": "binomial_coefficient(10, 5)\n", "want": "252\n"}, {"example_id": "binomial_coefficient:1", "source": "binomial_coefficient(10, 0)\n", "want": "1\n"}, {"example_id": "binomial_coefficient:2", "source": "binomial_coefficient(0, 10)\n", "want": "1\n"}, {"example_id": "binomial_coefficient:3", "source": "binomial_coefficient(10, 10)\n", "want": "1\n"}, {"example_id": "binomial_coefficient:4", "source": "binomial_coefficient(5, 2)\n", "want": "10\n"}, {"example_id": "binomial_coefficient:5", "source": "binomial_coefficient(5, 6)\n", "want": "0\n"}, {"example_id": "binomial_coefficient:6", "source": "binomial_coefficient(3, 5)\n", "want": "0\n"}, {"example_id": "binomial_coefficient:7", "source": "binomial_coefficient(-2, 3)\n", "want": "Traceback (most recent call last):\n ...\nValueError: n and r must be non-negative integers\n"}, {"example_id": "binomial_coefficient:8", "source": "binomial_coefficient(5, -1)\n", "want": "Traceback (most recent call last):\n ...\nValueError: n and r must be non-negative integers\n"}, {"example_id": "binomial_coefficient:9", "source": "binomial_coefficient(10.1, 5)\n", "want": "Traceback (most recent call last):\n ...\nTypeError: 'float' object cannot be interpreted as an integer\n"}, {"example_id": "binomial_coefficient:10", "source": "binomial_coefficient(10, 5.1)\n", "want": "Traceback (most recent call last):\n ...\nTypeError: 'float' object cannot be interpreted as an integer\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-d8e9fdff824fcd8a", "tree_sha256": "2fe48261ef4fe8f41022c2fb421c158f2a9f4673f636ad2eb70231612b644cd4", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:maths/binomial_coefficient.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def excel_title_to_column(column_title: str) -> int:\n \"\"\"\n Given a string column_title that represents\n the column title in an Excel sheet, return\n its corresponding column number.\n\n >>> excel_title_to_column(\"A\")\n 1\n >>> excel_title_to_column(\"B\")\n 2\n >>> excel_title_to_column(\"AB\")\n 28\n >>> excel_title_to_column(\"Z\")\n 26\n \"\"\"\n assert column_title.isupper()\n answer = 0\n index = len(column_title) - 1\n power = 0\n\n while index >= 0:\n value = (ord(column_title[index]) - 64) * pow(26, power)\n answer += value\n power += 1\n index -= 1\n\n return answer\n"}, "sha256": "d2bccdede1a957988862c6af768012638c8b7d82a528cb15dfb77d43150c3a1f"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "d2bccdede1a957988862c6af768012638c8b7d82a528cb15dfb77d43150c3a1f", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "0500558ef62e50015a510bed1ec6542bb4b6ee8a533863879159043f677f4814", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00217"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00217", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 9, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def excel_title_to_column(column_title: str) -> int:\n \"\"\"\n Given a string column_title that represents\n the column title in an Excel sheet, return\n its corresponding column number.\n\n >>> excel_title_to_column(\"A\")\n 1\n >>> excel_title_to_column(\"B\")\n 2\n >>> excel_title_to_column(\"AB\")\n 28\n >>> excel_title_to_column(\"Z\")\n 26\n \"\"\"\n assert column_title.isupper()\n answer = 0\n index = len(column_title) - 1\n power = 0\n\n while index >= 0:\n value = (ord(column_title[index]) + 64) * pow(26, power)\n answer += value\n power += 1\n index -= 1\n\n return answer\n"}, "sha256": "262695fcefcd392439ceb5b40ede42f0fbbf256022078ec230c7ab3f0c1dc601"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "excel_title_to_column:0", "got": "129\n", "source": "excel_title_to_column(\"A\")\n", "truncated": false, "want": "1\n"}, {"example_id": "excel_title_to_column:1", "got": "130\n", "source": "excel_title_to_column(\"B\")\n", "truncated": false, "want": "2\n"}, {"example_id": "excel_title_to_column:2", "got": "3484\n", "source": "excel_title_to_column(\"AB\")\n", "truncated": false, "want": "28\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "arithmetic_operator", "seed": 7, "span": {"col_offset": 42, "end_byte": 532, "lineno": 22, "node": "BinOp", "node_col_offset": 17, "node_end_col_offset": 46, "node_end_lineno": 22, "node_lineno": 22, "op_index": 0, "original_text": "-", "replacement_text": "+", "start_byte": 531}}, "public_tests": {"examples": [{"example_id": "excel_title_to_column:0", "source": "excel_title_to_column(\"A\")\n", "want": "1\n"}, {"example_id": "excel_title_to_column:1", "source": "excel_title_to_column(\"B\")\n", "want": "2\n"}, {"example_id": "excel_title_to_column:2", "source": "excel_title_to_column(\"AB\")\n", "want": "28\n"}, {"example_id": "excel_title_to_column:3", "source": "excel_title_to_column(\"Z\")\n", "want": "26\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-0cc8693ce86c522e", "tree_sha256": "d2bccdede1a957988862c6af768012638c8b7d82a528cb15dfb77d43150c3a1f", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:conversions/excel_title_to_column.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def edit_distance(source: str, target: str) -> int:\n \"\"\"\n Edit distance algorithm is a string metric, i.e., it is a way of quantifying how\n dissimilar two strings are to one another. It is measured by counting the minimum\n number of operations required to transform one string into another.\n\n This implementation assumes that the cost of operations (insertion, deletion and\n substitution) is always 1\n\n Args:\n source: the initial string with respect to which we are calculating the edit\n distance for the target\n target: the target string, formed after performing n operations on the source string\n\n >>> edit_distance(\"GATTIC\", \"GALTIC\")\n 1\n >>> edit_distance(\"NUM3\", \"HUM2\")\n 2\n >>> edit_distance(\"cap\", \"CAP\")\n 3\n >>> edit_distance(\"Cat\", \"\")\n 3\n >>> edit_distance(\"cat\", \"cat\")\n 0\n >>> edit_distance(\"\", \"123456789\")\n 9\n >>> edit_distance(\"Be@uty\", \"Beautyyyy!\")\n 5\n >>> edit_distance(\"lstring\", \"lsstring\")\n 1\n \"\"\"\n if len(source) == 0:\n return len(target)\n elif len(target) == 0:\n return len(source)\n\n delta = int(source[-1] != target[-1]) # Substitution\n return min(\n edit_distance(source[:-1], target[:-1]) + delta,\n edit_distance(source, target[:-1]) + 1,\n edit_distance(source[:-1], target) + 1,\n )\n"}, "sha256": "f7e41d096e2eae5c830a2688b41908df39bca75e1c2469ede03c125fd17990c7"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "f7e41d096e2eae5c830a2688b41908df39bca75e1c2469ede03c125fd17990c7", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "e1a5fc77a6bc28985e585ad5e08d5a06740e04f6b43f5285dc6e599dd6538ed8", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00220"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00220", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 24, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def edit_distance(source: str, target: str) -> int:\n \"\"\"\n Edit distance algorithm is a string metric, i.e., it is a way of quantifying how\n dissimilar two strings are to one another. It is measured by counting the minimum\n number of operations required to transform one string into another.\n\n This implementation assumes that the cost of operations (insertion, deletion and\n substitution) is always 1\n\n Args:\n source: the initial string with respect to which we are calculating the edit\n distance for the target\n target: the target string, formed after performing n operations on the source string\n\n >>> edit_distance(\"GATTIC\", \"GALTIC\")\n 1\n >>> edit_distance(\"NUM3\", \"HUM2\")\n 2\n >>> edit_distance(\"cap\", \"CAP\")\n 3\n >>> edit_distance(\"Cat\", \"\")\n 3\n >>> edit_distance(\"cat\", \"cat\")\n 0\n >>> edit_distance(\"\", \"123456789\")\n 9\n >>> edit_distance(\"Be@uty\", \"Beautyyyy!\")\n 5\n >>> edit_distance(\"lstring\", \"lsstring\")\n 1\n \"\"\"\n if len(source) == 0:\n return len(target)\n elif len(target) == 0:\n return len(source)\n\n delta = int(source[-1] != target[-1]) # Substitution\n return min(\n edit_distance(source[:-1], target[:-1]) - delta,\n edit_distance(source, target[:-1]) + 1,\n edit_distance(source[:-1], target) + 1,\n )\n"}, "sha256": "c38416b81572578edb59421f1aaeec41b2cef86ca094aea6972a08ea0fc4d78a"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "edit_distance:0", "got": "-3\n", "source": "edit_distance(\"GATTIC\", \"GALTIC\")\n", "truncated": false, "want": "1\n"}, {"example_id": "edit_distance:1", "got": "-2\n", "source": "edit_distance(\"NUM3\", \"HUM2\")\n", "truncated": false, "want": "2\n"}, {"example_id": "edit_distance:2", "got": "-3\n", "source": "edit_distance(\"cap\", \"CAP\")\n", "truncated": false, "want": "3\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "arithmetic_operator", "seed": 7, "span": {"col_offset": 48, "end_byte": 1234, "lineno": 39, "node": "BinOp", "node_col_offset": 8, "node_end_col_offset": 55, "node_end_lineno": 39, "node_lineno": 39, "op_index": 0, "original_text": "+", "replacement_text": "-", "start_byte": 1233}}, "public_tests": {"examples": [{"example_id": "edit_distance:0", "source": "edit_distance(\"GATTIC\", \"GALTIC\")\n", "want": "1\n"}, {"example_id": "edit_distance:1", "source": "edit_distance(\"NUM3\", \"HUM2\")\n", "want": "2\n"}, {"example_id": "edit_distance:2", "source": "edit_distance(\"cap\", \"CAP\")\n", "want": "3\n"}, {"example_id": "edit_distance:3", "source": "edit_distance(\"Cat\", \"\")\n", "want": "3\n"}, {"example_id": "edit_distance:4", "source": "edit_distance(\"cat\", \"cat\")\n", "want": "0\n"}, {"example_id": "edit_distance:5", "source": "edit_distance(\"\", \"123456789\")\n", "want": "9\n"}, {"example_id": "edit_distance:6", "source": "edit_distance(\"Be@uty\", \"Beautyyyy!\")\n", "want": "5\n"}, {"example_id": "edit_distance:7", "source": "edit_distance(\"lstring\", \"lsstring\")\n", "want": "1\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-d6156e5e34b8ee9a", "tree_sha256": "f7e41d096e2eae5c830a2688b41908df39bca75e1c2469ede03c125fd17990c7", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:strings/edit_distance.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def excel_title_to_column(column_title: str) -> int:\n \"\"\"\n Given a string column_title that represents\n the column title in an Excel sheet, return\n its corresponding column number.\n\n >>> excel_title_to_column(\"A\")\n 1\n >>> excel_title_to_column(\"B\")\n 2\n >>> excel_title_to_column(\"AB\")\n 28\n >>> excel_title_to_column(\"Z\")\n 26\n \"\"\"\n assert column_title.isupper()\n answer = 0\n index = len(column_title) - 1\n power = 0\n\n while index >= 0:\n value = (ord(column_title[index]) - 64) * pow(26, power)\n answer += value\n power += 1\n index -= 1\n\n return answer\n"}, "sha256": "d2bccdede1a957988862c6af768012638c8b7d82a528cb15dfb77d43150c3a1f"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "d2bccdede1a957988862c6af768012638c8b7d82a528cb15dfb77d43150c3a1f", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "92314758694c5f43d3fa4dd5bc82f98b62df4e902d68cb3dd3ee004e3f238fc5", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00224"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00224", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 9, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def excel_title_to_column(column_title: str) -> int:\n \"\"\"\n Given a string column_title that represents\n the column title in an Excel sheet, return\n its corresponding column number.\n\n >>> excel_title_to_column(\"A\")\n 1\n >>> excel_title_to_column(\"B\")\n 2\n >>> excel_title_to_column(\"AB\")\n 28\n >>> excel_title_to_column(\"Z\")\n 26\n \"\"\"\n assert column_title.isupper()\n answer = 0\n index = len(column_title) - 1\n power = 0\n\n while index >= 0:\n value = (ord(column_title[index]) - 64) // pow(26, power)\n answer += value\n power += 1\n index -= 1\n\n return answer\n"}, "sha256": "ecf3cada7abc27c8182568e16bb6bb0da3e5adbe0f8b013b70d75b1eec6eb2cf"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "excel_title_to_column:2", "got": "2\n", "source": "excel_title_to_column(\"AB\")\n", "truncated": false, "want": "28\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "arithmetic_operator", "seed": 7, "span": {"col_offset": 48, "end_byte": 538, "lineno": 22, "node": "BinOp", "node_col_offset": 16, "node_end_col_offset": 64, "node_end_lineno": 22, "node_lineno": 22, "op_index": 0, "original_text": "*", "replacement_text": "//", "start_byte": 537}}, "public_tests": {"examples": [{"example_id": "excel_title_to_column:0", "source": "excel_title_to_column(\"A\")\n", "want": "1\n"}, {"example_id": "excel_title_to_column:1", "source": "excel_title_to_column(\"B\")\n", "want": "2\n"}, {"example_id": "excel_title_to_column:2", "source": "excel_title_to_column(\"AB\")\n", "want": "28\n"}, {"example_id": "excel_title_to_column:3", "source": "excel_title_to_column(\"Z\")\n", "want": "26\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-0cc8693ce86c522e", "tree_sha256": "d2bccdede1a957988862c6af768012638c8b7d82a528cb15dfb77d43150c3a1f", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:conversions/excel_title_to_column.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def capitalize(sentence: str) -> str:\n \"\"\"\n Capitalizes the first letter of a sentence or word.\n\n >>> capitalize(\"hello world\")\n 'Hello world'\n >>> capitalize(\"123 hello world\")\n '123 hello world'\n >>> capitalize(\" hello world\")\n ' hello world'\n >>> capitalize(\"a\")\n 'A'\n >>> capitalize(\"\")\n ''\n \"\"\"\n if not sentence:\n return \"\"\n\n # Capitalize the first character if it's a lowercase letter\n # Concatenate the capitalized character with the rest of the string\n return sentence[0].upper() + sentence[1:]\n"}, "sha256": "dfb679e2ca3c895ef1d3ad5a2977871944f1a3b9d5e9665a9f4bebe5c7409908"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "dfb679e2ca3c895ef1d3ad5a2977871944f1a3b9d5e9665a9f4bebe5c7409908", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "df1cde90de8a416ed60edc0cf99c1c63c4e7a572c632e486c5c955a698a29612", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00275"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00275", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 19, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def capitalize(sentence: str) -> str:\n \"\"\"\n Capitalizes the first letter of a sentence or word.\n\n >>> capitalize(\"hello world\")\n 'Hello world'\n >>> capitalize(\"123 hello world\")\n '123 hello world'\n >>> capitalize(\" hello world\")\n ' hello world'\n >>> capitalize(\"a\")\n 'A'\n >>> capitalize(\"\")\n ''\n \"\"\"\n if not sentence:\n return \"\"\n\n # Capitalize the first character if it's a lowercase letter\n # Concatenate the capitalized character with the rest of the string\n return sentence[0].upper() + sentence[2:]\n"}, "sha256": "63f401b6a5f6fdf695ab7da12b28663d0abe0e8b14cb47b931b2e0da819ddc6e"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "capitalize:0", "got": "'Hllo world'\n", "source": "capitalize(\"hello world\")\n", "truncated": false, "want": "'Hello world'\n"}, {"example_id": "capitalize:1", "got": "'13 hello world'\n", "source": "capitalize(\"123 hello world\")\n", "truncated": false, "want": "'123 hello world'\n"}, {"example_id": "capitalize:2", "got": "' ello world'\n", "source": "capitalize(\" hello world\")\n", "truncated": false, "want": "' hello world'\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "off_by_one", "seed": 7, "span": {"col_offset": 42, "end_byte": 558, "lineno": 21, "node": "Constant", "node_col_offset": 42, "node_end_col_offset": 43, "node_end_lineno": 21, "node_lineno": 21, "op_index": 0, "original_text": "1", "replacement_text": "2", "start_byte": 557}}, "public_tests": {"examples": [{"example_id": "capitalize:0", "source": "capitalize(\"hello world\")\n", "want": "'Hello world'\n"}, {"example_id": "capitalize:1", "source": "capitalize(\"123 hello world\")\n", "want": "'123 hello world'\n"}, {"example_id": "capitalize:2", "source": "capitalize(\" hello world\")\n", "want": "' hello world'\n"}, {"example_id": "capitalize:3", "source": "capitalize(\"a\")\n", "want": "'A'\n"}, {"example_id": "capitalize:4", "source": "capitalize(\"\")\n", "want": "''\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-0f154a82c5a57144", "tree_sha256": "dfb679e2ca3c895ef1d3ad5a2977871944f1a3b9d5e9665a9f4bebe5c7409908", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:strings/capitalize.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def trapped_rainwater(heights: tuple[int, ...]) -> int:\n \"\"\"\n The trapped_rainwater function calculates the total amount of rainwater that can be\n trapped given an array of bar heights.\n It uses a dynamic programming approach, determining the maximum height of bars on\n both sides for each bar, and then computing the trapped water above each bar.\n The function returns the total trapped water.\n\n >>> trapped_rainwater((0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1))\n 6\n >>> trapped_rainwater((7, 1, 5, 3, 6, 4))\n 9\n >>> trapped_rainwater((7, 1, 5, 3, 6, -1))\n Traceback (most recent call last):\n ...\n ValueError: No height can be negative\n \"\"\"\n if not heights:\n return 0\n if any(h < 0 for h in heights):\n raise ValueError(\"No height can be negative\")\n length = len(heights)\n\n left_max = [0] * length\n left_max[0] = heights[0]\n for i, height in enumerate(heights[1:], start=1):\n left_max[i] = max(height, left_max[i - 1])\n\n right_max = [0] * length\n right_max[-1] = heights[-1]\n for i in range(length - 2, -1, -1):\n right_max[i] = max(heights[i], right_max[i + 1])\n\n return sum(\n min(left, right) - height\n for left, right, height in zip(left_max, right_max, heights)\n )\n"}, "sha256": "d31f1ae8117f2b87405c77ae70313c99f2421b228f615bb03e744a7eb1be7d57"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "d31f1ae8117f2b87405c77ae70313c99f2421b228f615bb03e744a7eb1be7d57", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "593b380fa377963f55add85c7a6e605094768bf8a7bdd61fb9ca4f5f74c3ec8b", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00283"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00283", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 13, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def trapped_rainwater(heights: tuple[int, ...]) -> int:\n \"\"\"\n The trapped_rainwater function calculates the total amount of rainwater that can be\n trapped given an array of bar heights.\n It uses a dynamic programming approach, determining the maximum height of bars on\n both sides for each bar, and then computing the trapped water above each bar.\n The function returns the total trapped water.\n\n >>> trapped_rainwater((0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1))\n 6\n >>> trapped_rainwater((7, 1, 5, 3, 6, 4))\n 9\n >>> trapped_rainwater((7, 1, 5, 3, 6, -1))\n Traceback (most recent call last):\n ...\n ValueError: No height can be negative\n \"\"\"\n if not heights:\n return 0\n if any(h < 0 for h in heights):\n raise ValueError(\"No height can be negative\")\n length = len(heights)\n\n left_max = [0] * length\n left_max[0] = heights[0]\n for i, height in enumerate(heights[0:], start=1):\n left_max[i] = max(height, left_max[i - 1])\n\n right_max = [0] * length\n right_max[-1] = heights[-1]\n for i in range(length - 2, -1, -1):\n right_max[i] = max(heights[i], right_max[i + 1])\n\n return sum(\n min(left, right) - height\n for left, right, height in zip(left_max, right_max, heights)\n )\n"}, "sha256": "47e0d0a581fbf697d67bce069170ca70b11430d22a8ab091da06cbcad7d41afb"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "trapped_rainwater:0", "got": "IndexError: list assignment index out of range", "source": "trapped_rainwater((0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1))\n", "truncated": false, "want": "6\n"}, {"example_id": "trapped_rainwater:1", "got": "IndexError: list assignment index out of range", "source": "trapped_rainwater((7, 1, 5, 3, 6, 4))\n", "truncated": false, "want": "9\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "off_by_one", "seed": 7, "span": {"col_offset": 39, "end_byte": 935, "lineno": 26, "node": "Constant", "node_col_offset": 39, "node_end_col_offset": 40, "node_end_lineno": 26, "node_lineno": 26, "op_index": 0, "original_text": "1", "replacement_text": "0", "start_byte": 934}}, "public_tests": {"examples": [{"example_id": "trapped_rainwater:0", "source": "trapped_rainwater((0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1))\n", "want": "6\n"}, {"example_id": "trapped_rainwater:1", "source": "trapped_rainwater((7, 1, 5, 3, 6, 4))\n", "want": "9\n"}, {"example_id": "trapped_rainwater:2", "source": "trapped_rainwater((7, 1, 5, 3, 6, -1))\n", "want": "Traceback (most recent call last):\n ...\nValueError: No height can be negative\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-bc6f04b4da7291de", "tree_sha256": "d31f1ae8117f2b87405c77ae70313c99f2421b228f615bb03e744a7eb1be7d57", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:dynamic_programming/trapped_water.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def find_min(numbers: list[int]) -> int:\n \"\"\"\n >>> find_min([1, 2, 3, 4, 5])\n 1\n >>> find_min([5, 5, 5, 5, 5])\n 5\n >>> find_min([5, 5, 5, 5])\n 0\n >>> find_min([3])\n 3\n >>> find_min([])\n 0\n >>> find_min([1, 2, 3, 4])\n 0\n >>> find_min([0, 0, 0, 0])\n 0\n >>> find_min([-1, -5, 5, 1])\n 0\n >>> find_min([-1, -5, 5, 1])\n 0\n >>> find_min([9, 9, 9, 9, 9])\n 9\n >>> find_min([1, 5, 10, 3])\n 1\n >>> find_min([-1, 0, 1])\n 0\n >>> find_min(range(10, 0, -1))\n 1\n >>> find_min([-1])\n Traceback (most recent call last):\n --\n IndexError: list assignment index out of range\n >>> find_min([0, 0, 0, 1, 2, -4])\n Traceback (most recent call last):\n ...\n IndexError: list assignment index out of range\n >>> find_min([-1, -5, -10, -3])\n Traceback (most recent call last):\n ...\n IndexError: list assignment index out of range\n \"\"\"\n n = len(numbers)\n s = sum(numbers)\n\n dp = [[False for x in range(s + 1)] for y in range(n + 1)]\n\n for i in range(n + 1):\n dp[i][0] = True\n\n for i in range(1, s + 1):\n dp[0][i] = False\n\n for i in range(1, n + 1):\n for j in range(1, s + 1):\n dp[i][j] = dp[i - 1][j]\n\n if numbers[i - 1] <= j:\n dp[i][j] = dp[i][j] or dp[i - 1][j - numbers[i - 1]]\n\n for j in range(int(s / 2), -1, -1):\n if dp[n][j] is True:\n diff = s - 2 * j\n break\n\n return diff\n"}, "sha256": "33c3331da0d75349ae912b4635be2f1023f8b2c67b9fd0415067b2755d848883"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "33c3331da0d75349ae912b4635be2f1023f8b2c67b9fd0415067b2755d848883", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "d425cc07dbb39e708ca3f960b76bb83fec833c97342e5556da94ce6d5a60b850", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00310"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00310", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 24, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def find_min(numbers: list[int]) -> int:\n \"\"\"\n >>> find_min([1, 2, 3, 4, 5])\n 1\n >>> find_min([5, 5, 5, 5, 5])\n 5\n >>> find_min([5, 5, 5, 5])\n 0\n >>> find_min([3])\n 3\n >>> find_min([])\n 0\n >>> find_min([1, 2, 3, 4])\n 0\n >>> find_min([0, 0, 0, 0])\n 0\n >>> find_min([-1, -5, 5, 1])\n 0\n >>> find_min([-1, -5, 5, 1])\n 0\n >>> find_min([9, 9, 9, 9, 9])\n 9\n >>> find_min([1, 5, 10, 3])\n 1\n >>> find_min([-1, 0, 1])\n 0\n >>> find_min(range(10, 0, -1))\n 1\n >>> find_min([-1])\n Traceback (most recent call last):\n --\n IndexError: list assignment index out of range\n >>> find_min([0, 0, 0, 1, 2, -4])\n Traceback (most recent call last):\n ...\n IndexError: list assignment index out of range\n >>> find_min([-1, -5, -10, -3])\n Traceback (most recent call last):\n ...\n IndexError: list assignment index out of range\n \"\"\"\n n = len(numbers)\n s = sum(numbers)\n\n dp = [[False for x in range(s + 1)] for y in range(n + 1)]\n\n for i in range(n + 1):\n dp[i][0] = True\n\n for i in range(1, s + 1):\n dp[0][i] = False\n\n for i in range(1, n + 1):\n for j in range(1, s + 1):\n dp[i][j] = dp[i - 1][j]\n\n if numbers[i - 1] <= j:\n dp[i][j] = dp[i][j] and dp[i - 1][j - numbers[i - 1]]\n\n for j in range(int(s / 2), -1, -1):\n if dp[n][j] is True:\n diff = s - 2 * j\n break\n\n return diff\n"}, "sha256": "0eb957f335b22224dee5b6b6d7b35d0496b4448a31eaf125f77267bdf733cb1f"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "find_min:0", "got": "15\n", "source": "find_min([1, 2, 3, 4, 5])\n", "truncated": false, "want": "1\n"}, {"example_id": "find_min:1", "got": "25\n", "source": "find_min([5, 5, 5, 5, 5])\n", "truncated": false, "want": "5\n"}, {"example_id": "find_min:2", "got": "20\n", "source": "find_min([5, 5, 5, 5])\n", "truncated": false, "want": "0\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "boolean_condition", "seed": 7, "span": {"col_offset": 36, "end_byte": 1327, "lineno": 58, "node": "BoolOp", "node_col_offset": 27, "node_end_col_offset": 68, "node_end_lineno": 58, "node_lineno": 58, "op_index": 0, "original_text": "or", "replacement_text": "and", "start_byte": 1325}}, "public_tests": {"examples": [{"example_id": "find_min:0", "source": "find_min([1, 2, 3, 4, 5])\n", "want": "1\n"}, {"example_id": "find_min:1", "source": "find_min([5, 5, 5, 5, 5])\n", "want": "5\n"}, {"example_id": "find_min:2", "source": "find_min([5, 5, 5, 5])\n", "want": "0\n"}, {"example_id": "find_min:3", "source": "find_min([3])\n", "want": "3\n"}, {"example_id": "find_min:4", "source": "find_min([])\n", "want": "0\n"}, {"example_id": "find_min:5", "source": "find_min([1, 2, 3, 4])\n", "want": "0\n"}, {"example_id": "find_min:6", "source": "find_min([0, 0, 0, 0])\n", "want": "0\n"}, {"example_id": "find_min:7", "source": "find_min([-1, -5, 5, 1])\n", "want": "0\n"}, {"example_id": "find_min:8", "source": "find_min([-1, -5, 5, 1])\n", "want": "0\n"}, {"example_id": "find_min:9", "source": "find_min([9, 9, 9, 9, 9])\n", "want": "9\n"}, {"example_id": "find_min:10", "source": "find_min([1, 5, 10, 3])\n", "want": "1\n"}, {"example_id": "find_min:11", "source": "find_min([-1, 0, 1])\n", "want": "0\n"}, {"example_id": "find_min:12", "source": "find_min(range(10, 0, -1))\n", "want": "1\n"}, {"example_id": "find_min:13", "source": "find_min([-1])\n", "want": "Traceback (most recent call last):\n --\nIndexError: list assignment index out of range\n"}, {"example_id": "find_min:14", "source": "find_min([0, 0, 0, 1, 2, -4])\n", "want": "Traceback (most recent call last):\n ...\nIndexError: list assignment index out of range\n"}, {"example_id": "find_min:15", "source": "find_min([-1, -5, -10, -3])\n", "want": "Traceback (most recent call last):\n ...\nIndexError: list assignment index out of range\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-5de881081728a8d3", "tree_sha256": "33c3331da0d75349ae912b4635be2f1023f8b2c67b9fd0415067b2755d848883", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:dynamic_programming/minimum_partition.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def trapped_rainwater(heights: tuple[int, ...]) -> int:\n \"\"\"\n The trapped_rainwater function calculates the total amount of rainwater that can be\n trapped given an array of bar heights.\n It uses a dynamic programming approach, determining the maximum height of bars on\n both sides for each bar, and then computing the trapped water above each bar.\n The function returns the total trapped water.\n\n >>> trapped_rainwater((0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1))\n 6\n >>> trapped_rainwater((7, 1, 5, 3, 6, 4))\n 9\n >>> trapped_rainwater((7, 1, 5, 3, 6, -1))\n Traceback (most recent call last):\n ...\n ValueError: No height can be negative\n \"\"\"\n if not heights:\n return 0\n if any(h < 0 for h in heights):\n raise ValueError(\"No height can be negative\")\n length = len(heights)\n\n left_max = [0] * length\n left_max[0] = heights[0]\n for i, height in enumerate(heights[1:], start=1):\n left_max[i] = max(height, left_max[i - 1])\n\n right_max = [0] * length\n right_max[-1] = heights[-1]\n for i in range(length - 2, -1, -1):\n right_max[i] = max(heights[i], right_max[i + 1])\n\n return sum(\n min(left, right) - height\n for left, right, height in zip(left_max, right_max, heights)\n )\n"}, "sha256": "d31f1ae8117f2b87405c77ae70313c99f2421b228f615bb03e744a7eb1be7d57"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "d31f1ae8117f2b87405c77ae70313c99f2421b228f615bb03e744a7eb1be7d57", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "6c7ee81fc8e36eb05a995e32e11f63a6cebd760686573d176f8178b6632433e3", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00342"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00342", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 13, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def trapped_rainwater(heights: tuple[int, ...]) -> int:\n \"\"\"\n The trapped_rainwater function calculates the total amount of rainwater that can be\n trapped given an array of bar heights.\n It uses a dynamic programming approach, determining the maximum height of bars on\n both sides for each bar, and then computing the trapped water above each bar.\n The function returns the total trapped water.\n\n >>> trapped_rainwater((0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1))\n 6\n >>> trapped_rainwater((7, 1, 5, 3, 6, 4))\n 9\n >>> trapped_rainwater((7, 1, 5, 3, 6, -1))\n Traceback (most recent call last):\n ...\n ValueError: No height can be negative\n \"\"\"\n if not heights:\n return 0\n if any(h <= 0 for h in heights):\n raise ValueError(\"No height can be negative\")\n length = len(heights)\n\n left_max = [0] * length\n left_max[0] = heights[0]\n for i, height in enumerate(heights[1:], start=1):\n left_max[i] = max(height, left_max[i - 1])\n\n right_max = [0] * length\n right_max[-1] = heights[-1]\n for i in range(length - 2, -1, -1):\n right_max[i] = max(heights[i], right_max[i + 1])\n\n return sum(\n min(left, right) - height\n for left, right, height in zip(left_max, right_max, heights)\n )\n"}, "sha256": "d496b82bbe80f4f3a9d98f733f5daf1e94a71be0aac5e93a3fc171d672a89b10"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "trapped_rainwater:0", "got": "ValueError: No height can be negative", "source": "trapped_rainwater((0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1))\n", "truncated": false, "want": "6\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "comparison_boundary", "seed": 7, "span": {"col_offset": 13, "end_byte": 735, "lineno": 20, "node": "Compare", "node_col_offset": 11, "node_end_col_offset": 16, "node_end_lineno": 20, "node_lineno": 20, "op_index": 0, "original_text": "<", "replacement_text": "<=", "start_byte": 734}}, "public_tests": {"examples": [{"example_id": "trapped_rainwater:0", "source": "trapped_rainwater((0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1))\n", "want": "6\n"}, {"example_id": "trapped_rainwater:1", "source": "trapped_rainwater((7, 1, 5, 3, 6, 4))\n", "want": "9\n"}, {"example_id": "trapped_rainwater:2", "source": "trapped_rainwater((7, 1, 5, 3, 6, -1))\n", "want": "Traceback (most recent call last):\n ...\nValueError: No height can be negative\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-bc6f04b4da7291de", "tree_sha256": "d31f1ae8117f2b87405c77ae70313c99f2421b228f615bb03e744a7eb1be7d57", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:dynamic_programming/trapped_water.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def capitalize(sentence: str) -> str:\n \"\"\"\n Capitalizes the first letter of a sentence or word.\n\n >>> capitalize(\"hello world\")\n 'Hello world'\n >>> capitalize(\"123 hello world\")\n '123 hello world'\n >>> capitalize(\" hello world\")\n ' hello world'\n >>> capitalize(\"a\")\n 'A'\n >>> capitalize(\"\")\n ''\n \"\"\"\n if not sentence:\n return \"\"\n\n # Capitalize the first character if it's a lowercase letter\n # Concatenate the capitalized character with the rest of the string\n return sentence[0].upper() + sentence[1:]\n"}, "sha256": "dfb679e2ca3c895ef1d3ad5a2977871944f1a3b9d5e9665a9f4bebe5c7409908"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "dfb679e2ca3c895ef1d3ad5a2977871944f1a3b9d5e9665a9f4bebe5c7409908", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "10eff8391f167e0a70da72eafd5fc2f7c2c5e33872375b1971b6358ed217cf80", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00360"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00360", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 19, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def capitalize(sentence: str) -> str:\n \"\"\"\n Capitalizes the first letter of a sentence or word.\n\n >>> capitalize(\"hello world\")\n 'Hello world'\n >>> capitalize(\"123 hello world\")\n '123 hello world'\n >>> capitalize(\" hello world\")\n ' hello world'\n >>> capitalize(\"a\")\n 'A'\n >>> capitalize(\"\")\n ''\n \"\"\"\n if not sentence:\n return \"\"\n\n # Capitalize the first character if it's a lowercase letter\n # Concatenate the capitalized character with the rest of the string\n return sentence[0].upper() + sentence[0:]\n"}, "sha256": "3eb6f4572d228b57c936e6ba119031e930547e1fd0e1f242c8ea748c44dd6605"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "capitalize:0", "got": "'Hhello world'\n", "source": "capitalize(\"hello world\")\n", "truncated": false, "want": "'Hello world'\n"}, {"example_id": "capitalize:1", "got": "'1123 hello world'\n", "source": "capitalize(\"123 hello world\")\n", "truncated": false, "want": "'123 hello world'\n"}, {"example_id": "capitalize:2", "got": "' hello world'\n", "source": "capitalize(\" hello world\")\n", "truncated": false, "want": "' hello world'\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "off_by_one", "seed": 7, "span": {"col_offset": 42, "end_byte": 558, "lineno": 21, "node": "Constant", "node_col_offset": 42, "node_end_col_offset": 43, "node_end_lineno": 21, "node_lineno": 21, "op_index": 0, "original_text": "1", "replacement_text": "0", "start_byte": 557}}, "public_tests": {"examples": [{"example_id": "capitalize:0", "source": "capitalize(\"hello world\")\n", "want": "'Hello world'\n"}, {"example_id": "capitalize:1", "source": "capitalize(\"123 hello world\")\n", "want": "'123 hello world'\n"}, {"example_id": "capitalize:2", "source": "capitalize(\" hello world\")\n", "want": "' hello world'\n"}, {"example_id": "capitalize:3", "source": "capitalize(\"a\")\n", "want": "'A'\n"}, {"example_id": "capitalize:4", "source": "capitalize(\"\")\n", "want": "''\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-0f154a82c5a57144", "tree_sha256": "dfb679e2ca3c895ef1d3ad5a2977871944f1a3b9d5e9665a9f4bebe5c7409908", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:strings/capitalize.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def abbr(a: str, b: str) -> bool:\n \"\"\"\n >>> abbr(\"daBcd\", \"ABC\")\n True\n >>> abbr(\"dBcd\", \"ABC\")\n False\n \"\"\"\n n = len(a)\n m = len(b)\n dp = [[False for _ in range(m + 1)] for _ in range(n + 1)]\n dp[0][0] = True\n for i in range(n):\n for j in range(m + 1):\n if dp[i][j]:\n if j < m and a[i].upper() == b[j]:\n dp[i + 1][j + 1] = True\n if a[i].islower():\n dp[i + 1][j] = True\n return dp[n][m]\n"}, "sha256": "cd136025e5ea57571936488aba726152741ac63fb7330ecdde85e6a628cfdde8"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "cd136025e5ea57571936488aba726152741ac63fb7330ecdde85e6a628cfdde8", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "2a9b40cbfd5e3e9419e16e99cc01802dca19a6f47b4df5d436c4e76c91ec780c", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00368"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00368", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 18, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def abbr(a: str, b: str) -> bool:\n \"\"\"\n >>> abbr(\"daBcd\", \"ABC\")\n True\n >>> abbr(\"dBcd\", \"ABC\")\n False\n \"\"\"\n n = len(a)\n m = len(b)\n dp = [[False for _ in range(m + 1)] for _ in range(n + 1)]\n dp[0][0] = True\n for i in range(n):\n for j in range(m - 1):\n if dp[i][j]:\n if j < m and a[i].upper() == b[j]:\n dp[i + 1][j + 1] = True\n if a[i].islower():\n dp[i + 1][j] = True\n return dp[n][m]\n"}, "sha256": "b966d03fa7fdc77c1946dac84d9ad47f63ef3d36f786e0d1d2b47af8678bbf25"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "abbr:0", "got": "False\n", "source": "abbr(\"daBcd\", \"ABC\")\n", "truncated": false, "want": "True\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "arithmetic_operator", "seed": 7, "span": {"col_offset": 25, "end_byte": 288, "lineno": 13, "node": "BinOp", "node_col_offset": 23, "node_end_col_offset": 28, "node_end_lineno": 13, "node_lineno": 13, "op_index": 0, "original_text": "+", "replacement_text": "-", "start_byte": 287}}, "public_tests": {"examples": [{"example_id": "abbr:0", "source": "abbr(\"daBcd\", \"ABC\")\n", "want": "True\n"}, {"example_id": "abbr:1", "source": "abbr(\"dBcd\", \"ABC\")\n", "want": "False\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-23c1180811834dc3", "tree_sha256": "cd136025e5ea57571936488aba726152741ac63fb7330ecdde85e6a628cfdde8", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:dynamic_programming/abbreviation.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
| {"candidate_prediction": {"claimed_outcome": "repaired", "final_patch": {"files": {"program.py": "def find_min(numbers: list[int]) -> int:\n \"\"\"\n >>> find_min([1, 2, 3, 4, 5])\n 1\n >>> find_min([5, 5, 5, 5, 5])\n 5\n >>> find_min([5, 5, 5, 5])\n 0\n >>> find_min([3])\n 3\n >>> find_min([])\n 0\n >>> find_min([1, 2, 3, 4])\n 0\n >>> find_min([0, 0, 0, 0])\n 0\n >>> find_min([-1, -5, 5, 1])\n 0\n >>> find_min([-1, -5, 5, 1])\n 0\n >>> find_min([9, 9, 9, 9, 9])\n 9\n >>> find_min([1, 5, 10, 3])\n 1\n >>> find_min([-1, 0, 1])\n 0\n >>> find_min(range(10, 0, -1))\n 1\n >>> find_min([-1])\n Traceback (most recent call last):\n --\n IndexError: list assignment index out of range\n >>> find_min([0, 0, 0, 1, 2, -4])\n Traceback (most recent call last):\n ...\n IndexError: list assignment index out of range\n >>> find_min([-1, -5, -10, -3])\n Traceback (most recent call last):\n ...\n IndexError: list assignment index out of range\n \"\"\"\n n = len(numbers)\n s = sum(numbers)\n\n dp = [[False for x in range(s + 1)] for y in range(n + 1)]\n\n for i in range(n + 1):\n dp[i][0] = True\n\n for i in range(1, s + 1):\n dp[0][i] = False\n\n for i in range(1, n + 1):\n for j in range(1, s + 1):\n dp[i][j] = dp[i - 1][j]\n\n if numbers[i - 1] <= j:\n dp[i][j] = dp[i][j] or dp[i - 1][j - numbers[i - 1]]\n\n for j in range(int(s / 2), -1, -1):\n if dp[n][j] is True:\n diff = s - 2 * j\n break\n\n return diff\n"}, "sha256": "33c3331da0d75349ae912b4635be2f1023f8b2c67b9fd0415067b2755d848883"}, "method": "inverse of the generator's own mutation (original span restored)"}, "family": "python-repair-agent-trajectory", "intervention": {"solver": {"digest": "33c3331da0d75349ae912b4635be2f1023f8b2c67b9fd0415067b2755d848883", "name": "inverse-mutation", "runtime": "programmatic", "temperature": null}, "trajectory": []}, "license": "Apache-2.0", "provenance": {"actors": {"oracle_certifier": {"kind": "programmatic", "name": "python-doctest-reference-harness", "role": "oracle_certifier", "version": "1.0.0"}, "solver": {"kind": "programmatic", "name": "inverse-mutation", "role": "solver", "version": "2.0.0"}, "task_author": {"kind": "programmatic", "name": "python-repair-mutator", "role": "task_author", "version": "2.0.0"}}, "license": "Apache-2.0", "lineage": {"command": "python3 pipelines/code_repair_cli.py generate --catalog catalogs/python-repair-v1 --seed 7 --count 400 --out <run> --produced-at 2026-10-15T00:00:00Z", "commit_sha": "5e3b0488dd5671eceb47e3af9651e61d5a76373d", "gate": "code_repair REPLAY_PASSED", "lane": "code_repair", "project_training_policy": null, "record_sha256": "cc36b10adac2c21a874df56dd1f175299e7af0c154173b59d51576f8bc69a076", "replay_command": "python3 pipelines/code_repair_cli.py replay --run <run> --catalog catalogs/python-repair-v1 --out <replay>", "repo": "rmems/synthetic-factory", "source_record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00390"}, "produced_at": "2026-10-15T00:00:00Z"}, "record_id": "pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00390", "result": {"claims": {"claimed_outcome_matches_rerun": true, "observations_match_replay": true}, "execution_verification": "REPLAY_PASSED", "oracle": {"name": "python-doctest-reference-harness", "type": "measured_execution", "version": "1.0.0"}, "rerun": {"harness_sha256": "ea8da47dd3defc85bca778c3839eb1689fe114986c527d5be96def45ed81a743", "hidden_cases": 24, "mutant": false, "original": true, "patched": true, "tests_untouched": true, "timeout_s": 2.0}, "verdict": "REPAIRED_VERIFIED"}, "scenario": {"broken_program": {"files": {"program.py": "def find_min(numbers: list[int]) -> int:\n \"\"\"\n >>> find_min([1, 2, 3, 4, 5])\n 1\n >>> find_min([5, 5, 5, 5, 5])\n 5\n >>> find_min([5, 5, 5, 5])\n 0\n >>> find_min([3])\n 3\n >>> find_min([])\n 0\n >>> find_min([1, 2, 3, 4])\n 0\n >>> find_min([0, 0, 0, 0])\n 0\n >>> find_min([-1, -5, 5, 1])\n 0\n >>> find_min([-1, -5, 5, 1])\n 0\n >>> find_min([9, 9, 9, 9, 9])\n 9\n >>> find_min([1, 5, 10, 3])\n 1\n >>> find_min([-1, 0, 1])\n 0\n >>> find_min(range(10, 0, -1))\n 1\n >>> find_min([-1])\n Traceback (most recent call last):\n --\n IndexError: list assignment index out of range\n >>> find_min([0, 0, 0, 1, 2, -4])\n Traceback (most recent call last):\n ...\n IndexError: list assignment index out of range\n >>> find_min([-1, -5, -10, -3])\n Traceback (most recent call last):\n ...\n IndexError: list assignment index out of range\n \"\"\"\n n = len(numbers)\n s = sum(numbers)\n\n dp = [[False for x in range(s + 1)] for y in range(n + 1)]\n\n for i in range(n + 1):\n dp[i][0] = True\n\n for i in range(1, s + 1):\n dp[0][i] = False\n\n for i in range(1, n - 1):\n for j in range(1, s + 1):\n dp[i][j] = dp[i - 1][j]\n\n if numbers[i - 1] <= j:\n dp[i][j] = dp[i][j] or dp[i - 1][j - numbers[i - 1]]\n\n for j in range(int(s / 2), -1, -1):\n if dp[n][j] is True:\n diff = s - 2 * j\n break\n\n return diff\n"}, "sha256": "ab36257520825c02a5493676cc9ecd01c2039d9aad95ab108a4a383ba5091ca4"}, "failing_test": {"cmd": "pipelines/code_repair/_harness.py:main", "excerpt": [{"example_id": "find_min:0", "got": "15\n", "source": "find_min([1, 2, 3, 4, 5])\n", "truncated": false, "want": "1\n"}, {"example_id": "find_min:1", "got": "25\n", "source": "find_min([5, 5, 5, 5, 5])\n", "truncated": false, "want": "5\n"}, {"example_id": "find_min:2", "got": "20\n", "source": "find_min([5, 5, 5, 5])\n", "truncated": false, "want": "0\n"}], "exit_code": null, "stdout_sha256": null}, "injection": {"kind": "ast_mutation", "operator": "arithmetic_operator", "seed": 7, "span": {"col_offset": 24, "end_byte": 1177, "lineno": 53, "node": "BinOp", "node_col_offset": 22, "node_end_col_offset": 27, "node_end_lineno": 53, "node_lineno": 53, "op_index": 0, "original_text": "+", "replacement_text": "-", "start_byte": 1176}}, "public_tests": {"examples": [{"example_id": "find_min:0", "source": "find_min([1, 2, 3, 4, 5])\n", "want": "1\n"}, {"example_id": "find_min:1", "source": "find_min([5, 5, 5, 5, 5])\n", "want": "5\n"}, {"example_id": "find_min:2", "source": "find_min([5, 5, 5, 5])\n", "want": "0\n"}, {"example_id": "find_min:3", "source": "find_min([3])\n", "want": "3\n"}, {"example_id": "find_min:4", "source": "find_min([])\n", "want": "0\n"}, {"example_id": "find_min:5", "source": "find_min([1, 2, 3, 4])\n", "want": "0\n"}, {"example_id": "find_min:6", "source": "find_min([0, 0, 0, 0])\n", "want": "0\n"}, {"example_id": "find_min:7", "source": "find_min([-1, -5, 5, 1])\n", "want": "0\n"}, {"example_id": "find_min:8", "source": "find_min([-1, -5, 5, 1])\n", "want": "0\n"}, {"example_id": "find_min:9", "source": "find_min([9, 9, 9, 9, 9])\n", "want": "9\n"}, {"example_id": "find_min:10", "source": "find_min([1, 5, 10, 3])\n", "want": "1\n"}, {"example_id": "find_min:11", "source": "find_min([-1, 0, 1])\n", "want": "0\n"}, {"example_id": "find_min:12", "source": "find_min(range(10, 0, -1))\n", "want": "1\n"}, {"example_id": "find_min:13", "source": "find_min([-1])\n", "want": "Traceback (most recent call last):\n --\nIndexError: list assignment index out of range\n"}, {"example_id": "find_min:14", "source": "find_min([0, 0, 0, 1, 2, -4])\n", "want": "Traceback (most recent call last):\n ...\nIndexError: list assignment index out of range\n"}, {"example_id": "find_min:15", "source": "find_min([-1, -5, -10, -3])\n", "want": "Traceback (most recent call last):\n ...\nIndexError: list assignment index out of range\n"}], "kind": "doctest"}, "repo_snapshot": {"catalog": "python-repair-v1", "license": "MIT", "license_sha256": null, "program_id": "tap-5de881081728a8d3", "tree_sha256": "33c3331da0d75349ae912b4635be2f1023f8b2c67b9fd0415067b2755d848883", "upstream": "TheAlgorithms/Python@2067ce6dfb3b0426a88c7a40531e355a5c703cff:dynamic_programming/minimum_partition.py"}, "task": "You are given a Python module containing one function whose docstring examples are its specification. The function has a bug: at least one docstring example fails under doctest. Return the corrected module."}, "split": "validation"} |
|
|
