dorsal/arxiv
View SchemaKinship Data Benchmark for Multi-hop Reasoning
| Authors | Tianda Sun, Dimitar Kazakov |
|---|---|
| Categories | |
| ArXiv ID | 2601.07794vv1 |
| URL | https://arxiv.org/abs/2601.07794 |
| License | http://creativecommons.org/licenses/by-nc-sa/4.0/ |
Abstract
Large language models (LLMs) are increasingly evaluated on their ability to perform multi-hop reasoning, i.e., to combine multiple pieces of information into a coherent inference. We introduce KinshipQA, a benchmark designed to probe this capability through reasoning over kinship relations. The central contribution of our work is a generative pipeline that produces, on demand, large-scale, realistic, and culture-specific genealogical data: collections of interconnected family trees that satisfy explicit marriage constraints associated with different kinship systems. This allows task difficulty, cultural assumptions, and relational depth to be systematically controlled and varied. From these genealogies, we derive textual inference tasks that require reasoning over implicit relational chains. We evaluate the resulting benchmark using six state-of-the-art LLMs, spanning both open-source and closed-source models, under a uniform zero-shot protocol with deterministic decoding. Performance is measured using exact-match and set-based metrics. Our results demonstrate that KinshipQA yields a wide spread of outcomes and exposes systematic differences in multi-hop reasoning across models and cultural settings.
{
"annotation_id": "bf25a0b1-fa40-41f9-8930-682333ed1aa4",
"date_created": "2026-02-17T05:53:11.671000Z",
"date_modified": "2026-02-17T05:53:11.671000Z",
"file_hash": "7aafe9e8121e8b942f93ce4eb2cdc4a75b5230096377b4eb6118759705af3319",
"private": false,
"record": {
"abstract": "Large language models (LLMs) are increasingly evaluated on their ability to perform multi-hop reasoning, i.e., to combine multiple pieces of information into a coherent inference. We introduce KinshipQA, a benchmark designed to probe this capability through reasoning over kinship relations. The central contribution of our work is a generative pipeline that produces, on demand, large-scale, realistic, and culture-specific genealogical data: collections of interconnected family trees that satisfy explicit marriage constraints associated with different kinship systems. This allows task difficulty, cultural assumptions, and relational depth to be systematically controlled and varied. From these genealogies, we derive textual inference tasks that require reasoning over implicit relational chains. We evaluate the resulting benchmark using six state-of-the-art LLMs, spanning both open-source and closed-source models, under a uniform zero-shot protocol with deterministic decoding. Performance is measured using exact-match and set-based metrics. Our results demonstrate that KinshipQA yields a wide spread of outcomes and exposes systematic differences in multi-hop reasoning across models and cultural settings.",
"arxiv_id": "2601.07794",
"authors": [
"Tianda Sun",
"Dimitar Kazakov"
],
"categories": [
"cs.CL",
"cs.AI"
],
"license": "http://creativecommons.org/licenses/by-nc-sa/4.0/",
"title": "Kinship Data Benchmark for Multi-hop Reasoning",
"url": "https://arxiv.org/abs/2601.07794",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "3efe270c-f76f-4624-a47c-b3902afd7137",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}