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 |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def dp_count(s, n):\n \"\"\"\n >>> dp_count([1, 2, 3], 4)\n 4\n >>> dp_count([1, 2, 3], 7)\n 8\n >>> dp_count([2, 5, 3, 6], 10)\n 5\n >>> dp_count([10], 99)\n 0\n >>> dp_count([4, 5, 6], 0)\n 1\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "7ea75676cd3234bfcc2c42137d13111e5cb80fdfee7a435967fe7a8449857f6a",
"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-00051 | {
"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_count(s, n):\n \"\"\"\n >>> dp_count([1, 2, 3], 4)\n 4\n >>> dp_count([1, 2, 3], 7)\n 8\n >>> dp_count([2, 5, 3, 6], 10)\n 5\n >>> dp_count([10], 99)\n 0\n >>> dp_count([4, 5, 6], 0)\n 1\n >>> dp_count([1, 2, 3], -5)\... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def greatest_common_divisor(a: int, b: int) -> int:\n \"\"\"\n Calculate Greatest Common Divisor (GCD).\n >>> greatest_common_divisor(24, 40)\n 8\n >>> greatest_common_divisor(1, 1)\n 1\n >>> greatest_common_d... | python-repair-agent-trajectory | {
"solver": {
"digest": "c83b231cabe16db1ee264bbab4da1750cb72d603a68112a349ee3b152d638e16",
"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-00053 | {
"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 greatest_common_divisor(a: int, b: int) -> int:\n \"\"\"\n Calculate Greatest Common Divisor (GCD).\n >>> greatest_common_divisor(24, 40)\n 8\n >>> greatest_common_divisor(1, 1)\n 1\n >>> greatest_common_divisor(1, 800)\n 1\n >>>... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def linear_search(sequence: list, target: int) -> int:\n \"\"\"A pure Python implementation of a linear search algorithm\n\n :param sequence: a collection with comparable items (sorting is not required for\n linear se... | python-repair-agent-trajectory | {
"solver": {
"digest": "59b7579268bcab0ebb7aafd8c3fa78f6b1edcdf49913430e709de7a547165c25",
"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-00054 | {
"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 linear_search(sequence: list, target: int) -> int:\n \"\"\"A pure Python implementation of a linear search algorithm\n\n :param sequence: a collection with comparable items (sorting is not required for\n linear search)\n :param target: item... | 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-00056 | {
"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 longest_common_substring(text1: str, text2: str) -> str:\n \"\"\"\n Finds the longest common substring between two strings.\n\n >>> longest_common_substring(\"\", \"\")\n ''\n >>> longest_common_substring(\"a\",... | python-repair-agent-trajectory | {
"solver": {
"digest": "f6eaa2ceec5a3aaf169265eb8837401706ff6dee1fad2b89def197e13f94fcd4",
"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-00060 | {
"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_common_substring(text1: str, text2: str) -> str:\n \"\"\"\n Finds the longest common substring between two strings.\n\n >>> longest_common_substring(\"\", \"\")\n ''\n >>> longest_common_substring(\"a\",\"\")\n ''\n >>> longest... | 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-00062 | {
"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 shell_sort(collection: list[int]) -> list[int]:\n \"\"\"Pure implementation of shell sort algorithm in Python\n :param collection: Some mutable ordered collection with heterogeneous\n comparable items inside\n :re... | python-repair-agent-trajectory | {
"solver": {
"digest": "3e2cd2cdfd6d39b7290cef1118a94443146331076cbf532196d48499964ab6fb",
"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-00063 | {
"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[int]) -> list[int]:\n \"\"\"Pure 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 ord... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def alt_ipv4_to_decimal(ipv4_address: str) -> int:\n \"\"\"\n >>> alt_ipv4_to_decimal(\"192.168.0.1\")\n 3232235521\n >>> alt_ipv4_to_decimal(\"10.0.0.255\")\n 167772415\n \"\"\"\n return int(\"0x\" + \"\".joi... | python-repair-agent-trajectory | {
"solver": {
"digest": "d66f8c83e7b6984120b2625b3f92388f98dd5c68dca943625694dd8138880698",
"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-00067 | {
"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 alt_ipv4_to_decimal(ipv4_address: str) -> int:\n \"\"\"\n >>> alt_ipv4_to_decimal(\"192.168.0.1\")\n 3232235521\n >>> alt_ipv4_to_decimal(\"10.0.0.255\")\n 167772415\n \"\"\"\n return int(\"0x\" + \"\".join(f\"{int(i):02x}\" for i in i... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def dodecahedron_surface_area(edge: float) -> float:\n \"\"\"\n Calculates the surface area of a regular dodecahedron\n a = 3 * ((25 + 10 * (5** (1 / 2))) ** (1 / 2 )) * (e**2)\n where:\n a --> is the area of the do... | python-repair-agent-trajectory | {
"solver": {
"digest": "9b17e915b8b585a3e1ef545dfbd09d22ddc9b869db74be722cf0d9210c191179",
"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-00070 | {
"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 dodecahedron_surface_area(edge: float) -> float:\n \"\"\"\n Calculates the surface area of a regular dodecahedron\n a = 3 * ((25 + 10 * (5** (1 / 2))) ** (1 / 2 )) * (e**2)\n where:\n a --> is the area of the dodecahedron\n e --> is the l... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def prime_sieve_eratosthenes(num: int) -> list[int]:\n \"\"\"\n Print the prime numbers up to n\n\n >>> prime_sieve_eratosthenes(10)\n [2, 3, 5, 7]\n >>> prime_sieve_eratosthenes(20)\n [2, 3, 5, 7, 11, 13, 17, 19... | python-repair-agent-trajectory | {
"solver": {
"digest": "a20b6a49b623f1f6feebbdc84e00db7525a42e74620b4493e0e260267877dd10",
"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-00071 | {
"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 prime_sieve_eratosthenes(num: int) -> list[int]:\n \"\"\"\n Print the prime numbers up to n\n\n >>> prime_sieve_eratosthenes(10)\n [2, 3, 5, 7]\n >>> prime_sieve_eratosthenes(20)\n [2, 3, 5, 7, 11, 13, 17, 19]\n >>> prime_sieve_eratost... | 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-00072 | {
"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 exchange_sort(numbers: list[int]) -> list[int]:\n \"\"\"\n Uses exchange sort to sort a list of numbers.\n Source: https://en.wikipedia.org/wiki/Sorting_algorithm#Exchange_sort\n >>> exchange_sort([5, 4, 3, 2, 1])\... | python-repair-agent-trajectory | {
"solver": {
"digest": "61785d9a9741708a7acbcbb962099fa55296e2beddb75a76128b1871fe414c82",
"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-00074 | {
"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 exchange_sort(numbers: list[int]) -> list[int]:\n \"\"\"\n Uses exchange sort to sort a list of numbers.\n Source: https://en.wikipedia.org/wiki/Sorting_algorithm#Exchange_sort\n >>> exchange_sort([5, 4, 3, 2, 1])\n [1, 2, 3, 4, 5]\n >>> ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def double_factorial_recursive(n: int) -> int:\n \"\"\"\n Compute double factorial using recursive method.\n Recursion can be costly for large numbers.\n\n To learn about the theory behind this algorithm:\n https://... | python-repair-agent-trajectory | {
"solver": {
"digest": "069399f6174c92987d8133c899a484524be56beacc8b734902313f11ccba0142",
"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-00075 | {
"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 double_factorial_recursive(n: int) -> int:\n \"\"\"\n Compute double factorial using recursive method.\n Recursion can be costly for large numbers.\n\n To learn about the theory behind this algorithm:\n https://en.wikipedia.org/wiki/Double_f... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def count_vowels_and_consonants(text: str) -> tuple[int, int]:\n \"\"\"\n Count the number of vowels and consonants in a given string.\n\n This function ignores non-alphabetic characters.\n\n Args:\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "e06c1ac685930125f8499c079d1398f7eb85ba1db7dc5030007eba2a6dd67a81",
"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-00076 | {
"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 count_vowels_and_consonants(text: str) -> tuple[int, int]:\n \"\"\"\n Count the number of vowels and consonants in a given string.\n\n This function ignores non-alphabetic characters.\n\n Args:\n text (str): Input string.... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def moles_to_volume(pressure: float, moles: float, temperature: float) -> float:\n \"\"\"\n Convert moles to volume.\n Ideal gas laws are used.\n Temperature is taken in kelvin.\n Volume is taken in litres.\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "03704e7cb7003462f130a9f4be4768b87164bfcdc3834d639bb5cc66f17704b0",
"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-00078 | {
"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 moles_to_volume(pressure: float, moles: float, temperature: float) -> float:\n \"\"\"\n Convert moles to volume.\n Ideal gas laws are used.\n Temperature is taken in kelvin.\n Volume is taken in litres.\n Pressure has atm as SI un... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def shell_sort(collection: list[int]) -> list[int]:\n \"\"\"Pure implementation of shell sort algorithm in Python\n :param collection: Some mutable ordered collection with heterogeneous\n comparable items inside\n :re... | python-repair-agent-trajectory | {
"solver": {
"digest": "3e2cd2cdfd6d39b7290cef1118a94443146331076cbf532196d48499964ab6fb",
"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-00080 | {
"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[int]) -> list[int]:\n \"\"\"Pure 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 ord... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def is_match(string: str, pattern: str) -> bool:\n \"\"\"\n >>> is_match(\"\", \"\")\n True\n >>> is_match(\"aa\", \"a\")\n False\n >>> is_match(\"abc\", \"abc\")\n True\n >>> is_match(\"abc\", \"*c\")\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "e0370d02e48206b51a35ae0fa4b9386720d7ba86b679e9a26aea084b369a270d",
"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-00081 | {
"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 is_match(string: str, pattern: str) -> bool:\n \"\"\"\n >>> is_match(\"\", \"\")\n True\n >>> is_match(\"aa\", \"a\")\n False\n >>> is_match(\"abc\", \"abc\")\n True\n >>> is_match(\"abc\", \"*c\")\n True\n >>> is_match(\"abc\... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def is_contains_unique_chars(input_str: str) -> bool:\n \"\"\"\n Check if all characters in the string is unique or not.\n >>> is_contains_unique_chars(\"I_love.py\")\n True\n >>> is_contains_unique_chars(\"I don't ... | python-repair-agent-trajectory | {
"solver": {
"digest": "735532da92292c793741fed624079f43127da045cd122b0036fbd642d988eb47",
"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-00082 | {
"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 is_contains_unique_chars(input_str: str) -> bool:\n \"\"\"\n Check if all characters in the string is unique or not.\n >>> is_contains_unique_chars(\"I_love.py\")\n True\n >>> is_contains_unique_chars(\"I don't love Python\")\n False\n\n ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def integer_square_root(num: int) -> int:\n \"\"\"\n Returns the integer square root of a non-negative integer num.\n Args:\n num: A non-negative integer.\n Returns:\n The integer square root of num.\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "896595028d147c2a075ef76d86129ebcbb41c6612b2308f13a68fe4cf4e13e3c",
"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-00084 | {
"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 integer_square_root(num: int) -> int:\n \"\"\"\n Returns the integer square root of a non-negative integer num.\n Args:\n num: A non-negative integer.\n Returns:\n The integer square root of num.\n Raises:\n ValueError: ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def decimal_isolate(number: float, digit_amount: int) -> float:\n \"\"\"\n Isolates the decimal part of a number.\n If digitAmount > 0 round to that decimal place, else print the entire decimal.\n >>> decimal_isolate(1... | python-repair-agent-trajectory | {
"solver": {
"digest": "c6fd9f5b4393e64b11c3bd495074a1dadc06d7bea6e867f003ee005c4e78dc67",
"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-00085 | {
"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 decimal_isolate(number: float, digit_amount: int) -> float:\n \"\"\"\n Isolates the decimal part of a number.\n If digitAmount > 0 round to that decimal place, else print the entire decimal.\n >>> decimal_isolate(1.53, 0)\n 0.53\n >>> dec... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def octal_to_hex(octal: str) -> str:\n \"\"\"\n Convert an Octal number to Hexadecimal number.\n For more information: https://en.wikipedia.org/wiki/Octal\n\n >>> octal_to_hex(\"100\")\n '0x40'\n >>> octal_to_hex... | python-repair-agent-trajectory | {
"solver": {
"digest": "60cade18c59e6d2f94becc790bba720ecd3fc3ef964c38789825cff97fa020c3",
"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-00086 | {
"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 octal_to_hex(octal: str) -> str:\n \"\"\"\n Convert an Octal number to Hexadecimal number.\n For more information: https://en.wikipedia.org/wiki/Octal\n\n >>> octal_to_hex(\"100\")\n '0x40'\n >>> octal_to_hex(\"235\")\n '0x9D'\n >>>... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def twos_complement(number: int) -> str:\n \"\"\"\n Take in a negative integer 'number'.\n Return the two's complement representation of 'number'.\n\n >>> twos_complement(0)\n '0b0'\n >>> twos_complement(-1)\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "02c57a24afbb9617aca776a6015ca3fe45480e9e0371baf1f8ce571e4788dfad",
"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-00089 | {
"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 twos_complement(number: int) -> str:\n \"\"\"\n Take in a negative integer 'number'.\n Return the two's complement representation of 'number'.\n\n >>> twos_complement(0)\n '0b0'\n >>> twos_complement(-1)\n '0b11'\n >>> twos_compleme... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def binary_count_setbits(a: int) -> int:\n \"\"\"\n Take in 1 integer, return a number that is\n the number of 1's in binary representation of that number.\n\n >>> binary_count_setbits(25)\n 3\n >>> binary_count_... | python-repair-agent-trajectory | {
"solver": {
"digest": "17af49a439d7715b4c411122212d610ff64d43c9590b8f7851ba87302bf64fbf",
"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-00090 | {
"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 binary_count_setbits(a: int) -> int:\n \"\"\"\n Take in 1 integer, return a number that is\n the number of 1's in binary representation of that number.\n\n >>> binary_count_setbits(25)\n 3\n >>> binary_count_setbits(36)\n 2\n >>> bi... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def is_contains_unique_chars(input_str: str) -> bool:\n \"\"\"\n Check if all characters in the string is unique or not.\n >>> is_contains_unique_chars(\"I_love.py\")\n True\n >>> is_contains_unique_chars(\"I don't ... | python-repair-agent-trajectory | {
"solver": {
"digest": "735532da92292c793741fed624079f43127da045cd122b0036fbd642d988eb47",
"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-00091 | {
"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 is_contains_unique_chars(input_str: str) -> bool:\n \"\"\"\n Check if all characters in the string is unique or not.\n >>> is_contains_unique_chars(\"I_love.py\")\n True\n >>> is_contains_unique_chars(\"I don't love Python\")\n False\n\n ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def moles_to_pressure(volume: float, moles: float, temperature: float) -> float:\n \"\"\"\n Convert moles to pressure.\n Ideal gas laws are used.\n Temperature is taken in kelvin.\n Volume is taken in litres.\... | python-repair-agent-trajectory | {
"solver": {
"digest": "e0f7f867691cd80f9a47a0e482cb40d3e5dda6d7e3c8feff30319559480f85ad",
"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-00092 | {
"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 moles_to_pressure(volume: float, moles: float, temperature: float) -> float:\n \"\"\"\n Convert moles to pressure.\n Ideal gas laws are used.\n Temperature is taken in kelvin.\n Volume is taken in litres.\n Pressure has atm as SI ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def max_product_subarray(numbers: list[int]) -> int:\n \"\"\"\n Returns the maximum product that can be obtained by multiplying a\n contiguous subarray of the given integer list `numbers`.\n\n Example:\n\n >>> max_p... | python-repair-agent-trajectory | {
"solver": {
"digest": "4b40e662312e163ac4cab83e65ac057c0594660c847a0c87381a17345f830f8f",
"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-00095 | {
"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 max_product_subarray(numbers: list[int]) -> int:\n \"\"\"\n Returns the maximum product that can be obtained by multiplying a\n contiguous subarray of the given integer list `numbers`.\n\n Example:\n\n >>> max_product_subarray([2, 3, -2, 4])... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def is_bit_set(number: int, position: int) -> bool:\n \"\"\"\n Is the bit at position set?\n\n Details: Shift the bit at position to be the first (smallest) bit.\n Then check if the first bit is set by anding the shift... | python-repair-agent-trajectory | {
"solver": {
"digest": "d6f63aa4e9bdb9c5a57a851f92c6406124356841c11101f459f054a5cf57bc48",
"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-00096 | {
"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 is_bit_set(number: int, position: int) -> bool:\n \"\"\"\n Is the bit at position set?\n\n Details: Shift the bit at position to be the first (smallest) bit.\n Then check if the first bit is set by anding the shifted number with 1.\n\n >>> i... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def dp_count(s, n):\n \"\"\"\n >>> dp_count([1, 2, 3], 4)\n 4\n >>> dp_count([1, 2, 3], 7)\n 8\n >>> dp_count([2, 5, 3, 6], 10)\n 5\n >>> dp_count([10], 99)\n 0\n >>> dp_count([4, 5, 6], 0)\n 1\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "7ea75676cd3234bfcc2c42137d13111e5cb80fdfee7a435967fe7a8449857f6a",
"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-00097 | {
"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_count(s, n):\n \"\"\"\n >>> dp_count([1, 2, 3], 4)\n 4\n >>> dp_count([1, 2, 3], 7)\n 8\n >>> dp_count([2, 5, 3, 6], 10)\n 5\n >>> dp_count([10], 99)\n 0\n >>> dp_count([4, 5, 6], 0)\n 1\n >>> dp_count([1, 2, 3], -5)\... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def octal_to_hex(octal: str) -> str:\n \"\"\"\n Convert an Octal number to Hexadecimal number.\n For more information: https://en.wikipedia.org/wiki/Octal\n\n >>> octal_to_hex(\"100\")\n '0x40'\n >>> octal_to_hex... | python-repair-agent-trajectory | {
"solver": {
"digest": "60cade18c59e6d2f94becc790bba720ecd3fc3ef964c38789825cff97fa020c3",
"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-00098 | {
"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 octal_to_hex(octal: str) -> str:\n \"\"\"\n Convert an Octal number to Hexadecimal number.\n For more information: https://en.wikipedia.org/wiki/Octal\n\n >>> octal_to_hex(\"100\")\n '0x40'\n >>> octal_to_hex(\"235\")\n '0x9D'\n >>>... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def is_sum_subset(arr: list[int], required_sum: int) -> bool:\n \"\"\"\n >>> is_sum_subset([2, 4, 6, 8], 5)\n False\n >>> is_sum_subset([2, 4, 6, 8], 14)\n True\n \"\"\"\n # a subset value says 1 if that subse... | python-repair-agent-trajectory | {
"solver": {
"digest": "d0c89f241da7c4644d5db2c26a6ae923c08ef848110942ba3a2f8fcdb0244f04",
"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-00101 | {
"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 is_sum_subset(arr: list[int], required_sum: int) -> bool:\n \"\"\"\n >>> is_sum_subset([2, 4, 6, 8], 5)\n False\n >>> is_sum_subset([2, 4, 6, 8], 14)\n True\n \"\"\"\n # a subset value says 1 if that subset sum can be formed else 0\n ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def binary_multiply(a: int, b: int) -> int:\n \"\"\"\n Multiply 'a' and 'b' using bitwise multiplication.\n\n Parameters:\n a (int): The first number.\n b (int): The second number.\n\n Returns:\n int: a * b\n\... | python-repair-agent-trajectory | {
"solver": {
"digest": "3b5642598f0b27ec0f9fa1b70a173a8314b94e1a9c3903a131d73586c398a06a",
"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-00102 | {
"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 binary_multiply(a: int, b: int) -> int:\n \"\"\"\n Multiply 'a' and 'b' using bitwise multiplication.\n\n Parameters:\n a (int): The first number.\n b (int): The second number.\n\n Returns:\n int: a * b\n\n Examples:\n >>> binary... | train |
{
"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-00103 | {
"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 set_bit(number: int, position: int) -> int:\n \"\"\"\n Set the bit at position to 1.\n\n Details: perform bitwise or for given number and X.\n Where X is a number with all the bits - zeroes and bit on given\n po... | python-repair-agent-trajectory | {
"solver": {
"digest": "fdf4b6d2dc7d3933d0e9809c0813a0430ebf2556cc2dbc0a0739c0258dcb099a",
"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-00104 | {
"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 set_bit(number: int, position: int) -> int:\n \"\"\"\n Set the bit at position to 1.\n\n Details: perform bitwise or 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 >>> set_b... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def decimal_isolate(number: float, digit_amount: int) -> float:\n \"\"\"\n Isolates the decimal part of a number.\n If digitAmount > 0 round to that decimal place, else print the entire decimal.\n >>> decimal_isolate(1... | python-repair-agent-trajectory | {
"solver": {
"digest": "c6fd9f5b4393e64b11c3bd495074a1dadc06d7bea6e867f003ee005c4e78dc67",
"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-00106 | {
"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 decimal_isolate(number: float, digit_amount: int) -> float:\n \"\"\"\n Isolates the decimal part of a number.\n If digitAmount > 0 round to that decimal place, else print the entire decimal.\n >>> decimal_isolate(1.53, 0)\n 0.53\n >>> dec... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def longest_common_substring(text1: str, text2: str) -> str:\n \"\"\"\n Finds the longest common substring between two strings.\n\n >>> longest_common_substring(\"\", \"\")\n ''\n >>> longest_common_substring(\"a\",... | python-repair-agent-trajectory | {
"solver": {
"digest": "f6eaa2ceec5a3aaf169265eb8837401706ff6dee1fad2b89def197e13f94fcd4",
"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-00109 | {
"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_common_substring(text1: str, text2: str) -> str:\n \"\"\"\n Finds the longest common substring between two strings.\n\n >>> longest_common_substring(\"\", \"\")\n ''\n >>> longest_common_substring(\"a\",\"\")\n ''\n >>> longest... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def reverse_bit(number: int) -> int:\n \"\"\"\n Take in a 32 bit integer, reverse its bits, return a 32 bit integer result\n\n >>> reverse_bit(25)\n 2550136832\n >>> reverse_bit(37)\n 2751463424\n >>> reverse_... | python-repair-agent-trajectory | {
"solver": {
"digest": "36fc1ffd87fe0d8c48f3f346239905909f9046b08b39f46c90b9348cff790b85",
"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-00110 | {
"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_bit(number: int) -> int:\n \"\"\"\n Take in a 32 bit integer, reverse its bits, return a 32 bit integer result\n\n >>> reverse_bit(25)\n 2550136832\n >>> reverse_bit(37)\n 2751463424\n >>> reverse_bit(21)\n 2818572288\n >... | 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-00111 | {
"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 molarity_to_normality(nfactor: int, moles: float, volume: float) -> float:\n \"\"\"\n Convert molarity to normality.\n Volume is taken in litres.\n\n Wikipedia reference: https://en.wikipedia.org/wiki/Equivalen... | python-repair-agent-trajectory | {
"solver": {
"digest": "be633d84ab3b14ea94a52dc2ec579984845bdf59f3157625459e9961105040a9",
"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-00112 | {
"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 molarity_to_normality(nfactor: int, moles: float, volume: float) -> float:\n \"\"\"\n Convert molarity to normality.\n Volume is taken in litres.\n\n Wikipedia reference: https://en.wikipedia.org/wiki/Equivalent_concentration\n Wikiped... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def tribonacci(num: int) -> list[int]:\n \"\"\"\n Given a number, return first n Tribonacci Numbers.\n >>> tribonacci(5)\n [0, 0, 1, 1, 2]\n >>> tribonacci(8)\n [0, 0, 1, 1, 2, 4, 7, 13]\n \"\"\"\n dp = [0]... | python-repair-agent-trajectory | {
"solver": {
"digest": "11c2f747774fd48844149a993e711eeceb7ec74681cda482ebc8721e18981331",
"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-00113 | {
"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 tribonacci(num: int) -> list[int]:\n \"\"\"\n Given a number, return first n Tribonacci Numbers.\n >>> tribonacci(5)\n [0, 0, 1, 1, 2]\n >>> tribonacci(8)\n [0, 0, 1, 1, 2, 4, 7, 13]\n \"\"\"\n dp = [0] * num\n dp[2] = 1\n\n f... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def recursive_match(text: str, pattern: str) -> bool:\n r\"\"\"\n Recursive matching algorithm.\n\n | Time complexity: O(2^(\\|text\\| + \\|pattern\\|))\n | Space complexity: Recursion depth is O(\\|text\\| + \\|patter... | python-repair-agent-trajectory | {
"solver": {
"digest": "1f82e3f4da0f07b9810389e10824eb042c55d072ea567453c7579b2a0b260572",
"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-00116 | {
"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 recursive_match(text: str, pattern: str) -> bool:\n r\"\"\"\n Recursive matching algorithm.\n\n | Time complexity: O(2^(\\|text\\| + \\|pattern\\|))\n | Space complexity: Recursion depth is O(\\|text\\| + \\|pattern\\|).\n\n :param text: Tex... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def longest_common_subsequence(x: str, y: str):\n \"\"\"\n Finds the longest common subsequence between two strings. Also returns the\n The subsequence found\n\n Parameters\n ----------\n\n x: str, one of the str... | python-repair-agent-trajectory | {
"solver": {
"digest": "b57beb30e6898f2174b9fb6ece9661384657c70995b79a47ac73992a0abcd6a3",
"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-00117 | {
"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_common_subsequence(x: str, y: str):\n \"\"\"\n Finds the longest common subsequence between two strings. Also returns the\n The subsequence found\n\n Parameters\n ----------\n\n x: str, one of the strings\n y: str, the other st... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def longest_common_substring(text1: str, text2: str) -> str:\n \"\"\"\n Finds the longest common substring between two strings.\n\n >>> longest_common_substring(\"\", \"\")\n ''\n >>> longest_common_substring(\"a\",... | python-repair-agent-trajectory | {
"solver": {
"digest": "f6eaa2ceec5a3aaf169265eb8837401706ff6dee1fad2b89def197e13f94fcd4",
"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-00118 | {
"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_common_substring(text1: str, text2: str) -> str:\n \"\"\"\n Finds the longest common substring between two strings.\n\n >>> longest_common_substring(\"\", \"\")\n ''\n >>> longest_common_substring(\"a\",\"\")\n ''\n >>> longest... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def molarity_to_normality(nfactor: int, moles: float, volume: float) -> float:\n \"\"\"\n Convert molarity to normality.\n Volume is taken in litres.\n\n Wikipedia reference: https://en.wikipedia.org/wiki/Equivalen... | python-repair-agent-trajectory | {
"solver": {
"digest": "be633d84ab3b14ea94a52dc2ec579984845bdf59f3157625459e9961105040a9",
"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-00120 | {
"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 molarity_to_normality(nfactor: int, moles: float, volume: float) -> float:\n \"\"\"\n Convert molarity to normality.\n Volume is taken in litres.\n\n Wikipedia reference: https://en.wikipedia.org/wiki/Equivalent_concentration\n Wikiped... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "from __future__ import annotations\n\n\ndef extended_euclid(a: int, b: int) -> tuple[int, int]:\n \"\"\"\n >>> extended_euclid(10, 6)\n (-1, 2)\n\n >>> extended_euclid(7, 5)\n (-2, 3)\n\n \"\"\"\n if b == 0:\n... | python-repair-agent-trajectory | {
"solver": {
"digest": "a52b4940880d732c6e9bcb022b4d04f0128cfd70e75b063028f33d34a35adcc6",
"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-00121 | {
"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 extended_euclid(a: int, b: int) -> tuple[int, int]:\n \"\"\"\n >>> extended_euclid(10, 6)\n (-1, 2)\n\n >>> extended_euclid(7, 5)\n (-2, 3)\n\n \"\"\"\n if b != 0:\n return (1, 0)\n (x,... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def octal_to_binary(octal_number: str) -> str:\n \"\"\"\n Convert an Octal number to Binary.\n\n >>> octal_to_binary(\"17\")\n '001111'\n >>> octal_to_binary(\"7\")\n '111'\n >>> octal_to_binary(\"Av\")\n T... | python-repair-agent-trajectory | {
"solver": {
"digest": "6df38b1302b901a7facaeda582fd59268709b889c15def0cf5e04e0532c9d6ae",
"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-00122 | {
"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 octal_to_binary(octal_number: str) -> str:\n \"\"\"\n Convert an Octal number to Binary.\n\n >>> octal_to_binary(\"17\")\n '001111'\n >>> octal_to_binary(\"7\")\n '111'\n >>> octal_to_binary(\"Av\")\n Traceback (most recent call las... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "from itertools import compress, repeat\nfrom math import ceil, sqrt\n\n\ndef odd_sieve(num: int) -> list[int]:\n \"\"\"\n Returns the prime numbers < `num`. The prime numbers are calculated using an\n odd sieve implementa... | python-repair-agent-trajectory | {
"solver": {
"digest": "c2dad96a6a816866e5996f8381f3b58ac8fc017a0ea79656cb93870dfd476020",
"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-00126 | {
"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 itertools import compress, repeat\nfrom math import ceil, sqrt\n\n\ndef odd_sieve(num: int) -> list[int]:\n \"\"\"\n Returns the prime numbers < `num`. The prime numbers are calculated using an\n odd sieve implementation of the Sieve of Eratosthe... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def double_factorial_recursive(n: int) -> int:\n \"\"\"\n Compute double factorial using recursive method.\n Recursion can be costly for large numbers.\n\n To learn about the theory behind this algorithm:\n https://... | python-repair-agent-trajectory | {
"solver": {
"digest": "069399f6174c92987d8133c899a484524be56beacc8b734902313f11ccba0142",
"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-00127 | {
"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 double_factorial_recursive(n: int) -> int:\n \"\"\"\n Compute double factorial using recursive method.\n Recursion can be costly for large numbers.\n\n To learn about the theory behind this algorithm:\n https://en.wikipedia.org/wiki/Double_f... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def snake_to_camel_case(input_str: str, use_pascal: bool = False) -> str:\n \"\"\"\n Transforms a snake_case given string to camelCase (or PascalCase if indicated)\n (defaults to not use Pascal)\n\n >>> snake_to_camel_... | python-repair-agent-trajectory | {
"solver": {
"digest": "b78569cdb0c51be6fac4a0f3bf11e9e3c5f719f9221e97b8ab91482097a186fb",
"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-00128 | {
"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 snake_to_camel_case(input_str: str, use_pascal: bool = False) -> str:\n \"\"\"\n Transforms a snake_case given string to camelCase (or PascalCase if indicated)\n (defaults to not use Pascal)\n\n >>> snake_to_camel_case(\"some_random_string\")\n... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def is_sum_subset(arr: list[int], required_sum: int) -> bool:\n \"\"\"\n >>> is_sum_subset([2, 4, 6, 8], 5)\n False\n >>> is_sum_subset([2, 4, 6, 8], 14)\n True\n \"\"\"\n # a subset value says 1 if that subse... | python-repair-agent-trajectory | {
"solver": {
"digest": "d0c89f241da7c4644d5db2c26a6ae923c08ef848110942ba3a2f8fcdb0244f04",
"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-00129 | {
"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 is_sum_subset(arr: list[int], required_sum: int) -> bool:\n \"\"\"\n >>> is_sum_subset([2, 4, 6, 8], 5)\n False\n >>> is_sum_subset([2, 4, 6, 8], 14)\n True\n \"\"\"\n # a subset value says 1 if that subset sum can be formed else 0\n ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def get_index_of_rightmost_set_bit(number: int) -> int:\n \"\"\"\n Take in a positive integer 'number'.\n Returns the zero-based index of first set bit in that 'number' from right.\n Returns -1, If no set bit found.\n\... | python-repair-agent-trajectory | {
"solver": {
"digest": "ee1faa17f7263b9d65d2fa1d3d2d1dbb8ed9246d71ffe014fedc8e1c50801fb9",
"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-00130 | {
"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_index_of_rightmost_set_bit(number: int) -> int:\n \"\"\"\n Take in a positive integer 'number'.\n Returns the zero-based index of first set bit in that 'number' from right.\n Returns -1, If no set bit found.\n\n >>> get_index_of_rightmos... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def binary_count_setbits(a: int) -> int:\n \"\"\"\n Take in 1 integer, return a number that is\n the number of 1's in binary representation of that number.\n\n >>> binary_count_setbits(25)\n 3\n >>> binary_count_... | python-repair-agent-trajectory | {
"solver": {
"digest": "17af49a439d7715b4c411122212d610ff64d43c9590b8f7851ba87302bf64fbf",
"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-00133 | {
"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 binary_count_setbits(a: int) -> int:\n \"\"\"\n Take in 1 integer, return a number that is\n the number of 1's in binary representation of that number.\n\n >>> binary_count_setbits(25)\n 3\n >>> binary_count_setbits(36)\n 2\n >>> bi... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def is_sum_subset(arr: list[int], required_sum: int) -> bool:\n \"\"\"\n >>> is_sum_subset([2, 4, 6, 8], 5)\n False\n >>> is_sum_subset([2, 4, 6, 8], 14)\n True\n \"\"\"\n # a subset value says 1 if that subse... | python-repair-agent-trajectory | {
"solver": {
"digest": "d0c89f241da7c4644d5db2c26a6ae923c08ef848110942ba3a2f8fcdb0244f04",
"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-00135 | {
"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 is_sum_subset(arr: list[int], required_sum: int) -> bool:\n \"\"\"\n >>> is_sum_subset([2, 4, 6, 8], 5)\n False\n >>> is_sum_subset([2, 4, 6, 8], 14)\n True\n \"\"\"\n # a subset value says 1 if that subset sum can be formed else 0\n ... | 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-00138 | {
"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": "from __future__ import annotations\n\n\ndef median(nums: list) -> int | float:\n \"\"\"\n Find median of a list of numbers.\n Wiki: https://en.wikipedia.org/wiki/Median\n\n >>> median([0])\n 0\n >>> median([4, 1,... | python-repair-agent-trajectory | {
"solver": {
"digest": "a4134519b4951bdefe24eb39869ee4a7767cb37ffa01c0bedb56f5c5ad5aa22f",
"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-00139 | {
"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 median(nums: list) -> int | float:\n \"\"\"\n Find median of a list of numbers.\n Wiki: https://en.wikipedia.org/wiki/Median\n\n >>> median([0])\n 0\n >>> median([4, 1, 3, 2])\n 2.5\n >>> medi... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "from __future__ import annotations\n\n\ndef min_steps_to_one(number: int) -> int:\n \"\"\"\n Minimum steps to 1 implemented using tabulation.\n >>> min_steps_to_one(10)\n 3\n >>> min_steps_to_one(15)\n 4\n >>>... | python-repair-agent-trajectory | {
"solver": {
"digest": "8f7dc7f0e47aba4fd16ee6b30635fbe6e5be44561c293a6506fa4b8e6831184f",
"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-00142 | {
"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 min_steps_to_one(number: int) -> int:\n \"\"\"\n Minimum steps to 1 implemented using tabulation.\n >>> min_steps_to_one(10)\n 3\n >>> min_steps_to_one(15)\n 4\n >>> min_steps_to_one(6)\n 2\n\... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def decimal_to_negative_base_2(num: int) -> int:\n \"\"\"\n This function returns the number negative base 2\n of the decimal number of the input data.\n\n Args:\n int: The decimal number to convert.\n\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "34f3860c63da8675a104dd5f4b5ed941cf7c9fa33f066e0b881a822527f10296",
"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-00143 | {
"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 decimal_to_negative_base_2(num: int) -> int:\n \"\"\"\n This function returns the number negative base 2\n of the decimal number of the input data.\n\n Args:\n int: The decimal number to convert.\n\n Returns:\n int: The neg... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def is_ip_v4_address_valid(ip: str) -> bool:\n \"\"\"\n print \"Valid IP address\" If IP is valid.\n or\n print \"Invalid IP address\" If IP is invalid.\n\n >>> is_ip_v4_address_valid(\"192.168.0.23\")\n True\n\n... | python-repair-agent-trajectory | {
"solver": {
"digest": "fb8e89711b766b4feec1dcb5813e8a6cc863abc08458486fa392adbdbc3eb808",
"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-00146 | {
"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 is_ip_v4_address_valid(ip: str) -> bool:\n \"\"\"\n print \"Valid IP address\" If IP is valid.\n or\n print \"Invalid IP address\" If IP is invalid.\n\n >>> is_ip_v4_address_valid(\"192.168.0.23\")\n True\n\n >>> is_ip_v4_address_valid... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def longest_common_subsequence(x: str, y: str):\n \"\"\"\n Finds the longest common subsequence between two strings. Also returns the\n The subsequence found\n\n Parameters\n ----------\n\n x: str, one of the str... | python-repair-agent-trajectory | {
"solver": {
"digest": "b57beb30e6898f2174b9fb6ece9661384657c70995b79a47ac73992a0abcd6a3",
"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-00148 | {
"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_common_subsequence(x: str, y: str):\n \"\"\"\n Finds the longest common subsequence between two strings. Also returns the\n The subsequence found\n\n Parameters\n ----------\n\n x: str, one of the strings\n y: str, the other st... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def bitwise_addition_recursive(number: int, other_number: int) -> int:\n \"\"\"\n >>> bitwise_addition_recursive(4, 5)\n 9\n >>> bitwise_addition_recursive(8, 9)\n 17\n >>> bitwise_addition_recursive(0, 4)\n 4... | python-repair-agent-trajectory | {
"solver": {
"digest": "8eb7e75a87473accb1f793b97d8b0005f4a3f1e34e5e27d45a8969229dc38f22",
"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-00149 | {
"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 bitwise_addition_recursive(number: int, other_number: int) -> int:\n \"\"\"\n >>> bitwise_addition_recursive(4, 5)\n 9\n >>> bitwise_addition_recursive(8, 9)\n 17\n >>> bitwise_addition_recursive(0, 4)\n 4\n >>> bitwise_addition_rec... | 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-00150 | {
"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 |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def double_factorial_iterative(num: int) -> int:\n \"\"\"\n Compute double factorial using iterative method.\n\n To learn about the theory behind this algorithm:\n https://en.wikipedia.org/wiki/Double_factorial\n\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "1a95c2cb9681d4d1537a2fe5acef9e86bc756d3292ce947895fdd0b6e44246cb",
"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-00151 | {
"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 double_factorial_iterative(num: int) -> int:\n \"\"\"\n Compute double factorial using iterative method.\n\n To learn about the theory behind this algorithm:\n https://en.wikipedia.org/wiki/Double_factorial\n\n >>> from math import prod\n ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def sum_of_series(first_term: int, common_diff: int, num_of_terms: int) -> float:\n \"\"\"\n Find the sum of n terms in an arithmetic progression.\n\n >>> sum_of_series(1, 1, 10)\n 55.0\n >>> sum_of_series(1, 10, 10... | python-repair-agent-trajectory | {
"solver": {
"digest": "5274639e3fe46c7b9d296294131476bc50d3dfde5124cfc301303c1e7ee1fe63",
"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-00153 | {
"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 sum_of_series(first_term: int, common_diff: int, num_of_terms: int) -> float:\n \"\"\"\n Find the sum of n terms in an arithmetic progression.\n\n >>> sum_of_series(1, 1, 10)\n 55.0\n >>> sum_of_series(1, 10, 100)\n 49600.0\n \"\"\"\n ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def octal_to_binary(octal_number: str) -> str:\n \"\"\"\n Convert an Octal number to Binary.\n\n >>> octal_to_binary(\"17\")\n '001111'\n >>> octal_to_binary(\"7\")\n '111'\n >>> octal_to_binary(\"Av\")\n T... | python-repair-agent-trajectory | {
"solver": {
"digest": "6df38b1302b901a7facaeda582fd59268709b889c15def0cf5e04e0532c9d6ae",
"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-00155 | {
"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 octal_to_binary(octal_number: str) -> str:\n \"\"\"\n Convert an Octal number to Binary.\n\n >>> octal_to_binary(\"17\")\n '001111'\n >>> octal_to_binary(\"7\")\n '111'\n >>> octal_to_binary(\"Av\")\n Traceback (most recent call las... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def perfect_square_binary_search(n: int) -> bool:\n \"\"\"\n Check if a number is perfect square using binary search.\n Time complexity : O(Log(n))\n Space complexity: O(1)\n\n >>> perfect_square_binary_search(9)\n ... | python-repair-agent-trajectory | {
"solver": {
"digest": "fdd79d1c55e1abf785f4e12bdee3e97183e851891fcc72392250dd63e543ed57",
"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-00157 | {
"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 perfect_square_binary_search(n: int) -> bool:\n \"\"\"\n Check if a number is perfect square using binary search.\n Time complexity : O(Log(n))\n Space complexity: O(1)\n\n >>> perfect_square_binary_search(9)\n True\n >>> perfect_squar... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def pressure_and_volume_to_temperature(\n pressure: float, moles: float, volume: float\n) -> float:\n \"\"\"\n Convert pressure and volume to temperature.\n Ideal gas laws are used.\n Temperature is taken in kel... | python-repair-agent-trajectory | {
"solver": {
"digest": "dade0c4eff301e200870e4aed3c97afc2c49dd93b27511efa239c11ee1f0e620",
"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-00158 | {
"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 pressure_and_volume_to_temperature(\n pressure: float, moles: float, volume: float\n) -> float:\n \"\"\"\n Convert pressure and volume to temperature.\n Ideal gas laws are used.\n Temperature is taken in kelvin.\n Volume is taken in... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "from __future__ import annotations\n\n\ndef find_min_iterative(nums: list[int | float]) -> int | float:\n \"\"\"\n Find Minimum Number in a List\n :param nums: contains elements\n :return: min number in list\n\n >>>... | python-repair-agent-trajectory | {
"solver": {
"digest": "5e54489d71f71ee97a772a4ecb3b0bb5c3a842eafc1f19c0bafc8247fde6ec72",
"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-00160 | {
"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 find_min_iterative(nums: list[int | float]) -> int | float:\n \"\"\"\n Find Minimum Number in a List\n :param nums: contains elements\n :return: min number in list\n\n >>> for nums in ([3, 2, 1], [-3, ... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def recursive_match(text: str, pattern: str) -> bool:\n r\"\"\"\n Recursive matching algorithm.\n\n | Time complexity: O(2^(\\|text\\| + \\|pattern\\|))\n | Space complexity: Recursion depth is O(\\|text\\| + \\|patter... | python-repair-agent-trajectory | {
"solver": {
"digest": "1f82e3f4da0f07b9810389e10824eb042c55d072ea567453c7579b2a0b260572",
"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-00162 | {
"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 recursive_match(text: str, pattern: str) -> bool:\n r\"\"\"\n Recursive matching algorithm.\n\n | Time complexity: O(2^(\\|text\\| + \\|pattern\\|))\n | Space complexity: Recursion depth is O(\\|text\\| + \\|pattern\\|).\n\n :param text: Tex... | train |
{
"claimed_outcome": "repaired",
"final_patch": {
"files": {
"program.py": "def median_of_five(arr: list) -> int:\n \"\"\"\n Return the median of the input list\n :param arr: Array to find median of\n :return: median of arr\n\n >>> median_of_five([2, 4, 5, 7, 899])\n 5\n >>> median_of... | python-repair-agent-trajectory | {
"solver": {
"digest": "2210d5fb42ce245b3ed0c90b8089b39c8fcddd59914d691ef148c9e48f0620ed",
"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-00163 | {
"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 median_of_five(arr: list) -> int:\n \"\"\"\n Return the median of the input list\n :param arr: Array to find median of\n :return: median of arr\n\n >>> median_of_five([2, 4, 5, 7, 899])\n 5\n >>> median_of_five([5, 7, 899, 54, 32])\n ... | train |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.