candidate_prediction dict | family stringclasses 1
value | intervention dict | license stringclasses 1
value | provenance dict | record_id stringlengths 76 76 | result dict | scenario dict | split stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "from __future__ import annotations\n\n\ndef unique_prime_factors(n: int) -> list[int]:\n \"\"\"\n Returns unique prime factors of n as a list.\n\n >>> unique_prime_factors(0)\n []\n >>> unique_prime_factors(100)\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "b5fdaeea227d14de76a346cf26b797996de459fe1737db9200a4f042cb65d72a",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00001 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "from __future__ import annotations\n\n\ndef unique_prime_factors(n: int) -> list[int]:\n \"\"\"\n Returns unique prime factors of n as a list.\n\n >>> unique_prime_factors(0)\n []\n >>> unique_prime_factors(100)\n [2, 5]\n >>> unique_prime... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def hamming_distance(string1: str, string2: str) -> int:\n \"\"\"Calculate the Hamming distance between two equal length strings\n In information theory, the Hamming distance between two strings of equal\n length is the n... | python-repair-agent-trajectory | {
"solver": {
"digest": "f46df4c5270fd0c51e21a534123df98303618f284d5d461f4f7b3aad5fff2401",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00003 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def hamming_distance(string1: str, string2: str) -> int:\n \"\"\"Calculate the Hamming distance between two equal length strings\n In information theory, the Hamming distance between two strings of equal\n length is the number of positions at which th... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "import re\n\n\ndef dna(dna: str) -> str:\n \"\"\"\n https://en.wikipedia.org/wiki/DNA\n Returns the second side of a DNA strand\n\n >>> dna(\"GCTA\")\n 'CGAT'\n >>> dna(\"ATGC\")\n 'TACG'\n >>> dna(\"CTGA\"... | python-repair-agent-trajectory | {
"solver": {
"digest": "f61c530f7904ba7102b315be9c2ff2385ea4c9ccfe78f9bb08d939fabebdc7c5",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00007 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "import re\n\n\ndef dna(dna: str) -> str:\n \"\"\"\n https://en.wikipedia.org/wiki/DNA\n Returns the second side of a DNA strand\n\n >>> dna(\"GCTA\")\n 'CGAT'\n >>> dna(\"ATGC\")\n 'TACG'\n >>> dna(\"CTGA\")\n 'GACT'\n >>> dna(\"G... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def circle_sort(collection: list) -> list:\n \"\"\"A pure Python implementation of circle sort algorithm\n\n :param collection: a mutable collection of comparable items in any order\n :return: the same collection in ascen... | python-repair-agent-trajectory | {
"solver": {
"digest": "0906cfd86b12cf67d94b722d3ce5a982b68fc829f06333fad2a308a0726722a8",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00008 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def circle_sort(collection: list) -> list:\n \"\"\"A pure Python implementation of circle sort algorithm\n\n :param collection: a mutable collection of comparable items in any order\n :return: the same collection in ascending order\n\n Examples:\n ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def f(x):\n \"\"\"\n This is the function to integrate, f(x) = (x - 0)^2 = x^2.\n\n :param x: The input value\n :return: The value of f(x)\n\n >>> f(0)\n 0\n >>> f(1)\n 1\n >>> f(0.5)\n 0.25\n \"\"... | python-repair-agent-trajectory | {
"solver": {
"digest": "ff21c134e72e49a6e18a9a3d03ff125473491699a7adb3099beb83a61141d30f",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00009 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def f(x):\n \"\"\"\n This is the function to integrate, f(x) = (x - 0)^2 = x^2.\n\n :param x: The input value\n :return: The value of f(x)\n\n >>> f(0)\n 0\n >>> f(1)\n 1\n >>> f(0.5)\n 0.25\n \"\"\"\n return x**2 + 1\n"
... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def dp_match(text: str, pattern: str) -> bool:\n r\"\"\"\n Dynamic programming matching algorithm.\n\n | Time complexity: O(\\|text\\| * \\|pattern\\|)\n | Space complexity: O(\\|text\\| * \\|pattern\\|)\n\n :param ... | python-repair-agent-trajectory | {
"solver": {
"digest": "4c67111780bb70660d8a61404df8f3683ac6c79e280bc802dfdc701ac85e3a5a",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00010 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def dp_match(text: str, pattern: str) -> bool:\n r\"\"\"\n Dynamic programming matching algorithm.\n\n | Time complexity: O(\\|text\\| * \\|pattern\\|)\n | Space complexity: O(\\|text\\| * \\|pattern\\|)\n\n :param text: Text to match.\n :par... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def signum(num: float) -> int:\n \"\"\"\n Applies signum function on the number\n\n Custom test cases:\n >>> signum(-10)\n -1\n >>> signum(10)\n 1\n >>> signum(0)\n 0\n >>> signum(-20.5)\n -1\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "b4915a1473356c9c2028027fd53f7e7755543e227fdcc9c44fae4d8a29c19e39",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00011 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def signum(num: float) -> int:\n \"\"\"\n Applies signum function on the number\n\n Custom test cases:\n >>> signum(-10)\n -1\n >>> signum(10)\n 1\n >>> signum(0)\n 0\n >>> signum(-20.5)\n -1\n >>> signum(20.5)\n 1\n >... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def get_bit(number: int, position: int) -> int:\n \"\"\"\n Get the bit at the given position\n\n Details: perform bitwise and for the given number and X,\n Where X is a number with all the bits - zeroes and bit on give... | python-repair-agent-trajectory | {
"solver": {
"digest": "23f79c67759708919c3b5e7ba83406df0b382fe86cdd48f0cbedbbc8c92afd96",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00013 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def get_bit(number: int, position: int) -> int:\n \"\"\"\n Get the bit at the given position\n\n Details: perform bitwise and for the given number and X,\n Where X is a number with all the bits - zeroes and bit on given position - one.\n If the ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "from __future__ import annotations\n\n\ndef two_sum(nums: list[int], target: int) -> list[int]:\n \"\"\"\n >>> two_sum([2, 7, 11, 15], 9)\n [0, 1]\n >>> two_sum([15, 2, 11, 7], 13)\n [1, 2]\n >>> two_sum([2, 7, 1... | python-repair-agent-trajectory | {
"solver": {
"digest": "8f5f7af6798330f6b079091f3996cd5fd7cb421b6afb6d8789bc5d1dcc79e172",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00014 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "from __future__ import annotations\n\n\ndef two_sum(nums: list[int], target: int) -> list[int]:\n \"\"\"\n >>> two_sum([2, 7, 11, 15], 9)\n [0, 1]\n >>> two_sum([15, 2, 11, 7], 13)\n [1, 2]\n >>> two_sum([2, 7, 11, 15], 17)\n [0, 3]\n >... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def merge(arr: list[int]) -> list[int]:\n \"\"\"Return a sorted array.\n >>> merge([10,9,8,7,6,5,4,3,2,1])\n [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]\n >>> merge([1,2,3,4,5,6,7,8,9,10])\n [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "b262d138e0740ab6aa614845d394aa7f9395b13710e5bb769e2f4637dc4ef379",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00017 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def merge(arr: list[int]) -> list[int]:\n \"\"\"Return a sorted array.\n >>> merge([10,9,8,7,6,5,4,3,2,1])\n [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]\n >>> merge([1,2,3,4,5,6,7,8,9,10])\n [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]\n >>> merge([10,22,1,2,3,9,15,2... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def ipv4_to_decimal(ipv4_address: str) -> int:\n \"\"\"\n Convert an IPv4 address to its decimal representation.\n\n Args:\n ip_address: A string representing an IPv4 address (e.g., \"192.168.0.1\").\n\n Returns... | python-repair-agent-trajectory | {
"solver": {
"digest": "c5addf0c8bc971441899883d29d1096f60bbcd009fc78f57ea71f085e4379b20",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00018 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def ipv4_to_decimal(ipv4_address: str) -> int:\n \"\"\"\n Convert an IPv4 address to its decimal representation.\n\n Args:\n ip_address: A string representing an IPv4 address (e.g., \"192.168.0.1\").\n\n Returns:\n int: The decimal re... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def reverse_letters(sentence: str, length: int = 0) -> str:\n \"\"\"\n Reverse all words that are longer than the given length of characters in a sentence.\n If ``length`` is not specified, it defaults to 0.\n\n >>> re... | python-repair-agent-trajectory | {
"solver": {
"digest": "766ae8d89806838d4677faab4b4a239b52fc9a949d9fcfe54cb37e18e0b9518d",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00019 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def reverse_letters(sentence: str, length: int = 0) -> str:\n \"\"\"\n Reverse all words that are longer than the given length of characters in a sentence.\n If ``length`` is not specified, it defaults to 0.\n\n >>> reverse_letters(\"Hey wollef sro... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def modular_exponential(base: int, power: int, mod: int):\n \"\"\"\n >>> modular_exponential(5, 0, 10)\n 1\n >>> modular_exponential(2, 8, 7)\n 4\n >>> modular_exponential(3, -2, 9)\n -1\n \"\"\"\n\n if ... | python-repair-agent-trajectory | {
"solver": {
"digest": "c0018cd6453aff85d0e9f920af438ec0c72a4465be88aba87597f82bac83b5c6",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00020 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def modular_exponential(base: int, power: int, mod: int):\n \"\"\"\n >>> modular_exponential(5, 0, 10)\n 1\n >>> modular_exponential(2, 8, 7)\n 4\n >>> modular_exponential(3, -2, 9)\n -1\n \"\"\"\n\n if power < 0:\n return -1\... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "from math import factorial, radians\n\n\ndef sin(\n angle_in_degrees: float, accuracy: int = 18, rounded_values_count: int = 10\n) -> float:\n \"\"\"\n Implement sin function.\n\n >>> sin(0.0)\n 0.0\n >>> sin(90.... | python-repair-agent-trajectory | {
"solver": {
"digest": "e1a60c9ec00ae8da4aba2fc2dd58d1796db5c121c8d740f53beabfa821a1c7fd",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00021 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "from math import factorial, radians\n\n\ndef sin(\n angle_in_degrees: float, accuracy: int = 18, rounded_values_count: int = 10\n) -> float:\n \"\"\"\n Implement sin function.\n\n >>> sin(0.0)\n 0.0\n >>> sin(90.0)\n 1.0\n >>> sin(180.0... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def remove_digit(num: int) -> int:\n \"\"\"\n\n returns the biggest possible result\n that can be achieved by removing\n one digit from the given number\n\n >>> remove_digit(152)\n 52\n >>> remove_digit(6385)\... | python-repair-agent-trajectory | {
"solver": {
"digest": "61ca37f97e3dade0dd2bbf751faabf0e683e7b9d12a11d77371657bab171ef67",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00022 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def remove_digit(num: int) -> int:\n \"\"\"\n\n returns the biggest possible result\n that can be achieved by removing\n one digit from the given number\n\n >>> remove_digit(152)\n 52\n >>> remove_digit(6385)\n 685\n >>> remove_digit... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "import re\n\n\ndef indian_phone_validator(phone: str) -> bool:\n \"\"\"\n Determine whether the string is a valid phone number or not\n :param phone:\n :return: Boolean\n >>> indian_phone_validator(\"+91123456789\")... | python-repair-agent-trajectory | {
"solver": {
"digest": "5f5871fd39f9468f352fc5f003985517b20ecf99e646279baa6ee1f231a1bdcf",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00023 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "import re\n\n\ndef indian_phone_validator(phone: str) -> bool:\n \"\"\"\n Determine whether the string is a valid phone number or not\n :param phone:\n :return: Boolean\n >>> indian_phone_validator(\"+91123456789\")\n False\n >>> indian_ph... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def get_1s_count(number: int) -> int:\n \"\"\"\n Count the number of set bits in a 32 bit integer using Brian Kernighan's way.\n Ref - https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan\n >>> ge... | python-repair-agent-trajectory | {
"solver": {
"digest": "835a37970043464eb9a953ee9a7d481a8b11e916037312711872f871fdc5a3e4",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00027 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def get_1s_count(number: int) -> int:\n \"\"\"\n Count the number of set bits in a 32 bit integer using Brian Kernighan's way.\n Ref - https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan\n >>> get_1s_count(25)\n 3\n >>>... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def naive_pattern_search(s: str, pattern: str) -> list:\n \"\"\"\n >>> naive_pattern_search(\"ABAAABCDBBABCDDEBCABC\", \"ABC\")\n [4, 10, 18]\n >>> naive_pattern_search(\"ABC\", \"ABAAABCDBBABCDDEBCABC\")\n []\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "6f912b6763d0741f5ee479f755c1853fb7b01b1f6a731ed0003f9c55f6c04d71",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00028 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def naive_pattern_search(s: str, pattern: str) -> list:\n \"\"\"\n >>> naive_pattern_search(\"ABAAABCDBBABCDDEBCABC\", \"ABC\")\n [4, 10, 18]\n >>> naive_pattern_search(\"ABC\", \"ABAAABCDBBABCDDEBCABC\")\n []\n >>> naive_pattern_search(\"\",... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def shell_sort(collection: list) -> list:\n \"\"\"Implementation of shell sort algorithm in Python\n :param collection: Some mutable ordered collection with heterogeneous\n comparable items inside\n :return: the same... | python-repair-agent-trajectory | {
"solver": {
"digest": "fc8d61fdac7e6edb10daa825c5144ffb0f1572d13985bfe21df050a6c9067cab",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00029 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def shell_sort(collection: list) -> list:\n \"\"\"Implementation of shell sort algorithm in Python\n :param collection: Some mutable ordered collection with heterogeneous\n comparable items inside\n :return: the same collection ordered by ascendi... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "from __future__ import annotations\n\n\ndef maximum_non_adjacent_sum(nums: list[int]) -> int:\n \"\"\"\n Find the maximum non-adjacent sum of the integers in the nums input list\n\n >>> maximum_non_adjacent_sum([1, 2, 3])... | python-repair-agent-trajectory | {
"solver": {
"digest": "dc59aad3f504e26529c6a1d813ab10ff5c3b0a0b9fb77e77ca08c3ef759be8aa",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00030 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "from __future__ import annotations\n\n\ndef maximum_non_adjacent_sum(nums: list[int]) -> int:\n \"\"\"\n Find the maximum non-adjacent sum of the integers in the nums input list\n\n >>> maximum_non_adjacent_sum([1, 2, 3])\n 4\n >>> maximum_non_a... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def alternative_string_arrange(first_str: str, second_str: str) -> str:\n \"\"\"\n Return the alternative arrangements of the two strings.\n :param first_str:\n :param second_str:\n :return: String\n >>> alternat... | python-repair-agent-trajectory | {
"solver": {
"digest": "8dbd3b1339695ab198671326040e2b43278c1548bf65179a0e06abc167d6b2db",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00031 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def alternative_string_arrange(first_str: str, second_str: str) -> str:\n \"\"\"\n Return the alternative arrangements of the two strings.\n :param first_str:\n :param second_str:\n :return: String\n >>> alternative_string_arrange(\"ABCD\", \... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def clear_bit(number: int, position: int) -> int:\n \"\"\"\n Set the bit at position to 0.\n\n Details: perform bitwise and for given number and X.\n Where X is a number with all the bits - ones and bit on given\n p... | python-repair-agent-trajectory | {
"solver": {
"digest": "6abe2bfd2226ae3edd14eb5d751633a94196611090d498bd926cbc06301f0084",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00032 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def clear_bit(number: int, position: int) -> int:\n \"\"\"\n Set the bit at position to 0.\n\n Details: perform bitwise and for given number and X.\n Where X is a number with all the bits - ones and bit on given\n position - zero.\n\n >>> cle... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def abs_max_sort(x: list[int]) -> int:\n \"\"\"\n >>> abs_max_sort([0,5,1,11])\n 11\n >>> abs_max_sort([3,-10,-2])\n -10\n >>> abs_max_sort([])\n Traceback (most recent call last):\n ...\n ValueError... | python-repair-agent-trajectory | {
"solver": {
"digest": "3d86db9a2ccfeaa48ecd29926e8d36c396b5741483a233da5ae06ea11b791fe2",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00033 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def abs_max_sort(x: list[int]) -> int:\n \"\"\"\n >>> abs_max_sort([0,5,1,11])\n 11\n >>> abs_max_sort([3,-10,-2])\n -10\n >>> abs_max_sort([])\n Traceback (most recent call last):\n ...\n ValueError: abs_max_sort() arg is an emp... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def find_minimum_partitions(string: str) -> int:\n \"\"\"\n Returns the minimum cuts needed for a palindrome partitioning of string\n\n >>> find_minimum_partitions(\"aab\")\n 1\n >>> find_minimum_partitions(\"aaa\")... | python-repair-agent-trajectory | {
"solver": {
"digest": "57255471f2ae827b3eb9d6172263db0f845941f3738361e1a8a07e18989c6103",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00034 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def find_minimum_partitions(string: str) -> int:\n \"\"\"\n Returns the minimum cuts needed for a palindrome partitioning of string\n\n >>> find_minimum_partitions(\"aab\")\n 1\n >>> find_minimum_partitions(\"aaa\")\n 0\n >>> find_minimum_... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def flip_bit(number: int, position: int) -> int:\n \"\"\"\n Flip the bit at position.\n\n Details: perform bitwise xor for given number and X.\n Where X is a number with all the bits - zeroes and bit on given\n posi... | python-repair-agent-trajectory | {
"solver": {
"digest": "e48b6a8b586ae0e460fa40788e990a9315655b4cf900cc636f60adbd202a0ccc",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00036 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def flip_bit(number: int, position: int) -> int:\n \"\"\"\n Flip the bit at position.\n\n Details: perform bitwise xor for given number and X.\n Where X is a number with all the bits - zeroes and bit on given\n position - one.\n\n >>> flip_bi... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "from math import log2\n\n\ndef binary_count_trailing_zeros(a: int) -> int:\n \"\"\"\n Take in 1 integer, return a number that is\n the number of trailing zeros in binary representation of that number.\n\n >>> binary_co... | python-repair-agent-trajectory | {
"solver": {
"digest": "63ced0d798f166667ac192c0e1cc4fb5ba91fe5f5fba53702565095a5f38b9ff",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00037 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "from math import log2\n\n\ndef binary_count_trailing_zeros(a: int) -> int:\n \"\"\"\n Take in 1 integer, return a number that is\n the number of trailing zeros in binary representation of that number.\n\n >>> binary_count_trailing_zeros(25)\n 0\... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def compute_geometric_mean(*args: int) -> float:\n \"\"\"\n Return the geometric mean of the argument numbers.\n >>> compute_geometric_mean(2,8)\n 4.0\n >>> compute_geometric_mean('a', 4)\n Traceback (most recent... | python-repair-agent-trajectory | {
"solver": {
"digest": "8ad4ac73aed238d029e62de39e06c7df1d8607ff92df59d3ace87657f486da53",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00039 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def compute_geometric_mean(*args: int) -> float:\n \"\"\"\n Return the geometric mean of the argument numbers.\n >>> compute_geometric_mean(2,8)\n 4.0\n >>> compute_geometric_mean('a', 4)\n Traceback (most recent call last):\n ...\n ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def different_signs(num1: int, num2: int) -> bool:\n \"\"\"\n Return True if numbers have opposite signs False otherwise.\n\n >>> different_signs(1, -1)\n True\n >>> different_signs(1, 1)\n False\n >>> differe... | python-repair-agent-trajectory | {
"solver": {
"digest": "4ecec6ed2e004052a1a7945f001fe0280086a6cfd7779d853d3bcc8d4b235777",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00040 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def different_signs(num1: int, num2: int) -> bool:\n \"\"\"\n Return True if numbers have opposite signs False otherwise.\n\n >>> different_signs(1, -1)\n True\n >>> different_signs(1, 1)\n False\n >>> different_signs(100000000000000000000... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def longest_palindromic_subsequence(input_string: str) -> int:\n \"\"\"\n This function returns the longest palindromic subsequence in a string\n >>> longest_palindromic_subsequence(\"bbbab\")\n 4\n >>> longest_pali... | python-repair-agent-trajectory | {
"solver": {
"digest": "d834746e5333956adb3dda1228ed1a408e53d29a913d5771fa18932616ada95b",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00042 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def longest_palindromic_subsequence(input_string: str) -> int:\n \"\"\"\n This function returns the longest palindromic subsequence in a string\n >>> longest_palindromic_subsequence(\"bbbab\")\n 4\n >>> longest_palindromic_subsequence(\"bbabcbca... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def create_ngram(sentence: str, ngram_size: int) -> list[str]:\n \"\"\"\n Create ngrams from a sentence\n\n >>> create_ngram(\"I am a sentence\", 2)\n ['I ', ' a', 'am', 'm ', ' a', 'a ', ' s', 'se', 'en', 'nt', 'te', ... | python-repair-agent-trajectory | {
"solver": {
"digest": "3881251200419c2008cd6f4ec6b1c04cafed25b764512c567432c86fe3abb1d8",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00044 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def create_ngram(sentence: str, ngram_size: int) -> list[str]:\n \"\"\"\n Create ngrams from a sentence\n\n >>> create_ngram(\"I am a sentence\", 2)\n ['I ', ' a', 'am', 'm ', ' a', 'a ', ' s', 'se', 'en', 'nt', 'te', 'en', 'nc', 'ce']\n >>> cre... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def fizz_buzz(number: int, iterations: int) -> str:\n \"\"\"\n | Plays FizzBuzz.\n | Prints Fizz if number is a multiple of ``3``.\n | Prints Buzz if its a multiple of ``5``.\n | Prints FizzBuzz if its a multiple of... | python-repair-agent-trajectory | {
"solver": {
"digest": "6eae7f855ccf9e8fb01603b186694ff1945f82c96b6e70b04cad9fdd552ac6bc",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00045 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def fizz_buzz(number: int, iterations: int) -> str:\n \"\"\"\n | Plays FizzBuzz.\n | Prints Fizz if number is a multiple of ``3``.\n | Prints Buzz if its a multiple of ``5``.\n | Prints FizzBuzz if its a multiple of both ``3`` and ``5`` or ``15`... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def factorial(number: int) -> int:\n \"\"\"\n Calculate the factorial of specified number (n!).\n\n >>> import math\n >>> all(factorial(i) == math.factorial(i) for i in range(20))\n True\n >>> factorial(0.1)\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "a82829b49c3fea28a514363892e0a2754119afc9d6b34f18a9059d51aeaa66c3",
"name": "inverse-mutation",
"runtime": "programmatic",
"temperature": null
},
"trajectory": []
} | Apache-2.0 | {
"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"
... | pfr-890a8af791f8e079cc8bb97e221f32e9afac59da36174d4fa78e7d18d8727e2d-7-00047 | {
"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": "ea8da47dd3def... | {
"broken_program": {
"files": {
"program.py": "def factorial(number: int) -> int:\n \"\"\"\n Calculate the factorial of specified number (n!).\n\n >>> import math\n >>> all(factorial(i) == math.factorial(i) for i in range(20))\n True\n >>> factorial(0.1)\n Traceback (most recent call l... | train |
Execution-Verified Repair Trajectories
Purpose
Agentic code-repair episodes (factory family python-repair-agent-trajectory): a real failing test, the agent's tool-call trajectory, the final patch, and sandbox re-run evidence. Every outcome claim is re-derived from a fresh measured run, not taken from the model's transcript.
Record schema
JSONL, one record per line. Fields:
record_id, family, scenario{task, repo_snapshot{catalog, program_id, tree_sha256, upstream, license, license_sha256}, failing_test{cmd, exit_code, stdout_sha256, excerpt}, injection{kind, operator, span, seed}}, intervention{solver{name, runtime, digest, temperature}, trajectory[{n, tool_call{name, args}, observation_ref, observation}]}, candidate_prediction{final_patch, claimed_outcome}, result{oracle{name, version, type}, rerun{original, mutant, patched, hidden_cases, tests_untouched, harness_sha256, timeout_s}, claims{claimed_outcome_matches_rerun, observations_match_replay}, verdict, execution_verification}, provenance{produced_at, actors, lineage, project_training_policy}
Illustrative example (EXAMPLE ONLY, not real data):
{
"record_id": "pfat-r01-000017",
"family": "python-repair-agent-trajectory",
"scenario": {
"task": "Make tests pass without editing tests.",
"repo_snapshot": {
"catalog": "python-repair-v1",
"program_id": "maths/gcd.py",
"upstream": "TheAlgorithms/Python@2067ce6d",
"license": "MIT"
},
"failing_test": {
"cmd": "python -m doctest -v target.py",
"exit_code": 1,
"excerpt": "Expected: 6 Got: 12"
},
"injection": {
"kind": "mutation",
"operator": "swap_operands",
"seed": 7731
}
},
"intervention": {
"solver": {
"name": "gemma4:12b",
"runtime": "ollama",
"temperature": 0.4
},
"trajectory": [
{
"n": 1,
"tool_call": {
"name": "run_tests",
"args": {}
},
"observation": "1 failed"
},
{
"n": 2,
"tool_call": {
"name": "apply_patch",
"args": {
"diff": "- return gcd(a % b, a)\n+ return gcd(b, a % b)"
}
}
},
{
"n": 3,
"tool_call": {
"name": "run_tests",
"args": {}
},
"observation": "ok (5 examples)"
},
{
"n": 4,
"tool_call": {
"name": "finish",
"args": {
"claim": "tests pass"
}
}
}
]
},
"candidate_prediction": {
"claimed_outcome": "pass"
},
"result": {
"oracle": {
"name": "python-doctest-reference-harness",
"type": "measured_execution"
},
"rerun": {
"mutant": "fail",
"patched": "pass",
"hidden_cases": "pass",
"tests_untouched": true
},
"claims": {
"claimed_outcome_matches_rerun": true
},
"verdict": "REPAIRED_VERIFIED",
"execution_verification": "verified"
},
"provenance": {
"actors": {
"solver": "gemma4:12b"
},
"project_training_policy": "allowed"
}
}
Generation
- Open-weight local models only, run via Ollama:
gemma4:12b(writer/solver),qwen3-embedding:8b(embedding dedup),FrogNano-4B(Apache-2.0). No hosted frontier models. - Produced via rmems/synthetic-factory, with provenance gates (every record names its actors, model digests, and seeds) and execution-evidence gates (claims are re-derived from measured execution, not trusted from model transcripts).
Intended use
Post-training of open-weight coding/agent models: supervised fine-tuning (SFT) on trajectories and preference tuning (DPO). Not intended for pre-training or for evaluating hosted models.
Status
243 records (train: 207, validation: 20, heldout: 16), generated deterministically by the rmems/synthetic-factory CLI at commit 5e3b048. Every record passed the factory's replay gate; each carries its lane, generate/replay commands, seed and source record id under provenance.lineage. No LLM was used. Field names follow the schema below, with extra fields where the factory emits more detail.
Limitations
- Current records come from deterministic scripted/programmatic generators (no LLM); trajectories may be narrower and simpler than real-world agent behavior.
- Task sources (e.g. public repos) are likely present in base-model pretraining; contamination checks and program-level eval splits are planned but not yet validated.
- English only. Schema may still change in later releases.
Known limitations (this release)
- No agent trajectory: the solver restores the generator's own mutation (inverse-mutation), so
intervention.trajectoryis[]. These are execution-verified repair tasks with a verified reference fix, not agent repair trajectories. failing_test.exit_code,failing_test.stdout_sha256,repo_snapshot.license_sha256,solver.temperatureandproject_training_policyare null; the factory does not emit them yet.- Built directly from
code_repair generate+replayoutputs; the factory's owncode_repair exportis still blocked on open registry/rights decisions. - Single mutation operator per record over 139 TheAlgorithms/Python programs (MIT upstream); 83 of 326 generated records were not replayable and were excluded.
- Downloads last month
- 55