Datasets:
Release [run release-20261111T071913Z] (#13)
Browse files- Release [run release-20261111T071913Z] (0ee184c976d58c15c130ca86ab25628ce92fd7ab)
This view is limited to 50 files because it contains too many changes. See raw diff
- CHANGELOG.md +16 -0
- README.md +27 -27
- README.zh.md +27 -27
- campaign_files/2026-10-c-repros-2/euclidean-rbf-mle-sim-repro/README.md +0 -2
- campaign_files/2026-10-c-repros/evidential-deep-learning-repro/LICENSE.txt +6 -0
- campaign_files/2026-10-c-repros/evidential-deep-learning-repro/README.md +0 -2
- campaign_files/2026-10-g-solver-instances-2/evalgm-graphical-model-benchmark/README.md +0 -32
- campaign_files/2026-10-g-solver-instances-2/evrp-competition-2020/README.md +0 -4
- campaign_files/2026-10-m-issue-trackers-2/evergreen-general/README.md +0 -4
- campaign_files/2026-10-s-security-detection/evtx-attack-samples/README.md +0 -8
- campaign_files/2026-10-s-security-detection/evtx-to-mitre-attack/README.md +0 -6
- campaign_files/2026-10-sc-science-reference-data-2/exciting-test-farm/README.md +0 -4
- campaign_files/2026-10-sw-tests-and-exercises-2/exercises-in-programming-style/README.md +0 -8
- campaign_files/2026-10-sw-tests-and-exercises-2/exercism-arm64-assembly-track/README.md +0 -4
- campaign_files/2026-10-sw-tests-and-exercises-2/exercism-awk-track/README.md +0 -8
- campaign_files/2026-10-sw-tests-and-exercises-2/exercism-bash-track/README.md +0 -4
- campaign_files/2026-10-sw-tests-and-exercises-2/exercism-bash/README.md +0 -4
- campaign_files/2026-10-sw-tests-and-exercises-2/exercism-clojure-track/README.md +0 -4
- campaign_files/2026-10-sw-tests-and-exercises-2/exercism-cobol/README.md +0 -10
- campaign_files/2026-10-sw-tests-and-exercises-2/exercism-csharp-track/README.md +0 -6
- cards/0xdea-semgrep-rules.md +2 -2
- cards/1brc-test-samples.md +2 -2
- cards/2dpacklib.md +2 -2
- cards/abacus-integrate-tests.md +2 -2
- cards/abhishekumarr00-supply-chain-mastery.md +2 -2
- cards/academy-bus-nj-gtfs.md +2 -2
- cards/accordproject-cicero-template-library.md +2 -2
- cards/activity-schema-aggregate-in-between-1.md +2 -2
- cards/activity-schema-first-in-between-2.md +2 -2
- cards/acwf-verification.md +2 -2
- cards/adflib-adf-deleted.md +2 -2
- cards/adflib-adf-malformed.md +2 -2
- cards/adventure-works-oltp-sample.md +2 -2
- cards/agat-tests.md +2 -2
- cards/agl-gerrit-changes.md +2 -2
- cards/aiops2018-kpi.md +2 -2
- cards/akretion-factur-x-libreoffice-extension.md +2 -2
- cards/allenporter-ical-recurring-single-change.md +2 -2
- cards/altlinux-devel.md +2 -2
- cards/alumik-nkthesis-testfiles.md +2 -2
- cards/aml-dbt-rule-unit-tests.md +2 -2
- cards/ancuber-cubst-tests.md +2 -2
- cards/annabel-lee-wikisource-reading.md +2 -2
- cards/ansible-galaxy-collections.md +2 -2
- cards/aomedia-gerrit-changes.md +2 -2
- cards/aosp-gerrit-changes.md +2 -2
- cards/apache-arrow-testing.md +2 -2
- cards/apache-beam-katas-python.md +2 -2
- cards/apache-hop-integration-tests.md +2 -2
- cards/apache-jira.md +2 -2
CHANGELOG.md
CHANGED
|
@@ -3033,3 +3033,19 @@ Changes to the content of this index, oldest first. There is one entry for each
|
|
| 3033 |
- hf-training-records: refused
|
| 3034 |
- npm: refused
|
| 3035 |
- stackexchange-api-posts: refused
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 3033 |
- hf-training-records: refused
|
| 3034 |
- npm: refused
|
| 3035 |
- stackexchange-api-posts: refused
|
| 3036 |
+
|
| 3037 |
+
## 2026-11-11: sources held back
|
| 3038 |
+
|
| 3039 |
+
- Each source below keeps its newest version that passed every check; its newer batch waits until it passes them:
|
| 3040 |
+
- borealis-dataverse-workbooks-cc-by: changed pointer group file data/borealis-dataverse-workbooks-cc-by/2026-10-a-spreadsheets-with-answers/part-00000.parquet: 2 key(s) of the old version are in no data file of source borealis-dataverse-workbooks-cc-by after the commit (row 4 from batch 2026-10-a-spreadsheets-with-answers, row 5 from batch 2026-10-a-spreadsheets-with-answers); the removal record holds none of them, and none fails a publish check now
|
| 3041 |
+
- borealis-dataverse-workbooks-cc0: changed pointer group file data/borealis-dataverse-workbooks-cc0/2026-10-a-spreadsheets-with-answers/part-00000.parquet: 1 key(s) of the old version are in no data file of source borealis-dataverse-workbooks-cc0 after the commit (row 7 from batch 2026-10-a-spreadsheets-with-answers); the removal record holds none of them, and none fails a publish check now
|
| 3042 |
+
- cfpb-complaints: refused
|
| 3043 |
+
- data-gov-uk-workbooks: changed pointer group file data/data-gov-uk-workbooks/2026-10-a-spreadsheets-with-answers/part-00000.parquet: 4 key(s) of the old version are in no data file of source data-gov-uk-workbooks after the commit (row 5 from batch 2026-10-a-spreadsheets-with-answers, row 6 from batch 2026-10-a-spreadsheets-with-answers, row 12 from batch 2026-10-a-spreadsheets-with-answers, 1 more); the removal record holds none of them, and none fails a publish check now
|
| 3044 |
+
- data-gov-uk-workbooks-noassertion: changed pointer group file data/data-gov-uk-workbooks-noassertion/2026-10-a-spreadsheets-with-answers/part-00000.parquet: 1 key(s) of the old version are in no data file of source data-gov-uk-workbooks-noassertion after the commit (row 6 from batch 2026-10-a-spreadsheets-with-answers); the removal record holds none of them, and none fails a publish check now
|
| 3045 |
+
- dataversenl-workbooks-cc-by: changed pointer group file data/dataversenl-workbooks-cc-by/2026-10-a-spreadsheets-with-answers/part-00000.parquet: 1 key(s) of the old version are in no data file of source dataversenl-workbooks-cc-by after the commit (row 17 from batch 2026-10-a-spreadsheets-with-answers); the removal record holds none of them, and none fails a publish check now
|
| 3046 |
+
- dataversenl-workbooks-cc0: changed pointer group file data/dataversenl-workbooks-cc0/2026-10-a-spreadsheets-with-answers/part-00000.parquet: 3 key(s) of the old version are in no data file of source dataversenl-workbooks-cc0 after the commit (row 7 from batch 2026-10-a-spreadsheets-with-answers, row 13 from batch 2026-10-a-spreadsheets-with-answers, row 16 from batch 2026-10-a-spreadsheets-with-answers); the removal record holds none of them, and none fails a publish check now
|
| 3047 |
+
- dvn-fvhlgg-repro: changed pointer group file data/dvn-fvhlgg-repro/2026-10-c-repros/part-00000.parquet: 3 key(s) of the old version are in no data file of source dvn-fvhlgg-repro after the commit (row 5 from batch 2026-10-c-repros, row 7 from batch 2026-10-c-repros, row 16 from batch 2026-10-c-repros); the removal record holds none of them, and none fails a publish check now
|
| 3048 |
+
- eu-institution-workbooks-cc-by: changed pointer group file data/eu-institution-workbooks-cc-by/2026-10-a-spreadsheets-with-answers/part-00000.parquet: 3 key(s) of the old version are in no data file of source eu-institution-workbooks-cc-by after the commit (row 2 from batch 2026-10-a-spreadsheets-with-answers, row 4 from batch 2026-10-a-spreadsheets-with-answers, row 5 from batch 2026-10-a-spreadsheets-with-answers); the removal record holds none of them, and none fails a publish check now
|
| 3049 |
+
- hf-training-records: refused
|
| 3050 |
+
- npm: refused
|
| 3051 |
+
- stackexchange-api-posts: refused
|
README.md
CHANGED
|
@@ -24,25 +24,25 @@ configs:
|
|
| 24 |
<!-- artifact-pointer-layout: v2 -->
|
| 25 |
<!-- Generated by artpool.index_projection from meta/, cards/*.yaml, the field registry and its templates. Every release regenerates it, so edits to this file do not last. -->
|
| 26 |
|
| 27 |
-
<img class="not-prose" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 28 |
|
| 29 |
**Agentic Env Index:** find public files to build agent tasks and environments from, and fetch them with one command.
|
| 30 |
|
| 31 |
English | [简体中文](README.zh.md) · [Data page](https://huggingface.co/spaces/Battam/agentic-env-catalog) · [Usage video](https://huggingface.co/spaces/Battam/agentic-env-catalog#usage-video)
|
| 32 |
|
| 33 |
<picture class="not-prose">
|
| 34 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 35 |
-
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 36 |
</picture>
|
| 37 |
<picture class="not-prose">
|
| 38 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 39 |
-
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 40 |
</picture>
|
| 41 |
|
| 42 |
## Get data in one command
|
| 43 |
|
| 44 |
```sh
|
| 45 |
-
uv run https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 46 |
```
|
| 47 |
|
| 48 |
This fetches 3 units of every spreadsheet material set into `./data`, one folder per unit, and checks each file against the size and hashes its row records.
|
|
@@ -52,7 +52,7 @@ the same command takes the same units of this release.
|
|
| 52 |
<details>
|
| 53 |
<summary>What the command takes, and in which order</summary>
|
| 54 |
|
| 55 |
-
The command and the queries below are pinned to the release tag `release-2026-11-11.
|
| 56 |
[uv](https://docs.astral.sh/uv/) reads the script's dependencies, at the versions published before the day of this release.
|
| 57 |
|
| 58 |
The command returns units: 3 units from each material set whose form is `spreadsheets`, each in a folder of its own named after its `unit_id`.
|
|
@@ -79,7 +79,7 @@ Choose material sets from the catalog with [DuckDB](https://duckdb.org/):
|
|
| 79 |
|
| 80 |
```sql
|
| 81 |
SELECT source, collection, title, units, files, top_types, license.tier AS license_tier, needs_auth
|
| 82 |
-
FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 83 |
WHERE kind = 'material_set' AND needs_auth = 'no' AND license.tier IN ('permissive', 'share-alike')
|
| 84 |
ORDER BY collection, units DESC;
|
| 85 |
```
|
|
@@ -90,7 +90,7 @@ with `kind = 'corpus'` it returns corpora instead, counted in rows (`files`).
|
|
| 90 |
Choose files in one corpus:
|
| 91 |
|
| 92 |
```sql
|
| 93 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 94 |
SELECT uri, size_bytes, lower(hex(sha256)) AS sha256
|
| 95 |
FROM read_parquet(getvariable('files'))
|
| 96 |
WHERE source = 'if-archive' AND ext = 'pdf' AND size_bytes BETWEEN 100000 AND 5000000
|
|
@@ -112,12 +112,12 @@ A data file may hold the rows of several sources, so the query keeps this one's
|
|
| 112 |
### Task material: units by collection
|
| 113 |
|
| 114 |
<picture class="not-prose">
|
| 115 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 116 |
-
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 117 |
</picture>
|
| 118 |
<picture class="not-prose">
|
| 119 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 120 |
-
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 121 |
</picture>
|
| 122 |
|
| 123 |
1,799 material sets with 4,183 units, in 14 collections (1 of them with no material set yet); 1 of the material sets are in no collection.
|
|
@@ -129,7 +129,7 @@ A data file may hold the rows of several sources, so the query keeps this one's
|
|
| 129 |
|---|---:|---:|---:|---:|---:|---:|
|
| 130 |
| Spreadsheets | 67 | 536 | 670 | 55 | 250 MB | 248 MB |
|
| 131 |
| Disk images | 52 | 179 | 324 | 40 | 272 MB | 272 MB |
|
| 132 |
-
| Reproduction packages and runs | 88 | 105 |
|
| 133 |
| SEC filing reviews | 0 | 0 | 0 | 0 | 0 B | 0 B |
|
| 134 |
| Solver instances | 63 | 187 | 325 | 60 | 127 MB | 127 MB |
|
| 135 |
| Browser tests | 123 | 439 | 852 | 88 | 32.1 MB | 32.0 MB |
|
|
@@ -150,12 +150,12 @@ Upstreams are the upstream works the material sets of a collection come from.
|
|
| 150 |
### Corpora: rows by main domain
|
| 151 |
|
| 152 |
<picture class="not-prose">
|
| 153 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 154 |
-
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 155 |
</picture>
|
| 156 |
<picture class="not-prose">
|
| 157 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 158 |
-
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 159 |
</picture>
|
| 160 |
|
| 161 |
139 corpora with 1,216,362,128 rows.
|
|
@@ -188,12 +188,12 @@ Every material set and every corpus, with its counts, size, license tier and log
|
|
| 188 |
## How it is made
|
| 189 |
|
| 190 |
<picture class="not-prose">
|
| 191 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 192 |
-
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 193 |
</picture>
|
| 194 |
<picture class="not-prose">
|
| 195 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 196 |
-
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 197 |
</picture>
|
| 198 |
|
| 199 |
The terms, each step and how every number is made are folded below.
|
|
@@ -247,9 +247,9 @@ only their sizes add up to the size of the whole index.
|
|
| 247 |
|
| 248 |
| Level | Recorded size | Deduplicated size | Rows read | Rows compared | Rows that match | Rows read, not compared | Rows without a recorded size | Their estimated size |
|
| 249 |
|---|---:|---:|---:|---:|---:|---:|---:|---:|
|
| 250 |
-
| Whole index | 4.45 PB | 4.11 PB | 38,
|
| 251 |
| Corpora | 4.45 PB | 4.11 PB | 31,594 | 30,723 | 30,610 (99.6%) | 871: address unreachable 449, file gone 80, login needed 322, no size from the server 19, other error 1 | 312,300,338 | 202 TB, an estimate (95% range 171 TB to 245 TB), for 215,326,513 of them, from 14,161 rows read |
|
| 252 |
-
| Task material | 2.89 GB | 2.82 GB | 6,
|
| 253 |
|
| 254 |
Rows read are the sample of rows the check reads in `meta/sizes.parquet`;
|
| 255 |
a row compared matched its recorded size or did not, and a row read but not compared never reached its file.
|
|
@@ -444,9 +444,9 @@ Every row field and every column of the catalog: [`docs/fields.md`](docs/fields.
|
|
| 444 |
<details>
|
| 445 |
<summary>Releases</summary>
|
| 446 |
|
| 447 |
-
- Latest release: `release-2026-11-11.
|
| 448 |
- Releases are listed in [CHANGELOG.md](CHANGELOG.md);
|
| 449 |
-
each one is a commit with its own release tag (this one is [`release-2026-11-11.
|
| 450 |
so any earlier state stays readable at its tag.
|
| 451 |
- `meta/projection.json` records the release tag and the version of the program and templates that generated this card.
|
| 452 |
- Croissant metadata: [generated by the Hub](https://huggingface.co/api/datasets/Battam/agentic-env-index/croissant);
|
|
@@ -479,7 +479,7 @@ A removal covers the current version of this repository (the main branch) and th
|
|
| 479 |
@misc{agentic_env_index,
|
| 480 |
title = {agentic-env-index: an index of public materials for building agent environments},
|
| 481 |
howpublished = {https://huggingface.co/datasets/Battam/agentic-env-index},
|
| 482 |
-
note = {Release release-2026-11-11.
|
| 483 |
year = {2026}
|
| 484 |
}
|
| 485 |
```
|
|
|
|
| 24 |
<!-- artifact-pointer-layout: v2 -->
|
| 25 |
<!-- Generated by artpool.index_projection from meta/, cards/*.yaml, the field registry and its templates. Every release regenerates it, so edits to this file do not last. -->
|
| 26 |
|
| 27 |
+
<img class="not-prose" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/banner.svg" alt="Public web, in two layers (task material in collections; corpora), one row per file (address, size, SHA-256, license), your selection, fetched and verified">
|
| 28 |
|
| 29 |
**Agentic Env Index:** find public files to build agent tasks and environments from, and fetch them with one command.
|
| 30 |
|
| 31 |
English | [简体中文](README.zh.md) · [Data page](https://huggingface.co/spaces/Battam/agentic-env-catalog) · [Usage video](https://huggingface.co/spaces/Battam/agentic-env-catalog#usage-video)
|
| 32 |
|
| 33 |
<picture class="not-prose">
|
| 34 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/numbers-narrow-light.svg">
|
| 35 |
+
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/numbers-wide-light.svg" alt="1,799 material sets with 4,183 units in 14 collections; 139 corpora with 1,216,362,128 rows; 4.45 PB pointed to, as the index holds addresses, not copies; 99.7% of the 37,509 rows compared match their recorded size.">
|
| 36 |
</picture>
|
| 37 |
<picture class="not-prose">
|
| 38 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/numbers-narrow-dark.svg">
|
| 39 |
+
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/numbers-wide-dark.svg" alt="1,799 material sets with 4,183 units in 14 collections; 139 corpora with 1,216,362,128 rows; 4.45 PB pointed to, as the index holds addresses, not copies; 99.7% of the 37,509 rows compared match their recorded size.">
|
| 40 |
</picture>
|
| 41 |
|
| 42 |
## Get data in one command
|
| 43 |
|
| 44 |
```sh
|
| 45 |
+
uv run https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/tools/fetch.py --form spreadsheets --sample 3 --out ./data
|
| 46 |
```
|
| 47 |
|
| 48 |
This fetches 3 units of every spreadsheet material set into `./data`, one folder per unit, and checks each file against the size and hashes its row records.
|
|
|
|
| 52 |
<details>
|
| 53 |
<summary>What the command takes, and in which order</summary>
|
| 54 |
|
| 55 |
+
The command and the queries below are pinned to the release tag `release-2026-11-11.6`.
|
| 56 |
[uv](https://docs.astral.sh/uv/) reads the script's dependencies, at the versions published before the day of this release.
|
| 57 |
|
| 58 |
The command returns units: 3 units from each material set whose form is `spreadsheets`, each in a folder of its own named after its `unit_id`.
|
|
|
|
| 79 |
|
| 80 |
```sql
|
| 81 |
SELECT source, collection, title, units, files, top_types, license.tier AS license_tier, needs_auth
|
| 82 |
+
FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet'
|
| 83 |
WHERE kind = 'material_set' AND needs_auth = 'no' AND license.tier IN ('permissive', 'share-alike')
|
| 84 |
ORDER BY collection, units DESC;
|
| 85 |
```
|
|
|
|
| 90 |
Choose files in one corpus:
|
| 91 |
|
| 92 |
```sql
|
| 93 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'if-archive'));
|
| 94 |
SELECT uri, size_bytes, lower(hex(sha256)) AS sha256
|
| 95 |
FROM read_parquet(getvariable('files'))
|
| 96 |
WHERE source = 'if-archive' AND ext = 'pdf' AND size_bytes BETWEEN 100000 AND 5000000
|
|
|
|
| 112 |
### Task material: units by collection
|
| 113 |
|
| 114 |
<picture class="not-prose">
|
| 115 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/material-narrow-light.svg">
|
| 116 |
+
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/material-wide-light.svg" alt="Units by collection, longest bar first: Spreadsheets 536; Browser tests 439; Tests and exercises 425; Model serving configurations 397; Media and documents 391; Science reference data 342; Rule calculations 329; Security detection 328; Hardware design (EDA) tests 258; Issue trackers 258; Solver instances 187; Disk images 179; Reproduction packages and runs 105; In no collection 9; SEC filing reviews 0.">
|
| 117 |
</picture>
|
| 118 |
<picture class="not-prose">
|
| 119 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/material-narrow-dark.svg">
|
| 120 |
+
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/material-wide-dark.svg" alt="Units by collection, longest bar first: Spreadsheets 536; Browser tests 439; Tests and exercises 425; Model serving configurations 397; Media and documents 391; Science reference data 342; Rule calculations 329; Security detection 328; Hardware design (EDA) tests 258; Issue trackers 258; Solver instances 187; Disk images 179; Reproduction packages and runs 105; In no collection 9; SEC filing reviews 0.">
|
| 121 |
</picture>
|
| 122 |
|
| 123 |
1,799 material sets with 4,183 units, in 14 collections (1 of them with no material set yet); 1 of the material sets are in no collection.
|
|
|
|
| 129 |
|---|---:|---:|---:|---:|---:|---:|
|
| 130 |
| Spreadsheets | 67 | 536 | 670 | 55 | 250 MB | 248 MB |
|
| 131 |
| Disk images | 52 | 179 | 324 | 40 | 272 MB | 272 MB |
|
| 132 |
+
| Reproduction packages and runs | 88 | 105 | 863 | 88 | 118 MB | 118 MB |
|
| 133 |
| SEC filing reviews | 0 | 0 | 0 | 0 | 0 B | 0 B |
|
| 134 |
| Solver instances | 63 | 187 | 325 | 60 | 127 MB | 127 MB |
|
| 135 |
| Browser tests | 123 | 439 | 852 | 88 | 32.1 MB | 32.0 MB |
|
|
|
|
| 150 |
### Corpora: rows by main domain
|
| 151 |
|
| 152 |
<picture class="not-prose">
|
| 153 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/corpora-narrow-light.svg">
|
| 154 |
+
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/corpora-wide-light.svg" alt="Corpus rows by main domain, longest bar first: Data science 750,815,212; System administration 185,826,217; Many domains 109,262,742; Software engineering 45,267,701; Science 44,633,675; Operations 39,404,642; Media 12,751,612; Machine learning 9,636,889; Hardware 8,716,520; Unclassified 5,284,162; Security 4,521,631; Misc 241,125.">
|
| 155 |
</picture>
|
| 156 |
<picture class="not-prose">
|
| 157 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/corpora-narrow-dark.svg">
|
| 158 |
+
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/corpora-wide-dark.svg" alt="Corpus rows by main domain, longest bar first: Data science 750,815,212; System administration 185,826,217; Many domains 109,262,742; Software engineering 45,267,701; Science 44,633,675; Operations 39,404,642; Media 12,751,612; Machine learning 9,636,889; Hardware 8,716,520; Unclassified 5,284,162; Security 4,521,631; Misc 241,125.">
|
| 159 |
</picture>
|
| 160 |
|
| 161 |
139 corpora with 1,216,362,128 rows.
|
|
|
|
| 188 |
## How it is made
|
| 189 |
|
| 190 |
<picture class="not-prose">
|
| 191 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/steps-narrow-light.svg">
|
| 192 |
+
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/steps-wide-light.svg" alt="How the index is made, in four steps. 1, collect: collectors read whole upstreams into corpora, one row per file or record. 2, admit: works the search found upstream and groups of corpus rows become material sets. 3, check: licenses, personal data, overlap with benchmarks and sizes are checked before release. 4, release: one commit with its own tag, release-2026-11-11.6.">
|
| 193 |
</picture>
|
| 194 |
<picture class="not-prose">
|
| 195 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/steps-narrow-dark.svg">
|
| 196 |
+
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/steps-wide-dark.svg" alt="How the index is made, in four steps. 1, collect: collectors read whole upstreams into corpora, one row per file or record. 2, admit: works the search found upstream and groups of corpus rows become material sets. 3, check: licenses, personal data, overlap with benchmarks and sizes are checked before release. 4, release: one commit with its own tag, release-2026-11-11.6.">
|
| 197 |
</picture>
|
| 198 |
|
| 199 |
The terms, each step and how every number is made are folded below.
|
|
|
|
| 247 |
|
| 248 |
| Level | Recorded size | Deduplicated size | Rows read | Rows compared | Rows that match | Rows read, not compared | Rows without a recorded size | Their estimated size |
|
| 249 |
|---|---:|---:|---:|---:|---:|---:|---:|---:|
|
| 250 |
+
| Whole index | 4.45 PB | 4.11 PB | 38,394 | 37,509 | 37,378 (99.7%) | 885: address unreachable 451, file gone 82, login needed 330, no size from the server 19, other error 3 | 312,300,338 | 202 TB, an estimate (95% range 171 TB to 245 TB), for 215,326,513 of them, from 14,161 rows read |
|
| 251 |
| Corpora | 4.45 PB | 4.11 PB | 31,594 | 30,723 | 30,610 (99.6%) | 871: address unreachable 449, file gone 80, login needed 322, no size from the server 19, other error 1 | 312,300,338 | 202 TB, an estimate (95% range 171 TB to 245 TB), for 215,326,513 of them, from 14,161 rows read |
|
| 252 |
+
| Task material | 2.89 GB | 2.82 GB | 6,800 | 6,786 | 6,768 (99.7%) | 14: address unreachable 2, file gone 2, login needed 8, other error 2 | 0 | none |
|
| 253 |
|
| 254 |
Rows read are the sample of rows the check reads in `meta/sizes.parquet`;
|
| 255 |
a row compared matched its recorded size or did not, and a row read but not compared never reached its file.
|
|
|
|
| 444 |
<details>
|
| 445 |
<summary>Releases</summary>
|
| 446 |
|
| 447 |
+
- Latest release: `release-2026-11-11.6` (its newest CHANGELOG entry is dated 2026-11-11).
|
| 448 |
- Releases are listed in [CHANGELOG.md](CHANGELOG.md);
|
| 449 |
+
each one is a commit with its own release tag (this one is [`release-2026-11-11.6`](https://huggingface.co/datasets/Battam/agentic-env-index/tree/release-2026-11-11.6)),
|
| 450 |
so any earlier state stays readable at its tag.
|
| 451 |
- `meta/projection.json` records the release tag and the version of the program and templates that generated this card.
|
| 452 |
- Croissant metadata: [generated by the Hub](https://huggingface.co/api/datasets/Battam/agentic-env-index/croissant);
|
|
|
|
| 479 |
@misc{agentic_env_index,
|
| 480 |
title = {agentic-env-index: an index of public materials for building agent environments},
|
| 481 |
howpublished = {https://huggingface.co/datasets/Battam/agentic-env-index},
|
| 482 |
+
note = {Release release-2026-11-11.6},
|
| 483 |
year = {2026}
|
| 484 |
}
|
| 485 |
```
|
README.zh.md
CHANGED
|
@@ -11,25 +11,25 @@ tags:
|
|
| 11 |
---
|
| 12 |
<!-- Generated by artpool.index_projection from meta/, cards/*.yaml, the field registry and its templates. Every release regenerates it, so edits to this file do not last. -->
|
| 13 |
|
| 14 |
-
<img class="not-prose" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 15 |
|
| 16 |
**Agentic Env Index:**在这里找到可以用来构建智能体任务和环境的公开文件,并用一条命令把它们取下来。
|
| 17 |
|
| 18 |
[English](README.md) | 简体中文 · [数据页](https://huggingface.co/spaces/Battam/agentic-env-catalog) · [使用示例视频](https://huggingface.co/spaces/Battam/agentic-env-catalog#usage-video)
|
| 19 |
|
| 20 |
<picture class="not-prose">
|
| 21 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 22 |
-
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 23 |
</picture>
|
| 24 |
<picture class="not-prose">
|
| 25 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 26 |
-
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 27 |
</picture>
|
| 28 |
|
| 29 |
## 一条命令取数据
|
| 30 |
|
| 31 |
```sh
|
| 32 |
-
uv run https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 33 |
```
|
| 34 |
|
| 35 |
这条命令从每个电子表格材料集各取 3 个单元放进 `./data`,每个单元一个文件夹,并按每个文件所在行记录的大小和哈希值校验它。
|
|
@@ -39,7 +39,7 @@ uv run https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-
|
|
| 39 |
<details>
|
| 40 |
<summary>命令取什么、按什么顺序取</summary>
|
| 41 |
|
| 42 |
-
这条命令和下面的查询都固定在发布标签 `release-2026-11-11.
|
| 43 |
[uv](https://docs.astral.sh/uv/) 会读取脚本声明的依赖,取这个发布当天之前发布的版本。
|
| 44 |
|
| 45 |
命令返回单元:形式为 `spreadsheets` 的每个材料集各 3 个单元,每个单元放在以它的 `unit_id` 命名的单独文件夹里。
|
|
@@ -66,7 +66,7 @@ uv run https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-
|
|
| 66 |
|
| 67 |
```sql
|
| 68 |
SELECT source, collection, title, units, files, top_types, license.tier AS license_tier, needs_auth
|
| 69 |
-
FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 70 |
WHERE kind = 'material_set' AND needs_auth = 'no' AND license.tier IN ('permissive', 'share-alike')
|
| 71 |
ORDER BY collection, units DESC;
|
| 72 |
```
|
|
@@ -77,7 +77,7 @@ ORDER BY collection, units DESC;
|
|
| 77 |
在一个语料库里挑选文件:
|
| 78 |
|
| 79 |
```sql
|
| 80 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 81 |
SELECT uri, size_bytes, lower(hex(sha256)) AS sha256
|
| 82 |
FROM read_parquet(getvariable('files'))
|
| 83 |
WHERE source = 'if-archive' AND ext = 'pdf' AND size_bytes BETWEEN 100000 AND 5000000
|
|
@@ -99,12 +99,12 @@ ORDER BY size_bytes LIMIT 20;
|
|
| 99 |
### 任务材料:按合集的单元数
|
| 100 |
|
| 101 |
<picture class="not-prose">
|
| 102 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 103 |
-
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 104 |
</picture>
|
| 105 |
<picture class="not-prose">
|
| 106 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 107 |
-
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 108 |
</picture>
|
| 109 |
|
| 110 |
1,799 个材料集,共 4,183 个单元,分在 14 个合集中(其中 1 个合集还没有材料集);其中 1 个材料集不属于任何合集。
|
|
@@ -116,7 +116,7 @@ ORDER BY size_bytes LIMIT 20;
|
|
| 116 |
|---|---:|---:|---:|---:|---:|---:|
|
| 117 |
| 电子表格 | 67 | 536 | 670 | 55 | 250 MB | 248 MB |
|
| 118 |
| 磁盘镜像 | 52 | 179 | 324 | 40 | 272 MB | 272 MB |
|
| 119 |
-
| 复现包和运行 | 88 | 105 |
|
| 120 |
| SEC 申报审查 | 0 | 0 | 0 | 0 | 0 B | 0 B |
|
| 121 |
| 求解器实例 | 63 | 187 | 325 | 60 | 127 MB | 127 MB |
|
| 122 |
| 浏览器测试 | 123 | 439 | 852 | 88 | 32.1 MB | 32.0 MB |
|
|
@@ -137,12 +137,12 @@ ORDER BY size_bytes LIMIT 20;
|
|
| 137 |
### 语料库:按主要领域的行数
|
| 138 |
|
| 139 |
<picture class="not-prose">
|
| 140 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 141 |
-
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 142 |
</picture>
|
| 143 |
<picture class="not-prose">
|
| 144 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 145 |
-
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 146 |
</picture>
|
| 147 |
|
| 148 |
139 个语料库,共 1,216,362,128 行。
|
|
@@ -175,12 +175,12 @@ ORDER BY size_bytes LIMIT 20;
|
|
| 175 |
## 怎样做成
|
| 176 |
|
| 177 |
<picture class="not-prose">
|
| 178 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 179 |
-
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 180 |
</picture>
|
| 181 |
<picture class="not-prose">
|
| 182 |
-
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 183 |
-
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.
|
| 184 |
</picture>
|
| 185 |
|
| 186 |
术语、每一步,以及每个数字怎样得出,都折叠在下面。
|
|
@@ -234,9 +234,9 @@ ORDER BY size_bytes LIMIT 20;
|
|
| 234 |
|
| 235 |
| 层级 | 记录的大小 | 去重后大小 | 读过的行 | 比对过的行 | 一致的行 | 读过但未比对的行 | 没有记录大小的行 | 这些行的估计大小 |
|
| 236 |
|---|---:|---:|---:|---:|---:|---:|---:|---:|
|
| 237 |
-
| 整个索引 | 4.45 PB | 4.11 PB | 38,
|
| 238 |
| 语料库 | 4.45 PB | 4.11 PB | 31,594 | 30,723 | 30,610(99.6%) | 871:地址无法访问 449 行、文件已不存在 80 行、需要登录 322 行、服务器未给出大小 19 行、其他错误 1 行 | 312,300,338 | 202 TB,这是估计值(95% 范围 171 TB 到 245 TB),针对其中 215,326,513 行,依据读过的 14,161 行 |
|
| 239 |
-
| 任务材料 | 2.89 GB | 2.82 GB | 6,
|
| 240 |
|
| 241 |
读过的行是核对在 `meta/sizes.parquet` 中读取的抽样行;
|
| 242 |
比对过的行与记录的大小一致或不一致,读过但未比对的行没有取到它的文件。
|
|
@@ -433,9 +433,9 @@ ORDER BY size_bytes LIMIT 20;
|
|
| 433 |
<details>
|
| 434 |
<summary>发布</summary>
|
| 435 |
|
| 436 |
-
- 最新发布:`release-2026-11-11.
|
| 437 |
- 各次发布列在 [CHANGELOG.md](CHANGELOG.md) 中;
|
| 438 |
-
每次发布是一个带有自己发布标签的提交(本次为 [`release-2026-11-11.
|
| 439 |
因此任何较早的状态都可以在它的标签处读到。
|
| 440 |
- `meta/projection.json` 记录发布标签,以及生成本卡片的程序和模板的版本。
|
| 441 |
- Croissant 元数据:[由 Hub 生成](https://huggingface.co/api/datasets/Battam/agentic-env-index/croissant);
|
|
@@ -476,7 +476,7 @@ ORDER BY size_bytes LIMIT 20;
|
|
| 476 |
@misc{agentic_env_index,
|
| 477 |
title = {agentic-env-index: an index of public materials for building agent environments},
|
| 478 |
howpublished = {https://huggingface.co/datasets/Battam/agentic-env-index},
|
| 479 |
-
note = {Release release-2026-11-11.
|
| 480 |
year = {2026}
|
| 481 |
}
|
| 482 |
```
|
|
|
|
| 11 |
---
|
| 12 |
<!-- Generated by artpool.index_projection from meta/, cards/*.yaml, the field registry and its templates. Every release regenerates it, so edits to this file do not last. -->
|
| 13 |
|
| 14 |
+
<img class="not-prose" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/banner.zh.svg" alt="公开网络,分两层(按合集的任务材料;语料库),每个文件一行(地址、大小、SHA-256、许可证),你的选择,下载并校验">
|
| 15 |
|
| 16 |
**Agentic Env Index:**在这里找到可以用来构建智能体任务和环境的公开文件,并用一条命令把它们取下来。
|
| 17 |
|
| 18 |
[English](README.md) | 简体中文 · [数据页](https://huggingface.co/spaces/Battam/agentic-env-catalog) · [使用示例视频](https://huggingface.co/spaces/Battam/agentic-env-catalog#usage-video)
|
| 19 |
|
| 20 |
<picture class="not-prose">
|
| 21 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/numbers-narrow-light.zh.svg">
|
| 22 |
+
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/numbers-wide-light.zh.svg" alt="1,799 个材料集,共 4,183 个单元,分在 14 个合集;139 个语料库,共 1,216,362,128 行;指向的大小共 4.45 PB,索引存的是地址,不是文件副本;比对过的 37,509 行中,99.7% 与记录的大小一致。">
|
| 23 |
</picture>
|
| 24 |
<picture class="not-prose">
|
| 25 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/numbers-narrow-dark.zh.svg">
|
| 26 |
+
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/numbers-wide-dark.zh.svg" alt="1,799 个材料集,共 4,183 个单元,分在 14 个合集;139 个语料库,共 1,216,362,128 行;指向的大小共 4.45 PB,索引存的是地址,不是文件副本;比对过的 37,509 行中,99.7% 与记录的大小一致。">
|
| 27 |
</picture>
|
| 28 |
|
| 29 |
## 一条命令取数据
|
| 30 |
|
| 31 |
```sh
|
| 32 |
+
uv run https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/tools/fetch.py --form spreadsheets --sample 3 --out ./data
|
| 33 |
```
|
| 34 |
|
| 35 |
这条命令从每个电子表格材料集各取 3 个单元放进 `./data`,每个单元一个文件夹,并按每个文件所在行记录的大小和哈希值校验它。
|
|
|
|
| 39 |
<details>
|
| 40 |
<summary>命令取什么、按什么顺序取</summary>
|
| 41 |
|
| 42 |
+
这条命令和下面的查询都固定在发布标签 `release-2026-11-11.6` 上。
|
| 43 |
[uv](https://docs.astral.sh/uv/) 会读取脚本声明的依赖,取这个发布当天之前发布的版本。
|
| 44 |
|
| 45 |
命令返回单元:形式为 `spreadsheets` 的每个材料集各 3 个单元,每个单元放在以它的 `unit_id` 命名的单独文件夹里。
|
|
|
|
| 66 |
|
| 67 |
```sql
|
| 68 |
SELECT source, collection, title, units, files, top_types, license.tier AS license_tier, needs_auth
|
| 69 |
+
FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet'
|
| 70 |
WHERE kind = 'material_set' AND needs_auth = 'no' AND license.tier IN ('permissive', 'share-alike')
|
| 71 |
ORDER BY collection, units DESC;
|
| 72 |
```
|
|
|
|
| 77 |
在一个语料库里挑选文件:
|
| 78 |
|
| 79 |
```sql
|
| 80 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'if-archive'));
|
| 81 |
SELECT uri, size_bytes, lower(hex(sha256)) AS sha256
|
| 82 |
FROM read_parquet(getvariable('files'))
|
| 83 |
WHERE source = 'if-archive' AND ext = 'pdf' AND size_bytes BETWEEN 100000 AND 5000000
|
|
|
|
| 99 |
### 任务材料:按合集的单元数
|
| 100 |
|
| 101 |
<picture class="not-prose">
|
| 102 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/material-narrow-light.zh.svg">
|
| 103 |
+
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/material-wide-light.zh.svg" alt="按合集的单元数,条形由长到短:电子表格 536;浏览器测试 439;测试和练习 425;模型服务配置 397;媒体和文档 391;科学参考数据 342;规则计算 329;安全检测 328;硬件设计(EDA)测试 258;问题跟踪系统 258;求解器实例 187;磁盘镜像 179;复现包和运行 105;不属于任何合集 9;SEC 申报审查 0。">
|
| 104 |
</picture>
|
| 105 |
<picture class="not-prose">
|
| 106 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/material-narrow-dark.zh.svg">
|
| 107 |
+
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/material-wide-dark.zh.svg" alt="按合集的单元数,条形由长到短:电子表格 536;浏览器测试 439;测试和练习 425;模型服务配置 397;媒体和文档 391;科学参考数据 342;规则计算 329;安全检测 328;硬件设计(EDA)测试 258;问题跟踪系统 258;求解器实例 187;磁盘镜像 179;复现包和运行 105;不属于任何合集 9;SEC 申报审查 0。">
|
| 108 |
</picture>
|
| 109 |
|
| 110 |
1,799 个材料集,共 4,183 个单元,分在 14 个合集中(其中 1 个合集还没有材料集);其中 1 个材料集不属于任何合集。
|
|
|
|
| 116 |
|---|---:|---:|---:|---:|---:|---:|
|
| 117 |
| 电子表格 | 67 | 536 | 670 | 55 | 250 MB | 248 MB |
|
| 118 |
| 磁盘镜像 | 52 | 179 | 324 | 40 | 272 MB | 272 MB |
|
| 119 |
+
| 复现包和运行 | 88 | 105 | 863 | 88 | 118 MB | 118 MB |
|
| 120 |
| SEC 申报审查 | 0 | 0 | 0 | 0 | 0 B | 0 B |
|
| 121 |
| 求解器实例 | 63 | 187 | 325 | 60 | 127 MB | 127 MB |
|
| 122 |
| 浏览器测试 | 123 | 439 | 852 | 88 | 32.1 MB | 32.0 MB |
|
|
|
|
| 137 |
### 语料库:按主要领域的行数
|
| 138 |
|
| 139 |
<picture class="not-prose">
|
| 140 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/corpora-narrow-light.zh.svg">
|
| 141 |
+
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/corpora-wide-light.zh.svg" alt="按主要领域的语料库行数,条形由长到短:数据科学 750,815,212;系统管理 185,826,217;多领域 109,262,742;软件工程 45,267,701;科学 44,633,675;运营 39,404,642;媒体 12,751,612;机器学习 9,636,889;硬件 8,716,520;未分类 5,284,162;安全 4,521,631;杂项 241,125。">
|
| 142 |
</picture>
|
| 143 |
<picture class="not-prose">
|
| 144 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/corpora-narrow-dark.zh.svg">
|
| 145 |
+
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/corpora-wide-dark.zh.svg" alt="按主要领域的语料库行数,条形由长到短:数据科学 750,815,212;系统管理 185,826,217;多领域 109,262,742;软件工程 45,267,701;科学 44,633,675;运营 39,404,642;媒体 12,751,612;机器学习 9,636,889;硬件 8,716,520;未分类 5,284,162;安全 4,521,631;杂项 241,125。">
|
| 146 |
</picture>
|
| 147 |
|
| 148 |
139 个语料库,共 1,216,362,128 行。
|
|
|
|
| 175 |
## 怎样做成
|
| 176 |
|
| 177 |
<picture class="not-prose">
|
| 178 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/steps-narrow-light.zh.svg">
|
| 179 |
+
<img class="not-prose dark:hidden" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/steps-wide-light.zh.svg" alt="索引分四步做成。1,采集:采集器整批读取完整上游,每个文件或每条记录记一行,成为语料库。2,收录:检索在上游找到的作品和成组的语料库行,收录为材料集。3,检查:发布前核对许可证、个人信息、与基准测试的重叠和大小。4,发布:一个带有自己标签的提交,release-2026-11-11.6。">
|
| 180 |
</picture>
|
| 181 |
<picture class="not-prose">
|
| 182 |
+
<source media="(max-width: 1023px)" srcset="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/steps-narrow-dark.zh.svg">
|
| 183 |
+
<img class="not-prose hidden dark:block" src="https://huggingface.co/datasets/Battam/agentic-env-index/resolve/release-2026-11-11.6/docs/figures/steps-wide-dark.zh.svg" alt="索引分四步做成。1,采集:采集器整批读取完整上游,每个文件或每条记录记一行,成为语料库。2,收录:检索在上游找到的作品和成组的语料库行,收录为材料集。3,检查:发布前核对许可证、个人信息、与基准测试的重叠和大小。4,发布:一个带有自己标签的提交,release-2026-11-11.6。">
|
| 184 |
</picture>
|
| 185 |
|
| 186 |
术语、每一步,以及每个数字怎样得出,都折叠在下面。
|
|
|
|
| 234 |
|
| 235 |
| 层级 | 记录的大小 | 去重后大小 | 读过的行 | 比对过的行 | 一致的行 | 读过但未比对的行 | 没有记录大小的行 | 这些行的估计大小 |
|
| 236 |
|---|---:|---:|---:|---:|---:|---:|---:|---:|
|
| 237 |
+
| 整个索引 | 4.45 PB | 4.11 PB | 38,394 | 37,509 | 37,378(99.7%) | 885:地址无法访问 451 行、文件已不存在 82 行、需要登录 330 行、服务器未给出大小 19 行、其他错误 3 行 | 312,300,338 | 202 TB,这是估计值(95% 范围 171 TB 到 245 TB),针对其中 215,326,513 行,依据读过的 14,161 行 |
|
| 238 |
| 语料库 | 4.45 PB | 4.11 PB | 31,594 | 30,723 | 30,610(99.6%) | 871:地址无法访问 449 行、文件已不存在 80 行、需要登录 322 行、服务器未给出大小 19 行、其他错误 1 行 | 312,300,338 | 202 TB,这是估计值(95% 范围 171 TB 到 245 TB),针对其中 215,326,513 行,依据读过的 14,161 行 |
|
| 239 |
+
| 任务材料 | 2.89 GB | 2.82 GB | 6,800 | 6,786 | 6,768(99.7%) | 14:地址无法访问 2 行、文件已不存在 2 行、需要登录 8 行、其他错误 2 行 | 0 | 无 |
|
| 240 |
|
| 241 |
读过的行是核对在 `meta/sizes.parquet` 中读取的抽样行;
|
| 242 |
比对过的行与记录的大小一致或不一致,读过但未比对的行没有取到它的文件。
|
|
|
|
| 433 |
<details>
|
| 434 |
<summary>发布</summary>
|
| 435 |
|
| 436 |
+
- 最新发布:`release-2026-11-11.6`(其最新的 CHANGELOG 条目日期为 2026-11-11)。
|
| 437 |
- 各次发布列在 [CHANGELOG.md](CHANGELOG.md) 中;
|
| 438 |
+
每次发布是一个带有自己发布标签的提交(本次为 [`release-2026-11-11.6`](https://huggingface.co/datasets/Battam/agentic-env-index/tree/release-2026-11-11.6)),
|
| 439 |
因此任何较早的状态都可以在它的标签处读到。
|
| 440 |
- `meta/projection.json` 记录发布标签,以及生成本卡片的程序和模板的版本。
|
| 441 |
- Croissant 元数据:[由 Hub 生成](https://huggingface.co/api/datasets/Battam/agentic-env-index/croissant);
|
|
|
|
| 476 |
@misc{agentic_env_index,
|
| 477 |
title = {agentic-env-index: an index of public materials for building agent environments},
|
| 478 |
howpublished = {https://huggingface.co/datasets/Battam/agentic-env-index},
|
| 479 |
+
note = {Release release-2026-11-11.6},
|
| 480 |
year = {2026}
|
| 481 |
}
|
| 482 |
```
|
campaign_files/2026-10-c-repros-2/euclidean-rbf-mle-sim-repro/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Whether the unit needs other upstream files is not stated. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** Each unit with an answer has one answer file, at answer/<package>/reported.json.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Open with tools for these file types: .py; .txt.
|
| 14 |
|
| 15 |
**Licence (SPDX):** MIT
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Whether the unit needs other upstream files is not stated. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Open with tools for these file types: .py; .txt.
|
| 12 |
|
| 13 |
**Licence (SPDX):** MIT
|
campaign_files/2026-10-c-repros/evidential-deep-learning-repro/LICENSE.txt
ADDED
|
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Licence: Apache-2.0 AND CC-BY-4.0
|
| 2 |
+
|
| 3 |
+
- Apache-2.0: https://raw.githubusercontent.com/aamini/evidential-deep-learning/d1d8e395fb083308d14fa92c5ce766e97b2a066a/LICENSE (publisher: Alexander Amini, Wilko Schwarting, Ava Soleimany, Daniela Rus (GitHub aamini/evidential-deep-learning))
|
| 4 |
+
- CC-BY-4.0: https://creativecommons.org/licenses/by/4.0/ (publisher: J. Gerritsma, R. Onnink, A. Versluis (UCI Machine Learning Repository, Yacht Hydrodynamics); copy kept in GitHub aamini/evidential-deep-learning)
|
| 5 |
+
|
| 6 |
+
The publisher's licence file is LICENSE next to this file, fetched from https://raw.githubusercontent.com/aamini/evidential-deep-learning/d1d8e395fb083308d14fa92c5ce766e97b2a066a/LICENSE.
|
campaign_files/2026-10-c-repros/evidential-deep-learning-repro/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Self-contained: run `python run_repro.py` inside code/; it reads only files inside the package, needs no network and no GPU.
|
| 10 |
|
| 11 |
-
**Answers:** answer/evidential-regression-yacht/reported.json gives the values the paper reports for this experiment (reported, tolerance per key, table or figure number, page, how the value was read).
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Python 3.7 with TensorFlow 2.1 (CPU) and TensorFlow Probability 0.8; exact pins are in the package README.md.
|
| 14 |
|
| 15 |
**Licence (SPDX):** Apache-2.0 AND CC-BY-4.0
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Self-contained: run `python run_repro.py` inside code/; it reads only files inside the package, needs no network and no GPU.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Python 3.7 with TensorFlow 2.1 (CPU) and TensorFlow Probability 0.8; exact pins are in the package README.md.
|
| 12 |
|
| 13 |
**Licence (SPDX):** Apache-2.0 AND CC-BY-4.0
|
campaign_files/2026-10-g-solver-instances-2/evalgm-graphical-model-benchmark/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Not self-contained: each unit is used together with other files from the same upstream. 15 of 15 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: Published proved optimal cost. Where the reference result comes from and how a solution is checked is written per unit in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Tools are named in the check written per unit in the notes.
|
| 14 |
|
| 15 |
**Licence (SPDX):** NOASSERTION
|
|
@@ -22,8 +20,6 @@ Units:
|
|
| 22 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/CFN/SPOT5/1502.wcsp.xz
|
| 23 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 24 |
Origin: benchmark instance gathered and translated into several formats by the authors of a solver comparison study, published with each solver's best value and proof status
|
| 25 |
-
Reference result: published proved optimal cost
|
| 26 |
-
Reference source: results.csv line 1992: "CFN/SPOT5/1502,209,4,411,3,28042,223.15,SC,28042,0.01,SC,28042" (daoopt, toulbar2, cplex, cplex_t, maxhs and maxhs_t all report 28042 with status SC; gecode reports 64057 without proof); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 27 |
Check: Exact: the agent returns a value for every variable; the total cost (sum of the cost function entries, with any entry at or above the header's upper bound counting as a violated hard constraint) is recomputed from the wcsp file and must equal 28042, the proved optimum
|
| 28 |
Companions (not included): results.csv; readme.txt
|
| 29 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -31,8 +27,6 @@ Units:
|
|
| 31 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/CFN/Auction/cat_paths_60_100_0000.wcsp.xz
|
| 32 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 33 |
Origin: benchmark instance gathered and translated into several formats by the authors of a solver comparison study, published with each solver's best value and proof status
|
| 34 |
-
Reference result: published proved optimal cost
|
| 35 |
-
Reference source: results.csv line 1782: "CFN/Auction/cat_paths_60_100_0000,101,2,932,2,68579,402.73,SC,68579" (all seven solvers report 68579 with status SC); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 36 |
Check: Exact: the agent returns a value for every variable; the total cost (sum of the cost function entries, with any entry at or above the header's upper bound counting as a violated hard constraint) is recomputed from the wcsp file and must equal 68579, the proved optimum
|
| 37 |
Companions (not included): results.csv; readme.txt
|
| 38 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -40,8 +34,6 @@ Units:
|
|
| 40 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MaxCSP/Composed-75-1-80/composed-75-1-80-0_ext_1000.wcsp.xz
|
| 41 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 42 |
Origin: benchmark instance gathered and translated into several formats by the authors of a solver comparison study, published with each solver's best value and proof status
|
| 43 |
-
Reference result: published proved optimal cost
|
| 44 |
-
Reference source: results.csv line 2192: "MaxCSP/Composed-75-1-80/composed-75-1-80-0_ext_1000,83,10,785,2,2,3600,S,2,0.18,SC" (toulbar2, cplex, maxhs and maxhs_t report 2 with status SC; daoopt reports 2 without proof; cplex_t (81) and gecode (67) stop at worse values without proof); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 45 |
Check: Exact: the agent returns a value for every variable; the total cost (sum of the cost function entries, with any entry at or above the header's upper bound counting as a violated hard constraint) is recomputed from the wcsp file and must equal 2, the proved optimum
|
| 46 |
Companions (not included): results.csv; readme.txt
|
| 47 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -49,8 +41,6 @@ Units:
|
|
| 49 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/CFN/CELAR/CELAR6-SUB0_r.wcsp.xz
|
| 50 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 51 |
Origin: benchmark instance from CFLib (costfunction.org), CELAR radio link frequency assignment, scenario 6 sub-problem 0 (Cabon et al., Constraints 1999), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 52 |
-
Reference result: published proved optimal cost
|
| 53 |
-
Reference source: results.csv line 1952: "CFN/CELAR/CELAR6-SUB0,16,44,73,2,159,303.34,SC,159,0.13,SC,169,3600,S,159,1355.04,SC,2745,3600,S,?,3600,UNK,16759,3600,S" (daoopt, toulbar2 and cplex_t report 159 with status SC; cplex (169), maxhs (2745) and gecode (16759) report worse values without proof; no solver reports a value below 159); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors; The results.csv row is named CFN/CELAR/CELAR6-SUB0; this file is CFN/CELAR/CELAR6-SUB0_r (the _r file is the wcsp encoding of this instance in the directory listing); its header line "wcsp 16 44 73 45316" matches the row's nbvar, max_dom and nbconstr.
|
| 54 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 159; since 159 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 55 |
Companions (not included): results.csv; readme.txt
|
| 56 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -58,8 +48,6 @@ Units:
|
|
| 58 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/CFN/CELAR/graph05_r.wcsp.xz
|
| 59 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 60 |
Origin: benchmark instance from CFLib (costfunction.org), CALMA graph instance graph05 of the radio link frequency assignment benchmark, gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 61 |
-
Reference result: published proved optimal cost
|
| 62 |
-
Reference source: results.csv line 1961: "CFN/CELAR/graph05,100,44,516,2,221,1006.67,SC,221,0.74,SC,21886,3600,S,221,36.69,SC,221,3600,S,1433,3600,S,121118,3600,S" (daoopt, toulbar2 and cplex_t report 221 with status SC; maxhs reports 221 without proof; cplex (21886), maxhs_t (1433) and gecode (121118) report worse values; no solver reports a value below 221); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors; The results.csv row is named CFN/CELAR/graph05; this file is CFN/CELAR/graph05_r (the _r file is the wcsp encoding of this instance in the directory listing); its header line "wcsp 100 44 516 229599" matches the row's nbvar, max_dom and nbconstr.
|
| 63 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 221; since 221 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 64 |
Companions (not included): results.csv; readme.txt
|
| 65 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -67,8 +55,6 @@ Units:
|
|
| 67 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/CFN/ProteinDesign/1HZ5.12p.9aa.usingEref_self_digit2.wcsp.xz
|
| 68 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 69 |
Origin: benchmark instance from CFLib (costfunction.org), computational protein design instance 1HZ5 with 12 designable positions and 9 amino acids (energies with 2-digit precision), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 70 |
-
Reference result: published proved optimal cost
|
| 71 |
-
Reference source: results.csv line 1980: "CFN/ProteinDesign/1HZ5.12p.9aa.usingEref_self_digit2,12,49,78,2,150714,494.01,SC,150714,0.2,SC,152513,3600,S,150714,13.9,SC,?,3600,UNK,150714,300.9,SC,?,mem,UNK" (daoopt, toulbar2, cplex_t and maxhs_t report 150714 with status SC; cplex reports 152513 without proof; no solver reports a value below 150714); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 72 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 150714; since 150714 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 73 |
Companions (not included): results.csv; readme.txt
|
| 74 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -76,8 +62,6 @@ Units:
|
|
| 76 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MaxCSP/BlackHole-4/BlackHole-4-4-e-0_ext_1000.wcsp.xz
|
| 77 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 78 |
Origin: benchmark instance from CSP and Max-CSP 2008 Competition (CPAI08), BlackHole-4 series (card game patience puzzle encoded as CSP), extensional version with costs 1 per violated tuple, gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 79 |
-
Reference result: published proved optimal cost
|
| 80 |
-
Reference source: results.csv line 2070: "MaxCSP/BlackHole-4/BlackHole-4-4-e-0_ext_1000,61,12,164,2,1,221.83,SC,1,0.08,SC,1,0.96,SC,1,1.41,SC,1,0.29,SC,1,2.69,SC,17,3600,S" (daoopt, toulbar2, cplex, cplex_t, maxhs and maxhs_t all report 1 with status SC; gecode reports 17 without proof); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 81 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 1; since 1 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 82 |
Companions (not included): results.csv; readme.txt
|
| 83 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -85,8 +69,6 @@ Units:
|
|
| 85 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MaxCSP/Coloring/geom-30a-3-ext_1000.wcsp.xz
|
| 86 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 87 |
Origin: benchmark instance from CSP and Max-CSP 2008 Competition (CPAI08), Coloring series, geometric graph geom-30a with 3 colours, extensional version, gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 88 |
-
Reference result: published proved optimal cost
|
| 89 |
-
Reference source: results.csv line 2102: "MaxCSP/Coloring/geom-30a-3-ext_1000,30,3,111,2,11,205.39,SC,11,0.4,SC,11,0.83,SC,11,21.2,SC,11,20.41,SC,11,9.5,SC,13,3600,S" (daoopt, toulbar2, cplex, cplex_t, maxhs and maxhs_t all report 11 with status SC; gecode reports 13 without proof); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 90 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 11; since 11 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 91 |
Companions (not included): results.csv; readme.txt
|
| 92 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -94,8 +76,6 @@ Units:
|
|
| 94 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MaxCSP/QCP-10/qcp-10-67-11_ext_1000.wcsp.xz
|
| 95 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 96 |
Origin: benchmark instance from CSP and Max-CSP 2008 Competition (CPAI08), QCP-10 series (quasigroup completion, order 10, 67 holes), extensional version, gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 97 |
-
Reference result: published proved optimal cost
|
| 98 |
-
Reference source: results.csv line 2508: "MaxCSP/QCP-10/qcp-10-67-11_ext_1000,67,6,451,2,2,3600,S,2,27.29,SC,2,813.28,SC,2,3600,S,2,0.23,SC,2,38.84,SC,59,3600,S" (toulbar2, cplex, maxhs and maxhs_t report 2 with status SC; daoopt and cplex_t also find 2 without proof; gecode reports 59 without proof); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 99 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 2; since 2 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 100 |
Companions (not included): results.csv; readme.txt
|
| 101 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -103,8 +83,6 @@ Units:
|
|
| 103 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/Linkage/pedigree1.wcsp.xz
|
| 104 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 105 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), Linkage set: genetic linkage analysis Bayesian network pedigree1, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 106 |
-
Reference result: published proved optimal cost
|
| 107 |
-
Reference source: results.csv line 141: "MRF/Linkage/pedigree1,334,4,577,5,757,340.73,SC,757,0.28,SC,757,20.93,SC,757,0.47,SC,757,0.47,SC,757,1.07,SC,2506,3600,S" (daoopt, toulbar2, cplex, cplex_t, maxhs and maxhs_t all report 757 with status SC; gecode reports 2506 without proof); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 108 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 757; since 757 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 109 |
Companions (not included): results.csv; readme.txt
|
| 110 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -112,8 +90,6 @@ Units:
|
|
| 112 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/Grid/grid20x20.f10.wcsp.xz
|
| 113 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 114 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), Grid set: 20x20 binary grid Markov random field grid20x20.f10, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 115 |
-
Reference result: published proved optimal cost
|
| 116 |
-
Reference source: results.csv line 110: "MRF/Grid/grid20x20.f10,400,2,1160,2,91581,455.58,SC,93970,3600,S,91581,9.48,SC,91581,3600,S,91581,61.14,SC,?,3600,UNK,352509,3600,S" (daoopt, cplex and maxhs report 91581 with status SC; cplex_t also finds 91581 without proof; toulbar2 (93970) and gecode (352509) report worse values without proof; no solver reports a value below 91581); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 117 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 91581; since 91581 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 118 |
Companions (not included): results.csv; readme.txt
|
| 119 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -121,8 +97,6 @@ Units:
|
|
| 121 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/Segmentation/10_14_s.binary.wcsp.xz
|
| 122 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 123 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), Segmentation set: binary image segmentation Markov random field 10_14_s.binary, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 124 |
-
Reference result: published proved optimal cost
|
| 125 |
-
Reference source: results.csv line 222: "MRF/Segmentation/10_14_s.binary,231,2,861,2,8412,357.59,SC,8412,0.04,SC,8412,0.05,SC,8412,0.07,SC,8412,0.16,SC,8412,23.06,SC,25056,3600,S" (daoopt, toulbar2, cplex, cplex_t, maxhs and maxhs_t all report 8412 with status SC; gecode reports 25056 without proof); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 126 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 8412; since 8412 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 127 |
Companions (not included): results.csv; readme.txt
|
| 128 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -130,8 +104,6 @@ Units:
|
|
| 130 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/DBN/rus2_20_40_0_2.wcsp.xz
|
| 131 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 132 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), DBN set: dynamic Bayesian network rus2_20_40_0_2, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 133 |
-
Reference result: published proved optimal cost
|
| 134 |
-
Reference source: results.csv line 13: "MRF/DBN/rus2_20_40_0_2,854,2,1993,2,329177,630.86,SC,329177,0.1,SC,329177,21.2,SC,329177,2.57,SC,329177,1336.75,SC,329177,1281.13,SC,353503,3600,S" (daoopt, toulbar2, cplex, cplex_t, maxhs and maxhs_t all report 329177 with status SC; gecode reports 353503 without proof); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 135 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 329177; since 329177 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 136 |
Companions (not included): results.csv; readme.txt
|
| 137 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -139,8 +111,6 @@ Units:
|
|
| 139 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/ImageAlignment/fileforGal_100markers.wcsp.xz
|
| 140 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 141 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), ImageAlignment set: marker matching instance fileforGal_100markers, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 142 |
-
Reference result: published proved optimal cost
|
| 143 |
-
Reference source: results.csv line 131: "MRF/ImageAlignment/fileforGal_100markers,100,92,1055,2,133669,1572.35,SC,133669,1.59,SC,1503861,mem,S,133669,40.02,SC,?,3600,UNK,?,3600,UNK,1908575,3600,S" (daoopt, toulbar2 and cplex_t report 133669 with status SC; cplex (1503861) and gecode (1908575) report worse values without proof; readme.txt line 99 names fileforGal_400markers, not this instance, among the double/integer conversion discrepancies); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 144 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 133669; since 133669 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 145 |
Companions (not included): results.csv; readme.txt
|
| 146 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
@@ -148,8 +118,6 @@ Units:
|
|
| 148 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/ProteinFolding/pdb1fmj.wcsp.xz
|
| 149 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 150 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), ProteinFolding set: side-chain placement instance pdb1fmj, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
| 151 |
-
Reference result: published proved optimal cost
|
| 152 |
-
Reference source: results.csv line 213: "MRF/ProteinFolding/pdb1fmj,614,81,2759,2,50800,3600,S,50662,3.2,SC,50662,123.52,SC,50662,196.29,SC,60099,3600,S,71263,3600,S,957085,3600,S" (toulbar2, cplex and cplex_t report 50662 with status SC; daoopt (50800), maxhs (60099), maxhs_t (71263) and gecode (957085) report worse values without proof; no solver reports a value below 50662); readme.txt line 86 "bestsol: cost of the best solution found" and line 88 "status: S (solution found), C (optimum found and proved)". Published by the benchmark authors.
|
| 153 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 50662; since 50662 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 154 |
Companions (not included): results.csv; readme.txt
|
| 155 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Not self-contained: each unit is used together with other files from the same upstream. 15 of 15 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Tools are named in the check written per unit in the notes.
|
| 12 |
|
| 13 |
**Licence (SPDX):** NOASSERTION
|
|
|
|
| 20 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/CFN/SPOT5/1502.wcsp.xz
|
| 21 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 22 |
Origin: benchmark instance gathered and translated into several formats by the authors of a solver comparison study, published with each solver's best value and proof status
|
|
|
|
|
|
|
| 23 |
Check: Exact: the agent returns a value for every variable; the total cost (sum of the cost function entries, with any entry at or above the header's upper bound counting as a violated hard constraint) is recomputed from the wcsp file and must equal 28042, the proved optimum
|
| 24 |
Companions (not included): results.csv; readme.txt
|
| 25 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 27 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/CFN/Auction/cat_paths_60_100_0000.wcsp.xz
|
| 28 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 29 |
Origin: benchmark instance gathered and translated into several formats by the authors of a solver comparison study, published with each solver's best value and proof status
|
|
|
|
|
|
|
| 30 |
Check: Exact: the agent returns a value for every variable; the total cost (sum of the cost function entries, with any entry at or above the header's upper bound counting as a violated hard constraint) is recomputed from the wcsp file and must equal 68579, the proved optimum
|
| 31 |
Companions (not included): results.csv; readme.txt
|
| 32 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 34 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MaxCSP/Composed-75-1-80/composed-75-1-80-0_ext_1000.wcsp.xz
|
| 35 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 36 |
Origin: benchmark instance gathered and translated into several formats by the authors of a solver comparison study, published with each solver's best value and proof status
|
|
|
|
|
|
|
| 37 |
Check: Exact: the agent returns a value for every variable; the total cost (sum of the cost function entries, with any entry at or above the header's upper bound counting as a violated hard constraint) is recomputed from the wcsp file and must equal 2, the proved optimum
|
| 38 |
Companions (not included): results.csv; readme.txt
|
| 39 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 41 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/CFN/CELAR/CELAR6-SUB0_r.wcsp.xz
|
| 42 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 43 |
Origin: benchmark instance from CFLib (costfunction.org), CELAR radio link frequency assignment, scenario 6 sub-problem 0 (Cabon et al., Constraints 1999), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 44 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 159; since 159 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 45 |
Companions (not included): results.csv; readme.txt
|
| 46 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 48 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/CFN/CELAR/graph05_r.wcsp.xz
|
| 49 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 50 |
Origin: benchmark instance from CFLib (costfunction.org), CALMA graph instance graph05 of the radio link frequency assignment benchmark, gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 51 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 221; since 221 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 52 |
Companions (not included): results.csv; readme.txt
|
| 53 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 55 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/CFN/ProteinDesign/1HZ5.12p.9aa.usingEref_self_digit2.wcsp.xz
|
| 56 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 57 |
Origin: benchmark instance from CFLib (costfunction.org), computational protein design instance 1HZ5 with 12 designable positions and 9 amino acids (energies with 2-digit precision), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 58 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 150714; since 150714 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 59 |
Companions (not included): results.csv; readme.txt
|
| 60 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 62 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MaxCSP/BlackHole-4/BlackHole-4-4-e-0_ext_1000.wcsp.xz
|
| 63 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 64 |
Origin: benchmark instance from CSP and Max-CSP 2008 Competition (CPAI08), BlackHole-4 series (card game patience puzzle encoded as CSP), extensional version with costs 1 per violated tuple, gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 65 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 1; since 1 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 66 |
Companions (not included): results.csv; readme.txt
|
| 67 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 69 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MaxCSP/Coloring/geom-30a-3-ext_1000.wcsp.xz
|
| 70 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 71 |
Origin: benchmark instance from CSP and Max-CSP 2008 Competition (CPAI08), Coloring series, geometric graph geom-30a with 3 colours, extensional version, gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 72 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 11; since 11 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 73 |
Companions (not included): results.csv; readme.txt
|
| 74 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 76 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MaxCSP/QCP-10/qcp-10-67-11_ext_1000.wcsp.xz
|
| 77 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 78 |
Origin: benchmark instance from CSP and Max-CSP 2008 Competition (CPAI08), QCP-10 series (quasigroup completion, order 10, 67 holes), extensional version, gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 79 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 2; since 2 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 80 |
Companions (not included): results.csv; readme.txt
|
| 81 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 83 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/Linkage/pedigree1.wcsp.xz
|
| 84 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 85 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), Linkage set: genetic linkage analysis Bayesian network pedigree1, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 86 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 757; since 757 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 87 |
Companions (not included): results.csv; readme.txt
|
| 88 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 90 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/Grid/grid20x20.f10.wcsp.xz
|
| 91 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 92 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), Grid set: 20x20 binary grid Markov random field grid20x20.f10, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 93 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 91581; since 91581 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 94 |
Companions (not included): results.csv; readme.txt
|
| 95 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 97 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/Segmentation/10_14_s.binary.wcsp.xz
|
| 98 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 99 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), Segmentation set: binary image segmentation Markov random field 10_14_s.binary, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 100 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 8412; since 8412 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 101 |
Companions (not included): results.csv; readme.txt
|
| 102 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 104 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/DBN/rus2_20_40_0_2.wcsp.xz
|
| 105 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 106 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), DBN set: dynamic Bayesian network rus2_20_40_0_2, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 107 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 329177; since 329177 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 108 |
Companions (not included): results.csv; readme.txt
|
| 109 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 111 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/ImageAlignment/fileforGal_100markers.wcsp.xz
|
| 112 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 113 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), ImageAlignment set: marker matching instance fileforGal_100markers, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 114 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 133669; since 133669 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 115 |
Companions (not included): results.csv; readme.txt
|
| 116 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
|
|
|
| 118 |
Decompressed from: https://web-genobioinfo.toulouse.inrae.fr/~degivry/evalgm/MRF/ProteinFolding/pdb1fmj.wcsp.xz
|
| 119 |
Format: xz-compressed wcsp text (toulbar2 cost function network format: header "name n d e ub", domain sizes, then cost function tables with a default cost); unpacks with Python's lzma module; the same directory also offers uai, wcnf, lp and dzn encodings; one file is one case
|
| 120 |
Origin: benchmark instance from UAI 2008 Evaluation or Probabilistic Inference Challenge 2011 (readme.txt lines 10 to 13), ProteinFolding set: side-chain placement instance pdb1fmj, translated to a cost function network with 2-digit precision (readme.txt line 99), gathered and translated into several formats by the authors of a solver comparison study and published with each solver's best value and proof status
|
|
|
|
|
|
|
| 121 |
Check: the total cost (sum over all cost functions, including any zero-arity constant term, of the listed tuple cost or else the function's default cost) is recomputed from the wcsp file; the assignment is feasible when the total stays below the header's upper bound (the wcsp convention for hard constraints); it passes when feasible and the total is not more than 50662; since 50662 is proved optimal, a pass means the total equals it and anything lower signals an evaluator error
|
| 122 |
Companions (not included): results.csv; readme.txt
|
| 123 |
Dependencies: not packed; Python lzma module of the standard library to unpack .xz
|
campaign_files/2026-10-g-solver-instances-2/evrp-competition-2020/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Not self-contained: each unit is used together with other files from the same upstream. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: Upper bound on the minimum total distance (no reference routes). Where the reference result comes from and how a solution is checked is written per unit in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Check: Program: read the agent routes (node sequences starting and ending at the depot, charging stations may appear any number of times); feasible when every customer is visited exactly once, each route load is at most CAPACITY 6000, and along each route the battery, starting full at the depot and refilled to full at every station, never drops below zero, with energy use ENERGY_CONSUMPTION 1.20 times the Euclidean distance of each edge from a full ENERGY_CAPACITY of 94; cost is the total unrounded Euclidean distance; pass when feasible and the total is at most 384.678035, the published upper bound.
|
| 14 |
|
| 15 |
**Licence (SPDX):** NOASSERTION
|
|
@@ -22,8 +20,6 @@ Units:
|
|
| 22 |
Read out of the archive: https://mavrovouniotis.github.io/EVRPcompetition2020/evrp-benchmark-set.zip
|
| 23 |
Format: TSPLIB-style text with OPTIMAL_VALUE, VEHICLES, DIMENSION, STATIONS, CAPACITY, ENERGY_CAPACITY, ENERGY_CONSUMPTION, NODE_COORD_SECTION, DEMAND_SECTION, STATIONS_COORD_SECTION, DEPOT_SECTION; one case = one instance; the answer is routes with recharging stops and total distance
|
| 24 |
Origin: competition benchmark instance (modification of CVRP E-n22-k4 with charging stations), recorded tool_fixture
|
| 25 |
-
Reference result: upper bound on the minimum total distance (no reference routes)
|
| 26 |
-
Reference source: E-n22-k4.evrp line 4 "OPTIMAL_VALUE: 384.678035"; TR-EVRP-Competition.pdf Table 1 row "E-n22-k4.evrp 21 1 8 4 6000 94 1.2 384.67" and its note that UB "could be optimal in some cases but it is not verified yet"
|
| 27 |
Check: Program: read the agent routes (node sequences starting and ending at the depot, charging stations may appear any number of times); feasible when every customer is visited exactly once, each route load is at most CAPACITY 6000, and along each route the battery, starting full at the depot and refilled to full at every station, never drops below zero, with energy use ENERGY_CONSUMPTION 1.20 times the Euclidean distance of each edge from a full ENERGY_CAPACITY of 94; cost is the total unrounded Euclidean distance; pass when feasible and the total is at most 384.678035, the published upper bound
|
| 28 |
Companions (not included): EVRPcompetition2020/TR-EVRP-Competition.pdf
|
| 29 |
Dependencies: the competition C++ sample code was not fetched or run
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Not self-contained: each unit is used together with other files from the same upstream. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Check: Program: read the agent routes (node sequences starting and ending at the depot, charging stations may appear any number of times); feasible when every customer is visited exactly once, each route load is at most CAPACITY 6000, and along each route the battery, starting full at the depot and refilled to full at every station, never drops below zero, with energy use ENERGY_CONSUMPTION 1.20 times the Euclidean distance of each edge from a full ENERGY_CAPACITY of 94; cost is the total unrounded Euclidean distance; pass when feasible and the total is at most 384.678035, the published upper bound.
|
| 12 |
|
| 13 |
**Licence (SPDX):** NOASSERTION
|
|
|
|
| 20 |
Read out of the archive: https://mavrovouniotis.github.io/EVRPcompetition2020/evrp-benchmark-set.zip
|
| 21 |
Format: TSPLIB-style text with OPTIMAL_VALUE, VEHICLES, DIMENSION, STATIONS, CAPACITY, ENERGY_CAPACITY, ENERGY_CONSUMPTION, NODE_COORD_SECTION, DEMAND_SECTION, STATIONS_COORD_SECTION, DEPOT_SECTION; one case = one instance; the answer is routes with recharging stops and total distance
|
| 22 |
Origin: competition benchmark instance (modification of CVRP E-n22-k4 with charging stations), recorded tool_fixture
|
|
|
|
|
|
|
| 23 |
Check: Program: read the agent routes (node sequences starting and ending at the depot, charging stations may appear any number of times); feasible when every customer is visited exactly once, each route load is at most CAPACITY 6000, and along each route the battery, starting full at the depot and refilled to full at every station, never drops below zero, with energy use ENERGY_CONSUMPTION 1.20 times the Euclidean distance of each edge from a full ENERGY_CAPACITY of 94; cost is the total unrounded Euclidean distance; pass when feasible and the total is at most 384.678035, the published upper bound
|
| 24 |
Companions (not included): EVRPcompetition2020/TR-EVRP-Competition.pdf
|
| 25 |
Dependencies: the competition C++ sample code was not fetched or run
|
campaign_files/2026-10-m-issue-trackers-2/evergreen-general/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** The file is self-contained.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: Facts computed from the thread headers. Where the reference result comes from and how a solution is checked is written per file in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Read the archive as mbox with Python's mailbox and email modules (or mutt -f / notmuch on the decompressed file); rebuild the thread from Message-ID, In-Reply-To and References headers.
|
| 14 |
|
| 15 |
**Licence (SPDX):** NOASSERTION
|
|
@@ -21,7 +19,5 @@ Files:
|
|
| 21 |
- `m329-07/2020-October.txt.gz`: [Evergreen-general] Receipts (5 messages, 2020-10-02 to 2020-10-03).
|
| 22 |
Format: Pipermail month archive, mbox text gzip-compressed: full headers (From with obfuscated address and name, Date, Subject, Message-ID, In-Reply-To, References) and plain-text bodies. Cut the thread by root Message-ID through the In-Reply-To closure (last References entry when In-Reply-To is missing).
|
| 23 |
Origin: Real list traffic in a closed past month of the list's archive. The unit is one thread, cut out of the month file by its root Message-ID; the month file is the pinned pointer and is delivered whole. robots.txt of list.evergreen-ils.org is "Disallow: /" for all agents: fetched all the same and marked robots: disallowed, as the spec says (collect and mark).
|
| 24 |
-
Reference result: facts computed from the thread headers
|
| 25 |
-
Reference source: Message-ID, In-Reply-To, References, From and Date headers of the messages in the thread, read from the pinned month file.
|
| 26 |
Check: Exact match against values computed from the pinned month file: parse it as mbox, drop repeated copies of a Message-ID already seen (first copy kept), take the root Message-ID, collect every message whose In-Reply-To (or last References entry when In-Reply-To is missing) chains back to it, then count, take dates in UTC (a Date header without zone is read as UTC) and compare sender names. Message-IDs are compared after removing angle brackets and double quotes. People are counted by person: From entries with the same address, or the same name after removing accents and letter case, are one person (the names in scale are the first spelling of each). The first-reply interval is the exact difference in whole seconds between the Date headers of the root and the earliest reply, converted to UTC; Date headers have one-second resolution, so no rounding is involved. Deterministic. The program was checked on 2 threads of this source by a second, independent parser (splits the raw text on mbox From lines and reads headers with regular expressions, no mailbox or email module): the chosen thread (also read message by message) and '[Evergreen-general] OPAC Request a Library Card Form' (7 messages, 7 people, root <2e4f4659-dbec-6242-f328-624ce2839ac7@grpl.org>); message count, Message-ID set, last message time and first-reply seconds agreed on both.
|
| 27 |
Tools: Read the archive as mbox with Python's mailbox and email modules (or mutt -f / notmuch on the decompressed file); rebuild the thread from Message-ID, In-Reply-To and References headers.
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** The file is self-contained.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Read the archive as mbox with Python's mailbox and email modules (or mutt -f / notmuch on the decompressed file); rebuild the thread from Message-ID, In-Reply-To and References headers.
|
| 12 |
|
| 13 |
**Licence (SPDX):** NOASSERTION
|
|
|
|
| 19 |
- `m329-07/2020-October.txt.gz`: [Evergreen-general] Receipts (5 messages, 2020-10-02 to 2020-10-03).
|
| 20 |
Format: Pipermail month archive, mbox text gzip-compressed: full headers (From with obfuscated address and name, Date, Subject, Message-ID, In-Reply-To, References) and plain-text bodies. Cut the thread by root Message-ID through the In-Reply-To closure (last References entry when In-Reply-To is missing).
|
| 21 |
Origin: Real list traffic in a closed past month of the list's archive. The unit is one thread, cut out of the month file by its root Message-ID; the month file is the pinned pointer and is delivered whole. robots.txt of list.evergreen-ils.org is "Disallow: /" for all agents: fetched all the same and marked robots: disallowed, as the spec says (collect and mark).
|
|
|
|
|
|
|
| 22 |
Check: Exact match against values computed from the pinned month file: parse it as mbox, drop repeated copies of a Message-ID already seen (first copy kept), take the root Message-ID, collect every message whose In-Reply-To (or last References entry when In-Reply-To is missing) chains back to it, then count, take dates in UTC (a Date header without zone is read as UTC) and compare sender names. Message-IDs are compared after removing angle brackets and double quotes. People are counted by person: From entries with the same address, or the same name after removing accents and letter case, are one person (the names in scale are the first spelling of each). The first-reply interval is the exact difference in whole seconds between the Date headers of the root and the earliest reply, converted to UTC; Date headers have one-second resolution, so no rounding is involved. Deterministic. The program was checked on 2 threads of this source by a second, independent parser (splits the raw text on mbox From lines and reads headers with regular expressions, no mailbox or email module): the chosen thread (also read message by message) and '[Evergreen-general] OPAC Request a Library Card Form' (7 messages, 7 people, root <2e4f4659-dbec-6242-f328-624ce2839ac7@grpl.org>); message count, Message-ID set, last message time and first-reply seconds agreed on both.
|
| 23 |
Tools: Read the archive as mbox with Python's mailbox and email modules (or mutt -f / notmuch on the decompressed file); rebuild the thread from Message-ID, In-Reply-To and References headers.
|
campaign_files/2026-10-s-security-detection/evtx-attack-samples/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Each file is marked self-contained upstream. 3 of 3 files name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per file in the notes. Dependencies named upstream are listed per file in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: attack_technique_label. Where the reference result comes from and how a solution is checked is written per file in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Check: Classification: given the EVTX, name the technique (DCSync, T1003.006) or tactic (Credential Access); exact match on the technique id or tactic name. Detection variant: the flagged events must be exactly the three 4662 records listed in evtx_data.csv for CA_DCSync_4662.evtx. Classification: name the tool and technique (Impacket wmiexec, WMI remote execution, T1047) or tactic (Lateral Movement); exact match. Detection variant: the flagged process events must be the four EID 1 rows of evtx_data.csv whose parent is WmiPrvSE.exe or whose command line writes to ADMIN$\__1556656369.7. Classification: name the technique (accessibility features, T1546.008) or tactic (Persistence); exact match. Detection variant: the flagged events must be the two EID 1 rows (osk.exe under Utilman.exe, whoami.exe under osk.exe).
|
| 14 |
|
| 15 |
**Licence (SPDX):** GPL-3.0-only
|
|
@@ -21,24 +19,18 @@ Files:
|
|
| 21 |
- `Credential Access/CA_DCSync_4662.evtx`: EVTX-ATTACK-SAMPLES: DCSync seen as directory-replication access in Security 4662 events.
|
| 22 |
Format: Windows EVTX (69,632 B) + per-event CSV table of the whole collection (evtx_data.csv, 4,262,506 B, rows for this file selected by EVTX_FileName)
|
| 23 |
Origin: Windows Security and Sysmon telemetry recorded on lab hosts while the author ran each attack technique, published as-is as a sample collection (not the test data of one tool)
|
| 24 |
-
Reference result: attack_technique_label
|
| 25 |
-
Reference source: file name CA_DCSync_4662 and folder Credential Access (author's technique-level mapping, README.md), confirmed by the three evtx_data.csv rows for this file (EventID 4662, Properties with the two replication GUIDs)
|
| 26 |
Check: Classification: given the EVTX, name the technique (DCSync, T1003.006) or tactic (Credential Access); exact match on the technique id or tactic name. Detection variant: the flagged events must be exactly the three 4662 records listed in evtx_data.csv for CA_DCSync_4662.evtx.
|
| 27 |
Companions (not included): evtx_data.csv
|
| 28 |
Dependencies: README.md: names the licence and says the mapping is at ATT&CK technique level. LICENSE.GPL: licence text.
|
| 29 |
- `Lateral Movement/LM_wmiexec_impacket_sysmon_whoami.evtx`: EVTX-ATTACK-SAMPLES: Impacket wmiexec lateral movement in Sysmon process and network events.
|
| 30 |
Format: Windows EVTX (69,632 B) + per-event CSV table of the whole collection (evtx_data.csv, rows for this file selected by EVTX_FileName)
|
| 31 |
Origin: Windows Security and Sysmon telemetry recorded on lab hosts while the author ran each attack technique, published as-is as a sample collection (not the test data of one tool)
|
| 32 |
-
Reference result: attack_technique_label
|
| 33 |
-
Reference source: file name LM_wmiexec_impacket_sysmon_whoami and folder Lateral Movement (author's mapping), confirmed by the seven evtx_data.csv rows for this file (Image, ParentImage, CommandLine)
|
| 34 |
Check: Classification: name the tool and technique (Impacket wmiexec, WMI remote execution, T1047) or tactic (Lateral Movement); exact match. Detection variant: the flagged process events must be the four EID 1 rows of evtx_data.csv whose parent is WmiPrvSE.exe or whose command line writes to ADMIN$\__1556656369.7.
|
| 35 |
Companions (not included): evtx_data.csv
|
| 36 |
Dependencies: README.md: names the licence and says the mapping is at ATT&CK technique level. LICENSE.GPL: licence text.
|
| 37 |
- `Persistence/persistence_accessibility_features_osk_sysmon1.evtx`: EVTX-ATTACK-SAMPLES: accessibility-feature hijack (utilman debugger launching osk and whoami) in Sysmon events.
|
| 38 |
Format: Windows EVTX (69,632 B) + per-event CSV table of the whole collection (evtx_data.csv, rows for this file selected by EVTX_FileName)
|
| 39 |
Origin: Windows Security and Sysmon telemetry recorded on lab hosts while the author ran each attack technique, published as-is as a sample collection (not the test data of one tool)
|
| 40 |
-
Reference result: attack_technique_label
|
| 41 |
-
Reference source: file name persistence_accessibility_features_osk_sysmon1 and folder Persistence (author's mapping), confirmed by the three evtx_data.csv rows for this file
|
| 42 |
Check: Classification: name the technique (accessibility features, T1546.008) or tactic (Persistence); exact match. Detection variant: the flagged events must be the two EID 1 rows (osk.exe under Utilman.exe, whoami.exe under osk.exe).
|
| 43 |
Companions (not included): evtx_data.csv
|
| 44 |
Dependencies: README.md: names the licence and says the mapping is at ATT&CK technique level. LICENSE.GPL: licence text.
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Each file is marked self-contained upstream. 3 of 3 files name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per file in the notes. Dependencies named upstream are listed per file in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Check: Classification: given the EVTX, name the technique (DCSync, T1003.006) or tactic (Credential Access); exact match on the technique id or tactic name. Detection variant: the flagged events must be exactly the three 4662 records listed in evtx_data.csv for CA_DCSync_4662.evtx. Classification: name the tool and technique (Impacket wmiexec, WMI remote execution, T1047) or tactic (Lateral Movement); exact match. Detection variant: the flagged process events must be the four EID 1 rows of evtx_data.csv whose parent is WmiPrvSE.exe or whose command line writes to ADMIN$\__1556656369.7. Classification: name the technique (accessibility features, T1546.008) or tactic (Persistence); exact match. Detection variant: the flagged events must be the two EID 1 rows (osk.exe under Utilman.exe, whoami.exe under osk.exe).
|
| 12 |
|
| 13 |
**Licence (SPDX):** GPL-3.0-only
|
|
|
|
| 19 |
- `Credential Access/CA_DCSync_4662.evtx`: EVTX-ATTACK-SAMPLES: DCSync seen as directory-replication access in Security 4662 events.
|
| 20 |
Format: Windows EVTX (69,632 B) + per-event CSV table of the whole collection (evtx_data.csv, 4,262,506 B, rows for this file selected by EVTX_FileName)
|
| 21 |
Origin: Windows Security and Sysmon telemetry recorded on lab hosts while the author ran each attack technique, published as-is as a sample collection (not the test data of one tool)
|
|
|
|
|
|
|
| 22 |
Check: Classification: given the EVTX, name the technique (DCSync, T1003.006) or tactic (Credential Access); exact match on the technique id or tactic name. Detection variant: the flagged events must be exactly the three 4662 records listed in evtx_data.csv for CA_DCSync_4662.evtx.
|
| 23 |
Companions (not included): evtx_data.csv
|
| 24 |
Dependencies: README.md: names the licence and says the mapping is at ATT&CK technique level. LICENSE.GPL: licence text.
|
| 25 |
- `Lateral Movement/LM_wmiexec_impacket_sysmon_whoami.evtx`: EVTX-ATTACK-SAMPLES: Impacket wmiexec lateral movement in Sysmon process and network events.
|
| 26 |
Format: Windows EVTX (69,632 B) + per-event CSV table of the whole collection (evtx_data.csv, rows for this file selected by EVTX_FileName)
|
| 27 |
Origin: Windows Security and Sysmon telemetry recorded on lab hosts while the author ran each attack technique, published as-is as a sample collection (not the test data of one tool)
|
|
|
|
|
|
|
| 28 |
Check: Classification: name the tool and technique (Impacket wmiexec, WMI remote execution, T1047) or tactic (Lateral Movement); exact match. Detection variant: the flagged process events must be the four EID 1 rows of evtx_data.csv whose parent is WmiPrvSE.exe or whose command line writes to ADMIN$\__1556656369.7.
|
| 29 |
Companions (not included): evtx_data.csv
|
| 30 |
Dependencies: README.md: names the licence and says the mapping is at ATT&CK technique level. LICENSE.GPL: licence text.
|
| 31 |
- `Persistence/persistence_accessibility_features_osk_sysmon1.evtx`: EVTX-ATTACK-SAMPLES: accessibility-feature hijack (utilman debugger launching osk and whoami) in Sysmon events.
|
| 32 |
Format: Windows EVTX (69,632 B) + per-event CSV table of the whole collection (evtx_data.csv, rows for this file selected by EVTX_FileName)
|
| 33 |
Origin: Windows Security and Sysmon telemetry recorded on lab hosts while the author ran each attack technique, published as-is as a sample collection (not the test data of one tool)
|
|
|
|
|
|
|
| 34 |
Check: Classification: name the technique (accessibility features, T1546.008) or tactic (Persistence); exact match. Detection variant: the flagged events must be the two EID 1 rows (osk.exe under Utilman.exe, whoami.exe under osk.exe).
|
| 35 |
Companions (not included): evtx_data.csv
|
| 36 |
Dependencies: README.md: names the licence and says the mapping is at ATT&CK technique level. LICENSE.GPL: licence text.
|
campaign_files/2026-10-s-security-detection/evtx-to-mitre-attack/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Each file is marked self-contained upstream. 2 of 2 files name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per file in the notes. Dependencies named upstream are listed per file in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: attack_technique_label. Where the reference result comes from and how a solution is checked is written per file in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Check: Classification: name the technique (T1558.003 Kerberoasting) or tactic (TA0006 Credential Access); exact match on id. Detection variant: the event to flag is the 4769 by admmig for Svc-SQL-DB01; machine-account 4769 events in the same file are the negatives. Classification: name the technique (T1021.002) or tactic (TA0008 Lateral Movement); exact match on id. Detection variant: flag the 5145 events whose share is ADMIN$ with an executable target or IPC$ with svcctl.
|
| 14 |
|
| 15 |
**Licence (SPDX):** CC0-1.0
|
|
@@ -21,16 +19,12 @@ Files:
|
|
| 21 |
- `TA0006-Credential Access/T1558-Steal or Forge Kerberos Tickets/ID4769-Kerberoast ticket with low encryption.evtx`
|
| 22 |
Format: Windows EVTX (69,632 B) + the repository README IOC table (README.md, 36,800 B) as the label source
|
| 23 |
Origin: Windows telemetry recorded on the author's lab domain (offsec.lan) while running each attack, published as an IOC sample collection, not the test data of one tool
|
| 24 |
-
Reference result: attack_technique_label
|
| 25 |
-
Reference source: README.md IOC table row "TA0006-Credential Access | T1558.003-Kerberoasting | KerberOAST ticket (TGS) request detected (low encryption) | 4769 | Kerberoast" and the folder and file name of the sample
|
| 26 |
Check: Classification: name the technique (T1558.003 Kerberoasting) or tactic (TA0006 Credential Access); exact match on id. Detection variant: the event to flag is the 4769 by admmig for Svc-SQL-DB01; machine-account 4769 events in the same file are the negatives.
|
| 27 |
Companions (not included): README.md
|
| 28 |
Dependencies: LICENSE.md: CC0 1.0 text.
|
| 29 |
- `TA0008-Lateral Movement/T1021.002-SMB Windows Admin Shares/ID5145-remote shell execution via SMB admin share.evtx`: EVTX-to-MITRE-Attack: remote shell execution through the ADMIN$ share (Security 5145).
|
| 30 |
Format: Windows EVTX (69,632 B) + the repository README IOC table (README.md) as the label source
|
| 31 |
Origin: Windows telemetry recorded on the author's lab domain (offsec.lan) while running each attack, published as an IOC sample collection, not the test data of one tool
|
| 32 |
-
Reference result: attack_technique_label
|
| 33 |
-
Reference source: README.md IOC table row "TA0008-Lateral Movement | T1021.002-SMB Windows Admin Shares | Remote shell execuction via SMB admin share | 5145" and the folder and file name of the sample
|
| 34 |
Check: Classification: name the technique (T1021.002) or tactic (TA0008 Lateral Movement); exact match on id. Detection variant: flag the 5145 events whose share is ADMIN$ with an executable target or IPC$ with svcctl.
|
| 35 |
Companions (not included): README.md
|
| 36 |
Dependencies: LICENSE.md: CC0 1.0 text.
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Each file is marked self-contained upstream. 2 of 2 files name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per file in the notes. Dependencies named upstream are listed per file in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Check: Classification: name the technique (T1558.003 Kerberoasting) or tactic (TA0006 Credential Access); exact match on id. Detection variant: the event to flag is the 4769 by admmig for Svc-SQL-DB01; machine-account 4769 events in the same file are the negatives. Classification: name the technique (T1021.002) or tactic (TA0008 Lateral Movement); exact match on id. Detection variant: flag the 5145 events whose share is ADMIN$ with an executable target or IPC$ with svcctl.
|
| 12 |
|
| 13 |
**Licence (SPDX):** CC0-1.0
|
|
|
|
| 19 |
- `TA0006-Credential Access/T1558-Steal or Forge Kerberos Tickets/ID4769-Kerberoast ticket with low encryption.evtx`
|
| 20 |
Format: Windows EVTX (69,632 B) + the repository README IOC table (README.md, 36,800 B) as the label source
|
| 21 |
Origin: Windows telemetry recorded on the author's lab domain (offsec.lan) while running each attack, published as an IOC sample collection, not the test data of one tool
|
|
|
|
|
|
|
| 22 |
Check: Classification: name the technique (T1558.003 Kerberoasting) or tactic (TA0006 Credential Access); exact match on id. Detection variant: the event to flag is the 4769 by admmig for Svc-SQL-DB01; machine-account 4769 events in the same file are the negatives.
|
| 23 |
Companions (not included): README.md
|
| 24 |
Dependencies: LICENSE.md: CC0 1.0 text.
|
| 25 |
- `TA0008-Lateral Movement/T1021.002-SMB Windows Admin Shares/ID5145-remote shell execution via SMB admin share.evtx`: EVTX-to-MITRE-Attack: remote shell execution through the ADMIN$ share (Security 5145).
|
| 26 |
Format: Windows EVTX (69,632 B) + the repository README IOC table (README.md) as the label source
|
| 27 |
Origin: Windows telemetry recorded on the author's lab domain (offsec.lan) while running each attack, published as an IOC sample collection, not the test data of one tool
|
|
|
|
|
|
|
| 28 |
Check: Classification: name the technique (T1021.002) or tactic (TA0008 Lateral Movement); exact match on id. Detection variant: flag the 5145 events whose share is ADMIN$ with an executable target or IPC$ with svcctl.
|
| 29 |
Companions (not included): README.md
|
| 30 |
Dependencies: LICENSE.md: CC0 1.0 text.
|
campaign_files/2026-10-sc-science-reference-data-2/exciting-test-farm/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Not self-contained: each file is used together with other files from the same upstream. 1 of 1 files name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per file in the notes. Dependencies named upstream are listed per file in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: reference_numbers_with_tolerance. Where the reference result comes from and how a solution is checked is written per file in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Check: Give the agent input.xml and He.xml and ask for the converged total energy, Fermi energy and fundamental gap; each passes when its absolute difference from the reference is within the tolerance set for that key in tolerance_ground_state.json (1e-8 Hartree).
|
| 14 |
|
| 15 |
**Licence (SPDX):** GPL-2.0-or-later
|
|
@@ -21,8 +19,6 @@ Files:
|
|
| 21 |
- `test/test_farm/groundstate/LDA_VWN-He/ref/INFO.OUT`: Exciting groundstate LDA_VWN-He: all-electron full-potential LAPW DFT (LDA, VWN correlation) of a helium atom in a cubic box; compute total energy, Fermi energy, gap and eigenvalues.
|
| 22 |
Format: exciting INFO.OUT (text); input.xml and He.xml (XML); tolerance_ground_state.json (JSON)
|
| 23 |
Origin: regression test of the exciting test farm (tool_fixture): inputs written by the developers, reference outputs produced by exciting and committed
|
| 24 |
-
Reference result: reference_numbers_with_tolerance
|
| 25 |
-
Reference source: INFO.OUT line 444 'Total energy : -2.83483618' (Hartree, final), line 446 'Fermi energy : -0.28783997', line 473 'Estimated fundamental gap : 0.56512597'; TOTENERGY.OUT last line -2.83483618033
|
| 26 |
Check: give the agent input.xml and He.xml and ask for the converged total energy, Fermi energy and fundamental gap; each passes when its absolute difference from the reference is within the tolerance set for that key in tolerance_ground_state.json (1e-8 Hartree)
|
| 27 |
Companions (not included): test/test_farm/groundstate/LDA_VWN-He/ref/input.xml; test/test_farm/groundstate/LDA_VWN-He/ref/He.xml; test/test_farm/groundstate/LDA_VWN-He/ref/TOTENERGY.OUT; test/test_farm/groundstate/LDA_VWN-He/ref/EIGVAL.OUT; test/test_farm/groundstate/LDA_VWN-He/ref/tolerance_ground_state.json
|
| 28 |
Dependencies: exciting with Libxc
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Not self-contained: each file is used together with other files from the same upstream. 1 of 1 files name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per file in the notes. Dependencies named upstream are listed per file in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Check: Give the agent input.xml and He.xml and ask for the converged total energy, Fermi energy and fundamental gap; each passes when its absolute difference from the reference is within the tolerance set for that key in tolerance_ground_state.json (1e-8 Hartree).
|
| 12 |
|
| 13 |
**Licence (SPDX):** GPL-2.0-or-later
|
|
|
|
| 19 |
- `test/test_farm/groundstate/LDA_VWN-He/ref/INFO.OUT`: Exciting groundstate LDA_VWN-He: all-electron full-potential LAPW DFT (LDA, VWN correlation) of a helium atom in a cubic box; compute total energy, Fermi energy, gap and eigenvalues.
|
| 20 |
Format: exciting INFO.OUT (text); input.xml and He.xml (XML); tolerance_ground_state.json (JSON)
|
| 21 |
Origin: regression test of the exciting test farm (tool_fixture): inputs written by the developers, reference outputs produced by exciting and committed
|
|
|
|
|
|
|
| 22 |
Check: give the agent input.xml and He.xml and ask for the converged total energy, Fermi energy and fundamental gap; each passes when its absolute difference from the reference is within the tolerance set for that key in tolerance_ground_state.json (1e-8 Hartree)
|
| 23 |
Companions (not included): test/test_farm/groundstate/LDA_VWN-He/ref/input.xml; test/test_farm/groundstate/LDA_VWN-He/ref/He.xml; test/test_farm/groundstate/LDA_VWN-He/ref/TOTENERGY.OUT; test/test_farm/groundstate/LDA_VWN-He/ref/EIGVAL.OUT; test/test_farm/groundstate/LDA_VWN-He/ref/tolerance_ground_state.json
|
| 24 |
Dependencies: exciting with Libxc
|
campaign_files/2026-10-sw-tests-and-exercises-2/exercises-in-programming-style/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** 0 of 3 units are self-contained; for the others it is not stated. 3 of 3 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: exact_output. Where the reference result comes from and how a solution is checked is written per unit in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Tools are named in the check written per unit in the notes.
|
| 14 |
|
| 15 |
**Licence (SPDX):** MIT AND LicenseRef-ProjectGutenberg-License
|
|
@@ -21,24 +19,18 @@ Units:
|
|
| 21 |
- `29-actors/` (2 files): Exercises in Programming Style, style 29 (Actors): write the term-frequency program so that each part is an object with its own thread and message queue, printing the 25 most frequent non-stop words of Pride and Prejudice exactly as test/pride-and-prejudice.txt lists them.
|
| 22 |
Format: Python program directory (README.md with the constraints, tf-29.py) plus a shared bash test harness, an input text and an expected-output file
|
| 23 |
Origin: course exercise: one style of the Exercises in Programming Style collection, used as programming coursework; reference program plus a shared output test
|
| 24 |
-
Reference result: exact_output
|
| 25 |
-
Reference source: test/pride-and-prejudice.txt (25 lines, e.g. `mr - 786`) is the expected output for input ../pride-and-prejudice.txt; test/test.sh compares every executable in the style directory against it (lines 25 to 41); tf-29.py in the unit is the reference program
|
| 26 |
Check: Hide 29-actors/tf-29.py when the task is set (it is the reference solution); give README.md of the style, the input files and the harness. Mark the submitted program executable, put it in 29-actors/ and run `test/test.sh 29`: it runs the program on ../pride-and-prejudice.txt, keeps the lines containing "-" (line 36) and compares them with test/pride-and-prejudice.txt by `diff -b` (line 39); pass = no difference and "PASSED". The harness checks the output only: whether the program really uses one thread and one queue per object (the style constraint) is not checked by any test and needs a code review.
|
| 27 |
Companions (not included): test/test.sh; test/pride-and-prejudice.txt; pride-and-prejudice.txt; stop_words.txt; README.md; LICENSE
|
| 28 |
Dependencies: Python 3 standard library only (tf-29.py imports threading, queue, re, sys); no version pinned upstream: latest CPython release on or before the unit commit date 2023-04-30, which is 3.11.3; bash, coreutils, diffutils and GNU date for test/test.sh (line 8 uses `date -u -d @...`, a GNU option)
|
| 29 |
- `26-persistent-tables/` (2 files): Exercises in Programming Style, style 26 (Persistent Tables): write the term-frequency program so that the data are loaded into relational tables and the answer comes from a query, printing the 25 most frequent non-stop words of Pride and Prejudice exactly as test/pride-and-prejudice.txt lists them.
|
| 30 |
Format: Python program directory (README.md with the constraints, tf-26.py) plus a shared bash test harness, an input text and an expected-output file
|
| 31 |
Origin: course exercise: one style of the Exercises in Programming Style collection, used as programming coursework; reference program plus a shared output test
|
| 32 |
-
Reference result: exact_output
|
| 33 |
-
Reference source: test/pride-and-prejudice.txt (25 lines, e.g. `mr - 786`) is the expected output for input ../pride-and-prejudice.txt; test/test.sh compares every executable in the style directory against it; tf-26.py in the unit is the reference program
|
| 34 |
Check: Hide 26-persistent-tables/tf-26.py when the task is set (it is the reference solution); give README.md of the style, the input files and the harness. Delete any tf.db left in 26-persistent-tables/ before each run: tf-26.py lines 57 to 58 build the database only when tf.db does not exist, so a stale file from an earlier run would be read instead of the submission's own tables. Mark the submitted program executable, put it in 26-persistent-tables/ and run `test/test.sh 26`: it keeps the lines containing "-" (line 36) and compares them with test/pride-and-prejudice.txt by `diff -b` (line 39); pass = no difference and "PASSED". Whether the program really keeps its data in relational tables (the style constraint) is not checked by any test and needs a code review
|
| 35 |
Companions (not included): test/test.sh; test/pride-and-prejudice.txt; pride-and-prejudice.txt; stop_words.txt; README.md; LICENSE
|
| 36 |
Dependencies: Python 3 standard library only (tf-26.py line 2 imports sys, re, string, sqlite3, os.path); no version pinned upstream: latest release on or before the unit commit date 2023-04-30, exact version not looked up this round; bash, coreutils, diffutils and GNU date for test/test.sh (line 8 uses `date -u -d @...`, a GNU option)
|
| 37 |
- `30-dataspaces/` (2 files): Exercises in Programming Style, style 30 Dataspaces: term frequency with concurrent workers that share data only through queues.
|
| 38 |
Format: Python program directory (README.md with the constraints, tf-30.py) plus a shared bash test harness, an input text and an expected-output file
|
| 39 |
Origin: style chapter of the Exercises in Programming Style book code; reference program in the same directory
|
| 40 |
-
Reference result: exact_output
|
| 41 |
-
Reference source: test/pride-and-prejudice.txt (25 lines, e.g. `mr - 786`) is the expected output for input ../pride-and-prejudice.txt; test/test.sh compares every executable in the style directory against it; tf-30.py (prints `w, '-', c`, line 52) is the reference program
|
| 42 |
Check: Hide 30-dataspaces/tf-30.py when the task is set (it is the reference solution); give README.md of the style, the input files and the harness. Mark the submitted program executable, put it in 30-dataspaces/ and run `test/test.sh 30`: it keeps the lines containing "-" (line 36) and compares them with test/pride-and-prejudice.txt by `diff -b` (line 39); pass = no difference and "PASSED". Whether the program really uses concurrent units that talk only through data spaces (the style constraint) is not checked by any test and needs a code review
|
| 43 |
Companions (not included): test/test.sh; test/pride-and-prejudice.txt; pride-and-prejudice.txt; stop_words.txt; LICENSE
|
| 44 |
Dependencies: Python 3 standard library only (tf-30.py line 2 imports re, sys, operator, queue, threading). bash, coreutils and diffutils for test/test.sh
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** 0 of 3 units are self-contained; for the others it is not stated. 3 of 3 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Tools are named in the check written per unit in the notes.
|
| 12 |
|
| 13 |
**Licence (SPDX):** MIT AND LicenseRef-ProjectGutenberg-License
|
|
|
|
| 19 |
- `29-actors/` (2 files): Exercises in Programming Style, style 29 (Actors): write the term-frequency program so that each part is an object with its own thread and message queue, printing the 25 most frequent non-stop words of Pride and Prejudice exactly as test/pride-and-prejudice.txt lists them.
|
| 20 |
Format: Python program directory (README.md with the constraints, tf-29.py) plus a shared bash test harness, an input text and an expected-output file
|
| 21 |
Origin: course exercise: one style of the Exercises in Programming Style collection, used as programming coursework; reference program plus a shared output test
|
|
|
|
|
|
|
| 22 |
Check: Hide 29-actors/tf-29.py when the task is set (it is the reference solution); give README.md of the style, the input files and the harness. Mark the submitted program executable, put it in 29-actors/ and run `test/test.sh 29`: it runs the program on ../pride-and-prejudice.txt, keeps the lines containing "-" (line 36) and compares them with test/pride-and-prejudice.txt by `diff -b` (line 39); pass = no difference and "PASSED". The harness checks the output only: whether the program really uses one thread and one queue per object (the style constraint) is not checked by any test and needs a code review.
|
| 23 |
Companions (not included): test/test.sh; test/pride-and-prejudice.txt; pride-and-prejudice.txt; stop_words.txt; README.md; LICENSE
|
| 24 |
Dependencies: Python 3 standard library only (tf-29.py imports threading, queue, re, sys); no version pinned upstream: latest CPython release on or before the unit commit date 2023-04-30, which is 3.11.3; bash, coreutils, diffutils and GNU date for test/test.sh (line 8 uses `date -u -d @...`, a GNU option)
|
| 25 |
- `26-persistent-tables/` (2 files): Exercises in Programming Style, style 26 (Persistent Tables): write the term-frequency program so that the data are loaded into relational tables and the answer comes from a query, printing the 25 most frequent non-stop words of Pride and Prejudice exactly as test/pride-and-prejudice.txt lists them.
|
| 26 |
Format: Python program directory (README.md with the constraints, tf-26.py) plus a shared bash test harness, an input text and an expected-output file
|
| 27 |
Origin: course exercise: one style of the Exercises in Programming Style collection, used as programming coursework; reference program plus a shared output test
|
|
|
|
|
|
|
| 28 |
Check: Hide 26-persistent-tables/tf-26.py when the task is set (it is the reference solution); give README.md of the style, the input files and the harness. Delete any tf.db left in 26-persistent-tables/ before each run: tf-26.py lines 57 to 58 build the database only when tf.db does not exist, so a stale file from an earlier run would be read instead of the submission's own tables. Mark the submitted program executable, put it in 26-persistent-tables/ and run `test/test.sh 26`: it keeps the lines containing "-" (line 36) and compares them with test/pride-and-prejudice.txt by `diff -b` (line 39); pass = no difference and "PASSED". Whether the program really keeps its data in relational tables (the style constraint) is not checked by any test and needs a code review
|
| 29 |
Companions (not included): test/test.sh; test/pride-and-prejudice.txt; pride-and-prejudice.txt; stop_words.txt; README.md; LICENSE
|
| 30 |
Dependencies: Python 3 standard library only (tf-26.py line 2 imports sys, re, string, sqlite3, os.path); no version pinned upstream: latest release on or before the unit commit date 2023-04-30, exact version not looked up this round; bash, coreutils, diffutils and GNU date for test/test.sh (line 8 uses `date -u -d @...`, a GNU option)
|
| 31 |
- `30-dataspaces/` (2 files): Exercises in Programming Style, style 30 Dataspaces: term frequency with concurrent workers that share data only through queues.
|
| 32 |
Format: Python program directory (README.md with the constraints, tf-30.py) plus a shared bash test harness, an input text and an expected-output file
|
| 33 |
Origin: style chapter of the Exercises in Programming Style book code; reference program in the same directory
|
|
|
|
|
|
|
| 34 |
Check: Hide 30-dataspaces/tf-30.py when the task is set (it is the reference solution); give README.md of the style, the input files and the harness. Mark the submitted program executable, put it in 30-dataspaces/ and run `test/test.sh 30`: it keeps the lines containing "-" (line 36) and compares them with test/pride-and-prejudice.txt by `diff -b` (line 39); pass = no difference and "PASSED". Whether the program really uses concurrent units that talk only through data spaces (the style constraint) is not checked by any test and needs a code review
|
| 35 |
Companions (not included): test/test.sh; test/pride-and-prejudice.txt; pride-and-prejudice.txt; stop_words.txt; LICENSE
|
| 36 |
Dependencies: Python 3 standard library only (tf-30.py line 2 imports re, sys, operator, queue, threading). bash, coreutils and diffutils for test/test.sh
|
campaign_files/2026-10-sw-tests-and-exercises-2/exercism-arm64-assembly-track/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Whether the unit needs other upstream files is not stated. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: test_pass. Where the reference result comes from and how a solution is checked is written per unit in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Check: Hide .meta/example.s when the task is set. Run `make` in the exercise directory: it builds with -Werror (Makefile line 12) and runs the test binary (under qemu-aarch64 on non-aarch64 hosts); pass = build succeeds and all 10 tests pass. The stub `tick: ret` builds but fails the tests, a built-in negative check.
|
| 14 |
|
| 15 |
**Licence (SPDX):** MIT
|
|
@@ -21,8 +19,6 @@ Units:
|
|
| 21 |
- `exercises/practice/game-of-life/` (12 files): Exercism ARM64 assembly game-of-life: implement `tick` in AArch64 assembly so that the C unit tests of the next generation pass.
|
| 22 |
Format: assembly stub, C test file with vendored Unity, Makefile; reference in .meta/
|
| 23 |
Origin: course exercise of the Exercism ARM64 Assembly track
|
| 24 |
-
Reference result: test_pass
|
| 25 |
-
Reference source: game_of_life_test.c (10 Unity tests, TEST_ASSERT_EQUAL_UINT64_ARRAY exact comparison of the next-generation rows); .meta/example.s is the reference
|
| 26 |
Check: Hide .meta/example.s when the task is set. Run `make` in the exercise directory: it builds with -Werror (Makefile line 12) and runs the test binary (under qemu-aarch64 on non-aarch64 hosts); pass = build succeeds and all 10 tests pass. The stub `tick: ret` builds but fails the tests, a built-in negative check
|
| 27 |
Companions (not included): LICENSE
|
| 28 |
Dependencies: GNU assembler and C compiler for AArch64 (Makefile lines 3 to 8 use aarch64-linux-gnu-as and aarch64-linux-gnu-gcc when not on aarch64) and qemu-aarch64 user mode to run the tests on other hosts (line 24); no version pinned upstream: latest release on or before the unit commit date the commit date of 3ef33829c160f99e4b14ebb2667d0dcf9cab4f57, exact version not looked up this round; Unity test framework vendored in vendor/ (no separate install); version pinned by the vendored copy at commit 3ef33829c160f99e4b14ebb2667d0dcf9cab4f57
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Whether the unit needs other upstream files is not stated. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Check: Hide .meta/example.s when the task is set. Run `make` in the exercise directory: it builds with -Werror (Makefile line 12) and runs the test binary (under qemu-aarch64 on non-aarch64 hosts); pass = build succeeds and all 10 tests pass. The stub `tick: ret` builds but fails the tests, a built-in negative check.
|
| 12 |
|
| 13 |
**Licence (SPDX):** MIT
|
|
|
|
| 19 |
- `exercises/practice/game-of-life/` (12 files): Exercism ARM64 assembly game-of-life: implement `tick` in AArch64 assembly so that the C unit tests of the next generation pass.
|
| 20 |
Format: assembly stub, C test file with vendored Unity, Makefile; reference in .meta/
|
| 21 |
Origin: course exercise of the Exercism ARM64 Assembly track
|
|
|
|
|
|
|
| 22 |
Check: Hide .meta/example.s when the task is set. Run `make` in the exercise directory: it builds with -Werror (Makefile line 12) and runs the test binary (under qemu-aarch64 on non-aarch64 hosts); pass = build succeeds and all 10 tests pass. The stub `tick: ret` builds but fails the tests, a built-in negative check
|
| 23 |
Companions (not included): LICENSE
|
| 24 |
Dependencies: GNU assembler and C compiler for AArch64 (Makefile lines 3 to 8 use aarch64-linux-gnu-as and aarch64-linux-gnu-gcc when not on aarch64) and qemu-aarch64 user mode to run the tests on other hosts (line 24); no version pinned upstream: latest release on or before the unit commit date the commit date of 3ef33829c160f99e4b14ebb2667d0dcf9cab4f57, exact version not looked up this round; Unity test framework vendored in vendor/ (no separate install); version pinned by the vendored copy at commit 3ef33829c160f99e4b14ebb2667d0dcf9cab4f57
|
campaign_files/2026-10-sw-tests-and-exercises-2/exercism-awk-track/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** 2 of 3 units are self-contained; for the others it is not stated. 3 of 3 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: exact_output. Where the reference result comes from and how a solution is checked is written per unit in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Check: Hide .meta/example.awk (the reference solution) and .meta/ as a whole when the task is set; give .docs/instructions.md, the stub and the bats test. Run the 3 tests with all skip markers lifted, as the track CI does: `BATS_RUN_SKIPPED=true bats test-automated-readability-index.bats` (bin/validate_one_exercise line 58; tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`). Pass = all 3 tests ok: every output line equal to the expected string (assert_line is exact string equality; the score is compared as printed text, so no numeric tolerance applies). Hide .meta/example.awk (the reference solution) and .meta/ as a whole when the task is set; give .docs/instructions.md, the stub and the bats test. Run the 12 tests with all skip markers lifted, as the track CI does: `BATS_RUN_SKIPPED=true bats test-flower-field.bats` (bin/validate_one_exercise line 58; tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`). Pass = every test ok: output equal to the expected board (assert_output is exact string equality). .meta/template.j2 and .meta/tests.toml are generator files and stay hidden with .meta/. Hide .meta/ (the reference example.awk) when the task is set; give .docs/, the stub and the bats test. Run `BATS_RUN_SKIPPED=true bats test-pascals-triangle.bats`; pass = all 9 tests ok (assert_output is exact string equality).
|
| 14 |
|
| 15 |
**Licence (SPDX):** MIT AND CC0-1.0
|
|
@@ -21,24 +19,18 @@ Units:
|
|
| 21 |
- `exercises/practice/automated-readability-index/` (6 files): Exercism AWK exercise automated-readability-index: write an awk program that previews the first three sentences of a text and prints its word, sentence and character counts, the ARI score and the reader age band, exactly as the bats tests expect.
|
| 22 |
Format: Exercism practice exercise directory (.docs/instructions.md, stub .awk, bats test, bats-extra.bash, .meta/config.json, .meta/example.awk)
|
| 23 |
Origin: course exercise: a practice exercise of the Exercism AWK track, stub plus bats tests
|
| 24 |
-
Reference result: exact_output
|
| 25 |
-
Reference source: test-automated-readability-index.bats: 3 tests, each `assert_success` plus `assert_line --index N` for every output line, including the score printed to two decimals (e.g. lines 65 to 66: `Score: 15.63`, `This text should be understood by 18-22 year-olds.`); .meta/example.awk is the reference solution
|
| 26 |
Check: Hide .meta/example.awk (the reference solution) and .meta/ as a whole when the task is set; give .docs/instructions.md, the stub and the bats test. Run the 3 tests with all skip markers lifted, as the track CI does: `BATS_RUN_SKIPPED=true bats test-automated-readability-index.bats` (bin/validate_one_exercise line 58; tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`). Pass = all 3 tests ok: every output line equal to the expected string (assert_line is exact string equality; the score is compared as printed text, so no numeric tolerance applies).
|
| 27 |
Companions (not included): LICENSE
|
| 28 |
Dependencies: gawk (the tests call `run gawk -f ...`); no version pinned upstream: latest GNU awk release on or before the unit commit date 2026-10-03, exact version not looked up this round; bats-core (bin/validate_one_exercise line 13 requires it); bats-support and bats-assert are vendored in bats-extra.bash
|
| 29 |
- `exercises/practice/flower-field/` (8 files): Exercism AWK exercise flower-field: write an awk program that reads a garden board from standard input and writes each empty square as the count of adjacent flowers, exactly as the bats tests expect.
|
| 30 |
Format: Exercism practice exercise directory (.docs/instructions.md, stub .awk, bats test, bats-extra.bash, .meta/config.json, .meta/example.awk)
|
| 31 |
Origin: course exercise: a practice exercise of the Exercism AWK track, stub plus bats tests
|
| 32 |
-
Reference result: exact_output
|
| 33 |
-
Reference source: test-flower-field.bats: each test feeds a board on standard input and checks `assert_success` and `assert_output "$expected"` against the expected board (e.g. lines 6 to 15); .meta/example.awk is the reference solution; .meta/tests.toml lists the canonical case ids
|
| 34 |
Check: Hide .meta/example.awk (the reference solution) and .meta/ as a whole when the task is set; give .docs/instructions.md, the stub and the bats test. Run the 12 tests with all skip markers lifted, as the track CI does: `BATS_RUN_SKIPPED=true bats test-flower-field.bats` (bin/validate_one_exercise line 58; tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`). Pass = every test ok: output equal to the expected board (assert_output is exact string equality). .meta/template.j2 and .meta/tests.toml are generator files and stay hidden with .meta/.
|
| 35 |
Companions (not included): LICENSE
|
| 36 |
Dependencies: gawk (the tests call `run gawk -f ...`); no version pinned upstream: latest GNU awk release on or before the unit commit date 2026-10-03, exact version not looked up this round; bats-core (bin/validate_one_exercise line 13 requires it); bats-support and bats-assert are vendored in bats-extra.bash
|
| 37 |
- `exercises/practice/pascals-triangle/` (9 files): Exercism awk pascals-triangle: print the first N rows of Pascal's triangle.
|
| 38 |
Format: Exercism practice exercise directory (.docs/, stub .awk, bats test, bats-extra.bash, .meta/ with example.awk)
|
| 39 |
Origin: practice exercise of the Exercism awk track; reference solution in .meta/
|
| 40 |
-
Reference result: exact_output
|
| 41 |
-
Reference source: test-pascals-triangle.bats: 9 tests, each runs the program on a row count read from standard input and checks assert_output against the expected rows written in the test; .meta/example.awk is the reference
|
| 42 |
Check: Hide .meta/ (the reference example.awk) when the task is set; give .docs/, the stub and the bats test. Run `BATS_RUN_SKIPPED=true bats test-pascals-triangle.bats`; pass = all 9 tests ok (assert_output is exact string equality)
|
| 43 |
Companions (not included): LICENSE
|
| 44 |
Dependencies: gawk (the tests call `run gawk -f pascals-triangle.awk`, line 11). bats-core; bats-support and bats-assert are vendored in bats-extra.bash
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** 2 of 3 units are self-contained; for the others it is not stated. 3 of 3 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Check: Hide .meta/example.awk (the reference solution) and .meta/ as a whole when the task is set; give .docs/instructions.md, the stub and the bats test. Run the 3 tests with all skip markers lifted, as the track CI does: `BATS_RUN_SKIPPED=true bats test-automated-readability-index.bats` (bin/validate_one_exercise line 58; tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`). Pass = all 3 tests ok: every output line equal to the expected string (assert_line is exact string equality; the score is compared as printed text, so no numeric tolerance applies). Hide .meta/example.awk (the reference solution) and .meta/ as a whole when the task is set; give .docs/instructions.md, the stub and the bats test. Run the 12 tests with all skip markers lifted, as the track CI does: `BATS_RUN_SKIPPED=true bats test-flower-field.bats` (bin/validate_one_exercise line 58; tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`). Pass = every test ok: output equal to the expected board (assert_output is exact string equality). .meta/template.j2 and .meta/tests.toml are generator files and stay hidden with .meta/. Hide .meta/ (the reference example.awk) when the task is set; give .docs/, the stub and the bats test. Run `BATS_RUN_SKIPPED=true bats test-pascals-triangle.bats`; pass = all 9 tests ok (assert_output is exact string equality).
|
| 12 |
|
| 13 |
**Licence (SPDX):** MIT AND CC0-1.0
|
|
|
|
| 19 |
- `exercises/practice/automated-readability-index/` (6 files): Exercism AWK exercise automated-readability-index: write an awk program that previews the first three sentences of a text and prints its word, sentence and character counts, the ARI score and the reader age band, exactly as the bats tests expect.
|
| 20 |
Format: Exercism practice exercise directory (.docs/instructions.md, stub .awk, bats test, bats-extra.bash, .meta/config.json, .meta/example.awk)
|
| 21 |
Origin: course exercise: a practice exercise of the Exercism AWK track, stub plus bats tests
|
|
|
|
|
|
|
| 22 |
Check: Hide .meta/example.awk (the reference solution) and .meta/ as a whole when the task is set; give .docs/instructions.md, the stub and the bats test. Run the 3 tests with all skip markers lifted, as the track CI does: `BATS_RUN_SKIPPED=true bats test-automated-readability-index.bats` (bin/validate_one_exercise line 58; tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`). Pass = all 3 tests ok: every output line equal to the expected string (assert_line is exact string equality; the score is compared as printed text, so no numeric tolerance applies).
|
| 23 |
Companions (not included): LICENSE
|
| 24 |
Dependencies: gawk (the tests call `run gawk -f ...`); no version pinned upstream: latest GNU awk release on or before the unit commit date 2026-10-03, exact version not looked up this round; bats-core (bin/validate_one_exercise line 13 requires it); bats-support and bats-assert are vendored in bats-extra.bash
|
| 25 |
- `exercises/practice/flower-field/` (8 files): Exercism AWK exercise flower-field: write an awk program that reads a garden board from standard input and writes each empty square as the count of adjacent flowers, exactly as the bats tests expect.
|
| 26 |
Format: Exercism practice exercise directory (.docs/instructions.md, stub .awk, bats test, bats-extra.bash, .meta/config.json, .meta/example.awk)
|
| 27 |
Origin: course exercise: a practice exercise of the Exercism AWK track, stub plus bats tests
|
|
|
|
|
|
|
| 28 |
Check: Hide .meta/example.awk (the reference solution) and .meta/ as a whole when the task is set; give .docs/instructions.md, the stub and the bats test. Run the 12 tests with all skip markers lifted, as the track CI does: `BATS_RUN_SKIPPED=true bats test-flower-field.bats` (bin/validate_one_exercise line 58; tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`). Pass = every test ok: output equal to the expected board (assert_output is exact string equality). .meta/template.j2 and .meta/tests.toml are generator files and stay hidden with .meta/.
|
| 29 |
Companions (not included): LICENSE
|
| 30 |
Dependencies: gawk (the tests call `run gawk -f ...`); no version pinned upstream: latest GNU awk release on or before the unit commit date 2026-10-03, exact version not looked up this round; bats-core (bin/validate_one_exercise line 13 requires it); bats-support and bats-assert are vendored in bats-extra.bash
|
| 31 |
- `exercises/practice/pascals-triangle/` (9 files): Exercism awk pascals-triangle: print the first N rows of Pascal's triangle.
|
| 32 |
Format: Exercism practice exercise directory (.docs/, stub .awk, bats test, bats-extra.bash, .meta/ with example.awk)
|
| 33 |
Origin: practice exercise of the Exercism awk track; reference solution in .meta/
|
|
|
|
|
|
|
| 34 |
Check: Hide .meta/ (the reference example.awk) when the task is set; give .docs/, the stub and the bats test. Run `BATS_RUN_SKIPPED=true bats test-pascals-triangle.bats`; pass = all 9 tests ok (assert_output is exact string equality)
|
| 35 |
Companions (not included): LICENSE
|
| 36 |
Dependencies: gawk (the tests call `run gawk -f pascals-triangle.awk`, line 11). bats-core; bats-support and bats-assert are vendored in bats-extra.bash
|
campaign_files/2026-10-sw-tests-and-exercises-2/exercism-bash-track/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Whether the unit needs other upstream files is not stated. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: exact_output. Where the reference result comes from and how a solution is checked is written per unit in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Check: Hide .meta/ (the reference example.sh and the test generator) when the task is set; give .docs/instructions.md, the stub and the bats test. Run `BATS_RUN_SKIPPED=true bats rotational_cipher.bats` (tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`, line 15); pass = all 10 tests ok (assert_output is exact string equality).
|
| 14 |
|
| 15 |
**Licence (SPDX):** MIT AND CC0-1.0
|
|
@@ -21,8 +19,6 @@ Units:
|
|
| 21 |
- `exercises/practice/rotational-cipher/` (8 files): Exercism bash rotational-cipher: rotate the letters of a text by a key, keeping case and other characters.
|
| 22 |
Format: Exercism practice exercise directory (.docs/instructions.md, stub .sh, bats test, bats-extra.bash, .meta/ with example.sh)
|
| 23 |
Origin: practice exercise of the Exercism bash track; reference solution in .meta/
|
| 24 |
-
Reference result: exact_output
|
| 25 |
-
Reference source: rotational_cipher.bats: 10 tests, each `assert_success` and `assert_output "$expected"` (lines 10 to 11 for the first), the expected cipher text written in the test; .meta/example.sh is the reference
|
| 26 |
Check: Hide .meta/ (the reference example.sh and the test generator) when the task is set; give .docs/instructions.md, the stub and the bats test. Run `BATS_RUN_SKIPPED=true bats rotational_cipher.bats` (tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`, line 15); pass = all 10 tests ok (assert_output is exact string equality)
|
| 27 |
Companions (not included): LICENSE
|
| 28 |
Dependencies: bash and bats-core to run the .bats file; bats-support and bats-assert are vendored in bats-extra.bash.
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Whether the unit needs other upstream files is not stated. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Check: Hide .meta/ (the reference example.sh and the test generator) when the task is set; give .docs/instructions.md, the stub and the bats test. Run `BATS_RUN_SKIPPED=true bats rotational_cipher.bats` (tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`, line 15); pass = all 10 tests ok (assert_output is exact string equality).
|
| 12 |
|
| 13 |
**Licence (SPDX):** MIT AND CC0-1.0
|
|
|
|
| 19 |
- `exercises/practice/rotational-cipher/` (8 files): Exercism bash rotational-cipher: rotate the letters of a text by a key, keeping case and other characters.
|
| 20 |
Format: Exercism practice exercise directory (.docs/instructions.md, stub .sh, bats test, bats-extra.bash, .meta/ with example.sh)
|
| 21 |
Origin: practice exercise of the Exercism bash track; reference solution in .meta/
|
|
|
|
|
|
|
| 22 |
Check: Hide .meta/ (the reference example.sh and the test generator) when the task is set; give .docs/instructions.md, the stub and the bats test. Run `BATS_RUN_SKIPPED=true bats rotational_cipher.bats` (tests after the first carry `[[ $BATS_RUN_SKIPPED == "true" ]] || skip`, line 15); pass = all 10 tests ok (assert_output is exact string equality)
|
| 23 |
Companions (not included): LICENSE
|
| 24 |
Dependencies: bash and bats-core to run the .bats file; bats-support and bats-assert are vendored in bats-extra.bash.
|
campaign_files/2026-10-sw-tests-and-exercises-2/exercism-bash/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Not self-contained: each unit is used together with other files from the same upstream. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: expected_stdout_per_test. Where the reference result comes from and how a solution is checked is written per unit in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Check: Run bats run_length_encoding.bats with bats-core (bats-extra.bash supplies assert_success and assert_output); pass means all 13 tests pass. Run against .meta/example.sh to confirm the reference passes.
|
| 14 |
|
| 15 |
**Licence (SPDX):** MIT
|
|
@@ -21,8 +19,6 @@ Units:
|
|
| 21 |
- `exercises/practice/run-length-encoding/` (7 files): Exercism Bash track: run-length-encoding (encode and decode strings in pure Bash, bats tests).
|
| 22 |
Format: Bash stub script plus bats-core test file (13 @test cases with literal expected stdout), Markdown instructions, tests.toml, reference solution .meta/example.sh
|
| 23 |
Origin: programming exercise or course assignment shipped with its tests and expected results (was course_exercise_with_tests)
|
| 24 |
-
Reference result: expected_stdout_per_test
|
| 25 |
-
Reference source: each bats @test runs the script with given arguments and asserts exit status and the exact expected output string; .meta/example.sh is the upstream reference solution; when making the task, withhold .meta/example.sh
|
| 26 |
Check: Run bats run_length_encoding.bats with bats-core (bats-extra.bash supplies assert_success and assert_output); pass means all 13 tests pass. Run against .meta/example.sh to confirm the reference passes.
|
| 27 |
Companions (not included): exercises/practice/run-length-encoding/bats-extra.bash
|
| 28 |
Dependencies: bats-core: runs the .bats file; not packed
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Not self-contained: each unit is used together with other files from the same upstream. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Check: Run bats run_length_encoding.bats with bats-core (bats-extra.bash supplies assert_success and assert_output); pass means all 13 tests pass. Run against .meta/example.sh to confirm the reference passes.
|
| 12 |
|
| 13 |
**Licence (SPDX):** MIT
|
|
|
|
| 19 |
- `exercises/practice/run-length-encoding/` (7 files): Exercism Bash track: run-length-encoding (encode and decode strings in pure Bash, bats tests).
|
| 20 |
Format: Bash stub script plus bats-core test file (13 @test cases with literal expected stdout), Markdown instructions, tests.toml, reference solution .meta/example.sh
|
| 21 |
Origin: programming exercise or course assignment shipped with its tests and expected results (was course_exercise_with_tests)
|
|
|
|
|
|
|
| 22 |
Check: Run bats run_length_encoding.bats with bats-core (bats-extra.bash supplies assert_success and assert_output); pass means all 13 tests pass. Run against .meta/example.sh to confirm the reference passes.
|
| 23 |
Companions (not included): exercises/practice/run-length-encoding/bats-extra.bash
|
| 24 |
Dependencies: bats-core: runs the .bats file; not packed
|
campaign_files/2026-10-sw-tests-and-exercises-2/exercism-clojure-track/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Whether the unit needs other upstream files is not stated. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: test_pass. Where the reference result comes from and how a solution is checked is written per unit in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Check: Hand out the stub project. Run `clojure -X:test` (or `lein test`); pass = 0 failures, 0 errors. `=` is exact equality of the flattened sequences. The judge restores the test file, deps.edn and project.clj from the pinned copies.
|
| 14 |
|
| 15 |
**Licence (SPDX):** MIT
|
|
@@ -21,8 +19,6 @@ Units:
|
|
| 21 |
- `exercises/practice/flatten-array/` (12 files): Exercism Clojure flatten-array: implement flatten so that the 11 clojure.test tests pass.
|
| 22 |
Format: Clojure project (deps.edn, project.clj, src stub, test file)
|
| 23 |
Origin: practice exercise `flatten-array` of the Exercism clojure track: stub file, test file, track build files and the reference solution under .meta; the test file is the answer
|
| 24 |
-
Reference result: test_pass
|
| 25 |
-
Reference source: exercises/practice/flatten-array/test/flatten_array_test.clj: 11 deftest forms with `(is (= ...))` on exact vectors, e.g. lines 10 to 12: `(deftest flatten_test_2` ... `(is (= [0 1 2]`; reference .meta/example.clj
|
| 26 |
Check: Hand out the stub project. Run `clojure -X:test` (or `lein test`); pass = 0 failures, 0 errors. `=` is exact equality of the flattened sequences. The judge restores the test file, deps.edn and project.clj from the pinned copies.
|
| 27 |
Companions (not included): LICENSE
|
| 28 |
Dependencies: Clojure CLI (deps.edn) or Leiningen (project.clj)
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Whether the unit needs other upstream files is not stated. 1 of 1 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Check: Hand out the stub project. Run `clojure -X:test` (or `lein test`); pass = 0 failures, 0 errors. `=` is exact equality of the flattened sequences. The judge restores the test file, deps.edn and project.clj from the pinned copies.
|
| 12 |
|
| 13 |
**Licence (SPDX):** MIT
|
|
|
|
| 19 |
- `exercises/practice/flatten-array/` (12 files): Exercism Clojure flatten-array: implement flatten so that the 11 clojure.test tests pass.
|
| 20 |
Format: Clojure project (deps.edn, project.clj, src stub, test file)
|
| 21 |
Origin: practice exercise `flatten-array` of the Exercism clojure track: stub file, test file, track build files and the reference solution under .meta; the test file is the answer
|
|
|
|
|
|
|
| 22 |
Check: Hand out the stub project. Run `clojure -X:test` (or `lein test`); pass = 0 failures, 0 errors. `=` is exact equality of the flattened sequences. The judge restores the test file, deps.edn and project.clj from the pinned copies.
|
| 23 |
Companions (not included): LICENSE
|
| 24 |
Dependencies: Clojure CLI (deps.edn) or Leiningen (project.clj)
|
campaign_files/2026-10-sw-tests-and-exercises-2/exercism-cobol/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Not self-contained: each unit is used together with other files from the same upstream. 4 of 4 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: pass_fail_assertions. Where the reference result comes from and how a solution is checked is written per unit in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Check: Pass when all 18 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness. pass when all 24 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness. pass when all 19 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness. pass when all 14 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness.
|
| 14 |
|
| 15 |
**Licence (SPDX):** MIT
|
|
@@ -21,32 +19,24 @@ Units:
|
|
| 21 |
- `exercises/practice/luhn/` (8 files): Exercism COBOL track: luhn (Luhn checksum validation); COBOL stub, cobol-check unit tests (18 test cases) and reference solution.
|
| 22 |
Format: COBOL source stub src/luhn.cob, cobol-check test file tst/luhn/luhn.cut, config.properties, test.sh, Markdown instructions, .meta/config.json, reference solution .meta/proof.ci.cob
|
| 23 |
Origin: exercise, tests and reference solution written by Exercism track maintainers (tool_fixture)
|
| 24 |
-
Reference result: pass_fail_assertions
|
| 25 |
-
Reference source: .meta/proof.ci.cob is the reference solution; tst/luhn/luhn.cut holds 18 TestCase blocks with EXPECT assertions on working-storage fields
|
| 26 |
Check: pass when all 18 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness.
|
| 27 |
Companions (not included): LICENSE; bin/fetch-cobolcheck
|
| 28 |
Dependencies: GnuCOBOL 3.x (cobc -xj); cobol-check (0xE282B0/cobol-check, latest release fetched by bin/fetch-cobolcheck, not pinned; pin a release at delivery); bash
|
| 29 |
- `exercises/practice/roman-numerals/` (8 files): Exercism COBOL track: roman-numerals (Arabic to Roman numeral conversion); COBOL stub, cobol-check unit tests (24 test cases) and reference solution.
|
| 30 |
Format: COBOL source stub src/roman-numerals.cob, cobol-check test file tst/roman-numerals/roman-numerals.cut, config.properties, test.sh, Markdown instructions, .meta/config.json, reference solution .meta/proof.ci.cob
|
| 31 |
Origin: exercise, tests and reference solution written by Exercism track maintainers (tool_fixture)
|
| 32 |
-
Reference result: pass_fail_assertions
|
| 33 |
-
Reference source: .meta/proof.ci.cob is the reference solution; tst/roman-numerals/roman-numerals.cut holds 24 TestCase blocks with EXPECT assertions on working-storage fields
|
| 34 |
Check: pass when all 24 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness.
|
| 35 |
Companions (not included): LICENSE; bin/fetch-cobolcheck
|
| 36 |
Dependencies: GnuCOBOL 3.x (cobc -xj); cobol-check (0xE282B0/cobol-check, latest release fetched by bin/fetch-cobolcheck, not pinned; pin a release at delivery); bash
|
| 37 |
- `exercises/practice/matching-brackets/` (8 files): Exercism COBOL track: matching-brackets (balanced bracket checking); COBOL stub, cobol-check unit tests (19 test cases) and reference solution.
|
| 38 |
Format: COBOL source stub src/matching-brackets.cob, cobol-check test file tst/matching-brackets/matching-brackets.cut, config.properties, test.sh, Markdown instructions, .meta/config.json, reference solution .meta/proof.ci.cob
|
| 39 |
Origin: exercise, tests and reference solution written by Exercism track maintainers (tool_fixture)
|
| 40 |
-
Reference result: pass_fail_assertions
|
| 41 |
-
Reference source: .meta/proof.ci.cob is the reference solution; tst/matching-brackets/matching-brackets.cut holds 19 TestCase blocks with EXPECT assertions on working-storage fields
|
| 42 |
Check: pass when all 19 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness.
|
| 43 |
Companions (not included): LICENSE; bin/fetch-cobolcheck
|
| 44 |
Dependencies: GnuCOBOL 3.x (cobc -xj); cobol-check (0xE282B0/cobol-check, latest release fetched by bin/fetch-cobolcheck, not pinned; pin a release at delivery); bash
|
| 45 |
- `exercises/practice/atbash-cipher/` (7 files): Exercism COBOL track: atbash-cipher (Atbash cipher encode and decode); COBOL stub, cobol-check unit tests (14 test cases) and reference solution.
|
| 46 |
Format: COBOL source stub src/atbash-cipher.cob, cobol-check test file tst/atbash-cipher/atbash-cipher.cut, config.properties, test.sh, Markdown instructions, .meta/config.json, reference solution .meta/proof.ci.cob
|
| 47 |
Origin: exercise, tests and reference solution written by Exercism track maintainers (tool_fixture)
|
| 48 |
-
Reference result: pass_fail_assertions
|
| 49 |
-
Reference source: .meta/proof.ci.cob is the reference solution; tst/atbash-cipher/atbash-cipher.cut holds 14 TestCase blocks with EXPECT assertions on working-storage fields
|
| 50 |
Check: pass when all 14 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness.
|
| 51 |
Companions (not included): LICENSE; bin/fetch-cobolcheck
|
| 52 |
Dependencies: GnuCOBOL 3.x (cobc -xj); cobol-check (0xE282B0/cobol-check, latest release fetched by bin/fetch-cobolcheck, not pinned; pin a release at delivery); bash
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Not self-contained: each unit is used together with other files from the same upstream. 4 of 4 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Check: Pass when all 18 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness. pass when all 24 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness. pass when all 19 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness. pass when all 14 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness.
|
| 12 |
|
| 13 |
**Licence (SPDX):** MIT
|
|
|
|
| 19 |
- `exercises/practice/luhn/` (8 files): Exercism COBOL track: luhn (Luhn checksum validation); COBOL stub, cobol-check unit tests (18 test cases) and reference solution.
|
| 20 |
Format: COBOL source stub src/luhn.cob, cobol-check test file tst/luhn/luhn.cut, config.properties, test.sh, Markdown instructions, .meta/config.json, reference solution .meta/proof.ci.cob
|
| 21 |
Origin: exercise, tests and reference solution written by Exercism track maintainers (tool_fixture)
|
|
|
|
|
|
|
| 22 |
Check: pass when all 18 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness.
|
| 23 |
Companions (not included): LICENSE; bin/fetch-cobolcheck
|
| 24 |
Dependencies: GnuCOBOL 3.x (cobc -xj); cobol-check (0xE282B0/cobol-check, latest release fetched by bin/fetch-cobolcheck, not pinned; pin a release at delivery); bash
|
| 25 |
- `exercises/practice/roman-numerals/` (8 files): Exercism COBOL track: roman-numerals (Arabic to Roman numeral conversion); COBOL stub, cobol-check unit tests (24 test cases) and reference solution.
|
| 26 |
Format: COBOL source stub src/roman-numerals.cob, cobol-check test file tst/roman-numerals/roman-numerals.cut, config.properties, test.sh, Markdown instructions, .meta/config.json, reference solution .meta/proof.ci.cob
|
| 27 |
Origin: exercise, tests and reference solution written by Exercism track maintainers (tool_fixture)
|
|
|
|
|
|
|
| 28 |
Check: pass when all 24 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness.
|
| 29 |
Companions (not included): LICENSE; bin/fetch-cobolcheck
|
| 30 |
Dependencies: GnuCOBOL 3.x (cobc -xj); cobol-check (0xE282B0/cobol-check, latest release fetched by bin/fetch-cobolcheck, not pinned; pin a release at delivery); bash
|
| 31 |
- `exercises/practice/matching-brackets/` (8 files): Exercism COBOL track: matching-brackets (balanced bracket checking); COBOL stub, cobol-check unit tests (19 test cases) and reference solution.
|
| 32 |
Format: COBOL source stub src/matching-brackets.cob, cobol-check test file tst/matching-brackets/matching-brackets.cut, config.properties, test.sh, Markdown instructions, .meta/config.json, reference solution .meta/proof.ci.cob
|
| 33 |
Origin: exercise, tests and reference solution written by Exercism track maintainers (tool_fixture)
|
|
|
|
|
|
|
| 34 |
Check: pass when all 19 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness.
|
| 35 |
Companions (not included): LICENSE; bin/fetch-cobolcheck
|
| 36 |
Dependencies: GnuCOBOL 3.x (cobc -xj); cobol-check (0xE282B0/cobol-check, latest release fetched by bin/fetch-cobolcheck, not pinned; pin a release at delivery); bash
|
| 37 |
- `exercises/practice/atbash-cipher/` (7 files): Exercism COBOL track: atbash-cipher (Atbash cipher encode and decode); COBOL stub, cobol-check unit tests (14 test cases) and reference solution.
|
| 38 |
Format: COBOL source stub src/atbash-cipher.cob, cobol-check test file tst/atbash-cipher/atbash-cipher.cut, config.properties, test.sh, Markdown instructions, .meta/config.json, reference solution .meta/proof.ci.cob
|
| 39 |
Origin: exercise, tests and reference solution written by Exercism track maintainers (tool_fixture)
|
|
|
|
|
|
|
| 40 |
Check: pass when all 14 test cases report PASS and the run exits 0. The reference solution is withheld from the task and used only to check the harness.
|
| 41 |
Companions (not included): LICENSE; bin/fetch-cobolcheck
|
| 42 |
Dependencies: GnuCOBOL 3.x (cobc -xj); cobol-check (0xE282B0/cobol-check, latest release fetched by bin/fetch-cobolcheck, not pinned; pin a release at delivery); bash
|
campaign_files/2026-10-sw-tests-and-exercises-2/exercism-csharp-track/README.md
CHANGED
|
@@ -8,8 +8,6 @@
|
|
| 8 |
|
| 9 |
**Self-contained:** Whether each unit needs other upstream files is not stated. 2 of 2 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
| 11 |
-
**Answers:** No answer files are included. Reference result: test_pass. Where the reference result comes from and how a solution is checked is written per unit in the notes.
|
| 12 |
-
|
| 13 |
**Tools to open and check:** Check: Hand out the stub project. Remove the Skip properties (as the Exercism test runner does) and run `dotnet test`; pass = 6 passed, 0 failed. Assert.Equal is exact; the two private key tests draw 1,000 keys for p = 7919, require each key in range and at least 900 distinct keys. The randomness check can in principle fail by chance, at a very small rate (expected distinct count about 940). Hand out the stub project. Remove any Skip properties (as the Exercism test runner does) and run `dotnet test`; pass = 28 passed, 0 failed. Assert.Equal compares the result record exactly (status, cards played, tricks). The judge restores CamiciaTests.cs and Camicia.csproj from the pinned copies.
|
| 14 |
|
| 15 |
**Licence (SPDX):** MIT
|
|
@@ -21,16 +19,12 @@ Units:
|
|
| 21 |
- `exercises/practice/diffie-hellman/` (15 files): Exercism C# diffie-hellman: implement PrivateKey, PublicKey and Secret so that the 6 xunit tests pass.
|
| 22 |
Format: C# project (DiffieHellman.csproj, packages.lock.json, stub, DiffieHellmanTests.cs)
|
| 23 |
Origin: practice exercise `diffie-hellman` of the Exercism csharp track: stub file, test file, track build files and the reference solution under .meta; the test file is the answer
|
| 24 |
-
Reference result: test_pass
|
| 25 |
-
Reference source: exercises/practice/diffie-hellman/DiffieHellmanTests.cs: 6 [Fact] tests (5 with Skip): exact BigInteger results, e.g. line 30: `Assert.Equal(new BigInteger(8), DiffieHellman.PublicKey(p, g, privateKey));`, range checks on 1,000 private keys (line 12) and a randomness check (line 21); reference .meta/Example.cs
|
| 26 |
Check: Hand out the stub project. Remove the Skip properties (as the Exercism test runner does) and run `dotnet test`; pass = 6 passed, 0 failed. Assert.Equal is exact; the two private key tests draw 1,000 keys for p = 7919, require each key in range and at least 900 distinct keys. The randomness check can in principle fail by chance, at a very small rate (expected distinct count about 940).
|
| 27 |
Companions (not included): LICENSE
|
| 28 |
Dependencies: dotnet SDK for net10.0 with xunit (packages.lock.json pins the packages)
|
| 29 |
- `exercises/practice/camicia/` (11 files): Exercism C# camicia: implement Camicia.SimulateGame so that the 28 xunit tests pass.
|
| 30 |
Format: C# project (Camicia.csproj, stub, CamiciaTests.cs)
|
| 31 |
Origin: practice exercise `camicia` of the Exercism csharp track: stub file, test file, track build files and the reference solution under .meta; the test file is the answer
|
| 32 |
-
Reference result: test_pass
|
| 33 |
-
Reference source: exercises/practice/camicia/CamiciaTests.cs: 28 [Fact] tests, each `Assert.Equal(expected, Camicia.SimulateGame(playerA, playerB));` (e.g. line 11); reference .meta/Example.cs
|
| 34 |
Check: Hand out the stub project. Remove any Skip properties (as the Exercism test runner does) and run `dotnet test`; pass = 28 passed, 0 failed. Assert.Equal compares the result record exactly (status, cards played, tricks). The judge restores CamiciaTests.cs and Camicia.csproj from the pinned copies.
|
| 35 |
Companions (not included): LICENSE
|
| 36 |
Dependencies: dotnet SDK for net10.0 with xunit
|
|
|
|
| 8 |
|
| 9 |
**Self-contained:** Whether each unit needs other upstream files is not stated. 2 of 2 units name companion files (other upstream files read alongside); companions are not included in this delivery and are listed per unit in the notes. Dependencies named upstream are listed per unit in the notes.
|
| 10 |
|
|
|
|
|
|
|
| 11 |
**Tools to open and check:** Check: Hand out the stub project. Remove the Skip properties (as the Exercism test runner does) and run `dotnet test`; pass = 6 passed, 0 failed. Assert.Equal is exact; the two private key tests draw 1,000 keys for p = 7919, require each key in range and at least 900 distinct keys. The randomness check can in principle fail by chance, at a very small rate (expected distinct count about 940). Hand out the stub project. Remove any Skip properties (as the Exercism test runner does) and run `dotnet test`; pass = 28 passed, 0 failed. Assert.Equal compares the result record exactly (status, cards played, tricks). The judge restores CamiciaTests.cs and Camicia.csproj from the pinned copies.
|
| 12 |
|
| 13 |
**Licence (SPDX):** MIT
|
|
|
|
| 19 |
- `exercises/practice/diffie-hellman/` (15 files): Exercism C# diffie-hellman: implement PrivateKey, PublicKey and Secret so that the 6 xunit tests pass.
|
| 20 |
Format: C# project (DiffieHellman.csproj, packages.lock.json, stub, DiffieHellmanTests.cs)
|
| 21 |
Origin: practice exercise `diffie-hellman` of the Exercism csharp track: stub file, test file, track build files and the reference solution under .meta; the test file is the answer
|
|
|
|
|
|
|
| 22 |
Check: Hand out the stub project. Remove the Skip properties (as the Exercism test runner does) and run `dotnet test`; pass = 6 passed, 0 failed. Assert.Equal is exact; the two private key tests draw 1,000 keys for p = 7919, require each key in range and at least 900 distinct keys. The randomness check can in principle fail by chance, at a very small rate (expected distinct count about 940).
|
| 23 |
Companions (not included): LICENSE
|
| 24 |
Dependencies: dotnet SDK for net10.0 with xunit (packages.lock.json pins the packages)
|
| 25 |
- `exercises/practice/camicia/` (11 files): Exercism C# camicia: implement Camicia.SimulateGame so that the 28 xunit tests pass.
|
| 26 |
Format: C# project (Camicia.csproj, stub, CamiciaTests.cs)
|
| 27 |
Origin: practice exercise `camicia` of the Exercism csharp track: stub file, test file, track build files and the reference solution under .meta; the test file is the answer
|
|
|
|
|
|
|
| 28 |
Check: Hand out the stub project. Remove any Skip properties (as the Exercism test runner does) and run `dotnet test`; pass = 28 passed, 0 failed. Assert.Equal compares the result record exactly (status, cards played, tricks). The judge restores CamiciaTests.cs and Camicia.csproj from the pinned copies.
|
| 29 |
Companions (not included): LICENSE
|
| 30 |
Dependencies: dotnet SDK for net10.0 with xunit
|
cards/0xdea-semgrep-rules.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = '0xdea-semgrep-rules'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = '0xdea-semgrep-rules'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = '0xdea-semgrep-rules'
|
cards/1brc-test-samples.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = '1brc-test-samples'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = '1brc-test-samples'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = '1brc-test-samples'
|
cards/2dpacklib.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = '2dpacklib'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = '2dpacklib'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = '2dpacklib'
|
cards/abacus-integrate-tests.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'abacus-integrate-tests'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'abacus-integrate-tests'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'abacus-integrate-tests'
|
cards/abhishekumarr00-supply-chain-mastery.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'abhishekumarr00-supply-chain-mastery'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'abhishekumarr00-supply-chain-mastery'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'abhishekumarr00-supply-chain-mastery'
|
cards/academy-bus-nj-gtfs.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'academy-bus-nj-gtfs'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'academy-bus-nj-gtfs'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'academy-bus-nj-gtfs'
|
cards/accordproject-cicero-template-library.md
CHANGED
|
@@ -52,10 +52,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 52 |
|
| 53 |
## Query this source at a fixed release
|
| 54 |
|
| 55 |
-
Pinned to the release tag `release-2026-11-11.
|
| 56 |
|
| 57 |
```sql
|
| 58 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 59 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 60 |
FROM read_parquet(getvariable('files'))
|
| 61 |
WHERE source = 'accordproject-cicero-template-library'
|
|
|
|
| 52 |
|
| 53 |
## Query this source at a fixed release
|
| 54 |
|
| 55 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 56 |
|
| 57 |
```sql
|
| 58 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'accordproject-cicero-template-library'));
|
| 59 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 60 |
FROM read_parquet(getvariable('files'))
|
| 61 |
WHERE source = 'accordproject-cicero-template-library'
|
cards/activity-schema-aggregate-in-between-1.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'activity-schema-aggregate-in-between-1'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'activity-schema-aggregate-in-between-1'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'activity-schema-aggregate-in-between-1'
|
cards/activity-schema-first-in-between-2.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'activity-schema-first-in-between-2'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'activity-schema-first-in-between-2'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'activity-schema-first-in-between-2'
|
cards/acwf-verification.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'acwf-verification'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'acwf-verification'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'acwf-verification'
|
cards/adflib-adf-deleted.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'adflib-adf-deleted'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'adflib-adf-deleted'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'adflib-adf-deleted'
|
cards/adflib-adf-malformed.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'adflib-adf-malformed'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'adflib-adf-malformed'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'adflib-adf-malformed'
|
cards/adventure-works-oltp-sample.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'adventure-works-oltp-sample'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'adventure-works-oltp-sample'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'adventure-works-oltp-sample'
|
cards/agat-tests.md
CHANGED
|
@@ -52,10 +52,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 52 |
|
| 53 |
## Query this source at a fixed release
|
| 54 |
|
| 55 |
-
Pinned to the release tag `release-2026-11-11.
|
| 56 |
|
| 57 |
```sql
|
| 58 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 59 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 60 |
FROM read_parquet(getvariable('files'))
|
| 61 |
WHERE source = 'agat-tests'
|
|
|
|
| 52 |
|
| 53 |
## Query this source at a fixed release
|
| 54 |
|
| 55 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 56 |
|
| 57 |
```sql
|
| 58 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'agat-tests'));
|
| 59 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 60 |
FROM read_parquet(getvariable('files'))
|
| 61 |
WHERE source = 'agat-tests'
|
cards/agl-gerrit-changes.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'agl-gerrit-changes'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'agl-gerrit-changes'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'agl-gerrit-changes'
|
cards/aiops2018-kpi.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'aiops2018-kpi'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'aiops2018-kpi'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'aiops2018-kpi'
|
cards/akretion-factur-x-libreoffice-extension.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'akretion-factur-x-libreoffice-extension'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'akretion-factur-x-libreoffice-extension'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'akretion-factur-x-libreoffice-extension'
|
cards/allenporter-ical-recurring-single-change.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'allenporter-ical-recurring-single-change'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'allenporter-ical-recurring-single-change'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'allenporter-ical-recurring-single-change'
|
cards/altlinux-devel.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'altlinux-devel'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'altlinux-devel'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'altlinux-devel'
|
cards/alumik-nkthesis-testfiles.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'alumik-nkthesis-testfiles'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'alumik-nkthesis-testfiles'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'alumik-nkthesis-testfiles'
|
cards/aml-dbt-rule-unit-tests.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'aml-dbt-rule-unit-tests'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'aml-dbt-rule-unit-tests'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'aml-dbt-rule-unit-tests'
|
cards/ancuber-cubst-tests.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'ancuber-cubst-tests'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'ancuber-cubst-tests'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'ancuber-cubst-tests'
|
cards/annabel-lee-wikisource-reading.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'annabel-lee-wikisource-reading'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'annabel-lee-wikisource-reading'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'annabel-lee-wikisource-reading'
|
cards/ansible-galaxy-collections.md
CHANGED
|
@@ -48,10 +48,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 48 |
|
| 49 |
## Query this source at a fixed release
|
| 50 |
|
| 51 |
-
Pinned to the release tag `release-2026-11-11.
|
| 52 |
|
| 53 |
```sql
|
| 54 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 55 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 56 |
FROM read_parquet(getvariable('files'))
|
| 57 |
WHERE source = 'ansible-galaxy-collections'
|
|
|
|
| 48 |
|
| 49 |
## Query this source at a fixed release
|
| 50 |
|
| 51 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 52 |
|
| 53 |
```sql
|
| 54 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'ansible-galaxy-collections'));
|
| 55 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 56 |
FROM read_parquet(getvariable('files'))
|
| 57 |
WHERE source = 'ansible-galaxy-collections'
|
cards/aomedia-gerrit-changes.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'aomedia-gerrit-changes'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'aomedia-gerrit-changes'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'aomedia-gerrit-changes'
|
cards/aosp-gerrit-changes.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'aosp-gerrit-changes'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'aosp-gerrit-changes'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'aosp-gerrit-changes'
|
cards/apache-arrow-testing.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'apache-arrow-testing'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'apache-arrow-testing'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'apache-arrow-testing'
|
cards/apache-beam-katas-python.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'apache-beam-katas-python'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'apache-beam-katas-python'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'apache-beam-katas-python'
|
cards/apache-hop-integration-tests.md
CHANGED
|
@@ -50,10 +50,10 @@ Size quantiles: unknown (no size distribution recorded for this source).
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
-
Pinned to the release tag `release-2026-11-11.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'apache-hop-integration-tests'
|
|
|
|
| 50 |
|
| 51 |
## Query this source at a fixed release
|
| 52 |
|
| 53 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 54 |
|
| 55 |
```sql
|
| 56 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'apache-hop-integration-tests'));
|
| 57 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 58 |
FROM read_parquet(getvariable('files'))
|
| 59 |
WHERE source = 'apache-hop-integration-tests'
|
cards/apache-jira.md
CHANGED
|
@@ -48,10 +48,10 @@ Size of one row, upper bounds by quantile: 10% 7 B, 50% 511 B, 90% 2.05 KB, 99%
|
|
| 48 |
|
| 49 |
## Query this source at a fixed release
|
| 50 |
|
| 51 |
-
Pinned to the release tag `release-2026-11-11.
|
| 52 |
|
| 53 |
```sql
|
| 54 |
-
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.
|
| 55 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 56 |
FROM read_parquet(getvariable('files'))
|
| 57 |
WHERE source = 'apache-jira'
|
|
|
|
| 48 |
|
| 49 |
## Query this source at a fixed release
|
| 50 |
|
| 51 |
+
Pinned to the release tag `release-2026-11-11.6`.
|
| 52 |
|
| 53 |
```sql
|
| 54 |
+
SET VARIABLE files = (SELECT list('hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/' || f) FROM (SELECT unnest(data_files) AS f FROM 'hf://datasets/Battam/agentic-env-index@release-2026-11-11.6/meta/catalog.parquet' WHERE source = 'apache-jira'));
|
| 55 |
SELECT uri, ext, size_bytes, lower(hex(sha256)) AS sha256
|
| 56 |
FROM read_parquet(getvariable('files'))
|
| 57 |
WHERE source = 'apache-jira'
|