The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
Error code: DatasetGenerationError
Exception: ValueError
Message: Expected object or value
Traceback: Traceback (most recent call last):
File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1827, in _prepare_split_single
for key, table in generator:
^^^^^^^^^
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 613, in wrapped
for item in generator(*args, **kwargs):
~~~~~~~~~^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.14/site-packages/datasets/packaged_modules/json/json.py", line 281, in _generate_tables
examples = [ujson_loads(line) for line in batch.splitlines()]
~~~~~~~~~~~^^^^^^
File "/usr/local/lib/python3.14/site-packages/datasets/utils/json.py", line 20, in ujson_loads
return pd.io.json.ujson_loads(*args, **kwargs)
~~~~~~~~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^
ValueError: Expected object or value
The above exception was the direct cause of the following exception:
Traceback (most recent call last):
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1369, in compute_config_parquet_and_info_response
parquet_operations, partial, estimated_dataset_info = stream_convert_to_parquet(
~~~~~~~~~~~~~~~~~~~~~~~~~^
builder, max_dataset_size_bytes=max_dataset_size_bytes
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
)
^
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 948, in stream_convert_to_parquet
builder._prepare_split(split_generator=splits_generators[split], file_format="parquet")
~~~~~~~~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1694, in _prepare_split
for job_id, done, content in self._prepare_split_single(
~~~~~~~~~~~~~~~~~~~~~~~~~~^
gen_kwargs=gen_kwargs, job_id=job_id, **_prepare_split_args
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
):
^
File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1880, in _prepare_split_single
raise DatasetGenerationError("An error occurred while generating the dataset") from e
datasets.exceptions.DatasetGenerationError: An error occurred while generating the datasetNeed help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
sample_id string | analysis dict |
|---|---|
mt_0001 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The multi-view-guidance baseline uses masks to guide a 2D inpainting model that generates c... |
mt_0002 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The GAN-based approach uses feature maps after the 6th block because they provide a good tr... |
mt_0004 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The unified prompt-based system maintains strong zero-shot transfer across unseen prompts a... |
mt_0005 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The frequency-regularized NeRF approach introduces slight blurriness.",
"source_pap... |
mt_0006 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The earlier image-to-token approach trains a three-layer mapping network on 3M CC3M images ... |
mt_0007 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "Across two datasets, retrieval pipelines become 20.62% and 19.21% less effective on average... |
mt_0008 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The full-reconstruction approach computes the absolute difference between an input image an... |
mt_0009 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The text-conditioned pioneer first supervises a static scene with a frozen T2I model.",
... |
mt_0010 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The latent-optimization approach claims strong versatility on real and diffusion-generated ... |
mt_0011 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The earlier Q-Former-based subject method curates prompted-context-generation pairs by extr... |
mt_0012 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The diffusion approach uses a gradual noising-and-denoising process because human motion is... |
mt_0014 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "Clarifying questions are most appropriate shortly after a request.",
"source_paper"... |
mt_0015 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The earlier scalable baseline states that the vast majority of points are background with z... |
mt_0019 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The low-score-box association baseline sets the default detection score threshold to 0.6.",... |
mt_0020 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "Deblur-NeRF argued that a dense K × K blur kernel is infeasible for NeRF because it would r... |
mt_0023 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The tracking-based approach treated the multi-view images as a video sequence with graduall... |
mt_0026 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The standalone realistic web environment concluded that long-horizon tasks remain difficult... |
mt_0027 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "Step-by-step exemplars help mainly on challenging multi-step reasoning tasks.",
"so... |
mt_0032 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The earlier approach creates two stochastic graph views with node dropout, edge dropout, or... |
mt_0035 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The diffusion-based two-stage approach outperforms all other baselines in rate-FID curves o... |
mt_0037 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The earlier adaptation work evaluates four unseen settings: 4 times, 6.25 times, 8 times, a... |
mt_0038 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The manually constructed multi-turn benchmark shows that pairwise GPT-4 judgments can match... |
mt_0040 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "For a 13B language model, the quantized low-rank approach still uses 125.2M trainable param... |
mt_0041 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "In the chess setting, the full-history transformer reaches 97.7% legal-move accuracy on the... |
mt_0043 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The Gaussian-noise feature-synthesis approach adds i.i.d. Gaussian noise with σ = 0.015 to ... |
mt_0045 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The earlier benchmark-setting approach established its advantage mainly in the few-shot FSC... |
mt_0046 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The verifier-guided search approach raises GSM8K accuracy from 42.0 to 60.0 without self-th... |
mt_0047 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The earlier next-best-pose system reports its main benchmark on 8 RLBench tasks that are ac... |
mt_0050 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The prototype-based approach states that its strategy is mainly for facilitation for the sl... |
mt_0052 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The offline method argued that offline datasets are often generated by mixtures of policies... |
mt_0054 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The asymmetric-context feature-fusion approach reports IoU 0.743 on SIRST.",
"sourc... |
mt_0055 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The sensitivity-based post-hoc approach used multiple prune-refine rounds because fine-tuni... |
mt_0057 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The character-aware work argued that common text encoders used in image generation lack suf... |
mt_0058 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The transformer-based approach achieves state-of-the-art on CVUSA and VIGOR.",
"sou... |
mt_0060 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The original low-rank adaptation approach uses a random Gaussian initialization for A and z... |
mt_0061 | {
"query_quality": {
"verdict": "pass",
"natural": true,
"unambiguous": true,
"requires_target": true,
"note": ""
},
"answer_validity": {
"verdict": "pass",
"claims": [
{
"claim": "The behavior-level baseline used paired prompts that differed only in the appended answer l... |
AgentHop
AgentHop is a diagnostic benchmark for multi-step scientific question answering: 1,011 four-option multiple-choice questions grounded in citation chains over 7,205 arXiv papers from nine major computer-science venues (2022–2025). Each question is answerable only by reading specific sections of one or two of these papers; the agent reaches the answer-bearing papers by following references from a given seed paper.
The dataset is paired with a four-axis decomposition framework (search, synthesis, tool-use pattern, resource management) that turns a single evaluation run into per-model failure-mode attribution rather than a single accuracy number.
Dataset Statistics
| Statistic | Value |
|---|---|
| Total items | 1,011 |
| Single-target (ST) | 568 |
| Multi-target (MT) | 443 |
| Source-paper pool | 7,205 papers |
| Source citation edges | >450,000 |
| Source venues | 9 (NeurIPS, ICML, ICLR, ACL, EMNLP, NAACL, CVPR, ECCV, SIGIR) |
| Publication years | 2022–2025 |
| Reasoning-type counts | GROUND 330, RESULT 292, MOTIVE 265, METHOD 124 |
| Consensus tiers | Gold / Silver / Bronze (filter-agreement signal at construction time) |
| Depths | 1-hop and 2-hop |
Files
AgentHop/
├── qa/full.jsonl # 1,011 MCQ items (schema below)
├── graphs/full.jsonl # per-sample citation neighbourhoods (nodes + edges)
├── paper_pool/papers.jsonl # deduplicated section text for the 7,205-paper pool
├── audit/recall_labels.jsonl # auditor-labelled answer-bearing sections per sample
├── loader.py # reference Python loader
├── LICENSE # CC-BY 4.0
└── README.md # this file
Schema (qa/full.jsonl)
Each line is one item.
| Field | Type | Description |
|---|---|---|
id |
string | Item identifier (e.g., st_0001, mt_0042) |
question |
string | The question stem |
options |
list of 4 strings | The four answer options |
correct_index |
int (0–3) | Index of the correct option in options |
question_type |
string | single-target or multi-target (a.k.a. target multiplicity) |
depth |
int | Maximum hop distance from seed to gold paper, 1 or 2 |
reasoning_type |
string | GROUND / METHOD / MOTIVE / RESULT |
cognitive_skill |
string | Construction-stage taxonomy label (e.g., retrieve) |
consensus_tier |
string | gold / silver / bronze — filter agreement at Stages 5–6 |
filter_agreement |
int | Numeric agreement score |
seed_arxiv_id |
string | arXiv ID of the seed paper the agent starts from |
seed_paper_id |
string | Semantic Scholar hash of the seed paper |
seed_title |
string | Seed paper title |
venue |
string | Source venue (e.g., NeurIPS, ICML) |
gold_arxiv_ids |
list of strings | arXiv IDs of the gold papers (1 for ST, 2 for MT) |
gold_paper_ids |
list of strings | Semantic Scholar hashes of the gold papers |
bridge_arxiv_ids |
list of strings | arXiv IDs of intermediate hop papers (depth-2 only) |
bridge_paper_ids |
list of strings | Semantic Scholar hashes of the bridge papers |
distractor_types |
list of strings | Engineered distractor labels: seed_only, wrong_paper, no_context, plus correct |
Schema (graphs/full.jsonl)
Each line is one sample's citation neighbourhood used as the agent's navigation pool.
| Field | Type | Description |
|---|---|---|
sample_id |
string | Matches qa/full.jsonl::id |
seed_paper_id |
string | Semantic Scholar hash of the seed paper |
nodes |
object | {paper_id: {arxivId, title, year, authors, abstract, ...}} |
edges |
object | {paper_id: [cited_paper_ids]} |
Schema (paper_pool/papers.jsonl)
Deduplicated section text for every paper appearing in any sample's citation neighbourhood.
| Field | Type | Description |
|---|---|---|
paper_id |
string | Semantic Scholar hash |
arxiv_id |
string | arXiv ID |
title |
string | |
year |
int | |
authors |
list | |
abstract |
string | |
sections |
list of {header, text} |
Section-structured body, parsed from arXiv via ar5iv |
Schema (audit/recall_labels.jsonl)
Auditor-labelled answer-bearing sections, used by the evaluation harness to compute the search-axis recall metric.
| Field | Type | Description |
|---|---|---|
sample_id |
string | Matches qa/full.jsonl::id |
analysis |
object | {section_recall_labels: [{arxiv_id, section}, ...], answer_validity, chain_coherence, query_quality, structural_integrity, synthesis_check} |
Quick start
from loader import load_agenthop, load_recall_labels
samples = load_agenthop("path/to/AgentHop")
labels = load_recall_labels("path/to/AgentHop")
print(len(samples)) # 1011
print(samples[0]["question"])
print(samples[0]["options"])
print(samples[0]["correct_index"])
print(samples[0]["paper_pool"]) # papers reachable from seed for this sample
print(labels[samples[0]["id"]]["analysis"]["section_recall_labels"])
To evaluate a model end-to-end (with the seven-tool sandbox, four-axis metrics, and resource caps), use the evaluation harness from the code repo (link in the paper supplementary).
Intended Use
AgentHop is a measurement instrument for multi-step QA agents: locate relevant papers via citation following, read the right sections of those papers, combine the resulting evidence, and do so within a deployment-realistic resource budget. The headline accuracy is intended to be paired with the four-axis decomposition (search recall, conversion rate, tool-use pattern, resource management) that the harness produces. Aggregate accuracy alone collapses qualitatively different failure modes into a single number; the per-axis attribution surfaces which sub-ability is binding for each model.
Construction Pipeline
AgentHop is constructed via an eight-stage pipeline: four generation stages (seed selection → citation-chain expansion → corpus collection → Q/A generation → distractor generation) followed by four filtering stages (model-ensemble filtering → data sanity check → seven-auditor human review → post-audit triage). Full details are in the paper's appendix.
Limitations
- Single domain. Computer-science papers from nine major venues (2022–2025). Behaviour on other fields, on long-tail venues, and on open-ended response formats is not measured.
- Multiple-choice format. Each item is a four-option MCQ, not a free-form generation task.
- English-language source corpus. All papers and questions are in English.
- Generator–evaluator overlap. GPT-5.4 generated the items and is also among the evaluated models. The effect is bounded but real and acknowledged in the paper's Limitations section.
- Parametric coverage. The strongest checkpoints already resolve a substantial fraction of items closed-book (Gemini-3 Pro reaches 0.734 without tools); the four-axis decomposition is most informative where parametric coverage is sparse.
Ethical Considerations
- Built from public arXiv papers under their respective deposit licenses. We use only paper identifiers, abstracts, and named-section text; we do not reproduce figures, tables, or any non-textual content.
- No personal information, no harmful or offensive content, and no generative model weights are released.
- Seven auditors (members of the research team, participating voluntarily) reviewed audit-prep items during the construction pipeline. No external paid annotation was conducted; no personal information of auditors is collected or released.
Citation
@inproceedings{park2026agenthop,
title = {AgentHop: A Diagnostic Benchmark for Multi-Step Scientific Question Answering},
author = {Park, Chanhee and Yoon, Jeongho and Han, Sungbin and Moon, Hyeonseok and Lim, Heuiseok},
booktitle = {Advances in Neural Information Processing Systems (NeurIPS), Datasets and Benchmarks Track},
year = {2026}
}
- Downloads last month
- 43