Datasets:
Tasks:
Text Generation
Formats:
json
Languages:
English
Size:
10K - 100K
Tags:
narrative-reasoning
character-consistency
recurrent-depth-transformer
story-generation
Synthetic
opencoven
License:
Add dataset card
Browse files
README.md
ADDED
|
@@ -0,0 +1,151 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: mit
|
| 3 |
+
task_categories:
|
| 4 |
+
- text-generation
|
| 5 |
+
- text2text-generation
|
| 6 |
+
language:
|
| 7 |
+
- en
|
| 8 |
+
tags:
|
| 9 |
+
- narrative-reasoning
|
| 10 |
+
- character-consistency
|
| 11 |
+
- recurrent-depth-transformer
|
| 12 |
+
- story-generation
|
| 13 |
+
- synthetic
|
| 14 |
+
- opencoven
|
| 15 |
+
size_categories:
|
| 16 |
+
- 10K<n<100K
|
| 17 |
+
---
|
| 18 |
+
|
| 19 |
+
# FableForge — Narrative Reasoning Dataset with Recurrence-Depth Annotations
|
| 20 |
+
|
| 21 |
+
**The first narrative dataset designed around recurrence depth requirements.**
|
| 22 |
+
|
| 23 |
+
Every example carries a `suggested_n_loops` field with a theoretically grounded basis —
|
| 24 |
+
derived from the structural complexity of the task, not a heuristic label or emergent property.
|
| 25 |
+
|
| 26 |
+
## Background
|
| 27 |
+
|
| 28 |
+
Standard narrative datasets treat reasoning depth as an emergent property. FableForge is
|
| 29 |
+
different: it annotates *how much computation* each task structurally requires, making it
|
| 30 |
+
suitable for training Recurrent-Depth Transformers (RDTs) where loop count is a controllable
|
| 31 |
+
hyperparameter at inference time.
|
| 32 |
+
|
| 33 |
+
## Task Types
|
| 34 |
+
|
| 35 |
+
### `character_trace`
|
| 36 |
+
Track a named character's state (location, emotion, companions) across N scene transitions.
|
| 37 |
+
|
| 38 |
+
**Recurrence requirement:** `loops = f(n_characters × n_scenes)`
|
| 39 |
+
|
| 40 |
+
More characters over more scenes → more recurrence needed to maintain entity state without drift.
|
| 41 |
+
|
| 42 |
+
### `coherence_challenge`
|
| 43 |
+
Detect and correct a single planted narrative inconsistency.
|
| 44 |
+
|
| 45 |
+
**Recurrence requirement:** `loops = f(inconsistency_type)`
|
| 46 |
+
|
| 47 |
+
Six inconsistency types, ordered by cognitive depth:
|
| 48 |
+
|
| 49 |
+
| Type | Loops | Why |
|
| 50 |
+
|---|---|---|
|
| 51 |
+
| `name_drift` | 4 | Surface pattern match |
|
| 52 |
+
| `location_contradiction` | 8 | Spatial reasoning |
|
| 53 |
+
| `object_continuity` | 8 | Object state tracking |
|
| 54 |
+
| `timeline_error` | 16 | Temporal ordering |
|
| 55 |
+
| `relationship_error` | 16 | Social graph recall |
|
| 56 |
+
| `trait_reversal` | 32 | Character psychology |
|
| 57 |
+
|
| 58 |
+
### `narrative_completion`
|
| 59 |
+
Generate a story continuation that satisfies N explicit constraints simultaneously.
|
| 60 |
+
|
| 61 |
+
**Recurrence requirement:** `loops = f(n_characters × n_constraints)`
|
| 62 |
+
|
| 63 |
+
## Dataset Fields
|
| 64 |
+
|
| 65 |
+
| Field | Type | Description |
|
| 66 |
+
|---|---|---|
|
| 67 |
+
| `id` | string | Unique stable identifier |
|
| 68 |
+
| `task_type` | string | `character_trace` / `coherence_challenge` / `narrative_completion` |
|
| 69 |
+
| `genre` | string | `fantasy` or `contemporary` |
|
| 70 |
+
| `complexity_score` | float | 0–1, derived from task structure |
|
| 71 |
+
| `suggested_n_loops` | int | 4 / 8 / 16 / 32 — recurrence target |
|
| 72 |
+
| `narrative_mode` | string | `action` / `dialogue` / `exposition` |
|
| 73 |
+
| `fable_memory_required` | bool | Whether FableMemory injection is needed |
|
| 74 |
+
| `coherence_probe_targets` | list[str] | Character names to monitor |
|
| 75 |
+
| `messages` | list | `[{"role": "user", "content": ...}, {"role": "assistant", "content": ...}]` |
|
| 76 |
+
| `source` | string | `fable_forge_v1` |
|
| 77 |
+
| `constraint_count` | int | Number of simultaneous constraints |
|
| 78 |
+
| `n_characters` | int | Characters in the task |
|
| 79 |
+
| `n_scenes` | int | Scenes spanned |
|
| 80 |
+
|
| 81 |
+
## Distribution (10k sample)
|
| 82 |
+
|
| 83 |
+
- ~40% character_trace, ~30% coherence_challenge, ~30% narrative_completion
|
| 84 |
+
- ~83% require FableMemory injection
|
| 85 |
+
- Loop distribution: ~12% dialogue (8), ~37% exposition (16), ~51% deep (32)
|
| 86 |
+
- Genres: ~50% fantasy, ~50% contemporary
|
| 87 |
+
- Fully deterministic: `seed=42`
|
| 88 |
+
|
| 89 |
+
## Usage
|
| 90 |
+
|
| 91 |
+
```python
|
| 92 |
+
from datasets import load_dataset
|
| 93 |
+
|
| 94 |
+
ds = load_dataset("OpenCoven/fable-forge-10k", split="train")
|
| 95 |
+
print(ds[0].keys())
|
| 96 |
+
# dict_keys(['id', 'task_type', 'genre', 'complexity_score', 'suggested_n_loops',
|
| 97 |
+
# 'narrative_mode', 'fable_memory_required', 'coherence_probe_targets',
|
| 98 |
+
# 'messages', 'source', 'constraint_count', 'n_characters', 'n_scenes'])
|
| 99 |
+
|
| 100 |
+
# Filter by depth tier
|
| 101 |
+
hard = ds.filter(lambda x: x["suggested_n_loops"] == 32)
|
| 102 |
+
print(f"{len(hard):,} examples require maximum recurrence depth")
|
| 103 |
+
|
| 104 |
+
# Use with OpenFable NarrativeDepthController
|
| 105 |
+
from open_fable.depth import NarrativeDepthController
|
| 106 |
+
ndc = NarrativeDepthController()
|
| 107 |
+
for ex in ds.select(range(5)):
|
| 108 |
+
loops = ndc.get_n_loops(ex["narrative_mode"])
|
| 109 |
+
print(f"{ex['task_type']:25s} suggested={ex['suggested_n_loops']:2d} ndc={loops}")
|
| 110 |
+
```
|
| 111 |
+
|
| 112 |
+
## Generating More Data
|
| 113 |
+
|
| 114 |
+
FableForge is deterministic and open-source. Generate at any scale:
|
| 115 |
+
|
| 116 |
+
```bash
|
| 117 |
+
git clone https://github.com/OpenCoven/open-fable
|
| 118 |
+
cd open-fable
|
| 119 |
+
pip install -e .
|
| 120 |
+
python -m open_fable.data.fable_forge --count 100000 --seed 99 --output data/fable_forge_100k.jsonl
|
| 121 |
+
```
|
| 122 |
+
|
| 123 |
+
## Two-Stage Training Pipeline
|
| 124 |
+
|
| 125 |
+
This dataset is Stage 2 of OpenFable's training pipeline:
|
| 126 |
+
|
| 127 |
+
- **Stage 1:** [WithinUsAI/claude_mythos_distilled_25k](https://huggingface.co/datasets/WithinUsAI/claude_mythos_distilled_25k) bridged via MythosBridge — general deep reasoning
|
| 128 |
+
- **Stage 2:** FableForge — narrative-specific reasoning with loop-depth annotations
|
| 129 |
+
|
| 130 |
+
## Citation
|
| 131 |
+
|
| 132 |
+
```bibtex
|
| 133 |
+
@misc{openfable2026fableforge,
|
| 134 |
+
title = {{FableForge}: A Synthetic Narrative Dataset with Recurrence-Depth Annotations},
|
| 135 |
+
author = {OpenCoven},
|
| 136 |
+
year = {2026},
|
| 137 |
+
url = {https://github.com/OpenCoven/open-fable},
|
| 138 |
+
note = {First dataset designed around recurrence depth requirements for
|
| 139 |
+
narrative reasoning in Recurrent-Depth Transformer architectures.}
|
| 140 |
+
}
|
| 141 |
+
```
|
| 142 |
+
|
| 143 |
+
## License
|
| 144 |
+
|
| 145 |
+
MIT — see [LICENSE](https://github.com/OpenCoven/open-fable/blob/main/LICENSE)
|
| 146 |
+
|
| 147 |
+
## Links
|
| 148 |
+
|
| 149 |
+
- GitHub: [OpenCoven/open-fable](https://github.com/OpenCoven/open-fable)
|
| 150 |
+
- Architecture: [OpenFable README](https://github.com/OpenCoven/open-fable#readme)
|
| 151 |
+
- Dataset card: [datasets/README.md](https://github.com/OpenCoven/open-fable/blob/main/datasets/README.md)
|