sileod/LogicHaystacks
Evaluation code: def parse(x): if '<answer>' in x and '</answer>' in x: start = x.find('<answer>') + len('<answer>') end = x.find('</answer>') x = x[start:end] lines = [i.lstrip('L').strip() for i in x.strip().strip('.').split(',')] return [int(i) for i in lines if i.isnumeric()] def jaccard(list1, list2): intersection = len(list(set(list1).intersection(list2))) union = (len(set(list1)) + len(set(list2))) - intersection… See the full description on the dataset page: https://huggingface.co/datasets/sileod/LogicHaystacks.
| Author / organization | sileod |
|---|---|
| License (as declared) | cc-by-4.0 |
| Downloads | 232 (as reported by Hugging Face) |
| Likes | 0 |
| Created | 11 February 2025 |
| Last updated at source | 11 September 2025 |
Popularity, last 2 days
232 now (-10 since 2026-10-16). Counts as reported by the source, snapshotted daily by Silytics.
Recent changes
- 17 Oct 2026 Description: Evaluation code: def parse(x): if '<answer>' in x and '</answer>' in x: start = x.find('<answer>') + len('<answer>') end = x.find('</answer>') x = x[start:end] lines = [i.lstrip('L').strip() for i in x.strip().strip('.').split(',')] return → Evaluation code: def parse(x): if '<answer>' in x and '</answer>' in x: start = x.find('<answer>') + len('<answer>') end = x.find('</answer>') x = x[start:end] lines = [i.lstrip('L').strip() for i in x.strip().strip('.').split(',')] return
Changes detected by Silytics between refreshes of the source.
More from sileod
- sileod/discoveryDataset
- sileod/mindgamesDataset
- sileod/probability_words_nliDataset
- sileod/pragmevalDataset
- sileod/reddit-riddlesDataset
- sileod/ModalFlipDataset
Silytics shows public metadata from Hugging Face and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.