Propagate changes to dataset card
Browse files
README.md
CHANGED
@@ -11,7 +11,7 @@ GitGoodBench Lite is a subset of 900 samples for evaluating the performance of A
|
|
11 |
The samples in the dataset are evenly split across the programming languages Python, Java and Kotlin and the sample types merge conflict resolution and file-commit gram.
|
12 |
This dataset thus contains 150 samples per sample type and programming language.
|
13 |
|
14 |
-
All data in this dataset are collected from
|
15 |
that have >= 1000 stars, >= 5 branches, >= 10 contributors and are not a fork or archived. We collected the initial list of repositories using [SEART.](https://seart-ghs.si.usi.ch/)
|
16 |
|
17 |
Evaluation is to be performed by exact-match (EM) of diffs for the merge conflict setting and by LLM-as-a-Judge for the file-commit gram setting. [For further details see our paper.]()
|
@@ -43,7 +43,8 @@ File-commit chain scenarios consist of two commits, the oldest and newest commit
|
|
43 |
In total the chain consists of `times_seen_consecutively` commits. The intended use-cases of these scenarios are to evaluate the agent's capacity to create meaningful, cohesive commits or
|
44 |
improve the local tree via rebasing. Thus samples of this `sample_type` cover two scenario types.
|
45 |
|
46 |
-
File-commit chains are at least 3 commits long,
|
|
|
47 |
|
48 |
A `file_commit_chain` scenario looks as follows:
|
49 |
```
|
|
|
11 |
The samples in the dataset are evenly split across the programming languages Python, Java and Kotlin and the sample types merge conflict resolution and file-commit gram.
|
12 |
This dataset thus contains 150 samples per sample type and programming language.
|
13 |
|
14 |
+
All data in this dataset are collected from 479 unique, open-source GitHub repositories with permissive licenses
|
15 |
that have >= 1000 stars, >= 5 branches, >= 10 contributors and are not a fork or archived. We collected the initial list of repositories using [SEART.](https://seart-ghs.si.usi.ch/)
|
16 |
|
17 |
Evaluation is to be performed by exact-match (EM) of diffs for the merge conflict setting and by LLM-as-a-Judge for the file-commit gram setting. [For further details see our paper.]()
|
|
|
43 |
In total the chain consists of `times_seen_consecutively` commits. The intended use-cases of these scenarios are to evaluate the agent's capacity to create meaningful, cohesive commits or
|
44 |
improve the local tree via rebasing. Thus samples of this `sample_type` cover two scenario types.
|
45 |
|
46 |
+
File-commit chains are at least 3 commits long,the file the sample concerns itself with is guaranteed to be of `programming_language`
|
47 |
+
(this is not the case for other potential files in the commits of the sample) and no commit is a merge commit.
|
48 |
|
49 |
A `file_commit_chain` scenario looks as follows:
|
50 |
```
|