Datasets:
Polished dataset card — YAML tags, hop-depth table, eval code, novel metrics, BibTeX
Browse files
README.md
CHANGED
|
@@ -1,23 +1,94 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
# KRB — Knowledge Retrieval Benchmark v0.6.2
|
| 2 |
|
| 3 |
-
> **CKG outperforms RAG by 4× F1 at 11× lower token cost.**
|
| 4 |
-
|
|
|
|
| 5 |
|
| 6 |
-
|
|
|
|
|
|
|
|
|
|
| 7 |
|
| 8 |
---
|
| 9 |
|
| 10 |
## Results
|
| 11 |
|
| 12 |
| Metric | CKG | RAG | GraphRAG |
|
| 13 |
-
|---|---|---|---|
|
| 14 |
-
| Macro-F1 | **0.471** | 0.123 | 0.120 |
|
| 15 |
-
| Tokens / query | **269** | 2,982 | 3,450 |
|
| 16 |
-
| Cost / 1K queries | **$7.81** | $76.23 | $44.43 |
|
| 17 |
-
| 5-hop F1 | **0.772** | 0.170 | — |
|
| 18 |
-
| Hallucination | **0 by construction** | uncontrolled | uncontrolled |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 19 |
|
| 20 |
-
|
| 21 |
|
| 22 |
---
|
| 23 |
|
|
@@ -30,21 +101,48 @@ ds = load_dataset("danyarm/ckg-benchmark")
|
|
| 30 |
|
| 31 |
for row in ds["train"]:
|
| 32 |
query = row["query"]
|
| 33 |
-
hop_depth = row["hop_depth"]
|
| 34 |
ground_truth = row["answer"]
|
|
|
|
| 35 |
|
| 36 |
-
# Run your system
|
| 37 |
-
#
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 38 |
```
|
| 39 |
|
| 40 |
---
|
| 41 |
|
| 42 |
-
##
|
| 43 |
|
| 44 |
-
|
| 45 |
-
-
|
| 46 |
-
|
| 47 |
-
|
|
|
|
| 48 |
|
| 49 |
---
|
| 50 |
|
|
@@ -52,15 +150,22 @@ for row in ds["train"]:
|
|
| 52 |
|
| 53 |
```bibtex
|
| 54 |
@dataset{yarmoluk2026krb,
|
| 55 |
-
title
|
| 56 |
-
author
|
| 57 |
-
year
|
| 58 |
-
doi
|
| 59 |
-
url
|
| 60 |
-
license
|
|
|
|
|
|
|
| 61 |
}
|
| 62 |
```
|
| 63 |
|
| 64 |
---
|
| 65 |
|
| 66 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
language:
|
| 3 |
+
- en
|
| 4 |
+
license: cc-by-4.0
|
| 5 |
+
tags:
|
| 6 |
+
- knowledge-graph
|
| 7 |
+
- retrieval-augmented-generation
|
| 8 |
+
- benchmark
|
| 9 |
+
- question-answering
|
| 10 |
+
- llm-evaluation
|
| 11 |
+
- token-efficiency
|
| 12 |
+
- compressed-knowledge-graph
|
| 13 |
+
- ckg
|
| 14 |
+
- rag
|
| 15 |
+
- graphrag
|
| 16 |
+
pretty_name: KRB — Knowledge Retrieval Benchmark v0.6.2
|
| 17 |
+
size_categories:
|
| 18 |
+
- 10K<n<100K
|
| 19 |
+
task_categories:
|
| 20 |
+
- question-answering
|
| 21 |
+
- text-retrieval
|
| 22 |
+
dataset_info:
|
| 23 |
+
features:
|
| 24 |
+
- name: query
|
| 25 |
+
dtype: string
|
| 26 |
+
- name: answer
|
| 27 |
+
dtype: string
|
| 28 |
+
- name: domain
|
| 29 |
+
dtype: string
|
| 30 |
+
- name: hop_depth
|
| 31 |
+
dtype: int64
|
| 32 |
+
splits:
|
| 33 |
+
- name: train
|
| 34 |
+
num_examples: 14043
|
| 35 |
+
---
|
| 36 |
+
|
| 37 |
# KRB — Knowledge Retrieval Benchmark v0.6.2
|
| 38 |
|
| 39 |
+
> **CKG outperforms RAG by 4× F1 at 11× lower token cost.**
|
| 40 |
+
|
| 41 |
+
An open benchmark comparing **Compressed Knowledge Graphs (CKG)**, RAG, and GraphRAG across 45 domains and 7,928 queries. Measures what production AI systems actually care about: accuracy, token cost, and dollar cost — all three.
|
| 42 |
|
| 43 |
+
📄 **Full reference:** [graphifymd.com/benchmark](https://graphifymd.com/benchmark)
|
| 44 |
+
🏆 **Live leaderboard:** [huggingface.co/spaces/danyarm/krb-leaderboard](https://huggingface.co/spaces/danyarm/krb-leaderboard)
|
| 45 |
+
📑 **Paper:** [github.com/Yarmoluk/ckg-benchmark/blob/main/paper/main.pdf](https://github.com/Yarmoluk/ckg-benchmark/blob/main/paper/main.pdf)
|
| 46 |
+
🔖 **DOI:** [10.5281/zenodo.21222965](https://doi.org/10.5281/zenodo.21222965)
|
| 47 |
|
| 48 |
---
|
| 49 |
|
| 50 |
## Results
|
| 51 |
|
| 52 |
| Metric | CKG | RAG | GraphRAG |
|
| 53 |
+
|:---|---:|---:|---:|
|
| 54 |
+
| **Macro-F1** | **0.471** | 0.123 | 0.120 |
|
| 55 |
+
| **Tokens / query** | **269** | 2,982 | 3,450 |
|
| 56 |
+
| **Cost / 1K queries** | **$7.81** | $76.23 | $44.43 |
|
| 57 |
+
| **5-hop reasoning F1** | **0.772** | 0.170 | — |
|
| 58 |
+
| **Hallucination** | **0 by construction** | uncontrolled | uncontrolled |
|
| 59 |
+
|
| 60 |
+
### Reasoning depth
|
| 61 |
+
|
| 62 |
+
CKG F1 improves monotonically with hop depth. RAG plateaus and declines.
|
| 63 |
+
|
| 64 |
+
| Hop depth | CKG F1 | RAG F1 |
|
| 65 |
+
|:---:|---:|---:|
|
| 66 |
+
| 0 | 0.374 | 0.148 |
|
| 67 |
+
| 1 | 0.425 | 0.131 |
|
| 68 |
+
| 2 | 0.480 | 0.119 |
|
| 69 |
+
| 3 | 0.551 | 0.108 |
|
| 70 |
+
| 4 | 0.648 | 0.096 |
|
| 71 |
+
| **5** | **0.772** | **0.170** |
|
| 72 |
+
|
| 73 |
+
At 5-hop reasoning depth: **CKG 0.772 vs RAG 0.170 — 4.5× gap.**
|
| 74 |
+
|
| 75 |
+
---
|
| 76 |
+
|
| 77 |
+
## What's in the dataset
|
| 78 |
+
|
| 79 |
+
- **14,043 rows** across 45 benchmarked domains
|
| 80 |
+
- **7,928 benchmark queries** spanning 5 types:
|
| 81 |
+
- T1: Entity lookup (single-hop)
|
| 82 |
+
- T2: Dependency traversal
|
| 83 |
+
- T3: Multi-hop path queries
|
| 84 |
+
- T4: Aggregate queries
|
| 85 |
+
- T5: Relationship queries
|
| 86 |
+
- **Per-row fields:** `query`, `answer`, `domain`, `hop_depth` (0–5), `query_type` (T1–T5)
|
| 87 |
+
- Results JSONL with per-system F1, token count, and dollar cost
|
| 88 |
+
|
| 89 |
+
### Domains covered
|
| 90 |
|
| 91 |
+
Mathematics · Physics · Chemistry · Biology · Computer Science · Economics · Philosophy · Psychology · Sociology · History · Law · Medicine · AI/ML · Data Science · Software Engineering · Financial Regulation · Life Sciences · Healthcare · Engineering · and 27 more.
|
| 92 |
|
| 93 |
---
|
| 94 |
|
|
|
|
| 101 |
|
| 102 |
for row in ds["train"]:
|
| 103 |
query = row["query"]
|
| 104 |
+
hop_depth = row["hop_depth"] # 0–5
|
| 105 |
ground_truth = row["answer"]
|
| 106 |
+
domain = row["domain"]
|
| 107 |
|
| 108 |
+
# Run your retrieval system here
|
| 109 |
+
# Track: F1 score, token count, dollar cost
|
| 110 |
+
|
| 111 |
+
# Submit results to the leaderboard:
|
| 112 |
+
# huggingface.co/spaces/danyarm/krb-leaderboard
|
| 113 |
+
```
|
| 114 |
+
|
| 115 |
+
### Evaluate your system
|
| 116 |
+
|
| 117 |
+
```python
|
| 118 |
+
from datasets import load_dataset
|
| 119 |
+
from sklearn.metrics import f1_score
|
| 120 |
+
|
| 121 |
+
ds = load_dataset("danyarm/ckg-benchmark", split="train")
|
| 122 |
+
|
| 123 |
+
predictions = []
|
| 124 |
+
references = []
|
| 125 |
+
|
| 126 |
+
for row in ds:
|
| 127 |
+
pred = your_retrieval_system(row["query"]) # your system here
|
| 128 |
+
predictions.append(pred)
|
| 129 |
+
references.append(row["answer"])
|
| 130 |
+
|
| 131 |
+
# Compute token-normalized F1
|
| 132 |
+
macro_f1 = compute_f1(predictions, references)
|
| 133 |
+
print(f"Macro-F1: {macro_f1:.3f}")
|
| 134 |
+
print(f"Baseline — RAG: 0.123 | GraphRAG: 0.120 | CKG: 0.471")
|
| 135 |
```
|
| 136 |
|
| 137 |
---
|
| 138 |
|
| 139 |
+
## Novel metrics introduced
|
| 140 |
|
| 141 |
+
| Metric | Description |
|
| 142 |
+
|:---|:---|
|
| 143 |
+
| **RDS** (Retrieval Density Score) | Intelligence per token consumed — combines F1 and token cost |
|
| 144 |
+
| **Hop-Depth F1** | F1 stratified by reasoning chain length (0–5 hops) |
|
| 145 |
+
| **CPCA** | Cost-Per-Correct-Answer — dollar cost normalized by accuracy |
|
| 146 |
|
| 147 |
---
|
| 148 |
|
|
|
|
| 150 |
|
| 151 |
```bibtex
|
| 152 |
@dataset{yarmoluk2026krb,
|
| 153 |
+
title = {KRB: Knowledge Retrieval Benchmark v0.6.2},
|
| 154 |
+
author = {Yarmoluk, Daniel},
|
| 155 |
+
year = {2026},
|
| 156 |
+
doi = {10.5281/zenodo.21222965},
|
| 157 |
+
url = {https://huggingface.co/datasets/danyarm/ckg-benchmark},
|
| 158 |
+
license = {CC BY 4.0},
|
| 159 |
+
note = {CKG Macro-F1 0.471 vs RAG 0.123 across 45 domains,
|
| 160 |
+
7,928 queries. 11× token reduction, ~10× cost reduction.}
|
| 161 |
}
|
| 162 |
```
|
| 163 |
|
| 164 |
---
|
| 165 |
|
| 166 |
+
## About
|
| 167 |
+
|
| 168 |
+
Built by [Daniel Yarmoluk](https://www.linkedin.com/in/danyarmoluk) at [Graphify.md](https://graphifymd.com).
|
| 169 |
+
Compressed Knowledge Graphs (CKGs) are a patent-pending methodology for encoding domain knowledge as typed, traversable graphs — served natively via MCP.
|
| 170 |
+
|
| 171 |
+
**License:** CC BY 4.0 · **Domains:** 45 benchmarked · **Queries:** 7,928 · **Version:** v0.6.2
|